172.54/109.70 YES 172.54/109.70 172.54/109.70 Ultimate: Cannot open display: 172.54/109.70 This is Ultimate 0.1.24-8dc7c08-m 172.54/109.70 [2019-03-28 12:35:00,663 INFO L170 SettingsManager]: Resetting all preferences to default values... 172.54/109.70 [2019-03-28 12:35:00,665 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values 172.54/109.70 [2019-03-28 12:35:00,677 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... 172.54/109.70 [2019-03-28 12:35:00,677 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values 172.54/109.70 [2019-03-28 12:35:00,678 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values 172.54/109.70 [2019-03-28 12:35:00,679 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values 172.54/109.70 [2019-03-28 12:35:00,681 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values 172.54/109.70 [2019-03-28 12:35:00,682 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values 172.54/109.70 [2019-03-28 12:35:00,683 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values 172.54/109.70 [2019-03-28 12:35:00,684 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... 172.54/109.70 [2019-03-28 12:35:00,684 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values 172.54/109.70 [2019-03-28 12:35:00,685 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values 172.54/109.70 [2019-03-28 12:35:00,686 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values 172.54/109.70 [2019-03-28 12:35:00,687 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values 172.54/109.70 [2019-03-28 12:35:00,688 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values 172.54/109.70 [2019-03-28 12:35:00,689 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values 172.54/109.70 [2019-03-28 12:35:00,690 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values 172.54/109.70 [2019-03-28 12:35:00,692 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values 172.54/109.70 [2019-03-28 12:35:00,694 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values 172.54/109.70 [2019-03-28 12:35:00,695 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values 172.54/109.70 [2019-03-28 12:35:00,696 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values 172.54/109.70 [2019-03-28 12:35:00,698 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... 172.54/109.70 [2019-03-28 12:35:00,699 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... 172.54/109.70 [2019-03-28 12:35:00,699 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values 172.54/109.70 [2019-03-28 12:35:00,700 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values 172.54/109.70 [2019-03-28 12:35:00,700 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values 172.54/109.70 [2019-03-28 12:35:00,701 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... 172.54/109.70 [2019-03-28 12:35:00,701 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values 172.54/109.70 [2019-03-28 12:35:00,702 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values 172.54/109.70 [2019-03-28 12:35:00,703 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values 172.54/109.70 [2019-03-28 12:35:00,703 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values 172.54/109.70 [2019-03-28 12:35:00,704 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... 172.54/109.70 [2019-03-28 12:35:00,705 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values 172.54/109.70 [2019-03-28 12:35:00,705 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... 172.54/109.70 [2019-03-28 12:35:00,705 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... 172.54/109.70 [2019-03-28 12:35:00,706 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values 172.54/109.70 [2019-03-28 12:35:00,707 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values 172.54/109.70 [2019-03-28 12:35:00,707 INFO L181 SettingsManager]: Finished resetting all preferences to default values... 172.54/109.70 [2019-03-28 12:35:00,708 INFO L98 SettingsManager]: Beginning loading settings from /export/starexec/sandbox/solver/bin/./../termcomp2017.epf 172.54/109.70 [2019-03-28 12:35:00,723 INFO L110 SettingsManager]: Loading preferences was successful 172.54/109.70 [2019-03-28 12:35:00,723 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: 172.54/109.70 [2019-03-28 12:35:00,724 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: 172.54/109.70 [2019-03-28 12:35:00,724 INFO L133 SettingsManager]: * Rewrite not-equals=true 172.54/109.70 [2019-03-28 12:35:00,724 INFO L133 SettingsManager]: * Create parallel compositions if possible=false 172.54/109.70 [2019-03-28 12:35:00,724 INFO L133 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE 172.54/109.70 [2019-03-28 12:35:00,725 INFO L133 SettingsManager]: * Use SBE=true 172.54/109.70 [2019-03-28 12:35:00,725 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: 172.54/109.70 [2019-03-28 12:35:00,725 INFO L133 SettingsManager]: * Use old map elimination=false 172.54/109.70 [2019-03-28 12:35:00,725 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false 172.54/109.70 [2019-03-28 12:35:00,725 INFO L133 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION 172.54/109.70 [2019-03-28 12:35:00,726 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true 172.54/109.70 [2019-03-28 12:35:00,726 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES 172.54/109.70 [2019-03-28 12:35:00,726 INFO L133 SettingsManager]: * Construct termination proof for TermComp=true 172.54/109.70 [2019-03-28 12:35:00,726 INFO L133 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 172.54/109.70 [2019-03-28 12:35:00,726 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: 172.54/109.70 [2019-03-28 12:35:00,726 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false 172.54/109.70 [2019-03-28 12:35:00,727 INFO L133 SettingsManager]: * Check division by zero=IGNORE 172.54/109.70 [2019-03-28 12:35:00,727 INFO L133 SettingsManager]: * Check if freed pointer was valid=false 172.54/109.70 [2019-03-28 12:35:00,727 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false 172.54/109.70 [2019-03-28 12:35:00,727 INFO L133 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE 172.54/109.70 [2019-03-28 12:35:00,727 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: 172.54/109.70 [2019-03-28 12:35:00,727 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements 172.54/109.70 [2019-03-28 12:35:00,728 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump 172.54/109.70 [2019-03-28 12:35:00,728 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 172.54/109.70 [2019-03-28 12:35:00,728 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: 172.54/109.70 [2019-03-28 12:35:00,728 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles 172.54/109.70 [2019-03-28 12:35:00,728 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL 172.54/109.70 [2019-03-28 12:35:00,728 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 172.54/109.70 [2019-03-28 12:35:00,755 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp 172.54/109.70 [2019-03-28 12:35:00,768 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized 172.54/109.70 [2019-03-28 12:35:00,772 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. 172.54/109.70 [2019-03-28 12:35:00,773 INFO L271 PluginConnector]: Initializing CDTParser... 172.54/109.70 [2019-03-28 12:35:00,773 INFO L276 PluginConnector]: CDTParser initialized 172.54/109.70 [2019-03-28 12:35:00,774 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox/benchmark/theBenchmark.c 172.54/109.70 [2019-03-28 12:35:00,845 INFO L221 CDTParser]: Created temporary CDT project at /export/starexec/sandbox/tmp/7902d6c1fd7b475a888cb3c5c27b5a28/FLAGc6bf14f91 172.54/109.70 [2019-03-28 12:35:01,184 INFO L307 CDTParser]: Found 1 translation units. 172.54/109.70 [2019-03-28 12:35:01,184 INFO L161 CDTParser]: Scanning /export/starexec/sandbox/benchmark/theBenchmark.c 172.54/109.70 [2019-03-28 12:35:01,185 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. 172.54/109.70 [2019-03-28 12:35:01,191 INFO L355 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox/tmp/7902d6c1fd7b475a888cb3c5c27b5a28/FLAGc6bf14f91 172.54/109.70 [2019-03-28 12:35:01,581 INFO L363 CDTParser]: Successfully deleted /export/starexec/sandbox/tmp/7902d6c1fd7b475a888cb3c5c27b5a28 172.54/109.70 [2019-03-28 12:35:01,592 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### 172.54/109.70 [2019-03-28 12:35:01,594 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. 172.54/109.70 [2019-03-28 12:35:01,595 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- 172.54/109.70 [2019-03-28 12:35:01,595 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... 172.54/109.70 [2019-03-28 12:35:01,599 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized 172.54/109.70 [2019-03-28 12:35:01,599 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 12:35:01" (1/1) ... 172.54/109.70 [2019-03-28 12:35:01,603 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1096bb8a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:35:01, skipping insertion in model container 172.54/109.70 [2019-03-28 12:35:01,603 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 12:35:01" (1/1) ... 172.54/109.70 [2019-03-28 12:35:01,611 INFO L145 MainTranslator]: Starting translation in SV-COMP mode 172.54/109.70 [2019-03-28 12:35:01,630 INFO L176 MainTranslator]: Built tables and reachable declarations 172.54/109.70 [2019-03-28 12:35:01,801 INFO L206 PostProcessor]: Analyzing one entry point: main 172.54/109.70 [2019-03-28 12:35:01,814 INFO L191 MainTranslator]: Completed pre-run 172.54/109.70 [2019-03-28 12:35:01,906 INFO L206 PostProcessor]: Analyzing one entry point: main 172.54/109.70 [2019-03-28 12:35:01,923 INFO L195 MainTranslator]: Completed translation 172.54/109.70 [2019-03-28 12:35:01,923 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:35:01 WrapperNode 172.54/109.70 [2019-03-28 12:35:01,924 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- 172.54/109.70 [2019-03-28 12:35:01,924 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- 172.54/109.70 [2019-03-28 12:35:01,925 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... 172.54/109.70 [2019-03-28 12:35:01,925 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized 172.54/109.70 [2019-03-28 12:35:01,937 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:35:01" (1/1) ... 172.54/109.70 [2019-03-28 12:35:01,946 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:35:01" (1/1) ... 172.54/109.70 [2019-03-28 12:35:01,970 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- 172.54/109.70 [2019-03-28 12:35:01,971 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- 172.54/109.70 [2019-03-28 12:35:01,971 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... 172.54/109.70 [2019-03-28 12:35:01,971 INFO L276 PluginConnector]: Boogie Preprocessor initialized 172.54/109.70 [2019-03-28 12:35:01,981 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:35:01" (1/1) ... 172.54/109.70 [2019-03-28 12:35:01,982 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:35:01" (1/1) ... 172.54/109.70 [2019-03-28 12:35:01,984 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:35:01" (1/1) ... 172.54/109.70 [2019-03-28 12:35:01,984 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:35:01" (1/1) ... 172.54/109.70 [2019-03-28 12:35:01,990 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:35:01" (1/1) ... 172.54/109.70 [2019-03-28 12:35:01,996 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:35:01" (1/1) ... 172.54/109.70 [2019-03-28 12:35:01,997 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:35:01" (1/1) ... 172.54/109.70 [2019-03-28 12:35:02,000 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- 172.54/109.70 [2019-03-28 12:35:02,000 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- 172.54/109.70 [2019-03-28 12:35:02,001 INFO L271 PluginConnector]: Initializing RCFGBuilder... 172.54/109.70 [2019-03-28 12:35:02,001 INFO L276 PluginConnector]: RCFGBuilder initialized 172.54/109.70 [2019-03-28 12:35:02,002 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:35:01" (1/1) ... 172.54/109.70 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 172.54/109.70 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) 172.54/109.70 Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 172.54/109.70 [2019-03-28 12:35:02,070 INFO L130 BoogieDeclarations]: Found specification of procedure write~int 172.54/109.70 [2019-03-28 12:35:02,070 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start 172.54/109.70 [2019-03-28 12:35:02,070 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start 172.54/109.70 [2019-03-28 12:35:02,070 INFO L130 BoogieDeclarations]: Found specification of procedure read~int 172.54/109.70 [2019-03-28 12:35:02,070 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack 172.54/109.70 [2019-03-28 12:35:02,070 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc 172.54/109.70 [2019-03-28 12:35:02,356 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) 172.54/109.70 [2019-03-28 12:35:02,356 INFO L286 CfgBuilder]: Removed 8 assue(true) statements. 172.54/109.70 [2019-03-28 12:35:02,358 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:35:02 BoogieIcfgContainer 172.54/109.70 [2019-03-28 12:35:02,358 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- 172.54/109.70 [2019-03-28 12:35:02,359 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- 172.54/109.70 [2019-03-28 12:35:02,359 INFO L271 PluginConnector]: Initializing BlockEncodingV2... 172.54/109.70 [2019-03-28 12:35:02,361 INFO L276 PluginConnector]: BlockEncodingV2 initialized 172.54/109.70 [2019-03-28 12:35:02,362 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:35:02" (1/1) ... 172.54/109.70 [2019-03-28 12:35:02,383 INFO L313 BlockEncoder]: Initial Icfg 38 locations, 45 edges 172.54/109.70 [2019-03-28 12:35:02,385 INFO L258 BlockEncoder]: Using Remove infeasible edges 172.54/109.70 [2019-03-28 12:35:02,385 INFO L263 BlockEncoder]: Using Maximize final states 172.54/109.70 [2019-03-28 12:35:02,386 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false 172.54/109.70 [2019-03-28 12:35:02,386 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE 172.54/109.70 [2019-03-28 12:35:02,388 INFO L296 BlockEncoder]: Using Remove sink states 172.54/109.70 [2019-03-28 12:35:02,389 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true 172.54/109.70 [2019-03-28 12:35:02,389 INFO L179 BlockEncoder]: Using Rewrite not-equals 172.54/109.70 [2019-03-28 12:35:02,416 INFO L185 BlockEncoder]: Using Use SBE 172.54/109.70 [2019-03-28 12:35:02,450 INFO L200 BlockEncoder]: SBE split 19 edges 172.54/109.70 [2019-03-28 12:35:02,455 INFO L70 emoveInfeasibleEdges]: Removed 2 edges and 0 locations because of local infeasibility 172.54/109.70 [2019-03-28 12:35:02,457 INFO L71 MaximizeFinalStates]: 0 new accepting states 172.54/109.70 [2019-03-28 12:35:02,476 INFO L100 BaseMinimizeStates]: Removed 10 edges and 5 locations by large block encoding 172.54/109.70 [2019-03-28 12:35:02,479 INFO L70 RemoveSinkStates]: Removed 3 edges and 2 locations by removing sink states 172.54/109.70 [2019-03-28 12:35:02,480 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility 172.54/109.70 [2019-03-28 12:35:02,481 INFO L71 MaximizeFinalStates]: 0 new accepting states 172.54/109.70 [2019-03-28 12:35:02,481 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding 172.54/109.70 [2019-03-28 12:35:02,482 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states 172.54/109.70 [2019-03-28 12:35:02,482 INFO L313 BlockEncoder]: Encoded RCFG 31 locations, 58 edges 172.54/109.70 [2019-03-28 12:35:02,483 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:35:02 BasicIcfg 172.54/109.70 [2019-03-28 12:35:02,483 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- 172.54/109.70 [2019-03-28 12:35:02,484 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- 172.54/109.70 [2019-03-28 12:35:02,484 INFO L271 PluginConnector]: Initializing TraceAbstraction... 172.54/109.70 [2019-03-28 12:35:02,487 INFO L276 PluginConnector]: TraceAbstraction initialized 172.54/109.70 [2019-03-28 12:35:02,487 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.03 12:35:01" (1/4) ... 172.54/109.70 [2019-03-28 12:35:02,488 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36ade117 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 12:35:02, skipping insertion in model container 172.54/109.70 [2019-03-28 12:35:02,490 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:35:01" (2/4) ... 172.54/109.70 [2019-03-28 12:35:02,490 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36ade117 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 12:35:02, skipping insertion in model container 172.54/109.70 [2019-03-28 12:35:02,490 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:35:02" (3/4) ... 172.54/109.70 [2019-03-28 12:35:02,491 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36ade117 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:35:02, skipping insertion in model container 172.54/109.70 [2019-03-28 12:35:02,491 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:35:02" (4/4) ... 172.54/109.70 [2019-03-28 12:35:02,492 INFO L112 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 172.54/109.70 [2019-03-28 12:35:02,502 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION 172.54/109.70 [2019-03-28 12:35:02,510 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 14 error locations. 172.54/109.70 [2019-03-28 12:35:02,528 INFO L257 AbstractCegarLoop]: Starting to check reachability of 14 error locations. 172.54/109.70 [2019-03-28 12:35:02,557 INFO L133 ementStrategyFactory]: Using default assertion order modulation 172.54/109.70 [2019-03-28 12:35:02,557 INFO L382 AbstractCegarLoop]: Interprodecural is true 172.54/109.70 [2019-03-28 12:35:02,558 INFO L383 AbstractCegarLoop]: Hoare is true 172.54/109.70 [2019-03-28 12:35:02,558 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates 172.54/109.70 [2019-03-28 12:35:02,558 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE 172.54/109.70 [2019-03-28 12:35:02,558 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION 172.54/109.70 [2019-03-28 12:35:02,558 INFO L387 AbstractCegarLoop]: Difference is false 172.54/109.70 [2019-03-28 12:35:02,558 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA 172.54/109.70 [2019-03-28 12:35:02,559 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== 172.54/109.70 [2019-03-28 12:35:02,574 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states. 172.54/109.70 [2019-03-28 12:35:02,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 172.54/109.70 [2019-03-28 12:35:02,580 INFO L394 BasicCegarLoop]: Found error trace 172.54/109.70 [2019-03-28 12:35:02,581 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] 172.54/109.70 [2019-03-28 12:35:02,581 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION]=== 172.54/109.70 [2019-03-28 12:35:02,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 172.54/109.70 [2019-03-28 12:35:02,587 INFO L82 PathProgramCache]: Analyzing trace with hash 206958941, now seen corresponding path program 1 times 172.54/109.70 [2019-03-28 12:35:02,589 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 172.54/109.70 [2019-03-28 12:35:02,589 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 172.54/109.70 [2019-03-28 12:35:02,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 172.54/109.70 [2019-03-28 12:35:02,643 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 172.54/109.70 [2019-03-28 12:35:02,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 172.54/109.70 [2019-03-28 12:35:02,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 172.54/109.70 [2019-03-28 12:35:02,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 172.54/109.70 [2019-03-28 12:35:02,776 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 172.54/109.70 [2019-03-28 12:35:02,776 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 172.54/109.70 [2019-03-28 12:35:02,780 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 172.54/109.70 [2019-03-28 12:35:02,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 172.54/109.70 [2019-03-28 12:35:02,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 172.54/109.70 [2019-03-28 12:35:02,797 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 3 states. 172.54/109.70 [2019-03-28 12:35:02,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 172.54/109.70 [2019-03-28 12:35:02,953 INFO L93 Difference]: Finished difference Result 31 states and 58 transitions. 172.54/109.70 [2019-03-28 12:35:02,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 172.54/109.70 [2019-03-28 12:35:02,955 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 172.54/109.70 [2019-03-28 12:35:02,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 172.54/109.70 [2019-03-28 12:35:02,969 INFO L225 Difference]: With dead ends: 31 172.54/109.70 [2019-03-28 12:35:02,969 INFO L226 Difference]: Without dead ends: 30 172.54/109.70 [2019-03-28 12:35:02,973 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 172.54/109.70 [2019-03-28 12:35:02,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. 172.54/109.70 [2019-03-28 12:35:03,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. 172.54/109.70 [2019-03-28 12:35:03,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. 172.54/109.70 [2019-03-28 12:35:03,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 56 transitions. 172.54/109.70 [2019-03-28 12:35:03,014 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 56 transitions. Word has length 5 172.54/109.70 [2019-03-28 12:35:03,015 INFO L84 Accepts]: Finished accepts. word is rejected. 172.54/109.70 [2019-03-28 12:35:03,016 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 56 transitions. 172.54/109.70 [2019-03-28 12:35:03,016 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 172.54/109.70 [2019-03-28 12:35:03,016 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 56 transitions. 172.54/109.70 [2019-03-28 12:35:03,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 172.54/109.70 [2019-03-28 12:35:03,016 INFO L394 BasicCegarLoop]: Found error trace 172.54/109.70 [2019-03-28 12:35:03,017 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] 172.54/109.70 [2019-03-28 12:35:03,017 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION]=== 172.54/109.70 [2019-03-28 12:35:03,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 172.54/109.70 [2019-03-28 12:35:03,017 INFO L82 PathProgramCache]: Analyzing trace with hash 206958943, now seen corresponding path program 1 times 172.54/109.70 [2019-03-28 12:35:03,018 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 172.54/109.70 [2019-03-28 12:35:03,018 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 172.54/109.70 [2019-03-28 12:35:03,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 172.54/109.70 [2019-03-28 12:35:03,019 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 172.54/109.70 [2019-03-28 12:35:03,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 172.54/109.70 [2019-03-28 12:35:03,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 172.54/109.70 [2019-03-28 12:35:03,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 172.54/109.70 [2019-03-28 12:35:03,058 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 172.54/109.70 [2019-03-28 12:35:03,058 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 172.54/109.70 [2019-03-28 12:35:03,059 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states 172.54/109.70 [2019-03-28 12:35:03,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. 172.54/109.70 [2019-03-28 12:35:03,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 172.54/109.70 [2019-03-28 12:35:03,060 INFO L87 Difference]: Start difference. First operand 30 states and 56 transitions. Second operand 4 states. 172.54/109.70 [2019-03-28 12:35:03,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 172.54/109.70 [2019-03-28 12:35:03,144 INFO L93 Difference]: Finished difference Result 31 states and 56 transitions. 172.54/109.70 [2019-03-28 12:35:03,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 172.54/109.70 [2019-03-28 12:35:03,160 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 172.54/109.70 [2019-03-28 12:35:03,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 172.54/109.70 [2019-03-28 12:35:03,161 INFO L225 Difference]: With dead ends: 31 172.54/109.70 [2019-03-28 12:35:03,161 INFO L226 Difference]: Without dead ends: 30 172.54/109.70 [2019-03-28 12:35:03,162 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 172.54/109.70 [2019-03-28 12:35:03,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. 172.54/109.70 [2019-03-28 12:35:03,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. 172.54/109.70 [2019-03-28 12:35:03,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. 172.54/109.70 [2019-03-28 12:35:03,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 55 transitions. 172.54/109.70 [2019-03-28 12:35:03,168 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 55 transitions. Word has length 5 172.54/109.70 [2019-03-28 12:35:03,168 INFO L84 Accepts]: Finished accepts. word is rejected. 172.54/109.70 [2019-03-28 12:35:03,168 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 55 transitions. 172.54/109.70 [2019-03-28 12:35:03,168 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. 172.54/109.70 [2019-03-28 12:35:03,168 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 55 transitions. 172.54/109.70 [2019-03-28 12:35:03,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 172.54/109.70 [2019-03-28 12:35:03,169 INFO L394 BasicCegarLoop]: Found error trace 172.54/109.70 [2019-03-28 12:35:03,169 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] 172.54/109.70 [2019-03-28 12:35:03,169 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION]=== 172.54/109.70 [2019-03-28 12:35:03,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 172.54/109.70 [2019-03-28 12:35:03,170 INFO L82 PathProgramCache]: Analyzing trace with hash 206958944, now seen corresponding path program 1 times 172.54/109.70 [2019-03-28 12:35:03,170 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 172.54/109.70 [2019-03-28 12:35:03,170 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 172.54/109.70 [2019-03-28 12:35:03,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 172.54/109.70 [2019-03-28 12:35:03,171 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 172.54/109.70 [2019-03-28 12:35:03,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 172.54/109.70 [2019-03-28 12:35:03,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 172.54/109.70 [2019-03-28 12:35:03,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 172.54/109.70 [2019-03-28 12:35:03,208 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 172.54/109.70 [2019-03-28 12:35:03,208 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 172.54/109.70 [2019-03-28 12:35:03,208 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 172.54/109.70 [2019-03-28 12:35:03,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 172.54/109.70 [2019-03-28 12:35:03,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 172.54/109.70 [2019-03-28 12:35:03,209 INFO L87 Difference]: Start difference. First operand 30 states and 55 transitions. Second operand 3 states. 172.54/109.70 [2019-03-28 12:35:03,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 172.54/109.70 [2019-03-28 12:35:03,310 INFO L93 Difference]: Finished difference Result 30 states and 55 transitions. 172.54/109.70 [2019-03-28 12:35:03,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 172.54/109.70 [2019-03-28 12:35:03,310 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 172.54/109.70 [2019-03-28 12:35:03,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 172.54/109.70 [2019-03-28 12:35:03,311 INFO L225 Difference]: With dead ends: 30 172.54/109.70 [2019-03-28 12:35:03,311 INFO L226 Difference]: Without dead ends: 29 172.54/109.70 [2019-03-28 12:35:03,312 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 172.54/109.70 [2019-03-28 12:35:03,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. 172.54/109.70 [2019-03-28 12:35:03,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. 172.54/109.70 [2019-03-28 12:35:03,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. 172.54/109.70 [2019-03-28 12:35:03,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 54 transitions. 172.54/109.70 [2019-03-28 12:35:03,317 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 54 transitions. Word has length 5 172.54/109.70 [2019-03-28 12:35:03,317 INFO L84 Accepts]: Finished accepts. word is rejected. 172.54/109.70 [2019-03-28 12:35:03,318 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 54 transitions. 172.54/109.70 [2019-03-28 12:35:03,318 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 172.54/109.70 [2019-03-28 12:35:03,318 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 54 transitions. 172.54/109.70 [2019-03-28 12:35:03,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 172.54/109.70 [2019-03-28 12:35:03,318 INFO L394 BasicCegarLoop]: Found error trace 172.54/109.70 [2019-03-28 12:35:03,318 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] 172.54/109.70 [2019-03-28 12:35:03,319 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION]=== 172.54/109.70 [2019-03-28 12:35:03,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 172.54/109.70 [2019-03-28 12:35:03,319 INFO L82 PathProgramCache]: Analyzing trace with hash 2120758325, now seen corresponding path program 1 times 172.54/109.70 [2019-03-28 12:35:03,319 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 172.54/109.70 [2019-03-28 12:35:03,319 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 172.54/109.70 [2019-03-28 12:35:03,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 172.54/109.70 [2019-03-28 12:35:03,322 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 172.54/109.70 [2019-03-28 12:35:03,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 172.54/109.70 [2019-03-28 12:35:03,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 172.54/109.70 [2019-03-28 12:35:03,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 172.54/109.70 [2019-03-28 12:35:03,350 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 172.54/109.70 [2019-03-28 12:35:03,350 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 172.54/109.70 [2019-03-28 12:35:03,350 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 172.54/109.70 [2019-03-28 12:35:03,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 172.54/109.70 [2019-03-28 12:35:03,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 172.54/109.70 [2019-03-28 12:35:03,351 INFO L87 Difference]: Start difference. First operand 29 states and 54 transitions. Second operand 3 states. 172.54/109.70 [2019-03-28 12:35:03,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 172.54/109.70 [2019-03-28 12:35:03,420 INFO L93 Difference]: Finished difference Result 29 states and 54 transitions. 172.54/109.70 [2019-03-28 12:35:03,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 172.54/109.70 [2019-03-28 12:35:03,420 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 172.54/109.70 [2019-03-28 12:35:03,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 172.54/109.70 [2019-03-28 12:35:03,421 INFO L225 Difference]: With dead ends: 29 172.54/109.70 [2019-03-28 12:35:03,421 INFO L226 Difference]: Without dead ends: 28 172.54/109.70 [2019-03-28 12:35:03,422 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 172.54/109.70 [2019-03-28 12:35:03,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. 172.54/109.70 [2019-03-28 12:35:03,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. 172.54/109.70 [2019-03-28 12:35:03,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. 172.54/109.70 [2019-03-28 12:35:03,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 52 transitions. 172.54/109.70 [2019-03-28 12:35:03,427 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 52 transitions. Word has length 6 172.54/109.70 [2019-03-28 12:35:03,427 INFO L84 Accepts]: Finished accepts. word is rejected. 172.54/109.70 [2019-03-28 12:35:03,427 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 52 transitions. 172.54/109.70 [2019-03-28 12:35:03,427 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 172.54/109.70 [2019-03-28 12:35:03,427 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 52 transitions. 172.54/109.70 [2019-03-28 12:35:03,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 172.54/109.70 [2019-03-28 12:35:03,428 INFO L394 BasicCegarLoop]: Found error trace 172.54/109.70 [2019-03-28 12:35:03,428 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] 172.54/109.70 [2019-03-28 12:35:03,428 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION]=== 172.54/109.70 [2019-03-28 12:35:03,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 172.54/109.70 [2019-03-28 12:35:03,428 INFO L82 PathProgramCache]: Analyzing trace with hash 2120758327, now seen corresponding path program 1 times 172.54/109.70 [2019-03-28 12:35:03,429 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 172.54/109.70 [2019-03-28 12:35:03,429 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 172.54/109.70 [2019-03-28 12:35:03,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 172.54/109.70 [2019-03-28 12:35:03,430 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 172.54/109.70 [2019-03-28 12:35:03,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 172.54/109.70 [2019-03-28 12:35:03,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 172.54/109.70 [2019-03-28 12:35:03,466 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 172.54/109.70 [2019-03-28 12:35:03,466 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 172.54/109.70 [2019-03-28 12:35:03,466 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 172.54/109.70 [2019-03-28 12:35:03,467 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states 172.54/109.70 [2019-03-28 12:35:03,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. 172.54/109.70 [2019-03-28 12:35:03,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 172.54/109.70 [2019-03-28 12:35:03,467 INFO L87 Difference]: Start difference. First operand 28 states and 52 transitions. Second operand 4 states. 172.54/109.70 [2019-03-28 12:35:03,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 172.54/109.70 [2019-03-28 12:35:03,543 INFO L93 Difference]: Finished difference Result 29 states and 52 transitions. 172.54/109.70 [2019-03-28 12:35:03,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 172.54/109.70 [2019-03-28 12:35:03,544 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 172.54/109.70 [2019-03-28 12:35:03,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 172.54/109.70 [2019-03-28 12:35:03,545 INFO L225 Difference]: With dead ends: 29 172.54/109.70 [2019-03-28 12:35:03,545 INFO L226 Difference]: Without dead ends: 28 172.54/109.70 [2019-03-28 12:35:03,546 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 172.54/109.70 [2019-03-28 12:35:03,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. 172.54/109.70 [2019-03-28 12:35:03,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. 172.54/109.70 [2019-03-28 12:35:03,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. 172.54/109.70 [2019-03-28 12:35:03,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 51 transitions. 172.54/109.70 [2019-03-28 12:35:03,550 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 51 transitions. Word has length 6 172.54/109.70 [2019-03-28 12:35:03,550 INFO L84 Accepts]: Finished accepts. word is rejected. 172.54/109.70 [2019-03-28 12:35:03,551 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 51 transitions. 172.54/109.70 [2019-03-28 12:35:03,551 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. 172.54/109.70 [2019-03-28 12:35:03,551 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 51 transitions. 172.54/109.70 [2019-03-28 12:35:03,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 172.54/109.70 [2019-03-28 12:35:03,551 INFO L394 BasicCegarLoop]: Found error trace 172.54/109.70 [2019-03-28 12:35:03,551 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] 172.54/109.70 [2019-03-28 12:35:03,552 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION]=== 172.54/109.70 [2019-03-28 12:35:03,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 172.54/109.70 [2019-03-28 12:35:03,552 INFO L82 PathProgramCache]: Analyzing trace with hash 2120758328, now seen corresponding path program 1 times 172.54/109.70 [2019-03-28 12:35:03,552 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 172.54/109.70 [2019-03-28 12:35:03,552 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 172.54/109.70 [2019-03-28 12:35:03,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 172.54/109.70 [2019-03-28 12:35:03,553 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 172.54/109.70 [2019-03-28 12:35:03,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 172.54/109.70 [2019-03-28 12:35:03,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 172.54/109.70 [2019-03-28 12:35:03,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 172.54/109.70 [2019-03-28 12:35:03,587 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 172.54/109.70 [2019-03-28 12:35:03,587 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 172.54/109.70 [2019-03-28 12:35:03,588 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 172.54/109.70 [2019-03-28 12:35:03,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 172.54/109.70 [2019-03-28 12:35:03,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 172.54/109.70 [2019-03-28 12:35:03,588 INFO L87 Difference]: Start difference. First operand 28 states and 51 transitions. Second operand 3 states. 172.54/109.70 [2019-03-28 12:35:03,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 172.54/109.70 [2019-03-28 12:35:03,674 INFO L93 Difference]: Finished difference Result 28 states and 51 transitions. 172.54/109.70 [2019-03-28 12:35:03,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 172.54/109.70 [2019-03-28 12:35:03,674 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 172.54/109.70 [2019-03-28 12:35:03,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 172.54/109.70 [2019-03-28 12:35:03,675 INFO L225 Difference]: With dead ends: 28 172.54/109.70 [2019-03-28 12:35:03,675 INFO L226 Difference]: Without dead ends: 27 172.54/109.70 [2019-03-28 12:35:03,676 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 172.54/109.70 [2019-03-28 12:35:03,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. 172.54/109.70 [2019-03-28 12:35:03,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. 172.54/109.70 [2019-03-28 12:35:03,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. 172.54/109.70 [2019-03-28 12:35:03,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 50 transitions. 172.54/109.70 [2019-03-28 12:35:03,680 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 50 transitions. Word has length 6 172.54/109.70 [2019-03-28 12:35:03,681 INFO L84 Accepts]: Finished accepts. word is rejected. 172.54/109.70 [2019-03-28 12:35:03,681 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 50 transitions. 172.54/109.70 [2019-03-28 12:35:03,681 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 172.54/109.70 [2019-03-28 12:35:03,681 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 50 transitions. 172.54/109.70 [2019-03-28 12:35:03,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 172.54/109.70 [2019-03-28 12:35:03,681 INFO L394 BasicCegarLoop]: Found error trace 172.54/109.70 [2019-03-28 12:35:03,682 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] 172.54/109.70 [2019-03-28 12:35:03,682 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION]=== 172.54/109.70 [2019-03-28 12:35:03,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 172.54/109.70 [2019-03-28 12:35:03,682 INFO L82 PathProgramCache]: Analyzing trace with hash 1318999880, now seen corresponding path program 1 times 172.54/109.70 [2019-03-28 12:35:03,682 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 172.54/109.70 [2019-03-28 12:35:03,682 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 172.54/109.70 [2019-03-28 12:35:03,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 172.54/109.70 [2019-03-28 12:35:03,684 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 172.54/109.70 [2019-03-28 12:35:03,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 172.54/109.70 [2019-03-28 12:35:03,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 172.54/109.70 [2019-03-28 12:35:03,726 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 172.54/109.70 [2019-03-28 12:35:03,726 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 172.54/109.70 [2019-03-28 12:35:03,726 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 172.54/109.70 [2019-03-28 12:35:03,726 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states 172.54/109.70 [2019-03-28 12:35:03,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. 172.54/109.70 [2019-03-28 12:35:03,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 172.54/109.70 [2019-03-28 12:35:03,727 INFO L87 Difference]: Start difference. First operand 27 states and 50 transitions. Second operand 4 states. 172.54/109.70 [2019-03-28 12:35:03,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 172.54/109.70 [2019-03-28 12:35:03,814 INFO L93 Difference]: Finished difference Result 27 states and 50 transitions. 172.54/109.70 [2019-03-28 12:35:03,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 172.54/109.70 [2019-03-28 12:35:03,815 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 172.54/109.70 [2019-03-28 12:35:03,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 172.54/109.70 [2019-03-28 12:35:03,816 INFO L225 Difference]: With dead ends: 27 172.54/109.70 [2019-03-28 12:35:03,816 INFO L226 Difference]: Without dead ends: 26 172.54/109.70 [2019-03-28 12:35:03,816 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 172.54/109.70 [2019-03-28 12:35:03,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. 172.54/109.70 [2019-03-28 12:35:03,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. 172.54/109.70 [2019-03-28 12:35:03,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. 172.54/109.70 [2019-03-28 12:35:03,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 48 transitions. 172.54/109.70 [2019-03-28 12:35:03,821 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 48 transitions. Word has length 7 172.54/109.70 [2019-03-28 12:35:03,821 INFO L84 Accepts]: Finished accepts. word is rejected. 172.54/109.70 [2019-03-28 12:35:03,821 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 48 transitions. 172.54/109.70 [2019-03-28 12:35:03,821 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. 172.54/109.70 [2019-03-28 12:35:03,821 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 48 transitions. 172.54/109.70 [2019-03-28 12:35:03,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 172.54/109.70 [2019-03-28 12:35:03,822 INFO L394 BasicCegarLoop]: Found error trace 172.54/109.70 [2019-03-28 12:35:03,822 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] 172.54/109.70 [2019-03-28 12:35:03,822 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION]=== 172.54/109.70 [2019-03-28 12:35:03,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 172.54/109.70 [2019-03-28 12:35:03,823 INFO L82 PathProgramCache]: Analyzing trace with hash 1318999881, now seen corresponding path program 1 times 172.54/109.70 [2019-03-28 12:35:03,823 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 172.54/109.70 [2019-03-28 12:35:03,823 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 172.54/109.70 [2019-03-28 12:35:03,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 172.54/109.70 [2019-03-28 12:35:03,824 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 172.54/109.70 [2019-03-28 12:35:03,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 172.54/109.70 [2019-03-28 12:35:03,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 172.54/109.70 [2019-03-28 12:35:03,858 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 172.54/109.70 [2019-03-28 12:35:03,858 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 172.54/109.70 [2019-03-28 12:35:03,858 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 172.54/109.70 [2019-03-28 12:35:03,859 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states 172.54/109.70 [2019-03-28 12:35:03,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. 172.54/109.70 [2019-03-28 12:35:03,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 172.54/109.70 [2019-03-28 12:35:03,859 INFO L87 Difference]: Start difference. First operand 26 states and 48 transitions. Second operand 4 states. 172.54/109.70 [2019-03-28 12:35:03,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 172.54/109.70 [2019-03-28 12:35:03,962 INFO L93 Difference]: Finished difference Result 47 states and 85 transitions. 172.54/109.70 [2019-03-28 12:35:03,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 172.54/109.70 [2019-03-28 12:35:03,963 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 172.54/109.70 [2019-03-28 12:35:03,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 172.54/109.70 [2019-03-28 12:35:03,963 INFO L225 Difference]: With dead ends: 47 172.54/109.70 [2019-03-28 12:35:03,964 INFO L226 Difference]: Without dead ends: 46 172.54/109.70 [2019-03-28 12:35:03,964 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 172.54/109.70 [2019-03-28 12:35:03,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. 172.54/109.70 [2019-03-28 12:35:03,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 27. 172.54/109.70 [2019-03-28 12:35:03,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. 172.54/109.70 [2019-03-28 12:35:03,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 50 transitions. 172.54/109.70 [2019-03-28 12:35:03,970 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 50 transitions. Word has length 7 172.54/109.70 [2019-03-28 12:35:03,970 INFO L84 Accepts]: Finished accepts. word is rejected. 172.54/109.70 [2019-03-28 12:35:03,971 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 50 transitions. 172.54/109.70 [2019-03-28 12:35:03,971 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. 172.54/109.70 [2019-03-28 12:35:03,971 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 50 transitions. 172.54/109.70 [2019-03-28 12:35:03,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 172.54/109.70 [2019-03-28 12:35:03,971 INFO L394 BasicCegarLoop]: Found error trace 172.54/109.70 [2019-03-28 12:35:03,971 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] 172.54/109.70 [2019-03-28 12:35:03,972 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION]=== 172.54/109.70 [2019-03-28 12:35:03,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 172.54/109.70 [2019-03-28 12:35:03,972 INFO L82 PathProgramCache]: Analyzing trace with hash 1318999882, now seen corresponding path program 1 times 172.54/109.70 [2019-03-28 12:35:03,972 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 172.54/109.70 [2019-03-28 12:35:03,972 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 172.54/109.70 [2019-03-28 12:35:03,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 172.54/109.70 [2019-03-28 12:35:03,973 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 172.54/109.70 [2019-03-28 12:35:03,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 172.54/109.70 [2019-03-28 12:35:03,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 172.54/109.70 [2019-03-28 12:35:04,035 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 172.54/109.70 [2019-03-28 12:35:04,036 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 172.54/109.70 [2019-03-28 12:35:04,036 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 172.54/109.70 [2019-03-28 12:35:04,036 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states 172.54/109.70 [2019-03-28 12:35:04,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. 172.54/109.70 [2019-03-28 12:35:04,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 172.54/109.70 [2019-03-28 12:35:04,037 INFO L87 Difference]: Start difference. First operand 27 states and 50 transitions. Second operand 6 states. 172.54/109.70 [2019-03-28 12:35:04,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 172.54/109.70 [2019-03-28 12:35:04,166 INFO L93 Difference]: Finished difference Result 46 states and 84 transitions. 172.54/109.70 [2019-03-28 12:35:04,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 172.54/109.70 [2019-03-28 12:35:04,166 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 7 172.54/109.70 [2019-03-28 12:35:04,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 172.54/109.70 [2019-03-28 12:35:04,167 INFO L225 Difference]: With dead ends: 46 172.54/109.70 [2019-03-28 12:35:04,167 INFO L226 Difference]: Without dead ends: 45 172.54/109.70 [2019-03-28 12:35:04,168 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 172.54/109.70 [2019-03-28 12:35:04,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. 172.54/109.70 [2019-03-28 12:35:04,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 27. 172.54/109.70 [2019-03-28 12:35:04,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. 172.54/109.70 [2019-03-28 12:35:04,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 49 transitions. 172.54/109.70 [2019-03-28 12:35:04,173 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 49 transitions. Word has length 7 172.54/109.70 [2019-03-28 12:35:04,173 INFO L84 Accepts]: Finished accepts. word is rejected. 172.54/109.70 [2019-03-28 12:35:04,173 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 49 transitions. 172.54/109.70 [2019-03-28 12:35:04,173 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. 172.54/109.70 [2019-03-28 12:35:04,173 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 49 transitions. 172.54/109.70 [2019-03-28 12:35:04,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 172.54/109.70 [2019-03-28 12:35:04,174 INFO L394 BasicCegarLoop]: Found error trace 172.54/109.70 [2019-03-28 12:35:04,174 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] 172.54/109.70 [2019-03-28 12:35:04,174 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION]=== 172.54/109.70 [2019-03-28 12:35:04,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 172.54/109.70 [2019-03-28 12:35:04,175 INFO L82 PathProgramCache]: Analyzing trace with hash 543492411, now seen corresponding path program 1 times 172.54/109.70 [2019-03-28 12:35:04,175 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 172.54/109.70 [2019-03-28 12:35:04,175 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 172.54/109.70 [2019-03-28 12:35:04,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 172.54/109.70 [2019-03-28 12:35:04,176 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 172.54/109.70 [2019-03-28 12:35:04,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 172.54/109.70 [2019-03-28 12:35:04,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 172.54/109.70 [2019-03-28 12:35:04,209 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 172.54/109.70 [2019-03-28 12:35:04,209 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 172.54/109.70 [2019-03-28 12:35:04,210 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 172.54/109.70 [2019-03-28 12:35:04,210 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states 172.54/109.70 [2019-03-28 12:35:04,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. 172.54/109.70 [2019-03-28 12:35:04,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 172.54/109.70 [2019-03-28 12:35:04,211 INFO L87 Difference]: Start difference. First operand 27 states and 49 transitions. Second operand 4 states. 172.54/109.70 [2019-03-28 12:35:04,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 172.54/109.70 [2019-03-28 12:35:04,288 INFO L93 Difference]: Finished difference Result 28 states and 51 transitions. 172.54/109.70 [2019-03-28 12:35:04,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 172.54/109.70 [2019-03-28 12:35:04,288 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 172.54/109.70 [2019-03-28 12:35:04,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 172.54/109.70 [2019-03-28 12:35:04,289 INFO L225 Difference]: With dead ends: 28 172.54/109.70 [2019-03-28 12:35:04,289 INFO L226 Difference]: Without dead ends: 25 172.54/109.70 [2019-03-28 12:35:04,290 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 172.54/109.70 [2019-03-28 12:35:04,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. 172.54/109.70 [2019-03-28 12:35:04,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. 172.54/109.70 [2019-03-28 12:35:04,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. 172.54/109.70 [2019-03-28 12:35:04,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 43 transitions. 172.54/109.70 [2019-03-28 12:35:04,294 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 43 transitions. Word has length 9 172.54/109.70 [2019-03-28 12:35:04,294 INFO L84 Accepts]: Finished accepts. word is rejected. 172.54/109.70 [2019-03-28 12:35:04,295 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 43 transitions. 172.54/109.70 [2019-03-28 12:35:04,295 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. 172.54/109.70 [2019-03-28 12:35:04,295 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 43 transitions. 172.54/109.70 [2019-03-28 12:35:04,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 172.54/109.70 [2019-03-28 12:35:04,295 INFO L394 BasicCegarLoop]: Found error trace 172.54/109.70 [2019-03-28 12:35:04,295 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] 172.54/109.70 [2019-03-28 12:35:04,296 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION]=== 172.54/109.70 [2019-03-28 12:35:04,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 172.54/109.70 [2019-03-28 12:35:04,296 INFO L82 PathProgramCache]: Analyzing trace with hash 543492413, now seen corresponding path program 1 times 172.54/109.70 [2019-03-28 12:35:04,296 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 172.54/109.70 [2019-03-28 12:35:04,296 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 172.54/109.70 [2019-03-28 12:35:04,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 172.54/109.70 [2019-03-28 12:35:04,297 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 172.54/109.70 [2019-03-28 12:35:04,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 172.54/109.70 [2019-03-28 12:35:04,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 172.54/109.70 [2019-03-28 12:35:04,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 172.54/109.70 [2019-03-28 12:35:04,332 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 172.54/109.70 [2019-03-28 12:35:04,333 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 172.54/109.70 [2019-03-28 12:35:04,333 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states 172.54/109.70 [2019-03-28 12:35:04,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. 172.54/109.70 [2019-03-28 12:35:04,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 172.54/109.70 [2019-03-28 12:35:04,334 INFO L87 Difference]: Start difference. First operand 24 states and 43 transitions. Second operand 5 states. 172.54/109.70 [2019-03-28 12:35:04,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 172.54/109.70 [2019-03-28 12:35:04,446 INFO L93 Difference]: Finished difference Result 44 states and 74 transitions. 172.54/109.70 [2019-03-28 12:35:04,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 172.54/109.70 [2019-03-28 12:35:04,446 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 172.54/109.70 [2019-03-28 12:35:04,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 172.54/109.70 [2019-03-28 12:35:04,447 INFO L225 Difference]: With dead ends: 44 172.54/109.70 [2019-03-28 12:35:04,447 INFO L226 Difference]: Without dead ends: 41 172.54/109.70 [2019-03-28 12:35:04,447 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 172.54/109.70 [2019-03-28 12:35:04,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. 172.54/109.70 [2019-03-28 12:35:04,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 32. 172.54/109.70 [2019-03-28 12:35:04,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. 172.54/109.70 [2019-03-28 12:35:04,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 64 transitions. 172.54/109.70 [2019-03-28 12:35:04,452 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 64 transitions. Word has length 9 172.54/109.70 [2019-03-28 12:35:04,452 INFO L84 Accepts]: Finished accepts. word is rejected. 172.54/109.70 [2019-03-28 12:35:04,452 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 64 transitions. 172.54/109.70 [2019-03-28 12:35:04,453 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. 172.54/109.70 [2019-03-28 12:35:04,453 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 64 transitions. 172.54/109.70 [2019-03-28 12:35:04,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 172.54/109.70 [2019-03-28 12:35:04,453 INFO L394 BasicCegarLoop]: Found error trace 172.54/109.70 [2019-03-28 12:35:04,453 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] 172.54/109.70 [2019-03-28 12:35:04,453 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION]=== 172.54/109.70 [2019-03-28 12:35:04,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 172.54/109.70 [2019-03-28 12:35:04,454 INFO L82 PathProgramCache]: Analyzing trace with hash 543492414, now seen corresponding path program 1 times 172.54/109.70 [2019-03-28 12:35:04,454 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 172.54/109.70 [2019-03-28 12:35:04,454 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 172.54/109.70 [2019-03-28 12:35:04,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 172.54/109.70 [2019-03-28 12:35:04,455 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 172.54/109.70 [2019-03-28 12:35:04,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 172.54/109.70 [2019-03-28 12:35:04,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 172.54/109.70 [2019-03-28 12:35:04,506 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 172.54/109.70 [2019-03-28 12:35:04,506 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 172.54/109.70 [2019-03-28 12:35:04,506 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 172.54/109.70 [2019-03-28 12:35:04,506 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states 172.54/109.70 [2019-03-28 12:35:04,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. 172.54/109.70 [2019-03-28 12:35:04,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 172.54/109.70 [2019-03-28 12:35:04,507 INFO L87 Difference]: Start difference. First operand 32 states and 64 transitions. Second operand 6 states. 172.54/109.70 [2019-03-28 12:35:04,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 172.54/109.70 [2019-03-28 12:35:04,633 INFO L93 Difference]: Finished difference Result 41 states and 71 transitions. 172.54/109.70 [2019-03-28 12:35:04,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 172.54/109.70 [2019-03-28 12:35:04,633 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 9 172.54/109.70 [2019-03-28 12:35:04,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 172.54/109.70 [2019-03-28 12:35:04,634 INFO L225 Difference]: With dead ends: 41 172.54/109.70 [2019-03-28 12:35:04,634 INFO L226 Difference]: Without dead ends: 38 172.54/109.70 [2019-03-28 12:35:04,635 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 172.54/109.70 [2019-03-28 12:35:04,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. 172.54/109.70 [2019-03-28 12:35:04,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 32. 172.54/109.70 [2019-03-28 12:35:04,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. 172.54/109.70 [2019-03-28 12:35:04,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 61 transitions. 172.54/109.70 [2019-03-28 12:35:04,639 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 61 transitions. Word has length 9 172.54/109.70 [2019-03-28 12:35:04,639 INFO L84 Accepts]: Finished accepts. word is rejected. 172.54/109.70 [2019-03-28 12:35:04,639 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 61 transitions. 172.54/109.70 [2019-03-28 12:35:04,640 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. 172.54/109.70 [2019-03-28 12:35:04,640 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 61 transitions. 172.54/109.70 [2019-03-28 12:35:04,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 172.54/109.70 [2019-03-28 12:35:04,640 INFO L394 BasicCegarLoop]: Found error trace 172.54/109.70 [2019-03-28 12:35:04,640 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 172.54/109.70 [2019-03-28 12:35:04,641 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION]=== 172.54/109.70 [2019-03-28 12:35:04,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 172.54/109.70 [2019-03-28 12:35:04,641 INFO L82 PathProgramCache]: Analyzing trace with hash -455195703, now seen corresponding path program 1 times 172.54/109.70 [2019-03-28 12:35:04,641 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 172.54/109.70 [2019-03-28 12:35:04,641 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 172.54/109.70 [2019-03-28 12:35:04,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 172.54/109.70 [2019-03-28 12:35:04,642 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 172.54/109.70 [2019-03-28 12:35:04,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 172.54/109.70 [2019-03-28 12:35:04,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 172.54/109.70 [2019-03-28 12:35:04,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 172.54/109.70 [2019-03-28 12:35:04,669 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 172.54/109.70 [2019-03-28 12:35:04,669 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 172.54/109.70 [2019-03-28 12:35:04,670 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 172.54/109.70 [2019-03-28 12:35:04,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 172.54/109.70 [2019-03-28 12:35:04,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 172.54/109.70 [2019-03-28 12:35:04,671 INFO L87 Difference]: Start difference. First operand 32 states and 61 transitions. Second operand 3 states. 172.54/109.70 [2019-03-28 12:35:04,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 172.54/109.70 [2019-03-28 12:35:04,730 INFO L93 Difference]: Finished difference Result 61 states and 118 transitions. 172.54/109.70 [2019-03-28 12:35:04,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 172.54/109.70 [2019-03-28 12:35:04,731 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 172.54/109.70 [2019-03-28 12:35:04,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 172.54/109.70 [2019-03-28 12:35:04,732 INFO L225 Difference]: With dead ends: 61 172.54/109.70 [2019-03-28 12:35:04,732 INFO L226 Difference]: Without dead ends: 36 172.54/109.70 [2019-03-28 12:35:04,732 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 172.54/109.70 [2019-03-28 12:35:04,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. 172.54/109.70 [2019-03-28 12:35:04,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. 172.54/109.70 [2019-03-28 12:35:04,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. 172.54/109.70 [2019-03-28 12:35:04,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 65 transitions. 172.54/109.70 [2019-03-28 12:35:04,737 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 65 transitions. Word has length 13 172.54/109.70 [2019-03-28 12:35:04,737 INFO L84 Accepts]: Finished accepts. word is rejected. 172.54/109.70 [2019-03-28 12:35:04,738 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 65 transitions. 172.54/109.70 [2019-03-28 12:35:04,738 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 172.54/109.70 [2019-03-28 12:35:04,738 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 65 transitions. 172.54/109.70 [2019-03-28 12:35:04,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 172.54/109.70 [2019-03-28 12:35:04,738 INFO L394 BasicCegarLoop]: Found error trace 172.54/109.70 [2019-03-28 12:35:04,739 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 172.54/109.70 [2019-03-28 12:35:04,739 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION]=== 172.54/109.70 [2019-03-28 12:35:04,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 172.54/109.70 [2019-03-28 12:35:04,739 INFO L82 PathProgramCache]: Analyzing trace with hash -455165912, now seen corresponding path program 1 times 172.54/109.70 [2019-03-28 12:35:04,739 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 172.54/109.70 [2019-03-28 12:35:04,739 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 172.54/109.70 [2019-03-28 12:35:04,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 172.54/109.70 [2019-03-28 12:35:04,740 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 172.54/109.70 [2019-03-28 12:35:04,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 172.54/109.70 [2019-03-28 12:35:04,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 172.54/109.70 [2019-03-28 12:35:04,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 172.54/109.70 [2019-03-28 12:35:04,780 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 172.54/109.70 [2019-03-28 12:35:04,780 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 172.54/109.70 [2019-03-28 12:35:04,781 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states 172.54/109.70 [2019-03-28 12:35:04,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. 172.54/109.70 [2019-03-28 12:35:04,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 172.54/109.70 [2019-03-28 12:35:04,781 INFO L87 Difference]: Start difference. First operand 36 states and 65 transitions. Second operand 4 states. 172.54/109.70 [2019-03-28 12:35:04,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 172.54/109.70 [2019-03-28 12:35:04,864 INFO L93 Difference]: Finished difference Result 37 states and 67 transitions. 172.54/109.70 [2019-03-28 12:35:04,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 172.54/109.70 [2019-03-28 12:35:04,864 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 172.54/109.70 [2019-03-28 12:35:04,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 172.54/109.70 [2019-03-28 12:35:04,865 INFO L225 Difference]: With dead ends: 37 172.54/109.70 [2019-03-28 12:35:04,865 INFO L226 Difference]: Without dead ends: 36 172.54/109.70 [2019-03-28 12:35:04,865 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 172.54/109.70 [2019-03-28 12:35:04,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. 172.54/109.70 [2019-03-28 12:35:04,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. 172.54/109.70 [2019-03-28 12:35:04,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. 172.54/109.70 [2019-03-28 12:35:04,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 61 transitions. 172.54/109.70 [2019-03-28 12:35:04,870 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 61 transitions. Word has length 13 172.54/109.70 [2019-03-28 12:35:04,870 INFO L84 Accepts]: Finished accepts. word is rejected. 172.54/109.70 [2019-03-28 12:35:04,870 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 61 transitions. 172.54/109.70 [2019-03-28 12:35:04,871 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. 172.54/109.70 [2019-03-28 12:35:04,871 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 61 transitions. 172.54/109.70 [2019-03-28 12:35:04,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 172.54/109.70 [2019-03-28 12:35:04,871 INFO L394 BasicCegarLoop]: Found error trace 172.54/109.70 [2019-03-28 12:35:04,871 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 172.54/109.70 [2019-03-28 12:35:04,872 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION]=== 172.54/109.70 [2019-03-28 12:35:04,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 172.54/109.70 [2019-03-28 12:35:04,872 INFO L82 PathProgramCache]: Analyzing trace with hash -455165910, now seen corresponding path program 1 times 172.54/109.70 [2019-03-28 12:35:04,872 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 172.54/109.70 [2019-03-28 12:35:04,872 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 172.54/109.70 [2019-03-28 12:35:04,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 172.54/109.70 [2019-03-28 12:35:04,873 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 172.54/109.70 [2019-03-28 12:35:04,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 172.54/109.70 [2019-03-28 12:35:04,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 172.54/109.70 [2019-03-28 12:35:04,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 172.54/109.70 [2019-03-28 12:35:04,952 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 172.54/109.70 [2019-03-28 12:35:04,952 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 172.54/109.70 [2019-03-28 12:35:04,952 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states 172.54/109.70 [2019-03-28 12:35:04,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. 172.54/109.70 [2019-03-28 12:35:04,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 172.54/109.70 [2019-03-28 12:35:04,953 INFO L87 Difference]: Start difference. First operand 35 states and 61 transitions. Second operand 7 states. 172.54/109.70 [2019-03-28 12:35:05,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 172.54/109.70 [2019-03-28 12:35:05,113 INFO L93 Difference]: Finished difference Result 66 states and 114 transitions. 172.54/109.70 [2019-03-28 12:35:05,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 172.54/109.70 [2019-03-28 12:35:05,114 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 13 172.54/109.70 [2019-03-28 12:35:05,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 172.54/109.70 [2019-03-28 12:35:05,115 INFO L225 Difference]: With dead ends: 66 172.54/109.70 [2019-03-28 12:35:05,115 INFO L226 Difference]: Without dead ends: 65 172.54/109.70 [2019-03-28 12:35:05,115 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 172.54/109.70 [2019-03-28 12:35:05,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. 172.54/109.70 [2019-03-28 12:35:05,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 41. 172.54/109.70 [2019-03-28 12:35:05,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. 172.54/109.70 [2019-03-28 12:35:05,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 71 transitions. 172.54/109.70 [2019-03-28 12:35:05,121 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 71 transitions. Word has length 13 172.54/109.70 [2019-03-28 12:35:05,121 INFO L84 Accepts]: Finished accepts. word is rejected. 172.54/109.70 [2019-03-28 12:35:05,121 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 71 transitions. 172.54/109.70 [2019-03-28 12:35:05,121 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. 172.54/109.70 [2019-03-28 12:35:05,121 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 71 transitions. 172.54/109.70 [2019-03-28 12:35:05,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 172.54/109.70 [2019-03-28 12:35:05,122 INFO L394 BasicCegarLoop]: Found error trace 172.54/109.70 [2019-03-28 12:35:05,122 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 172.54/109.70 [2019-03-28 12:35:05,122 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION]=== 172.54/109.70 [2019-03-28 12:35:05,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 172.54/109.70 [2019-03-28 12:35:05,122 INFO L82 PathProgramCache]: Analyzing trace with hash 645068595, now seen corresponding path program 1 times 172.54/109.70 [2019-03-28 12:35:05,123 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 172.54/109.70 [2019-03-28 12:35:05,123 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 172.54/109.70 [2019-03-28 12:35:05,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 172.54/109.70 [2019-03-28 12:35:05,124 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 172.54/109.70 [2019-03-28 12:35:05,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 172.54/109.70 [2019-03-28 12:35:05,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 172.54/109.70 [2019-03-28 12:35:05,159 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 172.54/109.70 [2019-03-28 12:35:05,159 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 172.54/109.70 [2019-03-28 12:35:05,159 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 172.54/109.70 [2019-03-28 12:35:05,160 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states 172.54/109.70 [2019-03-28 12:35:05,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. 172.54/109.70 [2019-03-28 12:35:05,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 172.54/109.70 [2019-03-28 12:35:05,160 INFO L87 Difference]: Start difference. First operand 41 states and 71 transitions. Second operand 5 states. 172.54/109.70 [2019-03-28 12:35:05,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 172.54/109.70 [2019-03-28 12:35:05,274 INFO L93 Difference]: Finished difference Result 75 states and 128 transitions. 172.54/109.70 [2019-03-28 12:35:05,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 172.54/109.70 [2019-03-28 12:35:05,275 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 172.54/109.70 [2019-03-28 12:35:05,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 172.54/109.70 [2019-03-28 12:35:05,275 INFO L225 Difference]: With dead ends: 75 172.54/109.70 [2019-03-28 12:35:05,276 INFO L226 Difference]: Without dead ends: 43 172.54/109.70 [2019-03-28 12:35:05,276 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 172.54/109.70 [2019-03-28 12:35:05,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. 172.54/109.70 [2019-03-28 12:35:05,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 42. 172.54/109.70 [2019-03-28 12:35:05,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. 172.54/109.70 [2019-03-28 12:35:05,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 71 transitions. 172.54/109.70 [2019-03-28 12:35:05,281 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 71 transitions. Word has length 15 172.54/109.70 [2019-03-28 12:35:05,281 INFO L84 Accepts]: Finished accepts. word is rejected. 172.54/109.70 [2019-03-28 12:35:05,281 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 71 transitions. 172.54/109.70 [2019-03-28 12:35:05,281 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. 172.54/109.70 [2019-03-28 12:35:05,282 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 71 transitions. 172.54/109.70 [2019-03-28 12:35:05,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 172.54/109.70 [2019-03-28 12:35:05,282 INFO L394 BasicCegarLoop]: Found error trace 172.54/109.70 [2019-03-28 12:35:05,282 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 172.54/109.70 [2019-03-28 12:35:05,283 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION]=== 172.54/109.70 [2019-03-28 12:35:05,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 172.54/109.70 [2019-03-28 12:35:05,283 INFO L82 PathProgramCache]: Analyzing trace with hash 673697746, now seen corresponding path program 1 times 172.54/109.70 [2019-03-28 12:35:05,283 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 172.54/109.70 [2019-03-28 12:35:05,283 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 172.54/109.70 [2019-03-28 12:35:05,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 172.54/109.70 [2019-03-28 12:35:05,284 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 172.54/109.70 [2019-03-28 12:35:05,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 172.54/109.70 [2019-03-28 12:35:05,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 172.54/109.70 [2019-03-28 12:35:05,303 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 172.54/109.70 [2019-03-28 12:35:05,304 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 172.54/109.70 [2019-03-28 12:35:05,304 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 172.54/109.70 [2019-03-28 12:35:05,304 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 172.54/109.70 [2019-03-28 12:35:05,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 172.54/109.70 [2019-03-28 12:35:05,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 172.54/109.70 [2019-03-28 12:35:05,305 INFO L87 Difference]: Start difference. First operand 42 states and 71 transitions. Second operand 3 states. 172.54/109.70 [2019-03-28 12:35:05,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 172.54/109.70 [2019-03-28 12:35:05,353 INFO L93 Difference]: Finished difference Result 71 states and 121 transitions. 172.54/109.70 [2019-03-28 12:35:05,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 172.54/109.70 [2019-03-28 12:35:05,353 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 172.54/109.70 [2019-03-28 12:35:05,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 172.54/109.70 [2019-03-28 12:35:05,354 INFO L225 Difference]: With dead ends: 71 172.54/109.70 [2019-03-28 12:35:05,354 INFO L226 Difference]: Without dead ends: 42 172.54/109.70 [2019-03-28 12:35:05,355 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 172.54/109.70 [2019-03-28 12:35:05,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. 172.54/109.70 [2019-03-28 12:35:05,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. 172.54/109.70 [2019-03-28 12:35:05,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. 172.54/109.70 [2019-03-28 12:35:05,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 65 transitions. 172.54/109.70 [2019-03-28 12:35:05,359 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 65 transitions. Word has length 15 172.54/109.70 [2019-03-28 12:35:05,360 INFO L84 Accepts]: Finished accepts. word is rejected. 172.54/109.70 [2019-03-28 12:35:05,360 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 65 transitions. 172.54/109.70 [2019-03-28 12:35:05,360 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 172.54/109.70 [2019-03-28 12:35:05,360 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 65 transitions. 172.54/109.70 [2019-03-28 12:35:05,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 172.54/109.70 [2019-03-28 12:35:05,361 INFO L394 BasicCegarLoop]: Found error trace 172.54/109.70 [2019-03-28 12:35:05,361 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 172.54/109.70 [2019-03-28 12:35:05,361 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION]=== 172.54/109.70 [2019-03-28 12:35:05,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 172.54/109.70 [2019-03-28 12:35:05,361 INFO L82 PathProgramCache]: Analyzing trace with hash -638697937, now seen corresponding path program 1 times 172.54/109.70 [2019-03-28 12:35:05,361 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 172.54/109.70 [2019-03-28 12:35:05,362 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 172.54/109.70 [2019-03-28 12:35:05,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 172.54/109.70 [2019-03-28 12:35:05,363 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 172.54/109.70 [2019-03-28 12:35:05,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 172.54/109.70 [2019-03-28 12:35:05,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 172.54/109.70 [2019-03-28 12:35:05,434 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 172.54/109.70 [2019-03-28 12:35:05,434 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 172.54/109.70 [2019-03-28 12:35:05,435 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 172.54/109.70 [2019-03-28 12:35:05,435 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states 172.54/109.70 [2019-03-28 12:35:05,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. 172.54/109.70 [2019-03-28 12:35:05,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 172.54/109.70 [2019-03-28 12:35:05,436 INFO L87 Difference]: Start difference. First operand 41 states and 65 transitions. Second operand 8 states. 172.54/109.70 [2019-03-28 12:35:05,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 172.54/109.70 [2019-03-28 12:35:05,786 INFO L93 Difference]: Finished difference Result 118 states and 181 transitions. 172.54/109.70 [2019-03-28 12:35:05,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. 172.54/109.70 [2019-03-28 12:35:05,787 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 172.54/109.70 [2019-03-28 12:35:05,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 172.54/109.70 [2019-03-28 12:35:05,788 INFO L225 Difference]: With dead ends: 118 172.54/109.70 [2019-03-28 12:35:05,788 INFO L226 Difference]: Without dead ends: 90 172.54/109.70 [2019-03-28 12:35:05,788 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 172.54/109.70 [2019-03-28 12:35:05,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. 172.54/109.70 [2019-03-28 12:35:05,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 52. 172.54/109.70 [2019-03-28 12:35:05,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. 172.54/109.70 [2019-03-28 12:35:05,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 81 transitions. 172.54/109.70 [2019-03-28 12:35:05,794 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 81 transitions. Word has length 16 172.54/109.70 [2019-03-28 12:35:05,795 INFO L84 Accepts]: Finished accepts. word is rejected. 172.54/109.70 [2019-03-28 12:35:05,795 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 81 transitions. 172.54/109.70 [2019-03-28 12:35:05,795 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. 172.54/109.70 [2019-03-28 12:35:05,795 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 81 transitions. 172.54/109.70 [2019-03-28 12:35:05,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 172.54/109.70 [2019-03-28 12:35:05,796 INFO L394 BasicCegarLoop]: Found error trace 172.54/109.70 [2019-03-28 12:35:05,796 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 172.54/109.70 [2019-03-28 12:35:05,796 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION]=== 172.54/109.70 [2019-03-28 12:35:05,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 172.54/109.70 [2019-03-28 12:35:05,796 INFO L82 PathProgramCache]: Analyzing trace with hash 248805744, now seen corresponding path program 1 times 172.54/109.70 [2019-03-28 12:35:05,796 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 172.54/109.70 [2019-03-28 12:35:05,797 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 172.54/109.70 [2019-03-28 12:35:05,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 172.54/109.70 [2019-03-28 12:35:05,798 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 172.54/109.70 [2019-03-28 12:35:05,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 172.54/109.70 [2019-03-28 12:35:05,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 172.54/109.70 [2019-03-28 12:35:05,839 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 172.54/109.70 [2019-03-28 12:35:05,840 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 172.54/109.70 [2019-03-28 12:35:05,840 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 172.54/109.70 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 172.54/109.70 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 172.54/109.70 Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 172.54/109.70 [2019-03-28 12:35:05,857 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 172.54/109.70 [2019-03-28 12:35:05,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 172.54/109.70 [2019-03-28 12:35:05,891 INFO L256 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 3 conjunts are in the unsatisfiable core 172.54/109.70 [2019-03-28 12:35:05,897 INFO L279 TraceCheckSpWp]: Computing forward predicates... 172.54/109.70 [2019-03-28 12:35:05,923 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 172.54/109.70 [2019-03-28 12:35:05,953 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. 172.54/109.70 [2019-03-28 12:35:05,953 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 172.54/109.70 [2019-03-28 12:35:05,953 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states 172.54/109.70 [2019-03-28 12:35:05,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. 172.54/109.70 [2019-03-28 12:35:05,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 172.54/109.70 [2019-03-28 12:35:05,954 INFO L87 Difference]: Start difference. First operand 52 states and 81 transitions. Second operand 7 states. 172.54/109.70 [2019-03-28 12:35:06,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 172.54/109.70 [2019-03-28 12:35:06,119 INFO L93 Difference]: Finished difference Result 61 states and 89 transitions. 172.54/109.70 [2019-03-28 12:35:06,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 172.54/109.70 [2019-03-28 12:35:06,119 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 172.54/109.70 [2019-03-28 12:35:06,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 172.54/109.70 [2019-03-28 12:35:06,120 INFO L225 Difference]: With dead ends: 61 172.54/109.70 [2019-03-28 12:35:06,120 INFO L226 Difference]: Without dead ends: 58 172.54/109.70 [2019-03-28 12:35:06,121 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 172.54/109.70 [2019-03-28 12:35:06,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. 172.54/109.70 [2019-03-28 12:35:06,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 52. 172.54/109.70 [2019-03-28 12:35:06,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. 172.54/109.70 [2019-03-28 12:35:06,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 77 transitions. 172.54/109.70 [2019-03-28 12:35:06,126 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 77 transitions. Word has length 16 172.54/109.70 [2019-03-28 12:35:06,126 INFO L84 Accepts]: Finished accepts. word is rejected. 172.54/109.70 [2019-03-28 12:35:06,126 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 77 transitions. 172.54/109.70 [2019-03-28 12:35:06,127 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. 172.54/109.70 [2019-03-28 12:35:06,127 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 77 transitions. 172.54/109.70 [2019-03-28 12:35:06,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 172.54/109.70 [2019-03-28 12:35:06,127 INFO L394 BasicCegarLoop]: Found error trace 172.54/109.70 [2019-03-28 12:35:06,127 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 172.54/109.70 [2019-03-28 12:35:06,128 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION]=== 172.54/109.70 [2019-03-28 12:35:06,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 172.54/109.70 [2019-03-28 12:35:06,128 INFO L82 PathProgramCache]: Analyzing trace with hash 248805745, now seen corresponding path program 1 times 172.54/109.70 [2019-03-28 12:35:06,128 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 172.54/109.70 [2019-03-28 12:35:06,128 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 172.54/109.70 [2019-03-28 12:35:06,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 172.54/109.70 [2019-03-28 12:35:06,129 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 172.54/109.70 [2019-03-28 12:35:06,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 172.54/109.70 [2019-03-28 12:35:06,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 172.54/109.70 [2019-03-28 12:35:06,319 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. 172.54/109.70 [2019-03-28 12:35:06,319 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 172.54/109.70 [2019-03-28 12:35:06,319 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 172.54/109.70 [2019-03-28 12:35:06,320 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states 172.54/109.70 [2019-03-28 12:35:06,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. 172.54/109.70 [2019-03-28 12:35:06,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 172.54/109.70 [2019-03-28 12:35:06,321 INFO L87 Difference]: Start difference. First operand 52 states and 77 transitions. Second operand 10 states. 172.54/109.70 [2019-03-28 12:35:06,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 172.54/109.70 [2019-03-28 12:35:06,670 INFO L93 Difference]: Finished difference Result 102 states and 151 transitions. 172.54/109.70 [2019-03-28 12:35:06,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 172.54/109.70 [2019-03-28 12:35:06,671 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 172.54/109.70 [2019-03-28 12:35:06,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 172.54/109.70 [2019-03-28 12:35:06,672 INFO L225 Difference]: With dead ends: 102 172.54/109.70 [2019-03-28 12:35:06,672 INFO L226 Difference]: Without dead ends: 52 172.54/109.70 [2019-03-28 12:35:06,673 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 172.54/109.70 [2019-03-28 12:35:06,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. 172.54/109.70 [2019-03-28 12:35:06,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. 172.54/109.70 [2019-03-28 12:35:06,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. 172.54/109.70 [2019-03-28 12:35:06,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 76 transitions. 172.54/109.70 [2019-03-28 12:35:06,678 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 76 transitions. Word has length 16 172.54/109.70 [2019-03-28 12:35:06,678 INFO L84 Accepts]: Finished accepts. word is rejected. 172.54/109.70 [2019-03-28 12:35:06,678 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 76 transitions. 172.54/109.70 [2019-03-28 12:35:06,679 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. 172.54/109.70 [2019-03-28 12:35:06,679 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 76 transitions. 172.54/109.70 [2019-03-28 12:35:06,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 172.54/109.70 [2019-03-28 12:35:06,679 INFO L394 BasicCegarLoop]: Found error trace 172.54/109.70 [2019-03-28 12:35:06,679 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 172.54/109.70 [2019-03-28 12:35:06,680 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION]=== 172.54/109.70 [2019-03-28 12:35:06,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 172.54/109.70 [2019-03-28 12:35:06,680 INFO L82 PathProgramCache]: Analyzing trace with hash 476493876, now seen corresponding path program 1 times 172.54/109.70 [2019-03-28 12:35:06,680 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 172.54/109.70 [2019-03-28 12:35:06,680 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 172.54/109.70 [2019-03-28 12:35:06,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 172.54/109.70 [2019-03-28 12:35:06,682 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 172.54/109.70 [2019-03-28 12:35:06,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 172.54/109.70 [2019-03-28 12:35:06,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 172.54/109.70 [2019-03-28 12:35:06,833 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 172.54/109.70 [2019-03-28 12:35:06,833 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 172.54/109.70 [2019-03-28 12:35:06,833 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 172.54/109.70 [2019-03-28 12:35:06,834 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states 172.54/109.70 [2019-03-28 12:35:06,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. 172.54/109.70 [2019-03-28 12:35:06,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 172.54/109.70 [2019-03-28 12:35:06,834 INFO L87 Difference]: Start difference. First operand 52 states and 76 transitions. Second operand 11 states. 172.54/109.70 [2019-03-28 12:35:07,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 172.54/109.70 [2019-03-28 12:35:07,253 INFO L93 Difference]: Finished difference Result 119 states and 174 transitions. 172.54/109.70 [2019-03-28 12:35:07,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. 172.54/109.70 [2019-03-28 12:35:07,253 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 16 172.54/109.70 [2019-03-28 12:35:07,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 172.54/109.70 [2019-03-28 12:35:07,254 INFO L225 Difference]: With dead ends: 119 172.54/109.70 [2019-03-28 12:35:07,254 INFO L226 Difference]: Without dead ends: 75 172.54/109.70 [2019-03-28 12:35:07,255 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 172.54/109.70 [2019-03-28 12:35:07,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. 172.54/109.70 [2019-03-28 12:35:07,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 73. 172.54/109.70 [2019-03-28 12:35:07,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. 172.54/109.70 [2019-03-28 12:35:07,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 108 transitions. 172.54/109.70 [2019-03-28 12:35:07,262 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 108 transitions. Word has length 16 172.54/109.70 [2019-03-28 12:35:07,262 INFO L84 Accepts]: Finished accepts. word is rejected. 172.54/109.70 [2019-03-28 12:35:07,262 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 108 transitions. 172.54/109.70 [2019-03-28 12:35:07,263 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. 172.54/109.70 [2019-03-28 12:35:07,263 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 108 transitions. 172.54/109.70 [2019-03-28 12:35:07,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 172.54/109.70 [2019-03-28 12:35:07,263 INFO L394 BasicCegarLoop]: Found error trace 172.54/109.70 [2019-03-28 12:35:07,264 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 172.54/109.70 [2019-03-28 12:35:07,264 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION]=== 172.54/109.70 [2019-03-28 12:35:07,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 172.54/109.70 [2019-03-28 12:35:07,264 INFO L82 PathProgramCache]: Analyzing trace with hash 1232550797, now seen corresponding path program 1 times 172.54/109.70 [2019-03-28 12:35:07,264 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 172.54/109.70 [2019-03-28 12:35:07,264 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 172.54/109.70 [2019-03-28 12:35:07,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 172.54/109.70 [2019-03-28 12:35:07,265 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 172.54/109.70 [2019-03-28 12:35:07,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 172.54/109.70 [2019-03-28 12:35:07,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 172.54/109.70 [2019-03-28 12:35:07,481 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 172.54/109.70 [2019-03-28 12:35:07,482 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 172.54/109.70 [2019-03-28 12:35:07,482 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 172.54/109.70 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 172.54/109.70 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 172.54/109.70 Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 172.54/109.70 [2019-03-28 12:35:07,493 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 172.54/109.70 [2019-03-28 12:35:07,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 172.54/109.70 [2019-03-28 12:35:07,515 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 20 conjunts are in the unsatisfiable core 172.54/109.70 [2019-03-28 12:35:07,517 INFO L279 TraceCheckSpWp]: Computing forward predicates... 172.54/109.70 [2019-03-28 12:35:07,559 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 172.54/109.70 [2019-03-28 12:35:07,560 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 172.54/109.70 [2019-03-28 12:35:07,570 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 172.54/109.70 [2019-03-28 12:35:07,571 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. 172.54/109.70 [2019-03-28 12:35:07,571 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:24 172.54/109.70 [2019-03-28 12:35:07,644 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 172.54/109.70 [2019-03-28 12:35:07,644 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 18 172.54/109.70 [2019-03-28 12:35:07,648 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. 172.54/109.70 [2019-03-28 12:35:07,659 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 172.54/109.70 [2019-03-28 12:35:07,664 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. 172.54/109.70 [2019-03-28 12:35:07,665 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:31, output treesize:27 172.54/109.70 [2019-03-28 12:35:07,750 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 172.54/109.70 [2019-03-28 12:35:07,778 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 172.54/109.70 [2019-03-28 12:35:07,778 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 7] total 16 172.54/109.70 [2019-03-28 12:35:07,778 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states 172.54/109.70 [2019-03-28 12:35:07,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. 172.54/109.70 [2019-03-28 12:35:07,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 172.54/109.70 [2019-03-28 12:35:07,779 INFO L87 Difference]: Start difference. First operand 73 states and 108 transitions. Second operand 17 states. 172.54/109.70 [2019-03-28 12:35:08,441 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 58 172.54/109.70 [2019-03-28 12:35:08,972 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 67 172.54/109.70 [2019-03-28 12:35:10,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 172.54/109.70 [2019-03-28 12:35:10,087 INFO L93 Difference]: Finished difference Result 128 states and 187 transitions. 172.54/109.70 [2019-03-28 12:35:10,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. 172.54/109.70 [2019-03-28 12:35:10,091 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 16 172.54/109.70 [2019-03-28 12:35:10,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 172.54/109.70 [2019-03-28 12:35:10,093 INFO L225 Difference]: With dead ends: 128 172.54/109.70 [2019-03-28 12:35:10,093 INFO L226 Difference]: Without dead ends: 122 172.54/109.70 [2019-03-28 12:35:10,094 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 214 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=366, Invalid=966, Unknown=0, NotChecked=0, Total=1332 172.54/109.70 [2019-03-28 12:35:10,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. 172.54/109.70 [2019-03-28 12:35:10,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 68. 172.54/109.70 [2019-03-28 12:35:10,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. 172.54/109.70 [2019-03-28 12:35:10,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 102 transitions. 172.54/109.70 [2019-03-28 12:35:10,103 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 102 transitions. Word has length 16 172.54/109.70 [2019-03-28 12:35:10,103 INFO L84 Accepts]: Finished accepts. word is rejected. 172.54/109.70 [2019-03-28 12:35:10,103 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 102 transitions. 172.54/109.70 [2019-03-28 12:35:10,103 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. 172.54/109.70 [2019-03-28 12:35:10,104 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 102 transitions. 172.54/109.70 [2019-03-28 12:35:10,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 172.54/109.70 [2019-03-28 12:35:10,104 INFO L394 BasicCegarLoop]: Found error trace 172.54/109.70 [2019-03-28 12:35:10,105 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 172.54/109.70 [2019-03-28 12:35:10,105 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION]=== 172.54/109.70 [2019-03-28 12:35:10,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 172.54/109.70 [2019-03-28 12:35:10,105 INFO L82 PathProgramCache]: Analyzing trace with hash -1639549694, now seen corresponding path program 1 times 172.54/109.70 [2019-03-28 12:35:10,105 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 172.54/109.70 [2019-03-28 12:35:10,105 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 172.54/109.70 [2019-03-28 12:35:10,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 172.54/109.70 [2019-03-28 12:35:10,107 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 172.54/109.70 [2019-03-28 12:35:10,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 172.54/109.70 [2019-03-28 12:35:10,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 172.54/109.70 [2019-03-28 12:35:10,145 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 172.54/109.70 [2019-03-28 12:35:10,145 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 172.54/109.70 [2019-03-28 12:35:10,145 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 172.54/109.70 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 172.54/109.70 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 172.54/109.70 Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 172.54/109.70 [2019-03-28 12:35:10,157 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 172.54/109.70 [2019-03-28 12:35:10,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 172.54/109.70 [2019-03-28 12:35:10,185 INFO L256 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 3 conjunts are in the unsatisfiable core 172.54/109.70 [2019-03-28 12:35:10,187 INFO L279 TraceCheckSpWp]: Computing forward predicates... 172.54/109.70 [2019-03-28 12:35:10,198 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 172.54/109.70 [2019-03-28 12:35:10,226 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. 172.54/109.70 [2019-03-28 12:35:10,227 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 172.54/109.70 [2019-03-28 12:35:10,227 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states 172.54/109.70 [2019-03-28 12:35:10,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. 172.54/109.70 [2019-03-28 12:35:10,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 172.54/109.70 [2019-03-28 12:35:10,228 INFO L87 Difference]: Start difference. First operand 68 states and 102 transitions. Second operand 6 states. 172.54/109.70 [2019-03-28 12:35:10,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 172.54/109.70 [2019-03-28 12:35:10,344 INFO L93 Difference]: Finished difference Result 89 states and 132 transitions. 172.54/109.70 [2019-03-28 12:35:10,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 172.54/109.70 [2019-03-28 12:35:10,345 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 172.54/109.70 [2019-03-28 12:35:10,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 172.54/109.70 [2019-03-28 12:35:10,346 INFO L225 Difference]: With dead ends: 89 172.54/109.70 [2019-03-28 12:35:10,346 INFO L226 Difference]: Without dead ends: 88 172.54/109.70 [2019-03-28 12:35:10,346 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 172.54/109.70 [2019-03-28 12:35:10,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. 172.54/109.70 [2019-03-28 12:35:10,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 68. 172.54/109.70 [2019-03-28 12:35:10,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. 172.54/109.70 [2019-03-28 12:35:10,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 100 transitions. 172.54/109.70 [2019-03-28 12:35:10,355 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 100 transitions. Word has length 18 172.54/109.70 [2019-03-28 12:35:10,355 INFO L84 Accepts]: Finished accepts. word is rejected. 172.54/109.70 [2019-03-28 12:35:10,355 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 100 transitions. 172.54/109.70 [2019-03-28 12:35:10,355 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. 172.54/109.70 [2019-03-28 12:35:10,356 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 100 transitions. 172.54/109.70 [2019-03-28 12:35:10,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 172.54/109.70 [2019-03-28 12:35:10,356 INFO L394 BasicCegarLoop]: Found error trace 172.54/109.70 [2019-03-28 12:35:10,356 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 172.54/109.70 [2019-03-28 12:35:10,357 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION]=== 172.54/109.70 [2019-03-28 12:35:10,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 172.54/109.70 [2019-03-28 12:35:10,357 INFO L82 PathProgramCache]: Analyzing trace with hash -1639549693, now seen corresponding path program 1 times 172.54/109.70 [2019-03-28 12:35:10,357 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 172.54/109.70 [2019-03-28 12:35:10,357 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 172.54/109.70 [2019-03-28 12:35:10,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 172.54/109.70 [2019-03-28 12:35:10,359 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 172.54/109.70 [2019-03-28 12:35:10,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 172.54/109.70 [2019-03-28 12:35:10,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 172.54/109.70 [2019-03-28 12:35:10,442 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 172.54/109.70 [2019-03-28 12:35:10,443 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 172.54/109.70 [2019-03-28 12:35:10,443 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 172.54/109.70 [2019-03-28 12:35:10,443 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states 172.54/109.70 [2019-03-28 12:35:10,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. 172.54/109.70 [2019-03-28 12:35:10,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 172.54/109.70 [2019-03-28 12:35:10,444 INFO L87 Difference]: Start difference. First operand 68 states and 100 transitions. Second operand 7 states. 172.54/109.70 [2019-03-28 12:35:10,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 172.54/109.70 [2019-03-28 12:35:10,609 INFO L93 Difference]: Finished difference Result 70 states and 100 transitions. 172.54/109.70 [2019-03-28 12:35:10,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 172.54/109.70 [2019-03-28 12:35:10,609 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 172.54/109.70 [2019-03-28 12:35:10,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 172.54/109.70 [2019-03-28 12:35:10,610 INFO L225 Difference]: With dead ends: 70 172.54/109.70 [2019-03-28 12:35:10,610 INFO L226 Difference]: Without dead ends: 47 172.54/109.70 [2019-03-28 12:35:10,611 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 172.54/109.70 [2019-03-28 12:35:10,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. 172.54/109.70 [2019-03-28 12:35:10,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. 172.54/109.70 [2019-03-28 12:35:10,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. 172.54/109.70 [2019-03-28 12:35:10,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 68 transitions. 172.54/109.70 [2019-03-28 12:35:10,616 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 68 transitions. Word has length 18 172.54/109.70 [2019-03-28 12:35:10,617 INFO L84 Accepts]: Finished accepts. word is rejected. 172.54/109.70 [2019-03-28 12:35:10,617 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 68 transitions. 172.54/109.70 [2019-03-28 12:35:10,617 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. 172.54/109.70 [2019-03-28 12:35:10,617 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 68 transitions. 172.54/109.70 [2019-03-28 12:35:10,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 172.54/109.70 [2019-03-28 12:35:10,618 INFO L394 BasicCegarLoop]: Found error trace 172.54/109.70 [2019-03-28 12:35:10,618 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 172.54/109.70 [2019-03-28 12:35:10,618 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION]=== 172.54/109.70 [2019-03-28 12:35:10,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 172.54/109.70 [2019-03-28 12:35:10,618 INFO L82 PathProgramCache]: Analyzing trace with hash 878629723, now seen corresponding path program 1 times 172.54/109.70 [2019-03-28 12:35:10,619 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 172.54/109.70 [2019-03-28 12:35:10,619 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 172.54/109.70 [2019-03-28 12:35:10,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 172.54/109.70 [2019-03-28 12:35:10,620 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 172.54/109.70 [2019-03-28 12:35:10,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 172.54/109.70 [2019-03-28 12:35:10,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 172.54/109.70 [2019-03-28 12:35:10,817 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 172.54/109.70 [2019-03-28 12:35:10,817 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 172.54/109.70 [2019-03-28 12:35:10,817 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 172.54/109.70 [2019-03-28 12:35:10,818 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states 172.54/109.70 [2019-03-28 12:35:10,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. 172.54/109.70 [2019-03-28 12:35:10,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 172.54/109.70 [2019-03-28 12:35:10,818 INFO L87 Difference]: Start difference. First operand 47 states and 68 transitions. Second operand 8 states. 172.54/109.70 [2019-03-28 12:35:11,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 172.54/109.70 [2019-03-28 12:35:11,038 INFO L93 Difference]: Finished difference Result 92 states and 132 transitions. 172.54/109.70 [2019-03-28 12:35:11,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 172.54/109.70 [2019-03-28 12:35:11,039 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 172.54/109.70 [2019-03-28 12:35:11,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 172.54/109.70 [2019-03-28 12:35:11,039 INFO L225 Difference]: With dead ends: 92 172.54/109.70 [2019-03-28 12:35:11,040 INFO L226 Difference]: Without dead ends: 63 172.54/109.70 [2019-03-28 12:35:11,040 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 172.54/109.70 [2019-03-28 12:35:11,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. 172.54/109.70 [2019-03-28 12:35:11,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 47. 172.54/109.70 [2019-03-28 12:35:11,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. 172.54/109.70 [2019-03-28 12:35:11,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 67 transitions. 172.54/109.70 [2019-03-28 12:35:11,046 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 67 transitions. Word has length 18 172.54/109.70 [2019-03-28 12:35:11,046 INFO L84 Accepts]: Finished accepts. word is rejected. 172.54/109.70 [2019-03-28 12:35:11,046 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 67 transitions. 172.54/109.70 [2019-03-28 12:35:11,046 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. 172.54/109.70 [2019-03-28 12:35:11,046 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 67 transitions. 172.54/109.70 [2019-03-28 12:35:11,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 172.54/109.70 [2019-03-28 12:35:11,047 INFO L394 BasicCegarLoop]: Found error trace 172.54/109.70 [2019-03-28 12:35:11,047 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 172.54/109.70 [2019-03-28 12:35:11,047 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION]=== 172.54/109.71 [2019-03-28 12:35:11,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 172.54/109.71 [2019-03-28 12:35:11,048 INFO L82 PathProgramCache]: Analyzing trace with hash 879553244, now seen corresponding path program 1 times 172.54/109.71 [2019-03-28 12:35:11,048 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 172.54/109.71 [2019-03-28 12:35:11,048 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 172.54/109.71 [2019-03-28 12:35:11,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 172.54/109.71 [2019-03-28 12:35:11,049 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 172.54/109.71 [2019-03-28 12:35:11,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 172.54/109.71 [2019-03-28 12:35:11,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 172.54/109.71 [2019-03-28 12:35:11,233 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 172.54/109.71 [2019-03-28 12:35:11,234 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 172.54/109.71 [2019-03-28 12:35:11,234 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 172.54/109.71 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 172.54/109.71 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 172.54/109.71 Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 172.54/109.71 [2019-03-28 12:35:11,245 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 172.54/109.71 [2019-03-28 12:35:11,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 172.54/109.71 [2019-03-28 12:35:11,274 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 27 conjunts are in the unsatisfiable core 172.54/109.71 [2019-03-28 12:35:11,276 INFO L279 TraceCheckSpWp]: Computing forward predicates... 172.54/109.71 [2019-03-28 12:35:11,306 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 172.54/109.71 [2019-03-28 12:35:11,307 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 172.54/109.71 [2019-03-28 12:35:11,317 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 172.54/109.71 [2019-03-28 12:35:11,318 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 172.54/109.71 [2019-03-28 12:35:11,318 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:31, output treesize:27 172.54/109.71 [2019-03-28 12:35:11,354 INFO L189 IndexEqualityManager]: detected not equals via solver 172.54/109.71 [2019-03-28 12:35:11,356 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 172.54/109.71 [2019-03-28 12:35:11,357 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 172.54/109.71 [2019-03-28 12:35:11,372 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 172.54/109.71 [2019-03-28 12:35:11,373 INFO L427 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. 172.54/109.71 [2019-03-28 12:35:11,374 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:44, output treesize:40 172.54/109.71 [2019-03-28 12:35:11,411 INFO L189 IndexEqualityManager]: detected not equals via solver 172.54/109.71 [2019-03-28 12:35:11,417 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 172.54/109.71 [2019-03-28 12:35:11,417 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 21 172.54/109.71 [2019-03-28 12:35:11,418 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. 172.54/109.71 [2019-03-28 12:35:11,431 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 172.54/109.71 [2019-03-28 12:35:11,434 INFO L427 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 172.54/109.71 [2019-03-28 12:35:11,434 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:47, output treesize:31 172.54/109.71 [2019-03-28 12:35:11,513 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 172.54/109.71 [2019-03-28 12:35:11,540 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 172.54/109.71 [2019-03-28 12:35:11,540 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 172.54/109.71 [2019-03-28 12:35:11,540 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states 172.54/109.71 [2019-03-28 12:35:11,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. 172.54/109.71 [2019-03-28 12:35:11,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 172.54/109.71 [2019-03-28 12:35:11,541 INFO L87 Difference]: Start difference. First operand 47 states and 67 transitions. Second operand 15 states. 172.54/109.71 [2019-03-28 12:35:12,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 172.54/109.71 [2019-03-28 12:35:12,564 INFO L93 Difference]: Finished difference Result 152 states and 218 transitions. 172.54/109.71 [2019-03-28 12:35:12,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. 172.54/109.71 [2019-03-28 12:35:12,565 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 18 172.54/109.71 [2019-03-28 12:35:12,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 172.54/109.71 [2019-03-28 12:35:12,566 INFO L225 Difference]: With dead ends: 152 172.54/109.71 [2019-03-28 12:35:12,566 INFO L226 Difference]: Without dead ends: 151 172.54/109.71 [2019-03-28 12:35:12,567 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=192, Invalid=510, Unknown=0, NotChecked=0, Total=702 172.54/109.71 [2019-03-28 12:35:12,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. 172.54/109.71 [2019-03-28 12:35:12,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 62. 172.54/109.71 [2019-03-28 12:35:12,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. 172.54/109.71 [2019-03-28 12:35:12,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 91 transitions. 172.54/109.71 [2019-03-28 12:35:12,576 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 91 transitions. Word has length 18 172.54/109.71 [2019-03-28 12:35:12,576 INFO L84 Accepts]: Finished accepts. word is rejected. 172.54/109.71 [2019-03-28 12:35:12,576 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 91 transitions. 172.54/109.71 [2019-03-28 12:35:12,576 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. 172.54/109.71 [2019-03-28 12:35:12,577 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 91 transitions. 172.54/109.71 [2019-03-28 12:35:12,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 172.54/109.71 [2019-03-28 12:35:12,577 INFO L394 BasicCegarLoop]: Found error trace 172.54/109.71 [2019-03-28 12:35:12,577 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 172.54/109.71 [2019-03-28 12:35:12,577 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION]=== 172.54/109.71 [2019-03-28 12:35:12,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 172.54/109.71 [2019-03-28 12:35:12,578 INFO L82 PathProgramCache]: Analyzing trace with hash -102683911, now seen corresponding path program 1 times 172.54/109.71 [2019-03-28 12:35:12,578 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 172.54/109.71 [2019-03-28 12:35:12,578 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 172.54/109.71 [2019-03-28 12:35:12,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 172.54/109.71 [2019-03-28 12:35:12,579 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 172.54/109.71 [2019-03-28 12:35:12,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 172.54/109.71 [2019-03-28 12:35:12,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 172.54/109.71 [2019-03-28 12:35:12,827 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 172.54/109.71 [2019-03-28 12:35:12,827 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 172.54/109.71 [2019-03-28 12:35:12,827 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 172.54/109.71 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 172.54/109.71 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 172.54/109.71 Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 172.54/109.71 [2019-03-28 12:35:12,838 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 172.54/109.71 [2019-03-28 12:35:12,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 172.54/109.71 [2019-03-28 12:35:12,860 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 29 conjunts are in the unsatisfiable core 172.54/109.71 [2019-03-28 12:35:12,862 INFO L279 TraceCheckSpWp]: Computing forward predicates... 172.54/109.71 [2019-03-28 12:35:12,886 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 172.54/109.71 [2019-03-28 12:35:12,887 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 172.54/109.71 [2019-03-28 12:35:12,895 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 172.54/109.71 [2019-03-28 12:35:12,896 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 172.54/109.71 [2019-03-28 12:35:12,896 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:31, output treesize:27 172.54/109.71 [2019-03-28 12:35:12,929 INFO L189 IndexEqualityManager]: detected not equals via solver 172.54/109.71 [2019-03-28 12:35:12,931 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 172.54/109.71 [2019-03-28 12:35:12,931 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 172.54/109.71 [2019-03-28 12:35:12,943 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 172.54/109.71 [2019-03-28 12:35:12,945 INFO L427 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. 172.54/109.71 [2019-03-28 12:35:12,945 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:44, output treesize:40 172.54/109.71 [2019-03-28 12:35:12,985 INFO L189 IndexEqualityManager]: detected not equals via solver 172.54/109.71 [2019-03-28 12:35:12,991 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 172.54/109.71 [2019-03-28 12:35:12,992 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 21 172.54/109.71 [2019-03-28 12:35:12,993 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. 172.54/109.71 [2019-03-28 12:35:13,005 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 172.54/109.71 [2019-03-28 12:35:13,007 INFO L427 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 172.54/109.71 [2019-03-28 12:35:13,008 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:47, output treesize:31 172.54/109.71 [2019-03-28 12:35:13,096 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 172.54/109.71 [2019-03-28 12:35:13,124 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 172.54/109.71 [2019-03-28 12:35:13,124 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 18 172.54/109.71 [2019-03-28 12:35:13,124 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states 172.54/109.71 [2019-03-28 12:35:13,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. 172.54/109.71 [2019-03-28 12:35:13,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 172.54/109.71 [2019-03-28 12:35:13,125 INFO L87 Difference]: Start difference. First operand 62 states and 91 transitions. Second operand 19 states. 172.54/109.71 [2019-03-28 12:35:13,797 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 66 172.54/109.71 [2019-03-28 12:35:13,942 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 63 172.54/109.71 [2019-03-28 12:35:14,213 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 75 172.54/109.71 [2019-03-28 12:35:14,376 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 72 172.54/109.71 [2019-03-28 12:35:14,660 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 73 172.54/109.71 [2019-03-28 12:35:14,812 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 70 172.54/109.71 [2019-03-28 12:35:15,105 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 77 172.54/109.71 [2019-03-28 12:35:15,268 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 74 172.54/109.71 [2019-03-28 12:35:15,584 WARN L188 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 81 172.54/109.71 [2019-03-28 12:35:15,760 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 78 172.54/109.71 [2019-03-28 12:35:15,903 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 70 172.54/109.71 [2019-03-28 12:35:16,043 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 62 172.54/109.71 [2019-03-28 12:35:16,436 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 61 172.54/109.71 [2019-03-28 12:35:17,461 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 69 172.54/109.71 [2019-03-28 12:35:18,685 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 68 172.54/109.71 [2019-03-28 12:35:18,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 172.54/109.71 [2019-03-28 12:35:18,881 INFO L93 Difference]: Finished difference Result 185 states and 261 transitions. 172.54/109.71 [2019-03-28 12:35:18,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. 172.54/109.71 [2019-03-28 12:35:18,882 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 20 172.54/109.71 [2019-03-28 12:35:18,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 172.54/109.71 [2019-03-28 12:35:18,883 INFO L225 Difference]: With dead ends: 185 172.54/109.71 [2019-03-28 12:35:18,883 INFO L226 Difference]: Without dead ends: 184 172.54/109.71 [2019-03-28 12:35:18,884 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 969 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=1026, Invalid=2756, Unknown=0, NotChecked=0, Total=3782 172.54/109.71 [2019-03-28 12:35:18,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. 172.54/109.71 [2019-03-28 12:35:18,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 66. 172.54/109.71 [2019-03-28 12:35:18,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. 172.54/109.71 [2019-03-28 12:35:18,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 97 transitions. 172.54/109.71 [2019-03-28 12:35:18,894 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 97 transitions. Word has length 20 172.54/109.71 [2019-03-28 12:35:18,894 INFO L84 Accepts]: Finished accepts. word is rejected. 172.54/109.71 [2019-03-28 12:35:18,894 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 97 transitions. 172.54/109.71 [2019-03-28 12:35:18,894 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. 172.54/109.71 [2019-03-28 12:35:18,895 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 97 transitions. 172.54/109.71 [2019-03-28 12:35:18,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 172.54/109.71 [2019-03-28 12:35:18,895 INFO L394 BasicCegarLoop]: Found error trace 172.54/109.71 [2019-03-28 12:35:18,895 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 172.54/109.71 [2019-03-28 12:35:18,895 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION]=== 172.54/109.71 [2019-03-28 12:35:18,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 172.54/109.71 [2019-03-28 12:35:18,896 INFO L82 PathProgramCache]: Analyzing trace with hash -102683910, now seen corresponding path program 1 times 172.54/109.71 [2019-03-28 12:35:18,896 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 172.54/109.71 [2019-03-28 12:35:18,896 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 172.54/109.71 [2019-03-28 12:35:18,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 172.54/109.71 [2019-03-28 12:35:18,897 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 172.54/109.71 [2019-03-28 12:35:18,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 172.54/109.71 [2019-03-28 12:35:18,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 172.54/109.71 [2019-03-28 12:35:18,932 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 172.54/109.71 [2019-03-28 12:35:18,932 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 172.54/109.71 [2019-03-28 12:35:18,932 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 172.54/109.71 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 172.54/109.71 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 172.54/109.71 Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 172.54/109.71 [2019-03-28 12:35:18,946 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 172.54/109.71 [2019-03-28 12:35:18,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 172.54/109.71 [2019-03-28 12:35:18,970 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 3 conjunts are in the unsatisfiable core 172.54/109.71 [2019-03-28 12:35:18,971 INFO L279 TraceCheckSpWp]: Computing forward predicates... 172.54/109.71 [2019-03-28 12:35:18,986 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 172.54/109.71 [2019-03-28 12:35:19,015 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. 172.54/109.71 [2019-03-28 12:35:19,015 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 172.54/109.71 [2019-03-28 12:35:19,016 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states 172.54/109.71 [2019-03-28 12:35:19,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. 172.54/109.71 [2019-03-28 12:35:19,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 172.54/109.71 [2019-03-28 12:35:19,016 INFO L87 Difference]: Start difference. First operand 66 states and 97 transitions. Second operand 7 states. 172.54/109.71 [2019-03-28 12:35:19,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 172.54/109.71 [2019-03-28 12:35:19,176 INFO L93 Difference]: Finished difference Result 81 states and 112 transitions. 172.54/109.71 [2019-03-28 12:35:19,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 172.54/109.71 [2019-03-28 12:35:19,176 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 172.54/109.71 [2019-03-28 12:35:19,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 172.54/109.71 [2019-03-28 12:35:19,177 INFO L225 Difference]: With dead ends: 81 172.54/109.71 [2019-03-28 12:35:19,177 INFO L226 Difference]: Without dead ends: 80 172.54/109.71 [2019-03-28 12:35:19,178 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 172.54/109.71 [2019-03-28 12:35:19,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. 172.54/109.71 [2019-03-28 12:35:19,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 66. 172.54/109.71 [2019-03-28 12:35:19,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. 172.54/109.71 [2019-03-28 12:35:19,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 94 transitions. 172.54/109.71 [2019-03-28 12:35:19,186 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 94 transitions. Word has length 20 172.54/109.71 [2019-03-28 12:35:19,187 INFO L84 Accepts]: Finished accepts. word is rejected. 172.54/109.71 [2019-03-28 12:35:19,187 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 94 transitions. 172.54/109.71 [2019-03-28 12:35:19,187 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. 172.54/109.71 [2019-03-28 12:35:19,187 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 94 transitions. 172.54/109.71 [2019-03-28 12:35:19,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 172.54/109.71 [2019-03-28 12:35:19,187 INFO L394 BasicCegarLoop]: Found error trace 172.54/109.71 [2019-03-28 12:35:19,188 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 172.54/109.71 [2019-03-28 12:35:19,188 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION]=== 172.54/109.71 [2019-03-28 12:35:19,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 172.54/109.71 [2019-03-28 12:35:19,188 INFO L82 PathProgramCache]: Analyzing trace with hash -1042504447, now seen corresponding path program 1 times 172.54/109.71 [2019-03-28 12:35:19,188 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 172.54/109.71 [2019-03-28 12:35:19,188 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 172.54/109.71 [2019-03-28 12:35:19,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 172.54/109.71 [2019-03-28 12:35:19,189 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 172.54/109.71 [2019-03-28 12:35:19,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 172.54/109.71 [2019-03-28 12:35:19,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 172.54/109.71 [2019-03-28 12:35:19,375 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 172.54/109.71 [2019-03-28 12:35:19,375 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 172.54/109.71 [2019-03-28 12:35:19,375 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 172.54/109.71 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 172.54/109.71 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 172.54/109.71 Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 172.54/109.71 [2019-03-28 12:35:19,387 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 172.54/109.71 [2019-03-28 12:35:19,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 172.54/109.71 [2019-03-28 12:35:19,419 INFO L256 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 23 conjunts are in the unsatisfiable core 172.54/109.71 [2019-03-28 12:35:19,421 INFO L279 TraceCheckSpWp]: Computing forward predicates... 172.54/109.71 [2019-03-28 12:35:19,438 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 172.54/109.71 [2019-03-28 12:35:19,438 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 25 172.54/109.71 [2019-03-28 12:35:19,439 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 172.54/109.71 [2019-03-28 12:35:19,456 INFO L497 ElimStorePlain]: treesize reduction 10, result has 64.3 percent of original size 172.54/109.71 [2019-03-28 12:35:19,457 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. 172.54/109.71 [2019-03-28 12:35:19,457 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:13, output treesize:9 172.54/109.71 [2019-03-28 12:35:19,473 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 172.54/109.71 [2019-03-28 12:35:19,474 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 172.54/109.71 [2019-03-28 12:35:19,475 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 172.54/109.71 [2019-03-28 12:35:19,476 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. 172.54/109.71 [2019-03-28 12:35:19,476 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 172.54/109.71 [2019-03-28 12:35:19,511 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 172.54/109.71 [2019-03-28 12:35:19,512 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 19 172.54/109.71 [2019-03-28 12:35:19,513 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. 172.54/109.71 [2019-03-28 12:35:19,519 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 172.54/109.71 [2019-03-28 12:35:19,520 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. 172.54/109.71 [2019-03-28 12:35:19,520 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:20 172.54/109.71 [2019-03-28 12:35:19,552 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. 172.54/109.71 [2019-03-28 12:35:19,579 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 172.54/109.71 [2019-03-28 12:35:19,579 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 12 172.54/109.71 [2019-03-28 12:35:19,579 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states 172.54/109.71 [2019-03-28 12:35:19,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. 172.54/109.71 [2019-03-28 12:35:19,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 172.54/109.71 [2019-03-28 12:35:19,580 INFO L87 Difference]: Start difference. First operand 66 states and 94 transitions. Second operand 13 states. 172.54/109.71 [2019-03-28 12:35:20,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 172.54/109.71 [2019-03-28 12:35:20,195 INFO L93 Difference]: Finished difference Result 125 states and 173 transitions. 172.54/109.71 [2019-03-28 12:35:20,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. 172.54/109.71 [2019-03-28 12:35:20,196 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 23 172.54/109.71 [2019-03-28 12:35:20,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 172.54/109.71 [2019-03-28 12:35:20,197 INFO L225 Difference]: With dead ends: 125 172.54/109.71 [2019-03-28 12:35:20,197 INFO L226 Difference]: Without dead ends: 124 172.54/109.71 [2019-03-28 12:35:20,197 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=187, Invalid=413, Unknown=0, NotChecked=0, Total=600 172.54/109.71 [2019-03-28 12:35:20,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. 172.54/109.71 [2019-03-28 12:35:20,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 79. 172.54/109.71 [2019-03-28 12:35:20,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. 172.54/109.71 [2019-03-28 12:35:20,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 114 transitions. 172.54/109.71 [2019-03-28 12:35:20,208 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 114 transitions. Word has length 23 172.54/109.71 [2019-03-28 12:35:20,208 INFO L84 Accepts]: Finished accepts. word is rejected. 172.54/109.71 [2019-03-28 12:35:20,208 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 114 transitions. 172.54/109.71 [2019-03-28 12:35:20,208 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. 172.54/109.71 [2019-03-28 12:35:20,209 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 114 transitions. 172.54/109.71 [2019-03-28 12:35:20,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 172.54/109.71 [2019-03-28 12:35:20,209 INFO L394 BasicCegarLoop]: Found error trace 172.54/109.71 [2019-03-28 12:35:20,209 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 172.54/109.71 [2019-03-28 12:35:20,209 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION]=== 172.54/109.71 [2019-03-28 12:35:20,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 172.54/109.71 [2019-03-28 12:35:20,210 INFO L82 PathProgramCache]: Analyzing trace with hash 394319420, now seen corresponding path program 1 times 172.54/109.71 [2019-03-28 12:35:20,210 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 172.54/109.71 [2019-03-28 12:35:20,210 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 172.54/109.71 [2019-03-28 12:35:20,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 172.54/109.71 [2019-03-28 12:35:20,211 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 172.54/109.71 [2019-03-28 12:35:20,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 172.54/109.71 [2019-03-28 12:35:20,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 172.54/109.71 [2019-03-28 12:35:20,255 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. 172.54/109.71 [2019-03-28 12:35:20,255 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 172.54/109.71 [2019-03-28 12:35:20,256 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 172.54/109.71 [2019-03-28 12:35:20,256 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states 172.54/109.71 [2019-03-28 12:35:20,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. 172.54/109.71 [2019-03-28 12:35:20,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 172.54/109.71 [2019-03-28 12:35:20,257 INFO L87 Difference]: Start difference. First operand 79 states and 114 transitions. Second operand 5 states. 172.54/109.71 [2019-03-28 12:35:20,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 172.54/109.71 [2019-03-28 12:35:20,366 INFO L93 Difference]: Finished difference Result 81 states and 114 transitions. 172.54/109.71 [2019-03-28 12:35:20,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 172.54/109.71 [2019-03-28 12:35:20,367 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 172.54/109.71 [2019-03-28 12:35:20,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 172.54/109.71 [2019-03-28 12:35:20,368 INFO L225 Difference]: With dead ends: 81 172.54/109.71 [2019-03-28 12:35:20,368 INFO L226 Difference]: Without dead ends: 80 172.54/109.71 [2019-03-28 12:35:20,368 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 172.54/109.71 [2019-03-28 12:35:20,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. 172.54/109.71 [2019-03-28 12:35:20,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 79. 172.54/109.71 [2019-03-28 12:35:20,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. 172.54/109.71 [2019-03-28 12:35:20,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 112 transitions. 172.54/109.71 [2019-03-28 12:35:20,380 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 112 transitions. Word has length 24 172.54/109.71 [2019-03-28 12:35:20,380 INFO L84 Accepts]: Finished accepts. word is rejected. 172.54/109.71 [2019-03-28 12:35:20,380 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 112 transitions. 172.54/109.71 [2019-03-28 12:35:20,380 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. 172.54/109.71 [2019-03-28 12:35:20,380 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 112 transitions. 172.54/109.71 [2019-03-28 12:35:20,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 172.54/109.71 [2019-03-28 12:35:20,381 INFO L394 BasicCegarLoop]: Found error trace 172.54/109.71 [2019-03-28 12:35:20,381 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 172.54/109.71 [2019-03-28 12:35:20,381 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION]=== 172.54/109.71 [2019-03-28 12:35:20,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 172.54/109.71 [2019-03-28 12:35:20,382 INFO L82 PathProgramCache]: Analyzing trace with hash 394319421, now seen corresponding path program 1 times 172.54/109.71 [2019-03-28 12:35:20,382 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 172.54/109.71 [2019-03-28 12:35:20,382 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 172.54/109.71 [2019-03-28 12:35:20,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 172.54/109.71 [2019-03-28 12:35:20,383 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 172.54/109.71 [2019-03-28 12:35:20,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 172.54/109.71 [2019-03-28 12:35:20,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 172.54/109.71 [2019-03-28 12:35:20,416 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. 172.54/109.71 [2019-03-28 12:35:20,416 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 172.54/109.71 [2019-03-28 12:35:20,417 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 172.54/109.71 [2019-03-28 12:35:20,417 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states 172.54/109.71 [2019-03-28 12:35:20,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. 172.54/109.71 [2019-03-28 12:35:20,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 172.54/109.71 [2019-03-28 12:35:20,417 INFO L87 Difference]: Start difference. First operand 79 states and 112 transitions. Second operand 4 states. 172.54/109.71 [2019-03-28 12:35:20,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 172.54/109.71 [2019-03-28 12:35:20,477 INFO L93 Difference]: Finished difference Result 80 states and 112 transitions. 172.54/109.71 [2019-03-28 12:35:20,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 172.54/109.71 [2019-03-28 12:35:20,477 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 172.54/109.71 [2019-03-28 12:35:20,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 172.54/109.71 [2019-03-28 12:35:20,478 INFO L225 Difference]: With dead ends: 80 172.54/109.71 [2019-03-28 12:35:20,478 INFO L226 Difference]: Without dead ends: 79 172.54/109.71 [2019-03-28 12:35:20,478 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 172.54/109.71 [2019-03-28 12:35:20,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. 172.54/109.71 [2019-03-28 12:35:20,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. 172.54/109.71 [2019-03-28 12:35:20,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. 172.54/109.71 [2019-03-28 12:35:20,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 110 transitions. 172.54/109.71 [2019-03-28 12:35:20,489 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 110 transitions. Word has length 24 172.54/109.71 [2019-03-28 12:35:20,489 INFO L84 Accepts]: Finished accepts. word is rejected. 172.54/109.71 [2019-03-28 12:35:20,489 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 110 transitions. 172.54/109.71 [2019-03-28 12:35:20,490 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. 172.54/109.71 [2019-03-28 12:35:20,490 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 110 transitions. 172.54/109.71 [2019-03-28 12:35:20,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 172.54/109.71 [2019-03-28 12:35:20,490 INFO L394 BasicCegarLoop]: Found error trace 172.54/109.71 [2019-03-28 12:35:20,490 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 172.54/109.71 [2019-03-28 12:35:20,490 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION]=== 172.54/109.71 [2019-03-28 12:35:20,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 172.54/109.71 [2019-03-28 12:35:20,491 INFO L82 PathProgramCache]: Analyzing trace with hash -2050180499, now seen corresponding path program 2 times 172.54/109.71 [2019-03-28 12:35:20,491 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 172.54/109.71 [2019-03-28 12:35:20,491 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 172.54/109.71 [2019-03-28 12:35:20,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 172.54/109.71 [2019-03-28 12:35:20,492 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 172.54/109.71 [2019-03-28 12:35:20,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 172.54/109.71 [2019-03-28 12:35:20,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 172.54/109.71 [2019-03-28 12:35:20,868 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 172.54/109.71 [2019-03-28 12:35:20,868 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 172.54/109.71 [2019-03-28 12:35:20,868 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 172.54/109.71 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 172.54/109.71 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 172.54/109.71 Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 172.54/109.71 [2019-03-28 12:35:20,879 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 172.54/109.71 [2019-03-28 12:35:20,908 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) 172.54/109.71 [2019-03-28 12:35:20,908 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat 172.54/109.71 [2019-03-28 12:35:20,909 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 31 conjunts are in the unsatisfiable core 172.54/109.71 [2019-03-28 12:35:20,911 INFO L279 TraceCheckSpWp]: Computing forward predicates... 172.54/109.71 [2019-03-28 12:35:20,918 INFO L189 IndexEqualityManager]: detected not equals via solver 172.54/109.71 [2019-03-28 12:35:20,919 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 172.54/109.71 [2019-03-28 12:35:20,920 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 172.54/109.71 [2019-03-28 12:35:20,930 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 172.54/109.71 [2019-03-28 12:35:20,930 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 172.54/109.71 [2019-03-28 12:35:20,931 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:23 172.54/109.71 [2019-03-28 12:35:20,962 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 172.54/109.71 [2019-03-28 12:35:20,963 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 172.54/109.71 [2019-03-28 12:35:20,975 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 172.54/109.71 [2019-03-28 12:35:20,976 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. 172.54/109.71 [2019-03-28 12:35:20,976 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:33 172.54/109.71 [2019-03-28 12:35:21,018 INFO L189 IndexEqualityManager]: detected not equals via solver 172.54/109.71 [2019-03-28 12:35:21,019 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 28 172.54/109.71 [2019-03-28 12:35:21,020 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 172.54/109.71 [2019-03-28 12:35:21,032 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 172.54/109.71 [2019-03-28 12:35:21,033 INFO L427 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. 172.54/109.71 [2019-03-28 12:35:21,033 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:44, output treesize:40 172.54/109.71 [2019-03-28 12:35:21,305 INFO L189 IndexEqualityManager]: detected not equals via solver 172.54/109.71 [2019-03-28 12:35:21,335 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 172.54/109.71 [2019-03-28 12:35:21,336 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 48 treesize of output 77 172.54/109.71 [2019-03-28 12:35:21,350 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. 172.54/109.71 [2019-03-28 12:35:21,405 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 172.54/109.71 [2019-03-28 12:35:21,408 INFO L427 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. 172.54/109.71 [2019-03-28 12:35:21,408 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:70, output treesize:121 172.54/109.71 [2019-03-28 12:35:21,700 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. 172.54/109.71 [2019-03-28 12:35:21,728 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 172.54/109.71 [2019-03-28 12:35:21,729 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 22 172.54/109.71 [2019-03-28 12:35:21,729 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states 172.54/109.71 [2019-03-28 12:35:21,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. 172.54/109.71 [2019-03-28 12:35:21,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=448, Unknown=0, NotChecked=0, Total=506 172.54/109.71 [2019-03-28 12:35:21,730 INFO L87 Difference]: Start difference. First operand 79 states and 110 transitions. Second operand 23 states. 172.54/109.71 [2019-03-28 12:35:22,759 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 67 172.54/109.71 [2019-03-28 12:35:22,927 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 71 172.54/109.71 [2019-03-28 12:35:23,129 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 100 172.54/109.71 [2019-03-28 12:35:23,606 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 74 172.54/109.71 [2019-03-28 12:35:24,638 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 75 172.54/109.71 [2019-03-28 12:35:24,919 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 76 172.54/109.71 [2019-03-28 12:35:25,076 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 66 172.54/109.71 [2019-03-28 12:35:25,384 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 68 172.54/109.71 [2019-03-28 12:35:25,541 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 74 172.54/109.71 [2019-03-28 12:35:26,034 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 70 172.54/109.71 [2019-03-28 12:35:26,219 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 75 172.54/109.71 [2019-03-28 12:35:26,613 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 64 172.54/109.71 [2019-03-28 12:35:27,711 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 72 172.54/109.71 [2019-03-28 12:35:27,887 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 78 172.54/109.71 [2019-03-28 12:35:28,083 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 74 172.54/109.71 [2019-03-28 12:35:28,271 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 79 172.54/109.71 [2019-03-28 12:35:28,466 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 68 172.54/109.71 [2019-03-28 12:35:28,858 WARN L188 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 101 172.54/109.71 [2019-03-28 12:35:29,070 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 83 172.54/109.71 [2019-03-28 12:35:29,249 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 73 172.54/109.71 [2019-03-28 12:35:29,539 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 75 172.54/109.71 [2019-03-28 12:35:30,312 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 68 172.54/109.71 [2019-03-28 12:35:30,484 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 73 172.54/109.71 [2019-03-28 12:35:30,733 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 65 172.54/109.71 [2019-03-28 12:35:31,214 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 97 172.54/109.71 [2019-03-28 12:35:34,217 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 71 172.54/109.71 [2019-03-28 12:35:34,662 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 71 172.54/109.71 [2019-03-28 12:35:35,283 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 72 172.54/109.71 [2019-03-28 12:35:36,793 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 99 172.54/109.71 [2019-03-28 12:35:37,647 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 73 172.54/109.71 [2019-03-28 12:35:39,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 172.54/109.71 [2019-03-28 12:35:39,211 INFO L93 Difference]: Finished difference Result 281 states and 380 transitions. 172.54/109.71 [2019-03-28 12:35:39,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. 172.54/109.71 [2019-03-28 12:35:39,212 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 27 172.54/109.71 [2019-03-28 12:35:39,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 172.54/109.71 [2019-03-28 12:35:39,214 INFO L225 Difference]: With dead ends: 281 172.54/109.71 [2019-03-28 12:35:39,214 INFO L226 Difference]: Without dead ends: 280 172.54/109.71 [2019-03-28 12:35:39,217 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3100 ImplicationChecksByTransitivity, 11.2s TimeCoverageRelationStatistics Valid=2104, Invalid=7796, Unknown=0, NotChecked=0, Total=9900 172.54/109.71 [2019-03-28 12:35:39,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. 172.54/109.71 [2019-03-28 12:35:39,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 188. 172.54/109.71 [2019-03-28 12:35:39,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. 172.54/109.71 [2019-03-28 12:35:39,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 261 transitions. 172.54/109.71 [2019-03-28 12:35:39,253 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 261 transitions. Word has length 27 172.54/109.71 [2019-03-28 12:35:39,253 INFO L84 Accepts]: Finished accepts. word is rejected. 172.54/109.71 [2019-03-28 12:35:39,253 INFO L480 AbstractCegarLoop]: Abstraction has 188 states and 261 transitions. 172.54/109.71 [2019-03-28 12:35:39,253 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. 172.54/109.71 [2019-03-28 12:35:39,253 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 261 transitions. 172.54/109.71 [2019-03-28 12:35:39,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 172.54/109.71 [2019-03-28 12:35:39,254 INFO L394 BasicCegarLoop]: Found error trace 172.54/109.71 [2019-03-28 12:35:39,254 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] 172.54/109.71 [2019-03-28 12:35:39,254 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION]=== 172.54/109.71 [2019-03-28 12:35:39,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 172.54/109.71 [2019-03-28 12:35:39,254 INFO L82 PathProgramCache]: Analyzing trace with hash -1976951570, now seen corresponding path program 2 times 172.54/109.71 [2019-03-28 12:35:39,255 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 172.54/109.71 [2019-03-28 12:35:39,255 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 172.54/109.71 [2019-03-28 12:35:39,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 172.54/109.71 [2019-03-28 12:35:39,256 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 172.54/109.71 [2019-03-28 12:35:39,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 172.54/109.71 [2019-03-28 12:35:39,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 172.54/109.71 [2019-03-28 12:35:39,510 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 172.54/109.71 [2019-03-28 12:35:39,510 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 172.54/109.71 [2019-03-28 12:35:39,511 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 172.54/109.71 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 172.54/109.71 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 172.54/109.71 Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 172.54/109.71 [2019-03-28 12:35:39,521 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 172.54/109.71 [2019-03-28 12:35:39,548 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) 172.54/109.71 [2019-03-28 12:35:39,549 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat 172.54/109.71 [2019-03-28 12:35:39,550 INFO L256 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 26 conjunts are in the unsatisfiable core 172.54/109.71 [2019-03-28 12:35:39,552 INFO L279 TraceCheckSpWp]: Computing forward predicates... 172.54/109.71 [2019-03-28 12:35:39,558 INFO L189 IndexEqualityManager]: detected not equals via solver 172.54/109.71 [2019-03-28 12:35:39,559 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 172.54/109.71 [2019-03-28 12:35:39,559 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 172.54/109.71 [2019-03-28 12:35:39,568 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 172.54/109.71 [2019-03-28 12:35:39,569 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 172.54/109.71 [2019-03-28 12:35:39,569 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:23 172.54/109.71 [2019-03-28 12:35:39,594 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 172.54/109.71 [2019-03-28 12:35:39,594 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 172.54/109.71 [2019-03-28 12:35:39,606 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 172.54/109.71 [2019-03-28 12:35:39,607 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. 172.54/109.71 [2019-03-28 12:35:39,607 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:33 172.54/109.71 [2019-03-28 12:35:39,637 INFO L189 IndexEqualityManager]: detected not equals via solver 172.54/109.71 [2019-03-28 12:35:39,639 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 28 172.54/109.71 [2019-03-28 12:35:39,639 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 172.54/109.71 [2019-03-28 12:35:39,651 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 172.54/109.71 [2019-03-28 12:35:39,652 INFO L427 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. 172.54/109.71 [2019-03-28 12:35:39,652 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:44, output treesize:40 172.54/109.71 [2019-03-28 12:35:39,702 INFO L189 IndexEqualityManager]: detected not equals via solver 172.54/109.71 [2019-03-28 12:35:39,708 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 172.54/109.71 [2019-03-28 12:35:39,708 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 23 172.54/109.71 [2019-03-28 12:35:39,709 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. 172.54/109.71 [2019-03-28 12:35:39,729 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 172.54/109.71 [2019-03-28 12:35:39,731 INFO L427 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 172.54/109.71 [2019-03-28 12:35:39,731 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:54, output treesize:27 172.54/109.71 [2019-03-28 12:35:39,820 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. 172.54/109.71 [2019-03-28 12:35:39,847 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 172.54/109.71 [2019-03-28 12:35:39,848 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 14 172.54/109.71 [2019-03-28 12:35:39,848 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states 172.54/109.71 [2019-03-28 12:35:39,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. 172.54/109.71 [2019-03-28 12:35:39,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 172.54/109.71 [2019-03-28 12:35:39,849 INFO L87 Difference]: Start difference. First operand 188 states and 261 transitions. Second operand 15 states. 172.54/109.71 [2019-03-28 12:35:41,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 172.54/109.71 [2019-03-28 12:35:41,953 INFO L93 Difference]: Finished difference Result 316 states and 426 transitions. 172.54/109.71 [2019-03-28 12:35:41,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. 172.54/109.71 [2019-03-28 12:35:41,954 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 29 172.54/109.71 [2019-03-28 12:35:41,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 172.54/109.71 [2019-03-28 12:35:41,956 INFO L225 Difference]: With dead ends: 316 172.54/109.71 [2019-03-28 12:35:41,956 INFO L226 Difference]: Without dead ends: 315 172.54/109.71 [2019-03-28 12:35:41,957 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 23 SyntacticMatches, 3 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 247 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=314, Invalid=876, Unknown=0, NotChecked=0, Total=1190 172.54/109.71 [2019-03-28 12:35:41,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. 172.54/109.71 [2019-03-28 12:35:41,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 271. 172.54/109.71 [2019-03-28 12:35:41,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. 172.54/109.71 [2019-03-28 12:35:41,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 380 transitions. 172.54/109.71 [2019-03-28 12:35:41,990 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 380 transitions. Word has length 29 172.54/109.71 [2019-03-28 12:35:41,990 INFO L84 Accepts]: Finished accepts. word is rejected. 172.54/109.71 [2019-03-28 12:35:41,992 INFO L480 AbstractCegarLoop]: Abstraction has 271 states and 380 transitions. 172.54/109.71 [2019-03-28 12:35:41,992 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. 172.54/109.71 [2019-03-28 12:35:41,992 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 380 transitions. 172.54/109.71 [2019-03-28 12:35:41,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 172.54/109.71 [2019-03-28 12:35:41,992 INFO L394 BasicCegarLoop]: Found error trace 172.54/109.71 [2019-03-28 12:35:41,992 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 172.54/109.71 [2019-03-28 12:35:41,993 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION]=== 172.54/109.71 [2019-03-28 12:35:41,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 172.54/109.71 [2019-03-28 12:35:41,993 INFO L82 PathProgramCache]: Analyzing trace with hash -1607619506, now seen corresponding path program 2 times 172.54/109.71 [2019-03-28 12:35:41,993 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 172.54/109.71 [2019-03-28 12:35:41,993 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 172.54/109.71 [2019-03-28 12:35:41,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 172.54/109.71 [2019-03-28 12:35:41,994 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 172.54/109.71 [2019-03-28 12:35:41,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 172.54/109.71 [2019-03-28 12:35:42,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 172.54/109.71 [2019-03-28 12:35:42,094 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. 172.54/109.71 [2019-03-28 12:35:42,094 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 172.54/109.71 [2019-03-28 12:35:42,094 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 172.54/109.71 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 172.54/109.71 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 172.54/109.71 Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 172.54/109.71 [2019-03-28 12:35:42,105 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 172.54/109.71 [2019-03-28 12:35:42,136 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) 172.54/109.71 [2019-03-28 12:35:42,136 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat 172.54/109.71 [2019-03-28 12:35:42,137 INFO L256 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 24 conjunts are in the unsatisfiable core 172.54/109.71 [2019-03-28 12:35:42,139 INFO L279 TraceCheckSpWp]: Computing forward predicates... 172.54/109.71 [2019-03-28 12:35:42,152 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 172.54/109.71 [2019-03-28 12:35:42,153 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 25 172.54/109.71 [2019-03-28 12:35:42,153 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 172.54/109.71 [2019-03-28 12:35:42,168 INFO L497 ElimStorePlain]: treesize reduction 10, result has 64.3 percent of original size 172.54/109.71 [2019-03-28 12:35:42,168 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. 172.54/109.71 [2019-03-28 12:35:42,168 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:13, output treesize:9 172.54/109.71 [2019-03-28 12:35:42,183 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 172.54/109.71 [2019-03-28 12:35:42,183 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 172.54/109.71 [2019-03-28 12:35:42,189 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 172.54/109.71 [2019-03-28 12:35:42,189 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 172.54/109.71 [2019-03-28 12:35:42,190 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:23, output treesize:19 172.54/109.71 [2019-03-28 12:35:42,205 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 172.54/109.71 [2019-03-28 12:35:42,205 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 19 172.54/109.71 [2019-03-28 12:35:42,206 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. 172.54/109.71 [2019-03-28 12:35:42,212 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 172.54/109.71 [2019-03-28 12:35:42,212 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. 172.54/109.71 [2019-03-28 12:35:42,212 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:20 172.54/109.71 [2019-03-28 12:35:42,239 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. 172.54/109.71 [2019-03-28 12:35:42,266 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 172.54/109.71 [2019-03-28 12:35:42,266 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 10 172.54/109.71 [2019-03-28 12:35:42,266 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states 172.54/109.71 [2019-03-28 12:35:42,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. 172.54/109.71 [2019-03-28 12:35:42,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 172.54/109.71 [2019-03-28 12:35:42,267 INFO L87 Difference]: Start difference. First operand 271 states and 380 transitions. Second operand 11 states. 172.54/109.71 [2019-03-28 12:35:42,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 172.54/109.71 [2019-03-28 12:35:42,451 INFO L93 Difference]: Finished difference Result 271 states and 380 transitions. 172.54/109.71 [2019-03-28 12:35:42,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 172.54/109.71 [2019-03-28 12:35:42,452 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 30 172.54/109.71 [2019-03-28 12:35:42,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 172.54/109.71 [2019-03-28 12:35:42,453 INFO L225 Difference]: With dead ends: 271 172.54/109.71 [2019-03-28 12:35:42,453 INFO L226 Difference]: Without dead ends: 270 172.54/109.71 [2019-03-28 12:35:42,454 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 28 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=163, Unknown=0, NotChecked=0, Total=240 172.54/109.71 [2019-03-28 12:35:42,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. 172.54/109.71 [2019-03-28 12:35:42,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 191. 172.54/109.71 [2019-03-28 12:35:42,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. 172.54/109.71 [2019-03-28 12:35:42,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 260 transitions. 172.54/109.71 [2019-03-28 12:35:42,478 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 260 transitions. Word has length 30 172.54/109.71 [2019-03-28 12:35:42,478 INFO L84 Accepts]: Finished accepts. word is rejected. 172.54/109.71 [2019-03-28 12:35:42,479 INFO L480 AbstractCegarLoop]: Abstraction has 191 states and 260 transitions. 172.54/109.71 [2019-03-28 12:35:42,479 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. 172.54/109.71 [2019-03-28 12:35:42,479 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 260 transitions. 172.54/109.71 [2019-03-28 12:35:42,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 172.54/109.71 [2019-03-28 12:35:42,479 INFO L394 BasicCegarLoop]: Found error trace 172.54/109.71 [2019-03-28 12:35:42,479 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 172.54/109.71 [2019-03-28 12:35:42,480 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION]=== 172.54/109.71 [2019-03-28 12:35:42,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 172.54/109.71 [2019-03-28 12:35:42,480 INFO L82 PathProgramCache]: Analyzing trace with hash -719708021, now seen corresponding path program 1 times 172.54/109.71 [2019-03-28 12:35:42,480 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 172.54/109.71 [2019-03-28 12:35:42,480 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 172.54/109.71 [2019-03-28 12:35:42,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 172.54/109.71 [2019-03-28 12:35:42,481 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 172.54/109.71 [2019-03-28 12:35:42,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 172.54/109.71 [2019-03-28 12:35:42,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 172.54/109.71 [2019-03-28 12:35:42,545 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 14 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. 172.54/109.71 [2019-03-28 12:35:42,546 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 172.54/109.71 [2019-03-28 12:35:42,546 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 172.54/109.71 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 172.54/109.71 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 172.54/109.71 Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 172.54/109.71 [2019-03-28 12:35:42,558 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 172.54/109.71 [2019-03-28 12:35:42,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 172.54/109.71 [2019-03-28 12:35:42,596 INFO L256 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 19 conjunts are in the unsatisfiable core 172.54/109.71 [2019-03-28 12:35:42,598 INFO L279 TraceCheckSpWp]: Computing forward predicates... 172.54/109.71 [2019-03-28 12:35:42,609 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 172.54/109.71 [2019-03-28 12:35:42,610 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 172.54/109.71 [2019-03-28 12:35:42,612 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 172.54/109.71 [2019-03-28 12:35:42,612 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. 172.54/109.71 [2019-03-28 12:35:42,613 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:14, output treesize:10 172.54/109.71 [2019-03-28 12:35:43,268 WARN L188 SmtUtils]: Spent 607.00 ms on a formula simplification that was a NOOP. DAG size: 16 172.54/109.71 [2019-03-28 12:35:43,314 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 172.54/109.71 [2019-03-28 12:35:43,315 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 23 172.54/109.71 [2019-03-28 12:35:43,316 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 172.54/109.71 [2019-03-28 12:35:43,320 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 172.54/109.71 [2019-03-28 12:35:43,321 INFO L427 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 172.54/109.71 [2019-03-28 12:35:43,321 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:27, output treesize:5 172.54/109.71 [2019-03-28 12:35:43,324 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 14 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. 172.54/109.71 [2019-03-28 12:35:43,351 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 172.54/109.71 [2019-03-28 12:35:43,351 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 172.54/109.71 [2019-03-28 12:35:43,352 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states 172.54/109.71 [2019-03-28 12:35:43,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. 172.54/109.71 [2019-03-28 12:35:43,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 172.54/109.71 [2019-03-28 12:35:43,352 INFO L87 Difference]: Start difference. First operand 191 states and 260 transitions. Second operand 13 states. 172.54/109.71 [2019-03-28 12:35:43,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 172.54/109.71 [2019-03-28 12:35:43,876 INFO L93 Difference]: Finished difference Result 600 states and 828 transitions. 172.54/109.71 [2019-03-28 12:35:43,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 172.54/109.71 [2019-03-28 12:35:43,877 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 31 172.54/109.71 [2019-03-28 12:35:43,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 172.54/109.71 [2019-03-28 12:35:43,879 INFO L225 Difference]: With dead ends: 600 172.54/109.71 [2019-03-28 12:35:43,879 INFO L226 Difference]: Without dead ends: 506 172.54/109.71 [2019-03-28 12:35:43,880 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=85, Invalid=257, Unknown=0, NotChecked=0, Total=342 172.54/109.71 [2019-03-28 12:35:43,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 506 states. 172.54/109.71 [2019-03-28 12:35:43,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 506 to 348. 172.54/109.71 [2019-03-28 12:35:43,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 348 states. 172.54/109.71 [2019-03-28 12:35:43,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 476 transitions. 172.54/109.71 [2019-03-28 12:35:43,942 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 476 transitions. Word has length 31 172.54/109.71 [2019-03-28 12:35:43,942 INFO L84 Accepts]: Finished accepts. word is rejected. 172.54/109.71 [2019-03-28 12:35:43,943 INFO L480 AbstractCegarLoop]: Abstraction has 348 states and 476 transitions. 172.54/109.71 [2019-03-28 12:35:43,943 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. 172.54/109.71 [2019-03-28 12:35:43,943 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 476 transitions. 172.54/109.71 [2019-03-28 12:35:43,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 172.54/109.71 [2019-03-28 12:35:43,944 INFO L394 BasicCegarLoop]: Found error trace 172.54/109.71 [2019-03-28 12:35:43,944 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 172.54/109.71 [2019-03-28 12:35:43,944 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION]=== 172.54/109.71 [2019-03-28 12:35:43,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 172.54/109.71 [2019-03-28 12:35:43,944 INFO L82 PathProgramCache]: Analyzing trace with hash -1760691957, now seen corresponding path program 1 times 172.54/109.71 [2019-03-28 12:35:43,944 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 172.54/109.71 [2019-03-28 12:35:43,945 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 172.54/109.71 [2019-03-28 12:35:43,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 172.54/109.71 [2019-03-28 12:35:43,945 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 172.54/109.71 [2019-03-28 12:35:43,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 172.54/109.71 [2019-03-28 12:35:43,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 172.54/109.71 [2019-03-28 12:35:43,974 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. 172.54/109.71 [2019-03-28 12:35:43,975 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 172.54/109.71 [2019-03-28 12:35:43,975 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 172.54/109.71 [2019-03-28 12:35:43,975 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states 172.54/109.71 [2019-03-28 12:35:43,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. 172.54/109.71 [2019-03-28 12:35:43,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 172.54/109.71 [2019-03-28 12:35:43,976 INFO L87 Difference]: Start difference. First operand 348 states and 476 transitions. Second operand 5 states. 172.54/109.71 [2019-03-28 12:35:44,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 172.54/109.71 [2019-03-28 12:35:44,150 INFO L93 Difference]: Finished difference Result 668 states and 917 transitions. 172.54/109.71 [2019-03-28 12:35:44,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 172.54/109.71 [2019-03-28 12:35:44,150 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 172.54/109.71 [2019-03-28 12:35:44,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 172.54/109.71 [2019-03-28 12:35:44,153 INFO L225 Difference]: With dead ends: 668 172.54/109.71 [2019-03-28 12:35:44,153 INFO L226 Difference]: Without dead ends: 462 172.54/109.71 [2019-03-28 12:35:44,154 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 172.54/109.71 [2019-03-28 12:35:44,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. 172.54/109.71 [2019-03-28 12:35:44,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 430. 172.54/109.71 [2019-03-28 12:35:44,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 430 states. 172.54/109.71 [2019-03-28 12:35:44,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 584 transitions. 172.54/109.71 [2019-03-28 12:35:44,205 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 584 transitions. Word has length 31 172.54/109.71 [2019-03-28 12:35:44,205 INFO L84 Accepts]: Finished accepts. word is rejected. 172.54/109.71 [2019-03-28 12:35:44,205 INFO L480 AbstractCegarLoop]: Abstraction has 430 states and 584 transitions. 172.54/109.71 [2019-03-28 12:35:44,205 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. 172.54/109.71 [2019-03-28 12:35:44,205 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 584 transitions. 172.54/109.71 [2019-03-28 12:35:44,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 172.54/109.71 [2019-03-28 12:35:44,206 INFO L394 BasicCegarLoop]: Found error trace 172.54/109.71 [2019-03-28 12:35:44,206 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 172.54/109.71 [2019-03-28 12:35:44,206 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION]=== 172.54/109.71 [2019-03-28 12:35:44,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 172.54/109.71 [2019-03-28 12:35:44,207 INFO L82 PathProgramCache]: Analyzing trace with hash -253140148, now seen corresponding path program 1 times 172.54/109.71 [2019-03-28 12:35:44,207 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 172.54/109.71 [2019-03-28 12:35:44,207 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 172.54/109.71 [2019-03-28 12:35:44,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 172.54/109.71 [2019-03-28 12:35:44,208 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 172.54/109.71 [2019-03-28 12:35:44,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 172.54/109.71 [2019-03-28 12:35:44,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 172.54/109.71 [2019-03-28 12:35:44,653 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 172.54/109.71 [2019-03-28 12:35:44,653 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 172.54/109.71 [2019-03-28 12:35:44,653 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 172.54/109.71 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 172.54/109.71 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 172.54/109.71 Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 172.54/109.71 [2019-03-28 12:35:44,664 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 172.54/109.71 [2019-03-28 12:35:44,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 172.54/109.71 [2019-03-28 12:35:44,703 INFO L256 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 56 conjunts are in the unsatisfiable core 172.54/109.71 [2019-03-28 12:35:44,706 INFO L279 TraceCheckSpWp]: Computing forward predicates... 172.54/109.71 [2019-03-28 12:35:44,718 INFO L189 IndexEqualityManager]: detected not equals via solver 172.54/109.71 [2019-03-28 12:35:44,719 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 172.54/109.71 [2019-03-28 12:35:44,720 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 172.54/109.71 [2019-03-28 12:35:44,730 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 172.54/109.71 [2019-03-28 12:35:44,730 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. 172.54/109.71 [2019-03-28 12:35:44,730 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:20 172.54/109.71 [2019-03-28 12:35:44,767 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 172.54/109.71 [2019-03-28 12:35:44,768 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 172.54/109.71 [2019-03-28 12:35:44,777 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 172.54/109.71 [2019-03-28 12:35:44,777 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. 172.54/109.71 [2019-03-28 12:35:44,777 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:23 172.54/109.71 [2019-03-28 12:35:44,814 INFO L189 IndexEqualityManager]: detected not equals via solver 172.54/109.71 [2019-03-28 12:35:44,815 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 172.54/109.71 [2019-03-28 12:35:44,816 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 172.54/109.71 [2019-03-28 12:35:44,825 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 172.54/109.71 [2019-03-28 12:35:44,825 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 172.54/109.71 [2019-03-28 12:35:44,826 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:34, output treesize:30 172.54/109.71 [2019-03-28 12:35:45,385 INFO L189 IndexEqualityManager]: detected not equals via solver 172.54/109.71 [2019-03-28 12:35:45,386 INFO L189 IndexEqualityManager]: detected not equals via solver 172.54/109.71 [2019-03-28 12:35:45,388 INFO L189 IndexEqualityManager]: detected not equals via solver 172.54/109.71 [2019-03-28 12:35:45,400 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 172.54/109.71 [2019-03-28 12:35:45,400 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 2 case distinctions, treesize of input 62 treesize of output 46 172.54/109.71 [2019-03-28 12:35:45,402 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 172.54/109.71 [2019-03-28 12:35:45,416 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 172.54/109.71 [2019-03-28 12:35:45,417 INFO L427 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 172.54/109.71 [2019-03-28 12:35:45,417 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:75, output treesize:26 172.54/109.71 [2019-03-28 12:35:45,565 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 172.54/109.71 [2019-03-28 12:35:45,594 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 172.54/109.71 [2019-03-28 12:35:45,595 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 16] total 28 172.54/109.71 [2019-03-28 12:35:45,595 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states 172.54/109.71 [2019-03-28 12:35:45,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. 172.54/109.71 [2019-03-28 12:35:45,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=721, Unknown=0, NotChecked=0, Total=812 172.54/109.71 [2019-03-28 12:35:45,596 INFO L87 Difference]: Start difference. First operand 430 states and 584 transitions. Second operand 29 states. 172.54/109.71 [2019-03-28 12:35:46,458 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 59 172.54/109.71 [2019-03-28 12:35:46,792 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 63 172.54/109.71 [2019-03-28 12:35:47,424 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 67 172.54/109.71 [2019-03-28 12:35:47,743 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 64 172.54/109.71 [2019-03-28 12:35:49,028 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 68 172.54/109.71 [2019-03-28 12:35:49,179 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 60 172.54/109.71 [2019-03-28 12:35:49,385 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 82 172.54/109.71 [2019-03-28 12:35:49,711 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 70 172.54/109.71 [2019-03-28 12:35:49,894 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 72 172.54/109.71 [2019-03-28 12:35:50,058 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 69 172.54/109.71 [2019-03-28 12:35:50,230 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 67 172.54/109.71 [2019-03-28 12:35:50,948 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 71 172.54/109.71 [2019-03-28 12:35:51,141 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 71 172.54/109.71 [2019-03-28 12:35:51,389 WARN L188 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 86 172.54/109.71 [2019-03-28 12:35:51,532 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 70 172.54/109.71 [2019-03-28 12:35:51,840 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 75 172.54/109.71 [2019-03-28 12:35:52,053 WARN L188 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 73 172.54/109.71 [2019-03-28 12:35:52,317 WARN L188 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 91 172.54/109.71 [2019-03-28 12:35:52,473 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 74 172.54/109.71 [2019-03-28 12:35:52,633 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 70 172.54/109.71 [2019-03-28 12:35:52,857 WARN L188 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 75 172.54/109.71 [2019-03-28 12:35:53,072 WARN L188 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 84 172.54/109.71 [2019-03-28 12:35:53,231 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 62 172.54/109.71 [2019-03-28 12:35:53,780 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 63 172.54/109.71 [2019-03-28 12:35:53,968 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 80 172.54/109.71 [2019-03-28 12:35:54,723 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 75 172.54/109.71 [2019-03-28 12:35:54,867 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 68 172.54/109.71 [2019-03-28 12:35:55,690 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 78 172.54/109.71 [2019-03-28 12:35:55,835 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 72 172.54/109.71 [2019-03-28 12:35:56,352 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 73 172.54/109.71 [2019-03-28 12:35:57,254 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 77 172.54/109.71 [2019-03-28 12:35:57,728 WARN L188 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 82 172.54/109.71 [2019-03-28 12:35:58,083 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 79 172.54/109.71 [2019-03-28 12:35:59,081 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 72 172.54/109.71 [2019-03-28 12:35:59,253 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 74 172.54/109.71 [2019-03-28 12:35:59,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 172.54/109.71 [2019-03-28 12:35:59,608 INFO L93 Difference]: Finished difference Result 911 states and 1219 transitions. 172.54/109.71 [2019-03-28 12:35:59,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. 172.54/109.71 [2019-03-28 12:35:59,608 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 31 172.54/109.71 [2019-03-28 12:35:59,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 172.54/109.71 [2019-03-28 12:35:59,612 INFO L225 Difference]: With dead ends: 911 172.54/109.71 [2019-03-28 12:35:59,612 INFO L226 Difference]: Without dead ends: 910 172.54/109.71 [2019-03-28 12:35:59,617 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5875 ImplicationChecksByTransitivity, 13.1s TimeCoverageRelationStatistics Valid=3317, Invalid=12685, Unknown=0, NotChecked=0, Total=16002 172.54/109.71 [2019-03-28 12:35:59,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 910 states. 172.54/109.71 [2019-03-28 12:35:59,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 910 to 469. 172.54/109.71 [2019-03-28 12:35:59,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 469 states. 172.54/109.71 [2019-03-28 12:35:59,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 637 transitions. 172.54/109.71 [2019-03-28 12:35:59,674 INFO L78 Accepts]: Start accepts. Automaton has 469 states and 637 transitions. Word has length 31 172.54/109.71 [2019-03-28 12:35:59,675 INFO L84 Accepts]: Finished accepts. word is rejected. 172.54/109.71 [2019-03-28 12:35:59,675 INFO L480 AbstractCegarLoop]: Abstraction has 469 states and 637 transitions. 172.54/109.71 [2019-03-28 12:35:59,675 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. 172.54/109.71 [2019-03-28 12:35:59,675 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 637 transitions. 172.54/109.71 [2019-03-28 12:35:59,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 172.54/109.71 [2019-03-28 12:35:59,676 INFO L394 BasicCegarLoop]: Found error trace 172.54/109.71 [2019-03-28 12:35:59,676 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] 172.54/109.71 [2019-03-28 12:35:59,676 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION]=== 172.54/109.71 [2019-03-28 12:35:59,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 172.54/109.71 [2019-03-28 12:35:59,677 INFO L82 PathProgramCache]: Analyzing trace with hash 981422906, now seen corresponding path program 3 times 172.54/109.71 [2019-03-28 12:35:59,677 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 172.54/109.71 [2019-03-28 12:35:59,677 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 172.54/109.71 [2019-03-28 12:35:59,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 172.54/109.71 [2019-03-28 12:35:59,678 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 172.54/109.71 [2019-03-28 12:35:59,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 172.54/109.71 [2019-03-28 12:35:59,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 172.54/109.71 [2019-03-28 12:35:59,863 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. 172.54/109.71 [2019-03-28 12:35:59,864 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 172.54/109.71 [2019-03-28 12:35:59,864 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 172.54/109.71 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 172.54/109.71 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 172.54/109.71 Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 172.54/109.71 [2019-03-28 12:35:59,876 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 172.54/109.71 [2019-03-28 12:35:59,914 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) 172.54/109.71 [2019-03-28 12:35:59,914 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat 172.54/109.71 [2019-03-28 12:35:59,916 INFO L256 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 34 conjunts are in the unsatisfiable core 172.54/109.71 [2019-03-28 12:35:59,918 INFO L279 TraceCheckSpWp]: Computing forward predicates... 172.54/109.71 [2019-03-28 12:35:59,923 INFO L189 IndexEqualityManager]: detected not equals via solver 172.54/109.71 [2019-03-28 12:35:59,924 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 172.54/109.71 [2019-03-28 12:35:59,924 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 172.54/109.71 [2019-03-28 12:35:59,933 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 172.54/109.71 [2019-03-28 12:35:59,934 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 172.54/109.71 [2019-03-28 12:35:59,934 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:23 172.54/109.71 [2019-03-28 12:35:59,963 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 172.54/109.71 [2019-03-28 12:35:59,963 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 172.54/109.71 [2019-03-28 12:35:59,971 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 172.54/109.71 [2019-03-28 12:35:59,972 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 172.54/109.71 [2019-03-28 12:35:59,972 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:30, output treesize:26 172.54/109.71 [2019-03-28 12:36:00,003 INFO L189 IndexEqualityManager]: detected not equals via solver 172.54/109.71 [2019-03-28 12:36:00,004 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 172.54/109.71 [2019-03-28 12:36:00,005 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 172.54/109.71 [2019-03-28 12:36:00,016 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 172.54/109.71 [2019-03-28 12:36:00,017 INFO L427 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. 172.54/109.71 [2019-03-28 12:36:00,017 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:33 172.54/109.71 [2019-03-28 12:36:00,213 INFO L189 IndexEqualityManager]: detected not equals via solver 172.54/109.71 [2019-03-28 12:36:00,242 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 172.54/109.71 [2019-03-28 12:36:00,243 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 45 treesize of output 73 172.54/109.71 [2019-03-28 12:36:00,255 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. 172.54/109.71 [2019-03-28 12:36:00,360 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 45 172.54/109.71 [2019-03-28 12:36:00,360 INFO L497 ElimStorePlain]: treesize reduction 8, result has 94.2 percent of original size 172.54/109.71 [2019-03-28 12:36:00,362 INFO L427 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. 172.54/109.71 [2019-03-28 12:36:00,362 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:61, output treesize:129 172.54/109.71 [2019-03-28 12:36:00,537 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 8 proven. 19 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. 172.54/109.71 [2019-03-28 12:36:00,565 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 172.54/109.71 [2019-03-28 12:36:00,565 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 22 172.54/109.71 [2019-03-28 12:36:00,565 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states 172.54/109.71 [2019-03-28 12:36:00,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. 172.54/109.71 [2019-03-28 12:36:00,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=427, Unknown=0, NotChecked=0, Total=506 172.54/109.71 [2019-03-28 12:36:00,566 INFO L87 Difference]: Start difference. First operand 469 states and 637 transitions. Second operand 23 states. 172.54/109.71 [2019-03-28 12:36:01,908 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 71 172.54/109.71 [2019-03-28 12:36:02,050 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 88 172.54/109.71 [2019-03-28 12:36:04,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 172.54/109.71 [2019-03-28 12:36:04,069 INFO L93 Difference]: Finished difference Result 523 states and 700 transitions. 172.54/109.71 [2019-03-28 12:36:04,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. 172.54/109.71 [2019-03-28 12:36:04,069 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 34 172.54/109.71 [2019-03-28 12:36:04,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 172.54/109.71 [2019-03-28 12:36:04,072 INFO L225 Difference]: With dead ends: 523 172.54/109.71 [2019-03-28 12:36:04,072 INFO L226 Difference]: Without dead ends: 522 172.54/109.71 [2019-03-28 12:36:04,073 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 645 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=880, Invalid=2200, Unknown=0, NotChecked=0, Total=3080 172.54/109.71 [2019-03-28 12:36:04,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. 172.54/109.71 [2019-03-28 12:36:04,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 293. 172.54/109.71 [2019-03-28 12:36:04,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 293 states. 172.54/109.71 [2019-03-28 12:36:04,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 392 transitions. 172.54/109.71 [2019-03-28 12:36:04,116 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 392 transitions. Word has length 34 172.54/109.71 [2019-03-28 12:36:04,116 INFO L84 Accepts]: Finished accepts. word is rejected. 172.54/109.71 [2019-03-28 12:36:04,117 INFO L480 AbstractCegarLoop]: Abstraction has 293 states and 392 transitions. 172.54/109.71 [2019-03-28 12:36:04,117 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. 172.54/109.71 [2019-03-28 12:36:04,117 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 392 transitions. 172.54/109.71 [2019-03-28 12:36:04,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 172.54/109.71 [2019-03-28 12:36:04,118 INFO L394 BasicCegarLoop]: Found error trace 172.54/109.71 [2019-03-28 12:36:04,118 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] 172.54/109.71 [2019-03-28 12:36:04,118 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION]=== 172.54/109.71 [2019-03-28 12:36:04,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 172.54/109.71 [2019-03-28 12:36:04,118 INFO L82 PathProgramCache]: Analyzing trace with hash -34740516, now seen corresponding path program 1 times 172.54/109.71 [2019-03-28 12:36:04,118 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 172.54/109.71 [2019-03-28 12:36:04,119 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 172.54/109.71 [2019-03-28 12:36:04,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 172.54/109.71 [2019-03-28 12:36:04,119 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 172.54/109.71 [2019-03-28 12:36:04,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 172.54/109.71 [2019-03-28 12:36:04,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 172.54/109.71 [2019-03-28 12:36:04,376 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. 172.54/109.71 [2019-03-28 12:36:04,376 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 172.54/109.71 [2019-03-28 12:36:04,376 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 172.54/109.71 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 172.54/109.71 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 172.54/109.71 Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 172.54/109.71 [2019-03-28 12:36:04,387 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 172.54/109.71 [2019-03-28 12:36:04,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 172.54/109.71 [2019-03-28 12:36:04,419 INFO L256 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 41 conjunts are in the unsatisfiable core 172.54/109.71 [2019-03-28 12:36:04,421 INFO L279 TraceCheckSpWp]: Computing forward predicates... 172.54/109.71 [2019-03-28 12:36:04,426 INFO L189 IndexEqualityManager]: detected not equals via solver 172.54/109.71 [2019-03-28 12:36:04,427 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 172.54/109.71 [2019-03-28 12:36:04,427 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 172.54/109.71 [2019-03-28 12:36:04,434 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 172.54/109.71 [2019-03-28 12:36:04,435 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. 172.54/109.71 [2019-03-28 12:36:04,435 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:20 172.54/109.71 [2019-03-28 12:36:04,460 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 172.54/109.71 [2019-03-28 12:36:04,461 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 172.54/109.71 [2019-03-28 12:36:04,467 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 172.54/109.71 [2019-03-28 12:36:04,467 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. 172.54/109.71 [2019-03-28 12:36:04,468 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:23 172.54/109.71 [2019-03-28 12:36:04,494 INFO L189 IndexEqualityManager]: detected not equals via solver 172.54/109.71 [2019-03-28 12:36:04,495 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 172.54/109.71 [2019-03-28 12:36:04,495 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 172.54/109.71 [2019-03-28 12:36:04,502 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 172.54/109.71 [2019-03-28 12:36:04,503 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. 172.54/109.71 [2019-03-28 12:36:04,503 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:30 172.54/109.71 [2019-03-28 12:36:04,802 INFO L189 IndexEqualityManager]: detected not equals via solver 172.54/109.71 [2019-03-28 12:36:04,833 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 172.54/109.71 [2019-03-28 12:36:04,833 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 47 treesize of output 75 172.54/109.71 [2019-03-28 12:36:04,846 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. 172.54/109.71 [2019-03-28 12:36:04,947 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 44 172.54/109.71 [2019-03-28 12:36:04,948 INFO L497 ElimStorePlain]: treesize reduction 8, result has 94.3 percent of original size 172.54/109.71 [2019-03-28 12:36:04,949 INFO L427 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. 172.54/109.71 [2019-03-28 12:36:04,949 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:60, output treesize:132 172.54/109.71 [2019-03-28 12:36:05,127 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 12 proven. 11 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. 172.54/109.71 [2019-03-28 12:36:05,154 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 172.54/109.71 [2019-03-28 12:36:05,155 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 23 172.54/109.71 [2019-03-28 12:36:05,155 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states 172.54/109.71 [2019-03-28 12:36:05,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. 172.54/109.71 [2019-03-28 12:36:05,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=454, Unknown=0, NotChecked=0, Total=552 172.54/109.71 [2019-03-28 12:36:05,156 INFO L87 Difference]: Start difference. First operand 293 states and 392 transitions. Second operand 24 states. 172.54/109.71 [2019-03-28 12:36:06,409 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 61 172.54/109.71 [2019-03-28 12:36:06,666 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 57 172.54/109.71 [2019-03-28 12:36:07,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 172.54/109.71 [2019-03-28 12:36:07,743 INFO L93 Difference]: Finished difference Result 427 states and 562 transitions. 172.54/109.71 [2019-03-28 12:36:07,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. 172.54/109.71 [2019-03-28 12:36:07,743 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 40 172.54/109.71 [2019-03-28 12:36:07,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 172.54/109.71 [2019-03-28 12:36:07,745 INFO L225 Difference]: With dead ends: 427 172.54/109.71 [2019-03-28 12:36:07,745 INFO L226 Difference]: Without dead ends: 426 172.54/109.71 [2019-03-28 12:36:07,746 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 474 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=609, Invalid=1841, Unknown=0, NotChecked=0, Total=2450 172.54/109.71 [2019-03-28 12:36:07,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. 172.54/109.71 [2019-03-28 12:36:07,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 273. 172.54/109.71 [2019-03-28 12:36:07,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273 states. 172.54/109.71 [2019-03-28 12:36:07,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 366 transitions. 172.54/109.71 [2019-03-28 12:36:07,788 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 366 transitions. Word has length 40 172.54/109.71 [2019-03-28 12:36:07,788 INFO L84 Accepts]: Finished accepts. word is rejected. 172.54/109.71 [2019-03-28 12:36:07,789 INFO L480 AbstractCegarLoop]: Abstraction has 273 states and 366 transitions. 172.54/109.71 [2019-03-28 12:36:07,789 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. 172.54/109.71 [2019-03-28 12:36:07,789 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 366 transitions. 172.54/109.71 [2019-03-28 12:36:07,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 172.54/109.71 [2019-03-28 12:36:07,789 INFO L394 BasicCegarLoop]: Found error trace 172.54/109.71 [2019-03-28 12:36:07,790 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] 172.54/109.71 [2019-03-28 12:36:07,790 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION]=== 172.54/109.71 [2019-03-28 12:36:07,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 172.54/109.71 [2019-03-28 12:36:07,790 INFO L82 PathProgramCache]: Analyzing trace with hash -33816995, now seen corresponding path program 1 times 172.54/109.71 [2019-03-28 12:36:07,790 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 172.54/109.71 [2019-03-28 12:36:07,790 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 172.54/109.71 [2019-03-28 12:36:07,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 172.54/109.71 [2019-03-28 12:36:07,791 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 172.54/109.71 [2019-03-28 12:36:07,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 172.54/109.71 [2019-03-28 12:36:07,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 172.54/109.71 [2019-03-28 12:36:07,994 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. 172.54/109.71 [2019-03-28 12:36:07,994 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 172.54/109.71 [2019-03-28 12:36:07,994 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 172.54/109.71 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 172.54/109.71 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 172.54/109.71 Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 172.54/109.71 [2019-03-28 12:36:08,007 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 172.54/109.71 [2019-03-28 12:36:08,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 172.54/109.71 [2019-03-28 12:36:08,050 INFO L256 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 30 conjunts are in the unsatisfiable core 172.54/109.71 [2019-03-28 12:36:08,052 INFO L279 TraceCheckSpWp]: Computing forward predicates... 172.54/109.71 [2019-03-28 12:36:08,063 INFO L189 IndexEqualityManager]: detected not equals via solver 172.54/109.71 [2019-03-28 12:36:08,064 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 172.54/109.71 [2019-03-28 12:36:08,065 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 172.54/109.71 [2019-03-28 12:36:08,075 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 172.54/109.71 [2019-03-28 12:36:08,075 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. 172.54/109.71 [2019-03-28 12:36:08,075 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:20 172.54/109.71 [2019-03-28 12:36:08,101 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 172.54/109.71 [2019-03-28 12:36:08,101 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 172.54/109.71 [2019-03-28 12:36:08,108 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 172.54/109.71 [2019-03-28 12:36:08,109 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. 172.54/109.71 [2019-03-28 12:36:08,109 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:23 172.54/109.71 [2019-03-28 12:36:08,135 INFO L189 IndexEqualityManager]: detected not equals via solver 172.54/109.71 [2019-03-28 12:36:08,136 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 172.54/109.71 [2019-03-28 12:36:08,136 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 172.54/109.71 [2019-03-28 12:36:08,144 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 172.54/109.71 [2019-03-28 12:36:08,144 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. 172.54/109.71 [2019-03-28 12:36:08,144 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:30 172.54/109.71 [2019-03-28 12:36:08,190 INFO L189 IndexEqualityManager]: detected not equals via solver 172.54/109.71 [2019-03-28 12:36:08,197 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 172.54/109.71 [2019-03-28 12:36:08,197 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 22 172.54/109.71 [2019-03-28 12:36:08,198 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. 172.54/109.71 [2019-03-28 12:36:08,209 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 172.54/109.71 [2019-03-28 12:36:08,209 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 172.54/109.71 [2019-03-28 12:36:08,209 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:44, output treesize:23 172.54/109.71 [2019-03-28 12:36:08,285 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. 172.54/109.71 [2019-03-28 12:36:08,312 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 172.54/109.71 [2019-03-28 12:36:08,312 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 15 172.54/109.71 [2019-03-28 12:36:08,312 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states 172.54/109.71 [2019-03-28 12:36:08,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. 172.54/109.71 [2019-03-28 12:36:08,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 172.54/109.71 [2019-03-28 12:36:08,313 INFO L87 Difference]: Start difference. First operand 273 states and 366 transitions. Second operand 16 states. 172.54/109.71 [2019-03-28 12:36:09,864 WARN L188 SmtUtils]: Spent 1.12 s on a formula simplification. DAG size of input: 61 DAG size of output: 48 172.54/109.71 [2019-03-28 12:36:11,206 WARN L188 SmtUtils]: Spent 1.16 s on a formula simplification. DAG size of input: 66 DAG size of output: 51 172.54/109.71 [2019-03-28 12:36:11,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 172.54/109.71 [2019-03-28 12:36:11,554 INFO L93 Difference]: Finished difference Result 356 states and 474 transitions. 172.54/109.71 [2019-03-28 12:36:11,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. 172.54/109.71 [2019-03-28 12:36:11,555 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 40 172.54/109.71 [2019-03-28 12:36:11,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 172.54/109.71 [2019-03-28 12:36:11,555 INFO L225 Difference]: With dead ends: 356 172.54/109.71 [2019-03-28 12:36:11,555 INFO L226 Difference]: Without dead ends: 0 172.54/109.71 [2019-03-28 12:36:11,556 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=229, Invalid=641, Unknown=0, NotChecked=0, Total=870 172.54/109.71 [2019-03-28 12:36:11,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. 172.54/109.71 [2019-03-28 12:36:11,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. 172.54/109.71 [2019-03-28 12:36:11,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. 172.54/109.71 [2019-03-28 12:36:11,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. 172.54/109.71 [2019-03-28 12:36:11,557 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 40 172.54/109.71 [2019-03-28 12:36:11,557 INFO L84 Accepts]: Finished accepts. word is rejected. 172.54/109.71 [2019-03-28 12:36:11,557 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. 172.54/109.71 [2019-03-28 12:36:11,557 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. 172.54/109.71 [2019-03-28 12:36:11,557 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. 172.54/109.71 [2019-03-28 12:36:11,558 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. 172.54/109.71 [2019-03-28 12:36:11,563 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. 172.54/109.71 [2019-03-28 12:36:13,293 WARN L188 SmtUtils]: Spent 1.73 s on a formula simplification. DAG size of input: 521 DAG size of output: 496 172.54/109.71 [2019-03-28 12:36:13,306 WARN L250 erpolLogProxyWrapper]: Already inconsistent. 172.54/109.71 [2019-03-28 12:36:13,314 WARN L250 erpolLogProxyWrapper]: Already inconsistent. 172.54/109.71 [2019-03-28 12:36:13,337 WARN L250 erpolLogProxyWrapper]: Already inconsistent. 172.54/109.71 [2019-03-28 12:36:13,397 WARN L250 erpolLogProxyWrapper]: Already inconsistent. 172.54/109.71 [2019-03-28 12:36:14,154 WARN L250 erpolLogProxyWrapper]: Already inconsistent. 172.54/109.71 [2019-03-28 12:36:14,546 WARN L188 SmtUtils]: Spent 1.25 s on a formula simplification. DAG size of input: 510 DAG size of output: 481 172.54/109.71 [2019-03-28 12:36:22,141 WARN L188 SmtUtils]: Spent 7.59 s on a formula simplification. DAG size of input: 480 DAG size of output: 122 172.54/109.71 [2019-03-28 12:36:34,661 WARN L188 SmtUtils]: Spent 12.51 s on a formula simplification. DAG size of input: 477 DAG size of output: 181 172.54/109.71 [2019-03-28 12:36:34,666 INFO L448 ceAbstractionStarter]: For program point L27-1(lines 27 29) no Hoare annotation was computed. 172.54/109.71 [2019-03-28 12:36:34,666 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2REQUIRES_VIOLATION(line 33) no Hoare annotation was computed. 172.54/109.71 [2019-03-28 12:36:34,666 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr3REQUIRES_VIOLATION(line 33) no Hoare annotation was computed. 172.54/109.71 [2019-03-28 12:36:34,666 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr4REQUIRES_VIOLATION(line 8) no Hoare annotation was computed. 172.54/109.71 [2019-03-28 12:36:34,666 INFO L448 ceAbstractionStarter]: For program point L15(line 15) no Hoare annotation was computed. 172.54/109.71 [2019-03-28 12:36:34,666 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr5REQUIRES_VIOLATION(line 8) no Hoare annotation was computed. 172.54/109.71 [2019-03-28 12:36:34,667 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0REQUIRES_VIOLATION(line 32) no Hoare annotation was computed. 172.54/109.71 [2019-03-28 12:36:34,667 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1REQUIRES_VIOLATION(line 32) no Hoare annotation was computed. 172.54/109.71 [2019-03-28 12:36:34,667 INFO L448 ceAbstractionStarter]: For program point L11-1(line 11) no Hoare annotation was computed. 172.54/109.71 [2019-03-28 12:36:34,667 INFO L448 ceAbstractionStarter]: For program point L11-2(line 11) no Hoare annotation was computed. 172.54/109.71 [2019-03-28 12:36:34,667 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr10REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. 172.54/109.71 [2019-03-28 12:36:34,667 INFO L448 ceAbstractionStarter]: For program point L11-3(line 11) no Hoare annotation was computed. 172.54/109.71 [2019-03-28 12:36:34,667 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr11REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. 172.54/109.71 [2019-03-28 12:36:34,667 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr12REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. 172.54/109.71 [2019-03-28 12:36:34,667 INFO L448 ceAbstractionStarter]: For program point L11-4(line 11) no Hoare annotation was computed. 172.54/109.71 [2019-03-28 12:36:34,668 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr13REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. 172.54/109.71 [2019-03-28 12:36:34,668 INFO L448 ceAbstractionStarter]: For program point L11-5(line 11) no Hoare annotation was computed. 172.54/109.71 [2019-03-28 12:36:34,668 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr6REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. 172.54/109.71 [2019-03-28 12:36:34,668 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr7REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. 172.54/109.71 [2019-03-28 12:36:34,668 INFO L448 ceAbstractionStarter]: For program point L11-7(lines 11 14) no Hoare annotation was computed. 172.54/109.71 [2019-03-28 12:36:34,668 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr8REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. 172.54/109.71 [2019-03-28 12:36:34,669 INFO L444 ceAbstractionStarter]: At program point L11-9(lines 11 14) the Hoare annotation is: (let ((.cse52 (select |#memory_int| ULTIMATE.start_substring_~ps2~0.base)) (.cse50 (select |#memory_int| ULTIMATE.start_substring_~pt~0.base))) (let ((.cse53 (select |#valid| ULTIMATE.start_substring_~ps~0.base)) (.cse46 (select .cse50 ULTIMATE.start_substring_~pt~0.offset)) (.cse44 (select .cse52 ULTIMATE.start_substring_~ps2~0.offset)) (.cse47 (select |#length| ULTIMATE.start_main_~nondetString1~0.base))) (let ((.cse11 (= ULTIMATE.start_substring_~pt~0.offset 0)) (.cse12 (= ULTIMATE.start_main_~length1~0 .cse47)) (.cse27 (exists ((ULTIMATE.start_main_~length2~0 Int) (ULTIMATE.start_main_~nondetString2~0.offset Int)) (and (= 0 (select (select |#memory_int| ULTIMATE.start_substring_~t.base) (+ ULTIMATE.start_main_~length2~0 ULTIMATE.start_main_~nondetString2~0.offset (- 1)))) (<= (+ ULTIMATE.start_main_~length2~0 ULTIMATE.start_main_~nondetString2~0.offset) (select |#length| ULTIMATE.start_substring_~t.base)) (<= 1 ULTIMATE.start_main_~length2~0) (<= ULTIMATE.start_substring_~t.offset ULTIMATE.start_main_~nondetString2~0.offset)))) (.cse3 (not (= ULTIMATE.start_main_~nondetString1~0.base ULTIMATE.start_main_~nondetString2~0.base))) (.cse4 (= (select |#length| ULTIMATE.start_main_~nondetString2~0.base) ULTIMATE.start_main_~length2~0)) (.cse14 (= ULTIMATE.start_substring_~t.offset 0)) (.cse42 (+ ULTIMATE.start_substring_~ps~0.offset 1)) (.cse15 (= 1 (select |#valid| ULTIMATE.start_substring_~pt~0.base))) (.cse5 (<= 1 ULTIMATE.start_main_~length2~0)) (.cse31 (not (= .cse46 .cse44))) (.cse6 (= (select |#valid| ULTIMATE.start_substring_~ps2~0.base) 1)) (.cse16 (exists ((ULTIMATE.start_main_~length2~0 Int) (ULTIMATE.start_main_~nondetString2~0.offset Int)) (and (= (select (select |#memory_int| ULTIMATE.start_substring_~pt~0.base) (+ ULTIMATE.start_main_~length2~0 ULTIMATE.start_main_~nondetString2~0.offset (- 1))) 0) (<= (+ ULTIMATE.start_main_~length2~0 ULTIMATE.start_main_~nondetString2~0.offset) (select |#length| ULTIMATE.start_substring_~pt~0.base)) (<= ULTIMATE.start_substring_~pt~0.offset ULTIMATE.start_main_~nondetString2~0.offset) (<= 1 ULTIMATE.start_main_~length2~0)))) (.cse29 (= (select |#valid| ULTIMATE.start_substring_~t.base) 1)) (.cse18 (= 1 (select |#valid| ULTIMATE.start_main_~nondetString1~0.base))) (.cse19 (<= 1 ULTIMATE.start_main_~length1~0)) (.cse7 (= ULTIMATE.start_main_~nondetString1~0.offset 0)) (.cse40 (= .cse53 1)) (.cse36 (<= 1 ULTIMATE.start_substring_~ps~0.offset)) (.cse8 (= 1 (select |#valid| ULTIMATE.start_main_~nondetString2~0.base))) (.cse39 (select |#length| ULTIMATE.start_substring_~pt~0.base)) (.cse45 (select |#memory_int| ULTIMATE.start_substring_~t.base)) (.cse43 (select |#length| ULTIMATE.start_substring_~t.base)) (.cse48 (select (store |#memory_int| ULTIMATE.start_main_~nondetString2~0.base (store (select |#memory_int| ULTIMATE.start_main_~nondetString2~0.base) (+ ULTIMATE.start_main_~length2~0 ULTIMATE.start_main_~nondetString2~0.offset (- 1)) 0)) ULTIMATE.start_main_~nondetString1~0.base)) (.cse49 (select |#length| ULTIMATE.start_substring_~ps2~0.base)) (.cse51 (select |#memory_int| ULTIMATE.start_substring_~ps~0.base)) (.cse30 (select |#length| ULTIMATE.start_substring_~ps~0.base))) (let ((.cse25 (<= (+ .cse44 1) 0)) (.cse23 (<= (+ ULTIMATE.start_substring_~ps2~0.offset 2) .cse30)) (.cse35 (= ULTIMATE.start_substring_~ps2~0.offset ULTIMATE.start_substring_~ps~0.offset)) (.cse2 (= ULTIMATE.start_substring_~t.base ULTIMATE.start_substring_~pt~0.base)) (.cse9 (= ULTIMATE.start_substring_~ps2~0.offset 0)) (.cse0 (= .cse52 .cse51)) (.cse10 (<= 1 .cse49)) (.cse17 (= 1 .cse53)) (.cse20 (= 0 (select .cse52 (+ .cse49 (- 1))))) (.cse21 (= 0 (select .cse48 (+ ULTIMATE.start_main_~nondetString1~0.offset .cse47 (- 1))))) (.cse22 (= (select .cse51 (+ .cse30 (- 1))) 0)) (.cse13 (= ULTIMATE.start_substring_~ps~0.offset 0)) (.cse38 (= (select .cse45 (+ .cse43 (- 1))) 0)) (.cse1 (= 0 (select .cse50 (+ .cse39 (- 1))))) (.cse33 (<= (+ ULTIMATE.start_substring_~ps2~0.offset 1) .cse49)) (.cse34 (and .cse11 .cse12 .cse27 (or (<= 2 (+ ULTIMATE.start_main_~nondetString1~0.offset .cse47)) (and .cse3 (= 0 (select .cse48 ULTIMATE.start_main_~nondetString1~0.offset)))) .cse4 .cse14 (<= .cse42 .cse30) .cse15 .cse5 (or .cse31 (<= 2 .cse39)) .cse6 .cse16 .cse29 .cse18 .cse19 .cse7 .cse40 .cse36 .cse8)) (.cse26 (= 1 (+ ULTIMATE.start_main_~length2~0 ULTIMATE.start_main_~nondetString2~0.offset))) (.cse32 (= 0 .cse46)) (.cse28 (= (select .cse45 ULTIMATE.start_substring_~t.offset) 0)) (.cse24 (= ULTIMATE.start_main_~nondetString2~0.offset 0)) (.cse37 (<= 1 .cse44))) (or (and .cse0 .cse1 .cse2 .cse3 (and .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) .cse20 .cse21 .cse22 .cse23 .cse24 .cse25) (and .cse26 .cse27 .cse4 .cse6 .cse28 .cse29 .cse7 .cse8 .cse9 .cse10 (<= 1 .cse30) .cse11 .cse12 .cse13 .cse14 .cse15 .cse31 .cse32 .cse16 .cse17 .cse18 .cse19 .cse24) (and .cse0 .cse1 .cse33 .cse2 .cse3 .cse34 .cse20 .cse21 .cse22 .cse24 .cse35 .cse25) (and .cse1 .cse33 .cse2 .cse3 (= ULTIMATE.start_substring_~pt~0.offset ULTIMATE.start_substring_~t.offset) (and .cse4 .cse5 .cse6 .cse7 .cse8 .cse0 .cse12 .cse15 .cse16 .cse17 .cse18 .cse19 .cse36 .cse37) .cse14 .cse20 .cse21 .cse22 (and .cse23 .cse35) .cse24) (and .cse1 .cse2 .cse3 (and .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse0 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (<= 2 .cse30) .cse16 .cse17 .cse18 .cse19 .cse37) .cse20 .cse21 .cse22 .cse24) (and .cse20 .cse21 .cse33 .cse22 (and .cse38 (<= (+ ULTIMATE.start_substring_~ps~0.offset 2) .cse30) (<= (+ ULTIMATE.start_substring_~pt~0.offset 1) .cse39) .cse1 (let ((.cse41 (<= 1 ULTIMATE.start_substring_~pt~0.offset))) (or (and .cse12 .cse27 .cse4 .cse15 .cse14 .cse5 .cse6 .cse29 .cse18 .cse19 .cse7 .cse40 .cse36 .cse8 .cse41) (and .cse12 .cse13 .cse27 .cse4 .cse15 .cse14 .cse5 .cse6 .cse29 .cse18 .cse19 .cse7 .cse40 .cse8 .cse41))) .cse24 (<= 1 ULTIMATE.start_substring_~ps2~0.offset)) .cse3) (and (and (and (< ULTIMATE.start_substring_~ps2~0.base 0) .cse38 .cse1 .cse33 (exists ((ULTIMATE.start_main_~nondetString1~0.offset Int)) (and (<= ULTIMATE.start_main_~nondetString1~0.offset 0) (<= 0 ULTIMATE.start_main_~nondetString1~0.offset) (= 0 (select (select |#memory_int| ULTIMATE.start_main_~nondetString1~0.base) (+ ULTIMATE.start_main_~nondetString1~0.offset (select |#length| ULTIMATE.start_main_~nondetString1~0.base) (- 1)))))) .cse34 (< ULTIMATE.start_main_~nondetString1~0.base 0) (< ULTIMATE.start_substring_~ps~0.base 0) (exists ((|ULTIMATE.start_main_#t~malloc12.base| Int)) (and (= (select |#length| |ULTIMATE.start_main_#t~malloc12.base|) ULTIMATE.start_main_~length2~0) (<= |ULTIMATE.start_main_#t~malloc12.base| ULTIMATE.start_main_~nondetString2~0.base) (< 0 |ULTIMATE.start_main_#t~malloc12.base|))) (exists ((ULTIMATE.start_main_~nondetString1~0.offset Int)) (and (<= ULTIMATE.start_main_~nondetString1~0.offset 0) (<= 0 ULTIMATE.start_main_~nondetString1~0.offset) (= (select (select |#memory_int| ULTIMATE.start_substring_~ps~0.base) (+ ULTIMATE.start_main_~nondetString1~0.offset (select |#length| ULTIMATE.start_substring_~ps~0.base) (- 1))) 0))) (exists ((ULTIMATE.start_main_~nondetString1~0.offset Int)) (and (<= ULTIMATE.start_main_~nondetString1~0.offset 0) (<= 0 ULTIMATE.start_main_~nondetString1~0.offset) (= 0 (select (select |#memory_int| ULTIMATE.start_substring_~ps2~0.base) (+ ULTIMATE.start_main_~nondetString1~0.offset (select |#length| ULTIMATE.start_substring_~ps2~0.base) (- 1)))))) .cse24 (<= 0 ULTIMATE.start_substring_~ps2~0.offset)) (< 0 ULTIMATE.start_substring_~t.base)) (not (= .cse30 .cse42))) (and .cse26 .cse11 .cse12 (<= 1 .cse43) .cse4 .cse14 .cse15 .cse6 .cse32 .cse28 .cse29 .cse18 .cse19 (<= 1 .cse39) .cse7 .cse24 .cse40 .cse8 .cse37)))))) 172.54/109.71 [2019-03-28 12:36:34,669 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr9REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. 172.54/109.71 [2019-03-28 12:36:34,669 INFO L448 ceAbstractionStarter]: For program point L11-10(lines 11 14) no Hoare annotation was computed. 172.54/109.71 [2019-03-28 12:36:34,670 INFO L448 ceAbstractionStarter]: For program point L32(line 32) no Hoare annotation was computed. 172.54/109.71 [2019-03-28 12:36:34,670 INFO L448 ceAbstractionStarter]: For program point L32-1(line 32) no Hoare annotation was computed. 172.54/109.71 [2019-03-28 12:36:34,670 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. 172.54/109.71 [2019-03-28 12:36:34,670 INFO L448 ceAbstractionStarter]: For program point L24(lines 24 26) no Hoare annotation was computed. 172.54/109.71 [2019-03-28 12:36:34,670 INFO L448 ceAbstractionStarter]: For program point L24-2(lines 21 35) no Hoare annotation was computed. 172.54/109.71 [2019-03-28 12:36:34,670 INFO L448 ceAbstractionStarter]: For program point L8-1(lines 8 17) no Hoare annotation was computed. 172.54/109.71 [2019-03-28 12:36:34,671 INFO L444 ceAbstractionStarter]: At program point L8-3(lines 8 17) the Hoare annotation is: (let ((.cse13 (select |#valid| ULTIMATE.start_substring_~ps~0.base)) (.cse24 (select |#memory_int| ULTIMATE.start_substring_~ps~0.base)) (.cse25 (select (store |#memory_int| ULTIMATE.start_main_~nondetString2~0.base (store (select |#memory_int| ULTIMATE.start_main_~nondetString2~0.base) (+ ULTIMATE.start_main_~length2~0 ULTIMATE.start_main_~nondetString2~0.offset (- 1)) 0)) ULTIMATE.start_main_~nondetString1~0.base)) (.cse29 (select |#length| ULTIMATE.start_main_~nondetString1~0.base)) (.cse30 (select |#length| ULTIMATE.start_substring_~ps~0.base)) (.cse28 (select |#memory_int| ULTIMATE.start_substring_~t.base)) (.cse31 (select |#length| ULTIMATE.start_substring_~t.base))) (let ((.cse7 (<= 1 .cse31)) (.cse3 (= (select .cse28 (+ .cse31 (- 1))) 0)) (.cse21 (<= (+ ULTIMATE.start_substring_~ps~0.offset 1) .cse30)) (.cse9 (<= 1 ULTIMATE.start_main_~length2~0)) (.cse18 (= 0 (select .cse25 (+ ULTIMATE.start_main_~nondetString1~0.offset .cse29 (- 1))))) (.cse19 (= (select .cse24 (+ .cse30 (- 1))) 0)) (.cse20 (not (= ULTIMATE.start_main_~nondetString1~0.base ULTIMATE.start_main_~nondetString2~0.base))) (.cse22 (<= 1 .cse30)) (.cse23 (= ULTIMATE.start_substring_~ps~0.offset 0)) (.cse8 (= ULTIMATE.start_main_~length1~0 .cse29)) (.cse27 (exists ((ULTIMATE.start_main_~length2~0 Int) (ULTIMATE.start_main_~nondetString2~0.offset Int)) (and (= 0 (select (select |#memory_int| ULTIMATE.start_substring_~t.base) (+ ULTIMATE.start_main_~length2~0 ULTIMATE.start_main_~nondetString2~0.offset (- 1)))) (<= (+ ULTIMATE.start_main_~length2~0 ULTIMATE.start_main_~nondetString2~0.offset) (select |#length| ULTIMATE.start_substring_~t.base)) (<= 1 ULTIMATE.start_main_~length2~0) (<= ULTIMATE.start_substring_~t.offset ULTIMATE.start_main_~nondetString2~0.offset)))) (.cse15 (= (select |#length| ULTIMATE.start_main_~nondetString2~0.base) ULTIMATE.start_main_~length2~0)) (.cse16 (= ULTIMATE.start_substring_~t.offset 0)) (.cse26 (= 1 .cse13)) (.cse10 (= (select |#valid| ULTIMATE.start_substring_~t.base) 1)) (.cse11 (<= 1 ULTIMATE.start_main_~length1~0)) (.cse12 (= 1 (select |#valid| ULTIMATE.start_main_~nondetString1~0.base))) (.cse17 (= ULTIMATE.start_main_~nondetString1~0.offset 0)) (.cse6 (= ULTIMATE.start_main_~nondetString2~0.offset 0)) (.cse14 (= 1 (select |#valid| ULTIMATE.start_main_~nondetString2~0.base)))) (or (let ((.cse1 (select |#memory_int| ULTIMATE.start_substring_~ps2~0.base)) (.cse0 (select |#memory_int| ULTIMATE.start_substring_~pt~0.base)) (.cse2 (select |#length| ULTIMATE.start_substring_~ps2~0.base))) (and (or (not (= (select .cse0 ULTIMATE.start_substring_~pt~0.offset) (select .cse1 ULTIMATE.start_substring_~ps2~0.offset))) (<= (+ ULTIMATE.start_substring_~ps2~0.offset 2) .cse2)) (= 0 (select .cse1 (+ .cse2 (- 1)))) (let ((.cse4 (select |#length| ULTIMATE.start_substring_~pt~0.base))) (and (and .cse3 (= 0 (select .cse0 (+ .cse4 (- 1)))) (and (and (let ((.cse5 (and .cse7 .cse8 (= 1 (select |#valid| ULTIMATE.start_substring_~pt~0.base)) .cse9 (= (select |#valid| ULTIMATE.start_substring_~ps2~0.base) 1) .cse10 .cse11 .cse12 (= .cse13 1) .cse14))) (or (and .cse5 .cse6 (<= 1 ULTIMATE.start_substring_~pt~0.offset)) (and .cse5 (= ULTIMATE.start_substring_~pt~0.offset 0) .cse6))) (<= 1 ULTIMATE.start_substring_~ps~0.offset)) (<= (+ ULTIMATE.start_substring_~ps2~0.offset 1) .cse2)) .cse15 .cse16) (<= (+ ULTIMATE.start_substring_~pt~0.offset 2) .cse4) .cse17 (<= 0 ULTIMATE.start_substring_~ps2~0.offset))) .cse18 .cse19 .cse20 .cse21)) (and .cse22 .cse23 .cse7 .cse8 .cse20 (= (select .cse24 ULTIMATE.start_substring_~ps~0.offset) 0) (= 0 (select .cse25 ULTIMATE.start_main_~nondetString1~0.offset)) .cse15 .cse16 .cse9 (= 1 ULTIMATE.start_main_~length1~0) .cse26 .cse10 .cse12 .cse17 .cse6 .cse14) (and .cse3 (and .cse23 .cse8 .cse27 .cse15 .cse16 .cse21 .cse9 .cse26 .cse10 .cse11 .cse12 .cse14) .cse18 .cse19 .cse17 .cse20 .cse6) (and (= 1 (+ ULTIMATE.start_main_~length2~0 ULTIMATE.start_main_~nondetString2~0.offset)) .cse22 .cse23 .cse8 .cse27 .cse15 .cse16 (= (select .cse28 ULTIMATE.start_substring_~t.offset) 0) .cse26 .cse10 .cse11 .cse12 .cse17 .cse6 .cse14)))) 172.54/109.71 [2019-03-28 12:36:34,671 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg 172.54/109.71 [2019-03-28 12:36:34,684 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 172.54/109.71 [2019-03-28 12:36:34,685 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 172.54/109.71 [2019-03-28 12:36:34,686 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 172.54/109.71 [2019-03-28 12:36:34,686 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 172.54/109.71 [2019-03-28 12:36:34,686 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 172.54/109.71 [2019-03-28 12:36:34,687 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 172.54/109.71 [2019-03-28 12:36:34,688 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 172.54/109.71 [2019-03-28 12:36:34,688 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 172.54/109.71 [2019-03-28 12:36:34,688 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 172.54/109.71 [2019-03-28 12:36:34,689 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 172.54/109.71 [2019-03-28 12:36:34,689 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 172.54/109.71 [2019-03-28 12:36:34,689 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 172.54/109.71 [2019-03-28 12:36:34,695 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.54/109.71 [2019-03-28 12:36:34,695 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.54/109.71 [2019-03-28 12:36:34,696 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.54/109.71 [2019-03-28 12:36:34,696 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.54/109.71 [2019-03-28 12:36:34,696 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.54/109.71 [2019-03-28 12:36:34,696 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.54/109.71 [2019-03-28 12:36:34,697 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.54/109.71 [2019-03-28 12:36:34,697 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.54/109.71 [2019-03-28 12:36:34,697 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.54/109.71 [2019-03-28 12:36:34,697 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.54/109.71 [2019-03-28 12:36:34,698 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.54/109.71 [2019-03-28 12:36:34,698 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.54/109.71 [2019-03-28 12:36:34,699 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.54/109.71 [2019-03-28 12:36:34,699 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.54/109.71 [2019-03-28 12:36:34,699 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.54/109.71 [2019-03-28 12:36:34,700 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.54/109.71 [2019-03-28 12:36:34,700 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.54/109.71 [2019-03-28 12:36:34,700 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.54/109.71 [2019-03-28 12:36:34,700 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.54/109.71 [2019-03-28 12:36:34,701 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.54/109.71 [2019-03-28 12:36:34,701 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.54/109.71 [2019-03-28 12:36:34,701 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.54/109.71 [2019-03-28 12:36:34,701 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.54/109.71 [2019-03-28 12:36:34,702 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.54/109.71 [2019-03-28 12:36:34,702 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.54/109.71 [2019-03-28 12:36:34,702 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.54/109.71 [2019-03-28 12:36:34,703 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.54/109.71 [2019-03-28 12:36:34,703 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.54/109.71 [2019-03-28 12:36:34,703 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.54/109.71 [2019-03-28 12:36:34,704 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.54/109.71 [2019-03-28 12:36:34,704 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.54/109.71 [2019-03-28 12:36:34,704 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.54/109.71 [2019-03-28 12:36:34,704 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.54/109.71 [2019-03-28 12:36:34,705 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.54/109.71 [2019-03-28 12:36:34,705 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.54/109.71 [2019-03-28 12:36:34,705 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.54/109.71 [2019-03-28 12:36:34,706 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.54/109.71 [2019-03-28 12:36:34,706 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.54/109.71 [2019-03-28 12:36:34,706 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.54/109.71 [2019-03-28 12:36:34,707 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.54/109.71 [2019-03-28 12:36:34,707 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.54/109.71 [2019-03-28 12:36:34,707 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.54/109.71 [2019-03-28 12:36:34,707 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.54/109.71 [2019-03-28 12:36:34,708 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.54/109.71 [2019-03-28 12:36:34,708 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.54/109.71 [2019-03-28 12:36:34,708 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.54/109.71 [2019-03-28 12:36:34,708 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.54/109.71 [2019-03-28 12:36:34,722 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 172.54/109.71 [2019-03-28 12:36:34,723 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 172.54/109.71 [2019-03-28 12:36:34,723 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 172.54/109.71 [2019-03-28 12:36:34,723 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 172.54/109.71 [2019-03-28 12:36:34,724 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 172.54/109.71 [2019-03-28 12:36:34,724 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 172.54/109.71 [2019-03-28 12:36:34,725 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 172.54/109.71 [2019-03-28 12:36:34,725 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 172.54/109.71 [2019-03-28 12:36:34,725 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 172.54/109.71 [2019-03-28 12:36:34,725 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 172.54/109.71 [2019-03-28 12:36:34,726 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 172.54/109.71 [2019-03-28 12:36:34,726 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 172.54/109.71 [2019-03-28 12:36:34,729 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.54/109.71 [2019-03-28 12:36:34,729 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.54/109.71 [2019-03-28 12:36:34,730 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.54/109.71 [2019-03-28 12:36:34,730 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.54/109.71 [2019-03-28 12:36:34,730 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.54/109.71 [2019-03-28 12:36:34,730 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.54/109.71 [2019-03-28 12:36:34,731 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.54/109.71 [2019-03-28 12:36:34,731 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.54/109.71 [2019-03-28 12:36:34,731 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.54/109.71 [2019-03-28 12:36:34,731 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.54/109.71 [2019-03-28 12:36:34,732 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.54/109.71 [2019-03-28 12:36:34,732 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.54/109.71 [2019-03-28 12:36:34,733 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.54/109.71 [2019-03-28 12:36:34,733 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.54/109.71 [2019-03-28 12:36:34,733 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.54/109.71 [2019-03-28 12:36:34,733 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.54/109.71 [2019-03-28 12:36:34,734 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.54/109.71 [2019-03-28 12:36:34,734 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.54/109.71 [2019-03-28 12:36:34,734 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.54/109.71 [2019-03-28 12:36:34,734 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.54/109.71 [2019-03-28 12:36:34,735 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.54/109.71 [2019-03-28 12:36:34,735 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.54/109.71 [2019-03-28 12:36:34,735 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.54/109.71 [2019-03-28 12:36:34,735 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.54/109.71 [2019-03-28 12:36:34,736 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.54/109.71 [2019-03-28 12:36:34,736 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.54/109.71 [2019-03-28 12:36:34,736 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.54/109.71 [2019-03-28 12:36:34,736 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.54/109.71 [2019-03-28 12:36:34,737 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.54/109.71 [2019-03-28 12:36:34,737 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.54/109.71 [2019-03-28 12:36:34,737 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.54/109.71 [2019-03-28 12:36:34,738 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.54/109.71 [2019-03-28 12:36:34,738 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.54/109.71 [2019-03-28 12:36:34,738 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.54/109.71 [2019-03-28 12:36:34,738 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.54/109.71 [2019-03-28 12:36:34,739 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.54/109.71 [2019-03-28 12:36:34,739 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.54/109.71 [2019-03-28 12:36:34,739 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.54/109.71 [2019-03-28 12:36:34,740 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.54/109.71 [2019-03-28 12:36:34,740 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.54/109.71 [2019-03-28 12:36:34,740 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.54/109.71 [2019-03-28 12:36:34,740 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.54/109.71 [2019-03-28 12:36:34,740 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.54/109.71 [2019-03-28 12:36:34,741 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.54/109.71 [2019-03-28 12:36:34,741 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.54/109.71 [2019-03-28 12:36:34,741 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.54/109.71 [2019-03-28 12:36:34,742 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.54/109.71 [2019-03-28 12:36:34,748 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 172.54/109.71 [2019-03-28 12:36:34,748 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 172.54/109.71 [2019-03-28 12:36:34,749 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 172.54/109.71 [2019-03-28 12:36:34,749 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 172.54/109.71 [2019-03-28 12:36:34,749 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 172.54/109.71 [2019-03-28 12:36:34,749 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 172.54/109.71 [2019-03-28 12:36:34,750 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 172.54/109.71 [2019-03-28 12:36:34,751 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 172.54/109.71 [2019-03-28 12:36:34,751 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 172.54/109.71 [2019-03-28 12:36:34,751 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 172.54/109.71 [2019-03-28 12:36:34,752 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 172.54/109.71 [2019-03-28 12:36:34,752 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 172.54/109.71 [2019-03-28 12:36:34,753 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 172.54/109.71 [2019-03-28 12:36:34,753 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 172.54/109.71 [2019-03-28 12:36:34,753 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 172.54/109.71 [2019-03-28 12:36:34,754 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 172.54/109.71 [2019-03-28 12:36:34,754 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 172.54/109.71 [2019-03-28 12:36:34,754 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 172.54/109.71 [2019-03-28 12:36:34,755 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 172.54/109.71 [2019-03-28 12:36:34,755 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 172.54/109.71 [2019-03-28 12:36:34,755 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 172.54/109.71 [2019-03-28 12:36:34,756 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 172.54/109.71 [2019-03-28 12:36:34,756 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 172.54/109.71 [2019-03-28 12:36:34,757 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 172.54/109.71 [2019-03-28 12:36:34,757 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 172.54/109.71 [2019-03-28 12:36:34,758 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 172.54/109.71 [2019-03-28 12:36:34,758 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 172.54/109.71 [2019-03-28 12:36:34,758 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 172.54/109.71 [2019-03-28 12:36:34,759 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 172.54/109.71 [2019-03-28 12:36:34,759 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 172.54/109.71 [2019-03-28 12:36:34,760 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 172.54/109.71 [2019-03-28 12:36:34,760 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 172.54/109.71 [2019-03-28 12:36:34,761 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 172.54/109.71 [2019-03-28 12:36:34,761 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 172.54/109.71 [2019-03-28 12:36:34,761 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 172.54/109.71 [2019-03-28 12:36:34,761 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 172.54/109.71 [2019-03-28 12:36:34,762 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 172.54/109.71 [2019-03-28 12:36:34,763 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 172.54/109.71 [2019-03-28 12:36:34,763 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 172.54/109.71 [2019-03-28 12:36:34,763 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 172.54/109.71 [2019-03-28 12:36:34,764 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 172.54/109.71 [2019-03-28 12:36:34,764 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 172.54/109.71 [2019-03-28 12:36:34,764 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 172.54/109.71 [2019-03-28 12:36:34,765 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 172.54/109.71 [2019-03-28 12:36:34,765 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 172.54/109.71 [2019-03-28 12:36:34,765 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 172.54/109.71 [2019-03-28 12:36:34,766 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 172.54/109.71 [2019-03-28 12:36:34,766 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 172.54/109.71 [2019-03-28 12:36:34,767 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 172.54/109.71 [2019-03-28 12:36:34,767 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 172.54/109.71 [2019-03-28 12:36:34,767 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 172.54/109.71 [2019-03-28 12:36:34,768 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 172.54/109.71 [2019-03-28 12:36:34,768 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 172.54/109.71 [2019-03-28 12:36:34,768 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 172.54/109.71 [2019-03-28 12:36:34,769 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] 172.54/109.71 [2019-03-28 12:36:34,769 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] 172.54/109.71 [2019-03-28 12:36:34,769 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] 172.54/109.71 [2019-03-28 12:36:34,770 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 172.54/109.71 [2019-03-28 12:36:34,770 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 172.54/109.71 [2019-03-28 12:36:34,770 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 172.54/109.71 [2019-03-28 12:36:34,771 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 172.54/109.71 [2019-03-28 12:36:34,771 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 172.54/109.71 [2019-03-28 12:36:34,772 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 172.54/109.71 [2019-03-28 12:36:34,772 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 172.54/109.71 [2019-03-28 12:36:34,772 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 172.54/109.71 [2019-03-28 12:36:34,773 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 172.54/109.71 [2019-03-28 12:36:34,773 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 172.54/109.71 [2019-03-28 12:36:34,773 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 172.54/109.71 [2019-03-28 12:36:34,774 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 172.54/109.71 [2019-03-28 12:36:34,774 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_#t~malloc12.base,QUANTIFIED] 172.54/109.71 [2019-03-28 12:36:34,774 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_#t~malloc12.base,QUANTIFIED] 172.54/109.71 [2019-03-28 12:36:34,775 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_#t~malloc12.base,QUANTIFIED] 172.54/109.71 [2019-03-28 12:36:34,775 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] 172.54/109.71 [2019-03-28 12:36:34,775 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] 172.54/109.71 [2019-03-28 12:36:34,775 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] 172.54/109.71 [2019-03-28 12:36:34,776 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] 172.54/109.71 [2019-03-28 12:36:34,776 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] 172.54/109.71 [2019-03-28 12:36:34,776 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] 172.54/109.71 [2019-03-28 12:36:34,780 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.54/109.71 [2019-03-28 12:36:34,780 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.54/109.71 [2019-03-28 12:36:34,781 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.54/109.71 [2019-03-28 12:36:34,781 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.54/109.71 [2019-03-28 12:36:34,781 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.54/109.71 [2019-03-28 12:36:34,782 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.54/109.71 [2019-03-28 12:36:34,782 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.54/109.71 [2019-03-28 12:36:34,782 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.54/109.71 [2019-03-28 12:36:34,783 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.54/109.71 [2019-03-28 12:36:34,783 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.54/109.71 [2019-03-28 12:36:34,783 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.54/109.71 [2019-03-28 12:36:34,784 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.54/109.71 [2019-03-28 12:36:34,784 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.54/109.71 [2019-03-28 12:36:34,784 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.54/109.71 [2019-03-28 12:36:34,784 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.54/109.71 [2019-03-28 12:36:34,785 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.54/109.71 [2019-03-28 12:36:34,785 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.54/109.71 [2019-03-28 12:36:34,785 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.54/109.71 [2019-03-28 12:36:34,785 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.54/109.71 [2019-03-28 12:36:34,786 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.54/109.71 [2019-03-28 12:36:34,786 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.54/109.71 [2019-03-28 12:36:34,787 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.54/109.71 [2019-03-28 12:36:34,787 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.54/109.71 [2019-03-28 12:36:34,787 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.54/109.71 [2019-03-28 12:36:34,788 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.54/109.71 [2019-03-28 12:36:34,788 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.54/109.71 [2019-03-28 12:36:34,788 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.54/109.71 [2019-03-28 12:36:34,789 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.54/109.71 [2019-03-28 12:36:34,789 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.54/109.71 [2019-03-28 12:36:34,789 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.54/109.71 [2019-03-28 12:36:34,789 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.54/109.71 [2019-03-28 12:36:34,790 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.54/109.71 [2019-03-28 12:36:34,790 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.54/109.71 [2019-03-28 12:36:34,790 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.54/109.71 [2019-03-28 12:36:34,791 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.54/109.71 [2019-03-28 12:36:34,791 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.54/109.71 [2019-03-28 12:36:34,791 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.54/109.71 [2019-03-28 12:36:34,792 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.54/109.71 [2019-03-28 12:36:34,792 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.54/109.71 [2019-03-28 12:36:34,792 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.54/109.71 [2019-03-28 12:36:34,793 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.54/109.71 [2019-03-28 12:36:34,793 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.54/109.71 [2019-03-28 12:36:34,794 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.54/109.71 [2019-03-28 12:36:34,794 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.54/109.71 [2019-03-28 12:36:34,794 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.54/109.71 [2019-03-28 12:36:34,795 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.54/109.71 [2019-03-28 12:36:34,795 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.54/109.71 [2019-03-28 12:36:34,795 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.54/109.71 [2019-03-28 12:36:34,796 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.54/109.71 [2019-03-28 12:36:34,796 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.54/109.71 [2019-03-28 12:36:34,796 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.54/109.71 [2019-03-28 12:36:34,797 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.54/109.71 [2019-03-28 12:36:34,797 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.54/109.71 [2019-03-28 12:36:34,797 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.54/109.71 [2019-03-28 12:36:34,797 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.54/109.71 [2019-03-28 12:36:34,798 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.54/109.71 [2019-03-28 12:36:34,798 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.54/109.71 [2019-03-28 12:36:34,798 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.54/109.71 [2019-03-28 12:36:34,798 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.54/109.71 [2019-03-28 12:36:34,799 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.54/109.71 [2019-03-28 12:36:34,799 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.54/109.71 [2019-03-28 12:36:34,799 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.54/109.71 [2019-03-28 12:36:34,800 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.54/109.71 [2019-03-28 12:36:34,800 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.54/109.71 [2019-03-28 12:36:34,800 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.54/109.71 [2019-03-28 12:36:34,801 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.54/109.71 [2019-03-28 12:36:34,801 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.54/109.71 [2019-03-28 12:36:34,801 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.54/109.71 [2019-03-28 12:36:34,801 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.54/109.71 [2019-03-28 12:36:34,802 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.54/109.71 [2019-03-28 12:36:34,802 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.54/109.71 [2019-03-28 12:36:34,802 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.54/109.71 [2019-03-28 12:36:34,802 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.54/109.71 [2019-03-28 12:36:34,803 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.54/109.71 [2019-03-28 12:36:34,803 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.54/109.71 [2019-03-28 12:36:34,803 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.54/109.71 [2019-03-28 12:36:34,803 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.54/109.71 [2019-03-28 12:36:34,804 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.54/109.71 [2019-03-28 12:36:34,804 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.54/109.71 [2019-03-28 12:36:34,804 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.54/109.71 [2019-03-28 12:36:34,805 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.54/109.71 [2019-03-28 12:36:34,805 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.54/109.71 [2019-03-28 12:36:34,805 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.54/109.71 [2019-03-28 12:36:34,806 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.54/109.71 [2019-03-28 12:36:34,806 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.54/109.71 [2019-03-28 12:36:34,806 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.54/109.71 [2019-03-28 12:36:34,806 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.54/109.71 [2019-03-28 12:36:34,807 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.54/109.71 [2019-03-28 12:36:34,807 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.54/109.71 [2019-03-28 12:36:34,807 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.54/109.71 [2019-03-28 12:36:34,807 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.54/109.71 [2019-03-28 12:36:34,808 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.54/109.71 [2019-03-28 12:36:34,808 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.54/109.71 [2019-03-28 12:36:34,808 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.54/109.71 [2019-03-28 12:36:34,808 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.54/109.71 [2019-03-28 12:36:34,809 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.54/109.71 [2019-03-28 12:36:34,809 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.54/109.71 [2019-03-28 12:36:34,809 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.54/109.71 [2019-03-28 12:36:34,809 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.54/109.71 [2019-03-28 12:36:34,810 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.54/109.71 [2019-03-28 12:36:34,810 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.54/109.71 [2019-03-28 12:36:34,810 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.54/109.71 [2019-03-28 12:36:34,810 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.54/109.71 [2019-03-28 12:36:34,811 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.54/109.71 [2019-03-28 12:36:34,811 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.54/109.71 [2019-03-28 12:36:34,811 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.54/109.71 [2019-03-28 12:36:34,811 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.54/109.71 [2019-03-28 12:36:34,812 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.54/109.71 [2019-03-28 12:36:34,812 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.54/109.71 [2019-03-28 12:36:34,812 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.54/109.71 [2019-03-28 12:36:34,813 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.54/109.71 [2019-03-28 12:36:34,813 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.54/109.71 [2019-03-28 12:36:34,813 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.54/109.71 [2019-03-28 12:36:34,814 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.54/109.71 [2019-03-28 12:36:34,814 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.54/109.71 [2019-03-28 12:36:34,814 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.54/109.71 [2019-03-28 12:36:34,815 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.54/109.71 [2019-03-28 12:36:34,815 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.54/109.71 [2019-03-28 12:36:34,815 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.54/109.71 [2019-03-28 12:36:34,815 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.54/109.71 [2019-03-28 12:36:34,816 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.54/109.71 [2019-03-28 12:36:34,816 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.54/109.71 [2019-03-28 12:36:34,816 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.54/109.71 [2019-03-28 12:36:34,817 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.54/109.71 [2019-03-28 12:36:34,817 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.54/109.71 [2019-03-28 12:36:34,818 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.54/109.71 [2019-03-28 12:36:34,818 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.54/109.71 [2019-03-28 12:36:34,818 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.54/109.71 [2019-03-28 12:36:34,819 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.54/109.71 [2019-03-28 12:36:34,819 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.54/109.71 [2019-03-28 12:36:34,819 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.54/109.71 [2019-03-28 12:36:34,820 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.54/109.71 [2019-03-28 12:36:34,820 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.54/109.71 [2019-03-28 12:36:34,820 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.54/109.71 [2019-03-28 12:36:34,821 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.54/109.71 [2019-03-28 12:36:34,821 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.54/109.71 [2019-03-28 12:36:34,821 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.54/109.71 [2019-03-28 12:36:34,822 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.54/109.71 [2019-03-28 12:36:34,822 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.54/109.71 [2019-03-28 12:36:34,822 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.54/109.71 [2019-03-28 12:36:34,822 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.54/109.71 [2019-03-28 12:36:34,823 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.54/109.71 [2019-03-28 12:36:34,823 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.54/109.71 [2019-03-28 12:36:34,823 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.54/109.71 [2019-03-28 12:36:34,823 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.54/109.71 [2019-03-28 12:36:34,824 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.54/109.71 [2019-03-28 12:36:34,824 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.54/109.71 [2019-03-28 12:36:34,826 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 172.54/109.71 [2019-03-28 12:36:34,827 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 172.54/109.71 [2019-03-28 12:36:34,827 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 172.54/109.71 [2019-03-28 12:36:34,827 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 172.54/109.71 [2019-03-28 12:36:34,828 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 172.54/109.71 [2019-03-28 12:36:34,828 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 172.54/109.71 [2019-03-28 12:36:34,828 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 172.54/109.71 [2019-03-28 12:36:34,829 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 172.54/109.71 [2019-03-28 12:36:34,829 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 172.54/109.71 [2019-03-28 12:36:34,830 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 172.54/109.71 [2019-03-28 12:36:34,830 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 172.54/109.71 [2019-03-28 12:36:34,830 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 172.54/109.71 [2019-03-28 12:36:34,831 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 172.54/109.71 [2019-03-28 12:36:34,831 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 172.54/109.71 [2019-03-28 12:36:34,831 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 172.54/109.71 [2019-03-28 12:36:34,832 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 172.54/109.71 [2019-03-28 12:36:34,832 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 172.54/109.71 [2019-03-28 12:36:34,832 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 172.54/109.71 [2019-03-28 12:36:34,833 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 172.54/109.71 [2019-03-28 12:36:34,833 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 172.54/109.71 [2019-03-28 12:36:34,833 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 172.54/109.71 [2019-03-28 12:36:34,834 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 172.54/109.71 [2019-03-28 12:36:34,834 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 172.54/109.71 [2019-03-28 12:36:34,835 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 172.54/109.71 [2019-03-28 12:36:34,835 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 172.54/109.71 [2019-03-28 12:36:34,835 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 172.54/109.71 [2019-03-28 12:36:34,836 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 172.54/109.71 [2019-03-28 12:36:34,836 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 172.54/109.71 [2019-03-28 12:36:34,836 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 172.54/109.71 [2019-03-28 12:36:34,837 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 172.54/109.71 [2019-03-28 12:36:34,837 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 172.54/109.71 [2019-03-28 12:36:34,838 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 172.54/109.71 [2019-03-28 12:36:34,838 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 172.54/109.71 [2019-03-28 12:36:34,838 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 172.54/109.71 [2019-03-28 12:36:34,839 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 172.54/109.71 [2019-03-28 12:36:34,839 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 172.54/109.71 [2019-03-28 12:36:34,839 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 172.54/109.71 [2019-03-28 12:36:34,840 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 172.54/109.71 [2019-03-28 12:36:34,840 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 172.54/109.71 [2019-03-28 12:36:34,840 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 172.54/109.71 [2019-03-28 12:36:34,840 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 172.54/109.71 [2019-03-28 12:36:34,841 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 172.54/109.71 [2019-03-28 12:36:34,841 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 172.54/109.71 [2019-03-28 12:36:34,842 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 172.54/109.71 [2019-03-28 12:36:34,842 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 172.54/109.71 [2019-03-28 12:36:34,842 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 172.54/109.71 [2019-03-28 12:36:34,843 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 172.54/109.71 [2019-03-28 12:36:34,843 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 172.54/109.71 [2019-03-28 12:36:34,843 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 172.54/109.71 [2019-03-28 12:36:34,844 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 172.54/109.71 [2019-03-28 12:36:34,844 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 172.54/109.71 [2019-03-28 12:36:34,844 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 172.54/109.71 [2019-03-28 12:36:34,845 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 172.54/109.71 [2019-03-28 12:36:34,845 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 172.54/109.71 [2019-03-28 12:36:34,845 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] 172.54/109.71 [2019-03-28 12:36:34,846 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] 172.54/109.71 [2019-03-28 12:36:34,846 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] 172.54/109.71 [2019-03-28 12:36:34,846 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 172.54/109.71 [2019-03-28 12:36:34,847 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 172.54/109.71 [2019-03-28 12:36:34,847 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 172.54/109.71 [2019-03-28 12:36:34,847 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 172.54/109.71 [2019-03-28 12:36:34,848 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 172.54/109.71 [2019-03-28 12:36:34,848 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 172.54/109.71 [2019-03-28 12:36:34,848 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 172.54/109.71 [2019-03-28 12:36:34,849 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 172.54/109.71 [2019-03-28 12:36:34,849 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 172.54/109.71 [2019-03-28 12:36:34,849 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 172.54/109.71 [2019-03-28 12:36:34,850 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 172.54/109.71 [2019-03-28 12:36:34,850 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 172.54/109.71 [2019-03-28 12:36:34,850 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_#t~malloc12.base,QUANTIFIED] 172.54/109.71 [2019-03-28 12:36:34,851 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_#t~malloc12.base,QUANTIFIED] 172.54/109.71 [2019-03-28 12:36:34,851 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_#t~malloc12.base,QUANTIFIED] 172.54/109.71 [2019-03-28 12:36:34,851 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] 172.54/109.71 [2019-03-28 12:36:34,851 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] 172.54/109.71 [2019-03-28 12:36:34,852 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] 172.54/109.71 [2019-03-28 12:36:34,852 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] 172.54/109.71 [2019-03-28 12:36:34,852 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] 172.54/109.71 [2019-03-28 12:36:34,852 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] 172.54/109.71 [2019-03-28 12:36:34,855 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.54/109.71 [2019-03-28 12:36:34,856 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.54/109.71 [2019-03-28 12:36:34,856 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.54/109.71 [2019-03-28 12:36:34,856 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.54/109.71 [2019-03-28 12:36:34,857 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.54/109.71 [2019-03-28 12:36:34,857 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.54/109.71 [2019-03-28 12:36:34,857 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.54/109.71 [2019-03-28 12:36:34,858 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.54/109.71 [2019-03-28 12:36:34,858 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.54/109.71 [2019-03-28 12:36:34,858 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.54/109.71 [2019-03-28 12:36:34,858 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.54/109.71 [2019-03-28 12:36:34,859 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.54/109.71 [2019-03-28 12:36:34,859 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.54/109.71 [2019-03-28 12:36:34,859 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.54/109.71 [2019-03-28 12:36:34,860 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.54/109.71 [2019-03-28 12:36:34,860 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.54/109.71 [2019-03-28 12:36:34,860 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.54/109.71 [2019-03-28 12:36:34,860 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.54/109.71 [2019-03-28 12:36:34,861 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.54/109.71 [2019-03-28 12:36:34,861 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.54/109.71 [2019-03-28 12:36:34,861 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.54/109.71 [2019-03-28 12:36:34,862 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.54/109.71 [2019-03-28 12:36:34,862 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.54/109.71 [2019-03-28 12:36:34,862 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.54/109.71 [2019-03-28 12:36:34,863 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.54/109.71 [2019-03-28 12:36:34,863 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.54/109.71 [2019-03-28 12:36:34,863 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.54/109.71 [2019-03-28 12:36:34,863 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.54/109.71 [2019-03-28 12:36:34,864 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.54/109.71 [2019-03-28 12:36:34,864 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.54/109.71 [2019-03-28 12:36:34,864 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.54/109.71 [2019-03-28 12:36:34,865 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.54/109.71 [2019-03-28 12:36:34,865 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.54/109.71 [2019-03-28 12:36:34,865 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.54/109.71 [2019-03-28 12:36:34,865 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.54/109.71 [2019-03-28 12:36:34,866 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.54/109.71 [2019-03-28 12:36:34,866 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.54/109.71 [2019-03-28 12:36:34,866 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.54/109.71 [2019-03-28 12:36:34,867 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.54/109.71 [2019-03-28 12:36:34,867 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.54/109.71 [2019-03-28 12:36:34,868 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.54/109.71 [2019-03-28 12:36:34,868 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.54/109.71 [2019-03-28 12:36:34,868 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.54/109.71 [2019-03-28 12:36:34,869 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.54/109.71 [2019-03-28 12:36:34,869 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.54/109.71 [2019-03-28 12:36:34,869 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.54/109.71 [2019-03-28 12:36:34,870 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.54/109.71 [2019-03-28 12:36:34,870 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.54/109.71 [2019-03-28 12:36:34,871 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.54/109.71 [2019-03-28 12:36:34,871 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.54/109.71 [2019-03-28 12:36:34,871 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.54/109.71 [2019-03-28 12:36:34,871 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.54/109.71 [2019-03-28 12:36:34,872 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.54/109.71 [2019-03-28 12:36:34,872 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.54/109.71 [2019-03-28 12:36:34,872 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.54/109.71 [2019-03-28 12:36:34,872 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.54/109.71 [2019-03-28 12:36:34,873 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.54/109.71 [2019-03-28 12:36:34,873 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.54/109.71 [2019-03-28 12:36:34,873 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.54/109.71 [2019-03-28 12:36:34,873 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.54/109.71 [2019-03-28 12:36:34,874 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.54/109.71 [2019-03-28 12:36:34,874 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.54/109.71 [2019-03-28 12:36:34,874 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.54/109.71 [2019-03-28 12:36:34,875 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.54/109.71 [2019-03-28 12:36:34,875 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.54/109.71 [2019-03-28 12:36:34,875 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.54/109.71 [2019-03-28 12:36:34,876 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.54/109.71 [2019-03-28 12:36:34,876 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.54/109.71 [2019-03-28 12:36:34,876 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.54/109.71 [2019-03-28 12:36:34,876 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.54/109.71 [2019-03-28 12:36:34,877 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.54/109.71 [2019-03-28 12:36:34,877 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.54/109.71 [2019-03-28 12:36:34,877 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.54/109.71 [2019-03-28 12:36:34,877 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.54/109.71 [2019-03-28 12:36:34,878 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.54/109.71 [2019-03-28 12:36:34,878 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.54/109.71 [2019-03-28 12:36:34,878 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.54/109.71 [2019-03-28 12:36:34,878 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.54/109.71 [2019-03-28 12:36:34,879 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.54/109.71 [2019-03-28 12:36:34,879 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.54/109.71 [2019-03-28 12:36:34,879 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.54/109.71 [2019-03-28 12:36:34,880 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.54/109.71 [2019-03-28 12:36:34,880 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.54/109.71 [2019-03-28 12:36:34,880 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.54/109.71 [2019-03-28 12:36:34,881 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.54/109.71 [2019-03-28 12:36:34,881 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.54/109.71 [2019-03-28 12:36:34,881 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.54/109.71 [2019-03-28 12:36:34,881 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.54/109.71 [2019-03-28 12:36:34,882 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.54/109.71 [2019-03-28 12:36:34,882 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.54/109.71 [2019-03-28 12:36:34,882 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.54/109.71 [2019-03-28 12:36:34,882 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.54/109.71 [2019-03-28 12:36:34,882 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.54/109.71 [2019-03-28 12:36:34,883 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.54/109.71 [2019-03-28 12:36:34,883 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.54/109.71 [2019-03-28 12:36:34,883 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.54/109.71 [2019-03-28 12:36:34,883 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.54/109.71 [2019-03-28 12:36:34,884 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.54/109.71 [2019-03-28 12:36:34,884 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.54/109.71 [2019-03-28 12:36:34,884 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.54/109.71 [2019-03-28 12:36:34,884 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.54/109.71 [2019-03-28 12:36:34,885 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.54/109.71 [2019-03-28 12:36:34,885 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.54/109.72 [2019-03-28 12:36:34,885 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.54/109.72 [2019-03-28 12:36:34,885 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.54/109.72 [2019-03-28 12:36:34,885 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.54/109.72 [2019-03-28 12:36:34,886 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.54/109.72 [2019-03-28 12:36:34,886 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.54/109.72 [2019-03-28 12:36:34,886 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.54/109.72 [2019-03-28 12:36:34,887 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.54/109.72 [2019-03-28 12:36:34,887 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.54/109.72 [2019-03-28 12:36:34,887 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.54/109.72 [2019-03-28 12:36:34,888 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.54/109.72 [2019-03-28 12:36:34,888 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.54/109.72 [2019-03-28 12:36:34,888 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.54/109.72 [2019-03-28 12:36:34,889 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.54/109.72 [2019-03-28 12:36:34,889 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.54/109.72 [2019-03-28 12:36:34,889 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.54/109.72 [2019-03-28 12:36:34,890 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.54/109.72 [2019-03-28 12:36:34,890 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.54/109.72 [2019-03-28 12:36:34,890 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.54/109.72 [2019-03-28 12:36:34,890 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.54/109.72 [2019-03-28 12:36:34,891 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.54/109.72 [2019-03-28 12:36:34,891 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.54/109.72 [2019-03-28 12:36:34,892 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.54/109.72 [2019-03-28 12:36:34,892 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.54/109.72 [2019-03-28 12:36:34,892 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.54/109.72 [2019-03-28 12:36:34,893 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.54/109.72 [2019-03-28 12:36:34,893 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.54/109.72 [2019-03-28 12:36:34,893 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.54/109.72 [2019-03-28 12:36:34,894 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.54/109.72 [2019-03-28 12:36:34,894 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.54/109.72 [2019-03-28 12:36:34,894 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.54/109.72 [2019-03-28 12:36:34,895 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.54/109.72 [2019-03-28 12:36:34,895 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.54/109.72 [2019-03-28 12:36:34,895 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.54/109.72 [2019-03-28 12:36:34,896 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.54/109.72 [2019-03-28 12:36:34,896 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.54/109.72 [2019-03-28 12:36:34,896 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.54/109.72 [2019-03-28 12:36:34,896 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.54/109.72 [2019-03-28 12:36:34,896 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.54/109.72 [2019-03-28 12:36:34,897 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.54/109.72 [2019-03-28 12:36:34,897 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.54/109.72 [2019-03-28 12:36:34,897 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.54/109.72 [2019-03-28 12:36:34,898 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.54/109.72 [2019-03-28 12:36:34,898 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.54/109.72 [2019-03-28 12:36:34,898 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.54/109.72 [2019-03-28 12:36:34,902 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:36:34 BasicIcfg 172.54/109.72 [2019-03-28 12:36:34,902 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- 172.54/109.72 [2019-03-28 12:36:34,903 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- 172.54/109.72 [2019-03-28 12:36:34,903 INFO L271 PluginConnector]: Initializing BuchiAutomizer... 172.54/109.72 [2019-03-28 12:36:34,907 INFO L276 PluginConnector]: BuchiAutomizer initialized 172.54/109.72 [2019-03-28 12:36:34,907 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 172.54/109.72 [2019-03-28 12:36:34,908 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.03 12:35:01" (1/5) ... 172.54/109.72 [2019-03-28 12:36:34,908 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@120c866f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.03 12:36:34, skipping insertion in model container 172.54/109.72 [2019-03-28 12:36:34,908 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 172.54/109.72 [2019-03-28 12:36:34,908 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:35:01" (2/5) ... 172.54/109.72 [2019-03-28 12:36:34,909 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@120c866f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.03 12:36:34, skipping insertion in model container 172.54/109.72 [2019-03-28 12:36:34,909 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 172.54/109.72 [2019-03-28 12:36:34,909 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:35:02" (3/5) ... 172.54/109.72 [2019-03-28 12:36:34,909 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@120c866f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:36:34, skipping insertion in model container 172.54/109.72 [2019-03-28 12:36:34,909 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 172.54/109.72 [2019-03-28 12:36:34,909 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:35:02" (4/5) ... 172.54/109.72 [2019-03-28 12:36:34,910 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@120c866f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:36:34, skipping insertion in model container 172.54/109.72 [2019-03-28 12:36:34,910 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 172.54/109.72 [2019-03-28 12:36:34,910 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:36:34" (5/5) ... 172.54/109.72 [2019-03-28 12:36:34,911 INFO L375 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 172.54/109.72 [2019-03-28 12:36:34,935 INFO L133 ementStrategyFactory]: Using default assertion order modulation 172.54/109.72 [2019-03-28 12:36:34,935 INFO L374 BuchiCegarLoop]: Interprodecural is true 172.54/109.72 [2019-03-28 12:36:34,935 INFO L375 BuchiCegarLoop]: Hoare is true 172.54/109.72 [2019-03-28 12:36:34,936 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates 172.54/109.72 [2019-03-28 12:36:34,936 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE 172.54/109.72 [2019-03-28 12:36:34,936 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION 172.54/109.72 [2019-03-28 12:36:34,943 INFO L379 BuchiCegarLoop]: Difference is false 172.54/109.72 [2019-03-28 12:36:34,944 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA 172.54/109.72 [2019-03-28 12:36:34,944 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== 172.54/109.72 [2019-03-28 12:36:34,948 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states. 172.54/109.72 [2019-03-28 12:36:34,954 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 172.54/109.72 [2019-03-28 12:36:34,954 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 172.54/109.72 [2019-03-28 12:36:34,954 INFO L119 BuchiIsEmpty]: Starting construction of run 172.54/109.72 [2019-03-28 12:36:34,959 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] 172.54/109.72 [2019-03-28 12:36:34,959 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] 172.54/109.72 [2019-03-28 12:36:34,959 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ 172.54/109.72 [2019-03-28 12:36:34,959 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states. 172.54/109.72 [2019-03-28 12:36:34,961 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 172.54/109.72 [2019-03-28 12:36:34,961 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 172.54/109.72 [2019-03-28 12:36:34,961 INFO L119 BuchiIsEmpty]: Starting construction of run 172.54/109.72 [2019-03-28 12:36:34,961 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] 172.54/109.72 [2019-03-28 12:36:34,961 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] 172.54/109.72 [2019-03-28 12:36:34,967 INFO L794 eck$LassoCheckResult]: Stem: 31#ULTIMATE.startENTRYtrue [189] ULTIMATE.startENTRY-->L24: Formula: (and (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|) (= |v_#valid_23| (store |v_#valid_24| 0 0))) InVars {#valid=|v_#valid_24|} OutVars{ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_6|, ULTIMATE.start_main_#t~malloc11.offset=|v_ULTIMATE.start_main_#t~malloc11.offset_5|, ULTIMATE.start_main_#t~nondet9=|v_ULTIMATE.start_main_#t~nondet9_6|, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_10, ULTIMATE.start_main_#t~malloc12.base=|v_ULTIMATE.start_main_#t~malloc12.base_5|, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~malloc11.base=|v_ULTIMATE.start_main_#t~malloc11.base_5|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_7, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_6, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~malloc12.offset=|v_ULTIMATE.start_main_#t~malloc12.offset_5|, ULTIMATE.start_main_#t~ret13=|v_ULTIMATE.start_main_#t~ret13_4|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, #valid=|v_#valid_23|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_6, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10, ULTIMATE.start_main_#t~malloc11.offset, ULTIMATE.start_main_#t~nondet9, ULTIMATE.start_main_~length1~0, ULTIMATE.start_main_#t~malloc12.base, #NULL.offset, ULTIMATE.start_main_#t~malloc11.base, ULTIMATE.start_main_~nondetString2~0.base, ULTIMATE.start_main_~nondetString2~0.offset, #NULL.base, ULTIMATE.start_main_#t~malloc12.offset, ULTIMATE.start_main_#t~ret13, ULTIMATE.start_main_~nondetString1~0.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_~nondetString1~0.offset, ULTIMATE.start_main_~length2~0] 33#L24true [126] L24-->L24-2: Formula: (>= v_ULTIMATE.start_main_~length1~0_6 1) InVars {ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_6} OutVars{ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_6} AuxVars[] AssignedVars[] 32#L24-2true [127] L24-2-->L27-1: Formula: (>= v_ULTIMATE.start_main_~length2~0_6 1) InVars {ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_6} OutVars{ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_6} AuxVars[] AssignedVars[] 3#L27-1true [150] L27-1-->L32: Formula: (let ((.cse0 (store |v_#valid_10| |v_ULTIMATE.start_main_#t~malloc11.base_4| 1))) (and (= v_ULTIMATE.start_main_~nondetString1~0.offset_2 |v_ULTIMATE.start_main_#t~malloc11.offset_4|) (= v_ULTIMATE.start_main_~nondetString2~0.offset_2 |v_ULTIMATE.start_main_#t~malloc12.offset_4|) (= |v_ULTIMATE.start_main_#t~malloc11.offset_4| 0) (= 0 (select |v_#valid_10| |v_ULTIMATE.start_main_#t~malloc11.base_4|)) (> 0 |v_ULTIMATE.start_main_#t~malloc12.base_4|) (= |v_ULTIMATE.start_main_#t~malloc12.offset_4| 0) (= (store .cse0 |v_ULTIMATE.start_main_#t~malloc12.base_4| 1) |v_#valid_8|) (< |v_ULTIMATE.start_main_#t~malloc11.base_4| 0) (= v_ULTIMATE.start_main_~nondetString2~0.base_2 |v_ULTIMATE.start_main_#t~malloc12.base_4|) (= 0 (select .cse0 |v_ULTIMATE.start_main_#t~malloc12.base_4|)) (< |v_ULTIMATE.start_main_#t~malloc12.base_4| |v_#StackHeapBarrier_1|) (< |v_ULTIMATE.start_main_#t~malloc11.base_4| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_main_~nondetString1~0.base_2 |v_ULTIMATE.start_main_#t~malloc11.base_4|) (= |v_#length_3| (store (store |v_#length_5| |v_ULTIMATE.start_main_#t~malloc11.base_4| v_ULTIMATE.start_main_~length1~0_7) |v_ULTIMATE.start_main_#t~malloc12.base_4| v_ULTIMATE.start_main_~length2~0_7)))) InVars {ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_5|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_7, #valid=|v_#valid_10|} OutVars{ULTIMATE.start_main_#t~malloc11.offset=|v_ULTIMATE.start_main_#t~malloc11.offset_4|, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_7, ULTIMATE.start_main_#t~malloc12.base=|v_ULTIMATE.start_main_#t~malloc12.base_4|, ULTIMATE.start_main_#t~malloc11.base=|v_ULTIMATE.start_main_#t~malloc11.base_4|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_2, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_2, ULTIMATE.start_main_#t~malloc12.offset=|v_ULTIMATE.start_main_#t~malloc12.offset_4|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_2, #valid=|v_#valid_8|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_2, #length=|v_#length_3|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc12.offset, ULTIMATE.start_main_#t~malloc11.offset, ULTIMATE.start_main_~nondetString1~0.base, #valid, ULTIMATE.start_main_#t~malloc12.base, ULTIMATE.start_main_~nondetString1~0.offset, ULTIMATE.start_main_#t~malloc11.base, #length, ULTIMATE.start_main_~nondetString2~0.base, ULTIMATE.start_main_~nondetString2~0.offset] 13#L32true [96] L32-->L32-1: Formula: (let ((.cse0 (+ v_ULTIMATE.start_main_~length1~0_8 v_ULTIMATE.start_main_~nondetString1~0.offset_3))) (and (<= 1 .cse0) (= 1 (select |v_#valid_11| v_ULTIMATE.start_main_~nondetString1~0.base_3)) (= |v_#memory_int_2| (store |v_#memory_int_3| v_ULTIMATE.start_main_~nondetString1~0.base_3 (store (select |v_#memory_int_3| v_ULTIMATE.start_main_~nondetString1~0.base_3) (+ v_ULTIMATE.start_main_~length1~0_8 v_ULTIMATE.start_main_~nondetString1~0.offset_3 (- 1)) 0))) (<= .cse0 (select |v_#length_6| v_ULTIMATE.start_main_~nondetString1~0.base_3)))) InVars {ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_3, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_3|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_3, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_8, #length=|v_#length_6|} OutVars{ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_3, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_3, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_8, #length=|v_#length_6|} AuxVars[] AssignedVars[#memory_int] 11#L32-1true [190] L32-1-->L8-3: Formula: (let ((.cse0 (+ v_ULTIMATE.start_main_~length2~0_11 v_ULTIMATE.start_main_~nondetString2~0.offset_7))) (and (= v_ULTIMATE.start_substring_~ps~0.offset_8 v_ULTIMATE.start_substring_~s.offset_3) (<= 1 .cse0) (= v_ULTIMATE.start_main_~nondetString2~0.base_8 |v_ULTIMATE.start_substring_#in~t.base_2|) (= |v_ULTIMATE.start_substring_#in~s.offset_2| v_ULTIMATE.start_substring_~s.offset_3) (= (select |v_#valid_25| v_ULTIMATE.start_main_~nondetString2~0.base_8) 1) (= |v_ULTIMATE.start_substring_#in~t.base_2| v_ULTIMATE.start_substring_~t.base_4) (= |v_ULTIMATE.start_substring_#in~s.base_2| v_ULTIMATE.start_main_~nondetString1~0.base_8) (= (store |v_#memory_int_11| v_ULTIMATE.start_main_~nondetString2~0.base_8 (store (select |v_#memory_int_11| v_ULTIMATE.start_main_~nondetString2~0.base_8) (+ v_ULTIMATE.start_main_~length2~0_11 v_ULTIMATE.start_main_~nondetString2~0.offset_7 (- 1)) 0)) |v_#memory_int_10|) (= v_ULTIMATE.start_main_~nondetString2~0.offset_7 |v_ULTIMATE.start_substring_#in~t.offset_2|) (= v_ULTIMATE.start_main_~nondetString1~0.offset_7 |v_ULTIMATE.start_substring_#in~s.offset_2|) (= |v_ULTIMATE.start_substring_#in~t.offset_2| v_ULTIMATE.start_substring_~t.offset_4) (= |v_ULTIMATE.start_substring_#in~s.base_2| v_ULTIMATE.start_substring_~s.base_3) (= v_ULTIMATE.start_substring_~s.base_3 v_ULTIMATE.start_substring_~ps~0.base_9) (<= .cse0 (select |v_#length_18| v_ULTIMATE.start_main_~nondetString2~0.base_8)))) InVars {ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_8, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_7, #length=|v_#length_18|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_8, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_7, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_11} OutVars{ULTIMATE.start_substring_#in~t.offset=|v_ULTIMATE.start_substring_#in~t.offset_2|, ULTIMATE.start_substring_~ps~0.offset=v_ULTIMATE.start_substring_~ps~0.offset_8, ULTIMATE.start_substring_#t~post5.offset=|v_ULTIMATE.start_substring_#t~post5.offset_4|, ULTIMATE.start_substring_~ps2~0.base=v_ULTIMATE.start_substring_~ps2~0.base_8, ULTIMATE.start_substring_#t~mem7=|v_ULTIMATE.start_substring_#t~mem7_7|, ULTIMATE.start_substring_~t.offset=v_ULTIMATE.start_substring_~t.offset_4, ULTIMATE.start_substring_#t~mem3=|v_ULTIMATE.start_substring_#t~mem3_6|, ULTIMATE.start_substring_#t~mem2=|v_ULTIMATE.start_substring_#t~mem2_6|, ULTIMATE.start_substring_#t~mem1=|v_ULTIMATE.start_substring_#t~mem1_6|, ULTIMATE.start_substring_#in~s.offset=|v_ULTIMATE.start_substring_#in~s.offset_2|, ULTIMATE.start_substring_#t~mem0=|v_ULTIMATE.start_substring_#t~mem0_7|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_8, ULTIMATE.start_substring_~ps2~0.offset=v_ULTIMATE.start_substring_~ps2~0.offset_7, ULTIMATE.start_substring_~pt~0.base=v_ULTIMATE.start_substring_~pt~0.base_14, ULTIMATE.start_substring_#t~post8.offset=|v_ULTIMATE.start_substring_#t~post8.offset_4|, #length=|v_#length_18|, ULTIMATE.start_substring_~pt~0.offset=v_ULTIMATE.start_substring_~pt~0.offset_11, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_11, ULTIMATE.start_substring_#res=|v_ULTIMATE.start_substring_#res_5|, ULTIMATE.start_substring_#t~post6.offset=|v_ULTIMATE.start_substring_#t~post6.offset_4|, ULTIMATE.start_substring_~t.base=v_ULTIMATE.start_substring_~t.base_4, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_8, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_7, ULTIMATE.start_substring_~s.base=v_ULTIMATE.start_substring_~s.base_3, ULTIMATE.start_substring_#in~t.base=|v_ULTIMATE.start_substring_#in~t.base_2|, ULTIMATE.start_substring_#in~s.base=|v_ULTIMATE.start_substring_#in~s.base_2|, ULTIMATE.start_substring_#t~post6.base=|v_ULTIMATE.start_substring_#t~post6.base_4|, ULTIMATE.start_substring_#t~post8.base=|v_ULTIMATE.start_substring_#t~post8.base_4|, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_10|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_7, ULTIMATE.start_substring_~ps~0.base=v_ULTIMATE.start_substring_~ps~0.base_9, ULTIMATE.start_substring_#t~post5.base=|v_ULTIMATE.start_substring_#t~post5.base_4|, ULTIMATE.start_substring_~s.offset=v_ULTIMATE.start_substring_~s.offset_3, ULTIMATE.start_substring_#t~short4=|v_ULTIMATE.start_substring_#t~short4_10|} AuxVars[] AssignedVars[ULTIMATE.start_substring_#in~t.offset, ULTIMATE.start_substring_~ps~0.offset, ULTIMATE.start_substring_#t~post5.offset, ULTIMATE.start_substring_~ps2~0.base, ULTIMATE.start_substring_#t~mem7, ULTIMATE.start_substring_~t.offset, ULTIMATE.start_substring_#t~mem3, ULTIMATE.start_substring_#t~mem2, ULTIMATE.start_substring_#t~mem1, ULTIMATE.start_substring_#in~s.offset, ULTIMATE.start_substring_#t~mem0, ULTIMATE.start_substring_~ps2~0.offset, ULTIMATE.start_substring_~pt~0.base, ULTIMATE.start_substring_#t~post8.offset, ULTIMATE.start_substring_~pt~0.offset, ULTIMATE.start_substring_#res, ULTIMATE.start_substring_#t~post6.offset, ULTIMATE.start_substring_~t.base, ULTIMATE.start_substring_~s.base, ULTIMATE.start_substring_#in~t.base, ULTIMATE.start_substring_#in~s.base, ULTIMATE.start_substring_#t~post6.base, ULTIMATE.start_substring_#t~post8.base, #memory_int, ULTIMATE.start_substring_~ps~0.base, ULTIMATE.start_substring_#t~post5.base, ULTIMATE.start_substring_~s.offset, ULTIMATE.start_substring_#t~short4] 22#L8-3true 172.54/109.72 [2019-03-28 12:36:34,968 INFO L796 eck$LassoCheckResult]: Loop: 22#L8-3true [113] L8-3-->L8-1: Formula: (and (= (select (select |v_#memory_int_6| v_ULTIMATE.start_substring_~ps~0.base_5) v_ULTIMATE.start_substring_~ps~0.offset_5) |v_ULTIMATE.start_substring_#t~mem0_2|) (= (select |v_#valid_15| v_ULTIMATE.start_substring_~ps~0.base_5) 1) (<= 0 v_ULTIMATE.start_substring_~ps~0.offset_5) (<= (+ v_ULTIMATE.start_substring_~ps~0.offset_5 1) (select |v_#length_10| v_ULTIMATE.start_substring_~ps~0.base_5))) InVars {ULTIMATE.start_substring_~ps~0.offset=v_ULTIMATE.start_substring_~ps~0.offset_5, #memory_int=|v_#memory_int_6|, #length=|v_#length_10|, ULTIMATE.start_substring_~ps~0.base=v_ULTIMATE.start_substring_~ps~0.base_5, #valid=|v_#valid_15|} OutVars{ULTIMATE.start_substring_#t~mem0=|v_ULTIMATE.start_substring_#t~mem0_2|, #valid=|v_#valid_15|, ULTIMATE.start_substring_~ps~0.offset=v_ULTIMATE.start_substring_~ps~0.offset_5, #memory_int=|v_#memory_int_6|, #length=|v_#length_10|, ULTIMATE.start_substring_~ps~0.base=v_ULTIMATE.start_substring_~ps~0.base_5} AuxVars[] AssignedVars[ULTIMATE.start_substring_#t~mem0] 27#L8-1true [163] L8-1-->L11-9: Formula: (and (= v_ULTIMATE.start_substring_~ps2~0.base_2 v_ULTIMATE.start_substring_~ps~0.base_8) (= v_ULTIMATE.start_substring_~pt~0.offset_4 v_ULTIMATE.start_substring_~t.offset_3) (< 0 |v_ULTIMATE.start_substring_#t~mem0_6|) (= v_ULTIMATE.start_substring_~pt~0.base_5 v_ULTIMATE.start_substring_~t.base_3) (= v_ULTIMATE.start_substring_~ps2~0.offset_2 v_ULTIMATE.start_substring_~ps~0.offset_7)) InVars {ULTIMATE.start_substring_~ps~0.offset=v_ULTIMATE.start_substring_~ps~0.offset_7, ULTIMATE.start_substring_~t.offset=v_ULTIMATE.start_substring_~t.offset_3, ULTIMATE.start_substring_~ps~0.base=v_ULTIMATE.start_substring_~ps~0.base_8, ULTIMATE.start_substring_~t.base=v_ULTIMATE.start_substring_~t.base_3, ULTIMATE.start_substring_#t~mem0=|v_ULTIMATE.start_substring_#t~mem0_6|} OutVars{ULTIMATE.start_substring_~t.offset=v_ULTIMATE.start_substring_~t.offset_3, ULTIMATE.start_substring_#t~mem0=|v_ULTIMATE.start_substring_#t~mem0_5|, ULTIMATE.start_substring_~ps2~0.offset=v_ULTIMATE.start_substring_~ps2~0.offset_2, ULTIMATE.start_substring_~pt~0.base=v_ULTIMATE.start_substring_~pt~0.base_5, ULTIMATE.start_substring_~ps~0.offset=v_ULTIMATE.start_substring_~ps~0.offset_7, ULTIMATE.start_substring_~ps2~0.base=v_ULTIMATE.start_substring_~ps2~0.base_2, ULTIMATE.start_substring_~ps~0.base=v_ULTIMATE.start_substring_~ps~0.base_8, ULTIMATE.start_substring_~t.base=v_ULTIMATE.start_substring_~t.base_3, ULTIMATE.start_substring_~pt~0.offset=v_ULTIMATE.start_substring_~pt~0.offset_4} AuxVars[] AssignedVars[ULTIMATE.start_substring_#t~mem0, ULTIMATE.start_substring_~ps2~0.offset, ULTIMATE.start_substring_~pt~0.base, ULTIMATE.start_substring_~ps2~0.base, ULTIMATE.start_substring_~pt~0.offset] 16#L11-9true [103] L11-9-->L11-1: Formula: (and (<= 0 v_ULTIMATE.start_substring_~pt~0.offset_5) (<= (+ v_ULTIMATE.start_substring_~pt~0.offset_5 1) (select |v_#length_12| v_ULTIMATE.start_substring_~pt~0.base_6)) (= |v_ULTIMATE.start_substring_#t~mem1_2| (select (select |v_#memory_int_7| v_ULTIMATE.start_substring_~pt~0.base_6) v_ULTIMATE.start_substring_~pt~0.offset_5)) (= (select |v_#valid_17| v_ULTIMATE.start_substring_~pt~0.base_6) 1)) InVars {#memory_int=|v_#memory_int_7|, #length=|v_#length_12|, ULTIMATE.start_substring_~pt~0.offset=v_ULTIMATE.start_substring_~pt~0.offset_5, ULTIMATE.start_substring_~pt~0.base=v_ULTIMATE.start_substring_~pt~0.base_6, #valid=|v_#valid_17|} OutVars{ULTIMATE.start_substring_#t~mem1=|v_ULTIMATE.start_substring_#t~mem1_2|, ULTIMATE.start_substring_~pt~0.base=v_ULTIMATE.start_substring_~pt~0.base_6, #valid=|v_#valid_17|, #memory_int=|v_#memory_int_7|, #length=|v_#length_12|, ULTIMATE.start_substring_~pt~0.offset=v_ULTIMATE.start_substring_~pt~0.offset_5} AuxVars[] AssignedVars[ULTIMATE.start_substring_#t~mem1] 29#L11-1true [173] L11-1-->L11-2: Formula: (and (= 0 |v_ULTIMATE.start_substring_#t~mem1_3|) (not |v_ULTIMATE.start_substring_#t~short4_2|)) InVars {ULTIMATE.start_substring_#t~mem1=|v_ULTIMATE.start_substring_#t~mem1_3|} OutVars{ULTIMATE.start_substring_#t~mem1=|v_ULTIMATE.start_substring_#t~mem1_3|, ULTIMATE.start_substring_#t~short4=|v_ULTIMATE.start_substring_#t~short4_2|} AuxVars[] AssignedVars[ULTIMATE.start_substring_#t~short4] 9#L11-2true [91] L11-2-->L11-7: Formula: (not |v_ULTIMATE.start_substring_#t~short4_5|) InVars {ULTIMATE.start_substring_#t~short4=|v_ULTIMATE.start_substring_#t~short4_5|} OutVars{ULTIMATE.start_substring_#t~short4=|v_ULTIMATE.start_substring_#t~short4_5|} AuxVars[] AssignedVars[] 20#L11-7true [108] L11-7-->L11-10: Formula: (not |v_ULTIMATE.start_substring_#t~short4_7|) InVars {ULTIMATE.start_substring_#t~short4=|v_ULTIMATE.start_substring_#t~short4_7|} OutVars{ULTIMATE.start_substring_#t~mem3=|v_ULTIMATE.start_substring_#t~mem3_4|, ULTIMATE.start_substring_#t~mem2=|v_ULTIMATE.start_substring_#t~mem2_4|, ULTIMATE.start_substring_#t~mem1=|v_ULTIMATE.start_substring_#t~mem1_4|, ULTIMATE.start_substring_#t~short4=|v_ULTIMATE.start_substring_#t~short4_6|} AuxVars[] AssignedVars[ULTIMATE.start_substring_#t~mem3, ULTIMATE.start_substring_#t~mem2, ULTIMATE.start_substring_#t~mem1, ULTIMATE.start_substring_#t~short4] 14#L11-10true [99] L11-10-->L15: Formula: (and (= (select |v_#valid_3| v_ULTIMATE.start_substring_~pt~0.base_1) 1) (<= (+ v_ULTIMATE.start_substring_~pt~0.offset_1 1) (select |v_#length_1| v_ULTIMATE.start_substring_~pt~0.base_1)) (= (select (select |v_#memory_int_1| v_ULTIMATE.start_substring_~pt~0.base_1) v_ULTIMATE.start_substring_~pt~0.offset_1) |v_ULTIMATE.start_substring_#t~mem7_1|) (<= 0 v_ULTIMATE.start_substring_~pt~0.offset_1)) InVars {#memory_int=|v_#memory_int_1|, #length=|v_#length_1|, ULTIMATE.start_substring_~pt~0.offset=v_ULTIMATE.start_substring_~pt~0.offset_1, ULTIMATE.start_substring_~pt~0.base=v_ULTIMATE.start_substring_~pt~0.base_1, #valid=|v_#valid_3|} OutVars{ULTIMATE.start_substring_~pt~0.base=v_ULTIMATE.start_substring_~pt~0.base_1, #valid=|v_#valid_3|, #memory_int=|v_#memory_int_1|, #length=|v_#length_1|, ULTIMATE.start_substring_~pt~0.offset=v_ULTIMATE.start_substring_~pt~0.offset_1, ULTIMATE.start_substring_#t~mem7=|v_ULTIMATE.start_substring_#t~mem7_1|} AuxVars[] AssignedVars[ULTIMATE.start_substring_#t~mem7] 21#L15true [176] L15-->L8-3: Formula: (and (= (+ v_ULTIMATE.start_substring_~ps~0.offset_2 1) v_ULTIMATE.start_substring_~ps~0.offset_1) (> 0 |v_ULTIMATE.start_substring_#t~mem7_5|) (= v_ULTIMATE.start_substring_~ps~0.base_2 v_ULTIMATE.start_substring_~ps~0.base_1)) InVars {ULTIMATE.start_substring_~ps~0.offset=v_ULTIMATE.start_substring_~ps~0.offset_2, ULTIMATE.start_substring_~ps~0.base=v_ULTIMATE.start_substring_~ps~0.base_2, ULTIMATE.start_substring_#t~mem7=|v_ULTIMATE.start_substring_#t~mem7_5|} OutVars{ULTIMATE.start_substring_~ps~0.offset=v_ULTIMATE.start_substring_~ps~0.offset_1, ULTIMATE.start_substring_#t~post8.base=|v_ULTIMATE.start_substring_#t~post8.base_1|, ULTIMATE.start_substring_#t~post8.offset=|v_ULTIMATE.start_substring_#t~post8.offset_1|, ULTIMATE.start_substring_~ps~0.base=v_ULTIMATE.start_substring_~ps~0.base_1, ULTIMATE.start_substring_#t~mem7=|v_ULTIMATE.start_substring_#t~mem7_4|} AuxVars[] AssignedVars[ULTIMATE.start_substring_#t~post8.base, ULTIMATE.start_substring_~ps~0.offset, ULTIMATE.start_substring_#t~post8.offset, ULTIMATE.start_substring_~ps~0.base, ULTIMATE.start_substring_#t~mem7] 22#L8-3true 172.54/109.72 [2019-03-28 12:36:34,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 172.54/109.72 [2019-03-28 12:36:34,969 INFO L82 PathProgramCache]: Analyzing trace with hash 2123740343, now seen corresponding path program 1 times 172.54/109.72 [2019-03-28 12:36:34,969 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 172.54/109.72 [2019-03-28 12:36:34,969 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 172.54/109.72 [2019-03-28 12:36:34,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 172.54/109.72 [2019-03-28 12:36:34,970 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 172.54/109.72 [2019-03-28 12:36:34,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 172.54/109.72 [2019-03-28 12:36:34,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 172.54/109.72 [2019-03-28 12:36:34,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 172.54/109.72 [2019-03-28 12:36:34,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 172.54/109.72 [2019-03-28 12:36:34,999 INFO L82 PathProgramCache]: Analyzing trace with hash -692780585, now seen corresponding path program 1 times 172.54/109.72 [2019-03-28 12:36:34,999 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 172.54/109.72 [2019-03-28 12:36:34,999 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 172.54/109.72 [2019-03-28 12:36:35,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 172.54/109.72 [2019-03-28 12:36:35,000 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 172.54/109.72 [2019-03-28 12:36:35,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 172.54/109.72 [2019-03-28 12:36:35,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 172.54/109.72 [2019-03-28 12:36:35,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 172.54/109.72 [2019-03-28 12:36:35,022 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 172.54/109.72 [2019-03-28 12:36:35,022 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 172.54/109.72 [2019-03-28 12:36:35,022 INFO L811 eck$LassoCheckResult]: loop already infeasible 172.54/109.72 [2019-03-28 12:36:35,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. 172.54/109.72 [2019-03-28 12:36:35,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 172.54/109.72 [2019-03-28 12:36:35,024 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 5 states. 172.54/109.72 [2019-03-28 12:36:35,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 172.54/109.72 [2019-03-28 12:36:35,190 INFO L93 Difference]: Finished difference Result 44 states and 80 transitions. 172.54/109.72 [2019-03-28 12:36:35,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 172.54/109.72 [2019-03-28 12:36:35,193 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 80 transitions. 172.54/109.72 [2019-03-28 12:36:35,195 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 172.54/109.72 [2019-03-28 12:36:35,196 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 22 states and 38 transitions. 172.54/109.72 [2019-03-28 12:36:35,197 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 172.54/109.72 [2019-03-28 12:36:35,197 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 172.54/109.72 [2019-03-28 12:36:35,198 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 38 transitions. 172.54/109.72 [2019-03-28 12:36:35,198 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 172.54/109.72 [2019-03-28 12:36:35,198 INFO L706 BuchiCegarLoop]: Abstraction has 22 states and 38 transitions. 172.54/109.72 [2019-03-28 12:36:35,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 38 transitions. 172.54/109.72 [2019-03-28 12:36:35,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. 172.54/109.72 [2019-03-28 12:36:35,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. 172.54/109.72 [2019-03-28 12:36:35,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 38 transitions. 172.54/109.72 [2019-03-28 12:36:35,202 INFO L729 BuchiCegarLoop]: Abstraction has 22 states and 38 transitions. 172.54/109.72 [2019-03-28 12:36:35,202 INFO L609 BuchiCegarLoop]: Abstraction has 22 states and 38 transitions. 172.54/109.72 [2019-03-28 12:36:35,202 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ 172.54/109.72 [2019-03-28 12:36:35,202 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 38 transitions. 172.54/109.72 [2019-03-28 12:36:35,203 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 172.54/109.72 [2019-03-28 12:36:35,203 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 172.54/109.72 [2019-03-28 12:36:35,203 INFO L119 BuchiIsEmpty]: Starting construction of run 172.54/109.72 [2019-03-28 12:36:35,204 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] 172.54/109.72 [2019-03-28 12:36:35,204 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] 172.54/109.72 [2019-03-28 12:36:35,204 INFO L794 eck$LassoCheckResult]: Stem: 106#ULTIMATE.startENTRY [189] ULTIMATE.startENTRY-->L24: Formula: (and (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|) (= |v_#valid_23| (store |v_#valid_24| 0 0))) InVars {#valid=|v_#valid_24|} OutVars{ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_6|, ULTIMATE.start_main_#t~malloc11.offset=|v_ULTIMATE.start_main_#t~malloc11.offset_5|, ULTIMATE.start_main_#t~nondet9=|v_ULTIMATE.start_main_#t~nondet9_6|, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_10, ULTIMATE.start_main_#t~malloc12.base=|v_ULTIMATE.start_main_#t~malloc12.base_5|, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~malloc11.base=|v_ULTIMATE.start_main_#t~malloc11.base_5|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_7, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_6, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~malloc12.offset=|v_ULTIMATE.start_main_#t~malloc12.offset_5|, ULTIMATE.start_main_#t~ret13=|v_ULTIMATE.start_main_#t~ret13_4|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, #valid=|v_#valid_23|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_6, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10, ULTIMATE.start_main_#t~malloc11.offset, ULTIMATE.start_main_#t~nondet9, ULTIMATE.start_main_~length1~0, ULTIMATE.start_main_#t~malloc12.base, #NULL.offset, ULTIMATE.start_main_#t~malloc11.base, ULTIMATE.start_main_~nondetString2~0.base, ULTIMATE.start_main_~nondetString2~0.offset, #NULL.base, ULTIMATE.start_main_#t~malloc12.offset, ULTIMATE.start_main_#t~ret13, ULTIMATE.start_main_~nondetString1~0.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_~nondetString1~0.offset, ULTIMATE.start_main_~length2~0] 107#L24 [126] L24-->L24-2: Formula: (>= v_ULTIMATE.start_main_~length1~0_6 1) InVars {ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_6} OutVars{ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_6} AuxVars[] AssignedVars[] 108#L24-2 [127] L24-2-->L27-1: Formula: (>= v_ULTIMATE.start_main_~length2~0_6 1) InVars {ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_6} OutVars{ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_6} AuxVars[] AssignedVars[] 92#L27-1 [150] L27-1-->L32: Formula: (let ((.cse0 (store |v_#valid_10| |v_ULTIMATE.start_main_#t~malloc11.base_4| 1))) (and (= v_ULTIMATE.start_main_~nondetString1~0.offset_2 |v_ULTIMATE.start_main_#t~malloc11.offset_4|) (= v_ULTIMATE.start_main_~nondetString2~0.offset_2 |v_ULTIMATE.start_main_#t~malloc12.offset_4|) (= |v_ULTIMATE.start_main_#t~malloc11.offset_4| 0) (= 0 (select |v_#valid_10| |v_ULTIMATE.start_main_#t~malloc11.base_4|)) (> 0 |v_ULTIMATE.start_main_#t~malloc12.base_4|) (= |v_ULTIMATE.start_main_#t~malloc12.offset_4| 0) (= (store .cse0 |v_ULTIMATE.start_main_#t~malloc12.base_4| 1) |v_#valid_8|) (< |v_ULTIMATE.start_main_#t~malloc11.base_4| 0) (= v_ULTIMATE.start_main_~nondetString2~0.base_2 |v_ULTIMATE.start_main_#t~malloc12.base_4|) (= 0 (select .cse0 |v_ULTIMATE.start_main_#t~malloc12.base_4|)) (< |v_ULTIMATE.start_main_#t~malloc12.base_4| |v_#StackHeapBarrier_1|) (< |v_ULTIMATE.start_main_#t~malloc11.base_4| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_main_~nondetString1~0.base_2 |v_ULTIMATE.start_main_#t~malloc11.base_4|) (= |v_#length_3| (store (store |v_#length_5| |v_ULTIMATE.start_main_#t~malloc11.base_4| v_ULTIMATE.start_main_~length1~0_7) |v_ULTIMATE.start_main_#t~malloc12.base_4| v_ULTIMATE.start_main_~length2~0_7)))) InVars {ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_5|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_7, #valid=|v_#valid_10|} OutVars{ULTIMATE.start_main_#t~malloc11.offset=|v_ULTIMATE.start_main_#t~malloc11.offset_4|, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_7, ULTIMATE.start_main_#t~malloc12.base=|v_ULTIMATE.start_main_#t~malloc12.base_4|, ULTIMATE.start_main_#t~malloc11.base=|v_ULTIMATE.start_main_#t~malloc11.base_4|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_2, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_2, ULTIMATE.start_main_#t~malloc12.offset=|v_ULTIMATE.start_main_#t~malloc12.offset_4|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_2, #valid=|v_#valid_8|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_2, #length=|v_#length_3|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc12.offset, ULTIMATE.start_main_#t~malloc11.offset, ULTIMATE.start_main_~nondetString1~0.base, #valid, ULTIMATE.start_main_#t~malloc12.base, ULTIMATE.start_main_~nondetString1~0.offset, ULTIMATE.start_main_#t~malloc11.base, #length, ULTIMATE.start_main_~nondetString2~0.base, ULTIMATE.start_main_~nondetString2~0.offset] 93#L32 [96] L32-->L32-1: Formula: (let ((.cse0 (+ v_ULTIMATE.start_main_~length1~0_8 v_ULTIMATE.start_main_~nondetString1~0.offset_3))) (and (<= 1 .cse0) (= 1 (select |v_#valid_11| v_ULTIMATE.start_main_~nondetString1~0.base_3)) (= |v_#memory_int_2| (store |v_#memory_int_3| v_ULTIMATE.start_main_~nondetString1~0.base_3 (store (select |v_#memory_int_3| v_ULTIMATE.start_main_~nondetString1~0.base_3) (+ v_ULTIMATE.start_main_~length1~0_8 v_ULTIMATE.start_main_~nondetString1~0.offset_3 (- 1)) 0))) (<= .cse0 (select |v_#length_6| v_ULTIMATE.start_main_~nondetString1~0.base_3)))) InVars {ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_3, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_3|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_3, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_8, #length=|v_#length_6|} OutVars{ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_3, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_3, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_8, #length=|v_#length_6|} AuxVars[] AssignedVars[#memory_int] 103#L32-1 [190] L32-1-->L8-3: Formula: (let ((.cse0 (+ v_ULTIMATE.start_main_~length2~0_11 v_ULTIMATE.start_main_~nondetString2~0.offset_7))) (and (= v_ULTIMATE.start_substring_~ps~0.offset_8 v_ULTIMATE.start_substring_~s.offset_3) (<= 1 .cse0) (= v_ULTIMATE.start_main_~nondetString2~0.base_8 |v_ULTIMATE.start_substring_#in~t.base_2|) (= |v_ULTIMATE.start_substring_#in~s.offset_2| v_ULTIMATE.start_substring_~s.offset_3) (= (select |v_#valid_25| v_ULTIMATE.start_main_~nondetString2~0.base_8) 1) (= |v_ULTIMATE.start_substring_#in~t.base_2| v_ULTIMATE.start_substring_~t.base_4) (= |v_ULTIMATE.start_substring_#in~s.base_2| v_ULTIMATE.start_main_~nondetString1~0.base_8) (= (store |v_#memory_int_11| v_ULTIMATE.start_main_~nondetString2~0.base_8 (store (select |v_#memory_int_11| v_ULTIMATE.start_main_~nondetString2~0.base_8) (+ v_ULTIMATE.start_main_~length2~0_11 v_ULTIMATE.start_main_~nondetString2~0.offset_7 (- 1)) 0)) |v_#memory_int_10|) (= v_ULTIMATE.start_main_~nondetString2~0.offset_7 |v_ULTIMATE.start_substring_#in~t.offset_2|) (= v_ULTIMATE.start_main_~nondetString1~0.offset_7 |v_ULTIMATE.start_substring_#in~s.offset_2|) (= |v_ULTIMATE.start_substring_#in~t.offset_2| v_ULTIMATE.start_substring_~t.offset_4) (= |v_ULTIMATE.start_substring_#in~s.base_2| v_ULTIMATE.start_substring_~s.base_3) (= v_ULTIMATE.start_substring_~s.base_3 v_ULTIMATE.start_substring_~ps~0.base_9) (<= .cse0 (select |v_#length_18| v_ULTIMATE.start_main_~nondetString2~0.base_8)))) InVars {ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_8, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_7, #length=|v_#length_18|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_8, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_7, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_11} OutVars{ULTIMATE.start_substring_#in~t.offset=|v_ULTIMATE.start_substring_#in~t.offset_2|, ULTIMATE.start_substring_~ps~0.offset=v_ULTIMATE.start_substring_~ps~0.offset_8, ULTIMATE.start_substring_#t~post5.offset=|v_ULTIMATE.start_substring_#t~post5.offset_4|, ULTIMATE.start_substring_~ps2~0.base=v_ULTIMATE.start_substring_~ps2~0.base_8, ULTIMATE.start_substring_#t~mem7=|v_ULTIMATE.start_substring_#t~mem7_7|, ULTIMATE.start_substring_~t.offset=v_ULTIMATE.start_substring_~t.offset_4, ULTIMATE.start_substring_#t~mem3=|v_ULTIMATE.start_substring_#t~mem3_6|, ULTIMATE.start_substring_#t~mem2=|v_ULTIMATE.start_substring_#t~mem2_6|, ULTIMATE.start_substring_#t~mem1=|v_ULTIMATE.start_substring_#t~mem1_6|, ULTIMATE.start_substring_#in~s.offset=|v_ULTIMATE.start_substring_#in~s.offset_2|, ULTIMATE.start_substring_#t~mem0=|v_ULTIMATE.start_substring_#t~mem0_7|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_8, ULTIMATE.start_substring_~ps2~0.offset=v_ULTIMATE.start_substring_~ps2~0.offset_7, ULTIMATE.start_substring_~pt~0.base=v_ULTIMATE.start_substring_~pt~0.base_14, ULTIMATE.start_substring_#t~post8.offset=|v_ULTIMATE.start_substring_#t~post8.offset_4|, #length=|v_#length_18|, ULTIMATE.start_substring_~pt~0.offset=v_ULTIMATE.start_substring_~pt~0.offset_11, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_11, ULTIMATE.start_substring_#res=|v_ULTIMATE.start_substring_#res_5|, ULTIMATE.start_substring_#t~post6.offset=|v_ULTIMATE.start_substring_#t~post6.offset_4|, ULTIMATE.start_substring_~t.base=v_ULTIMATE.start_substring_~t.base_4, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_8, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_7, ULTIMATE.start_substring_~s.base=v_ULTIMATE.start_substring_~s.base_3, ULTIMATE.start_substring_#in~t.base=|v_ULTIMATE.start_substring_#in~t.base_2|, ULTIMATE.start_substring_#in~s.base=|v_ULTIMATE.start_substring_#in~s.base_2|, ULTIMATE.start_substring_#t~post6.base=|v_ULTIMATE.start_substring_#t~post6.base_4|, ULTIMATE.start_substring_#t~post8.base=|v_ULTIMATE.start_substring_#t~post8.base_4|, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_10|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_7, ULTIMATE.start_substring_~ps~0.base=v_ULTIMATE.start_substring_~ps~0.base_9, ULTIMATE.start_substring_#t~post5.base=|v_ULTIMATE.start_substring_#t~post5.base_4|, ULTIMATE.start_substring_~s.offset=v_ULTIMATE.start_substring_~s.offset_3, ULTIMATE.start_substring_#t~short4=|v_ULTIMATE.start_substring_#t~short4_10|} AuxVars[] AssignedVars[ULTIMATE.start_substring_#in~t.offset, ULTIMATE.start_substring_~ps~0.offset, ULTIMATE.start_substring_#t~post5.offset, ULTIMATE.start_substring_~ps2~0.base, ULTIMATE.start_substring_#t~mem7, ULTIMATE.start_substring_~t.offset, ULTIMATE.start_substring_#t~mem3, ULTIMATE.start_substring_#t~mem2, ULTIMATE.start_substring_#t~mem1, ULTIMATE.start_substring_#in~s.offset, ULTIMATE.start_substring_#t~mem0, ULTIMATE.start_substring_~ps2~0.offset, ULTIMATE.start_substring_~pt~0.base, ULTIMATE.start_substring_#t~post8.offset, ULTIMATE.start_substring_~pt~0.offset, ULTIMATE.start_substring_#res, ULTIMATE.start_substring_#t~post6.offset, ULTIMATE.start_substring_~t.base, ULTIMATE.start_substring_~s.base, ULTIMATE.start_substring_#in~t.base, ULTIMATE.start_substring_#in~s.base, ULTIMATE.start_substring_#t~post6.base, ULTIMATE.start_substring_#t~post8.base, #memory_int, ULTIMATE.start_substring_~ps~0.base, ULTIMATE.start_substring_#t~post5.base, ULTIMATE.start_substring_~s.offset, ULTIMATE.start_substring_#t~short4] 91#L8-3 172.54/109.72 [2019-03-28 12:36:35,205 INFO L796 eck$LassoCheckResult]: Loop: 91#L8-3 [113] L8-3-->L8-1: Formula: (and (= (select (select |v_#memory_int_6| v_ULTIMATE.start_substring_~ps~0.base_5) v_ULTIMATE.start_substring_~ps~0.offset_5) |v_ULTIMATE.start_substring_#t~mem0_2|) (= (select |v_#valid_15| v_ULTIMATE.start_substring_~ps~0.base_5) 1) (<= 0 v_ULTIMATE.start_substring_~ps~0.offset_5) (<= (+ v_ULTIMATE.start_substring_~ps~0.offset_5 1) (select |v_#length_10| v_ULTIMATE.start_substring_~ps~0.base_5))) InVars {ULTIMATE.start_substring_~ps~0.offset=v_ULTIMATE.start_substring_~ps~0.offset_5, #memory_int=|v_#memory_int_6|, #length=|v_#length_10|, ULTIMATE.start_substring_~ps~0.base=v_ULTIMATE.start_substring_~ps~0.base_5, #valid=|v_#valid_15|} OutVars{ULTIMATE.start_substring_#t~mem0=|v_ULTIMATE.start_substring_#t~mem0_2|, #valid=|v_#valid_15|, ULTIMATE.start_substring_~ps~0.offset=v_ULTIMATE.start_substring_~ps~0.offset_5, #memory_int=|v_#memory_int_6|, #length=|v_#length_10|, ULTIMATE.start_substring_~ps~0.base=v_ULTIMATE.start_substring_~ps~0.base_5} AuxVars[] AssignedVars[ULTIMATE.start_substring_#t~mem0] 94#L8-1 [163] L8-1-->L11-9: Formula: (and (= v_ULTIMATE.start_substring_~ps2~0.base_2 v_ULTIMATE.start_substring_~ps~0.base_8) (= v_ULTIMATE.start_substring_~pt~0.offset_4 v_ULTIMATE.start_substring_~t.offset_3) (< 0 |v_ULTIMATE.start_substring_#t~mem0_6|) (= v_ULTIMATE.start_substring_~pt~0.base_5 v_ULTIMATE.start_substring_~t.base_3) (= v_ULTIMATE.start_substring_~ps2~0.offset_2 v_ULTIMATE.start_substring_~ps~0.offset_7)) InVars {ULTIMATE.start_substring_~ps~0.offset=v_ULTIMATE.start_substring_~ps~0.offset_7, ULTIMATE.start_substring_~t.offset=v_ULTIMATE.start_substring_~t.offset_3, ULTIMATE.start_substring_~ps~0.base=v_ULTIMATE.start_substring_~ps~0.base_8, ULTIMATE.start_substring_~t.base=v_ULTIMATE.start_substring_~t.base_3, ULTIMATE.start_substring_#t~mem0=|v_ULTIMATE.start_substring_#t~mem0_6|} OutVars{ULTIMATE.start_substring_~t.offset=v_ULTIMATE.start_substring_~t.offset_3, ULTIMATE.start_substring_#t~mem0=|v_ULTIMATE.start_substring_#t~mem0_5|, ULTIMATE.start_substring_~ps2~0.offset=v_ULTIMATE.start_substring_~ps2~0.offset_2, ULTIMATE.start_substring_~pt~0.base=v_ULTIMATE.start_substring_~pt~0.base_5, ULTIMATE.start_substring_~ps~0.offset=v_ULTIMATE.start_substring_~ps~0.offset_7, ULTIMATE.start_substring_~ps2~0.base=v_ULTIMATE.start_substring_~ps2~0.base_2, ULTIMATE.start_substring_~ps~0.base=v_ULTIMATE.start_substring_~ps~0.base_8, ULTIMATE.start_substring_~t.base=v_ULTIMATE.start_substring_~t.base_3, ULTIMATE.start_substring_~pt~0.offset=v_ULTIMATE.start_substring_~pt~0.offset_4} AuxVars[] AssignedVars[ULTIMATE.start_substring_#t~mem0, ULTIMATE.start_substring_~ps2~0.offset, ULTIMATE.start_substring_~pt~0.base, ULTIMATE.start_substring_~ps2~0.base, ULTIMATE.start_substring_~pt~0.offset] 99#L11-9 [103] L11-9-->L11-1: Formula: (and (<= 0 v_ULTIMATE.start_substring_~pt~0.offset_5) (<= (+ v_ULTIMATE.start_substring_~pt~0.offset_5 1) (select |v_#length_12| v_ULTIMATE.start_substring_~pt~0.base_6)) (= |v_ULTIMATE.start_substring_#t~mem1_2| (select (select |v_#memory_int_7| v_ULTIMATE.start_substring_~pt~0.base_6) v_ULTIMATE.start_substring_~pt~0.offset_5)) (= (select |v_#valid_17| v_ULTIMATE.start_substring_~pt~0.base_6) 1)) InVars {#memory_int=|v_#memory_int_7|, #length=|v_#length_12|, ULTIMATE.start_substring_~pt~0.offset=v_ULTIMATE.start_substring_~pt~0.offset_5, ULTIMATE.start_substring_~pt~0.base=v_ULTIMATE.start_substring_~pt~0.base_6, #valid=|v_#valid_17|} OutVars{ULTIMATE.start_substring_#t~mem1=|v_ULTIMATE.start_substring_#t~mem1_2|, ULTIMATE.start_substring_~pt~0.base=v_ULTIMATE.start_substring_~pt~0.base_6, #valid=|v_#valid_17|, #memory_int=|v_#memory_int_7|, #length=|v_#length_12|, ULTIMATE.start_substring_~pt~0.offset=v_ULTIMATE.start_substring_~pt~0.offset_5} AuxVars[] AssignedVars[ULTIMATE.start_substring_#t~mem1] 104#L11-1 [174] L11-1-->L11-2: Formula: (and (> 0 |v_ULTIMATE.start_substring_#t~mem1_3|) |v_ULTIMATE.start_substring_#t~short4_2|) InVars {ULTIMATE.start_substring_#t~mem1=|v_ULTIMATE.start_substring_#t~mem1_3|} OutVars{ULTIMATE.start_substring_#t~mem1=|v_ULTIMATE.start_substring_#t~mem1_3|, ULTIMATE.start_substring_#t~short4=|v_ULTIMATE.start_substring_#t~short4_2|} AuxVars[] AssignedVars[ULTIMATE.start_substring_#t~short4] 105#L11-2 [91] L11-2-->L11-7: Formula: (not |v_ULTIMATE.start_substring_#t~short4_5|) InVars {ULTIMATE.start_substring_#t~short4=|v_ULTIMATE.start_substring_#t~short4_5|} OutVars{ULTIMATE.start_substring_#t~short4=|v_ULTIMATE.start_substring_#t~short4_5|} AuxVars[] AssignedVars[] 110#L11-7 [108] L11-7-->L11-10: Formula: (not |v_ULTIMATE.start_substring_#t~short4_7|) InVars {ULTIMATE.start_substring_#t~short4=|v_ULTIMATE.start_substring_#t~short4_7|} OutVars{ULTIMATE.start_substring_#t~mem3=|v_ULTIMATE.start_substring_#t~mem3_4|, ULTIMATE.start_substring_#t~mem2=|v_ULTIMATE.start_substring_#t~mem2_4|, ULTIMATE.start_substring_#t~mem1=|v_ULTIMATE.start_substring_#t~mem1_4|, ULTIMATE.start_substring_#t~short4=|v_ULTIMATE.start_substring_#t~short4_6|} AuxVars[] AssignedVars[ULTIMATE.start_substring_#t~mem3, ULTIMATE.start_substring_#t~mem2, ULTIMATE.start_substring_#t~mem1, ULTIMATE.start_substring_#t~short4] 109#L11-10 [99] L11-10-->L15: Formula: (and (= (select |v_#valid_3| v_ULTIMATE.start_substring_~pt~0.base_1) 1) (<= (+ v_ULTIMATE.start_substring_~pt~0.offset_1 1) (select |v_#length_1| v_ULTIMATE.start_substring_~pt~0.base_1)) (= (select (select |v_#memory_int_1| v_ULTIMATE.start_substring_~pt~0.base_1) v_ULTIMATE.start_substring_~pt~0.offset_1) |v_ULTIMATE.start_substring_#t~mem7_1|) (<= 0 v_ULTIMATE.start_substring_~pt~0.offset_1)) InVars {#memory_int=|v_#memory_int_1|, #length=|v_#length_1|, ULTIMATE.start_substring_~pt~0.offset=v_ULTIMATE.start_substring_~pt~0.offset_1, ULTIMATE.start_substring_~pt~0.base=v_ULTIMATE.start_substring_~pt~0.base_1, #valid=|v_#valid_3|} OutVars{ULTIMATE.start_substring_~pt~0.base=v_ULTIMATE.start_substring_~pt~0.base_1, #valid=|v_#valid_3|, #memory_int=|v_#memory_int_1|, #length=|v_#length_1|, ULTIMATE.start_substring_~pt~0.offset=v_ULTIMATE.start_substring_~pt~0.offset_1, ULTIMATE.start_substring_#t~mem7=|v_ULTIMATE.start_substring_#t~mem7_1|} AuxVars[] AssignedVars[ULTIMATE.start_substring_#t~mem7] 90#L15 [176] L15-->L8-3: Formula: (and (= (+ v_ULTIMATE.start_substring_~ps~0.offset_2 1) v_ULTIMATE.start_substring_~ps~0.offset_1) (> 0 |v_ULTIMATE.start_substring_#t~mem7_5|) (= v_ULTIMATE.start_substring_~ps~0.base_2 v_ULTIMATE.start_substring_~ps~0.base_1)) InVars {ULTIMATE.start_substring_~ps~0.offset=v_ULTIMATE.start_substring_~ps~0.offset_2, ULTIMATE.start_substring_~ps~0.base=v_ULTIMATE.start_substring_~ps~0.base_2, ULTIMATE.start_substring_#t~mem7=|v_ULTIMATE.start_substring_#t~mem7_5|} OutVars{ULTIMATE.start_substring_~ps~0.offset=v_ULTIMATE.start_substring_~ps~0.offset_1, ULTIMATE.start_substring_#t~post8.base=|v_ULTIMATE.start_substring_#t~post8.base_1|, ULTIMATE.start_substring_#t~post8.offset=|v_ULTIMATE.start_substring_#t~post8.offset_1|, ULTIMATE.start_substring_~ps~0.base=v_ULTIMATE.start_substring_~ps~0.base_1, ULTIMATE.start_substring_#t~mem7=|v_ULTIMATE.start_substring_#t~mem7_4|} AuxVars[] AssignedVars[ULTIMATE.start_substring_#t~post8.base, ULTIMATE.start_substring_~ps~0.offset, ULTIMATE.start_substring_#t~post8.offset, ULTIMATE.start_substring_~ps~0.base, ULTIMATE.start_substring_#t~mem7] 91#L8-3 172.54/109.72 [2019-03-28 12:36:35,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 172.54/109.72 [2019-03-28 12:36:35,205 INFO L82 PathProgramCache]: Analyzing trace with hash 2123740343, now seen corresponding path program 2 times 172.54/109.72 [2019-03-28 12:36:35,205 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 172.54/109.72 [2019-03-28 12:36:35,206 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 172.54/109.72 [2019-03-28 12:36:35,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 172.54/109.72 [2019-03-28 12:36:35,206 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 172.54/109.72 [2019-03-28 12:36:35,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 172.54/109.72 [2019-03-28 12:36:35,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 172.54/109.72 [2019-03-28 12:36:35,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 172.54/109.72 [2019-03-28 12:36:35,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 172.54/109.72 [2019-03-28 12:36:35,216 INFO L82 PathProgramCache]: Analyzing trace with hash -691857064, now seen corresponding path program 1 times 172.54/109.72 [2019-03-28 12:36:35,216 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 172.54/109.72 [2019-03-28 12:36:35,216 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 172.54/109.72 [2019-03-28 12:36:35,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 172.54/109.72 [2019-03-28 12:36:35,217 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 172.54/109.72 [2019-03-28 12:36:35,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 172.54/109.72 [2019-03-28 12:36:35,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 172.54/109.72 [2019-03-28 12:36:35,223 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 172.54/109.72 [2019-03-28 12:36:35,223 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 172.54/109.72 [2019-03-28 12:36:35,223 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 172.54/109.72 [2019-03-28 12:36:35,224 INFO L811 eck$LassoCheckResult]: loop already infeasible 172.54/109.72 [2019-03-28 12:36:35,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 172.54/109.72 [2019-03-28 12:36:35,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 172.54/109.72 [2019-03-28 12:36:35,224 INFO L87 Difference]: Start difference. First operand 22 states and 38 transitions. cyclomatic complexity: 17 Second operand 3 states. 172.54/109.72 [2019-03-28 12:36:35,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 172.54/109.72 [2019-03-28 12:36:35,265 INFO L93 Difference]: Finished difference Result 24 states and 39 transitions. 172.54/109.72 [2019-03-28 12:36:35,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 172.54/109.72 [2019-03-28 12:36:35,266 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 39 transitions. 172.54/109.72 [2019-03-28 12:36:35,266 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 18 172.54/109.72 [2019-03-28 12:36:35,267 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 24 states and 39 transitions. 172.54/109.72 [2019-03-28 12:36:35,267 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 172.54/109.72 [2019-03-28 12:36:35,267 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 172.54/109.72 [2019-03-28 12:36:35,267 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 39 transitions. 172.54/109.72 [2019-03-28 12:36:35,268 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 172.54/109.72 [2019-03-28 12:36:35,268 INFO L706 BuchiCegarLoop]: Abstraction has 24 states and 39 transitions. 172.54/109.72 [2019-03-28 12:36:35,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 39 transitions. 172.54/109.72 [2019-03-28 12:36:35,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 22. 172.54/109.72 [2019-03-28 12:36:35,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. 172.54/109.72 [2019-03-28 12:36:35,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 37 transitions. 172.54/109.72 [2019-03-28 12:36:35,269 INFO L729 BuchiCegarLoop]: Abstraction has 22 states and 37 transitions. 172.54/109.72 [2019-03-28 12:36:35,269 INFO L609 BuchiCegarLoop]: Abstraction has 22 states and 37 transitions. 172.54/109.72 [2019-03-28 12:36:35,270 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ 172.54/109.72 [2019-03-28 12:36:35,270 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 37 transitions. 172.54/109.72 [2019-03-28 12:36:35,270 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 172.54/109.72 [2019-03-28 12:36:35,270 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 172.54/109.72 [2019-03-28 12:36:35,270 INFO L119 BuchiIsEmpty]: Starting construction of run 172.54/109.72 [2019-03-28 12:36:35,271 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] 172.54/109.72 [2019-03-28 12:36:35,271 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 172.54/109.72 [2019-03-28 12:36:35,272 INFO L794 eck$LassoCheckResult]: Stem: 157#ULTIMATE.startENTRY [189] ULTIMATE.startENTRY-->L24: Formula: (and (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|) (= |v_#valid_23| (store |v_#valid_24| 0 0))) InVars {#valid=|v_#valid_24|} OutVars{ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_6|, ULTIMATE.start_main_#t~malloc11.offset=|v_ULTIMATE.start_main_#t~malloc11.offset_5|, ULTIMATE.start_main_#t~nondet9=|v_ULTIMATE.start_main_#t~nondet9_6|, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_10, ULTIMATE.start_main_#t~malloc12.base=|v_ULTIMATE.start_main_#t~malloc12.base_5|, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~malloc11.base=|v_ULTIMATE.start_main_#t~malloc11.base_5|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_7, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_6, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~malloc12.offset=|v_ULTIMATE.start_main_#t~malloc12.offset_5|, ULTIMATE.start_main_#t~ret13=|v_ULTIMATE.start_main_#t~ret13_4|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, #valid=|v_#valid_23|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_6, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10, ULTIMATE.start_main_#t~malloc11.offset, ULTIMATE.start_main_#t~nondet9, ULTIMATE.start_main_~length1~0, ULTIMATE.start_main_#t~malloc12.base, #NULL.offset, ULTIMATE.start_main_#t~malloc11.base, ULTIMATE.start_main_~nondetString2~0.base, ULTIMATE.start_main_~nondetString2~0.offset, #NULL.base, ULTIMATE.start_main_#t~malloc12.offset, ULTIMATE.start_main_#t~ret13, ULTIMATE.start_main_~nondetString1~0.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_~nondetString1~0.offset, ULTIMATE.start_main_~length2~0] 158#L24 [126] L24-->L24-2: Formula: (>= v_ULTIMATE.start_main_~length1~0_6 1) InVars {ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_6} OutVars{ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_6} AuxVars[] AssignedVars[] 159#L24-2 [127] L24-2-->L27-1: Formula: (>= v_ULTIMATE.start_main_~length2~0_6 1) InVars {ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_6} OutVars{ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_6} AuxVars[] AssignedVars[] 144#L27-1 [150] L27-1-->L32: Formula: (let ((.cse0 (store |v_#valid_10| |v_ULTIMATE.start_main_#t~malloc11.base_4| 1))) (and (= v_ULTIMATE.start_main_~nondetString1~0.offset_2 |v_ULTIMATE.start_main_#t~malloc11.offset_4|) (= v_ULTIMATE.start_main_~nondetString2~0.offset_2 |v_ULTIMATE.start_main_#t~malloc12.offset_4|) (= |v_ULTIMATE.start_main_#t~malloc11.offset_4| 0) (= 0 (select |v_#valid_10| |v_ULTIMATE.start_main_#t~malloc11.base_4|)) (> 0 |v_ULTIMATE.start_main_#t~malloc12.base_4|) (= |v_ULTIMATE.start_main_#t~malloc12.offset_4| 0) (= (store .cse0 |v_ULTIMATE.start_main_#t~malloc12.base_4| 1) |v_#valid_8|) (< |v_ULTIMATE.start_main_#t~malloc11.base_4| 0) (= v_ULTIMATE.start_main_~nondetString2~0.base_2 |v_ULTIMATE.start_main_#t~malloc12.base_4|) (= 0 (select .cse0 |v_ULTIMATE.start_main_#t~malloc12.base_4|)) (< |v_ULTIMATE.start_main_#t~malloc12.base_4| |v_#StackHeapBarrier_1|) (< |v_ULTIMATE.start_main_#t~malloc11.base_4| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_main_~nondetString1~0.base_2 |v_ULTIMATE.start_main_#t~malloc11.base_4|) (= |v_#length_3| (store (store |v_#length_5| |v_ULTIMATE.start_main_#t~malloc11.base_4| v_ULTIMATE.start_main_~length1~0_7) |v_ULTIMATE.start_main_#t~malloc12.base_4| v_ULTIMATE.start_main_~length2~0_7)))) InVars {ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_5|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_7, #valid=|v_#valid_10|} OutVars{ULTIMATE.start_main_#t~malloc11.offset=|v_ULTIMATE.start_main_#t~malloc11.offset_4|, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_7, ULTIMATE.start_main_#t~malloc12.base=|v_ULTIMATE.start_main_#t~malloc12.base_4|, ULTIMATE.start_main_#t~malloc11.base=|v_ULTIMATE.start_main_#t~malloc11.base_4|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_2, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_2, ULTIMATE.start_main_#t~malloc12.offset=|v_ULTIMATE.start_main_#t~malloc12.offset_4|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_2, #valid=|v_#valid_8|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_2, #length=|v_#length_3|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc12.offset, ULTIMATE.start_main_#t~malloc11.offset, ULTIMATE.start_main_~nondetString1~0.base, #valid, ULTIMATE.start_main_#t~malloc12.base, ULTIMATE.start_main_~nondetString1~0.offset, ULTIMATE.start_main_#t~malloc11.base, #length, ULTIMATE.start_main_~nondetString2~0.base, ULTIMATE.start_main_~nondetString2~0.offset] 145#L32 [96] L32-->L32-1: Formula: (let ((.cse0 (+ v_ULTIMATE.start_main_~length1~0_8 v_ULTIMATE.start_main_~nondetString1~0.offset_3))) (and (<= 1 .cse0) (= 1 (select |v_#valid_11| v_ULTIMATE.start_main_~nondetString1~0.base_3)) (= |v_#memory_int_2| (store |v_#memory_int_3| v_ULTIMATE.start_main_~nondetString1~0.base_3 (store (select |v_#memory_int_3| v_ULTIMATE.start_main_~nondetString1~0.base_3) (+ v_ULTIMATE.start_main_~length1~0_8 v_ULTIMATE.start_main_~nondetString1~0.offset_3 (- 1)) 0))) (<= .cse0 (select |v_#length_6| v_ULTIMATE.start_main_~nondetString1~0.base_3)))) InVars {ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_3, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_3|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_3, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_8, #length=|v_#length_6|} OutVars{ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_3, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_3, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_8, #length=|v_#length_6|} AuxVars[] AssignedVars[#memory_int] 154#L32-1 [190] L32-1-->L8-3: Formula: (let ((.cse0 (+ v_ULTIMATE.start_main_~length2~0_11 v_ULTIMATE.start_main_~nondetString2~0.offset_7))) (and (= v_ULTIMATE.start_substring_~ps~0.offset_8 v_ULTIMATE.start_substring_~s.offset_3) (<= 1 .cse0) (= v_ULTIMATE.start_main_~nondetString2~0.base_8 |v_ULTIMATE.start_substring_#in~t.base_2|) (= |v_ULTIMATE.start_substring_#in~s.offset_2| v_ULTIMATE.start_substring_~s.offset_3) (= (select |v_#valid_25| v_ULTIMATE.start_main_~nondetString2~0.base_8) 1) (= |v_ULTIMATE.start_substring_#in~t.base_2| v_ULTIMATE.start_substring_~t.base_4) (= |v_ULTIMATE.start_substring_#in~s.base_2| v_ULTIMATE.start_main_~nondetString1~0.base_8) (= (store |v_#memory_int_11| v_ULTIMATE.start_main_~nondetString2~0.base_8 (store (select |v_#memory_int_11| v_ULTIMATE.start_main_~nondetString2~0.base_8) (+ v_ULTIMATE.start_main_~length2~0_11 v_ULTIMATE.start_main_~nondetString2~0.offset_7 (- 1)) 0)) |v_#memory_int_10|) (= v_ULTIMATE.start_main_~nondetString2~0.offset_7 |v_ULTIMATE.start_substring_#in~t.offset_2|) (= v_ULTIMATE.start_main_~nondetString1~0.offset_7 |v_ULTIMATE.start_substring_#in~s.offset_2|) (= |v_ULTIMATE.start_substring_#in~t.offset_2| v_ULTIMATE.start_substring_~t.offset_4) (= |v_ULTIMATE.start_substring_#in~s.base_2| v_ULTIMATE.start_substring_~s.base_3) (= v_ULTIMATE.start_substring_~s.base_3 v_ULTIMATE.start_substring_~ps~0.base_9) (<= .cse0 (select |v_#length_18| v_ULTIMATE.start_main_~nondetString2~0.base_8)))) InVars {ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_8, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_7, #length=|v_#length_18|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_8, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_7, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_11} OutVars{ULTIMATE.start_substring_#in~t.offset=|v_ULTIMATE.start_substring_#in~t.offset_2|, ULTIMATE.start_substring_~ps~0.offset=v_ULTIMATE.start_substring_~ps~0.offset_8, ULTIMATE.start_substring_#t~post5.offset=|v_ULTIMATE.start_substring_#t~post5.offset_4|, ULTIMATE.start_substring_~ps2~0.base=v_ULTIMATE.start_substring_~ps2~0.base_8, ULTIMATE.start_substring_#t~mem7=|v_ULTIMATE.start_substring_#t~mem7_7|, ULTIMATE.start_substring_~t.offset=v_ULTIMATE.start_substring_~t.offset_4, ULTIMATE.start_substring_#t~mem3=|v_ULTIMATE.start_substring_#t~mem3_6|, ULTIMATE.start_substring_#t~mem2=|v_ULTIMATE.start_substring_#t~mem2_6|, ULTIMATE.start_substring_#t~mem1=|v_ULTIMATE.start_substring_#t~mem1_6|, ULTIMATE.start_substring_#in~s.offset=|v_ULTIMATE.start_substring_#in~s.offset_2|, ULTIMATE.start_substring_#t~mem0=|v_ULTIMATE.start_substring_#t~mem0_7|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_8, ULTIMATE.start_substring_~ps2~0.offset=v_ULTIMATE.start_substring_~ps2~0.offset_7, ULTIMATE.start_substring_~pt~0.base=v_ULTIMATE.start_substring_~pt~0.base_14, ULTIMATE.start_substring_#t~post8.offset=|v_ULTIMATE.start_substring_#t~post8.offset_4|, #length=|v_#length_18|, ULTIMATE.start_substring_~pt~0.offset=v_ULTIMATE.start_substring_~pt~0.offset_11, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_11, ULTIMATE.start_substring_#res=|v_ULTIMATE.start_substring_#res_5|, ULTIMATE.start_substring_#t~post6.offset=|v_ULTIMATE.start_substring_#t~post6.offset_4|, ULTIMATE.start_substring_~t.base=v_ULTIMATE.start_substring_~t.base_4, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_8, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_7, ULTIMATE.start_substring_~s.base=v_ULTIMATE.start_substring_~s.base_3, ULTIMATE.start_substring_#in~t.base=|v_ULTIMATE.start_substring_#in~t.base_2|, ULTIMATE.start_substring_#in~s.base=|v_ULTIMATE.start_substring_#in~s.base_2|, ULTIMATE.start_substring_#t~post6.base=|v_ULTIMATE.start_substring_#t~post6.base_4|, ULTIMATE.start_substring_#t~post8.base=|v_ULTIMATE.start_substring_#t~post8.base_4|, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_10|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_7, ULTIMATE.start_substring_~ps~0.base=v_ULTIMATE.start_substring_~ps~0.base_9, ULTIMATE.start_substring_#t~post5.base=|v_ULTIMATE.start_substring_#t~post5.base_4|, ULTIMATE.start_substring_~s.offset=v_ULTIMATE.start_substring_~s.offset_3, ULTIMATE.start_substring_#t~short4=|v_ULTIMATE.start_substring_#t~short4_10|} AuxVars[] AssignedVars[ULTIMATE.start_substring_#in~t.offset, ULTIMATE.start_substring_~ps~0.offset, ULTIMATE.start_substring_#t~post5.offset, ULTIMATE.start_substring_~ps2~0.base, ULTIMATE.start_substring_#t~mem7, ULTIMATE.start_substring_~t.offset, ULTIMATE.start_substring_#t~mem3, ULTIMATE.start_substring_#t~mem2, ULTIMATE.start_substring_#t~mem1, ULTIMATE.start_substring_#in~s.offset, ULTIMATE.start_substring_#t~mem0, ULTIMATE.start_substring_~ps2~0.offset, ULTIMATE.start_substring_~pt~0.base, ULTIMATE.start_substring_#t~post8.offset, ULTIMATE.start_substring_~pt~0.offset, ULTIMATE.start_substring_#res, ULTIMATE.start_substring_#t~post6.offset, ULTIMATE.start_substring_~t.base, ULTIMATE.start_substring_~s.base, ULTIMATE.start_substring_#in~t.base, ULTIMATE.start_substring_#in~s.base, ULTIMATE.start_substring_#t~post6.base, ULTIMATE.start_substring_#t~post8.base, #memory_int, ULTIMATE.start_substring_~ps~0.base, ULTIMATE.start_substring_#t~post5.base, ULTIMATE.start_substring_~s.offset, ULTIMATE.start_substring_#t~short4] 143#L8-3 172.54/109.72 [2019-03-28 12:36:35,272 INFO L796 eck$LassoCheckResult]: Loop: 143#L8-3 [113] L8-3-->L8-1: Formula: (and (= (select (select |v_#memory_int_6| v_ULTIMATE.start_substring_~ps~0.base_5) v_ULTIMATE.start_substring_~ps~0.offset_5) |v_ULTIMATE.start_substring_#t~mem0_2|) (= (select |v_#valid_15| v_ULTIMATE.start_substring_~ps~0.base_5) 1) (<= 0 v_ULTIMATE.start_substring_~ps~0.offset_5) (<= (+ v_ULTIMATE.start_substring_~ps~0.offset_5 1) (select |v_#length_10| v_ULTIMATE.start_substring_~ps~0.base_5))) InVars {ULTIMATE.start_substring_~ps~0.offset=v_ULTIMATE.start_substring_~ps~0.offset_5, #memory_int=|v_#memory_int_6|, #length=|v_#length_10|, ULTIMATE.start_substring_~ps~0.base=v_ULTIMATE.start_substring_~ps~0.base_5, #valid=|v_#valid_15|} OutVars{ULTIMATE.start_substring_#t~mem0=|v_ULTIMATE.start_substring_#t~mem0_2|, #valid=|v_#valid_15|, ULTIMATE.start_substring_~ps~0.offset=v_ULTIMATE.start_substring_~ps~0.offset_5, #memory_int=|v_#memory_int_6|, #length=|v_#length_10|, ULTIMATE.start_substring_~ps~0.base=v_ULTIMATE.start_substring_~ps~0.base_5} AuxVars[] AssignedVars[ULTIMATE.start_substring_#t~mem0] 146#L8-1 [163] L8-1-->L11-9: Formula: (and (= v_ULTIMATE.start_substring_~ps2~0.base_2 v_ULTIMATE.start_substring_~ps~0.base_8) (= v_ULTIMATE.start_substring_~pt~0.offset_4 v_ULTIMATE.start_substring_~t.offset_3) (< 0 |v_ULTIMATE.start_substring_#t~mem0_6|) (= v_ULTIMATE.start_substring_~pt~0.base_5 v_ULTIMATE.start_substring_~t.base_3) (= v_ULTIMATE.start_substring_~ps2~0.offset_2 v_ULTIMATE.start_substring_~ps~0.offset_7)) InVars {ULTIMATE.start_substring_~ps~0.offset=v_ULTIMATE.start_substring_~ps~0.offset_7, ULTIMATE.start_substring_~t.offset=v_ULTIMATE.start_substring_~t.offset_3, ULTIMATE.start_substring_~ps~0.base=v_ULTIMATE.start_substring_~ps~0.base_8, ULTIMATE.start_substring_~t.base=v_ULTIMATE.start_substring_~t.base_3, ULTIMATE.start_substring_#t~mem0=|v_ULTIMATE.start_substring_#t~mem0_6|} OutVars{ULTIMATE.start_substring_~t.offset=v_ULTIMATE.start_substring_~t.offset_3, ULTIMATE.start_substring_#t~mem0=|v_ULTIMATE.start_substring_#t~mem0_5|, ULTIMATE.start_substring_~ps2~0.offset=v_ULTIMATE.start_substring_~ps2~0.offset_2, ULTIMATE.start_substring_~pt~0.base=v_ULTIMATE.start_substring_~pt~0.base_5, ULTIMATE.start_substring_~ps~0.offset=v_ULTIMATE.start_substring_~ps~0.offset_7, ULTIMATE.start_substring_~ps2~0.base=v_ULTIMATE.start_substring_~ps2~0.base_2, ULTIMATE.start_substring_~ps~0.base=v_ULTIMATE.start_substring_~ps~0.base_8, ULTIMATE.start_substring_~t.base=v_ULTIMATE.start_substring_~t.base_3, ULTIMATE.start_substring_~pt~0.offset=v_ULTIMATE.start_substring_~pt~0.offset_4} AuxVars[] AssignedVars[ULTIMATE.start_substring_#t~mem0, ULTIMATE.start_substring_~ps2~0.offset, ULTIMATE.start_substring_~pt~0.base, ULTIMATE.start_substring_~ps2~0.base, ULTIMATE.start_substring_~pt~0.offset] 151#L11-9 [103] L11-9-->L11-1: Formula: (and (<= 0 v_ULTIMATE.start_substring_~pt~0.offset_5) (<= (+ v_ULTIMATE.start_substring_~pt~0.offset_5 1) (select |v_#length_12| v_ULTIMATE.start_substring_~pt~0.base_6)) (= |v_ULTIMATE.start_substring_#t~mem1_2| (select (select |v_#memory_int_7| v_ULTIMATE.start_substring_~pt~0.base_6) v_ULTIMATE.start_substring_~pt~0.offset_5)) (= (select |v_#valid_17| v_ULTIMATE.start_substring_~pt~0.base_6) 1)) InVars {#memory_int=|v_#memory_int_7|, #length=|v_#length_12|, ULTIMATE.start_substring_~pt~0.offset=v_ULTIMATE.start_substring_~pt~0.offset_5, ULTIMATE.start_substring_~pt~0.base=v_ULTIMATE.start_substring_~pt~0.base_6, #valid=|v_#valid_17|} OutVars{ULTIMATE.start_substring_#t~mem1=|v_ULTIMATE.start_substring_#t~mem1_2|, ULTIMATE.start_substring_~pt~0.base=v_ULTIMATE.start_substring_~pt~0.base_6, #valid=|v_#valid_17|, #memory_int=|v_#memory_int_7|, #length=|v_#length_12|, ULTIMATE.start_substring_~pt~0.offset=v_ULTIMATE.start_substring_~pt~0.offset_5} AuxVars[] AssignedVars[ULTIMATE.start_substring_#t~mem1] 155#L11-1 [174] L11-1-->L11-2: Formula: (and (> 0 |v_ULTIMATE.start_substring_#t~mem1_3|) |v_ULTIMATE.start_substring_#t~short4_2|) InVars {ULTIMATE.start_substring_#t~mem1=|v_ULTIMATE.start_substring_#t~mem1_3|} OutVars{ULTIMATE.start_substring_#t~mem1=|v_ULTIMATE.start_substring_#t~mem1_3|, ULTIMATE.start_substring_#t~short4=|v_ULTIMATE.start_substring_#t~short4_2|} AuxVars[] AssignedVars[ULTIMATE.start_substring_#t~short4] 153#L11-2 [90] L11-2-->L11-3: Formula: |v_ULTIMATE.start_substring_#t~short4_3| InVars {ULTIMATE.start_substring_#t~short4=|v_ULTIMATE.start_substring_#t~short4_3|} OutVars{ULTIMATE.start_substring_#t~short4=|v_ULTIMATE.start_substring_#t~short4_3|} AuxVars[] AssignedVars[] 152#L11-3 [87] L11-3-->L11-4: Formula: (and (<= (+ v_ULTIMATE.start_substring_~pt~0.offset_7 1) (select |v_#length_14| v_ULTIMATE.start_substring_~pt~0.base_9)) (= 1 (select |v_#valid_19| v_ULTIMATE.start_substring_~pt~0.base_9)) (<= 0 v_ULTIMATE.start_substring_~pt~0.offset_7) (= (select (select |v_#memory_int_8| v_ULTIMATE.start_substring_~pt~0.base_9) v_ULTIMATE.start_substring_~pt~0.offset_7) |v_ULTIMATE.start_substring_#t~mem2_2|)) InVars {#memory_int=|v_#memory_int_8|, #length=|v_#length_14|, ULTIMATE.start_substring_~pt~0.offset=v_ULTIMATE.start_substring_~pt~0.offset_7, ULTIMATE.start_substring_~pt~0.base=v_ULTIMATE.start_substring_~pt~0.base_9, #valid=|v_#valid_19|} OutVars{ULTIMATE.start_substring_#t~mem2=|v_ULTIMATE.start_substring_#t~mem2_2|, ULTIMATE.start_substring_~pt~0.base=v_ULTIMATE.start_substring_~pt~0.base_9, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_8|, #length=|v_#length_14|, ULTIMATE.start_substring_~pt~0.offset=v_ULTIMATE.start_substring_~pt~0.offset_7} AuxVars[] AssignedVars[ULTIMATE.start_substring_#t~mem2] 149#L11-4 [83] L11-4-->L11-5: Formula: (and (= (select |v_#valid_21| v_ULTIMATE.start_substring_~ps2~0.base_3) 1) (<= (+ v_ULTIMATE.start_substring_~ps2~0.offset_3 1) (select |v_#length_16| v_ULTIMATE.start_substring_~ps2~0.base_3)) (<= 0 v_ULTIMATE.start_substring_~ps2~0.offset_3) (= (select (select |v_#memory_int_9| v_ULTIMATE.start_substring_~ps2~0.base_3) v_ULTIMATE.start_substring_~ps2~0.offset_3) |v_ULTIMATE.start_substring_#t~mem3_2|)) InVars {#memory_int=|v_#memory_int_9|, #length=|v_#length_16|, ULTIMATE.start_substring_~ps2~0.base=v_ULTIMATE.start_substring_~ps2~0.base_3, ULTIMATE.start_substring_~ps2~0.offset=v_ULTIMATE.start_substring_~ps2~0.offset_3, #valid=|v_#valid_21|} OutVars{ULTIMATE.start_substring_#t~mem3=|v_ULTIMATE.start_substring_#t~mem3_2|, ULTIMATE.start_substring_~ps2~0.offset=v_ULTIMATE.start_substring_~ps2~0.offset_3, #valid=|v_#valid_21|, #memory_int=|v_#memory_int_9|, #length=|v_#length_16|, ULTIMATE.start_substring_~ps2~0.base=v_ULTIMATE.start_substring_~ps2~0.base_3} AuxVars[] AssignedVars[ULTIMATE.start_substring_#t~mem3] 150#L11-5 [187] L11-5-->L11-7: Formula: (and (not |v_ULTIMATE.start_substring_#t~short4_4|) (< |v_ULTIMATE.start_substring_#t~mem3_3| |v_ULTIMATE.start_substring_#t~mem2_3|)) InVars {ULTIMATE.start_substring_#t~mem2=|v_ULTIMATE.start_substring_#t~mem2_3|, ULTIMATE.start_substring_#t~mem3=|v_ULTIMATE.start_substring_#t~mem3_3|} OutVars{ULTIMATE.start_substring_#t~mem3=|v_ULTIMATE.start_substring_#t~mem3_3|, ULTIMATE.start_substring_#t~mem2=|v_ULTIMATE.start_substring_#t~mem2_3|, ULTIMATE.start_substring_#t~short4=|v_ULTIMATE.start_substring_#t~short4_4|} AuxVars[] AssignedVars[ULTIMATE.start_substring_#t~short4] 161#L11-7 [108] L11-7-->L11-10: Formula: (not |v_ULTIMATE.start_substring_#t~short4_7|) InVars {ULTIMATE.start_substring_#t~short4=|v_ULTIMATE.start_substring_#t~short4_7|} OutVars{ULTIMATE.start_substring_#t~mem3=|v_ULTIMATE.start_substring_#t~mem3_4|, ULTIMATE.start_substring_#t~mem2=|v_ULTIMATE.start_substring_#t~mem2_4|, ULTIMATE.start_substring_#t~mem1=|v_ULTIMATE.start_substring_#t~mem1_4|, ULTIMATE.start_substring_#t~short4=|v_ULTIMATE.start_substring_#t~short4_6|} AuxVars[] AssignedVars[ULTIMATE.start_substring_#t~mem3, ULTIMATE.start_substring_#t~mem2, ULTIMATE.start_substring_#t~mem1, ULTIMATE.start_substring_#t~short4] 160#L11-10 [99] L11-10-->L15: Formula: (and (= (select |v_#valid_3| v_ULTIMATE.start_substring_~pt~0.base_1) 1) (<= (+ v_ULTIMATE.start_substring_~pt~0.offset_1 1) (select |v_#length_1| v_ULTIMATE.start_substring_~pt~0.base_1)) (= (select (select |v_#memory_int_1| v_ULTIMATE.start_substring_~pt~0.base_1) v_ULTIMATE.start_substring_~pt~0.offset_1) |v_ULTIMATE.start_substring_#t~mem7_1|) (<= 0 v_ULTIMATE.start_substring_~pt~0.offset_1)) InVars {#memory_int=|v_#memory_int_1|, #length=|v_#length_1|, ULTIMATE.start_substring_~pt~0.offset=v_ULTIMATE.start_substring_~pt~0.offset_1, ULTIMATE.start_substring_~pt~0.base=v_ULTIMATE.start_substring_~pt~0.base_1, #valid=|v_#valid_3|} OutVars{ULTIMATE.start_substring_~pt~0.base=v_ULTIMATE.start_substring_~pt~0.base_1, #valid=|v_#valid_3|, #memory_int=|v_#memory_int_1|, #length=|v_#length_1|, ULTIMATE.start_substring_~pt~0.offset=v_ULTIMATE.start_substring_~pt~0.offset_1, ULTIMATE.start_substring_#t~mem7=|v_ULTIMATE.start_substring_#t~mem7_1|} AuxVars[] AssignedVars[ULTIMATE.start_substring_#t~mem7] 142#L15 [176] L15-->L8-3: Formula: (and (= (+ v_ULTIMATE.start_substring_~ps~0.offset_2 1) v_ULTIMATE.start_substring_~ps~0.offset_1) (> 0 |v_ULTIMATE.start_substring_#t~mem7_5|) (= v_ULTIMATE.start_substring_~ps~0.base_2 v_ULTIMATE.start_substring_~ps~0.base_1)) InVars {ULTIMATE.start_substring_~ps~0.offset=v_ULTIMATE.start_substring_~ps~0.offset_2, ULTIMATE.start_substring_~ps~0.base=v_ULTIMATE.start_substring_~ps~0.base_2, ULTIMATE.start_substring_#t~mem7=|v_ULTIMATE.start_substring_#t~mem7_5|} OutVars{ULTIMATE.start_substring_~ps~0.offset=v_ULTIMATE.start_substring_~ps~0.offset_1, ULTIMATE.start_substring_#t~post8.base=|v_ULTIMATE.start_substring_#t~post8.base_1|, ULTIMATE.start_substring_#t~post8.offset=|v_ULTIMATE.start_substring_#t~post8.offset_1|, ULTIMATE.start_substring_~ps~0.base=v_ULTIMATE.start_substring_~ps~0.base_1, ULTIMATE.start_substring_#t~mem7=|v_ULTIMATE.start_substring_#t~mem7_4|} AuxVars[] AssignedVars[ULTIMATE.start_substring_#t~post8.base, ULTIMATE.start_substring_~ps~0.offset, ULTIMATE.start_substring_#t~post8.offset, ULTIMATE.start_substring_~ps~0.base, ULTIMATE.start_substring_#t~mem7] 143#L8-3 172.54/109.72 [2019-03-28 12:36:35,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 172.54/109.72 [2019-03-28 12:36:35,272 INFO L82 PathProgramCache]: Analyzing trace with hash 2123740343, now seen corresponding path program 3 times 172.54/109.72 [2019-03-28 12:36:35,273 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 172.54/109.72 [2019-03-28 12:36:35,273 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 172.54/109.72 [2019-03-28 12:36:35,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 172.54/109.72 [2019-03-28 12:36:35,274 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 172.54/109.72 [2019-03-28 12:36:35,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 172.54/109.72 [2019-03-28 12:36:35,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 172.54/109.72 [2019-03-28 12:36:35,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 172.54/109.72 [2019-03-28 12:36:35,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 172.54/109.72 [2019-03-28 12:36:35,285 INFO L82 PathProgramCache]: Analyzing trace with hash -1068797574, now seen corresponding path program 1 times 172.54/109.72 [2019-03-28 12:36:35,285 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 172.54/109.72 [2019-03-28 12:36:35,285 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 172.54/109.72 [2019-03-28 12:36:35,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 172.54/109.72 [2019-03-28 12:36:35,286 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 172.54/109.72 [2019-03-28 12:36:35,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 172.54/109.72 [2019-03-28 12:36:35,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 172.54/109.72 [2019-03-28 12:36:35,463 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 172.54/109.72 [2019-03-28 12:36:35,463 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 172.54/109.72 [2019-03-28 12:36:35,463 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 172.54/109.72 [2019-03-28 12:36:35,463 INFO L811 eck$LassoCheckResult]: loop already infeasible 172.54/109.72 [2019-03-28 12:36:35,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. 172.54/109.72 [2019-03-28 12:36:35,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 172.54/109.72 [2019-03-28 12:36:35,464 INFO L87 Difference]: Start difference. First operand 22 states and 37 transitions. cyclomatic complexity: 16 Second operand 8 states. 172.54/109.72 [2019-03-28 12:36:35,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 172.54/109.72 [2019-03-28 12:36:35,714 INFO L93 Difference]: Finished difference Result 43 states and 69 transitions. 172.54/109.72 [2019-03-28 12:36:35,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 172.54/109.72 [2019-03-28 12:36:35,715 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 69 transitions. 172.54/109.72 [2019-03-28 12:36:35,716 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 37 172.54/109.72 [2019-03-28 12:36:35,716 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 43 states and 69 transitions. 172.54/109.72 [2019-03-28 12:36:35,717 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 43 172.54/109.72 [2019-03-28 12:36:35,717 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 43 172.54/109.72 [2019-03-28 12:36:35,717 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43 states and 69 transitions. 172.54/109.72 [2019-03-28 12:36:35,717 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 172.54/109.72 [2019-03-28 12:36:35,717 INFO L706 BuchiCegarLoop]: Abstraction has 43 states and 69 transitions. 172.54/109.72 [2019-03-28 12:36:35,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states and 69 transitions. 172.54/109.72 [2019-03-28 12:36:35,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 28. 172.54/109.72 [2019-03-28 12:36:35,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. 172.54/109.72 [2019-03-28 12:36:35,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 45 transitions. 172.54/109.72 [2019-03-28 12:36:35,719 INFO L729 BuchiCegarLoop]: Abstraction has 28 states and 45 transitions. 172.54/109.72 [2019-03-28 12:36:35,719 INFO L609 BuchiCegarLoop]: Abstraction has 28 states and 45 transitions. 172.54/109.72 [2019-03-28 12:36:35,719 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ 172.54/109.72 [2019-03-28 12:36:35,719 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 45 transitions. 172.54/109.72 [2019-03-28 12:36:35,720 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 22 172.54/109.72 [2019-03-28 12:36:35,720 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 172.54/109.72 [2019-03-28 12:36:35,720 INFO L119 BuchiIsEmpty]: Starting construction of run 172.54/109.72 [2019-03-28 12:36:35,721 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] 172.54/109.72 [2019-03-28 12:36:35,721 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 172.54/109.72 [2019-03-28 12:36:35,721 INFO L794 eck$LassoCheckResult]: Stem: 241#ULTIMATE.startENTRY [189] ULTIMATE.startENTRY-->L24: Formula: (and (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|) (= |v_#valid_23| (store |v_#valid_24| 0 0))) InVars {#valid=|v_#valid_24|} OutVars{ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_6|, ULTIMATE.start_main_#t~malloc11.offset=|v_ULTIMATE.start_main_#t~malloc11.offset_5|, ULTIMATE.start_main_#t~nondet9=|v_ULTIMATE.start_main_#t~nondet9_6|, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_10, ULTIMATE.start_main_#t~malloc12.base=|v_ULTIMATE.start_main_#t~malloc12.base_5|, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~malloc11.base=|v_ULTIMATE.start_main_#t~malloc11.base_5|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_7, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_6, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~malloc12.offset=|v_ULTIMATE.start_main_#t~malloc12.offset_5|, ULTIMATE.start_main_#t~ret13=|v_ULTIMATE.start_main_#t~ret13_4|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, #valid=|v_#valid_23|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_6, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10, ULTIMATE.start_main_#t~malloc11.offset, ULTIMATE.start_main_#t~nondet9, ULTIMATE.start_main_~length1~0, ULTIMATE.start_main_#t~malloc12.base, #NULL.offset, ULTIMATE.start_main_#t~malloc11.base, ULTIMATE.start_main_~nondetString2~0.base, ULTIMATE.start_main_~nondetString2~0.offset, #NULL.base, ULTIMATE.start_main_#t~malloc12.offset, ULTIMATE.start_main_#t~ret13, ULTIMATE.start_main_~nondetString1~0.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_~nondetString1~0.offset, ULTIMATE.start_main_~length2~0] 242#L24 [126] L24-->L24-2: Formula: (>= v_ULTIMATE.start_main_~length1~0_6 1) InVars {ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_6} OutVars{ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_6} AuxVars[] AssignedVars[] 243#L24-2 [127] L24-2-->L27-1: Formula: (>= v_ULTIMATE.start_main_~length2~0_6 1) InVars {ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_6} OutVars{ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_6} AuxVars[] AssignedVars[] 228#L27-1 [150] L27-1-->L32: Formula: (let ((.cse0 (store |v_#valid_10| |v_ULTIMATE.start_main_#t~malloc11.base_4| 1))) (and (= v_ULTIMATE.start_main_~nondetString1~0.offset_2 |v_ULTIMATE.start_main_#t~malloc11.offset_4|) (= v_ULTIMATE.start_main_~nondetString2~0.offset_2 |v_ULTIMATE.start_main_#t~malloc12.offset_4|) (= |v_ULTIMATE.start_main_#t~malloc11.offset_4| 0) (= 0 (select |v_#valid_10| |v_ULTIMATE.start_main_#t~malloc11.base_4|)) (> 0 |v_ULTIMATE.start_main_#t~malloc12.base_4|) (= |v_ULTIMATE.start_main_#t~malloc12.offset_4| 0) (= (store .cse0 |v_ULTIMATE.start_main_#t~malloc12.base_4| 1) |v_#valid_8|) (< |v_ULTIMATE.start_main_#t~malloc11.base_4| 0) (= v_ULTIMATE.start_main_~nondetString2~0.base_2 |v_ULTIMATE.start_main_#t~malloc12.base_4|) (= 0 (select .cse0 |v_ULTIMATE.start_main_#t~malloc12.base_4|)) (< |v_ULTIMATE.start_main_#t~malloc12.base_4| |v_#StackHeapBarrier_1|) (< |v_ULTIMATE.start_main_#t~malloc11.base_4| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_main_~nondetString1~0.base_2 |v_ULTIMATE.start_main_#t~malloc11.base_4|) (= |v_#length_3| (store (store |v_#length_5| |v_ULTIMATE.start_main_#t~malloc11.base_4| v_ULTIMATE.start_main_~length1~0_7) |v_ULTIMATE.start_main_#t~malloc12.base_4| v_ULTIMATE.start_main_~length2~0_7)))) InVars {ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_5|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_7, #valid=|v_#valid_10|} OutVars{ULTIMATE.start_main_#t~malloc11.offset=|v_ULTIMATE.start_main_#t~malloc11.offset_4|, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_7, ULTIMATE.start_main_#t~malloc12.base=|v_ULTIMATE.start_main_#t~malloc12.base_4|, ULTIMATE.start_main_#t~malloc11.base=|v_ULTIMATE.start_main_#t~malloc11.base_4|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_2, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_2, ULTIMATE.start_main_#t~malloc12.offset=|v_ULTIMATE.start_main_#t~malloc12.offset_4|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_2, #valid=|v_#valid_8|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_2, #length=|v_#length_3|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc12.offset, ULTIMATE.start_main_#t~malloc11.offset, ULTIMATE.start_main_~nondetString1~0.base, #valid, ULTIMATE.start_main_#t~malloc12.base, ULTIMATE.start_main_~nondetString1~0.offset, ULTIMATE.start_main_#t~malloc11.base, #length, ULTIMATE.start_main_~nondetString2~0.base, ULTIMATE.start_main_~nondetString2~0.offset] 229#L32 [96] L32-->L32-1: Formula: (let ((.cse0 (+ v_ULTIMATE.start_main_~length1~0_8 v_ULTIMATE.start_main_~nondetString1~0.offset_3))) (and (<= 1 .cse0) (= 1 (select |v_#valid_11| v_ULTIMATE.start_main_~nondetString1~0.base_3)) (= |v_#memory_int_2| (store |v_#memory_int_3| v_ULTIMATE.start_main_~nondetString1~0.base_3 (store (select |v_#memory_int_3| v_ULTIMATE.start_main_~nondetString1~0.base_3) (+ v_ULTIMATE.start_main_~length1~0_8 v_ULTIMATE.start_main_~nondetString1~0.offset_3 (- 1)) 0))) (<= .cse0 (select |v_#length_6| v_ULTIMATE.start_main_~nondetString1~0.base_3)))) InVars {ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_3, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_3|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_3, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_8, #length=|v_#length_6|} OutVars{ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_3, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_3, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_8, #length=|v_#length_6|} AuxVars[] AssignedVars[#memory_int] 238#L32-1 [190] L32-1-->L8-3: Formula: (let ((.cse0 (+ v_ULTIMATE.start_main_~length2~0_11 v_ULTIMATE.start_main_~nondetString2~0.offset_7))) (and (= v_ULTIMATE.start_substring_~ps~0.offset_8 v_ULTIMATE.start_substring_~s.offset_3) (<= 1 .cse0) (= v_ULTIMATE.start_main_~nondetString2~0.base_8 |v_ULTIMATE.start_substring_#in~t.base_2|) (= |v_ULTIMATE.start_substring_#in~s.offset_2| v_ULTIMATE.start_substring_~s.offset_3) (= (select |v_#valid_25| v_ULTIMATE.start_main_~nondetString2~0.base_8) 1) (= |v_ULTIMATE.start_substring_#in~t.base_2| v_ULTIMATE.start_substring_~t.base_4) (= |v_ULTIMATE.start_substring_#in~s.base_2| v_ULTIMATE.start_main_~nondetString1~0.base_8) (= (store |v_#memory_int_11| v_ULTIMATE.start_main_~nondetString2~0.base_8 (store (select |v_#memory_int_11| v_ULTIMATE.start_main_~nondetString2~0.base_8) (+ v_ULTIMATE.start_main_~length2~0_11 v_ULTIMATE.start_main_~nondetString2~0.offset_7 (- 1)) 0)) |v_#memory_int_10|) (= v_ULTIMATE.start_main_~nondetString2~0.offset_7 |v_ULTIMATE.start_substring_#in~t.offset_2|) (= v_ULTIMATE.start_main_~nondetString1~0.offset_7 |v_ULTIMATE.start_substring_#in~s.offset_2|) (= |v_ULTIMATE.start_substring_#in~t.offset_2| v_ULTIMATE.start_substring_~t.offset_4) (= |v_ULTIMATE.start_substring_#in~s.base_2| v_ULTIMATE.start_substring_~s.base_3) (= v_ULTIMATE.start_substring_~s.base_3 v_ULTIMATE.start_substring_~ps~0.base_9) (<= .cse0 (select |v_#length_18| v_ULTIMATE.start_main_~nondetString2~0.base_8)))) InVars {ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_8, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_7, #length=|v_#length_18|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_8, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_7, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_11} OutVars{ULTIMATE.start_substring_#in~t.offset=|v_ULTIMATE.start_substring_#in~t.offset_2|, ULTIMATE.start_substring_~ps~0.offset=v_ULTIMATE.start_substring_~ps~0.offset_8, ULTIMATE.start_substring_#t~post5.offset=|v_ULTIMATE.start_substring_#t~post5.offset_4|, ULTIMATE.start_substring_~ps2~0.base=v_ULTIMATE.start_substring_~ps2~0.base_8, ULTIMATE.start_substring_#t~mem7=|v_ULTIMATE.start_substring_#t~mem7_7|, ULTIMATE.start_substring_~t.offset=v_ULTIMATE.start_substring_~t.offset_4, ULTIMATE.start_substring_#t~mem3=|v_ULTIMATE.start_substring_#t~mem3_6|, ULTIMATE.start_substring_#t~mem2=|v_ULTIMATE.start_substring_#t~mem2_6|, ULTIMATE.start_substring_#t~mem1=|v_ULTIMATE.start_substring_#t~mem1_6|, ULTIMATE.start_substring_#in~s.offset=|v_ULTIMATE.start_substring_#in~s.offset_2|, ULTIMATE.start_substring_#t~mem0=|v_ULTIMATE.start_substring_#t~mem0_7|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_8, ULTIMATE.start_substring_~ps2~0.offset=v_ULTIMATE.start_substring_~ps2~0.offset_7, ULTIMATE.start_substring_~pt~0.base=v_ULTIMATE.start_substring_~pt~0.base_14, ULTIMATE.start_substring_#t~post8.offset=|v_ULTIMATE.start_substring_#t~post8.offset_4|, #length=|v_#length_18|, ULTIMATE.start_substring_~pt~0.offset=v_ULTIMATE.start_substring_~pt~0.offset_11, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_11, ULTIMATE.start_substring_#res=|v_ULTIMATE.start_substring_#res_5|, ULTIMATE.start_substring_#t~post6.offset=|v_ULTIMATE.start_substring_#t~post6.offset_4|, ULTIMATE.start_substring_~t.base=v_ULTIMATE.start_substring_~t.base_4, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_8, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_7, ULTIMATE.start_substring_~s.base=v_ULTIMATE.start_substring_~s.base_3, ULTIMATE.start_substring_#in~t.base=|v_ULTIMATE.start_substring_#in~t.base_2|, ULTIMATE.start_substring_#in~s.base=|v_ULTIMATE.start_substring_#in~s.base_2|, ULTIMATE.start_substring_#t~post6.base=|v_ULTIMATE.start_substring_#t~post6.base_4|, ULTIMATE.start_substring_#t~post8.base=|v_ULTIMATE.start_substring_#t~post8.base_4|, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_10|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_7, ULTIMATE.start_substring_~ps~0.base=v_ULTIMATE.start_substring_~ps~0.base_9, ULTIMATE.start_substring_#t~post5.base=|v_ULTIMATE.start_substring_#t~post5.base_4|, ULTIMATE.start_substring_~s.offset=v_ULTIMATE.start_substring_~s.offset_3, ULTIMATE.start_substring_#t~short4=|v_ULTIMATE.start_substring_#t~short4_10|} AuxVars[] AssignedVars[ULTIMATE.start_substring_#in~t.offset, ULTIMATE.start_substring_~ps~0.offset, ULTIMATE.start_substring_#t~post5.offset, ULTIMATE.start_substring_~ps2~0.base, ULTIMATE.start_substring_#t~mem7, ULTIMATE.start_substring_~t.offset, ULTIMATE.start_substring_#t~mem3, ULTIMATE.start_substring_#t~mem2, ULTIMATE.start_substring_#t~mem1, ULTIMATE.start_substring_#in~s.offset, ULTIMATE.start_substring_#t~mem0, ULTIMATE.start_substring_~ps2~0.offset, ULTIMATE.start_substring_~pt~0.base, ULTIMATE.start_substring_#t~post8.offset, ULTIMATE.start_substring_~pt~0.offset, ULTIMATE.start_substring_#res, ULTIMATE.start_substring_#t~post6.offset, ULTIMATE.start_substring_~t.base, ULTIMATE.start_substring_~s.base, ULTIMATE.start_substring_#in~t.base, ULTIMATE.start_substring_#in~s.base, ULTIMATE.start_substring_#t~post6.base, ULTIMATE.start_substring_#t~post8.base, #memory_int, ULTIMATE.start_substring_~ps~0.base, ULTIMATE.start_substring_#t~post5.base, ULTIMATE.start_substring_~s.offset, ULTIMATE.start_substring_#t~short4] 227#L8-3 172.54/109.72 [2019-03-28 12:36:35,722 INFO L796 eck$LassoCheckResult]: Loop: 227#L8-3 [113] L8-3-->L8-1: Formula: (and (= (select (select |v_#memory_int_6| v_ULTIMATE.start_substring_~ps~0.base_5) v_ULTIMATE.start_substring_~ps~0.offset_5) |v_ULTIMATE.start_substring_#t~mem0_2|) (= (select |v_#valid_15| v_ULTIMATE.start_substring_~ps~0.base_5) 1) (<= 0 v_ULTIMATE.start_substring_~ps~0.offset_5) (<= (+ v_ULTIMATE.start_substring_~ps~0.offset_5 1) (select |v_#length_10| v_ULTIMATE.start_substring_~ps~0.base_5))) InVars {ULTIMATE.start_substring_~ps~0.offset=v_ULTIMATE.start_substring_~ps~0.offset_5, #memory_int=|v_#memory_int_6|, #length=|v_#length_10|, ULTIMATE.start_substring_~ps~0.base=v_ULTIMATE.start_substring_~ps~0.base_5, #valid=|v_#valid_15|} OutVars{ULTIMATE.start_substring_#t~mem0=|v_ULTIMATE.start_substring_#t~mem0_2|, #valid=|v_#valid_15|, ULTIMATE.start_substring_~ps~0.offset=v_ULTIMATE.start_substring_~ps~0.offset_5, #memory_int=|v_#memory_int_6|, #length=|v_#length_10|, ULTIMATE.start_substring_~ps~0.base=v_ULTIMATE.start_substring_~ps~0.base_5} AuxVars[] AssignedVars[ULTIMATE.start_substring_#t~mem0] 230#L8-1 [163] L8-1-->L11-9: Formula: (and (= v_ULTIMATE.start_substring_~ps2~0.base_2 v_ULTIMATE.start_substring_~ps~0.base_8) (= v_ULTIMATE.start_substring_~pt~0.offset_4 v_ULTIMATE.start_substring_~t.offset_3) (< 0 |v_ULTIMATE.start_substring_#t~mem0_6|) (= v_ULTIMATE.start_substring_~pt~0.base_5 v_ULTIMATE.start_substring_~t.base_3) (= v_ULTIMATE.start_substring_~ps2~0.offset_2 v_ULTIMATE.start_substring_~ps~0.offset_7)) InVars {ULTIMATE.start_substring_~ps~0.offset=v_ULTIMATE.start_substring_~ps~0.offset_7, ULTIMATE.start_substring_~t.offset=v_ULTIMATE.start_substring_~t.offset_3, ULTIMATE.start_substring_~ps~0.base=v_ULTIMATE.start_substring_~ps~0.base_8, ULTIMATE.start_substring_~t.base=v_ULTIMATE.start_substring_~t.base_3, ULTIMATE.start_substring_#t~mem0=|v_ULTIMATE.start_substring_#t~mem0_6|} OutVars{ULTIMATE.start_substring_~t.offset=v_ULTIMATE.start_substring_~t.offset_3, ULTIMATE.start_substring_#t~mem0=|v_ULTIMATE.start_substring_#t~mem0_5|, ULTIMATE.start_substring_~ps2~0.offset=v_ULTIMATE.start_substring_~ps2~0.offset_2, ULTIMATE.start_substring_~pt~0.base=v_ULTIMATE.start_substring_~pt~0.base_5, ULTIMATE.start_substring_~ps~0.offset=v_ULTIMATE.start_substring_~ps~0.offset_7, ULTIMATE.start_substring_~ps2~0.base=v_ULTIMATE.start_substring_~ps2~0.base_2, ULTIMATE.start_substring_~ps~0.base=v_ULTIMATE.start_substring_~ps~0.base_8, ULTIMATE.start_substring_~t.base=v_ULTIMATE.start_substring_~t.base_3, ULTIMATE.start_substring_~pt~0.offset=v_ULTIMATE.start_substring_~pt~0.offset_4} AuxVars[] AssignedVars[ULTIMATE.start_substring_#t~mem0, ULTIMATE.start_substring_~ps2~0.offset, ULTIMATE.start_substring_~pt~0.base, ULTIMATE.start_substring_~ps2~0.base, ULTIMATE.start_substring_~pt~0.offset] 234#L11-9 [103] L11-9-->L11-1: Formula: (and (<= 0 v_ULTIMATE.start_substring_~pt~0.offset_5) (<= (+ v_ULTIMATE.start_substring_~pt~0.offset_5 1) (select |v_#length_12| v_ULTIMATE.start_substring_~pt~0.base_6)) (= |v_ULTIMATE.start_substring_#t~mem1_2| (select (select |v_#memory_int_7| v_ULTIMATE.start_substring_~pt~0.base_6) v_ULTIMATE.start_substring_~pt~0.offset_5)) (= (select |v_#valid_17| v_ULTIMATE.start_substring_~pt~0.base_6) 1)) InVars {#memory_int=|v_#memory_int_7|, #length=|v_#length_12|, ULTIMATE.start_substring_~pt~0.offset=v_ULTIMATE.start_substring_~pt~0.offset_5, ULTIMATE.start_substring_~pt~0.base=v_ULTIMATE.start_substring_~pt~0.base_6, #valid=|v_#valid_17|} OutVars{ULTIMATE.start_substring_#t~mem1=|v_ULTIMATE.start_substring_#t~mem1_2|, ULTIMATE.start_substring_~pt~0.base=v_ULTIMATE.start_substring_~pt~0.base_6, #valid=|v_#valid_17|, #memory_int=|v_#memory_int_7|, #length=|v_#length_12|, ULTIMATE.start_substring_~pt~0.offset=v_ULTIMATE.start_substring_~pt~0.offset_5} AuxVars[] AssignedVars[ULTIMATE.start_substring_#t~mem1] 245#L11-1 [175] L11-1-->L11-2: Formula: (and |v_ULTIMATE.start_substring_#t~short4_2| (< 0 |v_ULTIMATE.start_substring_#t~mem1_3|)) InVars {ULTIMATE.start_substring_#t~mem1=|v_ULTIMATE.start_substring_#t~mem1_3|} OutVars{ULTIMATE.start_substring_#t~mem1=|v_ULTIMATE.start_substring_#t~mem1_3|, ULTIMATE.start_substring_#t~short4=|v_ULTIMATE.start_substring_#t~short4_2|} AuxVars[] AssignedVars[ULTIMATE.start_substring_#t~short4] 240#L11-2 [90] L11-2-->L11-3: Formula: |v_ULTIMATE.start_substring_#t~short4_3| InVars {ULTIMATE.start_substring_#t~short4=|v_ULTIMATE.start_substring_#t~short4_3|} OutVars{ULTIMATE.start_substring_#t~short4=|v_ULTIMATE.start_substring_#t~short4_3|} AuxVars[] AssignedVars[] 253#L11-3 [87] L11-3-->L11-4: Formula: (and (<= (+ v_ULTIMATE.start_substring_~pt~0.offset_7 1) (select |v_#length_14| v_ULTIMATE.start_substring_~pt~0.base_9)) (= 1 (select |v_#valid_19| v_ULTIMATE.start_substring_~pt~0.base_9)) (<= 0 v_ULTIMATE.start_substring_~pt~0.offset_7) (= (select (select |v_#memory_int_8| v_ULTIMATE.start_substring_~pt~0.base_9) v_ULTIMATE.start_substring_~pt~0.offset_7) |v_ULTIMATE.start_substring_#t~mem2_2|)) InVars {#memory_int=|v_#memory_int_8|, #length=|v_#length_14|, ULTIMATE.start_substring_~pt~0.offset=v_ULTIMATE.start_substring_~pt~0.offset_7, ULTIMATE.start_substring_~pt~0.base=v_ULTIMATE.start_substring_~pt~0.base_9, #valid=|v_#valid_19|} OutVars{ULTIMATE.start_substring_#t~mem2=|v_ULTIMATE.start_substring_#t~mem2_2|, ULTIMATE.start_substring_~pt~0.base=v_ULTIMATE.start_substring_~pt~0.base_9, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_8|, #length=|v_#length_14|, ULTIMATE.start_substring_~pt~0.offset=v_ULTIMATE.start_substring_~pt~0.offset_7} AuxVars[] AssignedVars[ULTIMATE.start_substring_#t~mem2] 249#L11-4 [83] L11-4-->L11-5: Formula: (and (= (select |v_#valid_21| v_ULTIMATE.start_substring_~ps2~0.base_3) 1) (<= (+ v_ULTIMATE.start_substring_~ps2~0.offset_3 1) (select |v_#length_16| v_ULTIMATE.start_substring_~ps2~0.base_3)) (<= 0 v_ULTIMATE.start_substring_~ps2~0.offset_3) (= (select (select |v_#memory_int_9| v_ULTIMATE.start_substring_~ps2~0.base_3) v_ULTIMATE.start_substring_~ps2~0.offset_3) |v_ULTIMATE.start_substring_#t~mem3_2|)) InVars {#memory_int=|v_#memory_int_9|, #length=|v_#length_16|, ULTIMATE.start_substring_~ps2~0.base=v_ULTIMATE.start_substring_~ps2~0.base_3, ULTIMATE.start_substring_~ps2~0.offset=v_ULTIMATE.start_substring_~ps2~0.offset_3, #valid=|v_#valid_21|} OutVars{ULTIMATE.start_substring_#t~mem3=|v_ULTIMATE.start_substring_#t~mem3_2|, ULTIMATE.start_substring_~ps2~0.offset=v_ULTIMATE.start_substring_~ps2~0.offset_3, #valid=|v_#valid_21|, #memory_int=|v_#memory_int_9|, #length=|v_#length_16|, ULTIMATE.start_substring_~ps2~0.base=v_ULTIMATE.start_substring_~ps2~0.base_3} AuxVars[] AssignedVars[ULTIMATE.start_substring_#t~mem3] 247#L11-5 [187] L11-5-->L11-7: Formula: (and (not |v_ULTIMATE.start_substring_#t~short4_4|) (< |v_ULTIMATE.start_substring_#t~mem3_3| |v_ULTIMATE.start_substring_#t~mem2_3|)) InVars {ULTIMATE.start_substring_#t~mem2=|v_ULTIMATE.start_substring_#t~mem2_3|, ULTIMATE.start_substring_#t~mem3=|v_ULTIMATE.start_substring_#t~mem3_3|} OutVars{ULTIMATE.start_substring_#t~mem3=|v_ULTIMATE.start_substring_#t~mem3_3|, ULTIMATE.start_substring_#t~mem2=|v_ULTIMATE.start_substring_#t~mem2_3|, ULTIMATE.start_substring_#t~short4=|v_ULTIMATE.start_substring_#t~short4_4|} AuxVars[] AssignedVars[ULTIMATE.start_substring_#t~short4] 246#L11-7 [108] L11-7-->L11-10: Formula: (not |v_ULTIMATE.start_substring_#t~short4_7|) InVars {ULTIMATE.start_substring_#t~short4=|v_ULTIMATE.start_substring_#t~short4_7|} OutVars{ULTIMATE.start_substring_#t~mem3=|v_ULTIMATE.start_substring_#t~mem3_4|, ULTIMATE.start_substring_#t~mem2=|v_ULTIMATE.start_substring_#t~mem2_4|, ULTIMATE.start_substring_#t~mem1=|v_ULTIMATE.start_substring_#t~mem1_4|, ULTIMATE.start_substring_#t~short4=|v_ULTIMATE.start_substring_#t~short4_6|} AuxVars[] AssignedVars[ULTIMATE.start_substring_#t~mem3, ULTIMATE.start_substring_#t~mem2, ULTIMATE.start_substring_#t~mem1, ULTIMATE.start_substring_#t~short4] 244#L11-10 [99] L11-10-->L15: Formula: (and (= (select |v_#valid_3| v_ULTIMATE.start_substring_~pt~0.base_1) 1) (<= (+ v_ULTIMATE.start_substring_~pt~0.offset_1 1) (select |v_#length_1| v_ULTIMATE.start_substring_~pt~0.base_1)) (= (select (select |v_#memory_int_1| v_ULTIMATE.start_substring_~pt~0.base_1) v_ULTIMATE.start_substring_~pt~0.offset_1) |v_ULTIMATE.start_substring_#t~mem7_1|) (<= 0 v_ULTIMATE.start_substring_~pt~0.offset_1)) InVars {#memory_int=|v_#memory_int_1|, #length=|v_#length_1|, ULTIMATE.start_substring_~pt~0.offset=v_ULTIMATE.start_substring_~pt~0.offset_1, ULTIMATE.start_substring_~pt~0.base=v_ULTIMATE.start_substring_~pt~0.base_1, #valid=|v_#valid_3|} OutVars{ULTIMATE.start_substring_~pt~0.base=v_ULTIMATE.start_substring_~pt~0.base_1, #valid=|v_#valid_3|, #memory_int=|v_#memory_int_1|, #length=|v_#length_1|, ULTIMATE.start_substring_~pt~0.offset=v_ULTIMATE.start_substring_~pt~0.offset_1, ULTIMATE.start_substring_#t~mem7=|v_ULTIMATE.start_substring_#t~mem7_1|} AuxVars[] AssignedVars[ULTIMATE.start_substring_#t~mem7] 226#L15 [176] L15-->L8-3: Formula: (and (= (+ v_ULTIMATE.start_substring_~ps~0.offset_2 1) v_ULTIMATE.start_substring_~ps~0.offset_1) (> 0 |v_ULTIMATE.start_substring_#t~mem7_5|) (= v_ULTIMATE.start_substring_~ps~0.base_2 v_ULTIMATE.start_substring_~ps~0.base_1)) InVars {ULTIMATE.start_substring_~ps~0.offset=v_ULTIMATE.start_substring_~ps~0.offset_2, ULTIMATE.start_substring_~ps~0.base=v_ULTIMATE.start_substring_~ps~0.base_2, ULTIMATE.start_substring_#t~mem7=|v_ULTIMATE.start_substring_#t~mem7_5|} OutVars{ULTIMATE.start_substring_~ps~0.offset=v_ULTIMATE.start_substring_~ps~0.offset_1, ULTIMATE.start_substring_#t~post8.base=|v_ULTIMATE.start_substring_#t~post8.base_1|, ULTIMATE.start_substring_#t~post8.offset=|v_ULTIMATE.start_substring_#t~post8.offset_1|, ULTIMATE.start_substring_~ps~0.base=v_ULTIMATE.start_substring_~ps~0.base_1, ULTIMATE.start_substring_#t~mem7=|v_ULTIMATE.start_substring_#t~mem7_4|} AuxVars[] AssignedVars[ULTIMATE.start_substring_#t~post8.base, ULTIMATE.start_substring_~ps~0.offset, ULTIMATE.start_substring_#t~post8.offset, ULTIMATE.start_substring_~ps~0.base, ULTIMATE.start_substring_#t~mem7] 227#L8-3 172.54/109.72 [2019-03-28 12:36:35,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 172.54/109.72 [2019-03-28 12:36:35,722 INFO L82 PathProgramCache]: Analyzing trace with hash 2123740343, now seen corresponding path program 4 times 172.54/109.72 [2019-03-28 12:36:35,722 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 172.54/109.72 [2019-03-28 12:36:35,722 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 172.54/109.72 [2019-03-28 12:36:35,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 172.54/109.72 [2019-03-28 12:36:35,723 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 172.54/109.72 [2019-03-28 12:36:35,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 172.54/109.72 [2019-03-28 12:36:35,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 172.54/109.72 [2019-03-28 12:36:35,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 172.54/109.72 [2019-03-28 12:36:35,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 172.54/109.72 [2019-03-28 12:36:35,733 INFO L82 PathProgramCache]: Analyzing trace with hash 674012761, now seen corresponding path program 1 times 172.54/109.72 [2019-03-28 12:36:35,733 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 172.54/109.72 [2019-03-28 12:36:35,733 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 172.54/109.72 [2019-03-28 12:36:35,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 172.54/109.72 [2019-03-28 12:36:35,734 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 172.54/109.72 [2019-03-28 12:36:35,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 172.54/109.72 [2019-03-28 12:36:35,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 172.54/109.72 [2019-03-28 12:36:35,753 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 172.54/109.72 [2019-03-28 12:36:35,753 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 172.54/109.72 [2019-03-28 12:36:35,753 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 172.54/109.72 [2019-03-28 12:36:35,754 INFO L811 eck$LassoCheckResult]: loop already infeasible 172.54/109.72 [2019-03-28 12:36:35,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. 172.54/109.72 [2019-03-28 12:36:35,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 172.54/109.72 [2019-03-28 12:36:35,754 INFO L87 Difference]: Start difference. First operand 28 states and 45 transitions. cyclomatic complexity: 18 Second operand 5 states. 172.54/109.72 [2019-03-28 12:36:35,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 172.54/109.72 [2019-03-28 12:36:35,871 INFO L93 Difference]: Finished difference Result 38 states and 59 transitions. 172.54/109.72 [2019-03-28 12:36:35,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 172.54/109.72 [2019-03-28 12:36:35,872 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 59 transitions. 172.54/109.72 [2019-03-28 12:36:35,872 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 32 172.54/109.72 [2019-03-28 12:36:35,873 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 38 states and 59 transitions. 172.54/109.72 [2019-03-28 12:36:35,873 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 38 172.54/109.72 [2019-03-28 12:36:35,873 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 38 172.54/109.72 [2019-03-28 12:36:35,873 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 59 transitions. 172.54/109.72 [2019-03-28 12:36:35,874 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 172.54/109.72 [2019-03-28 12:36:35,874 INFO L706 BuchiCegarLoop]: Abstraction has 38 states and 59 transitions. 172.54/109.72 [2019-03-28 12:36:35,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states and 59 transitions. 172.54/109.72 [2019-03-28 12:36:35,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 35. 172.54/109.72 [2019-03-28 12:36:35,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. 172.54/109.72 [2019-03-28 12:36:35,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 55 transitions. 172.54/109.72 [2019-03-28 12:36:35,875 INFO L729 BuchiCegarLoop]: Abstraction has 35 states and 55 transitions. 172.54/109.72 [2019-03-28 12:36:35,876 INFO L609 BuchiCegarLoop]: Abstraction has 35 states and 55 transitions. 172.54/109.72 [2019-03-28 12:36:35,876 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ 172.54/109.72 [2019-03-28 12:36:35,876 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 55 transitions. 172.54/109.72 [2019-03-28 12:36:35,876 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 29 172.54/109.72 [2019-03-28 12:36:35,877 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 172.54/109.72 [2019-03-28 12:36:35,877 INFO L119 BuchiIsEmpty]: Starting construction of run 172.54/109.72 [2019-03-28 12:36:35,877 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] 172.54/109.72 [2019-03-28 12:36:35,877 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 172.54/109.72 [2019-03-28 12:36:35,878 INFO L794 eck$LassoCheckResult]: Stem: 321#ULTIMATE.startENTRY [189] ULTIMATE.startENTRY-->L24: Formula: (and (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|) (= |v_#valid_23| (store |v_#valid_24| 0 0))) InVars {#valid=|v_#valid_24|} OutVars{ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_6|, ULTIMATE.start_main_#t~malloc11.offset=|v_ULTIMATE.start_main_#t~malloc11.offset_5|, ULTIMATE.start_main_#t~nondet9=|v_ULTIMATE.start_main_#t~nondet9_6|, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_10, ULTIMATE.start_main_#t~malloc12.base=|v_ULTIMATE.start_main_#t~malloc12.base_5|, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~malloc11.base=|v_ULTIMATE.start_main_#t~malloc11.base_5|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_7, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_6, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~malloc12.offset=|v_ULTIMATE.start_main_#t~malloc12.offset_5|, ULTIMATE.start_main_#t~ret13=|v_ULTIMATE.start_main_#t~ret13_4|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, #valid=|v_#valid_23|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_6, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10, ULTIMATE.start_main_#t~malloc11.offset, ULTIMATE.start_main_#t~nondet9, ULTIMATE.start_main_~length1~0, ULTIMATE.start_main_#t~malloc12.base, #NULL.offset, ULTIMATE.start_main_#t~malloc11.base, ULTIMATE.start_main_~nondetString2~0.base, ULTIMATE.start_main_~nondetString2~0.offset, #NULL.base, ULTIMATE.start_main_#t~malloc12.offset, ULTIMATE.start_main_#t~ret13, ULTIMATE.start_main_~nondetString1~0.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_~nondetString1~0.offset, ULTIMATE.start_main_~length2~0] 322#L24 [126] L24-->L24-2: Formula: (>= v_ULTIMATE.start_main_~length1~0_6 1) InVars {ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_6} OutVars{ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_6} AuxVars[] AssignedVars[] 323#L24-2 [127] L24-2-->L27-1: Formula: (>= v_ULTIMATE.start_main_~length2~0_6 1) InVars {ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_6} OutVars{ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_6} AuxVars[] AssignedVars[] 306#L27-1 [150] L27-1-->L32: Formula: (let ((.cse0 (store |v_#valid_10| |v_ULTIMATE.start_main_#t~malloc11.base_4| 1))) (and (= v_ULTIMATE.start_main_~nondetString1~0.offset_2 |v_ULTIMATE.start_main_#t~malloc11.offset_4|) (= v_ULTIMATE.start_main_~nondetString2~0.offset_2 |v_ULTIMATE.start_main_#t~malloc12.offset_4|) (= |v_ULTIMATE.start_main_#t~malloc11.offset_4| 0) (= 0 (select |v_#valid_10| |v_ULTIMATE.start_main_#t~malloc11.base_4|)) (> 0 |v_ULTIMATE.start_main_#t~malloc12.base_4|) (= |v_ULTIMATE.start_main_#t~malloc12.offset_4| 0) (= (store .cse0 |v_ULTIMATE.start_main_#t~malloc12.base_4| 1) |v_#valid_8|) (< |v_ULTIMATE.start_main_#t~malloc11.base_4| 0) (= v_ULTIMATE.start_main_~nondetString2~0.base_2 |v_ULTIMATE.start_main_#t~malloc12.base_4|) (= 0 (select .cse0 |v_ULTIMATE.start_main_#t~malloc12.base_4|)) (< |v_ULTIMATE.start_main_#t~malloc12.base_4| |v_#StackHeapBarrier_1|) (< |v_ULTIMATE.start_main_#t~malloc11.base_4| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_main_~nondetString1~0.base_2 |v_ULTIMATE.start_main_#t~malloc11.base_4|) (= |v_#length_3| (store (store |v_#length_5| |v_ULTIMATE.start_main_#t~malloc11.base_4| v_ULTIMATE.start_main_~length1~0_7) |v_ULTIMATE.start_main_#t~malloc12.base_4| v_ULTIMATE.start_main_~length2~0_7)))) InVars {ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_5|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_7, #valid=|v_#valid_10|} OutVars{ULTIMATE.start_main_#t~malloc11.offset=|v_ULTIMATE.start_main_#t~malloc11.offset_4|, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_7, ULTIMATE.start_main_#t~malloc12.base=|v_ULTIMATE.start_main_#t~malloc12.base_4|, ULTIMATE.start_main_#t~malloc11.base=|v_ULTIMATE.start_main_#t~malloc11.base_4|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_2, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_2, ULTIMATE.start_main_#t~malloc12.offset=|v_ULTIMATE.start_main_#t~malloc12.offset_4|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_2, #valid=|v_#valid_8|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_2, #length=|v_#length_3|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc12.offset, ULTIMATE.start_main_#t~malloc11.offset, ULTIMATE.start_main_~nondetString1~0.base, #valid, ULTIMATE.start_main_#t~malloc12.base, ULTIMATE.start_main_~nondetString1~0.offset, ULTIMATE.start_main_#t~malloc11.base, #length, ULTIMATE.start_main_~nondetString2~0.base, ULTIMATE.start_main_~nondetString2~0.offset] 307#L32 [96] L32-->L32-1: Formula: (let ((.cse0 (+ v_ULTIMATE.start_main_~length1~0_8 v_ULTIMATE.start_main_~nondetString1~0.offset_3))) (and (<= 1 .cse0) (= 1 (select |v_#valid_11| v_ULTIMATE.start_main_~nondetString1~0.base_3)) (= |v_#memory_int_2| (store |v_#memory_int_3| v_ULTIMATE.start_main_~nondetString1~0.base_3 (store (select |v_#memory_int_3| v_ULTIMATE.start_main_~nondetString1~0.base_3) (+ v_ULTIMATE.start_main_~length1~0_8 v_ULTIMATE.start_main_~nondetString1~0.offset_3 (- 1)) 0))) (<= .cse0 (select |v_#length_6| v_ULTIMATE.start_main_~nondetString1~0.base_3)))) InVars {ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_3, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_3|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_3, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_8, #length=|v_#length_6|} OutVars{ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_3, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_3, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_8, #length=|v_#length_6|} AuxVars[] AssignedVars[#memory_int] 317#L32-1 [190] L32-1-->L8-3: Formula: (let ((.cse0 (+ v_ULTIMATE.start_main_~length2~0_11 v_ULTIMATE.start_main_~nondetString2~0.offset_7))) (and (= v_ULTIMATE.start_substring_~ps~0.offset_8 v_ULTIMATE.start_substring_~s.offset_3) (<= 1 .cse0) (= v_ULTIMATE.start_main_~nondetString2~0.base_8 |v_ULTIMATE.start_substring_#in~t.base_2|) (= |v_ULTIMATE.start_substring_#in~s.offset_2| v_ULTIMATE.start_substring_~s.offset_3) (= (select |v_#valid_25| v_ULTIMATE.start_main_~nondetString2~0.base_8) 1) (= |v_ULTIMATE.start_substring_#in~t.base_2| v_ULTIMATE.start_substring_~t.base_4) (= |v_ULTIMATE.start_substring_#in~s.base_2| v_ULTIMATE.start_main_~nondetString1~0.base_8) (= (store |v_#memory_int_11| v_ULTIMATE.start_main_~nondetString2~0.base_8 (store (select |v_#memory_int_11| v_ULTIMATE.start_main_~nondetString2~0.base_8) (+ v_ULTIMATE.start_main_~length2~0_11 v_ULTIMATE.start_main_~nondetString2~0.offset_7 (- 1)) 0)) |v_#memory_int_10|) (= v_ULTIMATE.start_main_~nondetString2~0.offset_7 |v_ULTIMATE.start_substring_#in~t.offset_2|) (= v_ULTIMATE.start_main_~nondetString1~0.offset_7 |v_ULTIMATE.start_substring_#in~s.offset_2|) (= |v_ULTIMATE.start_substring_#in~t.offset_2| v_ULTIMATE.start_substring_~t.offset_4) (= |v_ULTIMATE.start_substring_#in~s.base_2| v_ULTIMATE.start_substring_~s.base_3) (= v_ULTIMATE.start_substring_~s.base_3 v_ULTIMATE.start_substring_~ps~0.base_9) (<= .cse0 (select |v_#length_18| v_ULTIMATE.start_main_~nondetString2~0.base_8)))) InVars {ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_8, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_7, #length=|v_#length_18|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_8, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_7, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_11} OutVars{ULTIMATE.start_substring_#in~t.offset=|v_ULTIMATE.start_substring_#in~t.offset_2|, ULTIMATE.start_substring_~ps~0.offset=v_ULTIMATE.start_substring_~ps~0.offset_8, ULTIMATE.start_substring_#t~post5.offset=|v_ULTIMATE.start_substring_#t~post5.offset_4|, ULTIMATE.start_substring_~ps2~0.base=v_ULTIMATE.start_substring_~ps2~0.base_8, ULTIMATE.start_substring_#t~mem7=|v_ULTIMATE.start_substring_#t~mem7_7|, ULTIMATE.start_substring_~t.offset=v_ULTIMATE.start_substring_~t.offset_4, ULTIMATE.start_substring_#t~mem3=|v_ULTIMATE.start_substring_#t~mem3_6|, ULTIMATE.start_substring_#t~mem2=|v_ULTIMATE.start_substring_#t~mem2_6|, ULTIMATE.start_substring_#t~mem1=|v_ULTIMATE.start_substring_#t~mem1_6|, ULTIMATE.start_substring_#in~s.offset=|v_ULTIMATE.start_substring_#in~s.offset_2|, ULTIMATE.start_substring_#t~mem0=|v_ULTIMATE.start_substring_#t~mem0_7|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_8, ULTIMATE.start_substring_~ps2~0.offset=v_ULTIMATE.start_substring_~ps2~0.offset_7, ULTIMATE.start_substring_~pt~0.base=v_ULTIMATE.start_substring_~pt~0.base_14, ULTIMATE.start_substring_#t~post8.offset=|v_ULTIMATE.start_substring_#t~post8.offset_4|, #length=|v_#length_18|, ULTIMATE.start_substring_~pt~0.offset=v_ULTIMATE.start_substring_~pt~0.offset_11, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_11, ULTIMATE.start_substring_#res=|v_ULTIMATE.start_substring_#res_5|, ULTIMATE.start_substring_#t~post6.offset=|v_ULTIMATE.start_substring_#t~post6.offset_4|, ULTIMATE.start_substring_~t.base=v_ULTIMATE.start_substring_~t.base_4, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_8, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_7, ULTIMATE.start_substring_~s.base=v_ULTIMATE.start_substring_~s.base_3, ULTIMATE.start_substring_#in~t.base=|v_ULTIMATE.start_substring_#in~t.base_2|, ULTIMATE.start_substring_#in~s.base=|v_ULTIMATE.start_substring_#in~s.base_2|, ULTIMATE.start_substring_#t~post6.base=|v_ULTIMATE.start_substring_#t~post6.base_4|, ULTIMATE.start_substring_#t~post8.base=|v_ULTIMATE.start_substring_#t~post8.base_4|, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_10|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_7, ULTIMATE.start_substring_~ps~0.base=v_ULTIMATE.start_substring_~ps~0.base_9, ULTIMATE.start_substring_#t~post5.base=|v_ULTIMATE.start_substring_#t~post5.base_4|, ULTIMATE.start_substring_~s.offset=v_ULTIMATE.start_substring_~s.offset_3, ULTIMATE.start_substring_#t~short4=|v_ULTIMATE.start_substring_#t~short4_10|} AuxVars[] AssignedVars[ULTIMATE.start_substring_#in~t.offset, ULTIMATE.start_substring_~ps~0.offset, ULTIMATE.start_substring_#t~post5.offset, ULTIMATE.start_substring_~ps2~0.base, ULTIMATE.start_substring_#t~mem7, ULTIMATE.start_substring_~t.offset, ULTIMATE.start_substring_#t~mem3, ULTIMATE.start_substring_#t~mem2, ULTIMATE.start_substring_#t~mem1, ULTIMATE.start_substring_#in~s.offset, ULTIMATE.start_substring_#t~mem0, ULTIMATE.start_substring_~ps2~0.offset, ULTIMATE.start_substring_~pt~0.base, ULTIMATE.start_substring_#t~post8.offset, ULTIMATE.start_substring_~pt~0.offset, ULTIMATE.start_substring_#res, ULTIMATE.start_substring_#t~post6.offset, ULTIMATE.start_substring_~t.base, ULTIMATE.start_substring_~s.base, ULTIMATE.start_substring_#in~t.base, ULTIMATE.start_substring_#in~s.base, ULTIMATE.start_substring_#t~post6.base, ULTIMATE.start_substring_#t~post8.base, #memory_int, ULTIMATE.start_substring_~ps~0.base, ULTIMATE.start_substring_#t~post5.base, ULTIMATE.start_substring_~s.offset, ULTIMATE.start_substring_#t~short4] 305#L8-3 172.54/109.72 [2019-03-28 12:36:35,878 INFO L796 eck$LassoCheckResult]: Loop: 305#L8-3 [113] L8-3-->L8-1: Formula: (and (= (select (select |v_#memory_int_6| v_ULTIMATE.start_substring_~ps~0.base_5) v_ULTIMATE.start_substring_~ps~0.offset_5) |v_ULTIMATE.start_substring_#t~mem0_2|) (= (select |v_#valid_15| v_ULTIMATE.start_substring_~ps~0.base_5) 1) (<= 0 v_ULTIMATE.start_substring_~ps~0.offset_5) (<= (+ v_ULTIMATE.start_substring_~ps~0.offset_5 1) (select |v_#length_10| v_ULTIMATE.start_substring_~ps~0.base_5))) InVars {ULTIMATE.start_substring_~ps~0.offset=v_ULTIMATE.start_substring_~ps~0.offset_5, #memory_int=|v_#memory_int_6|, #length=|v_#length_10|, ULTIMATE.start_substring_~ps~0.base=v_ULTIMATE.start_substring_~ps~0.base_5, #valid=|v_#valid_15|} OutVars{ULTIMATE.start_substring_#t~mem0=|v_ULTIMATE.start_substring_#t~mem0_2|, #valid=|v_#valid_15|, ULTIMATE.start_substring_~ps~0.offset=v_ULTIMATE.start_substring_~ps~0.offset_5, #memory_int=|v_#memory_int_6|, #length=|v_#length_10|, ULTIMATE.start_substring_~ps~0.base=v_ULTIMATE.start_substring_~ps~0.base_5} AuxVars[] AssignedVars[ULTIMATE.start_substring_#t~mem0] 308#L8-1 [163] L8-1-->L11-9: Formula: (and (= v_ULTIMATE.start_substring_~ps2~0.base_2 v_ULTIMATE.start_substring_~ps~0.base_8) (= v_ULTIMATE.start_substring_~pt~0.offset_4 v_ULTIMATE.start_substring_~t.offset_3) (< 0 |v_ULTIMATE.start_substring_#t~mem0_6|) (= v_ULTIMATE.start_substring_~pt~0.base_5 v_ULTIMATE.start_substring_~t.base_3) (= v_ULTIMATE.start_substring_~ps2~0.offset_2 v_ULTIMATE.start_substring_~ps~0.offset_7)) InVars {ULTIMATE.start_substring_~ps~0.offset=v_ULTIMATE.start_substring_~ps~0.offset_7, ULTIMATE.start_substring_~t.offset=v_ULTIMATE.start_substring_~t.offset_3, ULTIMATE.start_substring_~ps~0.base=v_ULTIMATE.start_substring_~ps~0.base_8, ULTIMATE.start_substring_~t.base=v_ULTIMATE.start_substring_~t.base_3, ULTIMATE.start_substring_#t~mem0=|v_ULTIMATE.start_substring_#t~mem0_6|} OutVars{ULTIMATE.start_substring_~t.offset=v_ULTIMATE.start_substring_~t.offset_3, ULTIMATE.start_substring_#t~mem0=|v_ULTIMATE.start_substring_#t~mem0_5|, ULTIMATE.start_substring_~ps2~0.offset=v_ULTIMATE.start_substring_~ps2~0.offset_2, ULTIMATE.start_substring_~pt~0.base=v_ULTIMATE.start_substring_~pt~0.base_5, ULTIMATE.start_substring_~ps~0.offset=v_ULTIMATE.start_substring_~ps~0.offset_7, ULTIMATE.start_substring_~ps2~0.base=v_ULTIMATE.start_substring_~ps2~0.base_2, ULTIMATE.start_substring_~ps~0.base=v_ULTIMATE.start_substring_~ps~0.base_8, ULTIMATE.start_substring_~t.base=v_ULTIMATE.start_substring_~t.base_3, ULTIMATE.start_substring_~pt~0.offset=v_ULTIMATE.start_substring_~pt~0.offset_4} AuxVars[] AssignedVars[ULTIMATE.start_substring_#t~mem0, ULTIMATE.start_substring_~ps2~0.offset, ULTIMATE.start_substring_~pt~0.base, ULTIMATE.start_substring_~ps2~0.base, ULTIMATE.start_substring_~pt~0.offset] 311#L11-9 [103] L11-9-->L11-1: Formula: (and (<= 0 v_ULTIMATE.start_substring_~pt~0.offset_5) (<= (+ v_ULTIMATE.start_substring_~pt~0.offset_5 1) (select |v_#length_12| v_ULTIMATE.start_substring_~pt~0.base_6)) (= |v_ULTIMATE.start_substring_#t~mem1_2| (select (select |v_#memory_int_7| v_ULTIMATE.start_substring_~pt~0.base_6) v_ULTIMATE.start_substring_~pt~0.offset_5)) (= (select |v_#valid_17| v_ULTIMATE.start_substring_~pt~0.base_6) 1)) InVars {#memory_int=|v_#memory_int_7|, #length=|v_#length_12|, ULTIMATE.start_substring_~pt~0.offset=v_ULTIMATE.start_substring_~pt~0.offset_5, ULTIMATE.start_substring_~pt~0.base=v_ULTIMATE.start_substring_~pt~0.base_6, #valid=|v_#valid_17|} OutVars{ULTIMATE.start_substring_#t~mem1=|v_ULTIMATE.start_substring_#t~mem1_2|, ULTIMATE.start_substring_~pt~0.base=v_ULTIMATE.start_substring_~pt~0.base_6, #valid=|v_#valid_17|, #memory_int=|v_#memory_int_7|, #length=|v_#length_12|, ULTIMATE.start_substring_~pt~0.offset=v_ULTIMATE.start_substring_~pt~0.offset_5} AuxVars[] AssignedVars[ULTIMATE.start_substring_#t~mem1] 337#L11-1 [175] L11-1-->L11-2: Formula: (and |v_ULTIMATE.start_substring_#t~short4_2| (< 0 |v_ULTIMATE.start_substring_#t~mem1_3|)) InVars {ULTIMATE.start_substring_#t~mem1=|v_ULTIMATE.start_substring_#t~mem1_3|} OutVars{ULTIMATE.start_substring_#t~mem1=|v_ULTIMATE.start_substring_#t~mem1_3|, ULTIMATE.start_substring_#t~short4=|v_ULTIMATE.start_substring_#t~short4_2|} AuxVars[] AssignedVars[ULTIMATE.start_substring_#t~short4] 320#L11-2 [90] L11-2-->L11-3: Formula: |v_ULTIMATE.start_substring_#t~short4_3| InVars {ULTIMATE.start_substring_#t~short4=|v_ULTIMATE.start_substring_#t~short4_3|} OutVars{ULTIMATE.start_substring_#t~short4=|v_ULTIMATE.start_substring_#t~short4_3|} AuxVars[] AssignedVars[] 334#L11-3 [87] L11-3-->L11-4: Formula: (and (<= (+ v_ULTIMATE.start_substring_~pt~0.offset_7 1) (select |v_#length_14| v_ULTIMATE.start_substring_~pt~0.base_9)) (= 1 (select |v_#valid_19| v_ULTIMATE.start_substring_~pt~0.base_9)) (<= 0 v_ULTIMATE.start_substring_~pt~0.offset_7) (= (select (select |v_#memory_int_8| v_ULTIMATE.start_substring_~pt~0.base_9) v_ULTIMATE.start_substring_~pt~0.offset_7) |v_ULTIMATE.start_substring_#t~mem2_2|)) InVars {#memory_int=|v_#memory_int_8|, #length=|v_#length_14|, ULTIMATE.start_substring_~pt~0.offset=v_ULTIMATE.start_substring_~pt~0.offset_7, ULTIMATE.start_substring_~pt~0.base=v_ULTIMATE.start_substring_~pt~0.base_9, #valid=|v_#valid_19|} OutVars{ULTIMATE.start_substring_#t~mem2=|v_ULTIMATE.start_substring_#t~mem2_2|, ULTIMATE.start_substring_~pt~0.base=v_ULTIMATE.start_substring_~pt~0.base_9, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_8|, #length=|v_#length_14|, ULTIMATE.start_substring_~pt~0.offset=v_ULTIMATE.start_substring_~pt~0.offset_7} AuxVars[] AssignedVars[ULTIMATE.start_substring_#t~mem2] 331#L11-4 [83] L11-4-->L11-5: Formula: (and (= (select |v_#valid_21| v_ULTIMATE.start_substring_~ps2~0.base_3) 1) (<= (+ v_ULTIMATE.start_substring_~ps2~0.offset_3 1) (select |v_#length_16| v_ULTIMATE.start_substring_~ps2~0.base_3)) (<= 0 v_ULTIMATE.start_substring_~ps2~0.offset_3) (= (select (select |v_#memory_int_9| v_ULTIMATE.start_substring_~ps2~0.base_3) v_ULTIMATE.start_substring_~ps2~0.offset_3) |v_ULTIMATE.start_substring_#t~mem3_2|)) InVars {#memory_int=|v_#memory_int_9|, #length=|v_#length_16|, ULTIMATE.start_substring_~ps2~0.base=v_ULTIMATE.start_substring_~ps2~0.base_3, ULTIMATE.start_substring_~ps2~0.offset=v_ULTIMATE.start_substring_~ps2~0.offset_3, #valid=|v_#valid_21|} OutVars{ULTIMATE.start_substring_#t~mem3=|v_ULTIMATE.start_substring_#t~mem3_2|, ULTIMATE.start_substring_~ps2~0.offset=v_ULTIMATE.start_substring_~ps2~0.offset_3, #valid=|v_#valid_21|, #memory_int=|v_#memory_int_9|, #length=|v_#length_16|, ULTIMATE.start_substring_~ps2~0.base=v_ULTIMATE.start_substring_~ps2~0.base_3} AuxVars[] AssignedVars[ULTIMATE.start_substring_#t~mem3] 329#L11-5 [187] L11-5-->L11-7: Formula: (and (not |v_ULTIMATE.start_substring_#t~short4_4|) (< |v_ULTIMATE.start_substring_#t~mem3_3| |v_ULTIMATE.start_substring_#t~mem2_3|)) InVars {ULTIMATE.start_substring_#t~mem2=|v_ULTIMATE.start_substring_#t~mem2_3|, ULTIMATE.start_substring_#t~mem3=|v_ULTIMATE.start_substring_#t~mem3_3|} OutVars{ULTIMATE.start_substring_#t~mem3=|v_ULTIMATE.start_substring_#t~mem3_3|, ULTIMATE.start_substring_#t~mem2=|v_ULTIMATE.start_substring_#t~mem2_3|, ULTIMATE.start_substring_#t~short4=|v_ULTIMATE.start_substring_#t~short4_4|} AuxVars[] AssignedVars[ULTIMATE.start_substring_#t~short4] 327#L11-7 [108] L11-7-->L11-10: Formula: (not |v_ULTIMATE.start_substring_#t~short4_7|) InVars {ULTIMATE.start_substring_#t~short4=|v_ULTIMATE.start_substring_#t~short4_7|} OutVars{ULTIMATE.start_substring_#t~mem3=|v_ULTIMATE.start_substring_#t~mem3_4|, ULTIMATE.start_substring_#t~mem2=|v_ULTIMATE.start_substring_#t~mem2_4|, ULTIMATE.start_substring_#t~mem1=|v_ULTIMATE.start_substring_#t~mem1_4|, ULTIMATE.start_substring_#t~short4=|v_ULTIMATE.start_substring_#t~short4_6|} AuxVars[] AssignedVars[ULTIMATE.start_substring_#t~mem3, ULTIMATE.start_substring_#t~mem2, ULTIMATE.start_substring_#t~mem1, ULTIMATE.start_substring_#t~short4] 326#L11-10 [99] L11-10-->L15: Formula: (and (= (select |v_#valid_3| v_ULTIMATE.start_substring_~pt~0.base_1) 1) (<= (+ v_ULTIMATE.start_substring_~pt~0.offset_1 1) (select |v_#length_1| v_ULTIMATE.start_substring_~pt~0.base_1)) (= (select (select |v_#memory_int_1| v_ULTIMATE.start_substring_~pt~0.base_1) v_ULTIMATE.start_substring_~pt~0.offset_1) |v_ULTIMATE.start_substring_#t~mem7_1|) (<= 0 v_ULTIMATE.start_substring_~pt~0.offset_1)) InVars {#memory_int=|v_#memory_int_1|, #length=|v_#length_1|, ULTIMATE.start_substring_~pt~0.offset=v_ULTIMATE.start_substring_~pt~0.offset_1, ULTIMATE.start_substring_~pt~0.base=v_ULTIMATE.start_substring_~pt~0.base_1, #valid=|v_#valid_3|} OutVars{ULTIMATE.start_substring_~pt~0.base=v_ULTIMATE.start_substring_~pt~0.base_1, #valid=|v_#valid_3|, #memory_int=|v_#memory_int_1|, #length=|v_#length_1|, ULTIMATE.start_substring_~pt~0.offset=v_ULTIMATE.start_substring_~pt~0.offset_1, ULTIMATE.start_substring_#t~mem7=|v_ULTIMATE.start_substring_#t~mem7_1|} AuxVars[] AssignedVars[ULTIMATE.start_substring_#t~mem7] 304#L15 [177] L15-->L8-3: Formula: (and (= (+ v_ULTIMATE.start_substring_~ps~0.offset_2 1) v_ULTIMATE.start_substring_~ps~0.offset_1) (= v_ULTIMATE.start_substring_~ps~0.base_2 v_ULTIMATE.start_substring_~ps~0.base_1) (< 0 |v_ULTIMATE.start_substring_#t~mem7_5|)) InVars {ULTIMATE.start_substring_~ps~0.offset=v_ULTIMATE.start_substring_~ps~0.offset_2, ULTIMATE.start_substring_~ps~0.base=v_ULTIMATE.start_substring_~ps~0.base_2, ULTIMATE.start_substring_#t~mem7=|v_ULTIMATE.start_substring_#t~mem7_5|} OutVars{ULTIMATE.start_substring_~ps~0.offset=v_ULTIMATE.start_substring_~ps~0.offset_1, ULTIMATE.start_substring_#t~post8.base=|v_ULTIMATE.start_substring_#t~post8.base_1|, ULTIMATE.start_substring_#t~post8.offset=|v_ULTIMATE.start_substring_#t~post8.offset_1|, ULTIMATE.start_substring_~ps~0.base=v_ULTIMATE.start_substring_~ps~0.base_1, ULTIMATE.start_substring_#t~mem7=|v_ULTIMATE.start_substring_#t~mem7_4|} AuxVars[] AssignedVars[ULTIMATE.start_substring_#t~post8.base, ULTIMATE.start_substring_~ps~0.offset, ULTIMATE.start_substring_#t~post8.offset, ULTIMATE.start_substring_~ps~0.base, ULTIMATE.start_substring_#t~mem7] 305#L8-3 172.54/109.72 [2019-03-28 12:36:35,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 172.54/109.72 [2019-03-28 12:36:35,879 INFO L82 PathProgramCache]: Analyzing trace with hash 2123740343, now seen corresponding path program 5 times 172.54/109.72 [2019-03-28 12:36:35,879 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 172.54/109.72 [2019-03-28 12:36:35,879 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 172.54/109.72 [2019-03-28 12:36:35,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 172.54/109.72 [2019-03-28 12:36:35,880 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 172.54/109.72 [2019-03-28 12:36:35,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 172.54/109.72 [2019-03-28 12:36:35,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 172.54/109.72 [2019-03-28 12:36:35,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 172.54/109.72 [2019-03-28 12:36:35,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 172.54/109.72 [2019-03-28 12:36:35,891 INFO L82 PathProgramCache]: Analyzing trace with hash 674012762, now seen corresponding path program 1 times 172.54/109.72 [2019-03-28 12:36:35,891 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 172.54/109.72 [2019-03-28 12:36:35,891 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 172.54/109.72 [2019-03-28 12:36:35,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 172.54/109.72 [2019-03-28 12:36:35,892 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 172.54/109.72 [2019-03-28 12:36:35,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 172.54/109.72 [2019-03-28 12:36:35,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 172.54/109.72 [2019-03-28 12:36:35,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 172.54/109.72 [2019-03-28 12:36:35,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 172.54/109.72 [2019-03-28 12:36:35,901 INFO L82 PathProgramCache]: Analyzing trace with hash -1962279964, now seen corresponding path program 1 times 172.54/109.72 [2019-03-28 12:36:35,901 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 172.54/109.72 [2019-03-28 12:36:35,901 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 172.54/109.72 [2019-03-28 12:36:35,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 172.54/109.72 [2019-03-28 12:36:35,902 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 172.54/109.72 [2019-03-28 12:36:35,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 172.54/109.72 [2019-03-28 12:36:35,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 172.54/109.72 [2019-03-28 12:36:35,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 172.54/109.72 [2019-03-28 12:36:36,058 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 55 172.54/109.72 [2019-03-28 12:36:36,338 WARN L188 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 82 172.54/109.72 [2019-03-28 12:36:36,450 INFO L216 LassoAnalysis]: Preferences: 172.54/109.72 [2019-03-28 12:36:36,451 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 172.54/109.72 [2019-03-28 12:36:36,452 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 172.54/109.72 [2019-03-28 12:36:36,452 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 172.54/109.72 [2019-03-28 12:36:36,452 INFO L127 ssoRankerPreferences]: Use exernal solver: false 172.54/109.72 [2019-03-28 12:36:36,452 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 172.54/109.72 [2019-03-28 12:36:36,452 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 172.54/109.72 [2019-03-28 12:36:36,452 INFO L130 ssoRankerPreferences]: Path of dumped script: 172.54/109.72 [2019-03-28 12:36:36,453 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration5_Lasso 172.54/109.72 [2019-03-28 12:36:36,453 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 172.54/109.72 [2019-03-28 12:36:36,453 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 172.54/109.72 [2019-03-28 12:36:36,471 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 172.54/109.72 [2019-03-28 12:36:36,477 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 172.54/109.72 [2019-03-28 12:36:36,480 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 172.54/109.72 [2019-03-28 12:36:36,482 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 172.54/109.72 [2019-03-28 12:36:36,484 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 172.54/109.72 [2019-03-28 12:36:36,774 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 65 172.54/109.72 [2019-03-28 12:36:36,883 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 172.54/109.72 [2019-03-28 12:36:36,885 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 172.54/109.72 [2019-03-28 12:36:36,886 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 172.54/109.72 [2019-03-28 12:36:36,888 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 172.54/109.72 [2019-03-28 12:36:36,890 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 172.54/109.72 [2019-03-28 12:36:36,892 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 172.54/109.72 [2019-03-28 12:36:36,893 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 172.54/109.72 [2019-03-28 12:36:36,895 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 172.54/109.72 [2019-03-28 12:36:36,896 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 172.54/109.72 [2019-03-28 12:36:36,898 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 172.54/109.72 [2019-03-28 12:36:36,899 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 172.54/109.72 [2019-03-28 12:36:36,900 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 172.54/109.72 [2019-03-28 12:36:36,902 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 172.54/109.72 [2019-03-28 12:36:36,903 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 172.54/109.72 [2019-03-28 12:36:36,904 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 172.54/109.72 [2019-03-28 12:36:37,256 INFO L300 LassoAnalysis]: Preprocessing complete. 172.54/109.72 [2019-03-28 12:36:37,262 INFO L497 LassoAnalysis]: Using template 'affine'. 172.54/109.72 [2019-03-28 12:36:37,264 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 172.54/109.72 Termination analysis: LINEAR_WITH_GUESSES 172.54/109.72 Number of strict supporting invariants: 0 172.54/109.72 Number of non-strict supporting invariants: 1 172.54/109.72 Consider only non-deceasing supporting invariants: true 172.54/109.72 Simplify termination arguments: true 172.54/109.72 Simplify supporting invariants: trueOverapproximate stem: false 172.54/109.72 [2019-03-28 12:36:37,266 INFO L339 nArgumentSynthesizer]: Template has degree 0. 172.54/109.72 [2019-03-28 12:36:37,266 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 172.54/109.72 [2019-03-28 12:36:37,267 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 172.54/109.72 [2019-03-28 12:36:37,267 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 172.54/109.72 [2019-03-28 12:36:37,267 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 172.54/109.72 [2019-03-28 12:36:37,269 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 172.54/109.72 [2019-03-28 12:36:37,269 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 172.54/109.72 [2019-03-28 12:36:37,271 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 172.54/109.72 [2019-03-28 12:36:37,271 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 172.54/109.72 Termination analysis: LINEAR_WITH_GUESSES 172.54/109.72 Number of strict supporting invariants: 0 172.54/109.72 Number of non-strict supporting invariants: 1 172.54/109.72 Consider only non-deceasing supporting invariants: true 172.54/109.72 Simplify termination arguments: true 172.54/109.72 Simplify supporting invariants: trueOverapproximate stem: false 172.54/109.72 [2019-03-28 12:36:37,272 INFO L339 nArgumentSynthesizer]: Template has degree 0. 172.54/109.72 [2019-03-28 12:36:37,272 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 172.54/109.72 [2019-03-28 12:36:37,272 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 172.54/109.72 [2019-03-28 12:36:37,272 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 172.54/109.72 [2019-03-28 12:36:37,275 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 172.54/109.72 [2019-03-28 12:36:37,275 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 172.54/109.72 [2019-03-28 12:36:37,277 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 172.54/109.72 [2019-03-28 12:36:37,277 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 172.54/109.72 Termination analysis: LINEAR_WITH_GUESSES 172.54/109.72 Number of strict supporting invariants: 0 172.54/109.72 Number of non-strict supporting invariants: 1 172.54/109.72 Consider only non-deceasing supporting invariants: true 172.54/109.72 Simplify termination arguments: true 172.54/109.72 Simplify supporting invariants: trueOverapproximate stem: false 172.54/109.72 [2019-03-28 12:36:37,278 INFO L339 nArgumentSynthesizer]: Template has degree 0. 172.54/109.72 [2019-03-28 12:36:37,278 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 172.54/109.72 [2019-03-28 12:36:37,278 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 172.54/109.72 [2019-03-28 12:36:37,278 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 172.54/109.72 [2019-03-28 12:36:37,278 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 172.54/109.72 [2019-03-28 12:36:37,279 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 172.54/109.72 [2019-03-28 12:36:37,279 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 172.54/109.72 [2019-03-28 12:36:37,280 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 172.54/109.72 [2019-03-28 12:36:37,280 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 172.54/109.72 Termination analysis: LINEAR_WITH_GUESSES 172.54/109.72 Number of strict supporting invariants: 0 172.54/109.72 Number of non-strict supporting invariants: 1 172.54/109.72 Consider only non-deceasing supporting invariants: true 172.54/109.72 Simplify termination arguments: true 172.54/109.72 Simplify supporting invariants: trueOverapproximate stem: false 172.54/109.72 [2019-03-28 12:36:37,280 INFO L339 nArgumentSynthesizer]: Template has degree 0. 172.54/109.72 [2019-03-28 12:36:37,280 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 172.54/109.72 [2019-03-28 12:36:37,281 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 172.54/109.72 [2019-03-28 12:36:37,281 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 172.54/109.72 [2019-03-28 12:36:37,281 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 172.54/109.72 [2019-03-28 12:36:37,281 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 172.54/109.72 [2019-03-28 12:36:37,281 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 172.54/109.72 [2019-03-28 12:36:37,282 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 172.54/109.72 [2019-03-28 12:36:37,282 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 172.54/109.72 Termination analysis: LINEAR_WITH_GUESSES 172.54/109.72 Number of strict supporting invariants: 0 172.54/109.72 Number of non-strict supporting invariants: 1 172.54/109.72 Consider only non-deceasing supporting invariants: true 172.54/109.72 Simplify termination arguments: true 172.54/109.72 Simplify supporting invariants: trueOverapproximate stem: false 172.54/109.72 [2019-03-28 12:36:37,282 INFO L339 nArgumentSynthesizer]: Template has degree 0. 172.54/109.72 [2019-03-28 12:36:37,283 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 172.54/109.72 [2019-03-28 12:36:37,283 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 172.54/109.72 [2019-03-28 12:36:37,283 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 172.54/109.72 [2019-03-28 12:36:37,285 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 172.54/109.72 [2019-03-28 12:36:37,285 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 172.54/109.72 [2019-03-28 12:36:37,288 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 172.54/109.72 [2019-03-28 12:36:37,289 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 172.54/109.72 Termination analysis: LINEAR_WITH_GUESSES 172.54/109.72 Number of strict supporting invariants: 0 172.54/109.72 Number of non-strict supporting invariants: 1 172.54/109.72 Consider only non-deceasing supporting invariants: true 172.54/109.72 Simplify termination arguments: true 172.54/109.72 Simplify supporting invariants: trueOverapproximate stem: false 172.54/109.72 [2019-03-28 12:36:37,289 INFO L339 nArgumentSynthesizer]: Template has degree 0. 172.54/109.72 [2019-03-28 12:36:37,289 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 172.54/109.72 [2019-03-28 12:36:37,289 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 172.54/109.72 [2019-03-28 12:36:37,290 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 172.54/109.72 [2019-03-28 12:36:37,298 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 172.54/109.72 [2019-03-28 12:36:37,298 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 172.54/109.72 [2019-03-28 12:36:37,305 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 172.54/109.72 [2019-03-28 12:36:37,306 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 172.54/109.72 Termination analysis: LINEAR_WITH_GUESSES 172.54/109.72 Number of strict supporting invariants: 0 172.54/109.72 Number of non-strict supporting invariants: 1 172.54/109.72 Consider only non-deceasing supporting invariants: true 172.54/109.72 Simplify termination arguments: true 172.54/109.72 Simplify supporting invariants: trueOverapproximate stem: false 172.54/109.72 [2019-03-28 12:36:37,306 INFO L339 nArgumentSynthesizer]: Template has degree 0. 172.54/109.72 [2019-03-28 12:36:37,306 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 172.54/109.72 [2019-03-28 12:36:37,307 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 172.54/109.72 [2019-03-28 12:36:37,307 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 172.54/109.72 [2019-03-28 12:36:37,307 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 172.54/109.72 [2019-03-28 12:36:37,308 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 172.54/109.72 [2019-03-28 12:36:37,308 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 172.54/109.72 [2019-03-28 12:36:37,310 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 172.54/109.72 [2019-03-28 12:36:37,310 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 172.54/109.72 Termination analysis: LINEAR_WITH_GUESSES 172.54/109.72 Number of strict supporting invariants: 0 172.54/109.72 Number of non-strict supporting invariants: 1 172.54/109.72 Consider only non-deceasing supporting invariants: true 172.54/109.72 Simplify termination arguments: true 172.54/109.72 Simplify supporting invariants: trueOverapproximate stem: false 172.54/109.72 [2019-03-28 12:36:37,311 INFO L339 nArgumentSynthesizer]: Template has degree 0. 172.54/109.72 [2019-03-28 12:36:37,311 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 172.54/109.72 [2019-03-28 12:36:37,311 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 172.54/109.72 [2019-03-28 12:36:37,311 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 172.54/109.72 [2019-03-28 12:36:37,312 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 172.54/109.72 [2019-03-28 12:36:37,313 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 172.54/109.72 [2019-03-28 12:36:37,314 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 172.54/109.72 [2019-03-28 12:36:37,315 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 172.54/109.72 Termination analysis: LINEAR_WITH_GUESSES 172.54/109.72 Number of strict supporting invariants: 0 172.54/109.72 Number of non-strict supporting invariants: 1 172.54/109.72 Consider only non-deceasing supporting invariants: true 172.54/109.72 Simplify termination arguments: true 172.54/109.72 Simplify supporting invariants: trueOverapproximate stem: false 172.54/109.72 [2019-03-28 12:36:37,315 INFO L339 nArgumentSynthesizer]: Template has degree 0. 172.54/109.72 [2019-03-28 12:36:37,315 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 172.54/109.72 [2019-03-28 12:36:37,315 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 172.54/109.72 [2019-03-28 12:36:37,316 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 172.54/109.72 [2019-03-28 12:36:37,317 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 172.54/109.72 [2019-03-28 12:36:37,317 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 172.54/109.72 [2019-03-28 12:36:37,319 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 172.54/109.72 [2019-03-28 12:36:37,319 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 172.54/109.72 Termination analysis: LINEAR_WITH_GUESSES 172.54/109.72 Number of strict supporting invariants: 0 172.54/109.72 Number of non-strict supporting invariants: 1 172.54/109.72 Consider only non-deceasing supporting invariants: true 172.54/109.72 Simplify termination arguments: true 172.54/109.72 Simplify supporting invariants: trueOverapproximate stem: false 172.54/109.72 [2019-03-28 12:36:37,320 INFO L339 nArgumentSynthesizer]: Template has degree 0. 172.54/109.72 [2019-03-28 12:36:37,320 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 172.54/109.72 [2019-03-28 12:36:37,320 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 172.54/109.72 [2019-03-28 12:36:37,320 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 172.54/109.72 [2019-03-28 12:36:37,321 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 172.54/109.72 [2019-03-28 12:36:37,321 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 172.54/109.72 [2019-03-28 12:36:37,322 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 172.54/109.72 [2019-03-28 12:36:37,323 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 172.54/109.72 Termination analysis: LINEAR_WITH_GUESSES 172.54/109.72 Number of strict supporting invariants: 0 172.54/109.72 Number of non-strict supporting invariants: 1 172.54/109.72 Consider only non-deceasing supporting invariants: true 172.54/109.72 Simplify termination arguments: true 172.54/109.72 Simplify supporting invariants: trueOverapproximate stem: false 172.54/109.72 [2019-03-28 12:36:37,324 INFO L339 nArgumentSynthesizer]: Template has degree 0. 172.54/109.72 [2019-03-28 12:36:37,324 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 172.54/109.72 [2019-03-28 12:36:37,324 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 172.54/109.72 [2019-03-28 12:36:37,324 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 172.54/109.72 [2019-03-28 12:36:37,328 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 172.54/109.72 [2019-03-28 12:36:37,328 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 172.54/109.72 [2019-03-28 12:36:37,337 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 172.54/109.72 [2019-03-28 12:36:37,338 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 172.54/109.72 Termination analysis: LINEAR_WITH_GUESSES 172.54/109.72 Number of strict supporting invariants: 0 172.54/109.72 Number of non-strict supporting invariants: 1 172.54/109.72 Consider only non-deceasing supporting invariants: true 172.54/109.72 Simplify termination arguments: true 172.54/109.72 Simplify supporting invariants: trueOverapproximate stem: false 172.54/109.72 [2019-03-28 12:36:37,338 INFO L339 nArgumentSynthesizer]: Template has degree 0. 172.54/109.72 [2019-03-28 12:36:37,338 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 172.54/109.72 [2019-03-28 12:36:37,338 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 172.54/109.72 [2019-03-28 12:36:37,339 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 172.54/109.72 [2019-03-28 12:36:37,339 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 172.54/109.72 [2019-03-28 12:36:37,339 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 172.54/109.72 [2019-03-28 12:36:37,339 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 172.54/109.72 [2019-03-28 12:36:37,340 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 172.54/109.72 [2019-03-28 12:36:37,340 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 172.54/109.72 Termination analysis: LINEAR_WITH_GUESSES 172.54/109.72 Number of strict supporting invariants: 0 172.54/109.72 Number of non-strict supporting invariants: 1 172.54/109.72 Consider only non-deceasing supporting invariants: true 172.54/109.72 Simplify termination arguments: true 172.54/109.72 Simplify supporting invariants: trueOverapproximate stem: false 172.54/109.72 [2019-03-28 12:36:37,341 INFO L339 nArgumentSynthesizer]: Template has degree 0. 172.54/109.72 [2019-03-28 12:36:37,341 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 172.54/109.72 [2019-03-28 12:36:37,341 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 172.54/109.72 [2019-03-28 12:36:37,341 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 172.54/109.72 [2019-03-28 12:36:37,344 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 172.54/109.72 [2019-03-28 12:36:37,344 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 172.54/109.72 [2019-03-28 12:36:37,359 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 172.54/109.72 [2019-03-28 12:36:37,377 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. 172.54/109.72 [2019-03-28 12:36:37,377 INFO L444 ModelExtractionUtils]: 26 out of 31 variables were initially zero. Simplification set additionally 2 variables to zero. 172.54/109.72 [2019-03-28 12:36:37,380 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 172.54/109.72 [2019-03-28 12:36:37,381 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. 172.54/109.72 [2019-03-28 12:36:37,381 INFO L518 LassoAnalysis]: Proved termination. 172.54/109.72 [2019-03-28 12:36:37,382 INFO L520 LassoAnalysis]: Termination argument consisting of: 172.54/109.72 Ranking function f(ULTIMATE.start_substring_~ps~0.offset, v_rep(select #length ULTIMATE.start_main_#t~malloc11.base)_1) = -1*ULTIMATE.start_substring_~ps~0.offset + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc11.base)_1 172.54/109.72 Supporting invariants [] 172.54/109.72 [2019-03-28 12:36:37,410 INFO L297 tatePredicateManager]: 8 out of 9 supporting invariants were superfluous and have been removed 172.54/109.72 [2019-03-28 12:36:37,413 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.54/109.72 [2019-03-28 12:36:37,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 172.54/109.72 [2019-03-28 12:36:37,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 172.54/109.72 [2019-03-28 12:36:37,458 INFO L256 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 10 conjunts are in the unsatisfiable core 172.54/109.72 [2019-03-28 12:36:37,458 INFO L279 TraceCheckSpWp]: Computing forward predicates... 172.54/109.72 [2019-03-28 12:36:37,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 172.54/109.72 [2019-03-28 12:36:37,484 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 8 conjunts are in the unsatisfiable core 172.54/109.72 [2019-03-28 12:36:37,485 INFO L279 TraceCheckSpWp]: Computing forward predicates... 172.54/109.72 [2019-03-28 12:36:37,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 172.54/109.72 [2019-03-28 12:36:37,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 172.54/109.72 [2019-03-28 12:36:37,565 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 8 conjunts are in the unsatisfiable core 172.54/109.72 [2019-03-28 12:36:37,566 INFO L279 TraceCheckSpWp]: Computing forward predicates... 172.54/109.72 [2019-03-28 12:36:37,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 172.54/109.72 [2019-03-28 12:36:37,635 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 8 conjunts are in the unsatisfiable core 172.54/109.72 [2019-03-28 12:36:37,636 INFO L279 TraceCheckSpWp]: Computing forward predicates... 172.54/109.72 [2019-03-28 12:36:37,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 172.54/109.72 [2019-03-28 12:36:37,652 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 8 conjunts are in the unsatisfiable core 172.54/109.72 [2019-03-28 12:36:37,653 INFO L279 TraceCheckSpWp]: Computing forward predicates... 172.54/109.72 [2019-03-28 12:36:37,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 172.54/109.72 [2019-03-28 12:36:37,669 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 8 conjunts are in the unsatisfiable core 172.54/109.72 [2019-03-28 12:36:37,669 INFO L279 TraceCheckSpWp]: Computing forward predicates... 172.54/109.72 [2019-03-28 12:36:37,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 172.54/109.72 [2019-03-28 12:36:37,686 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 8 conjunts are in the unsatisfiable core 172.54/109.72 [2019-03-28 12:36:37,687 INFO L279 TraceCheckSpWp]: Computing forward predicates... 172.54/109.72 [2019-03-28 12:36:37,689 INFO L98 LoopCannibalizer]: 3 predicates before loop cannibalization 4 predicates after loop cannibalization 172.54/109.72 [2019-03-28 12:36:37,693 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 4 loop predicates 172.54/109.72 [2019-03-28 12:36:37,694 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 35 states and 55 transitions. cyclomatic complexity: 21 Second operand 4 states. 172.54/109.72 [2019-03-28 12:36:37,817 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 35 states and 55 transitions. cyclomatic complexity: 21. Second operand 4 states. Result 64 states and 98 transitions. Complement of second has 5 states. 172.54/109.72 [2019-03-28 12:36:37,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states 172.54/109.72 [2019-03-28 12:36:37,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. 172.54/109.72 [2019-03-28 12:36:37,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 50 transitions. 172.54/109.72 [2019-03-28 12:36:37,820 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 50 transitions. Stem has 6 letters. Loop has 11 letters. 172.54/109.72 [2019-03-28 12:36:37,820 INFO L116 BuchiAccepts]: Finished buchiAccepts. 172.54/109.72 [2019-03-28 12:36:37,820 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 50 transitions. Stem has 17 letters. Loop has 11 letters. 172.54/109.72 [2019-03-28 12:36:37,821 INFO L116 BuchiAccepts]: Finished buchiAccepts. 172.54/109.72 [2019-03-28 12:36:37,821 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 50 transitions. Stem has 6 letters. Loop has 22 letters. 172.54/109.72 [2019-03-28 12:36:37,821 INFO L116 BuchiAccepts]: Finished buchiAccepts. 172.54/109.72 [2019-03-28 12:36:37,830 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 64 states and 98 transitions. 172.54/109.72 [2019-03-28 12:36:37,832 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 17 172.54/109.72 [2019-03-28 12:36:37,832 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 64 states to 60 states and 94 transitions. 172.54/109.72 [2019-03-28 12:36:37,832 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 172.54/109.72 [2019-03-28 12:36:37,833 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 31 172.54/109.72 [2019-03-28 12:36:37,833 INFO L73 IsDeterministic]: Start isDeterministic. Operand 60 states and 94 transitions. 172.54/109.72 [2019-03-28 12:36:37,833 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 172.54/109.72 [2019-03-28 12:36:37,833 INFO L706 BuchiCegarLoop]: Abstraction has 60 states and 94 transitions. 172.54/109.72 [2019-03-28 12:36:37,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states and 94 transitions. 172.54/109.72 [2019-03-28 12:36:37,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 51. 172.54/109.72 [2019-03-28 12:36:37,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. 172.54/109.72 [2019-03-28 12:36:37,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 81 transitions. 172.54/109.72 [2019-03-28 12:36:37,835 INFO L729 BuchiCegarLoop]: Abstraction has 51 states and 81 transitions. 172.54/109.72 [2019-03-28 12:36:37,835 INFO L609 BuchiCegarLoop]: Abstraction has 51 states and 81 transitions. 172.54/109.72 [2019-03-28 12:36:37,835 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ 172.54/109.72 [2019-03-28 12:36:37,836 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 51 states and 81 transitions. 172.54/109.72 [2019-03-28 12:36:37,836 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 172.54/109.72 [2019-03-28 12:36:37,836 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 172.54/109.72 [2019-03-28 12:36:37,836 INFO L119 BuchiIsEmpty]: Starting construction of run 172.54/109.72 [2019-03-28 12:36:37,837 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] 172.54/109.72 [2019-03-28 12:36:37,837 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] 172.54/109.72 [2019-03-28 12:36:37,838 INFO L794 eck$LassoCheckResult]: Stem: 702#ULTIMATE.startENTRY [189] ULTIMATE.startENTRY-->L24: Formula: (and (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|) (= |v_#valid_23| (store |v_#valid_24| 0 0))) InVars {#valid=|v_#valid_24|} OutVars{ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_6|, ULTIMATE.start_main_#t~malloc11.offset=|v_ULTIMATE.start_main_#t~malloc11.offset_5|, ULTIMATE.start_main_#t~nondet9=|v_ULTIMATE.start_main_#t~nondet9_6|, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_10, ULTIMATE.start_main_#t~malloc12.base=|v_ULTIMATE.start_main_#t~malloc12.base_5|, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~malloc11.base=|v_ULTIMATE.start_main_#t~malloc11.base_5|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_7, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_6, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~malloc12.offset=|v_ULTIMATE.start_main_#t~malloc12.offset_5|, ULTIMATE.start_main_#t~ret13=|v_ULTIMATE.start_main_#t~ret13_4|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, #valid=|v_#valid_23|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_6, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10, ULTIMATE.start_main_#t~malloc11.offset, ULTIMATE.start_main_#t~nondet9, ULTIMATE.start_main_~length1~0, ULTIMATE.start_main_#t~malloc12.base, #NULL.offset, ULTIMATE.start_main_#t~malloc11.base, ULTIMATE.start_main_~nondetString2~0.base, ULTIMATE.start_main_~nondetString2~0.offset, #NULL.base, ULTIMATE.start_main_#t~malloc12.offset, ULTIMATE.start_main_#t~ret13, ULTIMATE.start_main_~nondetString1~0.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_~nondetString1~0.offset, ULTIMATE.start_main_~length2~0] 703#L24 [126] L24-->L24-2: Formula: (>= v_ULTIMATE.start_main_~length1~0_6 1) InVars {ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_6} OutVars{ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_6} AuxVars[] AssignedVars[] 704#L24-2 [127] L24-2-->L27-1: Formula: (>= v_ULTIMATE.start_main_~length2~0_6 1) InVars {ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_6} OutVars{ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_6} AuxVars[] AssignedVars[] 676#L27-1 [150] L27-1-->L32: Formula: (let ((.cse0 (store |v_#valid_10| |v_ULTIMATE.start_main_#t~malloc11.base_4| 1))) (and (= v_ULTIMATE.start_main_~nondetString1~0.offset_2 |v_ULTIMATE.start_main_#t~malloc11.offset_4|) (= v_ULTIMATE.start_main_~nondetString2~0.offset_2 |v_ULTIMATE.start_main_#t~malloc12.offset_4|) (= |v_ULTIMATE.start_main_#t~malloc11.offset_4| 0) (= 0 (select |v_#valid_10| |v_ULTIMATE.start_main_#t~malloc11.base_4|)) (> 0 |v_ULTIMATE.start_main_#t~malloc12.base_4|) (= |v_ULTIMATE.start_main_#t~malloc12.offset_4| 0) (= (store .cse0 |v_ULTIMATE.start_main_#t~malloc12.base_4| 1) |v_#valid_8|) (< |v_ULTIMATE.start_main_#t~malloc11.base_4| 0) (= v_ULTIMATE.start_main_~nondetString2~0.base_2 |v_ULTIMATE.start_main_#t~malloc12.base_4|) (= 0 (select .cse0 |v_ULTIMATE.start_main_#t~malloc12.base_4|)) (< |v_ULTIMATE.start_main_#t~malloc12.base_4| |v_#StackHeapBarrier_1|) (< |v_ULTIMATE.start_main_#t~malloc11.base_4| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_main_~nondetString1~0.base_2 |v_ULTIMATE.start_main_#t~malloc11.base_4|) (= |v_#length_3| (store (store |v_#length_5| |v_ULTIMATE.start_main_#t~malloc11.base_4| v_ULTIMATE.start_main_~length1~0_7) |v_ULTIMATE.start_main_#t~malloc12.base_4| v_ULTIMATE.start_main_~length2~0_7)))) InVars {ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_5|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_7, #valid=|v_#valid_10|} OutVars{ULTIMATE.start_main_#t~malloc11.offset=|v_ULTIMATE.start_main_#t~malloc11.offset_4|, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_7, ULTIMATE.start_main_#t~malloc12.base=|v_ULTIMATE.start_main_#t~malloc12.base_4|, ULTIMATE.start_main_#t~malloc11.base=|v_ULTIMATE.start_main_#t~malloc11.base_4|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_2, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_2, ULTIMATE.start_main_#t~malloc12.offset=|v_ULTIMATE.start_main_#t~malloc12.offset_4|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_2, #valid=|v_#valid_8|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_2, #length=|v_#length_3|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc12.offset, ULTIMATE.start_main_#t~malloc11.offset, ULTIMATE.start_main_~nondetString1~0.base, #valid, ULTIMATE.start_main_#t~malloc12.base, ULTIMATE.start_main_~nondetString1~0.offset, ULTIMATE.start_main_#t~malloc11.base, #length, ULTIMATE.start_main_~nondetString2~0.base, ULTIMATE.start_main_~nondetString2~0.offset] 677#L32 [96] L32-->L32-1: Formula: (let ((.cse0 (+ v_ULTIMATE.start_main_~length1~0_8 v_ULTIMATE.start_main_~nondetString1~0.offset_3))) (and (<= 1 .cse0) (= 1 (select |v_#valid_11| v_ULTIMATE.start_main_~nondetString1~0.base_3)) (= |v_#memory_int_2| (store |v_#memory_int_3| v_ULTIMATE.start_main_~nondetString1~0.base_3 (store (select |v_#memory_int_3| v_ULTIMATE.start_main_~nondetString1~0.base_3) (+ v_ULTIMATE.start_main_~length1~0_8 v_ULTIMATE.start_main_~nondetString1~0.offset_3 (- 1)) 0))) (<= .cse0 (select |v_#length_6| v_ULTIMATE.start_main_~nondetString1~0.base_3)))) InVars {ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_3, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_3|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_3, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_8, #length=|v_#length_6|} OutVars{ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_3, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_3, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_8, #length=|v_#length_6|} AuxVars[] AssignedVars[#memory_int] 696#L32-1 [190] L32-1-->L8-3: Formula: (let ((.cse0 (+ v_ULTIMATE.start_main_~length2~0_11 v_ULTIMATE.start_main_~nondetString2~0.offset_7))) (and (= v_ULTIMATE.start_substring_~ps~0.offset_8 v_ULTIMATE.start_substring_~s.offset_3) (<= 1 .cse0) (= v_ULTIMATE.start_main_~nondetString2~0.base_8 |v_ULTIMATE.start_substring_#in~t.base_2|) (= |v_ULTIMATE.start_substring_#in~s.offset_2| v_ULTIMATE.start_substring_~s.offset_3) (= (select |v_#valid_25| v_ULTIMATE.start_main_~nondetString2~0.base_8) 1) (= |v_ULTIMATE.start_substring_#in~t.base_2| v_ULTIMATE.start_substring_~t.base_4) (= |v_ULTIMATE.start_substring_#in~s.base_2| v_ULTIMATE.start_main_~nondetString1~0.base_8) (= (store |v_#memory_int_11| v_ULTIMATE.start_main_~nondetString2~0.base_8 (store (select |v_#memory_int_11| v_ULTIMATE.start_main_~nondetString2~0.base_8) (+ v_ULTIMATE.start_main_~length2~0_11 v_ULTIMATE.start_main_~nondetString2~0.offset_7 (- 1)) 0)) |v_#memory_int_10|) (= v_ULTIMATE.start_main_~nondetString2~0.offset_7 |v_ULTIMATE.start_substring_#in~t.offset_2|) (= v_ULTIMATE.start_main_~nondetString1~0.offset_7 |v_ULTIMATE.start_substring_#in~s.offset_2|) (= |v_ULTIMATE.start_substring_#in~t.offset_2| v_ULTIMATE.start_substring_~t.offset_4) (= |v_ULTIMATE.start_substring_#in~s.base_2| v_ULTIMATE.start_substring_~s.base_3) (= v_ULTIMATE.start_substring_~s.base_3 v_ULTIMATE.start_substring_~ps~0.base_9) (<= .cse0 (select |v_#length_18| v_ULTIMATE.start_main_~nondetString2~0.base_8)))) InVars {ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_8, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_7, #length=|v_#length_18|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_8, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_7, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_11} OutVars{ULTIMATE.start_substring_#in~t.offset=|v_ULTIMATE.start_substring_#in~t.offset_2|, ULTIMATE.start_substring_~ps~0.offset=v_ULTIMATE.start_substring_~ps~0.offset_8, ULTIMATE.start_substring_#t~post5.offset=|v_ULTIMATE.start_substring_#t~post5.offset_4|, ULTIMATE.start_substring_~ps2~0.base=v_ULTIMATE.start_substring_~ps2~0.base_8, ULTIMATE.start_substring_#t~mem7=|v_ULTIMATE.start_substring_#t~mem7_7|, ULTIMATE.start_substring_~t.offset=v_ULTIMATE.start_substring_~t.offset_4, ULTIMATE.start_substring_#t~mem3=|v_ULTIMATE.start_substring_#t~mem3_6|, ULTIMATE.start_substring_#t~mem2=|v_ULTIMATE.start_substring_#t~mem2_6|, ULTIMATE.start_substring_#t~mem1=|v_ULTIMATE.start_substring_#t~mem1_6|, ULTIMATE.start_substring_#in~s.offset=|v_ULTIMATE.start_substring_#in~s.offset_2|, ULTIMATE.start_substring_#t~mem0=|v_ULTIMATE.start_substring_#t~mem0_7|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_8, ULTIMATE.start_substring_~ps2~0.offset=v_ULTIMATE.start_substring_~ps2~0.offset_7, ULTIMATE.start_substring_~pt~0.base=v_ULTIMATE.start_substring_~pt~0.base_14, ULTIMATE.start_substring_#t~post8.offset=|v_ULTIMATE.start_substring_#t~post8.offset_4|, #length=|v_#length_18|, ULTIMATE.start_substring_~pt~0.offset=v_ULTIMATE.start_substring_~pt~0.offset_11, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_11, ULTIMATE.start_substring_#res=|v_ULTIMATE.start_substring_#res_5|, ULTIMATE.start_substring_#t~post6.offset=|v_ULTIMATE.start_substring_#t~post6.offset_4|, ULTIMATE.start_substring_~t.base=v_ULTIMATE.start_substring_~t.base_4, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_8, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_7, ULTIMATE.start_substring_~s.base=v_ULTIMATE.start_substring_~s.base_3, ULTIMATE.start_substring_#in~t.base=|v_ULTIMATE.start_substring_#in~t.base_2|, ULTIMATE.start_substring_#in~s.base=|v_ULTIMATE.start_substring_#in~s.base_2|, ULTIMATE.start_substring_#t~post6.base=|v_ULTIMATE.start_substring_#t~post6.base_4|, ULTIMATE.start_substring_#t~post8.base=|v_ULTIMATE.start_substring_#t~post8.base_4|, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_10|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_7, ULTIMATE.start_substring_~ps~0.base=v_ULTIMATE.start_substring_~ps~0.base_9, ULTIMATE.start_substring_#t~post5.base=|v_ULTIMATE.start_substring_#t~post5.base_4|, ULTIMATE.start_substring_~s.offset=v_ULTIMATE.start_substring_~s.offset_3, ULTIMATE.start_substring_#t~short4=|v_ULTIMATE.start_substring_#t~short4_10|} AuxVars[] AssignedVars[ULTIMATE.start_substring_#in~t.offset, ULTIMATE.start_substring_~ps~0.offset, ULTIMATE.start_substring_#t~post5.offset, ULTIMATE.start_substring_~ps2~0.base, ULTIMATE.start_substring_#t~mem7, ULTIMATE.start_substring_~t.offset, ULTIMATE.start_substring_#t~mem3, ULTIMATE.start_substring_#t~mem2, ULTIMATE.start_substring_#t~mem1, ULTIMATE.start_substring_#in~s.offset, ULTIMATE.start_substring_#t~mem0, ULTIMATE.start_substring_~ps2~0.offset, ULTIMATE.start_substring_~pt~0.base, ULTIMATE.start_substring_#t~post8.offset, ULTIMATE.start_substring_~pt~0.offset, ULTIMATE.start_substring_#res, ULTIMATE.start_substring_#t~post6.offset, ULTIMATE.start_substring_~t.base, ULTIMATE.start_substring_~s.base, ULTIMATE.start_substring_#in~t.base, ULTIMATE.start_substring_#in~s.base, ULTIMATE.start_substring_#t~post6.base, ULTIMATE.start_substring_#t~post8.base, #memory_int, ULTIMATE.start_substring_~ps~0.base, ULTIMATE.start_substring_#t~post5.base, ULTIMATE.start_substring_~s.offset, ULTIMATE.start_substring_#t~short4] 678#L8-3 [113] L8-3-->L8-1: Formula: (and (= (select (select |v_#memory_int_6| v_ULTIMATE.start_substring_~ps~0.base_5) v_ULTIMATE.start_substring_~ps~0.offset_5) |v_ULTIMATE.start_substring_#t~mem0_2|) (= (select |v_#valid_15| v_ULTIMATE.start_substring_~ps~0.base_5) 1) (<= 0 v_ULTIMATE.start_substring_~ps~0.offset_5) (<= (+ v_ULTIMATE.start_substring_~ps~0.offset_5 1) (select |v_#length_10| v_ULTIMATE.start_substring_~ps~0.base_5))) InVars {ULTIMATE.start_substring_~ps~0.offset=v_ULTIMATE.start_substring_~ps~0.offset_5, #memory_int=|v_#memory_int_6|, #length=|v_#length_10|, ULTIMATE.start_substring_~ps~0.base=v_ULTIMATE.start_substring_~ps~0.base_5, #valid=|v_#valid_15|} OutVars{ULTIMATE.start_substring_#t~mem0=|v_ULTIMATE.start_substring_#t~mem0_2|, #valid=|v_#valid_15|, ULTIMATE.start_substring_~ps~0.offset=v_ULTIMATE.start_substring_~ps~0.offset_5, #memory_int=|v_#memory_int_6|, #length=|v_#length_10|, ULTIMATE.start_substring_~ps~0.base=v_ULTIMATE.start_substring_~ps~0.base_5} AuxVars[] AssignedVars[ULTIMATE.start_substring_#t~mem0] 680#L8-1 [164] L8-1-->L11-9: Formula: (and (= v_ULTIMATE.start_substring_~ps2~0.base_2 v_ULTIMATE.start_substring_~ps~0.base_8) (= v_ULTIMATE.start_substring_~pt~0.offset_4 v_ULTIMATE.start_substring_~t.offset_3) (> 0 |v_ULTIMATE.start_substring_#t~mem0_6|) (= v_ULTIMATE.start_substring_~pt~0.base_5 v_ULTIMATE.start_substring_~t.base_3) (= v_ULTIMATE.start_substring_~ps2~0.offset_2 v_ULTIMATE.start_substring_~ps~0.offset_7)) InVars {ULTIMATE.start_substring_~ps~0.offset=v_ULTIMATE.start_substring_~ps~0.offset_7, ULTIMATE.start_substring_~t.offset=v_ULTIMATE.start_substring_~t.offset_3, ULTIMATE.start_substring_~ps~0.base=v_ULTIMATE.start_substring_~ps~0.base_8, ULTIMATE.start_substring_~t.base=v_ULTIMATE.start_substring_~t.base_3, ULTIMATE.start_substring_#t~mem0=|v_ULTIMATE.start_substring_#t~mem0_6|} OutVars{ULTIMATE.start_substring_~t.offset=v_ULTIMATE.start_substring_~t.offset_3, ULTIMATE.start_substring_#t~mem0=|v_ULTIMATE.start_substring_#t~mem0_5|, ULTIMATE.start_substring_~ps2~0.offset=v_ULTIMATE.start_substring_~ps2~0.offset_2, ULTIMATE.start_substring_~pt~0.base=v_ULTIMATE.start_substring_~pt~0.base_5, ULTIMATE.start_substring_~ps~0.offset=v_ULTIMATE.start_substring_~ps~0.offset_7, ULTIMATE.start_substring_~ps2~0.base=v_ULTIMATE.start_substring_~ps2~0.base_2, ULTIMATE.start_substring_~ps~0.base=v_ULTIMATE.start_substring_~ps~0.base_8, ULTIMATE.start_substring_~t.base=v_ULTIMATE.start_substring_~t.base_3, ULTIMATE.start_substring_~pt~0.offset=v_ULTIMATE.start_substring_~pt~0.offset_4} AuxVars[] AssignedVars[ULTIMATE.start_substring_#t~mem0, ULTIMATE.start_substring_~ps2~0.offset, ULTIMATE.start_substring_~pt~0.base, ULTIMATE.start_substring_~ps2~0.base, ULTIMATE.start_substring_~pt~0.offset] 689#L11-9 172.54/109.72 [2019-03-28 12:36:37,838 INFO L796 eck$LassoCheckResult]: Loop: 689#L11-9 [103] L11-9-->L11-1: Formula: (and (<= 0 v_ULTIMATE.start_substring_~pt~0.offset_5) (<= (+ v_ULTIMATE.start_substring_~pt~0.offset_5 1) (select |v_#length_12| v_ULTIMATE.start_substring_~pt~0.base_6)) (= |v_ULTIMATE.start_substring_#t~mem1_2| (select (select |v_#memory_int_7| v_ULTIMATE.start_substring_~pt~0.base_6) v_ULTIMATE.start_substring_~pt~0.offset_5)) (= (select |v_#valid_17| v_ULTIMATE.start_substring_~pt~0.base_6) 1)) InVars {#memory_int=|v_#memory_int_7|, #length=|v_#length_12|, ULTIMATE.start_substring_~pt~0.offset=v_ULTIMATE.start_substring_~pt~0.offset_5, ULTIMATE.start_substring_~pt~0.base=v_ULTIMATE.start_substring_~pt~0.base_6, #valid=|v_#valid_17|} OutVars{ULTIMATE.start_substring_#t~mem1=|v_ULTIMATE.start_substring_#t~mem1_2|, ULTIMATE.start_substring_~pt~0.base=v_ULTIMATE.start_substring_~pt~0.base_6, #valid=|v_#valid_17|, #memory_int=|v_#memory_int_7|, #length=|v_#length_12|, ULTIMATE.start_substring_~pt~0.offset=v_ULTIMATE.start_substring_~pt~0.offset_5} AuxVars[] AssignedVars[ULTIMATE.start_substring_#t~mem1] 697#L11-1 [173] L11-1-->L11-2: Formula: (and (= 0 |v_ULTIMATE.start_substring_#t~mem1_3|) (not |v_ULTIMATE.start_substring_#t~short4_2|)) InVars {ULTIMATE.start_substring_#t~mem1=|v_ULTIMATE.start_substring_#t~mem1_3|} OutVars{ULTIMATE.start_substring_#t~mem1=|v_ULTIMATE.start_substring_#t~mem1_3|, ULTIMATE.start_substring_#t~short4=|v_ULTIMATE.start_substring_#t~short4_2|} AuxVars[] AssignedVars[ULTIMATE.start_substring_#t~short4] 698#L11-2 [91] L11-2-->L11-7: Formula: (not |v_ULTIMATE.start_substring_#t~short4_5|) InVars {ULTIMATE.start_substring_#t~short4=|v_ULTIMATE.start_substring_#t~short4_5|} OutVars{ULTIMATE.start_substring_#t~short4=|v_ULTIMATE.start_substring_#t~short4_5|} AuxVars[] AssignedVars[] 682#L11-7 [109] L11-7-->L11-9: Formula: (and (= v_ULTIMATE.start_substring_~ps2~0.offset_5 (+ v_ULTIMATE.start_substring_~ps2~0.offset_6 1)) (= v_ULTIMATE.start_substring_~pt~0.base_13 v_ULTIMATE.start_substring_~pt~0.base_12) (= v_ULTIMATE.start_substring_~ps2~0.base_7 v_ULTIMATE.start_substring_~ps2~0.base_6) |v_ULTIMATE.start_substring_#t~short4_9| (= (+ v_ULTIMATE.start_substring_~pt~0.offset_10 1) v_ULTIMATE.start_substring_~pt~0.offset_9)) InVars {ULTIMATE.start_substring_~ps2~0.base=v_ULTIMATE.start_substring_~ps2~0.base_7, ULTIMATE.start_substring_~pt~0.offset=v_ULTIMATE.start_substring_~pt~0.offset_10, ULTIMATE.start_substring_~ps2~0.offset=v_ULTIMATE.start_substring_~ps2~0.offset_6, ULTIMATE.start_substring_~pt~0.base=v_ULTIMATE.start_substring_~pt~0.base_13, ULTIMATE.start_substring_#t~short4=|v_ULTIMATE.start_substring_#t~short4_9|} OutVars{ULTIMATE.start_substring_#t~post6.offset=|v_ULTIMATE.start_substring_#t~post6.offset_2|, ULTIMATE.start_substring_#t~post5.offset=|v_ULTIMATE.start_substring_#t~post5.offset_2|, ULTIMATE.start_substring_~ps2~0.base=v_ULTIMATE.start_substring_~ps2~0.base_6, ULTIMATE.start_substring_#t~post6.base=|v_ULTIMATE.start_substring_#t~post6.base_2|, ULTIMATE.start_substring_#t~mem3=|v_ULTIMATE.start_substring_#t~mem3_5|, ULTIMATE.start_substring_#t~mem2=|v_ULTIMATE.start_substring_#t~mem2_5|, ULTIMATE.start_substring_#t~mem1=|v_ULTIMATE.start_substring_#t~mem1_5|, ULTIMATE.start_substring_~ps2~0.offset=v_ULTIMATE.start_substring_~ps2~0.offset_5, ULTIMATE.start_substring_~pt~0.base=v_ULTIMATE.start_substring_~pt~0.base_12, ULTIMATE.start_substring_#t~post5.base=|v_ULTIMATE.start_substring_#t~post5.base_2|, ULTIMATE.start_substring_~pt~0.offset=v_ULTIMATE.start_substring_~pt~0.offset_9, ULTIMATE.start_substring_#t~short4=|v_ULTIMATE.start_substring_#t~short4_8|} AuxVars[] AssignedVars[ULTIMATE.start_substring_#t~post6.base, ULTIMATE.start_substring_#t~post6.offset, ULTIMATE.start_substring_#t~mem3, ULTIMATE.start_substring_#t~mem2, ULTIMATE.start_substring_#t~mem1, ULTIMATE.start_substring_~ps2~0.offset, ULTIMATE.start_substring_~pt~0.base, ULTIMATE.start_substring_#t~post5.offset, ULTIMATE.start_substring_~ps2~0.base, ULTIMATE.start_substring_#t~post5.base, ULTIMATE.start_substring_~pt~0.offset, ULTIMATE.start_substring_#t~short4] 689#L11-9 172.54/109.72 [2019-03-28 12:36:37,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 172.54/109.72 [2019-03-28 12:36:37,838 INFO L82 PathProgramCache]: Analyzing trace with hash 805007690, now seen corresponding path program 1 times 172.54/109.72 [2019-03-28 12:36:37,839 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 172.54/109.72 [2019-03-28 12:36:37,839 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 172.54/109.72 [2019-03-28 12:36:37,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 172.54/109.72 [2019-03-28 12:36:37,840 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 172.54/109.72 [2019-03-28 12:36:37,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 172.54/109.72 [2019-03-28 12:36:37,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 172.54/109.72 [2019-03-28 12:36:37,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 172.54/109.72 [2019-03-28 12:36:37,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 172.54/109.72 [2019-03-28 12:36:37,855 INFO L82 PathProgramCache]: Analyzing trace with hash 4161177, now seen corresponding path program 1 times 172.54/109.72 [2019-03-28 12:36:37,855 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 172.54/109.72 [2019-03-28 12:36:37,855 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 172.54/109.72 [2019-03-28 12:36:37,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 172.54/109.72 [2019-03-28 12:36:37,856 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 172.54/109.72 [2019-03-28 12:36:37,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 172.54/109.72 [2019-03-28 12:36:37,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 172.54/109.72 [2019-03-28 12:36:37,862 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 172.54/109.72 [2019-03-28 12:36:37,863 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 172.54/109.72 [2019-03-28 12:36:37,863 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 172.54/109.72 [2019-03-28 12:36:37,863 INFO L811 eck$LassoCheckResult]: loop already infeasible 172.54/109.72 [2019-03-28 12:36:37,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 172.54/109.72 [2019-03-28 12:36:37,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 172.54/109.72 [2019-03-28 12:36:37,863 INFO L87 Difference]: Start difference. First operand 51 states and 81 transitions. cyclomatic complexity: 32 Second operand 3 states. 172.54/109.72 [2019-03-28 12:36:37,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 172.54/109.72 [2019-03-28 12:36:37,903 INFO L93 Difference]: Finished difference Result 50 states and 72 transitions. 172.54/109.72 [2019-03-28 12:36:37,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 172.54/109.72 [2019-03-28 12:36:37,907 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 50 states and 72 transitions. 172.54/109.72 [2019-03-28 12:36:37,908 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 172.54/109.72 [2019-03-28 12:36:37,909 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 50 states to 42 states and 59 transitions. 172.54/109.72 [2019-03-28 12:36:37,909 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 172.54/109.72 [2019-03-28 12:36:37,909 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 172.54/109.72 [2019-03-28 12:36:37,909 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 59 transitions. 172.54/109.72 [2019-03-28 12:36:37,909 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 172.54/109.72 [2019-03-28 12:36:37,909 INFO L706 BuchiCegarLoop]: Abstraction has 42 states and 59 transitions. 172.54/109.72 [2019-03-28 12:36:37,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 59 transitions. 172.54/109.72 [2019-03-28 12:36:37,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. 172.54/109.72 [2019-03-28 12:36:37,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. 172.54/109.72 [2019-03-28 12:36:37,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 59 transitions. 172.54/109.72 [2019-03-28 12:36:37,911 INFO L729 BuchiCegarLoop]: Abstraction has 42 states and 59 transitions. 172.54/109.72 [2019-03-28 12:36:37,911 INFO L609 BuchiCegarLoop]: Abstraction has 42 states and 59 transitions. 172.54/109.72 [2019-03-28 12:36:37,911 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ 172.54/109.72 [2019-03-28 12:36:37,911 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 42 states and 59 transitions. 172.54/109.72 [2019-03-28 12:36:37,912 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 172.54/109.72 [2019-03-28 12:36:37,912 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 172.54/109.72 [2019-03-28 12:36:37,912 INFO L119 BuchiIsEmpty]: Starting construction of run 172.54/109.72 [2019-03-28 12:36:37,912 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] 172.54/109.72 [2019-03-28 12:36:37,912 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] 172.54/109.72 [2019-03-28 12:36:37,913 INFO L794 eck$LassoCheckResult]: Stem: 807#ULTIMATE.startENTRY [189] ULTIMATE.startENTRY-->L24: Formula: (and (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|) (= |v_#valid_23| (store |v_#valid_24| 0 0))) InVars {#valid=|v_#valid_24|} OutVars{ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_6|, ULTIMATE.start_main_#t~malloc11.offset=|v_ULTIMATE.start_main_#t~malloc11.offset_5|, ULTIMATE.start_main_#t~nondet9=|v_ULTIMATE.start_main_#t~nondet9_6|, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_10, ULTIMATE.start_main_#t~malloc12.base=|v_ULTIMATE.start_main_#t~malloc12.base_5|, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~malloc11.base=|v_ULTIMATE.start_main_#t~malloc11.base_5|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_7, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_6, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~malloc12.offset=|v_ULTIMATE.start_main_#t~malloc12.offset_5|, ULTIMATE.start_main_#t~ret13=|v_ULTIMATE.start_main_#t~ret13_4|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, #valid=|v_#valid_23|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_6, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10, ULTIMATE.start_main_#t~malloc11.offset, ULTIMATE.start_main_#t~nondet9, ULTIMATE.start_main_~length1~0, ULTIMATE.start_main_#t~malloc12.base, #NULL.offset, ULTIMATE.start_main_#t~malloc11.base, ULTIMATE.start_main_~nondetString2~0.base, ULTIMATE.start_main_~nondetString2~0.offset, #NULL.base, ULTIMATE.start_main_#t~malloc12.offset, ULTIMATE.start_main_#t~ret13, ULTIMATE.start_main_~nondetString1~0.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_~nondetString1~0.offset, ULTIMATE.start_main_~length2~0] 808#L24 [126] L24-->L24-2: Formula: (>= v_ULTIMATE.start_main_~length1~0_6 1) InVars {ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_6} OutVars{ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_6} AuxVars[] AssignedVars[] 809#L24-2 [127] L24-2-->L27-1: Formula: (>= v_ULTIMATE.start_main_~length2~0_6 1) InVars {ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_6} OutVars{ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_6} AuxVars[] AssignedVars[] 783#L27-1 [150] L27-1-->L32: Formula: (let ((.cse0 (store |v_#valid_10| |v_ULTIMATE.start_main_#t~malloc11.base_4| 1))) (and (= v_ULTIMATE.start_main_~nondetString1~0.offset_2 |v_ULTIMATE.start_main_#t~malloc11.offset_4|) (= v_ULTIMATE.start_main_~nondetString2~0.offset_2 |v_ULTIMATE.start_main_#t~malloc12.offset_4|) (= |v_ULTIMATE.start_main_#t~malloc11.offset_4| 0) (= 0 (select |v_#valid_10| |v_ULTIMATE.start_main_#t~malloc11.base_4|)) (> 0 |v_ULTIMATE.start_main_#t~malloc12.base_4|) (= |v_ULTIMATE.start_main_#t~malloc12.offset_4| 0) (= (store .cse0 |v_ULTIMATE.start_main_#t~malloc12.base_4| 1) |v_#valid_8|) (< |v_ULTIMATE.start_main_#t~malloc11.base_4| 0) (= v_ULTIMATE.start_main_~nondetString2~0.base_2 |v_ULTIMATE.start_main_#t~malloc12.base_4|) (= 0 (select .cse0 |v_ULTIMATE.start_main_#t~malloc12.base_4|)) (< |v_ULTIMATE.start_main_#t~malloc12.base_4| |v_#StackHeapBarrier_1|) (< |v_ULTIMATE.start_main_#t~malloc11.base_4| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_main_~nondetString1~0.base_2 |v_ULTIMATE.start_main_#t~malloc11.base_4|) (= |v_#length_3| (store (store |v_#length_5| |v_ULTIMATE.start_main_#t~malloc11.base_4| v_ULTIMATE.start_main_~length1~0_7) |v_ULTIMATE.start_main_#t~malloc12.base_4| v_ULTIMATE.start_main_~length2~0_7)))) InVars {ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_5|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_7, #valid=|v_#valid_10|} OutVars{ULTIMATE.start_main_#t~malloc11.offset=|v_ULTIMATE.start_main_#t~malloc11.offset_4|, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_7, ULTIMATE.start_main_#t~malloc12.base=|v_ULTIMATE.start_main_#t~malloc12.base_4|, ULTIMATE.start_main_#t~malloc11.base=|v_ULTIMATE.start_main_#t~malloc11.base_4|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_2, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_2, ULTIMATE.start_main_#t~malloc12.offset=|v_ULTIMATE.start_main_#t~malloc12.offset_4|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_2, #valid=|v_#valid_8|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_2, #length=|v_#length_3|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc12.offset, ULTIMATE.start_main_#t~malloc11.offset, ULTIMATE.start_main_~nondetString1~0.base, #valid, ULTIMATE.start_main_#t~malloc12.base, ULTIMATE.start_main_~nondetString1~0.offset, ULTIMATE.start_main_#t~malloc11.base, #length, ULTIMATE.start_main_~nondetString2~0.base, ULTIMATE.start_main_~nondetString2~0.offset] 784#L32 [96] L32-->L32-1: Formula: (let ((.cse0 (+ v_ULTIMATE.start_main_~length1~0_8 v_ULTIMATE.start_main_~nondetString1~0.offset_3))) (and (<= 1 .cse0) (= 1 (select |v_#valid_11| v_ULTIMATE.start_main_~nondetString1~0.base_3)) (= |v_#memory_int_2| (store |v_#memory_int_3| v_ULTIMATE.start_main_~nondetString1~0.base_3 (store (select |v_#memory_int_3| v_ULTIMATE.start_main_~nondetString1~0.base_3) (+ v_ULTIMATE.start_main_~length1~0_8 v_ULTIMATE.start_main_~nondetString1~0.offset_3 (- 1)) 0))) (<= .cse0 (select |v_#length_6| v_ULTIMATE.start_main_~nondetString1~0.base_3)))) InVars {ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_3, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_3|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_3, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_8, #length=|v_#length_6|} OutVars{ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_3, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_3, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_8, #length=|v_#length_6|} AuxVars[] AssignedVars[#memory_int] 803#L32-1 [190] L32-1-->L8-3: Formula: (let ((.cse0 (+ v_ULTIMATE.start_main_~length2~0_11 v_ULTIMATE.start_main_~nondetString2~0.offset_7))) (and (= v_ULTIMATE.start_substring_~ps~0.offset_8 v_ULTIMATE.start_substring_~s.offset_3) (<= 1 .cse0) (= v_ULTIMATE.start_main_~nondetString2~0.base_8 |v_ULTIMATE.start_substring_#in~t.base_2|) (= |v_ULTIMATE.start_substring_#in~s.offset_2| v_ULTIMATE.start_substring_~s.offset_3) (= (select |v_#valid_25| v_ULTIMATE.start_main_~nondetString2~0.base_8) 1) (= |v_ULTIMATE.start_substring_#in~t.base_2| v_ULTIMATE.start_substring_~t.base_4) (= |v_ULTIMATE.start_substring_#in~s.base_2| v_ULTIMATE.start_main_~nondetString1~0.base_8) (= (store |v_#memory_int_11| v_ULTIMATE.start_main_~nondetString2~0.base_8 (store (select |v_#memory_int_11| v_ULTIMATE.start_main_~nondetString2~0.base_8) (+ v_ULTIMATE.start_main_~length2~0_11 v_ULTIMATE.start_main_~nondetString2~0.offset_7 (- 1)) 0)) |v_#memory_int_10|) (= v_ULTIMATE.start_main_~nondetString2~0.offset_7 |v_ULTIMATE.start_substring_#in~t.offset_2|) (= v_ULTIMATE.start_main_~nondetString1~0.offset_7 |v_ULTIMATE.start_substring_#in~s.offset_2|) (= |v_ULTIMATE.start_substring_#in~t.offset_2| v_ULTIMATE.start_substring_~t.offset_4) (= |v_ULTIMATE.start_substring_#in~s.base_2| v_ULTIMATE.start_substring_~s.base_3) (= v_ULTIMATE.start_substring_~s.base_3 v_ULTIMATE.start_substring_~ps~0.base_9) (<= .cse0 (select |v_#length_18| v_ULTIMATE.start_main_~nondetString2~0.base_8)))) InVars {ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_8, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_7, #length=|v_#length_18|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_8, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_7, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_11} OutVars{ULTIMATE.start_substring_#in~t.offset=|v_ULTIMATE.start_substring_#in~t.offset_2|, ULTIMATE.start_substring_~ps~0.offset=v_ULTIMATE.start_substring_~ps~0.offset_8, ULTIMATE.start_substring_#t~post5.offset=|v_ULTIMATE.start_substring_#t~post5.offset_4|, ULTIMATE.start_substring_~ps2~0.base=v_ULTIMATE.start_substring_~ps2~0.base_8, ULTIMATE.start_substring_#t~mem7=|v_ULTIMATE.start_substring_#t~mem7_7|, ULTIMATE.start_substring_~t.offset=v_ULTIMATE.start_substring_~t.offset_4, ULTIMATE.start_substring_#t~mem3=|v_ULTIMATE.start_substring_#t~mem3_6|, ULTIMATE.start_substring_#t~mem2=|v_ULTIMATE.start_substring_#t~mem2_6|, ULTIMATE.start_substring_#t~mem1=|v_ULTIMATE.start_substring_#t~mem1_6|, ULTIMATE.start_substring_#in~s.offset=|v_ULTIMATE.start_substring_#in~s.offset_2|, ULTIMATE.start_substring_#t~mem0=|v_ULTIMATE.start_substring_#t~mem0_7|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_8, ULTIMATE.start_substring_~ps2~0.offset=v_ULTIMATE.start_substring_~ps2~0.offset_7, ULTIMATE.start_substring_~pt~0.base=v_ULTIMATE.start_substring_~pt~0.base_14, ULTIMATE.start_substring_#t~post8.offset=|v_ULTIMATE.start_substring_#t~post8.offset_4|, #length=|v_#length_18|, ULTIMATE.start_substring_~pt~0.offset=v_ULTIMATE.start_substring_~pt~0.offset_11, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_11, ULTIMATE.start_substring_#res=|v_ULTIMATE.start_substring_#res_5|, ULTIMATE.start_substring_#t~post6.offset=|v_ULTIMATE.start_substring_#t~post6.offset_4|, ULTIMATE.start_substring_~t.base=v_ULTIMATE.start_substring_~t.base_4, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_8, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_7, ULTIMATE.start_substring_~s.base=v_ULTIMATE.start_substring_~s.base_3, ULTIMATE.start_substring_#in~t.base=|v_ULTIMATE.start_substring_#in~t.base_2|, ULTIMATE.start_substring_#in~s.base=|v_ULTIMATE.start_substring_#in~s.base_2|, ULTIMATE.start_substring_#t~post6.base=|v_ULTIMATE.start_substring_#t~post6.base_4|, ULTIMATE.start_substring_#t~post8.base=|v_ULTIMATE.start_substring_#t~post8.base_4|, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_10|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_7, ULTIMATE.start_substring_~ps~0.base=v_ULTIMATE.start_substring_~ps~0.base_9, ULTIMATE.start_substring_#t~post5.base=|v_ULTIMATE.start_substring_#t~post5.base_4|, ULTIMATE.start_substring_~s.offset=v_ULTIMATE.start_substring_~s.offset_3, ULTIMATE.start_substring_#t~short4=|v_ULTIMATE.start_substring_#t~short4_10|} AuxVars[] AssignedVars[ULTIMATE.start_substring_#in~t.offset, ULTIMATE.start_substring_~ps~0.offset, ULTIMATE.start_substring_#t~post5.offset, ULTIMATE.start_substring_~ps2~0.base, ULTIMATE.start_substring_#t~mem7, ULTIMATE.start_substring_~t.offset, ULTIMATE.start_substring_#t~mem3, ULTIMATE.start_substring_#t~mem2, ULTIMATE.start_substring_#t~mem1, ULTIMATE.start_substring_#in~s.offset, ULTIMATE.start_substring_#t~mem0, ULTIMATE.start_substring_~ps2~0.offset, ULTIMATE.start_substring_~pt~0.base, ULTIMATE.start_substring_#t~post8.offset, ULTIMATE.start_substring_~pt~0.offset, ULTIMATE.start_substring_#res, ULTIMATE.start_substring_#t~post6.offset, ULTIMATE.start_substring_~t.base, ULTIMATE.start_substring_~s.base, ULTIMATE.start_substring_#in~t.base, ULTIMATE.start_substring_#in~s.base, ULTIMATE.start_substring_#t~post6.base, ULTIMATE.start_substring_#t~post8.base, #memory_int, ULTIMATE.start_substring_~ps~0.base, ULTIMATE.start_substring_#t~post5.base, ULTIMATE.start_substring_~s.offset, ULTIMATE.start_substring_#t~short4] 785#L8-3 [113] L8-3-->L8-1: Formula: (and (= (select (select |v_#memory_int_6| v_ULTIMATE.start_substring_~ps~0.base_5) v_ULTIMATE.start_substring_~ps~0.offset_5) |v_ULTIMATE.start_substring_#t~mem0_2|) (= (select |v_#valid_15| v_ULTIMATE.start_substring_~ps~0.base_5) 1) (<= 0 v_ULTIMATE.start_substring_~ps~0.offset_5) (<= (+ v_ULTIMATE.start_substring_~ps~0.offset_5 1) (select |v_#length_10| v_ULTIMATE.start_substring_~ps~0.base_5))) InVars {ULTIMATE.start_substring_~ps~0.offset=v_ULTIMATE.start_substring_~ps~0.offset_5, #memory_int=|v_#memory_int_6|, #length=|v_#length_10|, ULTIMATE.start_substring_~ps~0.base=v_ULTIMATE.start_substring_~ps~0.base_5, #valid=|v_#valid_15|} OutVars{ULTIMATE.start_substring_#t~mem0=|v_ULTIMATE.start_substring_#t~mem0_2|, #valid=|v_#valid_15|, ULTIMATE.start_substring_~ps~0.offset=v_ULTIMATE.start_substring_~ps~0.offset_5, #memory_int=|v_#memory_int_6|, #length=|v_#length_10|, ULTIMATE.start_substring_~ps~0.base=v_ULTIMATE.start_substring_~ps~0.base_5} AuxVars[] AssignedVars[ULTIMATE.start_substring_#t~mem0] 787#L8-1 [164] L8-1-->L11-9: Formula: (and (= v_ULTIMATE.start_substring_~ps2~0.base_2 v_ULTIMATE.start_substring_~ps~0.base_8) (= v_ULTIMATE.start_substring_~pt~0.offset_4 v_ULTIMATE.start_substring_~t.offset_3) (> 0 |v_ULTIMATE.start_substring_#t~mem0_6|) (= v_ULTIMATE.start_substring_~pt~0.base_5 v_ULTIMATE.start_substring_~t.base_3) (= v_ULTIMATE.start_substring_~ps2~0.offset_2 v_ULTIMATE.start_substring_~ps~0.offset_7)) InVars {ULTIMATE.start_substring_~ps~0.offset=v_ULTIMATE.start_substring_~ps~0.offset_7, ULTIMATE.start_substring_~t.offset=v_ULTIMATE.start_substring_~t.offset_3, ULTIMATE.start_substring_~ps~0.base=v_ULTIMATE.start_substring_~ps~0.base_8, ULTIMATE.start_substring_~t.base=v_ULTIMATE.start_substring_~t.base_3, ULTIMATE.start_substring_#t~mem0=|v_ULTIMATE.start_substring_#t~mem0_6|} OutVars{ULTIMATE.start_substring_~t.offset=v_ULTIMATE.start_substring_~t.offset_3, ULTIMATE.start_substring_#t~mem0=|v_ULTIMATE.start_substring_#t~mem0_5|, ULTIMATE.start_substring_~ps2~0.offset=v_ULTIMATE.start_substring_~ps2~0.offset_2, ULTIMATE.start_substring_~pt~0.base=v_ULTIMATE.start_substring_~pt~0.base_5, ULTIMATE.start_substring_~ps~0.offset=v_ULTIMATE.start_substring_~ps~0.offset_7, ULTIMATE.start_substring_~ps2~0.base=v_ULTIMATE.start_substring_~ps2~0.base_2, ULTIMATE.start_substring_~ps~0.base=v_ULTIMATE.start_substring_~ps~0.base_8, ULTIMATE.start_substring_~t.base=v_ULTIMATE.start_substring_~t.base_3, ULTIMATE.start_substring_~pt~0.offset=v_ULTIMATE.start_substring_~pt~0.offset_4} AuxVars[] AssignedVars[ULTIMATE.start_substring_#t~mem0, ULTIMATE.start_substring_~ps2~0.offset, ULTIMATE.start_substring_~pt~0.base, ULTIMATE.start_substring_~ps2~0.base, ULTIMATE.start_substring_~pt~0.offset] 794#L11-9 172.54/109.72 [2019-03-28 12:36:37,914 INFO L796 eck$LassoCheckResult]: Loop: 794#L11-9 [103] L11-9-->L11-1: Formula: (and (<= 0 v_ULTIMATE.start_substring_~pt~0.offset_5) (<= (+ v_ULTIMATE.start_substring_~pt~0.offset_5 1) (select |v_#length_12| v_ULTIMATE.start_substring_~pt~0.base_6)) (= |v_ULTIMATE.start_substring_#t~mem1_2| (select (select |v_#memory_int_7| v_ULTIMATE.start_substring_~pt~0.base_6) v_ULTIMATE.start_substring_~pt~0.offset_5)) (= (select |v_#valid_17| v_ULTIMATE.start_substring_~pt~0.base_6) 1)) InVars {#memory_int=|v_#memory_int_7|, #length=|v_#length_12|, ULTIMATE.start_substring_~pt~0.offset=v_ULTIMATE.start_substring_~pt~0.offset_5, ULTIMATE.start_substring_~pt~0.base=v_ULTIMATE.start_substring_~pt~0.base_6, #valid=|v_#valid_17|} OutVars{ULTIMATE.start_substring_#t~mem1=|v_ULTIMATE.start_substring_#t~mem1_2|, ULTIMATE.start_substring_~pt~0.base=v_ULTIMATE.start_substring_~pt~0.base_6, #valid=|v_#valid_17|, #memory_int=|v_#memory_int_7|, #length=|v_#length_12|, ULTIMATE.start_substring_~pt~0.offset=v_ULTIMATE.start_substring_~pt~0.offset_5} AuxVars[] AssignedVars[ULTIMATE.start_substring_#t~mem1] 822#L11-1 [174] L11-1-->L11-2: Formula: (and (> 0 |v_ULTIMATE.start_substring_#t~mem1_3|) |v_ULTIMATE.start_substring_#t~short4_2|) InVars {ULTIMATE.start_substring_#t~mem1=|v_ULTIMATE.start_substring_#t~mem1_3|} OutVars{ULTIMATE.start_substring_#t~mem1=|v_ULTIMATE.start_substring_#t~mem1_3|, ULTIMATE.start_substring_#t~short4=|v_ULTIMATE.start_substring_#t~short4_2|} AuxVars[] AssignedVars[ULTIMATE.start_substring_#t~short4] 801#L11-2 [90] L11-2-->L11-3: Formula: |v_ULTIMATE.start_substring_#t~short4_3| InVars {ULTIMATE.start_substring_#t~short4=|v_ULTIMATE.start_substring_#t~short4_3|} OutVars{ULTIMATE.start_substring_#t~short4=|v_ULTIMATE.start_substring_#t~short4_3|} AuxVars[] AssignedVars[] 799#L11-3 [87] L11-3-->L11-4: Formula: (and (<= (+ v_ULTIMATE.start_substring_~pt~0.offset_7 1) (select |v_#length_14| v_ULTIMATE.start_substring_~pt~0.base_9)) (= 1 (select |v_#valid_19| v_ULTIMATE.start_substring_~pt~0.base_9)) (<= 0 v_ULTIMATE.start_substring_~pt~0.offset_7) (= (select (select |v_#memory_int_8| v_ULTIMATE.start_substring_~pt~0.base_9) v_ULTIMATE.start_substring_~pt~0.offset_7) |v_ULTIMATE.start_substring_#t~mem2_2|)) InVars {#memory_int=|v_#memory_int_8|, #length=|v_#length_14|, ULTIMATE.start_substring_~pt~0.offset=v_ULTIMATE.start_substring_~pt~0.offset_7, ULTIMATE.start_substring_~pt~0.base=v_ULTIMATE.start_substring_~pt~0.base_9, #valid=|v_#valid_19|} OutVars{ULTIMATE.start_substring_#t~mem2=|v_ULTIMATE.start_substring_#t~mem2_2|, ULTIMATE.start_substring_~pt~0.base=v_ULTIMATE.start_substring_~pt~0.base_9, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_8|, #length=|v_#length_14|, ULTIMATE.start_substring_~pt~0.offset=v_ULTIMATE.start_substring_~pt~0.offset_7} AuxVars[] AssignedVars[ULTIMATE.start_substring_#t~mem2] 797#L11-4 [83] L11-4-->L11-5: Formula: (and (= (select |v_#valid_21| v_ULTIMATE.start_substring_~ps2~0.base_3) 1) (<= (+ v_ULTIMATE.start_substring_~ps2~0.offset_3 1) (select |v_#length_16| v_ULTIMATE.start_substring_~ps2~0.base_3)) (<= 0 v_ULTIMATE.start_substring_~ps2~0.offset_3) (= (select (select |v_#memory_int_9| v_ULTIMATE.start_substring_~ps2~0.base_3) v_ULTIMATE.start_substring_~ps2~0.offset_3) |v_ULTIMATE.start_substring_#t~mem3_2|)) InVars {#memory_int=|v_#memory_int_9|, #length=|v_#length_16|, ULTIMATE.start_substring_~ps2~0.base=v_ULTIMATE.start_substring_~ps2~0.base_3, ULTIMATE.start_substring_~ps2~0.offset=v_ULTIMATE.start_substring_~ps2~0.offset_3, #valid=|v_#valid_21|} OutVars{ULTIMATE.start_substring_#t~mem3=|v_ULTIMATE.start_substring_#t~mem3_2|, ULTIMATE.start_substring_~ps2~0.offset=v_ULTIMATE.start_substring_~ps2~0.offset_3, #valid=|v_#valid_21|, #memory_int=|v_#memory_int_9|, #length=|v_#length_16|, ULTIMATE.start_substring_~ps2~0.base=v_ULTIMATE.start_substring_~ps2~0.base_3} AuxVars[] AssignedVars[ULTIMATE.start_substring_#t~mem3] 788#L11-5 [186] L11-5-->L11-7: Formula: (and (= |v_ULTIMATE.start_substring_#t~mem3_3| |v_ULTIMATE.start_substring_#t~mem2_3|) |v_ULTIMATE.start_substring_#t~short4_4|) InVars {ULTIMATE.start_substring_#t~mem2=|v_ULTIMATE.start_substring_#t~mem2_3|, ULTIMATE.start_substring_#t~mem3=|v_ULTIMATE.start_substring_#t~mem3_3|} OutVars{ULTIMATE.start_substring_#t~mem3=|v_ULTIMATE.start_substring_#t~mem3_3|, ULTIMATE.start_substring_#t~mem2=|v_ULTIMATE.start_substring_#t~mem2_3|, ULTIMATE.start_substring_#t~short4=|v_ULTIMATE.start_substring_#t~short4_4|} AuxVars[] AssignedVars[ULTIMATE.start_substring_#t~short4] 789#L11-7 [109] L11-7-->L11-9: Formula: (and (= v_ULTIMATE.start_substring_~ps2~0.offset_5 (+ v_ULTIMATE.start_substring_~ps2~0.offset_6 1)) (= v_ULTIMATE.start_substring_~pt~0.base_13 v_ULTIMATE.start_substring_~pt~0.base_12) (= v_ULTIMATE.start_substring_~ps2~0.base_7 v_ULTIMATE.start_substring_~ps2~0.base_6) |v_ULTIMATE.start_substring_#t~short4_9| (= (+ v_ULTIMATE.start_substring_~pt~0.offset_10 1) v_ULTIMATE.start_substring_~pt~0.offset_9)) InVars {ULTIMATE.start_substring_~ps2~0.base=v_ULTIMATE.start_substring_~ps2~0.base_7, ULTIMATE.start_substring_~pt~0.offset=v_ULTIMATE.start_substring_~pt~0.offset_10, ULTIMATE.start_substring_~ps2~0.offset=v_ULTIMATE.start_substring_~ps2~0.offset_6, ULTIMATE.start_substring_~pt~0.base=v_ULTIMATE.start_substring_~pt~0.base_13, ULTIMATE.start_substring_#t~short4=|v_ULTIMATE.start_substring_#t~short4_9|} OutVars{ULTIMATE.start_substring_#t~post6.offset=|v_ULTIMATE.start_substring_#t~post6.offset_2|, ULTIMATE.start_substring_#t~post5.offset=|v_ULTIMATE.start_substring_#t~post5.offset_2|, ULTIMATE.start_substring_~ps2~0.base=v_ULTIMATE.start_substring_~ps2~0.base_6, ULTIMATE.start_substring_#t~post6.base=|v_ULTIMATE.start_substring_#t~post6.base_2|, ULTIMATE.start_substring_#t~mem3=|v_ULTIMATE.start_substring_#t~mem3_5|, ULTIMATE.start_substring_#t~mem2=|v_ULTIMATE.start_substring_#t~mem2_5|, ULTIMATE.start_substring_#t~mem1=|v_ULTIMATE.start_substring_#t~mem1_5|, ULTIMATE.start_substring_~ps2~0.offset=v_ULTIMATE.start_substring_~ps2~0.offset_5, ULTIMATE.start_substring_~pt~0.base=v_ULTIMATE.start_substring_~pt~0.base_12, ULTIMATE.start_substring_#t~post5.base=|v_ULTIMATE.start_substring_#t~post5.base_2|, ULTIMATE.start_substring_~pt~0.offset=v_ULTIMATE.start_substring_~pt~0.offset_9, ULTIMATE.start_substring_#t~short4=|v_ULTIMATE.start_substring_#t~short4_8|} AuxVars[] AssignedVars[ULTIMATE.start_substring_#t~post6.base, ULTIMATE.start_substring_#t~post6.offset, ULTIMATE.start_substring_#t~mem3, ULTIMATE.start_substring_#t~mem2, ULTIMATE.start_substring_#t~mem1, ULTIMATE.start_substring_~ps2~0.offset, ULTIMATE.start_substring_~pt~0.base, ULTIMATE.start_substring_#t~post5.offset, ULTIMATE.start_substring_~ps2~0.base, ULTIMATE.start_substring_#t~post5.base, ULTIMATE.start_substring_~pt~0.offset, ULTIMATE.start_substring_#t~short4] 794#L11-9 172.54/109.72 [2019-03-28 12:36:37,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 172.54/109.72 [2019-03-28 12:36:37,914 INFO L82 PathProgramCache]: Analyzing trace with hash 805007690, now seen corresponding path program 2 times 172.54/109.72 [2019-03-28 12:36:37,914 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 172.54/109.72 [2019-03-28 12:36:37,914 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 172.54/109.72 [2019-03-28 12:36:37,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 172.54/109.72 [2019-03-28 12:36:37,915 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 172.54/109.72 [2019-03-28 12:36:37,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 172.54/109.72 [2019-03-28 12:36:37,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 172.54/109.72 [2019-03-28 12:36:37,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 172.54/109.72 [2019-03-28 12:36:37,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 172.54/109.72 [2019-03-28 12:36:37,928 INFO L82 PathProgramCache]: Analyzing trace with hash -561291711, now seen corresponding path program 1 times 172.54/109.72 [2019-03-28 12:36:37,929 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 172.54/109.72 [2019-03-28 12:36:37,929 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 172.54/109.72 [2019-03-28 12:36:37,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 172.54/109.72 [2019-03-28 12:36:37,929 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 172.54/109.72 [2019-03-28 12:36:37,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 172.54/109.72 [2019-03-28 12:36:37,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 172.54/109.72 [2019-03-28 12:36:37,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 172.54/109.72 [2019-03-28 12:36:37,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 172.54/109.72 [2019-03-28 12:36:37,936 INFO L82 PathProgramCache]: Analyzing trace with hash -768304936, now seen corresponding path program 1 times 172.54/109.72 [2019-03-28 12:36:37,936 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 172.54/109.72 [2019-03-28 12:36:37,936 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 172.54/109.72 [2019-03-28 12:36:37,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 172.54/109.72 [2019-03-28 12:36:37,937 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 172.54/109.72 [2019-03-28 12:36:37,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 172.54/109.72 [2019-03-28 12:36:37,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 172.54/109.72 [2019-03-28 12:36:37,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 172.54/109.72 [2019-03-28 12:36:38,427 WARN L188 SmtUtils]: Spent 392.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 95 172.54/109.72 [2019-03-28 12:36:38,564 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 89 172.54/109.72 [2019-03-28 12:36:38,566 INFO L216 LassoAnalysis]: Preferences: 172.54/109.72 [2019-03-28 12:36:38,566 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 172.54/109.72 [2019-03-28 12:36:38,566 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 172.54/109.72 [2019-03-28 12:36:38,566 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 172.54/109.72 [2019-03-28 12:36:38,567 INFO L127 ssoRankerPreferences]: Use exernal solver: false 172.54/109.72 [2019-03-28 12:36:38,567 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 172.54/109.72 [2019-03-28 12:36:38,567 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 172.54/109.72 [2019-03-28 12:36:38,567 INFO L130 ssoRankerPreferences]: Path of dumped script: 172.54/109.72 [2019-03-28 12:36:38,567 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration7_Lasso 172.54/109.72 [2019-03-28 12:36:38,567 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 172.54/109.72 [2019-03-28 12:36:38,567 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 172.54/109.72 [2019-03-28 12:36:38,570 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 172.54/109.72 [2019-03-28 12:36:38,572 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 172.54/109.72 [2019-03-28 12:36:38,575 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 172.54/109.72 [2019-03-28 12:36:38,576 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 172.54/109.72 [2019-03-28 12:36:38,578 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 172.54/109.72 [2019-03-28 12:36:38,579 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 172.54/109.72 [2019-03-28 12:36:38,581 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 172.54/109.72 [2019-03-28 12:36:38,582 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 172.54/109.72 [2019-03-28 12:36:38,583 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 172.54/109.72 [2019-03-28 12:36:38,585 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 172.54/109.72 [2019-03-28 12:36:38,586 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 172.54/109.72 [2019-03-28 12:36:38,946 WARN L188 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 81 172.54/109.72 [2019-03-28 12:36:39,078 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 57 172.54/109.72 [2019-03-28 12:36:39,078 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 172.54/109.72 [2019-03-28 12:36:39,080 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 172.54/109.72 [2019-03-28 12:36:39,082 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 172.54/109.72 [2019-03-28 12:36:39,083 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 172.54/109.72 [2019-03-28 12:36:39,084 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 172.54/109.72 [2019-03-28 12:36:39,086 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 172.54/109.72 [2019-03-28 12:36:39,087 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 172.54/109.72 [2019-03-28 12:36:39,088 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 172.54/109.72 [2019-03-28 12:36:39,090 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 172.54/109.72 [2019-03-28 12:36:39,568 INFO L300 LassoAnalysis]: Preprocessing complete. 172.54/109.72 [2019-03-28 12:36:39,568 INFO L497 LassoAnalysis]: Using template 'affine'. 172.54/109.72 [2019-03-28 12:36:39,569 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 172.54/109.72 Termination analysis: LINEAR_WITH_GUESSES 172.54/109.72 Number of strict supporting invariants: 0 172.54/109.72 Number of non-strict supporting invariants: 1 172.54/109.72 Consider only non-deceasing supporting invariants: true 172.54/109.72 Simplify termination arguments: true 172.54/109.72 Simplify supporting invariants: trueOverapproximate stem: false 172.54/109.72 [2019-03-28 12:36:39,569 INFO L339 nArgumentSynthesizer]: Template has degree 0. 172.54/109.72 [2019-03-28 12:36:39,569 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 172.54/109.72 [2019-03-28 12:36:39,570 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 172.54/109.72 [2019-03-28 12:36:39,570 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 172.54/109.72 [2019-03-28 12:36:39,570 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 172.54/109.72 [2019-03-28 12:36:39,570 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 172.54/109.72 [2019-03-28 12:36:39,570 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 172.54/109.72 [2019-03-28 12:36:39,571 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 172.54/109.72 [2019-03-28 12:36:39,571 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 172.54/109.72 Termination analysis: LINEAR_WITH_GUESSES 172.54/109.72 Number of strict supporting invariants: 0 172.54/109.72 Number of non-strict supporting invariants: 1 172.54/109.72 Consider only non-deceasing supporting invariants: true 172.54/109.72 Simplify termination arguments: true 172.54/109.72 Simplify supporting invariants: trueOverapproximate stem: false 172.54/109.72 [2019-03-28 12:36:39,572 INFO L339 nArgumentSynthesizer]: Template has degree 0. 172.54/109.72 [2019-03-28 12:36:39,572 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 172.54/109.72 [2019-03-28 12:36:39,572 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 172.54/109.72 [2019-03-28 12:36:39,572 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 172.54/109.72 [2019-03-28 12:36:39,573 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 172.54/109.72 [2019-03-28 12:36:39,573 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 172.54/109.72 [2019-03-28 12:36:39,574 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 172.54/109.72 [2019-03-28 12:36:39,574 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 172.54/109.72 Termination analysis: LINEAR_WITH_GUESSES 172.54/109.72 Number of strict supporting invariants: 0 172.54/109.72 Number of non-strict supporting invariants: 1 172.54/109.72 Consider only non-deceasing supporting invariants: true 172.54/109.72 Simplify termination arguments: true 172.54/109.72 Simplify supporting invariants: trueOverapproximate stem: false 172.54/109.72 [2019-03-28 12:36:39,574 INFO L339 nArgumentSynthesizer]: Template has degree 0. 172.54/109.72 [2019-03-28 12:36:39,575 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 172.54/109.72 [2019-03-28 12:36:39,575 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 172.54/109.72 [2019-03-28 12:36:39,575 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 172.54/109.72 [2019-03-28 12:36:39,575 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 172.54/109.72 [2019-03-28 12:36:39,575 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 172.54/109.72 [2019-03-28 12:36:39,575 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 172.54/109.72 [2019-03-28 12:36:39,576 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 172.54/109.72 [2019-03-28 12:36:39,576 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 172.54/109.72 Termination analysis: LINEAR_WITH_GUESSES 172.54/109.72 Number of strict supporting invariants: 0 172.54/109.72 Number of non-strict supporting invariants: 1 172.54/109.72 Consider only non-deceasing supporting invariants: true 172.54/109.72 Simplify termination arguments: true 172.54/109.72 Simplify supporting invariants: trueOverapproximate stem: false 172.54/109.72 [2019-03-28 12:36:39,576 INFO L339 nArgumentSynthesizer]: Template has degree 0. 172.54/109.72 [2019-03-28 12:36:39,576 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 172.54/109.72 [2019-03-28 12:36:39,577 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 172.54/109.72 [2019-03-28 12:36:39,577 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 172.54/109.72 [2019-03-28 12:36:39,577 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 172.54/109.72 [2019-03-28 12:36:39,577 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 172.54/109.72 [2019-03-28 12:36:39,577 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 172.54/109.72 [2019-03-28 12:36:39,578 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 172.54/109.72 [2019-03-28 12:36:39,578 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 172.54/109.72 Termination analysis: LINEAR_WITH_GUESSES 172.54/109.72 Number of strict supporting invariants: 0 172.54/109.72 Number of non-strict supporting invariants: 1 172.54/109.72 Consider only non-deceasing supporting invariants: true 172.54/109.72 Simplify termination arguments: true 172.54/109.72 Simplify supporting invariants: trueOverapproximate stem: false 172.54/109.72 [2019-03-28 12:36:39,578 INFO L339 nArgumentSynthesizer]: Template has degree 0. 172.54/109.72 [2019-03-28 12:36:39,578 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 172.54/109.72 [2019-03-28 12:36:39,578 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 172.54/109.72 [2019-03-28 12:36:39,579 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 172.61/109.72 [2019-03-28 12:36:39,579 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 172.61/109.72 [2019-03-28 12:36:39,579 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 172.61/109.72 [2019-03-28 12:36:39,579 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 172.61/109.72 [2019-03-28 12:36:39,579 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 172.61/109.72 [2019-03-28 12:36:39,580 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 172.61/109.72 Termination analysis: LINEAR_WITH_GUESSES 172.61/109.72 Number of strict supporting invariants: 0 172.61/109.72 Number of non-strict supporting invariants: 1 172.61/109.72 Consider only non-deceasing supporting invariants: true 172.61/109.72 Simplify termination arguments: true 172.61/109.72 Simplify supporting invariants: trueOverapproximate stem: false 172.61/109.72 [2019-03-28 12:36:39,580 INFO L339 nArgumentSynthesizer]: Template has degree 0. 172.61/109.72 [2019-03-28 12:36:39,580 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 172.61/109.72 [2019-03-28 12:36:39,580 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 172.61/109.72 [2019-03-28 12:36:39,580 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 172.61/109.72 [2019-03-28 12:36:39,581 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 172.61/109.72 [2019-03-28 12:36:39,581 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 172.61/109.72 [2019-03-28 12:36:39,581 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 172.61/109.72 [2019-03-28 12:36:39,581 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 172.61/109.72 [2019-03-28 12:36:39,582 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 172.61/109.72 Termination analysis: LINEAR_WITH_GUESSES 172.61/109.72 Number of strict supporting invariants: 0 172.61/109.72 Number of non-strict supporting invariants: 1 172.61/109.72 Consider only non-deceasing supporting invariants: true 172.61/109.72 Simplify termination arguments: true 172.61/109.72 Simplify supporting invariants: trueOverapproximate stem: false 172.61/109.72 [2019-03-28 12:36:39,582 INFO L339 nArgumentSynthesizer]: Template has degree 0. 172.61/109.72 [2019-03-28 12:36:39,582 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 172.61/109.72 [2019-03-28 12:36:39,582 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 172.61/109.72 [2019-03-28 12:36:39,582 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 172.61/109.72 [2019-03-28 12:36:39,582 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 172.61/109.72 [2019-03-28 12:36:39,583 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 172.61/109.72 [2019-03-28 12:36:39,583 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 172.61/109.72 [2019-03-28 12:36:39,583 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 172.61/109.72 [2019-03-28 12:36:39,583 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 172.61/109.72 Termination analysis: LINEAR_WITH_GUESSES 172.61/109.72 Number of strict supporting invariants: 0 172.61/109.72 Number of non-strict supporting invariants: 1 172.61/109.72 Consider only non-deceasing supporting invariants: true 172.61/109.72 Simplify termination arguments: true 172.61/109.72 Simplify supporting invariants: trueOverapproximate stem: false 172.61/109.72 [2019-03-28 12:36:39,584 INFO L339 nArgumentSynthesizer]: Template has degree 0. 172.61/109.72 [2019-03-28 12:36:39,584 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 172.61/109.72 [2019-03-28 12:36:39,584 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 172.61/109.72 [2019-03-28 12:36:39,584 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 172.61/109.72 [2019-03-28 12:36:39,584 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 172.61/109.72 [2019-03-28 12:36:39,585 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 172.61/109.72 [2019-03-28 12:36:39,585 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 172.61/109.72 [2019-03-28 12:36:39,585 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 172.61/109.72 [2019-03-28 12:36:39,585 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 172.61/109.72 Termination analysis: LINEAR_WITH_GUESSES 172.61/109.72 Number of strict supporting invariants: 0 172.61/109.72 Number of non-strict supporting invariants: 1 172.61/109.72 Consider only non-deceasing supporting invariants: true 172.61/109.72 Simplify termination arguments: true 172.61/109.72 Simplify supporting invariants: trueOverapproximate stem: false 172.61/109.72 [2019-03-28 12:36:39,586 INFO L339 nArgumentSynthesizer]: Template has degree 0. 172.61/109.72 [2019-03-28 12:36:39,586 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 172.61/109.72 [2019-03-28 12:36:39,586 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 172.61/109.72 [2019-03-28 12:36:39,586 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 172.61/109.72 [2019-03-28 12:36:39,586 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 172.61/109.72 [2019-03-28 12:36:39,586 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 172.61/109.72 [2019-03-28 12:36:39,587 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 172.61/109.72 [2019-03-28 12:36:39,587 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 172.61/109.72 [2019-03-28 12:36:39,587 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 172.61/109.72 Termination analysis: LINEAR_WITH_GUESSES 172.61/109.72 Number of strict supporting invariants: 0 172.61/109.72 Number of non-strict supporting invariants: 1 172.61/109.72 Consider only non-deceasing supporting invariants: true 172.61/109.72 Simplify termination arguments: true 172.61/109.72 Simplify supporting invariants: trueOverapproximate stem: false 172.61/109.72 [2019-03-28 12:36:39,587 INFO L339 nArgumentSynthesizer]: Template has degree 0. 172.61/109.72 [2019-03-28 12:36:39,588 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 172.61/109.72 [2019-03-28 12:36:39,588 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 172.61/109.72 [2019-03-28 12:36:39,588 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 172.61/109.72 [2019-03-28 12:36:39,588 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 172.61/109.72 [2019-03-28 12:36:39,588 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 172.61/109.72 [2019-03-28 12:36:39,588 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 172.61/109.72 [2019-03-28 12:36:39,589 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 172.61/109.72 [2019-03-28 12:36:39,589 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 172.61/109.72 Termination analysis: LINEAR_WITH_GUESSES 172.61/109.72 Number of strict supporting invariants: 0 172.61/109.72 Number of non-strict supporting invariants: 1 172.61/109.72 Consider only non-deceasing supporting invariants: true 172.61/109.72 Simplify termination arguments: true 172.61/109.72 Simplify supporting invariants: trueOverapproximate stem: false 172.61/109.72 [2019-03-28 12:36:39,589 INFO L339 nArgumentSynthesizer]: Template has degree 0. 172.61/109.72 [2019-03-28 12:36:39,590 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 172.61/109.72 [2019-03-28 12:36:39,590 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 172.61/109.72 [2019-03-28 12:36:39,590 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 172.61/109.72 [2019-03-28 12:36:39,591 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 172.61/109.72 [2019-03-28 12:36:39,591 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 172.61/109.72 [2019-03-28 12:36:39,595 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 172.61/109.72 [2019-03-28 12:36:39,595 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 172.61/109.72 Termination analysis: LINEAR_WITH_GUESSES 172.61/109.72 Number of strict supporting invariants: 0 172.61/109.72 Number of non-strict supporting invariants: 1 172.61/109.72 Consider only non-deceasing supporting invariants: true 172.61/109.72 Simplify termination arguments: true 172.61/109.72 Simplify supporting invariants: trueOverapproximate stem: false 172.61/109.72 [2019-03-28 12:36:39,595 INFO L339 nArgumentSynthesizer]: Template has degree 0. 172.61/109.72 [2019-03-28 12:36:39,596 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 172.61/109.72 [2019-03-28 12:36:39,596 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 172.61/109.72 [2019-03-28 12:36:39,596 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 172.61/109.72 [2019-03-28 12:36:39,597 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 172.61/109.72 [2019-03-28 12:36:39,597 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 172.61/109.72 [2019-03-28 12:36:39,601 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 172.61/109.72 [2019-03-28 12:36:39,601 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 172.61/109.72 Termination analysis: LINEAR_WITH_GUESSES 172.61/109.72 Number of strict supporting invariants: 0 172.61/109.72 Number of non-strict supporting invariants: 1 172.61/109.72 Consider only non-deceasing supporting invariants: true 172.61/109.72 Simplify termination arguments: true 172.61/109.72 Simplify supporting invariants: trueOverapproximate stem: false 172.61/109.72 [2019-03-28 12:36:39,601 INFO L339 nArgumentSynthesizer]: Template has degree 0. 172.61/109.72 [2019-03-28 12:36:39,602 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 172.61/109.72 [2019-03-28 12:36:39,602 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 172.61/109.72 [2019-03-28 12:36:39,602 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 172.61/109.72 [2019-03-28 12:36:39,604 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 172.61/109.72 [2019-03-28 12:36:39,604 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 172.61/109.72 [2019-03-28 12:36:39,614 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 172.61/109.72 [2019-03-28 12:36:39,614 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 172.61/109.72 Termination analysis: LINEAR_WITH_GUESSES 172.61/109.72 Number of strict supporting invariants: 0 172.61/109.72 Number of non-strict supporting invariants: 1 172.61/109.72 Consider only non-deceasing supporting invariants: true 172.61/109.72 Simplify termination arguments: true 172.61/109.72 Simplify supporting invariants: trueOverapproximate stem: false 172.61/109.72 [2019-03-28 12:36:39,615 INFO L339 nArgumentSynthesizer]: Template has degree 0. 172.61/109.72 [2019-03-28 12:36:39,615 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 172.61/109.72 [2019-03-28 12:36:39,615 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 172.61/109.72 [2019-03-28 12:36:39,615 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 172.61/109.72 [2019-03-28 12:36:39,616 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 172.61/109.72 [2019-03-28 12:36:39,616 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 172.61/109.72 [2019-03-28 12:36:39,617 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 172.61/109.72 [2019-03-28 12:36:39,617 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 172.61/109.72 Termination analysis: LINEAR_WITH_GUESSES 172.61/109.72 Number of strict supporting invariants: 0 172.61/109.72 Number of non-strict supporting invariants: 1 172.61/109.72 Consider only non-deceasing supporting invariants: true 172.61/109.72 Simplify termination arguments: true 172.61/109.72 Simplify supporting invariants: trueOverapproximate stem: false 172.61/109.72 [2019-03-28 12:36:39,618 INFO L339 nArgumentSynthesizer]: Template has degree 0. 172.61/109.72 [2019-03-28 12:36:39,618 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 172.61/109.72 [2019-03-28 12:36:39,618 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 172.61/109.72 [2019-03-28 12:36:39,618 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 172.61/109.72 [2019-03-28 12:36:39,619 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 172.61/109.72 [2019-03-28 12:36:39,619 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 172.61/109.72 [2019-03-28 12:36:39,622 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 172.61/109.72 [2019-03-28 12:36:39,623 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 172.61/109.72 Termination analysis: LINEAR_WITH_GUESSES 172.61/109.72 Number of strict supporting invariants: 0 172.61/109.72 Number of non-strict supporting invariants: 1 172.61/109.72 Consider only non-deceasing supporting invariants: true 172.61/109.72 Simplify termination arguments: true 172.61/109.72 Simplify supporting invariants: trueOverapproximate stem: false 172.61/109.72 [2019-03-28 12:36:39,623 INFO L339 nArgumentSynthesizer]: Template has degree 0. 172.61/109.72 [2019-03-28 12:36:39,623 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 172.61/109.72 [2019-03-28 12:36:39,623 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 172.61/109.72 [2019-03-28 12:36:39,623 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 172.61/109.72 [2019-03-28 12:36:39,624 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 172.61/109.72 [2019-03-28 12:36:39,624 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 172.61/109.72 [2019-03-28 12:36:39,625 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 172.61/109.72 [2019-03-28 12:36:39,626 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 172.61/109.72 Termination analysis: LINEAR_WITH_GUESSES 172.61/109.72 Number of strict supporting invariants: 0 172.61/109.72 Number of non-strict supporting invariants: 1 172.61/109.72 Consider only non-deceasing supporting invariants: true 172.61/109.72 Simplify termination arguments: true 172.61/109.72 Simplify supporting invariants: trueOverapproximate stem: false 172.61/109.72 [2019-03-28 12:36:39,626 INFO L339 nArgumentSynthesizer]: Template has degree 0. 172.61/109.72 [2019-03-28 12:36:39,626 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 172.61/109.72 [2019-03-28 12:36:39,626 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 172.61/109.72 [2019-03-28 12:36:39,626 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 172.61/109.72 [2019-03-28 12:36:39,630 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 172.61/109.72 [2019-03-28 12:36:39,630 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 172.61/109.72 [2019-03-28 12:36:39,650 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 172.61/109.72 [2019-03-28 12:36:39,665 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. 172.61/109.72 [2019-03-28 12:36:39,665 INFO L444 ModelExtractionUtils]: 50 out of 55 variables were initially zero. Simplification set additionally 2 variables to zero. 172.61/109.72 [2019-03-28 12:36:39,666 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 172.61/109.72 [2019-03-28 12:36:39,667 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. 172.61/109.72 [2019-03-28 12:36:39,667 INFO L518 LassoAnalysis]: Proved termination. 172.61/109.72 [2019-03-28 12:36:39,667 INFO L520 LassoAnalysis]: Termination argument consisting of: 172.61/109.72 Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc12.base)_2, ULTIMATE.start_substring_~ps2~0.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc12.base)_2 - 1*ULTIMATE.start_substring_~ps2~0.offset 172.61/109.72 Supporting invariants [] 172.61/109.72 [2019-03-28 12:36:39,735 INFO L297 tatePredicateManager]: 19 out of 21 supporting invariants were superfluous and have been removed 172.61/109.72 [2019-03-28 12:36:39,740 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.61/109.72 [2019-03-28 12:36:39,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 172.61/109.72 [2019-03-28 12:36:39,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 172.61/109.72 [2019-03-28 12:36:39,781 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 32 conjunts are in the unsatisfiable core 172.61/109.72 [2019-03-28 12:36:39,781 INFO L279 TraceCheckSpWp]: Computing forward predicates... 172.61/109.72 [2019-03-28 12:36:39,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 172.61/109.72 [2019-03-28 12:36:39,817 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 13 conjunts are in the unsatisfiable core 172.61/109.72 [2019-03-28 12:36:39,817 INFO L279 TraceCheckSpWp]: Computing forward predicates... 172.61/109.72 [2019-03-28 12:36:39,835 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 172.61/109.72 [2019-03-28 12:36:39,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 172.61/109.72 [2019-03-28 12:36:39,953 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 13 conjunts are in the unsatisfiable core 172.61/109.72 [2019-03-28 12:36:39,953 INFO L279 TraceCheckSpWp]: Computing forward predicates... 172.61/109.72 [2019-03-28 12:36:40,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 172.61/109.72 [2019-03-28 12:36:40,019 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 13 conjunts are in the unsatisfiable core 172.61/109.72 [2019-03-28 12:36:40,019 INFO L279 TraceCheckSpWp]: Computing forward predicates... 172.61/109.72 [2019-03-28 12:36:40,037 INFO L98 LoopCannibalizer]: 4 predicates before loop cannibalization 5 predicates after loop cannibalization 172.61/109.72 [2019-03-28 12:36:40,038 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.7 stem predicates 5 loop predicates 172.61/109.72 [2019-03-28 12:36:40,038 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 42 states and 59 transitions. cyclomatic complexity: 19 Second operand 5 states. 172.61/109.72 [2019-03-28 12:36:40,453 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 42 states and 59 transitions. cyclomatic complexity: 19. Second operand 5 states. Result 235 states and 313 transitions. Complement of second has 16 states. 172.61/109.72 [2019-03-28 12:36:40,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 10 states 4 stem states 4 non-accepting loop states 2 accepting loop states 172.61/109.72 [2019-03-28 12:36:40,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. 172.61/109.72 [2019-03-28 12:36:40,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 92 transitions. 172.61/109.72 [2019-03-28 12:36:40,454 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 92 transitions. Stem has 8 letters. Loop has 7 letters. 172.61/109.72 [2019-03-28 12:36:40,454 INFO L116 BuchiAccepts]: Finished buchiAccepts. 172.61/109.72 [2019-03-28 12:36:40,455 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 92 transitions. Stem has 15 letters. Loop has 7 letters. 172.61/109.72 [2019-03-28 12:36:40,455 INFO L116 BuchiAccepts]: Finished buchiAccepts. 172.61/109.72 [2019-03-28 12:36:40,455 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 92 transitions. Stem has 8 letters. Loop has 14 letters. 172.61/109.72 [2019-03-28 12:36:40,456 INFO L116 BuchiAccepts]: Finished buchiAccepts. 172.61/109.72 [2019-03-28 12:36:40,459 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 235 states and 313 transitions. 172.61/109.72 [2019-03-28 12:36:40,461 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 21 172.61/109.72 [2019-03-28 12:36:40,463 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 235 states to 159 states and 214 transitions. 172.61/109.72 [2019-03-28 12:36:40,463 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 43 172.61/109.72 [2019-03-28 12:36:40,463 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 44 172.61/109.72 [2019-03-28 12:36:40,463 INFO L73 IsDeterministic]: Start isDeterministic. Operand 159 states and 214 transitions. 172.61/109.72 [2019-03-28 12:36:40,463 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 172.61/109.72 [2019-03-28 12:36:40,463 INFO L706 BuchiCegarLoop]: Abstraction has 159 states and 214 transitions. 172.61/109.72 [2019-03-28 12:36:40,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states and 214 transitions. 172.61/109.72 [2019-03-28 12:36:40,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 60. 172.61/109.72 [2019-03-28 12:36:40,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. 172.61/109.72 [2019-03-28 12:36:40,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 83 transitions. 172.61/109.72 [2019-03-28 12:36:40,466 INFO L729 BuchiCegarLoop]: Abstraction has 60 states and 83 transitions. 172.61/109.72 [2019-03-28 12:36:40,466 INFO L609 BuchiCegarLoop]: Abstraction has 60 states and 83 transitions. 172.61/109.72 [2019-03-28 12:36:40,466 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ 172.61/109.72 [2019-03-28 12:36:40,466 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 60 states and 83 transitions. 172.61/109.72 [2019-03-28 12:36:40,467 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 172.61/109.72 [2019-03-28 12:36:40,467 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 172.61/109.72 [2019-03-28 12:36:40,467 INFO L119 BuchiIsEmpty]: Starting construction of run 172.61/109.72 [2019-03-28 12:36:40,467 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 172.61/109.72 [2019-03-28 12:36:40,467 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] 172.61/109.72 [2019-03-28 12:36:40,468 INFO L794 eck$LassoCheckResult]: Stem: 1318#ULTIMATE.startENTRY [189] ULTIMATE.startENTRY-->L24: Formula: (and (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|) (= |v_#valid_23| (store |v_#valid_24| 0 0))) InVars {#valid=|v_#valid_24|} OutVars{ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_6|, ULTIMATE.start_main_#t~malloc11.offset=|v_ULTIMATE.start_main_#t~malloc11.offset_5|, ULTIMATE.start_main_#t~nondet9=|v_ULTIMATE.start_main_#t~nondet9_6|, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_10, ULTIMATE.start_main_#t~malloc12.base=|v_ULTIMATE.start_main_#t~malloc12.base_5|, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~malloc11.base=|v_ULTIMATE.start_main_#t~malloc11.base_5|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_7, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_6, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~malloc12.offset=|v_ULTIMATE.start_main_#t~malloc12.offset_5|, ULTIMATE.start_main_#t~ret13=|v_ULTIMATE.start_main_#t~ret13_4|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, #valid=|v_#valid_23|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_6, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10, ULTIMATE.start_main_#t~malloc11.offset, ULTIMATE.start_main_#t~nondet9, ULTIMATE.start_main_~length1~0, ULTIMATE.start_main_#t~malloc12.base, #NULL.offset, ULTIMATE.start_main_#t~malloc11.base, ULTIMATE.start_main_~nondetString2~0.base, ULTIMATE.start_main_~nondetString2~0.offset, #NULL.base, ULTIMATE.start_main_#t~malloc12.offset, ULTIMATE.start_main_#t~ret13, ULTIMATE.start_main_~nondetString1~0.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_~nondetString1~0.offset, ULTIMATE.start_main_~length2~0] 1319#L24 [126] L24-->L24-2: Formula: (>= v_ULTIMATE.start_main_~length1~0_6 1) InVars {ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_6} OutVars{ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_6} AuxVars[] AssignedVars[] 1320#L24-2 [127] L24-2-->L27-1: Formula: (>= v_ULTIMATE.start_main_~length2~0_6 1) InVars {ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_6} OutVars{ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_6} AuxVars[] AssignedVars[] 1293#L27-1 [150] L27-1-->L32: Formula: (let ((.cse0 (store |v_#valid_10| |v_ULTIMATE.start_main_#t~malloc11.base_4| 1))) (and (= v_ULTIMATE.start_main_~nondetString1~0.offset_2 |v_ULTIMATE.start_main_#t~malloc11.offset_4|) (= v_ULTIMATE.start_main_~nondetString2~0.offset_2 |v_ULTIMATE.start_main_#t~malloc12.offset_4|) (= |v_ULTIMATE.start_main_#t~malloc11.offset_4| 0) (= 0 (select |v_#valid_10| |v_ULTIMATE.start_main_#t~malloc11.base_4|)) (> 0 |v_ULTIMATE.start_main_#t~malloc12.base_4|) (= |v_ULTIMATE.start_main_#t~malloc12.offset_4| 0) (= (store .cse0 |v_ULTIMATE.start_main_#t~malloc12.base_4| 1) |v_#valid_8|) (< |v_ULTIMATE.start_main_#t~malloc11.base_4| 0) (= v_ULTIMATE.start_main_~nondetString2~0.base_2 |v_ULTIMATE.start_main_#t~malloc12.base_4|) (= 0 (select .cse0 |v_ULTIMATE.start_main_#t~malloc12.base_4|)) (< |v_ULTIMATE.start_main_#t~malloc12.base_4| |v_#StackHeapBarrier_1|) (< |v_ULTIMATE.start_main_#t~malloc11.base_4| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_main_~nondetString1~0.base_2 |v_ULTIMATE.start_main_#t~malloc11.base_4|) (= |v_#length_3| (store (store |v_#length_5| |v_ULTIMATE.start_main_#t~malloc11.base_4| v_ULTIMATE.start_main_~length1~0_7) |v_ULTIMATE.start_main_#t~malloc12.base_4| v_ULTIMATE.start_main_~length2~0_7)))) InVars {ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_5|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_7, #valid=|v_#valid_10|} OutVars{ULTIMATE.start_main_#t~malloc11.offset=|v_ULTIMATE.start_main_#t~malloc11.offset_4|, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_7, ULTIMATE.start_main_#t~malloc12.base=|v_ULTIMATE.start_main_#t~malloc12.base_4|, ULTIMATE.start_main_#t~malloc11.base=|v_ULTIMATE.start_main_#t~malloc11.base_4|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_2, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_2, ULTIMATE.start_main_#t~malloc12.offset=|v_ULTIMATE.start_main_#t~malloc12.offset_4|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_2, #valid=|v_#valid_8|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_2, #length=|v_#length_3|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc12.offset, ULTIMATE.start_main_#t~malloc11.offset, ULTIMATE.start_main_~nondetString1~0.base, #valid, ULTIMATE.start_main_#t~malloc12.base, ULTIMATE.start_main_~nondetString1~0.offset, ULTIMATE.start_main_#t~malloc11.base, #length, ULTIMATE.start_main_~nondetString2~0.base, ULTIMATE.start_main_~nondetString2~0.offset] 1294#L32 [96] L32-->L32-1: Formula: (let ((.cse0 (+ v_ULTIMATE.start_main_~length1~0_8 v_ULTIMATE.start_main_~nondetString1~0.offset_3))) (and (<= 1 .cse0) (= 1 (select |v_#valid_11| v_ULTIMATE.start_main_~nondetString1~0.base_3)) (= |v_#memory_int_2| (store |v_#memory_int_3| v_ULTIMATE.start_main_~nondetString1~0.base_3 (store (select |v_#memory_int_3| v_ULTIMATE.start_main_~nondetString1~0.base_3) (+ v_ULTIMATE.start_main_~length1~0_8 v_ULTIMATE.start_main_~nondetString1~0.offset_3 (- 1)) 0))) (<= .cse0 (select |v_#length_6| v_ULTIMATE.start_main_~nondetString1~0.base_3)))) InVars {ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_3, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_3|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_3, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_8, #length=|v_#length_6|} OutVars{ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_3, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_3, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_8, #length=|v_#length_6|} AuxVars[] AssignedVars[#memory_int] 1314#L32-1 [190] L32-1-->L8-3: Formula: (let ((.cse0 (+ v_ULTIMATE.start_main_~length2~0_11 v_ULTIMATE.start_main_~nondetString2~0.offset_7))) (and (= v_ULTIMATE.start_substring_~ps~0.offset_8 v_ULTIMATE.start_substring_~s.offset_3) (<= 1 .cse0) (= v_ULTIMATE.start_main_~nondetString2~0.base_8 |v_ULTIMATE.start_substring_#in~t.base_2|) (= |v_ULTIMATE.start_substring_#in~s.offset_2| v_ULTIMATE.start_substring_~s.offset_3) (= (select |v_#valid_25| v_ULTIMATE.start_main_~nondetString2~0.base_8) 1) (= |v_ULTIMATE.start_substring_#in~t.base_2| v_ULTIMATE.start_substring_~t.base_4) (= |v_ULTIMATE.start_substring_#in~s.base_2| v_ULTIMATE.start_main_~nondetString1~0.base_8) (= (store |v_#memory_int_11| v_ULTIMATE.start_main_~nondetString2~0.base_8 (store (select |v_#memory_int_11| v_ULTIMATE.start_main_~nondetString2~0.base_8) (+ v_ULTIMATE.start_main_~length2~0_11 v_ULTIMATE.start_main_~nondetString2~0.offset_7 (- 1)) 0)) |v_#memory_int_10|) (= v_ULTIMATE.start_main_~nondetString2~0.offset_7 |v_ULTIMATE.start_substring_#in~t.offset_2|) (= v_ULTIMATE.start_main_~nondetString1~0.offset_7 |v_ULTIMATE.start_substring_#in~s.offset_2|) (= |v_ULTIMATE.start_substring_#in~t.offset_2| v_ULTIMATE.start_substring_~t.offset_4) (= |v_ULTIMATE.start_substring_#in~s.base_2| v_ULTIMATE.start_substring_~s.base_3) (= v_ULTIMATE.start_substring_~s.base_3 v_ULTIMATE.start_substring_~ps~0.base_9) (<= .cse0 (select |v_#length_18| v_ULTIMATE.start_main_~nondetString2~0.base_8)))) InVars {ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_8, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_7, #length=|v_#length_18|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_8, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_7, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_11} OutVars{ULTIMATE.start_substring_#in~t.offset=|v_ULTIMATE.start_substring_#in~t.offset_2|, ULTIMATE.start_substring_~ps~0.offset=v_ULTIMATE.start_substring_~ps~0.offset_8, ULTIMATE.start_substring_#t~post5.offset=|v_ULTIMATE.start_substring_#t~post5.offset_4|, ULTIMATE.start_substring_~ps2~0.base=v_ULTIMATE.start_substring_~ps2~0.base_8, ULTIMATE.start_substring_#t~mem7=|v_ULTIMATE.start_substring_#t~mem7_7|, ULTIMATE.start_substring_~t.offset=v_ULTIMATE.start_substring_~t.offset_4, ULTIMATE.start_substring_#t~mem3=|v_ULTIMATE.start_substring_#t~mem3_6|, ULTIMATE.start_substring_#t~mem2=|v_ULTIMATE.start_substring_#t~mem2_6|, ULTIMATE.start_substring_#t~mem1=|v_ULTIMATE.start_substring_#t~mem1_6|, ULTIMATE.start_substring_#in~s.offset=|v_ULTIMATE.start_substring_#in~s.offset_2|, ULTIMATE.start_substring_#t~mem0=|v_ULTIMATE.start_substring_#t~mem0_7|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_8, ULTIMATE.start_substring_~ps2~0.offset=v_ULTIMATE.start_substring_~ps2~0.offset_7, ULTIMATE.start_substring_~pt~0.base=v_ULTIMATE.start_substring_~pt~0.base_14, ULTIMATE.start_substring_#t~post8.offset=|v_ULTIMATE.start_substring_#t~post8.offset_4|, #length=|v_#length_18|, ULTIMATE.start_substring_~pt~0.offset=v_ULTIMATE.start_substring_~pt~0.offset_11, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_11, ULTIMATE.start_substring_#res=|v_ULTIMATE.start_substring_#res_5|, ULTIMATE.start_substring_#t~post6.offset=|v_ULTIMATE.start_substring_#t~post6.offset_4|, ULTIMATE.start_substring_~t.base=v_ULTIMATE.start_substring_~t.base_4, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_8, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_7, ULTIMATE.start_substring_~s.base=v_ULTIMATE.start_substring_~s.base_3, ULTIMATE.start_substring_#in~t.base=|v_ULTIMATE.start_substring_#in~t.base_2|, ULTIMATE.start_substring_#in~s.base=|v_ULTIMATE.start_substring_#in~s.base_2|, ULTIMATE.start_substring_#t~post6.base=|v_ULTIMATE.start_substring_#t~post6.base_4|, ULTIMATE.start_substring_#t~post8.base=|v_ULTIMATE.start_substring_#t~post8.base_4|, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_10|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_7, ULTIMATE.start_substring_~ps~0.base=v_ULTIMATE.start_substring_~ps~0.base_9, ULTIMATE.start_substring_#t~post5.base=|v_ULTIMATE.start_substring_#t~post5.base_4|, ULTIMATE.start_substring_~s.offset=v_ULTIMATE.start_substring_~s.offset_3, ULTIMATE.start_substring_#t~short4=|v_ULTIMATE.start_substring_#t~short4_10|} AuxVars[] AssignedVars[ULTIMATE.start_substring_#in~t.offset, ULTIMATE.start_substring_~ps~0.offset, ULTIMATE.start_substring_#t~post5.offset, ULTIMATE.start_substring_~ps2~0.base, ULTIMATE.start_substring_#t~mem7, ULTIMATE.start_substring_~t.offset, ULTIMATE.start_substring_#t~mem3, ULTIMATE.start_substring_#t~mem2, ULTIMATE.start_substring_#t~mem1, ULTIMATE.start_substring_#in~s.offset, ULTIMATE.start_substring_#t~mem0, ULTIMATE.start_substring_~ps2~0.offset, ULTIMATE.start_substring_~pt~0.base, ULTIMATE.start_substring_#t~post8.offset, ULTIMATE.start_substring_~pt~0.offset, ULTIMATE.start_substring_#res, ULTIMATE.start_substring_#t~post6.offset, ULTIMATE.start_substring_~t.base, ULTIMATE.start_substring_~s.base, ULTIMATE.start_substring_#in~t.base, ULTIMATE.start_substring_#in~s.base, ULTIMATE.start_substring_#t~post6.base, ULTIMATE.start_substring_#t~post8.base, #memory_int, ULTIMATE.start_substring_~ps~0.base, ULTIMATE.start_substring_#t~post5.base, ULTIMATE.start_substring_~s.offset, ULTIMATE.start_substring_#t~short4] 1295#L8-3 [113] L8-3-->L8-1: Formula: (and (= (select (select |v_#memory_int_6| v_ULTIMATE.start_substring_~ps~0.base_5) v_ULTIMATE.start_substring_~ps~0.offset_5) |v_ULTIMATE.start_substring_#t~mem0_2|) (= (select |v_#valid_15| v_ULTIMATE.start_substring_~ps~0.base_5) 1) (<= 0 v_ULTIMATE.start_substring_~ps~0.offset_5) (<= (+ v_ULTIMATE.start_substring_~ps~0.offset_5 1) (select |v_#length_10| v_ULTIMATE.start_substring_~ps~0.base_5))) InVars {ULTIMATE.start_substring_~ps~0.offset=v_ULTIMATE.start_substring_~ps~0.offset_5, #memory_int=|v_#memory_int_6|, #length=|v_#length_10|, ULTIMATE.start_substring_~ps~0.base=v_ULTIMATE.start_substring_~ps~0.base_5, #valid=|v_#valid_15|} OutVars{ULTIMATE.start_substring_#t~mem0=|v_ULTIMATE.start_substring_#t~mem0_2|, #valid=|v_#valid_15|, ULTIMATE.start_substring_~ps~0.offset=v_ULTIMATE.start_substring_~ps~0.offset_5, #memory_int=|v_#memory_int_6|, #length=|v_#length_10|, ULTIMATE.start_substring_~ps~0.base=v_ULTIMATE.start_substring_~ps~0.base_5} AuxVars[] AssignedVars[ULTIMATE.start_substring_#t~mem0] 1297#L8-1 [163] L8-1-->L11-9: Formula: (and (= v_ULTIMATE.start_substring_~ps2~0.base_2 v_ULTIMATE.start_substring_~ps~0.base_8) (= v_ULTIMATE.start_substring_~pt~0.offset_4 v_ULTIMATE.start_substring_~t.offset_3) (< 0 |v_ULTIMATE.start_substring_#t~mem0_6|) (= v_ULTIMATE.start_substring_~pt~0.base_5 v_ULTIMATE.start_substring_~t.base_3) (= v_ULTIMATE.start_substring_~ps2~0.offset_2 v_ULTIMATE.start_substring_~ps~0.offset_7)) InVars {ULTIMATE.start_substring_~ps~0.offset=v_ULTIMATE.start_substring_~ps~0.offset_7, ULTIMATE.start_substring_~t.offset=v_ULTIMATE.start_substring_~t.offset_3, ULTIMATE.start_substring_~ps~0.base=v_ULTIMATE.start_substring_~ps~0.base_8, ULTIMATE.start_substring_~t.base=v_ULTIMATE.start_substring_~t.base_3, ULTIMATE.start_substring_#t~mem0=|v_ULTIMATE.start_substring_#t~mem0_6|} OutVars{ULTIMATE.start_substring_~t.offset=v_ULTIMATE.start_substring_~t.offset_3, ULTIMATE.start_substring_#t~mem0=|v_ULTIMATE.start_substring_#t~mem0_5|, ULTIMATE.start_substring_~ps2~0.offset=v_ULTIMATE.start_substring_~ps2~0.offset_2, ULTIMATE.start_substring_~pt~0.base=v_ULTIMATE.start_substring_~pt~0.base_5, ULTIMATE.start_substring_~ps~0.offset=v_ULTIMATE.start_substring_~ps~0.offset_7, ULTIMATE.start_substring_~ps2~0.base=v_ULTIMATE.start_substring_~ps2~0.base_2, ULTIMATE.start_substring_~ps~0.base=v_ULTIMATE.start_substring_~ps~0.base_8, ULTIMATE.start_substring_~t.base=v_ULTIMATE.start_substring_~t.base_3, ULTIMATE.start_substring_~pt~0.offset=v_ULTIMATE.start_substring_~pt~0.offset_4} AuxVars[] AssignedVars[ULTIMATE.start_substring_#t~mem0, ULTIMATE.start_substring_~ps2~0.offset, ULTIMATE.start_substring_~pt~0.base, ULTIMATE.start_substring_~ps2~0.base, ULTIMATE.start_substring_~pt~0.offset] 1304#L11-9 [103] L11-9-->L11-1: Formula: (and (<= 0 v_ULTIMATE.start_substring_~pt~0.offset_5) (<= (+ v_ULTIMATE.start_substring_~pt~0.offset_5 1) (select |v_#length_12| v_ULTIMATE.start_substring_~pt~0.base_6)) (= |v_ULTIMATE.start_substring_#t~mem1_2| (select (select |v_#memory_int_7| v_ULTIMATE.start_substring_~pt~0.base_6) v_ULTIMATE.start_substring_~pt~0.offset_5)) (= (select |v_#valid_17| v_ULTIMATE.start_substring_~pt~0.base_6) 1)) InVars {#memory_int=|v_#memory_int_7|, #length=|v_#length_12|, ULTIMATE.start_substring_~pt~0.offset=v_ULTIMATE.start_substring_~pt~0.offset_5, ULTIMATE.start_substring_~pt~0.base=v_ULTIMATE.start_substring_~pt~0.base_6, #valid=|v_#valid_17|} OutVars{ULTIMATE.start_substring_#t~mem1=|v_ULTIMATE.start_substring_#t~mem1_2|, ULTIMATE.start_substring_~pt~0.base=v_ULTIMATE.start_substring_~pt~0.base_6, #valid=|v_#valid_17|, #memory_int=|v_#memory_int_7|, #length=|v_#length_12|, ULTIMATE.start_substring_~pt~0.offset=v_ULTIMATE.start_substring_~pt~0.offset_5} AuxVars[] AssignedVars[ULTIMATE.start_substring_#t~mem1] 1315#L11-1 [175] L11-1-->L11-2: Formula: (and |v_ULTIMATE.start_substring_#t~short4_2| (< 0 |v_ULTIMATE.start_substring_#t~mem1_3|)) InVars {ULTIMATE.start_substring_#t~mem1=|v_ULTIMATE.start_substring_#t~mem1_3|} OutVars{ULTIMATE.start_substring_#t~mem1=|v_ULTIMATE.start_substring_#t~mem1_3|, ULTIMATE.start_substring_#t~short4=|v_ULTIMATE.start_substring_#t~short4_2|} AuxVars[] AssignedVars[ULTIMATE.start_substring_#t~short4] 1311#L11-2 172.61/109.72 [2019-03-28 12:36:40,469 INFO L796 eck$LassoCheckResult]: Loop: 1311#L11-2 [90] L11-2-->L11-3: Formula: |v_ULTIMATE.start_substring_#t~short4_3| InVars {ULTIMATE.start_substring_#t~short4=|v_ULTIMATE.start_substring_#t~short4_3|} OutVars{ULTIMATE.start_substring_#t~short4=|v_ULTIMATE.start_substring_#t~short4_3|} AuxVars[] AssignedVars[] 1309#L11-3 [87] L11-3-->L11-4: Formula: (and (<= (+ v_ULTIMATE.start_substring_~pt~0.offset_7 1) (select |v_#length_14| v_ULTIMATE.start_substring_~pt~0.base_9)) (= 1 (select |v_#valid_19| v_ULTIMATE.start_substring_~pt~0.base_9)) (<= 0 v_ULTIMATE.start_substring_~pt~0.offset_7) (= (select (select |v_#memory_int_8| v_ULTIMATE.start_substring_~pt~0.base_9) v_ULTIMATE.start_substring_~pt~0.offset_7) |v_ULTIMATE.start_substring_#t~mem2_2|)) InVars {#memory_int=|v_#memory_int_8|, #length=|v_#length_14|, ULTIMATE.start_substring_~pt~0.offset=v_ULTIMATE.start_substring_~pt~0.offset_7, ULTIMATE.start_substring_~pt~0.base=v_ULTIMATE.start_substring_~pt~0.base_9, #valid=|v_#valid_19|} OutVars{ULTIMATE.start_substring_#t~mem2=|v_ULTIMATE.start_substring_#t~mem2_2|, ULTIMATE.start_substring_~pt~0.base=v_ULTIMATE.start_substring_~pt~0.base_9, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_8|, #length=|v_#length_14|, ULTIMATE.start_substring_~pt~0.offset=v_ULTIMATE.start_substring_~pt~0.offset_7} AuxVars[] AssignedVars[ULTIMATE.start_substring_#t~mem2] 1307#L11-4 [83] L11-4-->L11-5: Formula: (and (= (select |v_#valid_21| v_ULTIMATE.start_substring_~ps2~0.base_3) 1) (<= (+ v_ULTIMATE.start_substring_~ps2~0.offset_3 1) (select |v_#length_16| v_ULTIMATE.start_substring_~ps2~0.base_3)) (<= 0 v_ULTIMATE.start_substring_~ps2~0.offset_3) (= (select (select |v_#memory_int_9| v_ULTIMATE.start_substring_~ps2~0.base_3) v_ULTIMATE.start_substring_~ps2~0.offset_3) |v_ULTIMATE.start_substring_#t~mem3_2|)) InVars {#memory_int=|v_#memory_int_9|, #length=|v_#length_16|, ULTIMATE.start_substring_~ps2~0.base=v_ULTIMATE.start_substring_~ps2~0.base_3, ULTIMATE.start_substring_~ps2~0.offset=v_ULTIMATE.start_substring_~ps2~0.offset_3, #valid=|v_#valid_21|} OutVars{ULTIMATE.start_substring_#t~mem3=|v_ULTIMATE.start_substring_#t~mem3_2|, ULTIMATE.start_substring_~ps2~0.offset=v_ULTIMATE.start_substring_~ps2~0.offset_3, #valid=|v_#valid_21|, #memory_int=|v_#memory_int_9|, #length=|v_#length_16|, ULTIMATE.start_substring_~ps2~0.base=v_ULTIMATE.start_substring_~ps2~0.base_3} AuxVars[] AssignedVars[ULTIMATE.start_substring_#t~mem3] 1300#L11-5 [186] L11-5-->L11-7: Formula: (and (= |v_ULTIMATE.start_substring_#t~mem3_3| |v_ULTIMATE.start_substring_#t~mem2_3|) |v_ULTIMATE.start_substring_#t~short4_4|) InVars {ULTIMATE.start_substring_#t~mem2=|v_ULTIMATE.start_substring_#t~mem2_3|, ULTIMATE.start_substring_#t~mem3=|v_ULTIMATE.start_substring_#t~mem3_3|} OutVars{ULTIMATE.start_substring_#t~mem3=|v_ULTIMATE.start_substring_#t~mem3_3|, ULTIMATE.start_substring_#t~mem2=|v_ULTIMATE.start_substring_#t~mem2_3|, ULTIMATE.start_substring_#t~short4=|v_ULTIMATE.start_substring_#t~short4_4|} AuxVars[] AssignedVars[ULTIMATE.start_substring_#t~short4] 1301#L11-7 [109] L11-7-->L11-9: Formula: (and (= v_ULTIMATE.start_substring_~ps2~0.offset_5 (+ v_ULTIMATE.start_substring_~ps2~0.offset_6 1)) (= v_ULTIMATE.start_substring_~pt~0.base_13 v_ULTIMATE.start_substring_~pt~0.base_12) (= v_ULTIMATE.start_substring_~ps2~0.base_7 v_ULTIMATE.start_substring_~ps2~0.base_6) |v_ULTIMATE.start_substring_#t~short4_9| (= (+ v_ULTIMATE.start_substring_~pt~0.offset_10 1) v_ULTIMATE.start_substring_~pt~0.offset_9)) InVars {ULTIMATE.start_substring_~ps2~0.base=v_ULTIMATE.start_substring_~ps2~0.base_7, ULTIMATE.start_substring_~pt~0.offset=v_ULTIMATE.start_substring_~pt~0.offset_10, ULTIMATE.start_substring_~ps2~0.offset=v_ULTIMATE.start_substring_~ps2~0.offset_6, ULTIMATE.start_substring_~pt~0.base=v_ULTIMATE.start_substring_~pt~0.base_13, ULTIMATE.start_substring_#t~short4=|v_ULTIMATE.start_substring_#t~short4_9|} OutVars{ULTIMATE.start_substring_#t~post6.offset=|v_ULTIMATE.start_substring_#t~post6.offset_2|, ULTIMATE.start_substring_#t~post5.offset=|v_ULTIMATE.start_substring_#t~post5.offset_2|, ULTIMATE.start_substring_~ps2~0.base=v_ULTIMATE.start_substring_~ps2~0.base_6, ULTIMATE.start_substring_#t~post6.base=|v_ULTIMATE.start_substring_#t~post6.base_2|, ULTIMATE.start_substring_#t~mem3=|v_ULTIMATE.start_substring_#t~mem3_5|, ULTIMATE.start_substring_#t~mem2=|v_ULTIMATE.start_substring_#t~mem2_5|, ULTIMATE.start_substring_#t~mem1=|v_ULTIMATE.start_substring_#t~mem1_5|, ULTIMATE.start_substring_~ps2~0.offset=v_ULTIMATE.start_substring_~ps2~0.offset_5, ULTIMATE.start_substring_~pt~0.base=v_ULTIMATE.start_substring_~pt~0.base_12, ULTIMATE.start_substring_#t~post5.base=|v_ULTIMATE.start_substring_#t~post5.base_2|, ULTIMATE.start_substring_~pt~0.offset=v_ULTIMATE.start_substring_~pt~0.offset_9, ULTIMATE.start_substring_#t~short4=|v_ULTIMATE.start_substring_#t~short4_8|} AuxVars[] AssignedVars[ULTIMATE.start_substring_#t~post6.base, ULTIMATE.start_substring_#t~post6.offset, ULTIMATE.start_substring_#t~mem3, ULTIMATE.start_substring_#t~mem2, ULTIMATE.start_substring_#t~mem1, ULTIMATE.start_substring_~ps2~0.offset, ULTIMATE.start_substring_~pt~0.base, ULTIMATE.start_substring_#t~post5.offset, ULTIMATE.start_substring_~ps2~0.base, ULTIMATE.start_substring_#t~post5.base, ULTIMATE.start_substring_~pt~0.offset, ULTIMATE.start_substring_#t~short4] 1323#L11-9 [103] L11-9-->L11-1: Formula: (and (<= 0 v_ULTIMATE.start_substring_~pt~0.offset_5) (<= (+ v_ULTIMATE.start_substring_~pt~0.offset_5 1) (select |v_#length_12| v_ULTIMATE.start_substring_~pt~0.base_6)) (= |v_ULTIMATE.start_substring_#t~mem1_2| (select (select |v_#memory_int_7| v_ULTIMATE.start_substring_~pt~0.base_6) v_ULTIMATE.start_substring_~pt~0.offset_5)) (= (select |v_#valid_17| v_ULTIMATE.start_substring_~pt~0.base_6) 1)) InVars {#memory_int=|v_#memory_int_7|, #length=|v_#length_12|, ULTIMATE.start_substring_~pt~0.offset=v_ULTIMATE.start_substring_~pt~0.offset_5, ULTIMATE.start_substring_~pt~0.base=v_ULTIMATE.start_substring_~pt~0.base_6, #valid=|v_#valid_17|} OutVars{ULTIMATE.start_substring_#t~mem1=|v_ULTIMATE.start_substring_#t~mem1_2|, ULTIMATE.start_substring_~pt~0.base=v_ULTIMATE.start_substring_~pt~0.base_6, #valid=|v_#valid_17|, #memory_int=|v_#memory_int_7|, #length=|v_#length_12|, ULTIMATE.start_substring_~pt~0.offset=v_ULTIMATE.start_substring_~pt~0.offset_5} AuxVars[] AssignedVars[ULTIMATE.start_substring_#t~mem1] 1325#L11-1 [174] L11-1-->L11-2: Formula: (and (> 0 |v_ULTIMATE.start_substring_#t~mem1_3|) |v_ULTIMATE.start_substring_#t~short4_2|) InVars {ULTIMATE.start_substring_#t~mem1=|v_ULTIMATE.start_substring_#t~mem1_3|} OutVars{ULTIMATE.start_substring_#t~mem1=|v_ULTIMATE.start_substring_#t~mem1_3|, ULTIMATE.start_substring_#t~short4=|v_ULTIMATE.start_substring_#t~short4_2|} AuxVars[] AssignedVars[ULTIMATE.start_substring_#t~short4] 1311#L11-2 172.61/109.72 [2019-03-28 12:36:40,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 172.61/109.72 [2019-03-28 12:36:40,469 INFO L82 PathProgramCache]: Analyzing trace with hash 518279217, now seen corresponding path program 1 times 172.61/109.72 [2019-03-28 12:36:40,469 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 172.61/109.72 [2019-03-28 12:36:40,469 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 172.61/109.72 [2019-03-28 12:36:40,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 172.61/109.72 [2019-03-28 12:36:40,470 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 172.61/109.72 [2019-03-28 12:36:40,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 172.61/109.72 [2019-03-28 12:36:40,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 172.61/109.72 [2019-03-28 12:36:40,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 172.61/109.72 [2019-03-28 12:36:40,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 172.61/109.72 [2019-03-28 12:36:40,486 INFO L82 PathProgramCache]: Analyzing trace with hash -1708166673, now seen corresponding path program 2 times 172.61/109.72 [2019-03-28 12:36:40,486 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 172.61/109.72 [2019-03-28 12:36:40,486 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 172.61/109.72 [2019-03-28 12:36:40,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 172.61/109.72 [2019-03-28 12:36:40,487 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 172.61/109.72 [2019-03-28 12:36:40,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 172.61/109.72 [2019-03-28 12:36:40,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 172.61/109.72 [2019-03-28 12:36:40,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 172.61/109.72 [2019-03-28 12:36:40,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 172.61/109.72 [2019-03-28 12:36:40,492 INFO L82 PathProgramCache]: Analyzing trace with hash -1962308673, now seen corresponding path program 1 times 172.61/109.72 [2019-03-28 12:36:40,492 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 172.61/109.72 [2019-03-28 12:36:40,492 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 172.61/109.72 [2019-03-28 12:36:40,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 172.61/109.72 [2019-03-28 12:36:40,493 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 172.61/109.72 [2019-03-28 12:36:40,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 172.61/109.72 [2019-03-28 12:36:40,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 172.61/109.72 [2019-03-28 12:36:40,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 172.61/109.72 [2019-03-28 12:36:41,034 WARN L188 SmtUtils]: Spent 395.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 102 172.61/109.72 [2019-03-28 12:36:41,228 WARN L188 SmtUtils]: Spent 192.00 ms on a formula simplification that was a NOOP. DAG size: 96 172.61/109.72 [2019-03-28 12:36:41,230 INFO L216 LassoAnalysis]: Preferences: 172.61/109.72 [2019-03-28 12:36:41,230 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 172.61/109.72 [2019-03-28 12:36:41,230 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 172.61/109.72 [2019-03-28 12:36:41,230 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 172.61/109.72 [2019-03-28 12:36:41,230 INFO L127 ssoRankerPreferences]: Use exernal solver: false 172.61/109.72 [2019-03-28 12:36:41,230 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 172.61/109.72 [2019-03-28 12:36:41,231 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 172.61/109.72 [2019-03-28 12:36:41,231 INFO L130 ssoRankerPreferences]: Path of dumped script: 172.61/109.72 [2019-03-28 12:36:41,231 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration8_Lasso 172.61/109.72 [2019-03-28 12:36:41,231 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 172.61/109.72 [2019-03-28 12:36:41,231 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 172.61/109.72 [2019-03-28 12:36:41,233 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 172.61/109.72 [2019-03-28 12:36:41,235 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 172.61/109.72 [2019-03-28 12:36:41,237 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 172.61/109.72 [2019-03-28 12:36:41,239 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 172.61/109.72 [2019-03-28 12:36:41,241 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 172.61/109.72 [2019-03-28 12:36:41,242 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 172.61/109.72 [2019-03-28 12:36:41,244 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 172.61/109.72 [2019-03-28 12:36:41,245 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 172.61/109.72 [2019-03-28 12:36:41,247 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 172.61/109.72 [2019-03-28 12:36:41,248 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 172.61/109.72 [2019-03-28 12:36:41,250 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 172.61/109.72 [2019-03-28 12:36:41,650 WARN L188 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 87 172.61/109.72 [2019-03-28 12:36:41,808 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 62 172.61/109.72 [2019-03-28 12:36:41,808 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 172.61/109.72 [2019-03-28 12:36:41,810 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 172.61/109.72 [2019-03-28 12:36:41,811 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 172.61/109.72 [2019-03-28 12:36:41,813 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 172.61/109.72 [2019-03-28 12:36:41,814 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 172.61/109.72 [2019-03-28 12:36:41,815 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 172.61/109.72 [2019-03-28 12:36:41,817 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 172.61/109.72 [2019-03-28 12:36:41,821 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 172.61/109.72 [2019-03-28 12:36:42,322 INFO L300 LassoAnalysis]: Preprocessing complete. 172.61/109.72 [2019-03-28 12:36:42,323 INFO L497 LassoAnalysis]: Using template 'affine'. 172.61/109.72 [2019-03-28 12:36:42,323 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 172.61/109.72 Termination analysis: LINEAR_WITH_GUESSES 172.61/109.72 Number of strict supporting invariants: 0 172.61/109.72 Number of non-strict supporting invariants: 1 172.61/109.72 Consider only non-deceasing supporting invariants: true 172.61/109.72 Simplify termination arguments: true 172.61/109.72 Simplify supporting invariants: trueOverapproximate stem: false 172.61/109.72 [2019-03-28 12:36:42,324 INFO L339 nArgumentSynthesizer]: Template has degree 0. 172.61/109.72 [2019-03-28 12:36:42,324 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 172.61/109.72 [2019-03-28 12:36:42,324 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 172.61/109.72 [2019-03-28 12:36:42,324 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 172.61/109.72 [2019-03-28 12:36:42,324 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 172.61/109.72 [2019-03-28 12:36:42,325 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 172.61/109.72 [2019-03-28 12:36:42,325 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 172.61/109.72 [2019-03-28 12:36:42,325 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 172.61/109.72 [2019-03-28 12:36:42,326 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 172.61/109.72 Termination analysis: LINEAR_WITH_GUESSES 172.61/109.72 Number of strict supporting invariants: 0 172.61/109.72 Number of non-strict supporting invariants: 1 172.61/109.72 Consider only non-deceasing supporting invariants: true 172.61/109.72 Simplify termination arguments: true 172.61/109.72 Simplify supporting invariants: trueOverapproximate stem: false 172.61/109.72 [2019-03-28 12:36:42,326 INFO L339 nArgumentSynthesizer]: Template has degree 0. 172.61/109.72 [2019-03-28 12:36:42,326 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 172.61/109.72 [2019-03-28 12:36:42,326 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 172.61/109.72 [2019-03-28 12:36:42,326 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 172.61/109.72 [2019-03-28 12:36:42,326 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 172.61/109.72 [2019-03-28 12:36:42,327 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 172.61/109.72 [2019-03-28 12:36:42,327 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 172.61/109.72 [2019-03-28 12:36:42,327 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 172.61/109.72 [2019-03-28 12:36:42,327 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 172.61/109.72 Termination analysis: LINEAR_WITH_GUESSES 172.61/109.72 Number of strict supporting invariants: 0 172.61/109.72 Number of non-strict supporting invariants: 1 172.61/109.72 Consider only non-deceasing supporting invariants: true 172.61/109.72 Simplify termination arguments: true 172.61/109.72 Simplify supporting invariants: trueOverapproximate stem: false 172.61/109.72 [2019-03-28 12:36:42,328 INFO L339 nArgumentSynthesizer]: Template has degree 0. 172.61/109.72 [2019-03-28 12:36:42,328 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 172.61/109.72 [2019-03-28 12:36:42,328 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 172.61/109.72 [2019-03-28 12:36:42,328 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 172.61/109.72 [2019-03-28 12:36:42,329 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 172.61/109.72 [2019-03-28 12:36:42,329 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 172.61/109.72 [2019-03-28 12:36:42,330 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 172.61/109.72 [2019-03-28 12:36:42,330 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 172.61/109.72 Termination analysis: LINEAR_WITH_GUESSES 172.61/109.72 Number of strict supporting invariants: 0 172.61/109.72 Number of non-strict supporting invariants: 1 172.61/109.72 Consider only non-deceasing supporting invariants: true 172.61/109.72 Simplify termination arguments: true 172.61/109.72 Simplify supporting invariants: trueOverapproximate stem: false 172.61/109.72 [2019-03-28 12:36:42,330 INFO L339 nArgumentSynthesizer]: Template has degree 0. 172.61/109.72 [2019-03-28 12:36:42,330 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 172.61/109.72 [2019-03-28 12:36:42,331 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 172.61/109.72 [2019-03-28 12:36:42,331 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 172.61/109.72 [2019-03-28 12:36:42,331 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 172.61/109.72 [2019-03-28 12:36:42,331 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 172.61/109.72 [2019-03-28 12:36:42,331 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 172.61/109.72 [2019-03-28 12:36:42,332 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 172.61/109.72 [2019-03-28 12:36:42,333 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 172.61/109.72 Termination analysis: LINEAR_WITH_GUESSES 172.61/109.72 Number of strict supporting invariants: 0 172.61/109.72 Number of non-strict supporting invariants: 1 172.61/109.72 Consider only non-deceasing supporting invariants: true 172.61/109.72 Simplify termination arguments: true 172.61/109.72 Simplify supporting invariants: trueOverapproximate stem: false 172.61/109.72 [2019-03-28 12:36:42,333 INFO L339 nArgumentSynthesizer]: Template has degree 0. 172.61/109.72 [2019-03-28 12:36:42,333 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 172.61/109.72 [2019-03-28 12:36:42,333 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 172.61/109.72 [2019-03-28 12:36:42,333 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 172.61/109.72 [2019-03-28 12:36:42,334 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 172.61/109.72 [2019-03-28 12:36:42,334 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 172.61/109.72 [2019-03-28 12:36:42,334 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 172.61/109.72 [2019-03-28 12:36:42,334 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 172.61/109.72 [2019-03-28 12:36:42,334 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 172.61/109.72 Termination analysis: LINEAR_WITH_GUESSES 172.61/109.72 Number of strict supporting invariants: 0 172.61/109.72 Number of non-strict supporting invariants: 1 172.61/109.72 Consider only non-deceasing supporting invariants: true 172.61/109.72 Simplify termination arguments: true 172.61/109.72 Simplify supporting invariants: trueOverapproximate stem: false 172.61/109.72 [2019-03-28 12:36:42,335 INFO L339 nArgumentSynthesizer]: Template has degree 0. 172.61/109.72 [2019-03-28 12:36:42,335 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 172.61/109.72 [2019-03-28 12:36:42,335 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 172.61/109.72 [2019-03-28 12:36:42,335 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 172.61/109.72 [2019-03-28 12:36:42,336 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 172.61/109.72 [2019-03-28 12:36:42,336 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 172.61/109.72 [2019-03-28 12:36:42,337 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 172.61/109.72 [2019-03-28 12:36:42,337 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 172.61/109.72 Termination analysis: LINEAR_WITH_GUESSES 172.61/109.72 Number of strict supporting invariants: 0 172.61/109.72 Number of non-strict supporting invariants: 1 172.61/109.72 Consider only non-deceasing supporting invariants: true 172.61/109.72 Simplify termination arguments: true 172.61/109.72 Simplify supporting invariants: trueOverapproximate stem: false 172.61/109.72 [2019-03-28 12:36:42,337 INFO L339 nArgumentSynthesizer]: Template has degree 0. 172.61/109.72 [2019-03-28 12:36:42,337 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 172.61/109.72 [2019-03-28 12:36:42,338 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 172.61/109.72 [2019-03-28 12:36:42,338 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 172.61/109.72 [2019-03-28 12:36:42,338 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 172.61/109.72 [2019-03-28 12:36:42,338 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 172.61/109.72 [2019-03-28 12:36:42,338 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 172.61/109.72 [2019-03-28 12:36:42,338 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 172.61/109.72 [2019-03-28 12:36:42,339 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 172.61/109.72 Termination analysis: LINEAR_WITH_GUESSES 172.61/109.72 Number of strict supporting invariants: 0 172.61/109.72 Number of non-strict supporting invariants: 1 172.61/109.72 Consider only non-deceasing supporting invariants: true 172.61/109.72 Simplify termination arguments: true 172.61/109.72 Simplify supporting invariants: trueOverapproximate stem: false 172.61/109.72 [2019-03-28 12:36:42,339 INFO L339 nArgumentSynthesizer]: Template has degree 0. 172.61/109.72 [2019-03-28 12:36:42,339 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 172.61/109.72 [2019-03-28 12:36:42,339 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 172.61/109.72 [2019-03-28 12:36:42,339 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 172.61/109.72 [2019-03-28 12:36:42,339 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 172.61/109.72 [2019-03-28 12:36:42,340 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 172.61/109.72 [2019-03-28 12:36:42,340 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 172.61/109.72 [2019-03-28 12:36:42,340 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 172.61/109.72 [2019-03-28 12:36:42,340 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 172.61/109.72 Termination analysis: LINEAR_WITH_GUESSES 172.61/109.72 Number of strict supporting invariants: 0 172.61/109.72 Number of non-strict supporting invariants: 1 172.61/109.72 Consider only non-deceasing supporting invariants: true 172.61/109.72 Simplify termination arguments: true 172.61/109.72 Simplify supporting invariants: trueOverapproximate stem: false 172.61/109.72 [2019-03-28 12:36:42,341 INFO L339 nArgumentSynthesizer]: Template has degree 0. 172.61/109.72 [2019-03-28 12:36:42,341 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 172.61/109.72 [2019-03-28 12:36:42,341 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 172.61/109.72 [2019-03-28 12:36:42,341 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 172.61/109.72 [2019-03-28 12:36:42,341 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 172.61/109.72 [2019-03-28 12:36:42,342 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 172.61/109.72 [2019-03-28 12:36:42,342 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 172.61/109.72 [2019-03-28 12:36:42,342 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 172.61/109.72 [2019-03-28 12:36:42,342 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 172.61/109.72 Termination analysis: LINEAR_WITH_GUESSES 172.61/109.72 Number of strict supporting invariants: 0 172.61/109.72 Number of non-strict supporting invariants: 1 172.61/109.72 Consider only non-deceasing supporting invariants: true 172.61/109.72 Simplify termination arguments: true 172.61/109.72 Simplify supporting invariants: trueOverapproximate stem: false 172.61/109.72 [2019-03-28 12:36:42,343 INFO L339 nArgumentSynthesizer]: Template has degree 0. 172.61/109.72 [2019-03-28 12:36:42,343 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 172.61/109.72 [2019-03-28 12:36:42,343 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 172.61/109.72 [2019-03-28 12:36:42,343 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 172.61/109.72 [2019-03-28 12:36:42,343 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 172.61/109.72 [2019-03-28 12:36:42,343 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 172.61/109.72 [2019-03-28 12:36:42,344 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 172.61/109.72 [2019-03-28 12:36:42,344 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 172.61/109.72 [2019-03-28 12:36:42,344 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 172.61/109.72 Termination analysis: LINEAR_WITH_GUESSES 172.61/109.72 Number of strict supporting invariants: 0 172.61/109.72 Number of non-strict supporting invariants: 1 172.61/109.72 Consider only non-deceasing supporting invariants: true 172.61/109.72 Simplify termination arguments: true 172.61/109.72 Simplify supporting invariants: trueOverapproximate stem: false 172.61/109.72 [2019-03-28 12:36:42,345 INFO L339 nArgumentSynthesizer]: Template has degree 0. 172.61/109.72 [2019-03-28 12:36:42,345 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 172.61/109.72 [2019-03-28 12:36:42,345 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 172.61/109.72 [2019-03-28 12:36:42,345 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 172.61/109.72 [2019-03-28 12:36:42,346 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 172.61/109.72 [2019-03-28 12:36:42,346 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 172.61/109.72 [2019-03-28 12:36:42,349 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 172.61/109.72 [2019-03-28 12:36:42,349 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 172.61/109.72 Termination analysis: LINEAR_WITH_GUESSES 172.61/109.72 Number of strict supporting invariants: 0 172.61/109.72 Number of non-strict supporting invariants: 1 172.61/109.72 Consider only non-deceasing supporting invariants: true 172.61/109.72 Simplify termination arguments: true 172.61/109.72 Simplify supporting invariants: trueOverapproximate stem: false 172.61/109.72 [2019-03-28 12:36:42,350 INFO L339 nArgumentSynthesizer]: Template has degree 0. 172.61/109.72 [2019-03-28 12:36:42,350 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 172.61/109.72 [2019-03-28 12:36:42,350 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 172.61/109.72 [2019-03-28 12:36:42,350 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 172.61/109.72 [2019-03-28 12:36:42,351 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 172.61/109.72 [2019-03-28 12:36:42,351 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 172.61/109.72 [2019-03-28 12:36:42,352 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 172.61/109.72 [2019-03-28 12:36:42,352 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 172.61/109.72 Termination analysis: LINEAR_WITH_GUESSES 172.61/109.72 Number of strict supporting invariants: 0 172.61/109.72 Number of non-strict supporting invariants: 1 172.61/109.72 Consider only non-deceasing supporting invariants: true 172.61/109.72 Simplify termination arguments: true 172.61/109.72 Simplify supporting invariants: trueOverapproximate stem: false 172.61/109.72 [2019-03-28 12:36:42,353 INFO L339 nArgumentSynthesizer]: Template has degree 0. 172.61/109.72 [2019-03-28 12:36:42,353 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 172.61/109.72 [2019-03-28 12:36:42,353 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 172.61/109.72 [2019-03-28 12:36:42,353 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 172.61/109.72 [2019-03-28 12:36:42,354 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 172.61/109.72 [2019-03-28 12:36:42,354 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 172.61/109.72 [2019-03-28 12:36:42,355 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 172.61/109.72 [2019-03-28 12:36:42,355 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 172.61/109.72 Termination analysis: LINEAR_WITH_GUESSES 172.61/109.72 Number of strict supporting invariants: 0 172.61/109.72 Number of non-strict supporting invariants: 1 172.61/109.72 Consider only non-deceasing supporting invariants: true 172.61/109.72 Simplify termination arguments: true 172.61/109.72 Simplify supporting invariants: trueOverapproximate stem: false 172.61/109.72 [2019-03-28 12:36:42,355 INFO L339 nArgumentSynthesizer]: Template has degree 0. 172.61/109.72 [2019-03-28 12:36:42,355 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 172.61/109.72 [2019-03-28 12:36:42,356 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 172.61/109.72 [2019-03-28 12:36:42,356 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 172.61/109.72 [2019-03-28 12:36:42,356 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 172.61/109.72 [2019-03-28 12:36:42,356 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 172.61/109.72 [2019-03-28 12:36:42,357 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 172.61/109.72 [2019-03-28 12:36:42,358 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 172.61/109.72 Termination analysis: LINEAR_WITH_GUESSES 172.61/109.72 Number of strict supporting invariants: 0 172.61/109.72 Number of non-strict supporting invariants: 1 172.61/109.72 Consider only non-deceasing supporting invariants: true 172.61/109.72 Simplify termination arguments: true 172.61/109.72 Simplify supporting invariants: trueOverapproximate stem: false 172.61/109.72 [2019-03-28 12:36:42,358 INFO L339 nArgumentSynthesizer]: Template has degree 0. 172.61/109.72 [2019-03-28 12:36:42,358 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 172.61/109.72 [2019-03-28 12:36:42,358 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 172.61/109.72 [2019-03-28 12:36:42,358 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 172.61/109.72 [2019-03-28 12:36:42,359 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 172.61/109.72 [2019-03-28 12:36:42,359 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 172.61/109.72 [2019-03-28 12:36:42,365 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 172.61/109.72 [2019-03-28 12:36:42,366 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 172.61/109.72 Termination analysis: LINEAR_WITH_GUESSES 172.61/109.72 Number of strict supporting invariants: 0 172.61/109.72 Number of non-strict supporting invariants: 1 172.61/109.72 Consider only non-deceasing supporting invariants: true 172.61/109.72 Simplify termination arguments: true 172.61/109.72 Simplify supporting invariants: trueOverapproximate stem: false 172.61/109.72 [2019-03-28 12:36:42,366 INFO L339 nArgumentSynthesizer]: Template has degree 0. 172.61/109.72 [2019-03-28 12:36:42,367 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 172.61/109.72 [2019-03-28 12:36:42,367 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 172.61/109.72 [2019-03-28 12:36:42,367 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 172.61/109.72 [2019-03-28 12:36:42,369 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 172.61/109.72 [2019-03-28 12:36:42,369 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 172.61/109.72 [2019-03-28 12:36:42,378 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 172.61/109.72 [2019-03-28 12:36:42,378 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 172.61/109.72 Termination analysis: LINEAR_WITH_GUESSES 172.61/109.72 Number of strict supporting invariants: 0 172.61/109.72 Number of non-strict supporting invariants: 1 172.61/109.72 Consider only non-deceasing supporting invariants: true 172.61/109.72 Simplify termination arguments: true 172.61/109.72 Simplify supporting invariants: trueOverapproximate stem: false 172.61/109.72 [2019-03-28 12:36:42,379 INFO L339 nArgumentSynthesizer]: Template has degree 0. 172.61/109.72 [2019-03-28 12:36:42,379 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 172.61/109.72 [2019-03-28 12:36:42,379 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 172.61/109.72 [2019-03-28 12:36:42,379 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 172.61/109.72 [2019-03-28 12:36:42,380 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 172.61/109.72 [2019-03-28 12:36:42,380 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 172.61/109.72 [2019-03-28 12:36:42,383 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 172.61/109.72 [2019-03-28 12:36:42,384 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 172.61/109.72 Termination analysis: LINEAR_WITH_GUESSES 172.61/109.72 Number of strict supporting invariants: 0 172.61/109.72 Number of non-strict supporting invariants: 1 172.61/109.72 Consider only non-deceasing supporting invariants: true 172.61/109.72 Simplify termination arguments: true 172.61/109.72 Simplify supporting invariants: trueOverapproximate stem: false 172.61/109.72 [2019-03-28 12:36:42,384 INFO L339 nArgumentSynthesizer]: Template has degree 0. 172.61/109.72 [2019-03-28 12:36:42,384 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 172.61/109.72 [2019-03-28 12:36:42,384 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 172.61/109.72 [2019-03-28 12:36:42,384 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 172.61/109.72 [2019-03-28 12:36:42,385 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 172.61/109.72 [2019-03-28 12:36:42,385 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 172.61/109.72 [2019-03-28 12:36:42,387 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 172.61/109.72 [2019-03-28 12:36:42,387 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 172.61/109.72 Termination analysis: LINEAR_WITH_GUESSES 172.61/109.72 Number of strict supporting invariants: 0 172.61/109.72 Number of non-strict supporting invariants: 1 172.61/109.72 Consider only non-deceasing supporting invariants: true 172.61/109.72 Simplify termination arguments: true 172.61/109.72 Simplify supporting invariants: trueOverapproximate stem: false 172.61/109.72 [2019-03-28 12:36:42,387 INFO L339 nArgumentSynthesizer]: Template has degree 0. 172.61/109.72 [2019-03-28 12:36:42,387 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 172.61/109.72 [2019-03-28 12:36:42,388 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 172.61/109.72 [2019-03-28 12:36:42,388 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 172.61/109.72 [2019-03-28 12:36:42,390 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 172.61/109.72 [2019-03-28 12:36:42,390 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 172.61/109.72 [2019-03-28 12:36:42,409 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 172.61/109.72 [2019-03-28 12:36:42,427 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. 172.61/109.72 [2019-03-28 12:36:42,428 INFO L444 ModelExtractionUtils]: 43 out of 49 variables were initially zero. Simplification set additionally 3 variables to zero. 172.61/109.72 [2019-03-28 12:36:42,428 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 172.61/109.72 [2019-03-28 12:36:42,429 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. 172.61/109.72 [2019-03-28 12:36:42,429 INFO L518 LassoAnalysis]: Proved termination. 172.61/109.72 [2019-03-28 12:36:42,429 INFO L520 LassoAnalysis]: Termination argument consisting of: 172.61/109.72 Ranking function f(v_rep(select #length ULTIMATE.start_substring_~ps~0.base)_2, ULTIMATE.start_substring_~ps2~0.offset) = 1*v_rep(select #length ULTIMATE.start_substring_~ps~0.base)_2 - 1*ULTIMATE.start_substring_~ps2~0.offset 172.61/109.72 Supporting invariants [] 172.61/109.72 [2019-03-28 12:36:42,512 INFO L297 tatePredicateManager]: 23 out of 24 supporting invariants were superfluous and have been removed 172.61/109.72 [2019-03-28 12:36:42,514 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.61/109.72 [2019-03-28 12:36:42,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 172.61/109.72 [2019-03-28 12:36:42,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 172.61/109.72 [2019-03-28 12:36:42,561 INFO L256 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 4 conjunts are in the unsatisfiable core 172.61/109.72 [2019-03-28 12:36:42,561 INFO L279 TraceCheckSpWp]: Computing forward predicates... 172.61/109.72 [2019-03-28 12:36:42,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 172.61/109.72 [2019-03-28 12:36:42,572 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 8 conjunts are in the unsatisfiable core 172.61/109.72 [2019-03-28 12:36:42,573 INFO L279 TraceCheckSpWp]: Computing forward predicates... 172.61/109.72 [2019-03-28 12:36:42,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 172.61/109.72 [2019-03-28 12:36:42,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 172.61/109.72 [2019-03-28 12:36:42,668 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 8 conjunts are in the unsatisfiable core 172.61/109.72 [2019-03-28 12:36:42,669 INFO L279 TraceCheckSpWp]: Computing forward predicates... 172.61/109.72 [2019-03-28 12:36:42,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 172.61/109.72 [2019-03-28 12:36:42,692 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 8 conjunts are in the unsatisfiable core 172.61/109.72 [2019-03-28 12:36:42,693 INFO L279 TraceCheckSpWp]: Computing forward predicates... 172.61/109.72 [2019-03-28 12:36:42,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 172.61/109.72 [2019-03-28 12:36:42,722 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 8 conjunts are in the unsatisfiable core 172.61/109.72 [2019-03-28 12:36:42,722 INFO L279 TraceCheckSpWp]: Computing forward predicates... 172.61/109.72 [2019-03-28 12:36:42,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 172.61/109.72 [2019-03-28 12:36:42,735 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 8 conjunts are in the unsatisfiable core 172.61/109.72 [2019-03-28 12:36:42,735 INFO L279 TraceCheckSpWp]: Computing forward predicates... 172.61/109.72 [2019-03-28 12:36:42,737 INFO L98 LoopCannibalizer]: 5 predicates before loop cannibalization 5 predicates after loop cannibalization 172.61/109.72 [2019-03-28 12:36:42,737 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 5 loop predicates 172.61/109.72 [2019-03-28 12:36:42,738 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 60 states and 83 transitions. cyclomatic complexity: 26 Second operand 6 states. 172.61/109.72 [2019-03-28 12:36:42,996 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 60 states and 83 transitions. cyclomatic complexity: 26. Second operand 6 states. Result 310 states and 418 transitions. Complement of second has 27 states. 172.61/109.72 [2019-03-28 12:36:42,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states 172.61/109.72 [2019-03-28 12:36:42,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. 172.61/109.72 [2019-03-28 12:36:42,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 67 transitions. 172.61/109.72 [2019-03-28 12:36:42,998 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 67 transitions. Stem has 10 letters. Loop has 7 letters. 172.61/109.72 [2019-03-28 12:36:42,998 INFO L116 BuchiAccepts]: Finished buchiAccepts. 172.61/109.72 [2019-03-28 12:36:42,999 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 67 transitions. Stem has 17 letters. Loop has 7 letters. 172.61/109.72 [2019-03-28 12:36:42,999 INFO L116 BuchiAccepts]: Finished buchiAccepts. 172.61/109.72 [2019-03-28 12:36:42,999 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 67 transitions. Stem has 10 letters. Loop has 14 letters. 172.61/109.72 [2019-03-28 12:36:42,999 INFO L116 BuchiAccepts]: Finished buchiAccepts. 172.61/109.72 [2019-03-28 12:36:43,003 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 310 states and 418 transitions. 172.61/109.72 [2019-03-28 12:36:43,005 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 172.61/109.72 [2019-03-28 12:36:43,006 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 310 states to 151 states and 198 transitions. 172.61/109.72 [2019-03-28 12:36:43,007 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 172.61/109.72 [2019-03-28 12:36:43,007 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 172.61/109.72 [2019-03-28 12:36:43,007 INFO L73 IsDeterministic]: Start isDeterministic. Operand 151 states and 198 transitions. 172.61/109.72 [2019-03-28 12:36:43,007 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 172.61/109.72 [2019-03-28 12:36:43,007 INFO L706 BuchiCegarLoop]: Abstraction has 151 states and 198 transitions. 172.61/109.72 [2019-03-28 12:36:43,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states and 198 transitions. 172.61/109.72 [2019-03-28 12:36:43,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 54. 172.61/109.72 [2019-03-28 12:36:43,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. 172.61/109.72 [2019-03-28 12:36:43,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 73 transitions. 172.61/109.72 [2019-03-28 12:36:43,009 INFO L729 BuchiCegarLoop]: Abstraction has 54 states and 73 transitions. 172.61/109.72 [2019-03-28 12:36:43,010 INFO L609 BuchiCegarLoop]: Abstraction has 54 states and 73 transitions. 172.61/109.72 [2019-03-28 12:36:43,010 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ 172.61/109.72 [2019-03-28 12:36:43,010 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 54 states and 73 transitions. 172.61/109.72 [2019-03-28 12:36:43,010 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 172.61/109.72 [2019-03-28 12:36:43,010 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 172.61/109.72 [2019-03-28 12:36:43,011 INFO L119 BuchiIsEmpty]: Starting construction of run 172.61/109.72 [2019-03-28 12:36:43,011 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 172.61/109.72 [2019-03-28 12:36:43,011 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] 172.61/109.72 [2019-03-28 12:36:43,012 INFO L794 eck$LassoCheckResult]: Stem: 1964#ULTIMATE.startENTRY [189] ULTIMATE.startENTRY-->L24: Formula: (and (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|) (= |v_#valid_23| (store |v_#valid_24| 0 0))) InVars {#valid=|v_#valid_24|} OutVars{ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_6|, ULTIMATE.start_main_#t~malloc11.offset=|v_ULTIMATE.start_main_#t~malloc11.offset_5|, ULTIMATE.start_main_#t~nondet9=|v_ULTIMATE.start_main_#t~nondet9_6|, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_10, ULTIMATE.start_main_#t~malloc12.base=|v_ULTIMATE.start_main_#t~malloc12.base_5|, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~malloc11.base=|v_ULTIMATE.start_main_#t~malloc11.base_5|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_7, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_6, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~malloc12.offset=|v_ULTIMATE.start_main_#t~malloc12.offset_5|, ULTIMATE.start_main_#t~ret13=|v_ULTIMATE.start_main_#t~ret13_4|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, #valid=|v_#valid_23|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_6, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10, ULTIMATE.start_main_#t~malloc11.offset, ULTIMATE.start_main_#t~nondet9, ULTIMATE.start_main_~length1~0, ULTIMATE.start_main_#t~malloc12.base, #NULL.offset, ULTIMATE.start_main_#t~malloc11.base, ULTIMATE.start_main_~nondetString2~0.base, ULTIMATE.start_main_~nondetString2~0.offset, #NULL.base, ULTIMATE.start_main_#t~malloc12.offset, ULTIMATE.start_main_#t~ret13, ULTIMATE.start_main_~nondetString1~0.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_~nondetString1~0.offset, ULTIMATE.start_main_~length2~0] 1965#L24 [126] L24-->L24-2: Formula: (>= v_ULTIMATE.start_main_~length1~0_6 1) InVars {ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_6} OutVars{ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_6} AuxVars[] AssignedVars[] 1966#L24-2 [127] L24-2-->L27-1: Formula: (>= v_ULTIMATE.start_main_~length2~0_6 1) InVars {ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_6} OutVars{ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_6} AuxVars[] AssignedVars[] 1942#L27-1 [150] L27-1-->L32: Formula: (let ((.cse0 (store |v_#valid_10| |v_ULTIMATE.start_main_#t~malloc11.base_4| 1))) (and (= v_ULTIMATE.start_main_~nondetString1~0.offset_2 |v_ULTIMATE.start_main_#t~malloc11.offset_4|) (= v_ULTIMATE.start_main_~nondetString2~0.offset_2 |v_ULTIMATE.start_main_#t~malloc12.offset_4|) (= |v_ULTIMATE.start_main_#t~malloc11.offset_4| 0) (= 0 (select |v_#valid_10| |v_ULTIMATE.start_main_#t~malloc11.base_4|)) (> 0 |v_ULTIMATE.start_main_#t~malloc12.base_4|) (= |v_ULTIMATE.start_main_#t~malloc12.offset_4| 0) (= (store .cse0 |v_ULTIMATE.start_main_#t~malloc12.base_4| 1) |v_#valid_8|) (< |v_ULTIMATE.start_main_#t~malloc11.base_4| 0) (= v_ULTIMATE.start_main_~nondetString2~0.base_2 |v_ULTIMATE.start_main_#t~malloc12.base_4|) (= 0 (select .cse0 |v_ULTIMATE.start_main_#t~malloc12.base_4|)) (< |v_ULTIMATE.start_main_#t~malloc12.base_4| |v_#StackHeapBarrier_1|) (< |v_ULTIMATE.start_main_#t~malloc11.base_4| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_main_~nondetString1~0.base_2 |v_ULTIMATE.start_main_#t~malloc11.base_4|) (= |v_#length_3| (store (store |v_#length_5| |v_ULTIMATE.start_main_#t~malloc11.base_4| v_ULTIMATE.start_main_~length1~0_7) |v_ULTIMATE.start_main_#t~malloc12.base_4| v_ULTIMATE.start_main_~length2~0_7)))) InVars {ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_5|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_7, #valid=|v_#valid_10|} OutVars{ULTIMATE.start_main_#t~malloc11.offset=|v_ULTIMATE.start_main_#t~malloc11.offset_4|, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_7, ULTIMATE.start_main_#t~malloc12.base=|v_ULTIMATE.start_main_#t~malloc12.base_4|, ULTIMATE.start_main_#t~malloc11.base=|v_ULTIMATE.start_main_#t~malloc11.base_4|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_2, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_2, ULTIMATE.start_main_#t~malloc12.offset=|v_ULTIMATE.start_main_#t~malloc12.offset_4|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_2, #valid=|v_#valid_8|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_2, #length=|v_#length_3|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc12.offset, ULTIMATE.start_main_#t~malloc11.offset, ULTIMATE.start_main_~nondetString1~0.base, #valid, ULTIMATE.start_main_#t~malloc12.base, ULTIMATE.start_main_~nondetString1~0.offset, ULTIMATE.start_main_#t~malloc11.base, #length, ULTIMATE.start_main_~nondetString2~0.base, ULTIMATE.start_main_~nondetString2~0.offset] 1943#L32 [96] L32-->L32-1: Formula: (let ((.cse0 (+ v_ULTIMATE.start_main_~length1~0_8 v_ULTIMATE.start_main_~nondetString1~0.offset_3))) (and (<= 1 .cse0) (= 1 (select |v_#valid_11| v_ULTIMATE.start_main_~nondetString1~0.base_3)) (= |v_#memory_int_2| (store |v_#memory_int_3| v_ULTIMATE.start_main_~nondetString1~0.base_3 (store (select |v_#memory_int_3| v_ULTIMATE.start_main_~nondetString1~0.base_3) (+ v_ULTIMATE.start_main_~length1~0_8 v_ULTIMATE.start_main_~nondetString1~0.offset_3 (- 1)) 0))) (<= .cse0 (select |v_#length_6| v_ULTIMATE.start_main_~nondetString1~0.base_3)))) InVars {ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_3, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_3|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_3, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_8, #length=|v_#length_6|} OutVars{ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_3, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_3, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_8, #length=|v_#length_6|} AuxVars[] AssignedVars[#memory_int] 1961#L32-1 [190] L32-1-->L8-3: Formula: (let ((.cse0 (+ v_ULTIMATE.start_main_~length2~0_11 v_ULTIMATE.start_main_~nondetString2~0.offset_7))) (and (= v_ULTIMATE.start_substring_~ps~0.offset_8 v_ULTIMATE.start_substring_~s.offset_3) (<= 1 .cse0) (= v_ULTIMATE.start_main_~nondetString2~0.base_8 |v_ULTIMATE.start_substring_#in~t.base_2|) (= |v_ULTIMATE.start_substring_#in~s.offset_2| v_ULTIMATE.start_substring_~s.offset_3) (= (select |v_#valid_25| v_ULTIMATE.start_main_~nondetString2~0.base_8) 1) (= |v_ULTIMATE.start_substring_#in~t.base_2| v_ULTIMATE.start_substring_~t.base_4) (= |v_ULTIMATE.start_substring_#in~s.base_2| v_ULTIMATE.start_main_~nondetString1~0.base_8) (= (store |v_#memory_int_11| v_ULTIMATE.start_main_~nondetString2~0.base_8 (store (select |v_#memory_int_11| v_ULTIMATE.start_main_~nondetString2~0.base_8) (+ v_ULTIMATE.start_main_~length2~0_11 v_ULTIMATE.start_main_~nondetString2~0.offset_7 (- 1)) 0)) |v_#memory_int_10|) (= v_ULTIMATE.start_main_~nondetString2~0.offset_7 |v_ULTIMATE.start_substring_#in~t.offset_2|) (= v_ULTIMATE.start_main_~nondetString1~0.offset_7 |v_ULTIMATE.start_substring_#in~s.offset_2|) (= |v_ULTIMATE.start_substring_#in~t.offset_2| v_ULTIMATE.start_substring_~t.offset_4) (= |v_ULTIMATE.start_substring_#in~s.base_2| v_ULTIMATE.start_substring_~s.base_3) (= v_ULTIMATE.start_substring_~s.base_3 v_ULTIMATE.start_substring_~ps~0.base_9) (<= .cse0 (select |v_#length_18| v_ULTIMATE.start_main_~nondetString2~0.base_8)))) InVars {ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_8, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_7, #length=|v_#length_18|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_8, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_7, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_11} OutVars{ULTIMATE.start_substring_#in~t.offset=|v_ULTIMATE.start_substring_#in~t.offset_2|, ULTIMATE.start_substring_~ps~0.offset=v_ULTIMATE.start_substring_~ps~0.offset_8, ULTIMATE.start_substring_#t~post5.offset=|v_ULTIMATE.start_substring_#t~post5.offset_4|, ULTIMATE.start_substring_~ps2~0.base=v_ULTIMATE.start_substring_~ps2~0.base_8, ULTIMATE.start_substring_#t~mem7=|v_ULTIMATE.start_substring_#t~mem7_7|, ULTIMATE.start_substring_~t.offset=v_ULTIMATE.start_substring_~t.offset_4, ULTIMATE.start_substring_#t~mem3=|v_ULTIMATE.start_substring_#t~mem3_6|, ULTIMATE.start_substring_#t~mem2=|v_ULTIMATE.start_substring_#t~mem2_6|, ULTIMATE.start_substring_#t~mem1=|v_ULTIMATE.start_substring_#t~mem1_6|, ULTIMATE.start_substring_#in~s.offset=|v_ULTIMATE.start_substring_#in~s.offset_2|, ULTIMATE.start_substring_#t~mem0=|v_ULTIMATE.start_substring_#t~mem0_7|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_8, ULTIMATE.start_substring_~ps2~0.offset=v_ULTIMATE.start_substring_~ps2~0.offset_7, ULTIMATE.start_substring_~pt~0.base=v_ULTIMATE.start_substring_~pt~0.base_14, ULTIMATE.start_substring_#t~post8.offset=|v_ULTIMATE.start_substring_#t~post8.offset_4|, #length=|v_#length_18|, ULTIMATE.start_substring_~pt~0.offset=v_ULTIMATE.start_substring_~pt~0.offset_11, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_11, ULTIMATE.start_substring_#res=|v_ULTIMATE.start_substring_#res_5|, ULTIMATE.start_substring_#t~post6.offset=|v_ULTIMATE.start_substring_#t~post6.offset_4|, ULTIMATE.start_substring_~t.base=v_ULTIMATE.start_substring_~t.base_4, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_8, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_7, ULTIMATE.start_substring_~s.base=v_ULTIMATE.start_substring_~s.base_3, ULTIMATE.start_substring_#in~t.base=|v_ULTIMATE.start_substring_#in~t.base_2|, ULTIMATE.start_substring_#in~s.base=|v_ULTIMATE.start_substring_#in~s.base_2|, ULTIMATE.start_substring_#t~post6.base=|v_ULTIMATE.start_substring_#t~post6.base_4|, ULTIMATE.start_substring_#t~post8.base=|v_ULTIMATE.start_substring_#t~post8.base_4|, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_10|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_7, ULTIMATE.start_substring_~ps~0.base=v_ULTIMATE.start_substring_~ps~0.base_9, ULTIMATE.start_substring_#t~post5.base=|v_ULTIMATE.start_substring_#t~post5.base_4|, ULTIMATE.start_substring_~s.offset=v_ULTIMATE.start_substring_~s.offset_3, ULTIMATE.start_substring_#t~short4=|v_ULTIMATE.start_substring_#t~short4_10|} AuxVars[] AssignedVars[ULTIMATE.start_substring_#in~t.offset, ULTIMATE.start_substring_~ps~0.offset, ULTIMATE.start_substring_#t~post5.offset, ULTIMATE.start_substring_~ps2~0.base, ULTIMATE.start_substring_#t~mem7, ULTIMATE.start_substring_~t.offset, ULTIMATE.start_substring_#t~mem3, ULTIMATE.start_substring_#t~mem2, ULTIMATE.start_substring_#t~mem1, ULTIMATE.start_substring_#in~s.offset, ULTIMATE.start_substring_#t~mem0, ULTIMATE.start_substring_~ps2~0.offset, ULTIMATE.start_substring_~pt~0.base, ULTIMATE.start_substring_#t~post8.offset, ULTIMATE.start_substring_~pt~0.offset, ULTIMATE.start_substring_#res, ULTIMATE.start_substring_#t~post6.offset, ULTIMATE.start_substring_~t.base, ULTIMATE.start_substring_~s.base, ULTIMATE.start_substring_#in~t.base, ULTIMATE.start_substring_#in~s.base, ULTIMATE.start_substring_#t~post6.base, ULTIMATE.start_substring_#t~post8.base, #memory_int, ULTIMATE.start_substring_~ps~0.base, ULTIMATE.start_substring_#t~post5.base, ULTIMATE.start_substring_~s.offset, ULTIMATE.start_substring_#t~short4] 1944#L8-3 [113] L8-3-->L8-1: Formula: (and (= (select (select |v_#memory_int_6| v_ULTIMATE.start_substring_~ps~0.base_5) v_ULTIMATE.start_substring_~ps~0.offset_5) |v_ULTIMATE.start_substring_#t~mem0_2|) (= (select |v_#valid_15| v_ULTIMATE.start_substring_~ps~0.base_5) 1) (<= 0 v_ULTIMATE.start_substring_~ps~0.offset_5) (<= (+ v_ULTIMATE.start_substring_~ps~0.offset_5 1) (select |v_#length_10| v_ULTIMATE.start_substring_~ps~0.base_5))) InVars {ULTIMATE.start_substring_~ps~0.offset=v_ULTIMATE.start_substring_~ps~0.offset_5, #memory_int=|v_#memory_int_6|, #length=|v_#length_10|, ULTIMATE.start_substring_~ps~0.base=v_ULTIMATE.start_substring_~ps~0.base_5, #valid=|v_#valid_15|} OutVars{ULTIMATE.start_substring_#t~mem0=|v_ULTIMATE.start_substring_#t~mem0_2|, #valid=|v_#valid_15|, ULTIMATE.start_substring_~ps~0.offset=v_ULTIMATE.start_substring_~ps~0.offset_5, #memory_int=|v_#memory_int_6|, #length=|v_#length_10|, ULTIMATE.start_substring_~ps~0.base=v_ULTIMATE.start_substring_~ps~0.base_5} AuxVars[] AssignedVars[ULTIMATE.start_substring_#t~mem0] 1945#L8-1 [163] L8-1-->L11-9: Formula: (and (= v_ULTIMATE.start_substring_~ps2~0.base_2 v_ULTIMATE.start_substring_~ps~0.base_8) (= v_ULTIMATE.start_substring_~pt~0.offset_4 v_ULTIMATE.start_substring_~t.offset_3) (< 0 |v_ULTIMATE.start_substring_#t~mem0_6|) (= v_ULTIMATE.start_substring_~pt~0.base_5 v_ULTIMATE.start_substring_~t.base_3) (= v_ULTIMATE.start_substring_~ps2~0.offset_2 v_ULTIMATE.start_substring_~ps~0.offset_7)) InVars {ULTIMATE.start_substring_~ps~0.offset=v_ULTIMATE.start_substring_~ps~0.offset_7, ULTIMATE.start_substring_~t.offset=v_ULTIMATE.start_substring_~t.offset_3, ULTIMATE.start_substring_~ps~0.base=v_ULTIMATE.start_substring_~ps~0.base_8, ULTIMATE.start_substring_~t.base=v_ULTIMATE.start_substring_~t.base_3, ULTIMATE.start_substring_#t~mem0=|v_ULTIMATE.start_substring_#t~mem0_6|} OutVars{ULTIMATE.start_substring_~t.offset=v_ULTIMATE.start_substring_~t.offset_3, ULTIMATE.start_substring_#t~mem0=|v_ULTIMATE.start_substring_#t~mem0_5|, ULTIMATE.start_substring_~ps2~0.offset=v_ULTIMATE.start_substring_~ps2~0.offset_2, ULTIMATE.start_substring_~pt~0.base=v_ULTIMATE.start_substring_~pt~0.base_5, ULTIMATE.start_substring_~ps~0.offset=v_ULTIMATE.start_substring_~ps~0.offset_7, ULTIMATE.start_substring_~ps2~0.base=v_ULTIMATE.start_substring_~ps2~0.base_2, ULTIMATE.start_substring_~ps~0.base=v_ULTIMATE.start_substring_~ps~0.base_8, ULTIMATE.start_substring_~t.base=v_ULTIMATE.start_substring_~t.base_3, ULTIMATE.start_substring_~pt~0.offset=v_ULTIMATE.start_substring_~pt~0.offset_4} AuxVars[] AssignedVars[ULTIMATE.start_substring_#t~mem0, ULTIMATE.start_substring_~ps2~0.offset, ULTIMATE.start_substring_~pt~0.base, ULTIMATE.start_substring_~ps2~0.base, ULTIMATE.start_substring_~pt~0.offset] 1955#L11-9 [103] L11-9-->L11-1: Formula: (and (<= 0 v_ULTIMATE.start_substring_~pt~0.offset_5) (<= (+ v_ULTIMATE.start_substring_~pt~0.offset_5 1) (select |v_#length_12| v_ULTIMATE.start_substring_~pt~0.base_6)) (= |v_ULTIMATE.start_substring_#t~mem1_2| (select (select |v_#memory_int_7| v_ULTIMATE.start_substring_~pt~0.base_6) v_ULTIMATE.start_substring_~pt~0.offset_5)) (= (select |v_#valid_17| v_ULTIMATE.start_substring_~pt~0.base_6) 1)) InVars {#memory_int=|v_#memory_int_7|, #length=|v_#length_12|, ULTIMATE.start_substring_~pt~0.offset=v_ULTIMATE.start_substring_~pt~0.offset_5, ULTIMATE.start_substring_~pt~0.base=v_ULTIMATE.start_substring_~pt~0.base_6, #valid=|v_#valid_17|} OutVars{ULTIMATE.start_substring_#t~mem1=|v_ULTIMATE.start_substring_#t~mem1_2|, ULTIMATE.start_substring_~pt~0.base=v_ULTIMATE.start_substring_~pt~0.base_6, #valid=|v_#valid_17|, #memory_int=|v_#memory_int_7|, #length=|v_#length_12|, ULTIMATE.start_substring_~pt~0.offset=v_ULTIMATE.start_substring_~pt~0.offset_5} AuxVars[] AssignedVars[ULTIMATE.start_substring_#t~mem1] 1982#L11-1 [174] L11-1-->L11-2: Formula: (and (> 0 |v_ULTIMATE.start_substring_#t~mem1_3|) |v_ULTIMATE.start_substring_#t~short4_2|) InVars {ULTIMATE.start_substring_#t~mem1=|v_ULTIMATE.start_substring_#t~mem1_3|} OutVars{ULTIMATE.start_substring_#t~mem1=|v_ULTIMATE.start_substring_#t~mem1_3|, ULTIMATE.start_substring_#t~short4=|v_ULTIMATE.start_substring_#t~short4_2|} AuxVars[] AssignedVars[ULTIMATE.start_substring_#t~short4] 1981#L11-2 [90] L11-2-->L11-3: Formula: |v_ULTIMATE.start_substring_#t~short4_3| InVars {ULTIMATE.start_substring_#t~short4=|v_ULTIMATE.start_substring_#t~short4_3|} OutVars{ULTIMATE.start_substring_#t~short4=|v_ULTIMATE.start_substring_#t~short4_3|} AuxVars[] AssignedVars[] 1980#L11-3 [87] L11-3-->L11-4: Formula: (and (<= (+ v_ULTIMATE.start_substring_~pt~0.offset_7 1) (select |v_#length_14| v_ULTIMATE.start_substring_~pt~0.base_9)) (= 1 (select |v_#valid_19| v_ULTIMATE.start_substring_~pt~0.base_9)) (<= 0 v_ULTIMATE.start_substring_~pt~0.offset_7) (= (select (select |v_#memory_int_8| v_ULTIMATE.start_substring_~pt~0.base_9) v_ULTIMATE.start_substring_~pt~0.offset_7) |v_ULTIMATE.start_substring_#t~mem2_2|)) InVars {#memory_int=|v_#memory_int_8|, #length=|v_#length_14|, ULTIMATE.start_substring_~pt~0.offset=v_ULTIMATE.start_substring_~pt~0.offset_7, ULTIMATE.start_substring_~pt~0.base=v_ULTIMATE.start_substring_~pt~0.base_9, #valid=|v_#valid_19|} OutVars{ULTIMATE.start_substring_#t~mem2=|v_ULTIMATE.start_substring_#t~mem2_2|, ULTIMATE.start_substring_~pt~0.base=v_ULTIMATE.start_substring_~pt~0.base_9, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_8|, #length=|v_#length_14|, ULTIMATE.start_substring_~pt~0.offset=v_ULTIMATE.start_substring_~pt~0.offset_7} AuxVars[] AssignedVars[ULTIMATE.start_substring_#t~mem2] 1979#L11-4 [83] L11-4-->L11-5: Formula: (and (= (select |v_#valid_21| v_ULTIMATE.start_substring_~ps2~0.base_3) 1) (<= (+ v_ULTIMATE.start_substring_~ps2~0.offset_3 1) (select |v_#length_16| v_ULTIMATE.start_substring_~ps2~0.base_3)) (<= 0 v_ULTIMATE.start_substring_~ps2~0.offset_3) (= (select (select |v_#memory_int_9| v_ULTIMATE.start_substring_~ps2~0.base_3) v_ULTIMATE.start_substring_~ps2~0.offset_3) |v_ULTIMATE.start_substring_#t~mem3_2|)) InVars {#memory_int=|v_#memory_int_9|, #length=|v_#length_16|, ULTIMATE.start_substring_~ps2~0.base=v_ULTIMATE.start_substring_~ps2~0.base_3, ULTIMATE.start_substring_~ps2~0.offset=v_ULTIMATE.start_substring_~ps2~0.offset_3, #valid=|v_#valid_21|} OutVars{ULTIMATE.start_substring_#t~mem3=|v_ULTIMATE.start_substring_#t~mem3_2|, ULTIMATE.start_substring_~ps2~0.offset=v_ULTIMATE.start_substring_~ps2~0.offset_3, #valid=|v_#valid_21|, #memory_int=|v_#memory_int_9|, #length=|v_#length_16|, ULTIMATE.start_substring_~ps2~0.base=v_ULTIMATE.start_substring_~ps2~0.base_3} AuxVars[] AssignedVars[ULTIMATE.start_substring_#t~mem3] 1978#L11-5 [188] L11-5-->L11-7: Formula: (and (not |v_ULTIMATE.start_substring_#t~short4_4|) (> |v_ULTIMATE.start_substring_#t~mem3_3| |v_ULTIMATE.start_substring_#t~mem2_3|)) InVars {ULTIMATE.start_substring_#t~mem2=|v_ULTIMATE.start_substring_#t~mem2_3|, ULTIMATE.start_substring_#t~mem3=|v_ULTIMATE.start_substring_#t~mem3_3|} OutVars{ULTIMATE.start_substring_#t~mem3=|v_ULTIMATE.start_substring_#t~mem3_3|, ULTIMATE.start_substring_#t~mem2=|v_ULTIMATE.start_substring_#t~mem2_3|, ULTIMATE.start_substring_#t~short4=|v_ULTIMATE.start_substring_#t~short4_4|} AuxVars[] AssignedVars[ULTIMATE.start_substring_#t~short4] 1976#L11-7 [108] L11-7-->L11-10: Formula: (not |v_ULTIMATE.start_substring_#t~short4_7|) InVars {ULTIMATE.start_substring_#t~short4=|v_ULTIMATE.start_substring_#t~short4_7|} OutVars{ULTIMATE.start_substring_#t~mem3=|v_ULTIMATE.start_substring_#t~mem3_4|, ULTIMATE.start_substring_#t~mem2=|v_ULTIMATE.start_substring_#t~mem2_4|, ULTIMATE.start_substring_#t~mem1=|v_ULTIMATE.start_substring_#t~mem1_4|, ULTIMATE.start_substring_#t~short4=|v_ULTIMATE.start_substring_#t~short4_6|} AuxVars[] AssignedVars[ULTIMATE.start_substring_#t~mem3, ULTIMATE.start_substring_#t~mem2, ULTIMATE.start_substring_#t~mem1, ULTIMATE.start_substring_#t~short4] 1967#L11-10 [99] L11-10-->L15: Formula: (and (= (select |v_#valid_3| v_ULTIMATE.start_substring_~pt~0.base_1) 1) (<= (+ v_ULTIMATE.start_substring_~pt~0.offset_1 1) (select |v_#length_1| v_ULTIMATE.start_substring_~pt~0.base_1)) (= (select (select |v_#memory_int_1| v_ULTIMATE.start_substring_~pt~0.base_1) v_ULTIMATE.start_substring_~pt~0.offset_1) |v_ULTIMATE.start_substring_#t~mem7_1|) (<= 0 v_ULTIMATE.start_substring_~pt~0.offset_1)) InVars {#memory_int=|v_#memory_int_1|, #length=|v_#length_1|, ULTIMATE.start_substring_~pt~0.offset=v_ULTIMATE.start_substring_~pt~0.offset_1, ULTIMATE.start_substring_~pt~0.base=v_ULTIMATE.start_substring_~pt~0.base_1, #valid=|v_#valid_3|} OutVars{ULTIMATE.start_substring_~pt~0.base=v_ULTIMATE.start_substring_~pt~0.base_1, #valid=|v_#valid_3|, #memory_int=|v_#memory_int_1|, #length=|v_#length_1|, ULTIMATE.start_substring_~pt~0.offset=v_ULTIMATE.start_substring_~pt~0.offset_1, ULTIMATE.start_substring_#t~mem7=|v_ULTIMATE.start_substring_#t~mem7_1|} AuxVars[] AssignedVars[ULTIMATE.start_substring_#t~mem7] 1968#L15 [177] L15-->L8-3: Formula: (and (= (+ v_ULTIMATE.start_substring_~ps~0.offset_2 1) v_ULTIMATE.start_substring_~ps~0.offset_1) (= v_ULTIMATE.start_substring_~ps~0.base_2 v_ULTIMATE.start_substring_~ps~0.base_1) (< 0 |v_ULTIMATE.start_substring_#t~mem7_5|)) InVars {ULTIMATE.start_substring_~ps~0.offset=v_ULTIMATE.start_substring_~ps~0.offset_2, ULTIMATE.start_substring_~ps~0.base=v_ULTIMATE.start_substring_~ps~0.base_2, ULTIMATE.start_substring_#t~mem7=|v_ULTIMATE.start_substring_#t~mem7_5|} OutVars{ULTIMATE.start_substring_~ps~0.offset=v_ULTIMATE.start_substring_~ps~0.offset_1, ULTIMATE.start_substring_#t~post8.base=|v_ULTIMATE.start_substring_#t~post8.base_1|, ULTIMATE.start_substring_#t~post8.offset=|v_ULTIMATE.start_substring_#t~post8.offset_1|, ULTIMATE.start_substring_~ps~0.base=v_ULTIMATE.start_substring_~ps~0.base_1, ULTIMATE.start_substring_#t~mem7=|v_ULTIMATE.start_substring_#t~mem7_4|} AuxVars[] AssignedVars[ULTIMATE.start_substring_#t~post8.base, ULTIMATE.start_substring_~ps~0.offset, ULTIMATE.start_substring_#t~post8.offset, ULTIMATE.start_substring_~ps~0.base, ULTIMATE.start_substring_#t~mem7] 1941#L8-3 [113] L8-3-->L8-1: Formula: (and (= (select (select |v_#memory_int_6| v_ULTIMATE.start_substring_~ps~0.base_5) v_ULTIMATE.start_substring_~ps~0.offset_5) |v_ULTIMATE.start_substring_#t~mem0_2|) (= (select |v_#valid_15| v_ULTIMATE.start_substring_~ps~0.base_5) 1) (<= 0 v_ULTIMATE.start_substring_~ps~0.offset_5) (<= (+ v_ULTIMATE.start_substring_~ps~0.offset_5 1) (select |v_#length_10| v_ULTIMATE.start_substring_~ps~0.base_5))) InVars {ULTIMATE.start_substring_~ps~0.offset=v_ULTIMATE.start_substring_~ps~0.offset_5, #memory_int=|v_#memory_int_6|, #length=|v_#length_10|, ULTIMATE.start_substring_~ps~0.base=v_ULTIMATE.start_substring_~ps~0.base_5, #valid=|v_#valid_15|} OutVars{ULTIMATE.start_substring_#t~mem0=|v_ULTIMATE.start_substring_#t~mem0_2|, #valid=|v_#valid_15|, ULTIMATE.start_substring_~ps~0.offset=v_ULTIMATE.start_substring_~ps~0.offset_5, #memory_int=|v_#memory_int_6|, #length=|v_#length_10|, ULTIMATE.start_substring_~ps~0.base=v_ULTIMATE.start_substring_~ps~0.base_5} AuxVars[] AssignedVars[ULTIMATE.start_substring_#t~mem0] 1947#L8-1 [164] L8-1-->L11-9: Formula: (and (= v_ULTIMATE.start_substring_~ps2~0.base_2 v_ULTIMATE.start_substring_~ps~0.base_8) (= v_ULTIMATE.start_substring_~pt~0.offset_4 v_ULTIMATE.start_substring_~t.offset_3) (> 0 |v_ULTIMATE.start_substring_#t~mem0_6|) (= v_ULTIMATE.start_substring_~pt~0.base_5 v_ULTIMATE.start_substring_~t.base_3) (= v_ULTIMATE.start_substring_~ps2~0.offset_2 v_ULTIMATE.start_substring_~ps~0.offset_7)) InVars {ULTIMATE.start_substring_~ps~0.offset=v_ULTIMATE.start_substring_~ps~0.offset_7, ULTIMATE.start_substring_~t.offset=v_ULTIMATE.start_substring_~t.offset_3, ULTIMATE.start_substring_~ps~0.base=v_ULTIMATE.start_substring_~ps~0.base_8, ULTIMATE.start_substring_~t.base=v_ULTIMATE.start_substring_~t.base_3, ULTIMATE.start_substring_#t~mem0=|v_ULTIMATE.start_substring_#t~mem0_6|} OutVars{ULTIMATE.start_substring_~t.offset=v_ULTIMATE.start_substring_~t.offset_3, ULTIMATE.start_substring_#t~mem0=|v_ULTIMATE.start_substring_#t~mem0_5|, ULTIMATE.start_substring_~ps2~0.offset=v_ULTIMATE.start_substring_~ps2~0.offset_2, ULTIMATE.start_substring_~pt~0.base=v_ULTIMATE.start_substring_~pt~0.base_5, ULTIMATE.start_substring_~ps~0.offset=v_ULTIMATE.start_substring_~ps~0.offset_7, ULTIMATE.start_substring_~ps2~0.base=v_ULTIMATE.start_substring_~ps2~0.base_2, ULTIMATE.start_substring_~ps~0.base=v_ULTIMATE.start_substring_~ps~0.base_8, ULTIMATE.start_substring_~t.base=v_ULTIMATE.start_substring_~t.base_3, ULTIMATE.start_substring_~pt~0.offset=v_ULTIMATE.start_substring_~pt~0.offset_4} AuxVars[] AssignedVars[ULTIMATE.start_substring_#t~mem0, ULTIMATE.start_substring_~ps2~0.offset, ULTIMATE.start_substring_~pt~0.base, ULTIMATE.start_substring_~ps2~0.base, ULTIMATE.start_substring_~pt~0.offset] 1954#L11-9 172.61/109.72 [2019-03-28 12:36:43,012 INFO L796 eck$LassoCheckResult]: Loop: 1954#L11-9 [103] L11-9-->L11-1: Formula: (and (<= 0 v_ULTIMATE.start_substring_~pt~0.offset_5) (<= (+ v_ULTIMATE.start_substring_~pt~0.offset_5 1) (select |v_#length_12| v_ULTIMATE.start_substring_~pt~0.base_6)) (= |v_ULTIMATE.start_substring_#t~mem1_2| (select (select |v_#memory_int_7| v_ULTIMATE.start_substring_~pt~0.base_6) v_ULTIMATE.start_substring_~pt~0.offset_5)) (= (select |v_#valid_17| v_ULTIMATE.start_substring_~pt~0.base_6) 1)) InVars {#memory_int=|v_#memory_int_7|, #length=|v_#length_12|, ULTIMATE.start_substring_~pt~0.offset=v_ULTIMATE.start_substring_~pt~0.offset_5, ULTIMATE.start_substring_~pt~0.base=v_ULTIMATE.start_substring_~pt~0.base_6, #valid=|v_#valid_17|} OutVars{ULTIMATE.start_substring_#t~mem1=|v_ULTIMATE.start_substring_#t~mem1_2|, ULTIMATE.start_substring_~pt~0.base=v_ULTIMATE.start_substring_~pt~0.base_6, #valid=|v_#valid_17|, #memory_int=|v_#memory_int_7|, #length=|v_#length_12|, ULTIMATE.start_substring_~pt~0.offset=v_ULTIMATE.start_substring_~pt~0.offset_5} AuxVars[] AssignedVars[ULTIMATE.start_substring_#t~mem1] 1962#L11-1 [174] L11-1-->L11-2: Formula: (and (> 0 |v_ULTIMATE.start_substring_#t~mem1_3|) |v_ULTIMATE.start_substring_#t~short4_2|) InVars {ULTIMATE.start_substring_#t~mem1=|v_ULTIMATE.start_substring_#t~mem1_3|} OutVars{ULTIMATE.start_substring_#t~mem1=|v_ULTIMATE.start_substring_#t~mem1_3|, ULTIMATE.start_substring_#t~short4=|v_ULTIMATE.start_substring_#t~short4_2|} AuxVars[] AssignedVars[ULTIMATE.start_substring_#t~short4] 1959#L11-2 [90] L11-2-->L11-3: Formula: |v_ULTIMATE.start_substring_#t~short4_3| InVars {ULTIMATE.start_substring_#t~short4=|v_ULTIMATE.start_substring_#t~short4_3|} OutVars{ULTIMATE.start_substring_#t~short4=|v_ULTIMATE.start_substring_#t~short4_3|} AuxVars[] AssignedVars[] 1957#L11-3 [87] L11-3-->L11-4: Formula: (and (<= (+ v_ULTIMATE.start_substring_~pt~0.offset_7 1) (select |v_#length_14| v_ULTIMATE.start_substring_~pt~0.base_9)) (= 1 (select |v_#valid_19| v_ULTIMATE.start_substring_~pt~0.base_9)) (<= 0 v_ULTIMATE.start_substring_~pt~0.offset_7) (= (select (select |v_#memory_int_8| v_ULTIMATE.start_substring_~pt~0.base_9) v_ULTIMATE.start_substring_~pt~0.offset_7) |v_ULTIMATE.start_substring_#t~mem2_2|)) InVars {#memory_int=|v_#memory_int_8|, #length=|v_#length_14|, ULTIMATE.start_substring_~pt~0.offset=v_ULTIMATE.start_substring_~pt~0.offset_7, ULTIMATE.start_substring_~pt~0.base=v_ULTIMATE.start_substring_~pt~0.base_9, #valid=|v_#valid_19|} OutVars{ULTIMATE.start_substring_#t~mem2=|v_ULTIMATE.start_substring_#t~mem2_2|, ULTIMATE.start_substring_~pt~0.base=v_ULTIMATE.start_substring_~pt~0.base_9, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_8|, #length=|v_#length_14|, ULTIMATE.start_substring_~pt~0.offset=v_ULTIMATE.start_substring_~pt~0.offset_7} AuxVars[] AssignedVars[ULTIMATE.start_substring_#t~mem2] 1952#L11-4 [83] L11-4-->L11-5: Formula: (and (= (select |v_#valid_21| v_ULTIMATE.start_substring_~ps2~0.base_3) 1) (<= (+ v_ULTIMATE.start_substring_~ps2~0.offset_3 1) (select |v_#length_16| v_ULTIMATE.start_substring_~ps2~0.base_3)) (<= 0 v_ULTIMATE.start_substring_~ps2~0.offset_3) (= (select (select |v_#memory_int_9| v_ULTIMATE.start_substring_~ps2~0.base_3) v_ULTIMATE.start_substring_~ps2~0.offset_3) |v_ULTIMATE.start_substring_#t~mem3_2|)) InVars {#memory_int=|v_#memory_int_9|, #length=|v_#length_16|, ULTIMATE.start_substring_~ps2~0.base=v_ULTIMATE.start_substring_~ps2~0.base_3, ULTIMATE.start_substring_~ps2~0.offset=v_ULTIMATE.start_substring_~ps2~0.offset_3, #valid=|v_#valid_21|} OutVars{ULTIMATE.start_substring_#t~mem3=|v_ULTIMATE.start_substring_#t~mem3_2|, ULTIMATE.start_substring_~ps2~0.offset=v_ULTIMATE.start_substring_~ps2~0.offset_3, #valid=|v_#valid_21|, #memory_int=|v_#memory_int_9|, #length=|v_#length_16|, ULTIMATE.start_substring_~ps2~0.base=v_ULTIMATE.start_substring_~ps2~0.base_3} AuxVars[] AssignedVars[ULTIMATE.start_substring_#t~mem3] 1948#L11-5 [186] L11-5-->L11-7: Formula: (and (= |v_ULTIMATE.start_substring_#t~mem3_3| |v_ULTIMATE.start_substring_#t~mem2_3|) |v_ULTIMATE.start_substring_#t~short4_4|) InVars {ULTIMATE.start_substring_#t~mem2=|v_ULTIMATE.start_substring_#t~mem2_3|, ULTIMATE.start_substring_#t~mem3=|v_ULTIMATE.start_substring_#t~mem3_3|} OutVars{ULTIMATE.start_substring_#t~mem3=|v_ULTIMATE.start_substring_#t~mem3_3|, ULTIMATE.start_substring_#t~mem2=|v_ULTIMATE.start_substring_#t~mem2_3|, ULTIMATE.start_substring_#t~short4=|v_ULTIMATE.start_substring_#t~short4_4|} AuxVars[] AssignedVars[ULTIMATE.start_substring_#t~short4] 1949#L11-7 [109] L11-7-->L11-9: Formula: (and (= v_ULTIMATE.start_substring_~ps2~0.offset_5 (+ v_ULTIMATE.start_substring_~ps2~0.offset_6 1)) (= v_ULTIMATE.start_substring_~pt~0.base_13 v_ULTIMATE.start_substring_~pt~0.base_12) (= v_ULTIMATE.start_substring_~ps2~0.base_7 v_ULTIMATE.start_substring_~ps2~0.base_6) |v_ULTIMATE.start_substring_#t~short4_9| (= (+ v_ULTIMATE.start_substring_~pt~0.offset_10 1) v_ULTIMATE.start_substring_~pt~0.offset_9)) InVars {ULTIMATE.start_substring_~ps2~0.base=v_ULTIMATE.start_substring_~ps2~0.base_7, ULTIMATE.start_substring_~pt~0.offset=v_ULTIMATE.start_substring_~pt~0.offset_10, ULTIMATE.start_substring_~ps2~0.offset=v_ULTIMATE.start_substring_~ps2~0.offset_6, ULTIMATE.start_substring_~pt~0.base=v_ULTIMATE.start_substring_~pt~0.base_13, ULTIMATE.start_substring_#t~short4=|v_ULTIMATE.start_substring_#t~short4_9|} OutVars{ULTIMATE.start_substring_#t~post6.offset=|v_ULTIMATE.start_substring_#t~post6.offset_2|, ULTIMATE.start_substring_#t~post5.offset=|v_ULTIMATE.start_substring_#t~post5.offset_2|, ULTIMATE.start_substring_~ps2~0.base=v_ULTIMATE.start_substring_~ps2~0.base_6, ULTIMATE.start_substring_#t~post6.base=|v_ULTIMATE.start_substring_#t~post6.base_2|, ULTIMATE.start_substring_#t~mem3=|v_ULTIMATE.start_substring_#t~mem3_5|, ULTIMATE.start_substring_#t~mem2=|v_ULTIMATE.start_substring_#t~mem2_5|, ULTIMATE.start_substring_#t~mem1=|v_ULTIMATE.start_substring_#t~mem1_5|, ULTIMATE.start_substring_~ps2~0.offset=v_ULTIMATE.start_substring_~ps2~0.offset_5, ULTIMATE.start_substring_~pt~0.base=v_ULTIMATE.start_substring_~pt~0.base_12, ULTIMATE.start_substring_#t~post5.base=|v_ULTIMATE.start_substring_#t~post5.base_2|, ULTIMATE.start_substring_~pt~0.offset=v_ULTIMATE.start_substring_~pt~0.offset_9, ULTIMATE.start_substring_#t~short4=|v_ULTIMATE.start_substring_#t~short4_8|} AuxVars[] AssignedVars[ULTIMATE.start_substring_#t~post6.base, ULTIMATE.start_substring_#t~post6.offset, ULTIMATE.start_substring_#t~mem3, ULTIMATE.start_substring_#t~mem2, ULTIMATE.start_substring_#t~mem1, ULTIMATE.start_substring_~ps2~0.offset, ULTIMATE.start_substring_~pt~0.base, ULTIMATE.start_substring_#t~post5.offset, ULTIMATE.start_substring_~ps2~0.base, ULTIMATE.start_substring_#t~post5.base, ULTIMATE.start_substring_~pt~0.offset, ULTIMATE.start_substring_#t~short4] 1954#L11-9 172.61/109.72 [2019-03-28 12:36:43,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 172.61/109.72 [2019-03-28 12:36:43,013 INFO L82 PathProgramCache]: Analyzing trace with hash -35256137, now seen corresponding path program 1 times 172.61/109.72 [2019-03-28 12:36:43,013 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 172.61/109.72 [2019-03-28 12:36:43,013 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 172.61/109.72 [2019-03-28 12:36:43,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 172.61/109.72 [2019-03-28 12:36:43,014 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 172.61/109.72 [2019-03-28 12:36:43,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 172.61/109.72 [2019-03-28 12:36:43,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 172.61/109.72 [2019-03-28 12:36:43,040 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 172.61/109.72 [2019-03-28 12:36:43,041 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 172.61/109.72 [2019-03-28 12:36:43,041 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 172.61/109.72 [2019-03-28 12:36:43,041 INFO L799 eck$LassoCheckResult]: stem already infeasible 172.61/109.72 [2019-03-28 12:36:43,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 172.61/109.72 [2019-03-28 12:36:43,042 INFO L82 PathProgramCache]: Analyzing trace with hash -561291711, now seen corresponding path program 3 times 172.61/109.72 [2019-03-28 12:36:43,042 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 172.61/109.72 [2019-03-28 12:36:43,042 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 172.61/109.72 [2019-03-28 12:36:43,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 172.61/109.72 [2019-03-28 12:36:43,043 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 172.61/109.72 [2019-03-28 12:36:43,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 172.61/109.72 [2019-03-28 12:36:43,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 172.61/109.72 [2019-03-28 12:36:43,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 172.61/109.72 [2019-03-28 12:36:43,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. 172.61/109.72 [2019-03-28 12:36:43,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 172.61/109.72 [2019-03-28 12:36:43,125 INFO L87 Difference]: Start difference. First operand 54 states and 73 transitions. cyclomatic complexity: 21 Second operand 5 states. 172.61/109.72 [2019-03-28 12:36:43,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 172.61/109.72 [2019-03-28 12:36:43,222 INFO L93 Difference]: Finished difference Result 62 states and 82 transitions. 172.61/109.72 [2019-03-28 12:36:43,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 172.61/109.72 [2019-03-28 12:36:43,226 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 62 states and 82 transitions. 172.61/109.72 [2019-03-28 12:36:43,227 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 172.61/109.72 [2019-03-28 12:36:43,227 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 62 states to 62 states and 82 transitions. 172.61/109.72 [2019-03-28 12:36:43,227 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 172.61/109.72 [2019-03-28 12:36:43,228 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 172.61/109.72 [2019-03-28 12:36:43,228 INFO L73 IsDeterministic]: Start isDeterministic. Operand 62 states and 82 transitions. 172.61/109.72 [2019-03-28 12:36:43,228 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 172.61/109.72 [2019-03-28 12:36:43,228 INFO L706 BuchiCegarLoop]: Abstraction has 62 states and 82 transitions. 172.61/109.72 [2019-03-28 12:36:43,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states and 82 transitions. 172.61/109.72 [2019-03-28 12:36:43,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 54. 172.61/109.72 [2019-03-28 12:36:43,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. 172.61/109.72 [2019-03-28 12:36:43,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 72 transitions. 172.61/109.72 [2019-03-28 12:36:43,230 INFO L729 BuchiCegarLoop]: Abstraction has 54 states and 72 transitions. 172.61/109.72 [2019-03-28 12:36:43,230 INFO L609 BuchiCegarLoop]: Abstraction has 54 states and 72 transitions. 172.61/109.72 [2019-03-28 12:36:43,230 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ 172.61/109.72 [2019-03-28 12:36:43,230 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 54 states and 72 transitions. 172.61/109.73 [2019-03-28 12:36:43,230 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 172.61/109.73 [2019-03-28 12:36:43,230 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 172.61/109.73 [2019-03-28 12:36:43,231 INFO L119 BuchiIsEmpty]: Starting construction of run 172.61/109.73 [2019-03-28 12:36:43,231 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 172.61/109.73 [2019-03-28 12:36:43,231 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] 172.61/109.73 [2019-03-28 12:36:43,232 INFO L794 eck$LassoCheckResult]: Stem: 2092#ULTIMATE.startENTRY [189] ULTIMATE.startENTRY-->L24: Formula: (and (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|) (= |v_#valid_23| (store |v_#valid_24| 0 0))) InVars {#valid=|v_#valid_24|} OutVars{ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_6|, ULTIMATE.start_main_#t~malloc11.offset=|v_ULTIMATE.start_main_#t~malloc11.offset_5|, ULTIMATE.start_main_#t~nondet9=|v_ULTIMATE.start_main_#t~nondet9_6|, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_10, ULTIMATE.start_main_#t~malloc12.base=|v_ULTIMATE.start_main_#t~malloc12.base_5|, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~malloc11.base=|v_ULTIMATE.start_main_#t~malloc11.base_5|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_7, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_6, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~malloc12.offset=|v_ULTIMATE.start_main_#t~malloc12.offset_5|, ULTIMATE.start_main_#t~ret13=|v_ULTIMATE.start_main_#t~ret13_4|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, #valid=|v_#valid_23|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_6, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10, ULTIMATE.start_main_#t~malloc11.offset, ULTIMATE.start_main_#t~nondet9, ULTIMATE.start_main_~length1~0, ULTIMATE.start_main_#t~malloc12.base, #NULL.offset, ULTIMATE.start_main_#t~malloc11.base, ULTIMATE.start_main_~nondetString2~0.base, ULTIMATE.start_main_~nondetString2~0.offset, #NULL.base, ULTIMATE.start_main_#t~malloc12.offset, ULTIMATE.start_main_#t~ret13, ULTIMATE.start_main_~nondetString1~0.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_~nondetString1~0.offset, ULTIMATE.start_main_~length2~0] 2093#L24 [126] L24-->L24-2: Formula: (>= v_ULTIMATE.start_main_~length1~0_6 1) InVars {ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_6} OutVars{ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_6} AuxVars[] AssignedVars[] 2094#L24-2 [127] L24-2-->L27-1: Formula: (>= v_ULTIMATE.start_main_~length2~0_6 1) InVars {ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_6} OutVars{ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_6} AuxVars[] AssignedVars[] 2070#L27-1 [150] L27-1-->L32: Formula: (let ((.cse0 (store |v_#valid_10| |v_ULTIMATE.start_main_#t~malloc11.base_4| 1))) (and (= v_ULTIMATE.start_main_~nondetString1~0.offset_2 |v_ULTIMATE.start_main_#t~malloc11.offset_4|) (= v_ULTIMATE.start_main_~nondetString2~0.offset_2 |v_ULTIMATE.start_main_#t~malloc12.offset_4|) (= |v_ULTIMATE.start_main_#t~malloc11.offset_4| 0) (= 0 (select |v_#valid_10| |v_ULTIMATE.start_main_#t~malloc11.base_4|)) (> 0 |v_ULTIMATE.start_main_#t~malloc12.base_4|) (= |v_ULTIMATE.start_main_#t~malloc12.offset_4| 0) (= (store .cse0 |v_ULTIMATE.start_main_#t~malloc12.base_4| 1) |v_#valid_8|) (< |v_ULTIMATE.start_main_#t~malloc11.base_4| 0) (= v_ULTIMATE.start_main_~nondetString2~0.base_2 |v_ULTIMATE.start_main_#t~malloc12.base_4|) (= 0 (select .cse0 |v_ULTIMATE.start_main_#t~malloc12.base_4|)) (< |v_ULTIMATE.start_main_#t~malloc12.base_4| |v_#StackHeapBarrier_1|) (< |v_ULTIMATE.start_main_#t~malloc11.base_4| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_main_~nondetString1~0.base_2 |v_ULTIMATE.start_main_#t~malloc11.base_4|) (= |v_#length_3| (store (store |v_#length_5| |v_ULTIMATE.start_main_#t~malloc11.base_4| v_ULTIMATE.start_main_~length1~0_7) |v_ULTIMATE.start_main_#t~malloc12.base_4| v_ULTIMATE.start_main_~length2~0_7)))) InVars {ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_5|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_7, #valid=|v_#valid_10|} OutVars{ULTIMATE.start_main_#t~malloc11.offset=|v_ULTIMATE.start_main_#t~malloc11.offset_4|, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_7, ULTIMATE.start_main_#t~malloc12.base=|v_ULTIMATE.start_main_#t~malloc12.base_4|, ULTIMATE.start_main_#t~malloc11.base=|v_ULTIMATE.start_main_#t~malloc11.base_4|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_2, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_2, ULTIMATE.start_main_#t~malloc12.offset=|v_ULTIMATE.start_main_#t~malloc12.offset_4|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_2, #valid=|v_#valid_8|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_2, #length=|v_#length_3|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc12.offset, ULTIMATE.start_main_#t~malloc11.offset, ULTIMATE.start_main_~nondetString1~0.base, #valid, ULTIMATE.start_main_#t~malloc12.base, ULTIMATE.start_main_~nondetString1~0.offset, ULTIMATE.start_main_#t~malloc11.base, #length, ULTIMATE.start_main_~nondetString2~0.base, ULTIMATE.start_main_~nondetString2~0.offset] 2071#L32 [96] L32-->L32-1: Formula: (let ((.cse0 (+ v_ULTIMATE.start_main_~length1~0_8 v_ULTIMATE.start_main_~nondetString1~0.offset_3))) (and (<= 1 .cse0) (= 1 (select |v_#valid_11| v_ULTIMATE.start_main_~nondetString1~0.base_3)) (= |v_#memory_int_2| (store |v_#memory_int_3| v_ULTIMATE.start_main_~nondetString1~0.base_3 (store (select |v_#memory_int_3| v_ULTIMATE.start_main_~nondetString1~0.base_3) (+ v_ULTIMATE.start_main_~length1~0_8 v_ULTIMATE.start_main_~nondetString1~0.offset_3 (- 1)) 0))) (<= .cse0 (select |v_#length_6| v_ULTIMATE.start_main_~nondetString1~0.base_3)))) InVars {ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_3, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_3|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_3, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_8, #length=|v_#length_6|} OutVars{ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_3, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_3, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_8, #length=|v_#length_6|} AuxVars[] AssignedVars[#memory_int] 2089#L32-1 [190] L32-1-->L8-3: Formula: (let ((.cse0 (+ v_ULTIMATE.start_main_~length2~0_11 v_ULTIMATE.start_main_~nondetString2~0.offset_7))) (and (= v_ULTIMATE.start_substring_~ps~0.offset_8 v_ULTIMATE.start_substring_~s.offset_3) (<= 1 .cse0) (= v_ULTIMATE.start_main_~nondetString2~0.base_8 |v_ULTIMATE.start_substring_#in~t.base_2|) (= |v_ULTIMATE.start_substring_#in~s.offset_2| v_ULTIMATE.start_substring_~s.offset_3) (= (select |v_#valid_25| v_ULTIMATE.start_main_~nondetString2~0.base_8) 1) (= |v_ULTIMATE.start_substring_#in~t.base_2| v_ULTIMATE.start_substring_~t.base_4) (= |v_ULTIMATE.start_substring_#in~s.base_2| v_ULTIMATE.start_main_~nondetString1~0.base_8) (= (store |v_#memory_int_11| v_ULTIMATE.start_main_~nondetString2~0.base_8 (store (select |v_#memory_int_11| v_ULTIMATE.start_main_~nondetString2~0.base_8) (+ v_ULTIMATE.start_main_~length2~0_11 v_ULTIMATE.start_main_~nondetString2~0.offset_7 (- 1)) 0)) |v_#memory_int_10|) (= v_ULTIMATE.start_main_~nondetString2~0.offset_7 |v_ULTIMATE.start_substring_#in~t.offset_2|) (= v_ULTIMATE.start_main_~nondetString1~0.offset_7 |v_ULTIMATE.start_substring_#in~s.offset_2|) (= |v_ULTIMATE.start_substring_#in~t.offset_2| v_ULTIMATE.start_substring_~t.offset_4) (= |v_ULTIMATE.start_substring_#in~s.base_2| v_ULTIMATE.start_substring_~s.base_3) (= v_ULTIMATE.start_substring_~s.base_3 v_ULTIMATE.start_substring_~ps~0.base_9) (<= .cse0 (select |v_#length_18| v_ULTIMATE.start_main_~nondetString2~0.base_8)))) InVars {ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_8, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_7, #length=|v_#length_18|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_8, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_7, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_11} OutVars{ULTIMATE.start_substring_#in~t.offset=|v_ULTIMATE.start_substring_#in~t.offset_2|, ULTIMATE.start_substring_~ps~0.offset=v_ULTIMATE.start_substring_~ps~0.offset_8, ULTIMATE.start_substring_#t~post5.offset=|v_ULTIMATE.start_substring_#t~post5.offset_4|, ULTIMATE.start_substring_~ps2~0.base=v_ULTIMATE.start_substring_~ps2~0.base_8, ULTIMATE.start_substring_#t~mem7=|v_ULTIMATE.start_substring_#t~mem7_7|, ULTIMATE.start_substring_~t.offset=v_ULTIMATE.start_substring_~t.offset_4, ULTIMATE.start_substring_#t~mem3=|v_ULTIMATE.start_substring_#t~mem3_6|, ULTIMATE.start_substring_#t~mem2=|v_ULTIMATE.start_substring_#t~mem2_6|, ULTIMATE.start_substring_#t~mem1=|v_ULTIMATE.start_substring_#t~mem1_6|, ULTIMATE.start_substring_#in~s.offset=|v_ULTIMATE.start_substring_#in~s.offset_2|, ULTIMATE.start_substring_#t~mem0=|v_ULTIMATE.start_substring_#t~mem0_7|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_8, ULTIMATE.start_substring_~ps2~0.offset=v_ULTIMATE.start_substring_~ps2~0.offset_7, ULTIMATE.start_substring_~pt~0.base=v_ULTIMATE.start_substring_~pt~0.base_14, ULTIMATE.start_substring_#t~post8.offset=|v_ULTIMATE.start_substring_#t~post8.offset_4|, #length=|v_#length_18|, ULTIMATE.start_substring_~pt~0.offset=v_ULTIMATE.start_substring_~pt~0.offset_11, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_11, ULTIMATE.start_substring_#res=|v_ULTIMATE.start_substring_#res_5|, ULTIMATE.start_substring_#t~post6.offset=|v_ULTIMATE.start_substring_#t~post6.offset_4|, ULTIMATE.start_substring_~t.base=v_ULTIMATE.start_substring_~t.base_4, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_8, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_7, ULTIMATE.start_substring_~s.base=v_ULTIMATE.start_substring_~s.base_3, ULTIMATE.start_substring_#in~t.base=|v_ULTIMATE.start_substring_#in~t.base_2|, ULTIMATE.start_substring_#in~s.base=|v_ULTIMATE.start_substring_#in~s.base_2|, ULTIMATE.start_substring_#t~post6.base=|v_ULTIMATE.start_substring_#t~post6.base_4|, ULTIMATE.start_substring_#t~post8.base=|v_ULTIMATE.start_substring_#t~post8.base_4|, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_10|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_7, ULTIMATE.start_substring_~ps~0.base=v_ULTIMATE.start_substring_~ps~0.base_9, ULTIMATE.start_substring_#t~post5.base=|v_ULTIMATE.start_substring_#t~post5.base_4|, ULTIMATE.start_substring_~s.offset=v_ULTIMATE.start_substring_~s.offset_3, ULTIMATE.start_substring_#t~short4=|v_ULTIMATE.start_substring_#t~short4_10|} AuxVars[] AssignedVars[ULTIMATE.start_substring_#in~t.offset, ULTIMATE.start_substring_~ps~0.offset, ULTIMATE.start_substring_#t~post5.offset, ULTIMATE.start_substring_~ps2~0.base, ULTIMATE.start_substring_#t~mem7, ULTIMATE.start_substring_~t.offset, ULTIMATE.start_substring_#t~mem3, ULTIMATE.start_substring_#t~mem2, ULTIMATE.start_substring_#t~mem1, ULTIMATE.start_substring_#in~s.offset, ULTIMATE.start_substring_#t~mem0, ULTIMATE.start_substring_~ps2~0.offset, ULTIMATE.start_substring_~pt~0.base, ULTIMATE.start_substring_#t~post8.offset, ULTIMATE.start_substring_~pt~0.offset, ULTIMATE.start_substring_#res, ULTIMATE.start_substring_#t~post6.offset, ULTIMATE.start_substring_~t.base, ULTIMATE.start_substring_~s.base, ULTIMATE.start_substring_#in~t.base, ULTIMATE.start_substring_#in~s.base, ULTIMATE.start_substring_#t~post6.base, ULTIMATE.start_substring_#t~post8.base, #memory_int, ULTIMATE.start_substring_~ps~0.base, ULTIMATE.start_substring_#t~post5.base, ULTIMATE.start_substring_~s.offset, ULTIMATE.start_substring_#t~short4] 2072#L8-3 [113] L8-3-->L8-1: Formula: (and (= (select (select |v_#memory_int_6| v_ULTIMATE.start_substring_~ps~0.base_5) v_ULTIMATE.start_substring_~ps~0.offset_5) |v_ULTIMATE.start_substring_#t~mem0_2|) (= (select |v_#valid_15| v_ULTIMATE.start_substring_~ps~0.base_5) 1) (<= 0 v_ULTIMATE.start_substring_~ps~0.offset_5) (<= (+ v_ULTIMATE.start_substring_~ps~0.offset_5 1) (select |v_#length_10| v_ULTIMATE.start_substring_~ps~0.base_5))) InVars {ULTIMATE.start_substring_~ps~0.offset=v_ULTIMATE.start_substring_~ps~0.offset_5, #memory_int=|v_#memory_int_6|, #length=|v_#length_10|, ULTIMATE.start_substring_~ps~0.base=v_ULTIMATE.start_substring_~ps~0.base_5, #valid=|v_#valid_15|} OutVars{ULTIMATE.start_substring_#t~mem0=|v_ULTIMATE.start_substring_#t~mem0_2|, #valid=|v_#valid_15|, ULTIMATE.start_substring_~ps~0.offset=v_ULTIMATE.start_substring_~ps~0.offset_5, #memory_int=|v_#memory_int_6|, #length=|v_#length_10|, ULTIMATE.start_substring_~ps~0.base=v_ULTIMATE.start_substring_~ps~0.base_5} AuxVars[] AssignedVars[ULTIMATE.start_substring_#t~mem0] 2073#L8-1 [163] L8-1-->L11-9: Formula: (and (= v_ULTIMATE.start_substring_~ps2~0.base_2 v_ULTIMATE.start_substring_~ps~0.base_8) (= v_ULTIMATE.start_substring_~pt~0.offset_4 v_ULTIMATE.start_substring_~t.offset_3) (< 0 |v_ULTIMATE.start_substring_#t~mem0_6|) (= v_ULTIMATE.start_substring_~pt~0.base_5 v_ULTIMATE.start_substring_~t.base_3) (= v_ULTIMATE.start_substring_~ps2~0.offset_2 v_ULTIMATE.start_substring_~ps~0.offset_7)) InVars {ULTIMATE.start_substring_~ps~0.offset=v_ULTIMATE.start_substring_~ps~0.offset_7, ULTIMATE.start_substring_~t.offset=v_ULTIMATE.start_substring_~t.offset_3, ULTIMATE.start_substring_~ps~0.base=v_ULTIMATE.start_substring_~ps~0.base_8, ULTIMATE.start_substring_~t.base=v_ULTIMATE.start_substring_~t.base_3, ULTIMATE.start_substring_#t~mem0=|v_ULTIMATE.start_substring_#t~mem0_6|} OutVars{ULTIMATE.start_substring_~t.offset=v_ULTIMATE.start_substring_~t.offset_3, ULTIMATE.start_substring_#t~mem0=|v_ULTIMATE.start_substring_#t~mem0_5|, ULTIMATE.start_substring_~ps2~0.offset=v_ULTIMATE.start_substring_~ps2~0.offset_2, ULTIMATE.start_substring_~pt~0.base=v_ULTIMATE.start_substring_~pt~0.base_5, ULTIMATE.start_substring_~ps~0.offset=v_ULTIMATE.start_substring_~ps~0.offset_7, ULTIMATE.start_substring_~ps2~0.base=v_ULTIMATE.start_substring_~ps2~0.base_2, ULTIMATE.start_substring_~ps~0.base=v_ULTIMATE.start_substring_~ps~0.base_8, ULTIMATE.start_substring_~t.base=v_ULTIMATE.start_substring_~t.base_3, ULTIMATE.start_substring_~pt~0.offset=v_ULTIMATE.start_substring_~pt~0.offset_4} AuxVars[] AssignedVars[ULTIMATE.start_substring_#t~mem0, ULTIMATE.start_substring_~ps2~0.offset, ULTIMATE.start_substring_~pt~0.base, ULTIMATE.start_substring_~ps2~0.base, ULTIMATE.start_substring_~pt~0.offset] 2081#L11-9 [103] L11-9-->L11-1: Formula: (and (<= 0 v_ULTIMATE.start_substring_~pt~0.offset_5) (<= (+ v_ULTIMATE.start_substring_~pt~0.offset_5 1) (select |v_#length_12| v_ULTIMATE.start_substring_~pt~0.base_6)) (= |v_ULTIMATE.start_substring_#t~mem1_2| (select (select |v_#memory_int_7| v_ULTIMATE.start_substring_~pt~0.base_6) v_ULTIMATE.start_substring_~pt~0.offset_5)) (= (select |v_#valid_17| v_ULTIMATE.start_substring_~pt~0.base_6) 1)) InVars {#memory_int=|v_#memory_int_7|, #length=|v_#length_12|, ULTIMATE.start_substring_~pt~0.offset=v_ULTIMATE.start_substring_~pt~0.offset_5, ULTIMATE.start_substring_~pt~0.base=v_ULTIMATE.start_substring_~pt~0.base_6, #valid=|v_#valid_17|} OutVars{ULTIMATE.start_substring_#t~mem1=|v_ULTIMATE.start_substring_#t~mem1_2|, ULTIMATE.start_substring_~pt~0.base=v_ULTIMATE.start_substring_~pt~0.base_6, #valid=|v_#valid_17|, #memory_int=|v_#memory_int_7|, #length=|v_#length_12|, ULTIMATE.start_substring_~pt~0.offset=v_ULTIMATE.start_substring_~pt~0.offset_5} AuxVars[] AssignedVars[ULTIMATE.start_substring_#t~mem1] 2112#L11-1 [174] L11-1-->L11-2: Formula: (and (> 0 |v_ULTIMATE.start_substring_#t~mem1_3|) |v_ULTIMATE.start_substring_#t~short4_2|) InVars {ULTIMATE.start_substring_#t~mem1=|v_ULTIMATE.start_substring_#t~mem1_3|} OutVars{ULTIMATE.start_substring_#t~mem1=|v_ULTIMATE.start_substring_#t~mem1_3|, ULTIMATE.start_substring_#t~short4=|v_ULTIMATE.start_substring_#t~short4_2|} AuxVars[] AssignedVars[ULTIMATE.start_substring_#t~short4] 2110#L11-2 [90] L11-2-->L11-3: Formula: |v_ULTIMATE.start_substring_#t~short4_3| InVars {ULTIMATE.start_substring_#t~short4=|v_ULTIMATE.start_substring_#t~short4_3|} OutVars{ULTIMATE.start_substring_#t~short4=|v_ULTIMATE.start_substring_#t~short4_3|} AuxVars[] AssignedVars[] 2108#L11-3 [87] L11-3-->L11-4: Formula: (and (<= (+ v_ULTIMATE.start_substring_~pt~0.offset_7 1) (select |v_#length_14| v_ULTIMATE.start_substring_~pt~0.base_9)) (= 1 (select |v_#valid_19| v_ULTIMATE.start_substring_~pt~0.base_9)) (<= 0 v_ULTIMATE.start_substring_~pt~0.offset_7) (= (select (select |v_#memory_int_8| v_ULTIMATE.start_substring_~pt~0.base_9) v_ULTIMATE.start_substring_~pt~0.offset_7) |v_ULTIMATE.start_substring_#t~mem2_2|)) InVars {#memory_int=|v_#memory_int_8|, #length=|v_#length_14|, ULTIMATE.start_substring_~pt~0.offset=v_ULTIMATE.start_substring_~pt~0.offset_7, ULTIMATE.start_substring_~pt~0.base=v_ULTIMATE.start_substring_~pt~0.base_9, #valid=|v_#valid_19|} OutVars{ULTIMATE.start_substring_#t~mem2=|v_ULTIMATE.start_substring_#t~mem2_2|, ULTIMATE.start_substring_~pt~0.base=v_ULTIMATE.start_substring_~pt~0.base_9, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_8|, #length=|v_#length_14|, ULTIMATE.start_substring_~pt~0.offset=v_ULTIMATE.start_substring_~pt~0.offset_7} AuxVars[] AssignedVars[ULTIMATE.start_substring_#t~mem2] 2106#L11-4 [83] L11-4-->L11-5: Formula: (and (= (select |v_#valid_21| v_ULTIMATE.start_substring_~ps2~0.base_3) 1) (<= (+ v_ULTIMATE.start_substring_~ps2~0.offset_3 1) (select |v_#length_16| v_ULTIMATE.start_substring_~ps2~0.base_3)) (<= 0 v_ULTIMATE.start_substring_~ps2~0.offset_3) (= (select (select |v_#memory_int_9| v_ULTIMATE.start_substring_~ps2~0.base_3) v_ULTIMATE.start_substring_~ps2~0.offset_3) |v_ULTIMATE.start_substring_#t~mem3_2|)) InVars {#memory_int=|v_#memory_int_9|, #length=|v_#length_16|, ULTIMATE.start_substring_~ps2~0.base=v_ULTIMATE.start_substring_~ps2~0.base_3, ULTIMATE.start_substring_~ps2~0.offset=v_ULTIMATE.start_substring_~ps2~0.offset_3, #valid=|v_#valid_21|} OutVars{ULTIMATE.start_substring_#t~mem3=|v_ULTIMATE.start_substring_#t~mem3_2|, ULTIMATE.start_substring_~ps2~0.offset=v_ULTIMATE.start_substring_~ps2~0.offset_3, #valid=|v_#valid_21|, #memory_int=|v_#memory_int_9|, #length=|v_#length_16|, ULTIMATE.start_substring_~ps2~0.base=v_ULTIMATE.start_substring_~ps2~0.base_3} AuxVars[] AssignedVars[ULTIMATE.start_substring_#t~mem3] 2104#L11-5 [188] L11-5-->L11-7: Formula: (and (not |v_ULTIMATE.start_substring_#t~short4_4|) (> |v_ULTIMATE.start_substring_#t~mem3_3| |v_ULTIMATE.start_substring_#t~mem2_3|)) InVars {ULTIMATE.start_substring_#t~mem2=|v_ULTIMATE.start_substring_#t~mem2_3|, ULTIMATE.start_substring_#t~mem3=|v_ULTIMATE.start_substring_#t~mem3_3|} OutVars{ULTIMATE.start_substring_#t~mem3=|v_ULTIMATE.start_substring_#t~mem3_3|, ULTIMATE.start_substring_#t~mem2=|v_ULTIMATE.start_substring_#t~mem2_3|, ULTIMATE.start_substring_#t~short4=|v_ULTIMATE.start_substring_#t~short4_4|} AuxVars[] AssignedVars[ULTIMATE.start_substring_#t~short4] 2101#L11-7 [108] L11-7-->L11-10: Formula: (not |v_ULTIMATE.start_substring_#t~short4_7|) InVars {ULTIMATE.start_substring_#t~short4=|v_ULTIMATE.start_substring_#t~short4_7|} OutVars{ULTIMATE.start_substring_#t~mem3=|v_ULTIMATE.start_substring_#t~mem3_4|, ULTIMATE.start_substring_#t~mem2=|v_ULTIMATE.start_substring_#t~mem2_4|, ULTIMATE.start_substring_#t~mem1=|v_ULTIMATE.start_substring_#t~mem1_4|, ULTIMATE.start_substring_#t~short4=|v_ULTIMATE.start_substring_#t~short4_6|} AuxVars[] AssignedVars[ULTIMATE.start_substring_#t~mem3, ULTIMATE.start_substring_#t~mem2, ULTIMATE.start_substring_#t~mem1, ULTIMATE.start_substring_#t~short4] 2095#L11-10 [99] L11-10-->L15: Formula: (and (= (select |v_#valid_3| v_ULTIMATE.start_substring_~pt~0.base_1) 1) (<= (+ v_ULTIMATE.start_substring_~pt~0.offset_1 1) (select |v_#length_1| v_ULTIMATE.start_substring_~pt~0.base_1)) (= (select (select |v_#memory_int_1| v_ULTIMATE.start_substring_~pt~0.base_1) v_ULTIMATE.start_substring_~pt~0.offset_1) |v_ULTIMATE.start_substring_#t~mem7_1|) (<= 0 v_ULTIMATE.start_substring_~pt~0.offset_1)) InVars {#memory_int=|v_#memory_int_1|, #length=|v_#length_1|, ULTIMATE.start_substring_~pt~0.offset=v_ULTIMATE.start_substring_~pt~0.offset_1, ULTIMATE.start_substring_~pt~0.base=v_ULTIMATE.start_substring_~pt~0.base_1, #valid=|v_#valid_3|} OutVars{ULTIMATE.start_substring_~pt~0.base=v_ULTIMATE.start_substring_~pt~0.base_1, #valid=|v_#valid_3|, #memory_int=|v_#memory_int_1|, #length=|v_#length_1|, ULTIMATE.start_substring_~pt~0.offset=v_ULTIMATE.start_substring_~pt~0.offset_1, ULTIMATE.start_substring_#t~mem7=|v_ULTIMATE.start_substring_#t~mem7_1|} AuxVars[] AssignedVars[ULTIMATE.start_substring_#t~mem7] 2096#L15 [176] L15-->L8-3: Formula: (and (= (+ v_ULTIMATE.start_substring_~ps~0.offset_2 1) v_ULTIMATE.start_substring_~ps~0.offset_1) (> 0 |v_ULTIMATE.start_substring_#t~mem7_5|) (= v_ULTIMATE.start_substring_~ps~0.base_2 v_ULTIMATE.start_substring_~ps~0.base_1)) InVars {ULTIMATE.start_substring_~ps~0.offset=v_ULTIMATE.start_substring_~ps~0.offset_2, ULTIMATE.start_substring_~ps~0.base=v_ULTIMATE.start_substring_~ps~0.base_2, ULTIMATE.start_substring_#t~mem7=|v_ULTIMATE.start_substring_#t~mem7_5|} OutVars{ULTIMATE.start_substring_~ps~0.offset=v_ULTIMATE.start_substring_~ps~0.offset_1, ULTIMATE.start_substring_#t~post8.base=|v_ULTIMATE.start_substring_#t~post8.base_1|, ULTIMATE.start_substring_#t~post8.offset=|v_ULTIMATE.start_substring_#t~post8.offset_1|, ULTIMATE.start_substring_~ps~0.base=v_ULTIMATE.start_substring_~ps~0.base_1, ULTIMATE.start_substring_#t~mem7=|v_ULTIMATE.start_substring_#t~mem7_4|} AuxVars[] AssignedVars[ULTIMATE.start_substring_#t~post8.base, ULTIMATE.start_substring_~ps~0.offset, ULTIMATE.start_substring_#t~post8.offset, ULTIMATE.start_substring_~ps~0.base, ULTIMATE.start_substring_#t~mem7] 2069#L8-3 [113] L8-3-->L8-1: Formula: (and (= (select (select |v_#memory_int_6| v_ULTIMATE.start_substring_~ps~0.base_5) v_ULTIMATE.start_substring_~ps~0.offset_5) |v_ULTIMATE.start_substring_#t~mem0_2|) (= (select |v_#valid_15| v_ULTIMATE.start_substring_~ps~0.base_5) 1) (<= 0 v_ULTIMATE.start_substring_~ps~0.offset_5) (<= (+ v_ULTIMATE.start_substring_~ps~0.offset_5 1) (select |v_#length_10| v_ULTIMATE.start_substring_~ps~0.base_5))) InVars {ULTIMATE.start_substring_~ps~0.offset=v_ULTIMATE.start_substring_~ps~0.offset_5, #memory_int=|v_#memory_int_6|, #length=|v_#length_10|, ULTIMATE.start_substring_~ps~0.base=v_ULTIMATE.start_substring_~ps~0.base_5, #valid=|v_#valid_15|} OutVars{ULTIMATE.start_substring_#t~mem0=|v_ULTIMATE.start_substring_#t~mem0_2|, #valid=|v_#valid_15|, ULTIMATE.start_substring_~ps~0.offset=v_ULTIMATE.start_substring_~ps~0.offset_5, #memory_int=|v_#memory_int_6|, #length=|v_#length_10|, ULTIMATE.start_substring_~ps~0.base=v_ULTIMATE.start_substring_~ps~0.base_5} AuxVars[] AssignedVars[ULTIMATE.start_substring_#t~mem0] 2075#L8-1 [164] L8-1-->L11-9: Formula: (and (= v_ULTIMATE.start_substring_~ps2~0.base_2 v_ULTIMATE.start_substring_~ps~0.base_8) (= v_ULTIMATE.start_substring_~pt~0.offset_4 v_ULTIMATE.start_substring_~t.offset_3) (> 0 |v_ULTIMATE.start_substring_#t~mem0_6|) (= v_ULTIMATE.start_substring_~pt~0.base_5 v_ULTIMATE.start_substring_~t.base_3) (= v_ULTIMATE.start_substring_~ps2~0.offset_2 v_ULTIMATE.start_substring_~ps~0.offset_7)) InVars {ULTIMATE.start_substring_~ps~0.offset=v_ULTIMATE.start_substring_~ps~0.offset_7, ULTIMATE.start_substring_~t.offset=v_ULTIMATE.start_substring_~t.offset_3, ULTIMATE.start_substring_~ps~0.base=v_ULTIMATE.start_substring_~ps~0.base_8, ULTIMATE.start_substring_~t.base=v_ULTIMATE.start_substring_~t.base_3, ULTIMATE.start_substring_#t~mem0=|v_ULTIMATE.start_substring_#t~mem0_6|} OutVars{ULTIMATE.start_substring_~t.offset=v_ULTIMATE.start_substring_~t.offset_3, ULTIMATE.start_substring_#t~mem0=|v_ULTIMATE.start_substring_#t~mem0_5|, ULTIMATE.start_substring_~ps2~0.offset=v_ULTIMATE.start_substring_~ps2~0.offset_2, ULTIMATE.start_substring_~pt~0.base=v_ULTIMATE.start_substring_~pt~0.base_5, ULTIMATE.start_substring_~ps~0.offset=v_ULTIMATE.start_substring_~ps~0.offset_7, ULTIMATE.start_substring_~ps2~0.base=v_ULTIMATE.start_substring_~ps2~0.base_2, ULTIMATE.start_substring_~ps~0.base=v_ULTIMATE.start_substring_~ps~0.base_8, ULTIMATE.start_substring_~t.base=v_ULTIMATE.start_substring_~t.base_3, ULTIMATE.start_substring_~pt~0.offset=v_ULTIMATE.start_substring_~pt~0.offset_4} AuxVars[] AssignedVars[ULTIMATE.start_substring_#t~mem0, ULTIMATE.start_substring_~ps2~0.offset, ULTIMATE.start_substring_~pt~0.base, ULTIMATE.start_substring_~ps2~0.base, ULTIMATE.start_substring_~pt~0.offset] 2080#L11-9 172.61/109.73 [2019-03-28 12:36:43,232 INFO L796 eck$LassoCheckResult]: Loop: 2080#L11-9 [103] L11-9-->L11-1: Formula: (and (<= 0 v_ULTIMATE.start_substring_~pt~0.offset_5) (<= (+ v_ULTIMATE.start_substring_~pt~0.offset_5 1) (select |v_#length_12| v_ULTIMATE.start_substring_~pt~0.base_6)) (= |v_ULTIMATE.start_substring_#t~mem1_2| (select (select |v_#memory_int_7| v_ULTIMATE.start_substring_~pt~0.base_6) v_ULTIMATE.start_substring_~pt~0.offset_5)) (= (select |v_#valid_17| v_ULTIMATE.start_substring_~pt~0.base_6) 1)) InVars {#memory_int=|v_#memory_int_7|, #length=|v_#length_12|, ULTIMATE.start_substring_~pt~0.offset=v_ULTIMATE.start_substring_~pt~0.offset_5, ULTIMATE.start_substring_~pt~0.base=v_ULTIMATE.start_substring_~pt~0.base_6, #valid=|v_#valid_17|} OutVars{ULTIMATE.start_substring_#t~mem1=|v_ULTIMATE.start_substring_#t~mem1_2|, ULTIMATE.start_substring_~pt~0.base=v_ULTIMATE.start_substring_~pt~0.base_6, #valid=|v_#valid_17|, #memory_int=|v_#memory_int_7|, #length=|v_#length_12|, ULTIMATE.start_substring_~pt~0.offset=v_ULTIMATE.start_substring_~pt~0.offset_5} AuxVars[] AssignedVars[ULTIMATE.start_substring_#t~mem1] 2090#L11-1 [174] L11-1-->L11-2: Formula: (and (> 0 |v_ULTIMATE.start_substring_#t~mem1_3|) |v_ULTIMATE.start_substring_#t~short4_2|) InVars {ULTIMATE.start_substring_#t~mem1=|v_ULTIMATE.start_substring_#t~mem1_3|} OutVars{ULTIMATE.start_substring_#t~mem1=|v_ULTIMATE.start_substring_#t~mem1_3|, ULTIMATE.start_substring_#t~short4=|v_ULTIMATE.start_substring_#t~short4_2|} AuxVars[] AssignedVars[ULTIMATE.start_substring_#t~short4] 2087#L11-2 [90] L11-2-->L11-3: Formula: |v_ULTIMATE.start_substring_#t~short4_3| InVars {ULTIMATE.start_substring_#t~short4=|v_ULTIMATE.start_substring_#t~short4_3|} OutVars{ULTIMATE.start_substring_#t~short4=|v_ULTIMATE.start_substring_#t~short4_3|} AuxVars[] AssignedVars[] 2085#L11-3 [87] L11-3-->L11-4: Formula: (and (<= (+ v_ULTIMATE.start_substring_~pt~0.offset_7 1) (select |v_#length_14| v_ULTIMATE.start_substring_~pt~0.base_9)) (= 1 (select |v_#valid_19| v_ULTIMATE.start_substring_~pt~0.base_9)) (<= 0 v_ULTIMATE.start_substring_~pt~0.offset_7) (= (select (select |v_#memory_int_8| v_ULTIMATE.start_substring_~pt~0.base_9) v_ULTIMATE.start_substring_~pt~0.offset_7) |v_ULTIMATE.start_substring_#t~mem2_2|)) InVars {#memory_int=|v_#memory_int_8|, #length=|v_#length_14|, ULTIMATE.start_substring_~pt~0.offset=v_ULTIMATE.start_substring_~pt~0.offset_7, ULTIMATE.start_substring_~pt~0.base=v_ULTIMATE.start_substring_~pt~0.base_9, #valid=|v_#valid_19|} OutVars{ULTIMATE.start_substring_#t~mem2=|v_ULTIMATE.start_substring_#t~mem2_2|, ULTIMATE.start_substring_~pt~0.base=v_ULTIMATE.start_substring_~pt~0.base_9, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_8|, #length=|v_#length_14|, ULTIMATE.start_substring_~pt~0.offset=v_ULTIMATE.start_substring_~pt~0.offset_7} AuxVars[] AssignedVars[ULTIMATE.start_substring_#t~mem2] 2083#L11-4 [83] L11-4-->L11-5: Formula: (and (= (select |v_#valid_21| v_ULTIMATE.start_substring_~ps2~0.base_3) 1) (<= (+ v_ULTIMATE.start_substring_~ps2~0.offset_3 1) (select |v_#length_16| v_ULTIMATE.start_substring_~ps2~0.base_3)) (<= 0 v_ULTIMATE.start_substring_~ps2~0.offset_3) (= (select (select |v_#memory_int_9| v_ULTIMATE.start_substring_~ps2~0.base_3) v_ULTIMATE.start_substring_~ps2~0.offset_3) |v_ULTIMATE.start_substring_#t~mem3_2|)) InVars {#memory_int=|v_#memory_int_9|, #length=|v_#length_16|, ULTIMATE.start_substring_~ps2~0.base=v_ULTIMATE.start_substring_~ps2~0.base_3, ULTIMATE.start_substring_~ps2~0.offset=v_ULTIMATE.start_substring_~ps2~0.offset_3, #valid=|v_#valid_21|} OutVars{ULTIMATE.start_substring_#t~mem3=|v_ULTIMATE.start_substring_#t~mem3_2|, ULTIMATE.start_substring_~ps2~0.offset=v_ULTIMATE.start_substring_~ps2~0.offset_3, #valid=|v_#valid_21|, #memory_int=|v_#memory_int_9|, #length=|v_#length_16|, ULTIMATE.start_substring_~ps2~0.base=v_ULTIMATE.start_substring_~ps2~0.base_3} AuxVars[] AssignedVars[ULTIMATE.start_substring_#t~mem3] 2076#L11-5 [186] L11-5-->L11-7: Formula: (and (= |v_ULTIMATE.start_substring_#t~mem3_3| |v_ULTIMATE.start_substring_#t~mem2_3|) |v_ULTIMATE.start_substring_#t~short4_4|) InVars {ULTIMATE.start_substring_#t~mem2=|v_ULTIMATE.start_substring_#t~mem2_3|, ULTIMATE.start_substring_#t~mem3=|v_ULTIMATE.start_substring_#t~mem3_3|} OutVars{ULTIMATE.start_substring_#t~mem3=|v_ULTIMATE.start_substring_#t~mem3_3|, ULTIMATE.start_substring_#t~mem2=|v_ULTIMATE.start_substring_#t~mem2_3|, ULTIMATE.start_substring_#t~short4=|v_ULTIMATE.start_substring_#t~short4_4|} AuxVars[] AssignedVars[ULTIMATE.start_substring_#t~short4] 2077#L11-7 [109] L11-7-->L11-9: Formula: (and (= v_ULTIMATE.start_substring_~ps2~0.offset_5 (+ v_ULTIMATE.start_substring_~ps2~0.offset_6 1)) (= v_ULTIMATE.start_substring_~pt~0.base_13 v_ULTIMATE.start_substring_~pt~0.base_12) (= v_ULTIMATE.start_substring_~ps2~0.base_7 v_ULTIMATE.start_substring_~ps2~0.base_6) |v_ULTIMATE.start_substring_#t~short4_9| (= (+ v_ULTIMATE.start_substring_~pt~0.offset_10 1) v_ULTIMATE.start_substring_~pt~0.offset_9)) InVars {ULTIMATE.start_substring_~ps2~0.base=v_ULTIMATE.start_substring_~ps2~0.base_7, ULTIMATE.start_substring_~pt~0.offset=v_ULTIMATE.start_substring_~pt~0.offset_10, ULTIMATE.start_substring_~ps2~0.offset=v_ULTIMATE.start_substring_~ps2~0.offset_6, ULTIMATE.start_substring_~pt~0.base=v_ULTIMATE.start_substring_~pt~0.base_13, ULTIMATE.start_substring_#t~short4=|v_ULTIMATE.start_substring_#t~short4_9|} OutVars{ULTIMATE.start_substring_#t~post6.offset=|v_ULTIMATE.start_substring_#t~post6.offset_2|, ULTIMATE.start_substring_#t~post5.offset=|v_ULTIMATE.start_substring_#t~post5.offset_2|, ULTIMATE.start_substring_~ps2~0.base=v_ULTIMATE.start_substring_~ps2~0.base_6, ULTIMATE.start_substring_#t~post6.base=|v_ULTIMATE.start_substring_#t~post6.base_2|, ULTIMATE.start_substring_#t~mem3=|v_ULTIMATE.start_substring_#t~mem3_5|, ULTIMATE.start_substring_#t~mem2=|v_ULTIMATE.start_substring_#t~mem2_5|, ULTIMATE.start_substring_#t~mem1=|v_ULTIMATE.start_substring_#t~mem1_5|, ULTIMATE.start_substring_~ps2~0.offset=v_ULTIMATE.start_substring_~ps2~0.offset_5, ULTIMATE.start_substring_~pt~0.base=v_ULTIMATE.start_substring_~pt~0.base_12, ULTIMATE.start_substring_#t~post5.base=|v_ULTIMATE.start_substring_#t~post5.base_2|, ULTIMATE.start_substring_~pt~0.offset=v_ULTIMATE.start_substring_~pt~0.offset_9, ULTIMATE.start_substring_#t~short4=|v_ULTIMATE.start_substring_#t~short4_8|} AuxVars[] AssignedVars[ULTIMATE.start_substring_#t~post6.base, ULTIMATE.start_substring_#t~post6.offset, ULTIMATE.start_substring_#t~mem3, ULTIMATE.start_substring_#t~mem2, ULTIMATE.start_substring_#t~mem1, ULTIMATE.start_substring_~ps2~0.offset, ULTIMATE.start_substring_~pt~0.base, ULTIMATE.start_substring_#t~post5.offset, ULTIMATE.start_substring_~ps2~0.base, ULTIMATE.start_substring_#t~post5.base, ULTIMATE.start_substring_~pt~0.offset, ULTIMATE.start_substring_#t~short4] 2080#L11-9 172.61/109.73 [2019-03-28 12:36:43,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 172.61/109.73 [2019-03-28 12:36:43,233 INFO L82 PathProgramCache]: Analyzing trace with hash -35257098, now seen corresponding path program 1 times 172.61/109.73 [2019-03-28 12:36:43,233 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 172.61/109.73 [2019-03-28 12:36:43,233 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 172.61/109.73 [2019-03-28 12:36:43,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 172.61/109.73 [2019-03-28 12:36:43,234 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 172.61/109.73 [2019-03-28 12:36:43,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 172.61/109.73 [2019-03-28 12:36:43,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 172.61/109.73 [2019-03-28 12:36:43,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 172.61/109.73 [2019-03-28 12:36:43,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 172.61/109.73 [2019-03-28 12:36:43,251 INFO L82 PathProgramCache]: Analyzing trace with hash -561291711, now seen corresponding path program 4 times 172.61/109.73 [2019-03-28 12:36:43,251 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 172.61/109.73 [2019-03-28 12:36:43,251 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 172.61/109.73 [2019-03-28 12:36:43,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 172.61/109.73 [2019-03-28 12:36:43,252 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 172.61/109.73 [2019-03-28 12:36:43,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 172.61/109.73 [2019-03-28 12:36:43,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 172.61/109.73 [2019-03-28 12:36:43,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 172.61/109.73 [2019-03-28 12:36:43,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 172.61/109.73 [2019-03-28 12:36:43,257 INFO L82 PathProgramCache]: Analyzing trace with hash -2129081428, now seen corresponding path program 1 times 172.61/109.73 [2019-03-28 12:36:43,257 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 172.61/109.73 [2019-03-28 12:36:43,257 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 172.61/109.73 [2019-03-28 12:36:43,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 172.61/109.73 [2019-03-28 12:36:43,258 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 172.61/109.73 [2019-03-28 12:36:43,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 172.61/109.73 [2019-03-28 12:36:43,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 172.61/109.73 [2019-03-28 12:36:43,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 172.61/109.73 [2019-03-28 12:36:44,213 WARN L188 SmtUtils]: Spent 854.00 ms on a formula simplification. DAG size of input: 165 DAG size of output: 135 172.61/109.73 [2019-03-28 12:36:44,422 WARN L188 SmtUtils]: Spent 205.00 ms on a formula simplification that was a NOOP. DAG size: 102 172.61/109.73 [2019-03-28 12:36:44,424 INFO L216 LassoAnalysis]: Preferences: 172.61/109.73 [2019-03-28 12:36:44,424 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 172.61/109.73 [2019-03-28 12:36:44,424 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 172.61/109.73 [2019-03-28 12:36:44,425 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 172.61/109.73 [2019-03-28 12:36:44,425 INFO L127 ssoRankerPreferences]: Use exernal solver: false 172.61/109.73 [2019-03-28 12:36:44,425 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 172.61/109.73 [2019-03-28 12:36:44,425 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 172.61/109.73 [2019-03-28 12:36:44,425 INFO L130 ssoRankerPreferences]: Path of dumped script: 172.61/109.73 [2019-03-28 12:36:44,425 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration10_Lasso 172.61/109.73 [2019-03-28 12:36:44,425 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 172.61/109.73 [2019-03-28 12:36:44,425 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 172.61/109.73 [2019-03-28 12:36:44,428 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 172.61/109.73 [2019-03-28 12:36:44,434 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 172.61/109.73 [2019-03-28 12:36:44,436 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 172.61/109.73 [2019-03-28 12:36:44,439 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 172.61/109.73 [2019-03-28 12:36:44,441 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 172.61/109.73 [2019-03-28 12:36:44,443 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 172.61/109.73 [2019-03-28 12:36:44,445 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 172.61/109.73 [2019-03-28 12:36:44,447 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 172.61/109.73 [2019-03-28 12:36:44,449 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 172.61/109.73 [2019-03-28 12:36:44,450 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 172.61/109.73 [2019-03-28 12:36:44,452 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 172.61/109.73 [2019-03-28 12:36:45,080 WARN L188 SmtUtils]: Spent 328.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 93 172.61/109.73 [2019-03-28 12:36:45,292 WARN L188 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 70 172.61/109.73 [2019-03-28 12:36:45,292 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 172.61/109.73 [2019-03-28 12:36:45,294 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 172.61/109.73 [2019-03-28 12:36:45,295 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 172.61/109.73 [2019-03-28 12:36:45,297 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 172.61/109.73 [2019-03-28 12:36:45,298 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 172.61/109.73 [2019-03-28 12:36:45,299 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 172.61/109.73 [2019-03-28 12:36:45,301 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 172.61/109.73 [2019-03-28 12:36:45,302 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 172.61/109.73 [2019-03-28 12:36:45,304 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 172.61/109.73 [2019-03-28 12:36:45,306 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 172.61/109.73 [2019-03-28 12:36:45,612 WARN L188 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 172.61/109.73 [2019-03-28 12:36:45,949 INFO L300 LassoAnalysis]: Preprocessing complete. 172.61/109.73 [2019-03-28 12:36:45,950 INFO L497 LassoAnalysis]: Using template 'affine'. 172.61/109.73 [2019-03-28 12:36:45,950 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 172.61/109.73 Termination analysis: LINEAR_WITH_GUESSES 172.61/109.73 Number of strict supporting invariants: 0 172.61/109.73 Number of non-strict supporting invariants: 1 172.61/109.73 Consider only non-deceasing supporting invariants: true 172.61/109.73 Simplify termination arguments: true 172.61/109.73 Simplify supporting invariants: trueOverapproximate stem: false 172.61/109.73 [2019-03-28 12:36:45,950 INFO L339 nArgumentSynthesizer]: Template has degree 0. 172.61/109.73 [2019-03-28 12:36:45,951 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 172.61/109.73 [2019-03-28 12:36:45,951 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 172.61/109.73 [2019-03-28 12:36:45,951 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 172.61/109.73 [2019-03-28 12:36:45,951 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 172.61/109.73 [2019-03-28 12:36:45,951 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 172.61/109.73 [2019-03-28 12:36:45,951 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 172.61/109.73 [2019-03-28 12:36:45,952 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 172.61/109.73 [2019-03-28 12:36:45,952 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 172.61/109.73 Termination analysis: LINEAR_WITH_GUESSES 172.61/109.73 Number of strict supporting invariants: 0 172.61/109.73 Number of non-strict supporting invariants: 1 172.61/109.73 Consider only non-deceasing supporting invariants: true 172.61/109.73 Simplify termination arguments: true 172.61/109.73 Simplify supporting invariants: trueOverapproximate stem: false 172.61/109.73 [2019-03-28 12:36:45,952 INFO L339 nArgumentSynthesizer]: Template has degree 0. 172.61/109.73 [2019-03-28 12:36:45,952 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 172.61/109.73 [2019-03-28 12:36:45,953 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 172.61/109.73 [2019-03-28 12:36:45,953 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 172.61/109.73 [2019-03-28 12:36:45,953 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 172.61/109.73 [2019-03-28 12:36:45,953 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 172.61/109.73 [2019-03-28 12:36:45,953 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 172.61/109.73 [2019-03-28 12:36:45,953 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 172.61/109.73 [2019-03-28 12:36:45,954 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 172.61/109.73 Termination analysis: LINEAR_WITH_GUESSES 172.61/109.73 Number of strict supporting invariants: 0 172.61/109.73 Number of non-strict supporting invariants: 1 172.61/109.73 Consider only non-deceasing supporting invariants: true 172.61/109.73 Simplify termination arguments: true 172.61/109.73 Simplify supporting invariants: trueOverapproximate stem: false 172.61/109.73 [2019-03-28 12:36:45,954 INFO L339 nArgumentSynthesizer]: Template has degree 0. 172.61/109.73 [2019-03-28 12:36:45,954 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 172.61/109.73 [2019-03-28 12:36:45,954 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 172.61/109.73 [2019-03-28 12:36:45,954 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 172.61/109.73 [2019-03-28 12:36:45,955 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 172.61/109.73 [2019-03-28 12:36:45,955 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 172.61/109.73 [2019-03-28 12:36:45,956 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 172.61/109.73 [2019-03-28 12:36:45,956 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 172.61/109.73 Termination analysis: LINEAR_WITH_GUESSES 172.61/109.73 Number of strict supporting invariants: 0 172.61/109.73 Number of non-strict supporting invariants: 1 172.61/109.73 Consider only non-deceasing supporting invariants: true 172.61/109.73 Simplify termination arguments: true 172.61/109.73 Simplify supporting invariants: trueOverapproximate stem: false 172.61/109.73 [2019-03-28 12:36:45,956 INFO L339 nArgumentSynthesizer]: Template has degree 0. 172.61/109.73 [2019-03-28 12:36:45,957 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 172.61/109.73 [2019-03-28 12:36:45,957 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 172.61/109.73 [2019-03-28 12:36:45,957 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 172.61/109.73 [2019-03-28 12:36:45,957 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 172.61/109.73 [2019-03-28 12:36:45,957 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 172.61/109.73 [2019-03-28 12:36:45,957 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 172.61/109.73 [2019-03-28 12:36:45,958 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 172.61/109.73 [2019-03-28 12:36:45,958 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 172.61/109.73 Termination analysis: LINEAR_WITH_GUESSES 172.61/109.73 Number of strict supporting invariants: 0 172.61/109.73 Number of non-strict supporting invariants: 1 172.61/109.73 Consider only non-deceasing supporting invariants: true 172.61/109.73 Simplify termination arguments: true 172.61/109.73 Simplify supporting invariants: trueOverapproximate stem: false 172.61/109.73 [2019-03-28 12:36:45,958 INFO L339 nArgumentSynthesizer]: Template has degree 0. 172.61/109.73 [2019-03-28 12:36:45,958 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 172.61/109.73 [2019-03-28 12:36:45,958 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 172.61/109.73 [2019-03-28 12:36:45,959 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 172.61/109.73 [2019-03-28 12:36:45,959 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 172.61/109.73 [2019-03-28 12:36:45,959 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 172.61/109.73 [2019-03-28 12:36:45,959 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 172.61/109.73 [2019-03-28 12:36:45,959 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 172.61/109.73 [2019-03-28 12:36:45,960 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 172.61/109.73 Termination analysis: LINEAR_WITH_GUESSES 172.61/109.73 Number of strict supporting invariants: 0 172.61/109.73 Number of non-strict supporting invariants: 1 172.61/109.73 Consider only non-deceasing supporting invariants: true 172.61/109.73 Simplify termination arguments: true 172.61/109.73 Simplify supporting invariants: trueOverapproximate stem: false 172.61/109.73 [2019-03-28 12:36:45,960 INFO L339 nArgumentSynthesizer]: Template has degree 0. 172.61/109.73 [2019-03-28 12:36:45,960 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 172.61/109.73 [2019-03-28 12:36:45,960 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 172.61/109.73 [2019-03-28 12:36:45,960 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 172.61/109.73 [2019-03-28 12:36:45,960 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 172.61/109.73 [2019-03-28 12:36:45,961 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 172.61/109.73 [2019-03-28 12:36:45,961 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 172.61/109.73 [2019-03-28 12:36:45,961 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 172.61/109.73 [2019-03-28 12:36:45,961 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 172.61/109.73 Termination analysis: LINEAR_WITH_GUESSES 172.61/109.73 Number of strict supporting invariants: 0 172.61/109.73 Number of non-strict supporting invariants: 1 172.61/109.73 Consider only non-deceasing supporting invariants: true 172.61/109.73 Simplify termination arguments: true 172.61/109.73 Simplify supporting invariants: trueOverapproximate stem: false 172.61/109.73 [2019-03-28 12:36:45,962 INFO L339 nArgumentSynthesizer]: Template has degree 0. 172.61/109.73 [2019-03-28 12:36:45,962 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 172.61/109.73 [2019-03-28 12:36:45,962 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 172.61/109.73 [2019-03-28 12:36:45,962 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 172.61/109.73 [2019-03-28 12:36:45,962 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 172.61/109.73 [2019-03-28 12:36:45,962 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 172.61/109.73 [2019-03-28 12:36:45,963 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 172.61/109.73 [2019-03-28 12:36:45,963 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 172.61/109.73 [2019-03-28 12:36:45,963 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 172.61/109.73 Termination analysis: LINEAR_WITH_GUESSES 172.61/109.73 Number of strict supporting invariants: 0 172.61/109.73 Number of non-strict supporting invariants: 1 172.61/109.73 Consider only non-deceasing supporting invariants: true 172.61/109.73 Simplify termination arguments: true 172.61/109.73 Simplify supporting invariants: trueOverapproximate stem: false 172.61/109.73 [2019-03-28 12:36:45,963 INFO L339 nArgumentSynthesizer]: Template has degree 0. 172.61/109.73 [2019-03-28 12:36:45,963 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 172.61/109.73 [2019-03-28 12:36:45,964 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 172.61/109.73 [2019-03-28 12:36:45,964 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 172.61/109.73 [2019-03-28 12:36:45,964 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 172.61/109.73 [2019-03-28 12:36:45,964 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 172.61/109.73 [2019-03-28 12:36:45,965 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 172.61/109.73 [2019-03-28 12:36:45,965 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 172.61/109.73 Termination analysis: LINEAR_WITH_GUESSES 172.61/109.73 Number of strict supporting invariants: 0 172.61/109.73 Number of non-strict supporting invariants: 1 172.61/109.73 Consider only non-deceasing supporting invariants: true 172.61/109.73 Simplify termination arguments: true 172.61/109.73 Simplify supporting invariants: trueOverapproximate stem: false 172.61/109.73 [2019-03-28 12:36:45,966 INFO L339 nArgumentSynthesizer]: Template has degree 0. 172.61/109.73 [2019-03-28 12:36:45,966 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 172.61/109.73 [2019-03-28 12:36:45,966 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 172.61/109.73 [2019-03-28 12:36:45,966 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 172.61/109.73 [2019-03-28 12:36:45,966 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 172.61/109.73 [2019-03-28 12:36:45,966 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 172.61/109.73 [2019-03-28 12:36:45,967 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 172.61/109.73 [2019-03-28 12:36:45,967 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 172.61/109.73 [2019-03-28 12:36:45,967 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 172.61/109.73 Termination analysis: LINEAR_WITH_GUESSES 172.61/109.73 Number of strict supporting invariants: 0 172.61/109.73 Number of non-strict supporting invariants: 1 172.61/109.73 Consider only non-deceasing supporting invariants: true 172.61/109.73 Simplify termination arguments: true 172.61/109.73 Simplify supporting invariants: trueOverapproximate stem: false 172.61/109.73 [2019-03-28 12:36:45,967 INFO L339 nArgumentSynthesizer]: Template has degree 0. 172.61/109.73 [2019-03-28 12:36:45,968 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 172.61/109.73 [2019-03-28 12:36:45,968 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 172.61/109.73 [2019-03-28 12:36:45,968 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 172.61/109.73 [2019-03-28 12:36:45,968 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 172.61/109.73 [2019-03-28 12:36:45,968 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 172.61/109.73 [2019-03-28 12:36:45,968 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 172.61/109.73 [2019-03-28 12:36:45,969 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 172.61/109.73 [2019-03-28 12:36:45,969 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 172.61/109.73 Termination analysis: LINEAR_WITH_GUESSES 172.61/109.73 Number of strict supporting invariants: 0 172.61/109.73 Number of non-strict supporting invariants: 1 172.61/109.73 Consider only non-deceasing supporting invariants: true 172.61/109.73 Simplify termination arguments: true 172.61/109.73 Simplify supporting invariants: trueOverapproximate stem: false 172.61/109.73 [2019-03-28 12:36:45,969 INFO L339 nArgumentSynthesizer]: Template has degree 0. 172.61/109.73 [2019-03-28 12:36:45,969 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 172.61/109.73 [2019-03-28 12:36:45,969 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 172.61/109.73 [2019-03-28 12:36:45,970 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 172.61/109.73 [2019-03-28 12:36:45,970 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 172.61/109.73 [2019-03-28 12:36:45,970 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 172.61/109.73 [2019-03-28 12:36:45,971 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 172.61/109.73 [2019-03-28 12:36:45,971 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 172.61/109.73 Termination analysis: LINEAR_WITH_GUESSES 172.61/109.73 Number of strict supporting invariants: 0 172.61/109.73 Number of non-strict supporting invariants: 1 172.61/109.73 Consider only non-deceasing supporting invariants: true 172.61/109.73 Simplify termination arguments: true 172.61/109.73 Simplify supporting invariants: trueOverapproximate stem: false 172.61/109.73 [2019-03-28 12:36:45,972 INFO L339 nArgumentSynthesizer]: Template has degree 0. 172.61/109.73 [2019-03-28 12:36:45,972 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 172.61/109.73 [2019-03-28 12:36:45,972 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 172.61/109.73 [2019-03-28 12:36:45,972 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 172.61/109.73 [2019-03-28 12:36:45,973 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 172.61/109.73 [2019-03-28 12:36:45,973 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 172.61/109.73 [2019-03-28 12:36:45,976 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 172.61/109.73 [2019-03-28 12:36:45,977 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 172.61/109.73 Termination analysis: LINEAR_WITH_GUESSES 172.61/109.73 Number of strict supporting invariants: 0 172.61/109.73 Number of non-strict supporting invariants: 1 172.61/109.73 Consider only non-deceasing supporting invariants: true 172.61/109.73 Simplify termination arguments: true 172.61/109.73 Simplify supporting invariants: trueOverapproximate stem: false 172.61/109.73 [2019-03-28 12:36:45,977 INFO L339 nArgumentSynthesizer]: Template has degree 0. 172.61/109.73 [2019-03-28 12:36:45,977 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 172.61/109.73 [2019-03-28 12:36:45,977 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 172.61/109.73 [2019-03-28 12:36:45,977 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 172.61/109.73 [2019-03-28 12:36:45,978 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 172.61/109.73 [2019-03-28 12:36:45,978 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 172.61/109.73 [2019-03-28 12:36:45,979 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 172.61/109.73 [2019-03-28 12:36:45,979 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 172.61/109.73 Termination analysis: LINEAR_WITH_GUESSES 172.61/109.73 Number of strict supporting invariants: 0 172.61/109.73 Number of non-strict supporting invariants: 1 172.61/109.73 Consider only non-deceasing supporting invariants: true 172.61/109.73 Simplify termination arguments: true 172.61/109.73 Simplify supporting invariants: trueOverapproximate stem: false 172.61/109.73 [2019-03-28 12:36:45,980 INFO L339 nArgumentSynthesizer]: Template has degree 0. 172.61/109.73 [2019-03-28 12:36:45,980 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 172.61/109.73 [2019-03-28 12:36:45,980 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 172.61/109.73 [2019-03-28 12:36:45,980 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 172.61/109.73 [2019-03-28 12:36:45,981 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 172.61/109.73 [2019-03-28 12:36:45,981 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 172.61/109.73 [2019-03-28 12:36:45,982 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 172.61/109.73 [2019-03-28 12:36:45,982 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 172.61/109.73 Termination analysis: LINEAR_WITH_GUESSES 172.61/109.73 Number of strict supporting invariants: 0 172.61/109.73 Number of non-strict supporting invariants: 1 172.61/109.73 Consider only non-deceasing supporting invariants: true 172.61/109.73 Simplify termination arguments: true 172.61/109.73 Simplify supporting invariants: trueOverapproximate stem: false 172.61/109.73 [2019-03-28 12:36:45,982 INFO L339 nArgumentSynthesizer]: Template has degree 0. 172.61/109.73 [2019-03-28 12:36:45,983 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 172.61/109.73 [2019-03-28 12:36:45,983 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 172.61/109.73 [2019-03-28 12:36:45,983 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 172.61/109.73 [2019-03-28 12:36:45,983 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 172.61/109.73 [2019-03-28 12:36:45,984 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 172.61/109.73 [2019-03-28 12:36:45,984 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 172.61/109.73 [2019-03-28 12:36:45,985 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 172.61/109.73 Termination analysis: LINEAR_WITH_GUESSES 172.61/109.73 Number of strict supporting invariants: 0 172.61/109.73 Number of non-strict supporting invariants: 1 172.61/109.73 Consider only non-deceasing supporting invariants: true 172.61/109.73 Simplify termination arguments: true 172.61/109.73 Simplify supporting invariants: trueOverapproximate stem: false 172.61/109.73 [2019-03-28 12:36:45,985 INFO L339 nArgumentSynthesizer]: Template has degree 0. 172.61/109.73 [2019-03-28 12:36:45,985 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 172.61/109.73 [2019-03-28 12:36:45,985 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 172.61/109.73 [2019-03-28 12:36:45,985 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 172.61/109.73 [2019-03-28 12:36:45,987 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 172.61/109.73 [2019-03-28 12:36:45,987 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 172.61/109.73 [2019-03-28 12:36:45,996 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 172.61/109.73 [2019-03-28 12:36:45,996 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 172.61/109.73 Termination analysis: LINEAR_WITH_GUESSES 172.61/109.73 Number of strict supporting invariants: 0 172.61/109.73 Number of non-strict supporting invariants: 1 172.61/109.73 Consider only non-deceasing supporting invariants: true 172.61/109.73 Simplify termination arguments: true 172.61/109.73 Simplify supporting invariants: trueOverapproximate stem: false 172.61/109.73 [2019-03-28 12:36:45,997 INFO L339 nArgumentSynthesizer]: Template has degree 0. 172.61/109.73 [2019-03-28 12:36:45,997 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 172.61/109.73 [2019-03-28 12:36:45,997 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 172.61/109.73 [2019-03-28 12:36:45,997 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 172.61/109.73 [2019-03-28 12:36:45,998 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 172.61/109.73 [2019-03-28 12:36:45,998 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 172.61/109.73 [2019-03-28 12:36:46,001 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 172.61/109.73 [2019-03-28 12:36:46,001 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 172.61/109.73 Termination analysis: LINEAR_WITH_GUESSES 172.61/109.73 Number of strict supporting invariants: 0 172.61/109.73 Number of non-strict supporting invariants: 1 172.61/109.73 Consider only non-deceasing supporting invariants: true 172.61/109.73 Simplify termination arguments: true 172.61/109.73 Simplify supporting invariants: trueOverapproximate stem: false 172.61/109.73 [2019-03-28 12:36:46,002 INFO L339 nArgumentSynthesizer]: Template has degree 0. 172.61/109.73 [2019-03-28 12:36:46,002 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 172.61/109.73 [2019-03-28 12:36:46,002 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 172.61/109.73 [2019-03-28 12:36:46,002 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 172.61/109.73 [2019-03-28 12:36:46,003 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 172.61/109.73 [2019-03-28 12:36:46,003 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 172.61/109.73 [2019-03-28 12:36:46,006 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 172.61/109.73 [2019-03-28 12:36:46,006 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 172.61/109.73 Termination analysis: LINEAR_WITH_GUESSES 172.61/109.73 Number of strict supporting invariants: 0 172.61/109.73 Number of non-strict supporting invariants: 1 172.61/109.73 Consider only non-deceasing supporting invariants: true 172.61/109.73 Simplify termination arguments: true 172.61/109.73 Simplify supporting invariants: trueOverapproximate stem: false 172.61/109.73 [2019-03-28 12:36:46,007 INFO L339 nArgumentSynthesizer]: Template has degree 0. 172.61/109.73 [2019-03-28 12:36:46,007 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 172.61/109.73 [2019-03-28 12:36:46,007 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 172.61/109.73 [2019-03-28 12:36:46,007 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 172.61/109.73 [2019-03-28 12:36:46,010 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 172.61/109.73 [2019-03-28 12:36:46,010 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 172.61/109.73 [2019-03-28 12:36:46,036 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 172.61/109.73 [2019-03-28 12:36:46,060 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. 172.61/109.73 [2019-03-28 12:36:46,061 INFO L444 ModelExtractionUtils]: 54 out of 61 variables were initially zero. Simplification set additionally 4 variables to zero. 172.61/109.73 [2019-03-28 12:36:46,061 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 172.61/109.73 [2019-03-28 12:36:46,062 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. 172.61/109.73 [2019-03-28 12:36:46,062 INFO L518 LassoAnalysis]: Proved termination. 172.61/109.73 [2019-03-28 12:36:46,062 INFO L520 LassoAnalysis]: Termination argument consisting of: 172.61/109.73 Ranking function f(v_rep(select #length ULTIMATE.start_main_~nondetString1~0.base)_1, ULTIMATE.start_substring_~ps2~0.offset) = 1*v_rep(select #length ULTIMATE.start_main_~nondetString1~0.base)_1 - 1*ULTIMATE.start_substring_~ps2~0.offset 172.61/109.73 Supporting invariants [] 172.61/109.73 [2019-03-28 12:36:46,250 INFO L297 tatePredicateManager]: 43 out of 45 supporting invariants were superfluous and have been removed 172.61/109.73 [2019-03-28 12:36:46,256 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.61/109.73 [2019-03-28 12:36:46,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 172.61/109.73 [2019-03-28 12:36:46,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 172.61/109.73 [2019-03-28 12:36:46,311 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 14 conjunts are in the unsatisfiable core 172.61/109.73 [2019-03-28 12:36:46,312 INFO L279 TraceCheckSpWp]: Computing forward predicates... 172.61/109.73 [2019-03-28 12:36:46,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 172.61/109.73 [2019-03-28 12:36:46,338 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 10 conjunts are in the unsatisfiable core 172.61/109.73 [2019-03-28 12:36:46,338 INFO L279 TraceCheckSpWp]: Computing forward predicates... 172.61/109.73 [2019-03-28 12:36:46,357 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 172.61/109.73 [2019-03-28 12:36:46,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 172.61/109.73 [2019-03-28 12:36:46,414 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 10 conjunts are in the unsatisfiable core 172.61/109.73 [2019-03-28 12:36:46,415 INFO L279 TraceCheckSpWp]: Computing forward predicates... 172.61/109.73 [2019-03-28 12:36:46,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 172.61/109.73 [2019-03-28 12:36:46,480 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 10 conjunts are in the unsatisfiable core 172.61/109.73 [2019-03-28 12:36:46,480 INFO L279 TraceCheckSpWp]: Computing forward predicates... 172.61/109.73 [2019-03-28 12:36:46,501 INFO L98 LoopCannibalizer]: 4 predicates before loop cannibalization 6 predicates after loop cannibalization 172.61/109.73 [2019-03-28 12:36:46,502 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 6 loop predicates 172.61/109.73 [2019-03-28 12:36:46,502 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 54 states and 72 transitions. cyclomatic complexity: 20 Second operand 5 states. 172.61/109.73 [2019-03-28 12:36:46,741 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 54 states and 72 transitions. cyclomatic complexity: 20. Second operand 5 states. Result 337 states and 432 transitions. Complement of second has 21 states. 172.61/109.73 [2019-03-28 12:36:46,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states 172.61/109.73 [2019-03-28 12:36:46,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. 172.61/109.73 [2019-03-28 12:36:46,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 63 transitions. 172.61/109.73 [2019-03-28 12:36:46,743 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 63 transitions. Stem has 19 letters. Loop has 7 letters. 172.61/109.73 [2019-03-28 12:36:46,743 INFO L116 BuchiAccepts]: Finished buchiAccepts. 172.61/109.73 [2019-03-28 12:36:46,743 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 63 transitions. Stem has 26 letters. Loop has 7 letters. 172.61/109.73 [2019-03-28 12:36:46,743 INFO L116 BuchiAccepts]: Finished buchiAccepts. 172.61/109.73 [2019-03-28 12:36:46,743 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 63 transitions. Stem has 19 letters. Loop has 14 letters. 172.61/109.73 [2019-03-28 12:36:46,744 INFO L116 BuchiAccepts]: Finished buchiAccepts. 172.61/109.73 [2019-03-28 12:36:46,747 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 337 states and 432 transitions. 172.61/109.73 [2019-03-28 12:36:46,749 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 172.61/109.73 [2019-03-28 12:36:46,749 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 337 states to 0 states and 0 transitions. 172.61/109.73 [2019-03-28 12:36:46,749 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 172.61/109.73 [2019-03-28 12:36:46,749 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 172.61/109.73 [2019-03-28 12:36:46,749 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. 172.61/109.73 [2019-03-28 12:36:46,750 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 172.61/109.73 [2019-03-28 12:36:46,750 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 172.61/109.73 [2019-03-28 12:36:46,750 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 172.61/109.73 [2019-03-28 12:36:46,750 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 172.61/109.73 [2019-03-28 12:36:46,750 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ 172.61/109.73 [2019-03-28 12:36:46,750 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. 172.61/109.73 [2019-03-28 12:36:46,750 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 172.61/109.73 [2019-03-28 12:36:46,750 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true 172.61/109.73 [2019-03-28 12:36:46,757 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:36:46 BasicIcfg 172.61/109.73 [2019-03-28 12:36:46,757 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- 172.61/109.73 [2019-03-28 12:36:46,758 INFO L168 Benchmark]: Toolchain (without parser) took 105165.19 ms. Allocated memory was 649.6 MB in the beginning and 1.1 GB in the end (delta: 415.8 MB). Free memory was 558.5 MB in the beginning and 984.0 MB in the end (delta: -425.5 MB). There was no memory consumed. Max. memory is 50.3 GB. 172.61/109.73 [2019-03-28 12:36:46,758 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 649.6 MB. Free memory is still 580.1 MB. There was no memory consumed. Max. memory is 50.3 GB. 172.61/109.73 [2019-03-28 12:36:46,759 INFO L168 Benchmark]: CACSL2BoogieTranslator took 329.22 ms. Allocated memory was 649.6 MB in the beginning and 675.8 MB in the end (delta: 26.2 MB). Free memory was 558.5 MB in the beginning and 640.9 MB in the end (delta: -82.4 MB). Peak memory consumption was 29.9 MB. Max. memory is 50.3 GB. 172.61/109.73 [2019-03-28 12:36:46,759 INFO L168 Benchmark]: Boogie Procedure Inliner took 46.28 ms. Allocated memory is still 675.8 MB. Free memory was 640.9 MB in the beginning and 637.8 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 50.3 GB. 172.61/109.73 [2019-03-28 12:36:46,759 INFO L168 Benchmark]: Boogie Preprocessor took 29.10 ms. Allocated memory is still 675.8 MB. Free memory was 637.8 MB in the beginning and 635.1 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 50.3 GB. 172.61/109.73 [2019-03-28 12:36:46,760 INFO L168 Benchmark]: RCFGBuilder took 357.85 ms. Allocated memory is still 675.8 MB. Free memory was 635.1 MB in the beginning and 611.1 MB in the end (delta: 24.0 MB). Peak memory consumption was 24.0 MB. Max. memory is 50.3 GB. 172.61/109.73 [2019-03-28 12:36:46,760 INFO L168 Benchmark]: BlockEncodingV2 took 124.31 ms. Allocated memory is still 675.8 MB. Free memory was 611.1 MB in the beginning and 601.7 MB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 50.3 GB. 172.61/109.73 [2019-03-28 12:36:46,760 INFO L168 Benchmark]: TraceAbstraction took 92418.29 ms. Allocated memory was 675.8 MB in the beginning and 1.1 GB in the end (delta: 384.8 MB). Free memory was 601.7 MB in the beginning and 357.3 MB in the end (delta: 244.4 MB). Peak memory consumption was 678.9 MB. Max. memory is 50.3 GB. 172.61/109.73 [2019-03-28 12:36:46,761 INFO L168 Benchmark]: BuchiAutomizer took 11854.64 ms. Allocated memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 4.7 MB). Free memory was 357.3 MB in the beginning and 984.0 MB in the end (delta: -626.8 MB). There was no memory consumed. Max. memory is 50.3 GB. 172.61/109.73 [2019-03-28 12:36:46,763 INFO L337 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### 172.61/109.73 --- Results --- 172.61/109.73 * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: 172.61/109.73 - StatisticsResult: Initial Icfg 172.61/109.73 38 locations, 45 edges 172.61/109.73 - StatisticsResult: Encoded RCFG 172.61/109.73 31 locations, 58 edges 172.61/109.73 * Results from de.uni_freiburg.informatik.ultimate.core: 172.61/109.73 - StatisticsResult: Toolchain Benchmarks 172.61/109.73 Benchmark results are: 172.61/109.73 * CDTParser took 0.16 ms. Allocated memory is still 649.6 MB. Free memory is still 580.1 MB. There was no memory consumed. Max. memory is 50.3 GB. 172.61/109.73 * CACSL2BoogieTranslator took 329.22 ms. Allocated memory was 649.6 MB in the beginning and 675.8 MB in the end (delta: 26.2 MB). Free memory was 558.5 MB in the beginning and 640.9 MB in the end (delta: -82.4 MB). Peak memory consumption was 29.9 MB. Max. memory is 50.3 GB. 172.61/109.73 * Boogie Procedure Inliner took 46.28 ms. Allocated memory is still 675.8 MB. Free memory was 640.9 MB in the beginning and 637.8 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 50.3 GB. 172.61/109.73 * Boogie Preprocessor took 29.10 ms. Allocated memory is still 675.8 MB. Free memory was 637.8 MB in the beginning and 635.1 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 50.3 GB. 172.61/109.73 * RCFGBuilder took 357.85 ms. Allocated memory is still 675.8 MB. Free memory was 635.1 MB in the beginning and 611.1 MB in the end (delta: 24.0 MB). Peak memory consumption was 24.0 MB. Max. memory is 50.3 GB. 172.61/109.73 * BlockEncodingV2 took 124.31 ms. Allocated memory is still 675.8 MB. Free memory was 611.1 MB in the beginning and 601.7 MB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 50.3 GB. 172.61/109.73 * TraceAbstraction took 92418.29 ms. Allocated memory was 675.8 MB in the beginning and 1.1 GB in the end (delta: 384.8 MB). Free memory was 601.7 MB in the beginning and 357.3 MB in the end (delta: 244.4 MB). Peak memory consumption was 678.9 MB. Max. memory is 50.3 GB. 172.61/109.73 * BuchiAutomizer took 11854.64 ms. Allocated memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 4.7 MB). Free memory was 357.3 MB in the beginning and 984.0 MB in the end (delta: -626.8 MB). There was no memory consumed. Max. memory is 50.3 GB. 172.61/109.73 * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_#t~malloc12.base,QUANTIFIED] 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_#t~malloc12.base,QUANTIFIED] 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_#t~malloc12.base,QUANTIFIED] 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_#t~malloc12.base,QUANTIFIED] 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_#t~malloc12.base,QUANTIFIED] 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_#t~malloc12.base,QUANTIFIED] 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] 172.61/109.73 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #memory_int 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #memory_int 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #length 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #memory_int 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #length 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #memory_int 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #length 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #memory_int 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #length 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #length 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #length 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #length 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #length 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #length 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #length 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #length 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #memory_int 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #memory_int 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #length 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #memory_int 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #length 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #length 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #length 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #length 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #length 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #memory_int 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #memory_int 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #memory_int 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #length 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #memory_int 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #length 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #length 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #memory_int 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #length 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #length 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #length 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #memory_int 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #memory_int 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #length 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #memory_int 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #length 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #length 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #length 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #memory_int 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #length 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #length 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #memory_int 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #memory_int 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #memory_int 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #length 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #memory_int 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #length 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #memory_int 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #length 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #memory_int 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #length 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #length 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #length 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #length 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #length 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #length 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #length 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #length 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #memory_int 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #memory_int 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #length 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #memory_int 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #length 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #length 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #length 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #length 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #length 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #memory_int 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #memory_int 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #memory_int 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #length 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #memory_int 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #length 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #length 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #memory_int 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #length 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #length 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #length 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #memory_int 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #memory_int 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #length 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #memory_int 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #length 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #length 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #length 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #memory_int 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #length 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #length 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #memory_int 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #memory_int 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #memory_int 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #memory_int 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #length 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #length 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #length 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #length 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #memory_int 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #length 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #memory_int 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #length 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #memory_int 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #memory_int 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #length 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #memory_int 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #length 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #length 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #memory_int 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #memory_int 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #length 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #length 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #memory_int 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #length 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #length 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #length 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #memory_int 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #memory_int 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #memory_int 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #memory_int 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #length 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #memory_int 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #memory_int 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #memory_int 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #length 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #length 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #length 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #memory_int 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #length 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #length 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #memory_int 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #memory_int 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #length 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #length 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #memory_int 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #memory_int 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #length 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #memory_int 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #length 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #memory_int 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #length 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #memory_int 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #memory_int 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #length 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #memory_int 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #length 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #memory_int 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #memory_int 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #length 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #length 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #length 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #memory_int 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #memory_int 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #length 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #memory_int 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #length 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #memory_int 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #memory_int 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #length 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #memory_int 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #memory_int 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #length 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #memory_int 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #length 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #length 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #memory_int 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #length 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #length 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #memory_int 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #memory_int 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #length 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #length 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #length 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #memory_int 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #length 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #memory_int 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #memory_int 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #length 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #memory_int 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #memory_int 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #length 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #memory_int 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #length 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #memory_int 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #length 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #memory_int 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #memory_int 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #length 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #length 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #memory_int 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #length 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #memory_int 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #length 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #length 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #length 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #memory_int 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #length 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #length 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #memory_int 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #length 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #length 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #length 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #memory_int 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #length 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #length 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #memory_int 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #length 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #memory_int 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #length 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #length 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #memory_int 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #length 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #length 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #memory_int 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #length 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #length 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #memory_int 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #memory_int 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #length 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #length 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #memory_int 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #memory_int 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #length 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #memory_int 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #length 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #length 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #memory_int 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #length 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #memory_int 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #length 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #length 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #length 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #length 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #length 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #memory_int 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #memory_int 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #length 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #memory_int 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #memory_int 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #memory_int 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #memory_int 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #length 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #length 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #length 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #length 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #memory_int 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #length 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #memory_int 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #length 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #memory_int 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #memory_int 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #length 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #memory_int 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #length 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #length 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #memory_int 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #memory_int 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #length 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #length 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #memory_int 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #length 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #length 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #length 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #memory_int 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #memory_int 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #memory_int 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #memory_int 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #length 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #memory_int 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #memory_int 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #memory_int 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #length 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #length 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #length 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #memory_int 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #length 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #length 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #memory_int 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #memory_int 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #length 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #length 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #memory_int 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #memory_int 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #length 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #memory_int 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #length 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #memory_int 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #length 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #memory_int 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #memory_int 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #length 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #memory_int 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #length 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #memory_int 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #memory_int 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #length 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #length 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #length 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #memory_int 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #memory_int 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #length 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #memory_int 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #length 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #memory_int 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #memory_int 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #length 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #memory_int 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #memory_int 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #length 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #memory_int 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #length 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #length 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #memory_int 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #length 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #length 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #memory_int 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #memory_int 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #length 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #length 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #length 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #memory_int 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #length 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #memory_int 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #memory_int 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #length 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #memory_int 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #memory_int 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #length 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #memory_int 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #length 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #memory_int 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #length 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #memory_int 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #memory_int 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #length 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #length 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #memory_int 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #length 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #memory_int 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #length 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #length 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #length 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #memory_int 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #length 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #length 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #memory_int 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #length 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #length 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #length 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #memory_int 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #length 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #length 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #memory_int 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #length 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #memory_int 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #length 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #length 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #memory_int 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #length 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #length 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #memory_int 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #length 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #length 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #memory_int 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #memory_int 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #length 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #length 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #memory_int 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #memory_int 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #length 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #memory_int 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #length 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #length 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #memory_int 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #length 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #memory_int 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #length 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #length 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #length 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #length 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #length 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #memory_int 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #memory_int 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #length 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #memory_int 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #length 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #length 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #length 172.61/109.73 - GenericResult: Unfinished Backtranslation 172.61/109.73 unknown boogie variable #length 172.61/109.73 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: 172.61/109.73 - PositiveResult [Line: 8]: pointer dereference always succeeds 172.61/109.73 For all program executions holds that pointer dereference always succeeds at this location 172.61/109.73 - PositiveResult [Line: 33]: pointer dereference always succeeds 172.61/109.73 For all program executions holds that pointer dereference always succeeds at this location 172.61/109.73 - PositiveResult [Line: 8]: pointer dereference always succeeds 172.61/109.73 For all program executions holds that pointer dereference always succeeds at this location 172.61/109.73 - PositiveResult [Line: 33]: pointer dereference always succeeds 172.61/109.73 For all program executions holds that pointer dereference always succeeds at this location 172.61/109.73 - PositiveResult [Line: 15]: pointer dereference always succeeds 172.61/109.73 For all program executions holds that pointer dereference always succeeds at this location 172.61/109.73 - PositiveResult [Line: 11]: pointer dereference always succeeds 172.61/109.73 For all program executions holds that pointer dereference always succeeds at this location 172.61/109.73 - PositiveResult [Line: 15]: pointer dereference always succeeds 172.61/109.73 For all program executions holds that pointer dereference always succeeds at this location 172.61/109.73 - PositiveResult [Line: 32]: pointer dereference always succeeds 172.61/109.73 For all program executions holds that pointer dereference always succeeds at this location 172.61/109.73 - PositiveResult [Line: 11]: pointer dereference always succeeds 172.61/109.73 For all program executions holds that pointer dereference always succeeds at this location 172.61/109.73 - PositiveResult [Line: 32]: pointer dereference always succeeds 172.61/109.73 For all program executions holds that pointer dereference always succeeds at this location 172.61/109.73 - PositiveResult [Line: 11]: pointer dereference always succeeds 172.61/109.73 For all program executions holds that pointer dereference always succeeds at this location 172.61/109.73 - PositiveResult [Line: 11]: pointer dereference always succeeds 172.61/109.73 For all program executions holds that pointer dereference always succeeds at this location 172.61/109.73 - PositiveResult [Line: 11]: pointer dereference always succeeds 172.61/109.73 For all program executions holds that pointer dereference always succeeds at this location 172.61/109.73 - PositiveResult [Line: 11]: pointer dereference always succeeds 172.61/109.73 For all program executions holds that pointer dereference always succeeds at this location 172.61/109.73 - AllSpecificationsHoldResult: All specifications hold 172.61/109.73 14 specifications checked. All of them hold 172.61/109.73 - InvariantResult [Line: 8]: Loop Invariant 172.61/109.73 [2019-03-28 12:36:46,781 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 172.61/109.73 [2019-03-28 12:36:46,782 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 172.61/109.73 [2019-03-28 12:36:46,782 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 172.61/109.73 [2019-03-28 12:36:46,782 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 172.61/109.73 [2019-03-28 12:36:46,782 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 172.61/109.73 [2019-03-28 12:36:46,783 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 172.61/109.73 [2019-03-28 12:36:46,783 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 172.61/109.73 [2019-03-28 12:36:46,783 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 172.61/109.73 [2019-03-28 12:36:46,784 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 172.61/109.73 [2019-03-28 12:36:46,784 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 172.61/109.73 [2019-03-28 12:36:46,784 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 172.61/109.73 [2019-03-28 12:36:46,784 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 172.61/109.73 [2019-03-28 12:36:46,785 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.61/109.73 [2019-03-28 12:36:46,785 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.61/109.73 [2019-03-28 12:36:46,786 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.61/109.73 [2019-03-28 12:36:46,786 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.61/109.73 [2019-03-28 12:36:46,786 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.61/109.73 [2019-03-28 12:36:46,786 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.61/109.73 [2019-03-28 12:36:46,786 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.61/109.73 [2019-03-28 12:36:46,787 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.61/109.73 [2019-03-28 12:36:46,787 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.61/109.73 [2019-03-28 12:36:46,787 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.61/109.73 [2019-03-28 12:36:46,788 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.61/109.73 [2019-03-28 12:36:46,788 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.61/109.73 [2019-03-28 12:36:46,788 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.61/109.73 [2019-03-28 12:36:46,788 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.61/109.73 [2019-03-28 12:36:46,789 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.61/109.73 [2019-03-28 12:36:46,789 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.61/109.73 [2019-03-28 12:36:46,789 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.61/109.73 [2019-03-28 12:36:46,789 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.61/109.73 [2019-03-28 12:36:46,790 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.61/109.73 [2019-03-28 12:36:46,790 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.61/109.73 [2019-03-28 12:36:46,790 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.61/109.73 [2019-03-28 12:36:46,790 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.61/109.73 [2019-03-28 12:36:46,790 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.61/109.73 [2019-03-28 12:36:46,791 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.61/109.73 [2019-03-28 12:36:46,791 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.61/109.73 [2019-03-28 12:36:46,791 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.61/109.73 [2019-03-28 12:36:46,791 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.61/109.73 [2019-03-28 12:36:46,792 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.61/109.73 [2019-03-28 12:36:46,792 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.61/109.73 [2019-03-28 12:36:46,792 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.61/109.73 [2019-03-28 12:36:46,792 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.61/109.73 [2019-03-28 12:36:46,792 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.61/109.73 [2019-03-28 12:36:46,793 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.61/109.73 [2019-03-28 12:36:46,793 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.61/109.73 [2019-03-28 12:36:46,793 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.61/109.73 [2019-03-28 12:36:46,794 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.61/109.73 [2019-03-28 12:36:46,794 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.61/109.73 [2019-03-28 12:36:46,794 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.61/109.73 [2019-03-28 12:36:46,794 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.61/109.73 [2019-03-28 12:36:46,794 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.61/109.73 [2019-03-28 12:36:46,795 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.61/109.73 [2019-03-28 12:36:46,795 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.61/109.73 [2019-03-28 12:36:46,795 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.61/109.73 [2019-03-28 12:36:46,795 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.61/109.73 [2019-03-28 12:36:46,795 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.61/109.73 [2019-03-28 12:36:46,796 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.61/109.73 [2019-03-28 12:36:46,796 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.61/109.73 [2019-03-28 12:36:46,797 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 172.61/109.73 [2019-03-28 12:36:46,798 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 172.61/109.73 [2019-03-28 12:36:46,798 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 172.61/109.73 [2019-03-28 12:36:46,798 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 172.61/109.73 [2019-03-28 12:36:46,798 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 172.61/109.73 [2019-03-28 12:36:46,799 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 172.61/109.73 [2019-03-28 12:36:46,799 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 172.61/109.73 [2019-03-28 12:36:46,799 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 172.61/109.73 [2019-03-28 12:36:46,800 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 172.61/109.73 [2019-03-28 12:36:46,800 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 172.61/109.73 [2019-03-28 12:36:46,800 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 172.61/109.73 [2019-03-28 12:36:46,800 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 172.61/109.73 [2019-03-28 12:36:46,801 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.61/109.73 [2019-03-28 12:36:46,801 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.61/109.73 [2019-03-28 12:36:46,801 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.61/109.73 [2019-03-28 12:36:46,802 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.61/109.73 [2019-03-28 12:36:46,802 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.61/109.73 [2019-03-28 12:36:46,802 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.61/109.73 [2019-03-28 12:36:46,802 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.61/109.73 [2019-03-28 12:36:46,803 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.61/109.73 [2019-03-28 12:36:46,803 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.61/109.73 [2019-03-28 12:36:46,803 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.61/109.73 [2019-03-28 12:36:46,803 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.61/109.73 [2019-03-28 12:36:46,804 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.61/109.73 [2019-03-28 12:36:46,804 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.61/109.73 [2019-03-28 12:36:46,804 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.61/109.73 [2019-03-28 12:36:46,805 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.61/109.73 [2019-03-28 12:36:46,805 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.61/109.73 [2019-03-28 12:36:46,805 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.61/109.73 [2019-03-28 12:36:46,805 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.61/109.73 [2019-03-28 12:36:46,805 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.61/109.73 [2019-03-28 12:36:46,806 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.61/109.73 [2019-03-28 12:36:46,806 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.61/109.73 [2019-03-28 12:36:46,806 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.61/109.73 [2019-03-28 12:36:46,806 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.61/109.73 [2019-03-28 12:36:46,806 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.61/109.73 [2019-03-28 12:36:46,807 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.61/109.73 [2019-03-28 12:36:46,807 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.61/109.73 [2019-03-28 12:36:46,807 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.61/109.73 [2019-03-28 12:36:46,807 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.61/109.73 [2019-03-28 12:36:46,808 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.61/109.73 [2019-03-28 12:36:46,808 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.61/109.73 [2019-03-28 12:36:46,808 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.61/109.73 [2019-03-28 12:36:46,808 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.61/109.73 [2019-03-28 12:36:46,809 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.61/109.73 [2019-03-28 12:36:46,809 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.61/109.73 [2019-03-28 12:36:46,809 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.61/109.73 [2019-03-28 12:36:46,809 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.61/109.73 [2019-03-28 12:36:46,810 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.61/109.73 [2019-03-28 12:36:46,810 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.61/109.73 [2019-03-28 12:36:46,810 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.61/109.73 [2019-03-28 12:36:46,810 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.61/109.73 [2019-03-28 12:36:46,810 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.61/109.73 [2019-03-28 12:36:46,811 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.61/109.73 [2019-03-28 12:36:46,811 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.61/109.73 [2019-03-28 12:36:46,811 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.61/109.73 [2019-03-28 12:36:46,811 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.61/109.73 [2019-03-28 12:36:46,812 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.61/109.73 [2019-03-28 12:36:46,812 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.61/109.73 Derived loop invariant: (((((((((!(unknown-#memory_int-unknown[pt][pt] == unknown-#memory_int-unknown[ps2][ps2]) || ps2 + 2 <= unknown-#length-unknown[ps2]) && 0 == unknown-#memory_int-unknown[ps2][unknown-#length-unknown[ps2] + -1]) && ((((((unknown-#memory_int-unknown[t][unknown-#length-unknown[t] + -1] == 0 && 0 == unknown-#memory_int-unknown[pt][unknown-#length-unknown[pt] + -1]) && (((((((((((((1 <= unknown-#length-unknown[t] && length1 == unknown-#length-unknown[nondetString1]) && 1 == \valid[pt]) && 1 <= length2) && \valid[ps2] == 1) && \valid[t] == 1) && 1 <= length1) && 1 == \valid[nondetString1]) && \valid[ps] == 1) && 1 == \valid[nondetString2]) && nondetString2 == 0) && 1 <= pt) || (((((((((((1 <= unknown-#length-unknown[t] && length1 == unknown-#length-unknown[nondetString1]) && 1 == \valid[pt]) && 1 <= length2) && \valid[ps2] == 1) && \valid[t] == 1) && 1 <= length1) && 1 == \valid[nondetString1]) && \valid[ps] == 1) && 1 == \valid[nondetString2]) && pt == 0) && nondetString2 == 0)) && 1 <= ps) && ps2 + 1 <= unknown-#length-unknown[ps2]) && unknown-#length-unknown[nondetString2] == length2) && t == 0) && pt + 2 <= unknown-#length-unknown[pt]) && nondetString1 == 0) && 0 <= ps2) && 0 == unknown-#memory_int-unknown[nondetString2 := unknown-#memory_int-unknown[nondetString2][length2 + nondetString2 + -1 := 0]][nondetString1][nondetString1 + unknown-#length-unknown[nondetString1] + -1]) && unknown-#memory_int-unknown[ps][unknown-#length-unknown[ps] + -1] == 0) && !(nondetString1 == nondetString2)) && ps + 1 <= unknown-#length-unknown[ps]) || ((((((((((((((((1 <= unknown-#length-unknown[ps] && ps == 0) && 1 <= unknown-#length-unknown[t]) && length1 == unknown-#length-unknown[nondetString1]) && !(nondetString1 == nondetString2)) && unknown-#memory_int-unknown[ps][ps] == 0) && 0 == unknown-#memory_int-unknown[nondetString2 := unknown-#memory_int-unknown[nondetString2][length2 + nondetString2 + -1 := 0]][nondetString1][nondetString1]) && unknown-#length-unknown[nondetString2] == length2) && t == 0) && 1 <= length2) && 1 == length1) && 1 == \valid[ps]) && \valid[t] == 1) && 1 == \valid[nondetString1]) && nondetString1 == 0) && nondetString2 == 0) && 1 == \valid[nondetString2])) || ((((((unknown-#memory_int-unknown[t][unknown-#length-unknown[t] + -1] == 0 && ((((((((((ps == 0 && length1 == unknown-#length-unknown[nondetString1]) && (\exists ULTIMATE.start_main_~length2~0 : int, ULTIMATE.start_main_~nondetString2~0.offset : int :: ((0 == unknown-#memory_int-unknown[t][ULTIMATE.start_main_~length2~0 + ULTIMATE.start_main_~nondetString2~0.offset + -1] && ULTIMATE.start_main_~length2~0 + ULTIMATE.start_main_~nondetString2~0.offset <= unknown-#length-unknown[t]) && 1 <= ULTIMATE.start_main_~length2~0) && t <= ULTIMATE.start_main_~nondetString2~0.offset)) && unknown-#length-unknown[nondetString2] == length2) && t == 0) && ps + 1 <= unknown-#length-unknown[ps]) && 1 <= length2) && 1 == \valid[ps]) && \valid[t] == 1) && 1 <= length1) && 1 == \valid[nondetString1]) && 1 == \valid[nondetString2]) && 0 == unknown-#memory_int-unknown[nondetString2 := unknown-#memory_int-unknown[nondetString2][length2 + nondetString2 + -1 := 0]][nondetString1][nondetString1 + unknown-#length-unknown[nondetString1] + -1]) && unknown-#memory_int-unknown[ps][unknown-#length-unknown[ps] + -1] == 0) && nondetString1 == 0) && !(nondetString1 == nondetString2)) && nondetString2 == 0)) || ((((((((((((((1 == length2 + nondetString2 && 1 <= unknown-#length-unknown[ps]) && ps == 0) && length1 == unknown-#length-unknown[nondetString1]) && (\exists ULTIMATE.start_main_~length2~0 : int, ULTIMATE.start_main_~nondetString2~0.offset : int :: ((0 == unknown-#memory_int-unknown[t][ULTIMATE.start_main_~length2~0 + ULTIMATE.start_main_~nondetString2~0.offset + -1] && ULTIMATE.start_main_~length2~0 + ULTIMATE.start_main_~nondetString2~0.offset <= unknown-#length-unknown[t]) && 1 <= ULTIMATE.start_main_~length2~0) && t <= ULTIMATE.start_main_~nondetString2~0.offset)) && unknown-#length-unknown[nondetString2] == length2) && t == 0) && unknown-#memory_int-unknown[t][t] == 0) && 1 == \valid[ps]) && \valid[t] == 1) && 1 <= length1) && 1 == \valid[nondetString1]) && nondetString1 == 0) && nondetString2 == 0) && 1 == \valid[nondetString2]) 172.61/109.73 - InvariantResult [Line: 11]: Loop Invariant 172.61/109.73 [2019-03-28 12:36:46,813 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 172.61/109.73 [2019-03-28 12:36:46,813 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 172.61/109.73 [2019-03-28 12:36:46,814 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 172.61/109.73 [2019-03-28 12:36:46,814 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 172.61/109.73 [2019-03-28 12:36:46,814 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 172.61/109.73 [2019-03-28 12:36:46,814 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 172.61/109.73 [2019-03-28 12:36:46,815 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 172.61/109.73 [2019-03-28 12:36:46,815 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 172.61/109.73 [2019-03-28 12:36:46,815 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 172.61/109.73 [2019-03-28 12:36:46,816 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 172.61/109.73 [2019-03-28 12:36:46,816 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 172.61/109.73 [2019-03-28 12:36:46,816 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 172.61/109.73 [2019-03-28 12:36:46,817 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 172.61/109.73 [2019-03-28 12:36:46,817 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 172.61/109.73 [2019-03-28 12:36:46,817 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 172.61/109.73 [2019-03-28 12:36:46,818 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 172.61/109.73 [2019-03-28 12:36:46,818 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 172.61/109.73 [2019-03-28 12:36:46,818 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 172.61/109.73 [2019-03-28 12:36:46,818 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 172.61/109.73 [2019-03-28 12:36:46,819 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 172.61/109.73 [2019-03-28 12:36:46,819 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 172.61/109.73 [2019-03-28 12:36:46,819 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 172.61/109.73 [2019-03-28 12:36:46,820 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 172.61/109.73 [2019-03-28 12:36:46,820 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 172.61/109.73 [2019-03-28 12:36:46,820 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 172.61/109.73 [2019-03-28 12:36:46,821 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 172.61/109.73 [2019-03-28 12:36:46,821 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 172.61/109.73 [2019-03-28 12:36:46,821 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 172.61/109.73 [2019-03-28 12:36:46,822 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 172.61/109.73 [2019-03-28 12:36:46,822 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 172.61/109.73 [2019-03-28 12:36:46,822 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 172.61/109.73 [2019-03-28 12:36:46,823 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 172.61/109.73 [2019-03-28 12:36:46,823 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 172.61/109.73 [2019-03-28 12:36:46,823 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 172.61/109.73 [2019-03-28 12:36:46,823 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 172.61/109.73 [2019-03-28 12:36:46,824 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 172.61/109.73 [2019-03-28 12:36:46,824 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 172.61/109.73 [2019-03-28 12:36:46,824 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 172.61/109.73 [2019-03-28 12:36:46,825 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 172.61/109.73 [2019-03-28 12:36:46,825 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 172.61/109.73 [2019-03-28 12:36:46,825 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 172.61/109.73 [2019-03-28 12:36:46,825 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 172.61/109.73 [2019-03-28 12:36:46,826 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 172.61/109.73 [2019-03-28 12:36:46,826 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 172.61/109.73 [2019-03-28 12:36:46,826 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 172.61/109.73 [2019-03-28 12:36:46,827 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 172.61/109.73 [2019-03-28 12:36:46,827 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 172.61/109.73 [2019-03-28 12:36:46,827 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 172.61/109.73 [2019-03-28 12:36:46,828 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 172.61/109.73 [2019-03-28 12:36:46,828 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 172.61/109.73 [2019-03-28 12:36:46,828 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 172.61/109.73 [2019-03-28 12:36:46,829 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 172.61/109.73 [2019-03-28 12:36:46,829 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 172.61/109.73 [2019-03-28 12:36:46,829 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 172.61/109.73 [2019-03-28 12:36:46,830 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] 172.61/109.73 [2019-03-28 12:36:46,830 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] 172.61/109.73 [2019-03-28 12:36:46,830 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] 172.61/109.73 [2019-03-28 12:36:46,830 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 172.61/109.73 [2019-03-28 12:36:46,831 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 172.61/109.73 [2019-03-28 12:36:46,831 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 172.61/109.73 [2019-03-28 12:36:46,831 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 172.61/109.73 [2019-03-28 12:36:46,832 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 172.61/109.73 [2019-03-28 12:36:46,832 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 172.61/109.73 [2019-03-28 12:36:46,832 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 172.61/109.73 [2019-03-28 12:36:46,833 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 172.61/109.73 [2019-03-28 12:36:46,833 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 172.61/109.73 [2019-03-28 12:36:46,833 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 172.61/109.73 [2019-03-28 12:36:46,834 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 172.61/109.73 [2019-03-28 12:36:46,834 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 172.61/109.73 [2019-03-28 12:36:46,834 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_#t~malloc12.base,QUANTIFIED] 172.61/109.73 [2019-03-28 12:36:46,834 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_#t~malloc12.base,QUANTIFIED] 172.61/109.73 [2019-03-28 12:36:46,835 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_#t~malloc12.base,QUANTIFIED] 172.61/109.73 [2019-03-28 12:36:46,835 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] 172.61/109.73 [2019-03-28 12:36:46,835 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] 172.61/109.73 [2019-03-28 12:36:46,835 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] 172.61/109.73 [2019-03-28 12:36:46,835 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] 172.61/109.73 [2019-03-28 12:36:46,836 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] 172.61/109.73 [2019-03-28 12:36:46,836 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] 172.61/109.73 [2019-03-28 12:36:46,838 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.61/109.73 [2019-03-28 12:36:46,838 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.61/109.73 [2019-03-28 12:36:46,838 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.61/109.73 [2019-03-28 12:36:46,838 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.61/109.73 [2019-03-28 12:36:46,839 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.61/109.73 [2019-03-28 12:36:46,839 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.61/109.73 [2019-03-28 12:36:46,839 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.61/109.73 [2019-03-28 12:36:46,840 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.61/109.73 [2019-03-28 12:36:46,840 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.61/109.73 [2019-03-28 12:36:46,840 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.61/109.73 [2019-03-28 12:36:46,840 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.61/109.73 [2019-03-28 12:36:46,841 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.61/109.73 [2019-03-28 12:36:46,841 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.61/109.73 [2019-03-28 12:36:46,841 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.61/109.73 [2019-03-28 12:36:46,841 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.61/109.73 [2019-03-28 12:36:46,842 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.61/109.73 [2019-03-28 12:36:46,842 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.61/109.73 [2019-03-28 12:36:46,842 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.61/109.73 [2019-03-28 12:36:46,842 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.61/109.73 [2019-03-28 12:36:46,843 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.61/109.73 [2019-03-28 12:36:46,843 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.61/109.73 [2019-03-28 12:36:46,843 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.61/109.73 [2019-03-28 12:36:46,844 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.61/109.73 [2019-03-28 12:36:46,844 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.61/109.73 [2019-03-28 12:36:46,844 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.61/109.73 [2019-03-28 12:36:46,844 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.61/109.73 [2019-03-28 12:36:46,845 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.61/109.73 [2019-03-28 12:36:46,845 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.61/109.73 [2019-03-28 12:36:46,845 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.61/109.73 [2019-03-28 12:36:46,845 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.61/109.73 [2019-03-28 12:36:46,846 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.61/109.73 [2019-03-28 12:36:46,846 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.61/109.73 [2019-03-28 12:36:46,846 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.61/109.73 [2019-03-28 12:36:46,846 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.61/109.73 [2019-03-28 12:36:46,847 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.61/109.73 [2019-03-28 12:36:46,847 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.61/109.73 [2019-03-28 12:36:46,847 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.61/109.73 [2019-03-28 12:36:46,848 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.61/109.73 [2019-03-28 12:36:46,848 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.61/109.73 [2019-03-28 12:36:46,848 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.61/109.73 [2019-03-28 12:36:46,849 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.61/109.73 [2019-03-28 12:36:46,849 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.61/109.73 [2019-03-28 12:36:46,849 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.61/109.73 [2019-03-28 12:36:46,850 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.61/109.73 [2019-03-28 12:36:46,850 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.61/109.73 [2019-03-28 12:36:46,850 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.61/109.73 [2019-03-28 12:36:46,850 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.61/109.73 [2019-03-28 12:36:46,851 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.61/109.73 [2019-03-28 12:36:46,851 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.61/109.73 [2019-03-28 12:36:46,851 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.61/109.73 [2019-03-28 12:36:46,852 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.61/109.73 [2019-03-28 12:36:46,852 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.61/109.73 [2019-03-28 12:36:46,852 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.61/109.73 [2019-03-28 12:36:46,852 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.61/109.73 [2019-03-28 12:36:46,852 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.61/109.73 [2019-03-28 12:36:46,853 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.61/109.73 [2019-03-28 12:36:46,853 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.61/109.73 [2019-03-28 12:36:46,853 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.61/109.73 [2019-03-28 12:36:46,853 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.61/109.73 [2019-03-28 12:36:46,854 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.61/109.73 [2019-03-28 12:36:46,854 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.61/109.73 [2019-03-28 12:36:46,854 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.61/109.73 [2019-03-28 12:36:46,854 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.61/109.73 [2019-03-28 12:36:46,855 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.61/109.73 [2019-03-28 12:36:46,855 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.61/109.73 [2019-03-28 12:36:46,855 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.61/109.73 [2019-03-28 12:36:46,856 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.61/109.73 [2019-03-28 12:36:46,856 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.61/109.73 [2019-03-28 12:36:46,856 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.61/109.73 [2019-03-28 12:36:46,856 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.61/109.73 [2019-03-28 12:36:46,856 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.61/109.73 [2019-03-28 12:36:46,857 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.61/109.73 [2019-03-28 12:36:46,857 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.61/109.73 [2019-03-28 12:36:46,857 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.61/109.73 [2019-03-28 12:36:46,857 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.61/109.73 [2019-03-28 12:36:46,857 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.61/109.73 [2019-03-28 12:36:46,858 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.61/109.73 [2019-03-28 12:36:46,858 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.61/109.73 [2019-03-28 12:36:46,858 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.61/109.73 [2019-03-28 12:36:46,859 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.61/109.74 [2019-03-28 12:36:46,859 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.61/109.74 [2019-03-28 12:36:46,859 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.61/109.74 [2019-03-28 12:36:46,859 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.61/109.74 [2019-03-28 12:36:46,860 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.61/109.74 [2019-03-28 12:36:46,860 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.61/109.74 [2019-03-28 12:36:46,860 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.61/109.74 [2019-03-28 12:36:46,860 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.61/109.74 [2019-03-28 12:36:46,861 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.61/109.74 [2019-03-28 12:36:46,861 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.61/109.74 [2019-03-28 12:36:46,861 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.61/109.74 [2019-03-28 12:36:46,861 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.61/109.74 [2019-03-28 12:36:46,861 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.61/109.74 [2019-03-28 12:36:46,862 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.61/109.74 [2019-03-28 12:36:46,862 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.61/109.74 [2019-03-28 12:36:46,862 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.61/109.74 [2019-03-28 12:36:46,862 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.61/109.74 [2019-03-28 12:36:46,862 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.61/109.74 [2019-03-28 12:36:46,863 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.61/109.74 [2019-03-28 12:36:46,863 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.61/109.74 [2019-03-28 12:36:46,863 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.61/109.74 [2019-03-28 12:36:46,863 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.61/109.74 [2019-03-28 12:36:46,863 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.61/109.74 [2019-03-28 12:36:46,864 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.61/109.74 [2019-03-28 12:36:46,864 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.61/109.74 [2019-03-28 12:36:46,864 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.61/109.74 [2019-03-28 12:36:46,864 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.61/109.74 [2019-03-28 12:36:46,864 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.61/109.74 [2019-03-28 12:36:46,865 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.61/109.74 [2019-03-28 12:36:46,865 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.61/109.74 [2019-03-28 12:36:46,865 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.61/109.74 [2019-03-28 12:36:46,866 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.61/109.74 [2019-03-28 12:36:46,866 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.61/109.74 [2019-03-28 12:36:46,866 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.61/109.74 [2019-03-28 12:36:46,867 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.61/109.74 [2019-03-28 12:36:46,867 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.61/109.74 [2019-03-28 12:36:46,867 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.61/109.74 [2019-03-28 12:36:46,867 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.61/109.74 [2019-03-28 12:36:46,868 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.61/109.74 [2019-03-28 12:36:46,868 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.61/109.74 [2019-03-28 12:36:46,868 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.61/109.74 [2019-03-28 12:36:46,868 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.61/109.74 [2019-03-28 12:36:46,869 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.61/109.74 [2019-03-28 12:36:46,869 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.61/109.74 [2019-03-28 12:36:46,869 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.61/109.74 [2019-03-28 12:36:46,870 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.61/109.74 [2019-03-28 12:36:46,870 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.61/109.74 [2019-03-28 12:36:46,870 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.61/109.74 [2019-03-28 12:36:46,871 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.61/109.74 [2019-03-28 12:36:46,871 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.61/109.74 [2019-03-28 12:36:46,871 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.61/109.74 [2019-03-28 12:36:46,872 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.61/109.74 [2019-03-28 12:36:46,872 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.61/109.74 [2019-03-28 12:36:46,872 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.61/109.74 [2019-03-28 12:36:46,873 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.61/109.74 [2019-03-28 12:36:46,873 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.61/109.74 [2019-03-28 12:36:46,873 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.61/109.74 [2019-03-28 12:36:46,873 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.61/109.74 [2019-03-28 12:36:46,874 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.61/109.74 [2019-03-28 12:36:46,874 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.61/109.74 [2019-03-28 12:36:46,874 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.61/109.74 [2019-03-28 12:36:46,874 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.61/109.74 [2019-03-28 12:36:46,874 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.61/109.74 [2019-03-28 12:36:46,875 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.61/109.74 [2019-03-28 12:36:46,875 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.61/109.74 [2019-03-28 12:36:46,875 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.61/109.74 [2019-03-28 12:36:46,875 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.61/109.74 [2019-03-28 12:36:46,875 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.61/109.74 [2019-03-28 12:36:46,878 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 172.61/109.74 [2019-03-28 12:36:46,878 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 172.61/109.74 [2019-03-28 12:36:46,878 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 172.61/109.74 [2019-03-28 12:36:46,878 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 172.61/109.74 [2019-03-28 12:36:46,879 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 172.61/109.74 [2019-03-28 12:36:46,879 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 172.61/109.74 [2019-03-28 12:36:46,879 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 172.61/109.74 [2019-03-28 12:36:46,880 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 172.61/109.74 [2019-03-28 12:36:46,880 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 172.61/109.74 [2019-03-28 12:36:46,880 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 172.61/109.74 [2019-03-28 12:36:46,881 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 172.61/109.74 [2019-03-28 12:36:46,881 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 172.61/109.74 [2019-03-28 12:36:46,881 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 172.61/109.74 [2019-03-28 12:36:46,882 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 172.61/109.74 [2019-03-28 12:36:46,882 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 172.61/109.74 [2019-03-28 12:36:46,882 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 172.61/109.74 [2019-03-28 12:36:46,882 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 172.61/109.74 [2019-03-28 12:36:46,883 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 172.61/109.74 [2019-03-28 12:36:46,883 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 172.61/109.74 [2019-03-28 12:36:46,883 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 172.61/109.74 [2019-03-28 12:36:46,884 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 172.61/109.74 [2019-03-28 12:36:46,884 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 172.61/109.74 [2019-03-28 12:36:46,884 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 172.61/109.74 [2019-03-28 12:36:46,885 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 172.61/109.74 [2019-03-28 12:36:46,885 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 172.61/109.74 [2019-03-28 12:36:46,885 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 172.61/109.74 [2019-03-28 12:36:46,886 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 172.61/109.74 [2019-03-28 12:36:46,886 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 172.61/109.74 [2019-03-28 12:36:46,886 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 172.61/109.74 [2019-03-28 12:36:46,886 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 172.61/109.74 [2019-03-28 12:36:46,887 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 172.61/109.74 [2019-03-28 12:36:46,887 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 172.61/109.74 [2019-03-28 12:36:46,887 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 172.61/109.74 [2019-03-28 12:36:46,888 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 172.61/109.74 [2019-03-28 12:36:46,888 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 172.61/109.74 [2019-03-28 12:36:46,888 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 172.61/109.74 [2019-03-28 12:36:46,889 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 172.61/109.74 [2019-03-28 12:36:46,889 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 172.61/109.74 [2019-03-28 12:36:46,889 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 172.61/109.74 [2019-03-28 12:36:46,889 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 172.61/109.74 [2019-03-28 12:36:46,890 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 172.61/109.74 [2019-03-28 12:36:46,890 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 172.61/109.74 [2019-03-28 12:36:46,890 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 172.61/109.74 [2019-03-28 12:36:46,890 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 172.61/109.74 [2019-03-28 12:36:46,891 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 172.61/109.74 [2019-03-28 12:36:46,891 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 172.61/109.74 [2019-03-28 12:36:46,891 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 172.61/109.74 [2019-03-28 12:36:46,892 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 172.61/109.74 [2019-03-28 12:36:46,892 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 172.61/109.74 [2019-03-28 12:36:46,892 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 172.61/109.74 [2019-03-28 12:36:46,893 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 172.61/109.74 [2019-03-28 12:36:46,893 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 172.61/109.74 [2019-03-28 12:36:46,893 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 172.61/109.74 [2019-03-28 12:36:46,893 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 172.61/109.74 [2019-03-28 12:36:46,894 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] 172.61/109.74 [2019-03-28 12:36:46,894 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] 172.61/109.74 [2019-03-28 12:36:46,894 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] 172.61/109.74 [2019-03-28 12:36:46,895 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 172.61/109.74 [2019-03-28 12:36:46,895 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 172.61/109.74 [2019-03-28 12:36:46,895 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 172.61/109.74 [2019-03-28 12:36:46,896 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 172.61/109.74 [2019-03-28 12:36:46,896 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 172.61/109.74 [2019-03-28 12:36:46,896 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 172.61/109.74 [2019-03-28 12:36:46,897 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 172.61/109.74 [2019-03-28 12:36:46,897 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 172.61/109.74 [2019-03-28 12:36:46,897 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 172.61/109.74 [2019-03-28 12:36:46,897 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 172.61/109.74 [2019-03-28 12:36:46,898 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 172.61/109.74 [2019-03-28 12:36:46,898 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 172.61/109.74 [2019-03-28 12:36:46,898 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_#t~malloc12.base,QUANTIFIED] 172.61/109.74 [2019-03-28 12:36:46,898 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_#t~malloc12.base,QUANTIFIED] 172.61/109.74 [2019-03-28 12:36:46,899 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_#t~malloc12.base,QUANTIFIED] 172.61/109.74 [2019-03-28 12:36:46,899 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] 172.61/109.74 [2019-03-28 12:36:46,899 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] 172.61/109.74 [2019-03-28 12:36:46,899 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] 172.61/109.74 [2019-03-28 12:36:46,899 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] 172.61/109.74 [2019-03-28 12:36:46,900 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] 172.61/109.74 [2019-03-28 12:36:46,900 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] 172.61/109.74 [2019-03-28 12:36:46,902 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.61/109.74 [2019-03-28 12:36:46,902 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.61/109.74 [2019-03-28 12:36:46,902 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.61/109.74 [2019-03-28 12:36:46,902 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.61/109.74 [2019-03-28 12:36:46,903 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.61/109.74 [2019-03-28 12:36:46,903 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.61/109.74 [2019-03-28 12:36:46,903 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.61/109.74 [2019-03-28 12:36:46,904 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.61/109.74 [2019-03-28 12:36:46,904 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.61/109.74 [2019-03-28 12:36:46,904 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.61/109.74 [2019-03-28 12:36:46,904 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.61/109.74 [2019-03-28 12:36:46,905 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.61/109.74 [2019-03-28 12:36:46,905 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.61/109.74 [2019-03-28 12:36:46,905 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.61/109.74 [2019-03-28 12:36:46,905 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.61/109.74 [2019-03-28 12:36:46,906 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.61/109.74 [2019-03-28 12:36:46,906 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.61/109.74 [2019-03-28 12:36:46,906 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.61/109.74 [2019-03-28 12:36:46,906 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.61/109.74 [2019-03-28 12:36:46,907 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.61/109.74 [2019-03-28 12:36:46,907 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.61/109.74 [2019-03-28 12:36:46,907 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.61/109.74 [2019-03-28 12:36:46,908 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.61/109.74 [2019-03-28 12:36:46,908 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.61/109.74 [2019-03-28 12:36:46,908 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.61/109.74 [2019-03-28 12:36:46,908 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.61/109.74 [2019-03-28 12:36:46,909 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.61/109.74 [2019-03-28 12:36:46,909 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.61/109.74 [2019-03-28 12:36:46,909 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.61/109.74 [2019-03-28 12:36:46,909 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.61/109.74 [2019-03-28 12:36:46,910 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.61/109.74 [2019-03-28 12:36:46,910 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.61/109.74 [2019-03-28 12:36:46,910 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.61/109.74 [2019-03-28 12:36:46,910 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.61/109.74 [2019-03-28 12:36:46,911 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.61/109.74 [2019-03-28 12:36:46,911 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.61/109.74 [2019-03-28 12:36:46,911 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.61/109.74 [2019-03-28 12:36:46,912 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.61/109.74 [2019-03-28 12:36:46,912 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.61/109.74 [2019-03-28 12:36:46,912 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.61/109.74 [2019-03-28 12:36:46,913 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.61/109.74 [2019-03-28 12:36:46,913 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.61/109.74 [2019-03-28 12:36:46,913 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.61/109.74 [2019-03-28 12:36:46,914 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.61/109.74 [2019-03-28 12:36:46,914 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.61/109.74 [2019-03-28 12:36:46,914 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.61/109.74 [2019-03-28 12:36:46,915 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.61/109.74 [2019-03-28 12:36:46,915 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.61/109.74 [2019-03-28 12:36:46,915 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.61/109.74 [2019-03-28 12:36:46,915 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.61/109.74 [2019-03-28 12:36:46,916 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.61/109.74 [2019-03-28 12:36:46,916 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.61/109.74 [2019-03-28 12:36:46,916 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.61/109.74 [2019-03-28 12:36:46,916 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.61/109.74 [2019-03-28 12:36:46,917 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.61/109.74 [2019-03-28 12:36:46,917 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.61/109.74 [2019-03-28 12:36:46,917 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.61/109.74 [2019-03-28 12:36:46,917 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.61/109.74 [2019-03-28 12:36:46,917 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.61/109.74 [2019-03-28 12:36:46,918 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.61/109.74 [2019-03-28 12:36:46,918 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.61/109.74 [2019-03-28 12:36:46,918 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.61/109.74 [2019-03-28 12:36:46,919 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.61/109.74 [2019-03-28 12:36:46,919 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.61/109.74 [2019-03-28 12:36:46,919 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.61/109.74 [2019-03-28 12:36:46,919 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.61/109.74 [2019-03-28 12:36:46,920 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.61/109.74 [2019-03-28 12:36:46,920 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.61/109.74 [2019-03-28 12:36:46,920 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.61/109.74 [2019-03-28 12:36:46,920 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.61/109.74 [2019-03-28 12:36:46,921 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.61/109.74 [2019-03-28 12:36:46,921 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.61/109.74 [2019-03-28 12:36:46,921 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.61/109.74 [2019-03-28 12:36:46,921 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.61/109.74 [2019-03-28 12:36:46,921 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.61/109.74 [2019-03-28 12:36:46,922 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.61/109.74 [2019-03-28 12:36:46,922 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.61/109.74 [2019-03-28 12:36:46,922 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.61/109.74 [2019-03-28 12:36:46,922 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.61/109.74 [2019-03-28 12:36:46,923 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.61/109.74 [2019-03-28 12:36:46,923 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.61/109.74 [2019-03-28 12:36:46,923 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.61/109.74 [2019-03-28 12:36:46,923 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.61/109.74 [2019-03-28 12:36:46,924 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.61/109.74 [2019-03-28 12:36:46,924 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.61/109.74 [2019-03-28 12:36:46,924 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.61/109.74 [2019-03-28 12:36:46,924 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.61/109.74 [2019-03-28 12:36:46,925 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.61/109.74 [2019-03-28 12:36:46,925 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.61/109.74 [2019-03-28 12:36:46,925 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.61/109.74 [2019-03-28 12:36:46,925 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.61/109.74 [2019-03-28 12:36:46,925 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.61/109.74 [2019-03-28 12:36:46,926 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.61/109.74 [2019-03-28 12:36:46,926 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.61/109.74 [2019-03-28 12:36:46,926 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.61/109.74 [2019-03-28 12:36:46,926 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.61/109.74 [2019-03-28 12:36:46,926 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.61/109.74 [2019-03-28 12:36:46,927 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.61/109.74 [2019-03-28 12:36:46,927 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.61/109.74 [2019-03-28 12:36:46,927 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.61/109.74 [2019-03-28 12:36:46,927 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.61/109.74 [2019-03-28 12:36:46,927 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.61/109.74 [2019-03-28 12:36:46,928 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.61/109.74 [2019-03-28 12:36:46,928 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.61/109.74 [2019-03-28 12:36:46,928 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.61/109.74 [2019-03-28 12:36:46,928 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.61/109.74 [2019-03-28 12:36:46,928 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.61/109.74 [2019-03-28 12:36:46,929 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.61/109.74 [2019-03-28 12:36:46,929 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.61/109.74 [2019-03-28 12:36:46,929 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.61/109.74 [2019-03-28 12:36:46,930 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.61/109.74 [2019-03-28 12:36:46,930 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.61/109.74 [2019-03-28 12:36:46,930 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.61/109.74 [2019-03-28 12:36:46,931 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.61/109.74 [2019-03-28 12:36:46,931 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.61/109.74 [2019-03-28 12:36:46,931 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.61/109.74 [2019-03-28 12:36:46,931 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.61/109.74 [2019-03-28 12:36:46,932 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.61/109.74 [2019-03-28 12:36:46,932 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.61/109.74 [2019-03-28 12:36:46,932 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.61/109.74 [2019-03-28 12:36:46,932 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.61/109.74 [2019-03-28 12:36:46,933 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.61/109.74 [2019-03-28 12:36:46,933 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.61/109.74 [2019-03-28 12:36:46,933 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.61/109.74 [2019-03-28 12:36:46,934 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.61/109.74 [2019-03-28 12:36:46,934 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.61/109.74 [2019-03-28 12:36:46,934 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.61/109.74 [2019-03-28 12:36:46,935 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.61/109.74 [2019-03-28 12:36:46,935 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.61/109.74 [2019-03-28 12:36:46,935 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.61/109.74 [2019-03-28 12:36:46,936 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.61/109.74 [2019-03-28 12:36:46,936 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.61/109.74 [2019-03-28 12:36:46,936 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.61/109.74 [2019-03-28 12:36:46,936 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.61/109.74 [2019-03-28 12:36:46,937 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.61/109.74 [2019-03-28 12:36:46,937 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.61/109.74 [2019-03-28 12:36:46,937 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.61/109.74 [2019-03-28 12:36:46,937 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.61/109.74 [2019-03-28 12:36:46,938 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.61/109.74 [2019-03-28 12:36:46,938 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.61/109.74 [2019-03-28 12:36:46,938 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.61/109.74 [2019-03-28 12:36:46,938 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.61/109.74 [2019-03-28 12:36:46,939 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.61/109.74 [2019-03-28 12:36:46,939 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.61/109.74 [2019-03-28 12:36:46,939 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.61/109.74 [2019-03-28 12:36:46,939 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 172.61/109.74 [2019-03-28 12:36:46,939 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 172.61/109.74 Derived loop invariant: ((((((((((((((((unknown-#memory_int-unknown[ps2] == unknown-#memory_int-unknown[ps] && 0 == unknown-#memory_int-unknown[pt][unknown-#length-unknown[pt] + -1]) && t == pt) && !(nondetString1 == nondetString2)) && ((((((((((((((unknown-#length-unknown[nondetString2] == length2 && 1 <= length2) && \valid[ps2] == 1) && nondetString1 == 0) && 1 == \valid[nondetString2]) && ps2 == 0) && 1 <= unknown-#length-unknown[ps2]) && pt == 0) && length1 == unknown-#length-unknown[nondetString1]) && ps == 0) && t == 0) && 1 == \valid[pt]) && (\exists ULTIMATE.start_main_~length2~0 : int, ULTIMATE.start_main_~nondetString2~0.offset : int :: ((unknown-#memory_int-unknown[pt][ULTIMATE.start_main_~length2~0 + ULTIMATE.start_main_~nondetString2~0.offset + -1] == 0 && ULTIMATE.start_main_~length2~0 + ULTIMATE.start_main_~nondetString2~0.offset <= unknown-#length-unknown[pt]) && pt <= ULTIMATE.start_main_~nondetString2~0.offset) && 1 <= ULTIMATE.start_main_~length2~0)) && 1 == \valid[ps]) && 1 == \valid[nondetString1]) && 1 <= length1) && 0 == unknown-#memory_int-unknown[ps2][unknown-#length-unknown[ps2] + -1]) && 0 == unknown-#memory_int-unknown[nondetString2 := unknown-#memory_int-unknown[nondetString2][length2 + nondetString2 + -1 := 0]][nondetString1][nondetString1 + unknown-#length-unknown[nondetString1] + -1]) && unknown-#memory_int-unknown[ps][unknown-#length-unknown[ps] + -1] == 0) && ps2 + 2 <= unknown-#length-unknown[ps]) && nondetString2 == 0) && unknown-#memory_int-unknown[ps2][ps2] + 1 <= 0) || ((((((((((((((((((((((1 == length2 + nondetString2 && (\exists ULTIMATE.start_main_~length2~0 : int, ULTIMATE.start_main_~nondetString2~0.offset : int :: ((0 == unknown-#memory_int-unknown[t][ULTIMATE.start_main_~length2~0 + ULTIMATE.start_main_~nondetString2~0.offset + -1] && ULTIMATE.start_main_~length2~0 + ULTIMATE.start_main_~nondetString2~0.offset <= unknown-#length-unknown[t]) && 1 <= ULTIMATE.start_main_~length2~0) && t <= ULTIMATE.start_main_~nondetString2~0.offset)) && unknown-#length-unknown[nondetString2] == length2) && \valid[ps2] == 1) && unknown-#memory_int-unknown[t][t] == 0) && \valid[t] == 1) && nondetString1 == 0) && 1 == \valid[nondetString2]) && ps2 == 0) && 1 <= unknown-#length-unknown[ps2]) && 1 <= unknown-#length-unknown[ps]) && pt == 0) && length1 == unknown-#length-unknown[nondetString1]) && ps == 0) && t == 0) && 1 == \valid[pt]) && !(unknown-#memory_int-unknown[pt][pt] == unknown-#memory_int-unknown[ps2][ps2])) && 0 == unknown-#memory_int-unknown[pt][pt]) && (\exists ULTIMATE.start_main_~length2~0 : int, ULTIMATE.start_main_~nondetString2~0.offset : int :: ((unknown-#memory_int-unknown[pt][ULTIMATE.start_main_~length2~0 + ULTIMATE.start_main_~nondetString2~0.offset + -1] == 0 && ULTIMATE.start_main_~length2~0 + ULTIMATE.start_main_~nondetString2~0.offset <= unknown-#length-unknown[pt]) && pt <= ULTIMATE.start_main_~nondetString2~0.offset) && 1 <= ULTIMATE.start_main_~length2~0)) && 1 == \valid[ps]) && 1 == \valid[nondetString1]) && 1 <= length1) && nondetString2 == 0)) || (((((((((((unknown-#memory_int-unknown[ps2] == unknown-#memory_int-unknown[ps] && 0 == unknown-#memory_int-unknown[pt][unknown-#length-unknown[pt] + -1]) && ps2 + 1 <= unknown-#length-unknown[ps2]) && t == pt) && !(nondetString1 == nondetString2)) && (((((((((((((((((pt == 0 && length1 == unknown-#length-unknown[nondetString1]) && (\exists ULTIMATE.start_main_~length2~0 : int, ULTIMATE.start_main_~nondetString2~0.offset : int :: ((0 == unknown-#memory_int-unknown[t][ULTIMATE.start_main_~length2~0 + ULTIMATE.start_main_~nondetString2~0.offset + -1] && ULTIMATE.start_main_~length2~0 + ULTIMATE.start_main_~nondetString2~0.offset <= unknown-#length-unknown[t]) && 1 <= ULTIMATE.start_main_~length2~0) && t <= ULTIMATE.start_main_~nondetString2~0.offset)) && (2 <= nondetString1 + unknown-#length-unknown[nondetString1] || (!(nondetString1 == nondetString2) && 0 == unknown-#memory_int-unknown[nondetString2 := unknown-#memory_int-unknown[nondetString2][length2 + nondetString2 + -1 := 0]][nondetString1][nondetString1]))) && unknown-#length-unknown[nondetString2] == length2) && t == 0) && ps + 1 <= unknown-#length-unknown[ps]) && 1 == \valid[pt]) && 1 <= length2) && (!(unknown-#memory_int-unknown[pt][pt] == unknown-#memory_int-unknown[ps2][ps2]) || 2 <= unknown-#length-unknown[pt])) && \valid[ps2] == 1) && (\exists ULTIMATE.start_main_~length2~0 : int, ULTIMATE.start_main_~nondetString2~0.offset : int :: ((unknown-#memory_int-unknown[pt][ULTIMATE.start_main_~length2~0 + ULTIMATE.start_main_~nondetString2~0.offset + -1] == 0 && ULTIMATE.start_main_~length2~0 + ULTIMATE.start_main_~nondetString2~0.offset <= unknown-#length-unknown[pt]) && pt <= ULTIMATE.start_main_~nondetString2~0.offset) && 1 <= ULTIMATE.start_main_~length2~0)) && \valid[t] == 1) && 1 == \valid[nondetString1]) && 1 <= length1) && nondetString1 == 0) && \valid[ps] == 1) && 1 <= ps) && 1 == \valid[nondetString2]) && 0 == unknown-#memory_int-unknown[ps2][unknown-#length-unknown[ps2] + -1]) && 0 == unknown-#memory_int-unknown[nondetString2 := unknown-#memory_int-unknown[nondetString2][length2 + nondetString2 + -1 := 0]][nondetString1][nondetString1 + unknown-#length-unknown[nondetString1] + -1]) && unknown-#memory_int-unknown[ps][unknown-#length-unknown[ps] + -1] == 0) && nondetString2 == 0) && ps2 == ps) && unknown-#memory_int-unknown[ps2][ps2] + 1 <= 0)) || (((((((((((0 == unknown-#memory_int-unknown[pt][unknown-#length-unknown[pt] + -1] && ps2 + 1 <= unknown-#length-unknown[ps2]) && t == pt) && !(nondetString1 == nondetString2)) && pt == t) && ((((((((((((unknown-#length-unknown[nondetString2] == length2 && 1 <= length2) && \valid[ps2] == 1) && nondetString1 == 0) && 1 == \valid[nondetString2]) && unknown-#memory_int-unknown[ps2] == unknown-#memory_int-unknown[ps]) && length1 == unknown-#length-unknown[nondetString1]) && 1 == \valid[pt]) && (\exists ULTIMATE.start_main_~length2~0 : int, ULTIMATE.start_main_~nondetString2~0.offset : int :: ((unknown-#memory_int-unknown[pt][ULTIMATE.start_main_~length2~0 + ULTIMATE.start_main_~nondetString2~0.offset + -1] == 0 && ULTIMATE.start_main_~length2~0 + ULTIMATE.start_main_~nondetString2~0.offset <= unknown-#length-unknown[pt]) && pt <= ULTIMATE.start_main_~nondetString2~0.offset) && 1 <= ULTIMATE.start_main_~length2~0)) && 1 == \valid[ps]) && 1 == \valid[nondetString1]) && 1 <= length1) && 1 <= ps) && 1 <= unknown-#memory_int-unknown[ps2][ps2]) && t == 0) && 0 == unknown-#memory_int-unknown[ps2][unknown-#length-unknown[ps2] + -1]) && 0 == unknown-#memory_int-unknown[nondetString2 := unknown-#memory_int-unknown[nondetString2][length2 + nondetString2 + -1 := 0]][nondetString1][nondetString1 + unknown-#length-unknown[nondetString1] + -1]) && unknown-#memory_int-unknown[ps][unknown-#length-unknown[ps] + -1] == 0) && ps2 + 2 <= unknown-#length-unknown[ps] && ps2 == ps) && nondetString2 == 0)) || (((((((0 == unknown-#memory_int-unknown[pt][unknown-#length-unknown[pt] + -1] && t == pt) && !(nondetString1 == nondetString2)) && (((((((((((((((((unknown-#length-unknown[nondetString2] == length2 && 1 <= length2) && \valid[ps2] == 1) && nondetString1 == 0) && 1 == \valid[nondetString2]) && ps2 == 0) && unknown-#memory_int-unknown[ps2] == unknown-#memory_int-unknown[ps]) && 1 <= unknown-#length-unknown[ps2]) && pt == 0) && length1 == unknown-#length-unknown[nondetString1]) && ps == 0) && t == 0) && 1 == \valid[pt]) && 2 <= unknown-#length-unknown[ps]) && (\exists ULTIMATE.start_main_~length2~0 : int, ULTIMATE.start_main_~nondetString2~0.offset : int :: ((unknown-#memory_int-unknown[pt][ULTIMATE.start_main_~length2~0 + ULTIMATE.start_main_~nondetString2~0.offset + -1] == 0 && ULTIMATE.start_main_~length2~0 + ULTIMATE.start_main_~nondetString2~0.offset <= unknown-#length-unknown[pt]) && pt <= ULTIMATE.start_main_~nondetString2~0.offset) && 1 <= ULTIMATE.start_main_~length2~0)) && 1 == \valid[ps]) && 1 == \valid[nondetString1]) && 1 <= length1) && 1 <= unknown-#memory_int-unknown[ps2][ps2]) && 0 == unknown-#memory_int-unknown[ps2][unknown-#length-unknown[ps2] + -1]) && 0 == unknown-#memory_int-unknown[nondetString2 := unknown-#memory_int-unknown[nondetString2][length2 + nondetString2 + -1 := 0]][nondetString1][nondetString1 + unknown-#length-unknown[nondetString1] + -1]) && unknown-#memory_int-unknown[ps][unknown-#length-unknown[ps] + -1] == 0) && nondetString2 == 0)) || (((((0 == unknown-#memory_int-unknown[ps2][unknown-#length-unknown[ps2] + -1] && 0 == unknown-#memory_int-unknown[nondetString2 := unknown-#memory_int-unknown[nondetString2][length2 + nondetString2 + -1 := 0]][nondetString1][nondetString1 + unknown-#length-unknown[nondetString1] + -1]) && ps2 + 1 <= unknown-#length-unknown[ps2]) && unknown-#memory_int-unknown[ps][unknown-#length-unknown[ps] + -1] == 0) && (((((unknown-#memory_int-unknown[t][unknown-#length-unknown[t] + -1] == 0 && ps + 2 <= unknown-#length-unknown[ps]) && pt + 1 <= unknown-#length-unknown[pt]) && 0 == unknown-#memory_int-unknown[pt][unknown-#length-unknown[pt] + -1]) && (((((((((((((((length1 == unknown-#length-unknown[nondetString1] && (\exists ULTIMATE.start_main_~length2~0 : int, ULTIMATE.start_main_~nondetString2~0.offset : int :: ((0 == unknown-#memory_int-unknown[t][ULTIMATE.start_main_~length2~0 + ULTIMATE.start_main_~nondetString2~0.offset + -1] && ULTIMATE.start_main_~length2~0 + ULTIMATE.start_main_~nondetString2~0.offset <= unknown-#length-unknown[t]) && 1 <= ULTIMATE.start_main_~length2~0) && t <= ULTIMATE.start_main_~nondetString2~0.offset)) && unknown-#length-unknown[nondetString2] == length2) && 1 == \valid[pt]) && t == 0) && 1 <= length2) && \valid[ps2] == 1) && \valid[t] == 1) && 1 == \valid[nondetString1]) && 1 <= length1) && nondetString1 == 0) && \valid[ps] == 1) && 1 <= ps) && 1 == \valid[nondetString2]) && 1 <= pt) || ((((((((((((((length1 == unknown-#length-unknown[nondetString1] && ps == 0) && (\exists ULTIMATE.start_main_~length2~0 : int, ULTIMATE.start_main_~nondetString2~0.offset : int :: ((0 == unknown-#memory_int-unknown[t][ULTIMATE.start_main_~length2~0 + ULTIMATE.start_main_~nondetString2~0.offset + -1] && ULTIMATE.start_main_~length2~0 + ULTIMATE.start_main_~nondetString2~0.offset <= unknown-#length-unknown[t]) && 1 <= ULTIMATE.start_main_~length2~0) && t <= ULTIMATE.start_main_~nondetString2~0.offset)) && unknown-#length-unknown[nondetString2] == length2) && 1 == \valid[pt]) && t == 0) && 1 <= length2) && \valid[ps2] == 1) && \valid[t] == 1) && 1 == \valid[nondetString1]) && 1 <= length1) && nondetString1 == 0) && \valid[ps] == 1) && 1 == \valid[nondetString2]) && 1 <= pt))) && nondetString2 == 0) && 1 <= ps2) && !(nondetString1 == nondetString2))) || ((((((((((((((ps2 < 0 && unknown-#memory_int-unknown[t][unknown-#length-unknown[t] + -1] == 0) && 0 == unknown-#memory_int-unknown[pt][unknown-#length-unknown[pt] + -1]) && ps2 + 1 <= unknown-#length-unknown[ps2]) && (\exists ULTIMATE.start_main_~nondetString1~0.offset : int :: (ULTIMATE.start_main_~nondetString1~0.offset <= 0 && 0 <= ULTIMATE.start_main_~nondetString1~0.offset) && 0 == unknown-#memory_int-unknown[nondetString1][ULTIMATE.start_main_~nondetString1~0.offset + unknown-#length-unknown[nondetString1] + -1])) && (((((((((((((((((pt == 0 && length1 == unknown-#length-unknown[nondetString1]) && (\exists ULTIMATE.start_main_~length2~0 : int, ULTIMATE.start_main_~nondetString2~0.offset : int :: ((0 == unknown-#memory_int-unknown[t][ULTIMATE.start_main_~length2~0 + ULTIMATE.start_main_~nondetString2~0.offset + -1] && ULTIMATE.start_main_~length2~0 + ULTIMATE.start_main_~nondetString2~0.offset <= unknown-#length-unknown[t]) && 1 <= ULTIMATE.start_main_~length2~0) && t <= ULTIMATE.start_main_~nondetString2~0.offset)) && (2 <= nondetString1 + unknown-#length-unknown[nondetString1] || (!(nondetString1 == nondetString2) && 0 == unknown-#memory_int-unknown[nondetString2 := unknown-#memory_int-unknown[nondetString2][length2 + nondetString2 + -1 := 0]][nondetString1][nondetString1]))) && unknown-#length-unknown[nondetString2] == length2) && t == 0) && ps + 1 <= unknown-#length-unknown[ps]) && 1 == \valid[pt]) && 1 <= length2) && (!(unknown-#memory_int-unknown[pt][pt] == unknown-#memory_int-unknown[ps2][ps2]) || 2 <= unknown-#length-unknown[pt])) && \valid[ps2] == 1) && (\exists ULTIMATE.start_main_~length2~0 : int, ULTIMATE.start_main_~nondetString2~0.offset : int :: ((unknown-#memory_int-unknown[pt][ULTIMATE.start_main_~length2~0 + ULTIMATE.start_main_~nondetString2~0.offset + -1] == 0 && ULTIMATE.start_main_~length2~0 + ULTIMATE.start_main_~nondetString2~0.offset <= unknown-#length-unknown[pt]) && pt <= ULTIMATE.start_main_~nondetString2~0.offset) && 1 <= ULTIMATE.start_main_~length2~0)) && \valid[t] == 1) && 1 == \valid[nondetString1]) && 1 <= length1) && nondetString1 == 0) && \valid[ps] == 1) && 1 <= ps) && 1 == \valid[nondetString2]) && nondetString1 < 0) && ps < 0) && (\exists ULTIMATE.start_main_#t~malloc12.base : int :: (unknown-#length-unknown[ULTIMATE.start_main_#t~malloc12.base] == length2 && ULTIMATE.start_main_#t~malloc12.base <= nondetString2) && 0 < ULTIMATE.start_main_#t~malloc12.base)) && (\exists ULTIMATE.start_main_~nondetString1~0.offset : int :: (ULTIMATE.start_main_~nondetString1~0.offset <= 0 && 0 <= ULTIMATE.start_main_~nondetString1~0.offset) && unknown-#memory_int-unknown[ps][ULTIMATE.start_main_~nondetString1~0.offset + unknown-#length-unknown[ps] + -1] == 0)) && (\exists ULTIMATE.start_main_~nondetString1~0.offset : int :: (ULTIMATE.start_main_~nondetString1~0.offset <= 0 && 0 <= ULTIMATE.start_main_~nondetString1~0.offset) && 0 == unknown-#memory_int-unknown[ps2][ULTIMATE.start_main_~nondetString1~0.offset + unknown-#length-unknown[ps2] + -1])) && nondetString2 == 0) && 0 <= ps2) && 0 < t) && !(unknown-#length-unknown[ps] == ps + 1))) || ((((((((((((((((((1 == length2 + nondetString2 && pt == 0) && length1 == unknown-#length-unknown[nondetString1]) && 1 <= unknown-#length-unknown[t]) && unknown-#length-unknown[nondetString2] == length2) && t == 0) && 1 == \valid[pt]) && \valid[ps2] == 1) && 0 == unknown-#memory_int-unknown[pt][pt]) && unknown-#memory_int-unknown[t][t] == 0) && \valid[t] == 1) && 1 == \valid[nondetString1]) && 1 <= length1) && 1 <= unknown-#length-unknown[pt]) && nondetString1 == 0) && nondetString2 == 0) && \valid[ps] == 1) && 1 == \valid[nondetString2]) && 1 <= unknown-#memory_int-unknown[ps2][ps2]) 172.61/109.74 - StatisticsResult: Ultimate Automizer benchmark data 172.61/109.74 CFG has 1 procedures, 31 locations, 14 error locations. SAFE Result, 92.1s OverallTime, 40 OverallIterations, 4 TraceHistogramMax, 57.4s AutomataDifference, 0.0s DeadEndRemovalTime, 23.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 324 SDtfs, 8171 SDslu, 2660 SDs, 0 SdLazy, 8010 SolverSat, 1677 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 14.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1086 GetRequests, 368 SyntacticMatches, 8 SemanticMatches, 710 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12029 ImplicationChecksByTransitivity, 46.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=469occurred in iteration=37, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 40 MinimizatonAttempts, 1711 StatesRemovedByMinimization, 28 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 2 LocationsWithAnnotation, 2 PreInvPairs, 49 NumberOfFragments, 2148 HoareAnnotationTreeSize, 2 FomulaSimplifications, 3113795921 FormulaSimplificationTreeSizeReduction, 2.9s HoareSimplificationTime, 2 FomulaSimplificationsInter, 647938696 FormulaSimplificationTreeSizeReductionInter, 20.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 9.1s InterpolantComputationTime, 1099 NumberOfCodeBlocks, 1099 NumberOfCodeBlocksAsserted, 61 NumberOfCheckSat, 1044 ConstructedInterpolants, 147 QuantifiedInterpolants, 378262 SizeOfPredicates, 181 NumberOfNonLiveVariables, 2304 ConjunctsInSsa, 369 ConjunctsInUnsatCore, 55 InterpolantComputations, 28 PerfectInterpolantSequences, 193/486 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available 172.61/109.74 - StatisticsResult: Constructed decomposition of program 172.61/109.74 Your program was decomposed into 10 terminating modules (6 trivial, 0 deterministic, 4 nondeterministic). One nondeterministic module has affine ranking function -1 * ps + unknown-#length-unknown[alloca(length1 * sizeof(char))] and consists of 4 locations. One nondeterministic module has affine ranking function unknown-#length-unknown[alloca(length2 * sizeof(char))] + -1 * ps2 and consists of 10 locations. One nondeterministic module has affine ranking function unknown-#length-unknown[ps] + -1 * ps2 and consists of 7 locations. One nondeterministic module has affine ranking function unknown-#length-unknown[nondetString1] + -1 * ps2 and consists of 7 locations. 6 modules have a trivial ranking function, the largest among these consists of 8 locations. 172.61/109.74 - StatisticsResult: Timing statistics 172.61/109.74 BüchiAutomizer plugin needed 11.8s and 11 iterations. TraceHistogramMax:2. Analysis of lassos took 8.8s. Construction of modules took 0.9s. Büchi inclusion checks took 1.8s. Highest rank in rank-based complementation 3. Minimization of det autom 5. Minimization of nondet autom 5. Automata minimization 0.0s AutomataMinimizationTime, 9 MinimizatonAttempts, 233 StatesRemovedByMinimization, 7 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 60 states and ocurred in iteration 7. Nontrivial modules had stage [4, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 127 SDtfs, 785 SDslu, 510 SDs, 0 SdLazy, 1083 SolverSat, 140 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.9s Time LassoAnalysisResults: nont0 unkn0 SFLI5 SFLT0 conc0 concLT0 SILN0 SILU1 SILI0 SILT0 lasso4 LassoPreprocessingBenchmarks: Lassos: inital243 mio100 ax100 hnf100 lsp96 ukn87 mio100 lsp41 div100 bol100 ite100 ukn100 eq196 hnf88 smp98 dnf100 smp100 tf100 neg100 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 5ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s 172.61/109.74 - TerminationAnalysisResult: Termination proven 172.61/109.74 Buchi Automizer proved that your program is terminating 172.61/109.74 RESULT: Ultimate proved your program to be correct! 172.61/109.74 !SESSION 2019-03-28 12:34:58.294 ----------------------------------------------- 172.61/109.74 eclipse.buildId=unknown 172.61/109.74 java.version=1.8.0_181 172.61/109.74 java.vendor=Oracle Corporation 172.61/109.74 BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US 172.61/109.74 Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox/benchmark/theBenchmark.c 172.61/109.74 Command-line arguments: -os linux -ws gtk -arch x86_64 -consoleLog -data @user.home/.ultimate -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -data /export/starexec/sandbox/tmp -i /export/starexec/sandbox/benchmark/theBenchmark.c 172.61/109.74 172.61/109.74 !ENTRY org.eclipse.core.resources 2 10035 2019-03-28 12:36:47.172 172.61/109.74 !MESSAGE The workspace will exit with unsaved changes in this session. 172.61/109.74 Received shutdown request... 172.61/109.74 Ultimate: 172.61/109.74 GTK+ Version Check 172.61/109.74 EOF