48.71/31.65 YES 48.71/31.65 48.71/31.65 Ultimate: Cannot open display: 48.71/31.65 This is Ultimate 0.1.24-8dc7c08-m 48.71/31.65 [2019-03-28 12:43:00,603 INFO L170 SettingsManager]: Resetting all preferences to default values... 48.71/31.65 [2019-03-28 12:43:00,605 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values 48.71/31.65 [2019-03-28 12:43:00,617 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... 48.71/31.65 [2019-03-28 12:43:00,617 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values 48.71/31.65 [2019-03-28 12:43:00,618 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values 48.71/31.65 [2019-03-28 12:43:00,619 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values 48.71/31.65 [2019-03-28 12:43:00,621 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values 48.71/31.65 [2019-03-28 12:43:00,622 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values 48.71/31.65 [2019-03-28 12:43:00,623 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values 48.71/31.65 [2019-03-28 12:43:00,624 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... 48.71/31.65 [2019-03-28 12:43:00,624 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values 48.71/31.65 [2019-03-28 12:43:00,625 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values 48.71/31.65 [2019-03-28 12:43:00,626 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values 48.71/31.65 [2019-03-28 12:43:00,627 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values 48.71/31.65 [2019-03-28 12:43:00,628 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values 48.71/31.65 [2019-03-28 12:43:00,629 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values 48.71/31.65 [2019-03-28 12:43:00,630 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values 48.71/31.65 [2019-03-28 12:43:00,632 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values 48.71/31.65 [2019-03-28 12:43:00,634 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values 48.71/31.65 [2019-03-28 12:43:00,635 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values 48.71/31.65 [2019-03-28 12:43:00,636 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values 48.71/31.65 [2019-03-28 12:43:00,638 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... 48.71/31.65 [2019-03-28 12:43:00,639 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... 48.71/31.65 [2019-03-28 12:43:00,639 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values 48.71/31.65 [2019-03-28 12:43:00,640 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values 48.71/31.65 [2019-03-28 12:43:00,640 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values 48.71/31.65 [2019-03-28 12:43:00,641 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... 48.71/31.65 [2019-03-28 12:43:00,641 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values 48.71/31.65 [2019-03-28 12:43:00,642 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values 48.71/31.65 [2019-03-28 12:43:00,643 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values 48.71/31.65 [2019-03-28 12:43:00,643 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values 48.71/31.65 [2019-03-28 12:43:00,644 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... 48.71/31.65 [2019-03-28 12:43:00,644 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values 48.71/31.65 [2019-03-28 12:43:00,645 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... 48.71/31.65 [2019-03-28 12:43:00,645 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... 48.71/31.65 [2019-03-28 12:43:00,645 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values 48.71/31.65 [2019-03-28 12:43:00,646 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values 48.71/31.65 [2019-03-28 12:43:00,647 INFO L181 SettingsManager]: Finished resetting all preferences to default values... 48.71/31.65 [2019-03-28 12:43:00,647 INFO L98 SettingsManager]: Beginning loading settings from /export/starexec/sandbox/solver/bin/./../termcomp2017.epf 48.71/31.65 [2019-03-28 12:43:00,662 INFO L110 SettingsManager]: Loading preferences was successful 48.71/31.65 [2019-03-28 12:43:00,662 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: 48.71/31.65 [2019-03-28 12:43:00,663 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: 48.71/31.65 [2019-03-28 12:43:00,663 INFO L133 SettingsManager]: * Rewrite not-equals=true 48.71/31.65 [2019-03-28 12:43:00,663 INFO L133 SettingsManager]: * Create parallel compositions if possible=false 48.71/31.65 [2019-03-28 12:43:00,664 INFO L133 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE 48.71/31.65 [2019-03-28 12:43:00,664 INFO L133 SettingsManager]: * Use SBE=true 48.71/31.65 [2019-03-28 12:43:00,664 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: 48.71/31.65 [2019-03-28 12:43:00,664 INFO L133 SettingsManager]: * Use old map elimination=false 48.71/31.65 [2019-03-28 12:43:00,664 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false 48.71/31.65 [2019-03-28 12:43:00,664 INFO L133 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION 48.71/31.65 [2019-03-28 12:43:00,665 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true 48.71/31.65 [2019-03-28 12:43:00,665 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES 48.71/31.65 [2019-03-28 12:43:00,665 INFO L133 SettingsManager]: * Construct termination proof for TermComp=true 48.71/31.65 [2019-03-28 12:43:00,665 INFO L133 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 48.71/31.65 [2019-03-28 12:43:00,665 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: 48.71/31.65 [2019-03-28 12:43:00,666 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false 48.71/31.65 [2019-03-28 12:43:00,666 INFO L133 SettingsManager]: * Check division by zero=IGNORE 48.71/31.65 [2019-03-28 12:43:00,666 INFO L133 SettingsManager]: * Check if freed pointer was valid=false 48.71/31.65 [2019-03-28 12:43:00,666 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false 48.71/31.65 [2019-03-28 12:43:00,666 INFO L133 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE 48.71/31.65 [2019-03-28 12:43:00,666 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: 48.71/31.65 [2019-03-28 12:43:00,667 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements 48.71/31.65 [2019-03-28 12:43:00,667 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump 48.71/31.65 [2019-03-28 12:43:00,667 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 48.71/31.65 [2019-03-28 12:43:00,667 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: 48.71/31.65 [2019-03-28 12:43:00,667 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles 48.71/31.65 [2019-03-28 12:43:00,668 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL 48.71/31.65 [2019-03-28 12:43:00,668 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 48.71/31.65 [2019-03-28 12:43:00,693 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp 48.71/31.65 [2019-03-28 12:43:00,705 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized 48.71/31.65 [2019-03-28 12:43:00,708 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. 48.71/31.65 [2019-03-28 12:43:00,710 INFO L271 PluginConnector]: Initializing CDTParser... 48.71/31.65 [2019-03-28 12:43:00,710 INFO L276 PluginConnector]: CDTParser initialized 48.71/31.65 [2019-03-28 12:43:00,711 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox/benchmark/theBenchmark.c 48.71/31.65 [2019-03-28 12:43:00,777 INFO L221 CDTParser]: Created temporary CDT project at /export/starexec/sandbox/tmp/8e3c04f6bfcb4c5e918df09e48dcc2ad/FLAGcf4da80b6 48.71/31.65 [2019-03-28 12:43:01,111 INFO L307 CDTParser]: Found 1 translation units. 48.71/31.65 [2019-03-28 12:43:01,112 INFO L161 CDTParser]: Scanning /export/starexec/sandbox/benchmark/theBenchmark.c 48.71/31.65 [2019-03-28 12:43:01,113 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. 48.71/31.65 [2019-03-28 12:43:01,119 INFO L355 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox/tmp/8e3c04f6bfcb4c5e918df09e48dcc2ad/FLAGcf4da80b6 48.71/31.65 [2019-03-28 12:43:01,527 INFO L363 CDTParser]: Successfully deleted /export/starexec/sandbox/tmp/8e3c04f6bfcb4c5e918df09e48dcc2ad 48.71/31.65 [2019-03-28 12:43:01,538 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### 48.71/31.65 [2019-03-28 12:43:01,540 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. 48.71/31.65 [2019-03-28 12:43:01,541 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- 48.71/31.65 [2019-03-28 12:43:01,541 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... 48.71/31.65 [2019-03-28 12:43:01,545 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized 48.71/31.65 [2019-03-28 12:43:01,545 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 12:43:01" (1/1) ... 48.71/31.65 [2019-03-28 12:43:01,549 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33fdd170 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:43:01, skipping insertion in model container 48.71/31.65 [2019-03-28 12:43:01,549 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 12:43:01" (1/1) ... 48.71/31.65 [2019-03-28 12:43:01,556 INFO L145 MainTranslator]: Starting translation in SV-COMP mode 48.71/31.65 [2019-03-28 12:43:01,574 INFO L176 MainTranslator]: Built tables and reachable declarations 48.71/31.65 [2019-03-28 12:43:01,739 INFO L206 PostProcessor]: Analyzing one entry point: main 48.71/31.65 [2019-03-28 12:43:01,752 INFO L191 MainTranslator]: Completed pre-run 48.71/31.65 [2019-03-28 12:43:01,832 INFO L206 PostProcessor]: Analyzing one entry point: main 48.71/31.65 [2019-03-28 12:43:01,849 INFO L195 MainTranslator]: Completed translation 48.71/31.65 [2019-03-28 12:43:01,849 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:43:01 WrapperNode 48.71/31.65 [2019-03-28 12:43:01,849 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- 48.71/31.65 [2019-03-28 12:43:01,850 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- 48.71/31.65 [2019-03-28 12:43:01,850 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... 48.71/31.65 [2019-03-28 12:43:01,851 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized 48.71/31.65 [2019-03-28 12:43:01,860 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:43:01" (1/1) ... 48.71/31.65 [2019-03-28 12:43:01,870 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:43:01" (1/1) ... 48.71/31.65 [2019-03-28 12:43:01,895 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- 48.71/31.65 [2019-03-28 12:43:01,896 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- 48.71/31.65 [2019-03-28 12:43:01,896 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... 48.71/31.65 [2019-03-28 12:43:01,896 INFO L276 PluginConnector]: Boogie Preprocessor initialized 48.71/31.65 [2019-03-28 12:43:01,906 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:43:01" (1/1) ... 48.71/31.65 [2019-03-28 12:43:01,906 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:43:01" (1/1) ... 48.71/31.65 [2019-03-28 12:43:01,909 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:43:01" (1/1) ... 48.71/31.65 [2019-03-28 12:43:01,909 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:43:01" (1/1) ... 48.71/31.65 [2019-03-28 12:43:01,914 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:43:01" (1/1) ... 48.71/31.65 [2019-03-28 12:43:01,919 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:43:01" (1/1) ... 48.71/31.65 [2019-03-28 12:43:01,920 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:43:01" (1/1) ... 48.71/31.65 [2019-03-28 12:43:01,923 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- 48.71/31.65 [2019-03-28 12:43:01,923 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- 48.71/31.65 [2019-03-28 12:43:01,923 INFO L271 PluginConnector]: Initializing RCFGBuilder... 48.71/31.65 [2019-03-28 12:43:01,923 INFO L276 PluginConnector]: RCFGBuilder initialized 48.71/31.65 [2019-03-28 12:43:01,925 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:43:01" (1/1) ... 48.71/31.65 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 48.71/31.65 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) 48.71/31.65 Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 48.71/31.65 [2019-03-28 12:43:01,988 INFO L130 BoogieDeclarations]: Found specification of procedure write~int 48.71/31.65 [2019-03-28 12:43:01,988 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start 48.71/31.65 [2019-03-28 12:43:01,988 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start 48.71/31.65 [2019-03-28 12:43:01,989 INFO L130 BoogieDeclarations]: Found specification of procedure read~int 48.71/31.65 [2019-03-28 12:43:01,989 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack 48.71/31.65 [2019-03-28 12:43:01,989 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc 48.71/31.65 [2019-03-28 12:43:02,401 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) 48.71/31.65 [2019-03-28 12:43:02,401 INFO L286 CfgBuilder]: Removed 8 assue(true) statements. 48.71/31.65 [2019-03-28 12:43:02,428 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:43:02 BoogieIcfgContainer 48.71/31.65 [2019-03-28 12:43:02,428 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- 48.71/31.65 [2019-03-28 12:43:02,429 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- 48.71/31.65 [2019-03-28 12:43:02,429 INFO L271 PluginConnector]: Initializing BlockEncodingV2... 48.71/31.65 [2019-03-28 12:43:02,431 INFO L276 PluginConnector]: BlockEncodingV2 initialized 48.71/31.65 [2019-03-28 12:43:02,432 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:43:02" (1/1) ... 48.71/31.65 [2019-03-28 12:43:02,453 INFO L313 BlockEncoder]: Initial Icfg 79 locations, 84 edges 48.71/31.65 [2019-03-28 12:43:02,454 INFO L258 BlockEncoder]: Using Remove infeasible edges 48.71/31.65 [2019-03-28 12:43:02,455 INFO L263 BlockEncoder]: Using Maximize final states 48.71/31.65 [2019-03-28 12:43:02,456 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false 48.71/31.65 [2019-03-28 12:43:02,456 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE 48.71/31.65 [2019-03-28 12:43:02,458 INFO L296 BlockEncoder]: Using Remove sink states 48.71/31.65 [2019-03-28 12:43:02,459 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true 48.71/31.65 [2019-03-28 12:43:02,459 INFO L179 BlockEncoder]: Using Rewrite not-equals 48.71/31.65 [2019-03-28 12:43:02,489 INFO L185 BlockEncoder]: Using Use SBE 48.71/31.65 [2019-03-28 12:43:02,541 INFO L200 BlockEncoder]: SBE split 41 edges 48.71/31.65 [2019-03-28 12:43:02,547 INFO L70 emoveInfeasibleEdges]: Removed 2 edges and 0 locations because of local infeasibility 48.71/31.65 [2019-03-28 12:43:02,549 INFO L71 MaximizeFinalStates]: 0 new accepting states 48.71/31.65 [2019-03-28 12:43:02,588 INFO L100 BaseMinimizeStates]: Removed 24 edges and 12 locations by large block encoding 48.71/31.65 [2019-03-28 12:43:02,591 INFO L70 RemoveSinkStates]: Removed 3 edges and 2 locations by removing sink states 48.71/31.65 [2019-03-28 12:43:02,593 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility 48.71/31.65 [2019-03-28 12:43:02,593 INFO L71 MaximizeFinalStates]: 0 new accepting states 48.71/31.65 [2019-03-28 12:43:02,594 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding 48.71/31.65 [2019-03-28 12:43:02,594 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states 48.71/31.65 [2019-03-28 12:43:02,595 INFO L313 BlockEncoder]: Encoded RCFG 65 locations, 122 edges 48.71/31.65 [2019-03-28 12:43:02,595 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:43:02 BasicIcfg 48.71/31.65 [2019-03-28 12:43:02,596 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- 48.71/31.65 [2019-03-28 12:43:02,597 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- 48.71/31.65 [2019-03-28 12:43:02,597 INFO L271 PluginConnector]: Initializing TraceAbstraction... 48.71/31.65 [2019-03-28 12:43:02,600 INFO L276 PluginConnector]: TraceAbstraction initialized 48.71/31.65 [2019-03-28 12:43:02,600 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.03 12:43:01" (1/4) ... 48.71/31.65 [2019-03-28 12:43:02,601 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@492d1162 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 12:43:02, skipping insertion in model container 48.71/31.65 [2019-03-28 12:43:02,601 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:43:01" (2/4) ... 48.71/31.65 [2019-03-28 12:43:02,602 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@492d1162 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 12:43:02, skipping insertion in model container 48.71/31.65 [2019-03-28 12:43:02,602 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:43:02" (3/4) ... 48.71/31.65 [2019-03-28 12:43:02,602 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@492d1162 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:43:02, skipping insertion in model container 48.71/31.65 [2019-03-28 12:43:02,603 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:43:02" (4/4) ... 48.71/31.65 [2019-03-28 12:43:02,604 INFO L112 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 48.71/31.65 [2019-03-28 12:43:02,615 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION 48.71/31.65 [2019-03-28 12:43:02,624 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 38 error locations. 48.71/31.65 [2019-03-28 12:43:02,641 INFO L257 AbstractCegarLoop]: Starting to check reachability of 38 error locations. 48.71/31.65 [2019-03-28 12:43:02,673 INFO L133 ementStrategyFactory]: Using default assertion order modulation 48.71/31.65 [2019-03-28 12:43:02,674 INFO L382 AbstractCegarLoop]: Interprodecural is true 48.71/31.65 [2019-03-28 12:43:02,674 INFO L383 AbstractCegarLoop]: Hoare is true 48.71/31.65 [2019-03-28 12:43:02,674 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates 48.71/31.65 [2019-03-28 12:43:02,674 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE 48.71/31.65 [2019-03-28 12:43:02,674 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION 48.71/31.65 [2019-03-28 12:43:02,674 INFO L387 AbstractCegarLoop]: Difference is false 48.71/31.65 [2019-03-28 12:43:02,674 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA 48.71/31.65 [2019-03-28 12:43:02,675 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== 48.71/31.65 [2019-03-28 12:43:02,690 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states. 48.71/31.65 [2019-03-28 12:43:02,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 48.71/31.65 [2019-03-28 12:43:02,696 INFO L394 BasicCegarLoop]: Found error trace 48.71/31.65 [2019-03-28 12:43:02,697 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] 48.71/31.65 [2019-03-28 12:43:02,697 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION]=== 48.71/31.65 [2019-03-28 12:43:02,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 48.71/31.65 [2019-03-28 12:43:02,703 INFO L82 PathProgramCache]: Analyzing trace with hash 184458, now seen corresponding path program 1 times 48.71/31.65 [2019-03-28 12:43:02,705 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 48.71/31.65 [2019-03-28 12:43:02,705 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 48.71/31.65 [2019-03-28 12:43:02,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 48.71/31.65 [2019-03-28 12:43:02,759 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 48.71/31.65 [2019-03-28 12:43:02,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 48.71/31.65 [2019-03-28 12:43:02,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 48.71/31.65 [2019-03-28 12:43:02,902 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 48.71/31.65 [2019-03-28 12:43:02,905 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 48.71/31.65 [2019-03-28 12:43:02,905 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 48.71/31.65 [2019-03-28 12:43:02,908 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 48.71/31.65 [2019-03-28 12:43:02,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 48.71/31.65 [2019-03-28 12:43:02,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 48.71/31.65 [2019-03-28 12:43:02,926 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 3 states. 48.71/31.65 [2019-03-28 12:43:03,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 48.71/31.65 [2019-03-28 12:43:03,195 INFO L93 Difference]: Finished difference Result 65 states and 122 transitions. 48.71/31.65 [2019-03-28 12:43:03,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 48.71/31.65 [2019-03-28 12:43:03,197 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 48.71/31.65 [2019-03-28 12:43:03,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 48.71/31.65 [2019-03-28 12:43:03,211 INFO L225 Difference]: With dead ends: 65 48.71/31.65 [2019-03-28 12:43:03,211 INFO L226 Difference]: Without dead ends: 62 48.71/31.65 [2019-03-28 12:43:03,215 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 48.71/31.65 [2019-03-28 12:43:03,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. 48.71/31.65 [2019-03-28 12:43:03,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. 48.71/31.65 [2019-03-28 12:43:03,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. 48.71/31.65 [2019-03-28 12:43:03,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 116 transitions. 48.71/31.65 [2019-03-28 12:43:03,258 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 116 transitions. Word has length 3 48.71/31.65 [2019-03-28 12:43:03,259 INFO L84 Accepts]: Finished accepts. word is rejected. 48.71/31.65 [2019-03-28 12:43:03,259 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 116 transitions. 48.71/31.65 [2019-03-28 12:43:03,259 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 48.71/31.65 [2019-03-28 12:43:03,259 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 116 transitions. 48.71/31.65 [2019-03-28 12:43:03,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 48.71/31.65 [2019-03-28 12:43:03,260 INFO L394 BasicCegarLoop]: Found error trace 48.71/31.65 [2019-03-28 12:43:03,260 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] 48.71/31.65 [2019-03-28 12:43:03,260 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION]=== 48.71/31.65 [2019-03-28 12:43:03,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 48.71/31.65 [2019-03-28 12:43:03,261 INFO L82 PathProgramCache]: Analyzing trace with hash 184456, now seen corresponding path program 1 times 48.71/31.65 [2019-03-28 12:43:03,261 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 48.71/31.65 [2019-03-28 12:43:03,261 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 48.71/31.65 [2019-03-28 12:43:03,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 48.71/31.65 [2019-03-28 12:43:03,262 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 48.71/31.65 [2019-03-28 12:43:03,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 48.71/31.65 [2019-03-28 12:43:03,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 48.71/31.65 [2019-03-28 12:43:03,298 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 48.71/31.65 [2019-03-28 12:43:03,299 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 48.71/31.65 [2019-03-28 12:43:03,299 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 48.71/31.65 [2019-03-28 12:43:03,300 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 48.71/31.65 [2019-03-28 12:43:03,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 48.71/31.65 [2019-03-28 12:43:03,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 48.71/31.66 [2019-03-28 12:43:03,301 INFO L87 Difference]: Start difference. First operand 62 states and 116 transitions. Second operand 3 states. 48.71/31.66 [2019-03-28 12:43:03,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 48.71/31.66 [2019-03-28 12:43:03,518 INFO L93 Difference]: Finished difference Result 62 states and 116 transitions. 48.71/31.66 [2019-03-28 12:43:03,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 48.71/31.66 [2019-03-28 12:43:03,519 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 48.71/31.66 [2019-03-28 12:43:03,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 48.71/31.66 [2019-03-28 12:43:03,520 INFO L225 Difference]: With dead ends: 62 48.71/31.66 [2019-03-28 12:43:03,520 INFO L226 Difference]: Without dead ends: 59 48.71/31.66 [2019-03-28 12:43:03,521 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 48.71/31.66 [2019-03-28 12:43:03,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. 48.71/31.66 [2019-03-28 12:43:03,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. 48.71/31.66 [2019-03-28 12:43:03,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. 48.71/31.66 [2019-03-28 12:43:03,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 110 transitions. 48.71/31.66 [2019-03-28 12:43:03,529 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 110 transitions. Word has length 3 48.71/31.66 [2019-03-28 12:43:03,530 INFO L84 Accepts]: Finished accepts. word is rejected. 48.71/31.66 [2019-03-28 12:43:03,530 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 110 transitions. 48.71/31.66 [2019-03-28 12:43:03,530 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 48.71/31.66 [2019-03-28 12:43:03,530 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 110 transitions. 48.71/31.66 [2019-03-28 12:43:03,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 48.71/31.66 [2019-03-28 12:43:03,530 INFO L394 BasicCegarLoop]: Found error trace 48.71/31.66 [2019-03-28 12:43:03,531 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] 48.71/31.66 [2019-03-28 12:43:03,531 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION]=== 48.71/31.66 [2019-03-28 12:43:03,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 48.71/31.66 [2019-03-28 12:43:03,531 INFO L82 PathProgramCache]: Analyzing trace with hash 5714364, now seen corresponding path program 1 times 48.71/31.66 [2019-03-28 12:43:03,531 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 48.71/31.66 [2019-03-28 12:43:03,532 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 48.71/31.66 [2019-03-28 12:43:03,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 48.71/31.66 [2019-03-28 12:43:03,533 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 48.71/31.66 [2019-03-28 12:43:03,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 48.71/31.66 [2019-03-28 12:43:03,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 48.71/31.66 [2019-03-28 12:43:03,581 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 48.71/31.66 [2019-03-28 12:43:03,582 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 48.71/31.66 [2019-03-28 12:43:03,582 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 48.71/31.66 [2019-03-28 12:43:03,582 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 48.71/31.66 [2019-03-28 12:43:03,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 48.71/31.66 [2019-03-28 12:43:03,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 48.71/31.66 [2019-03-28 12:43:03,583 INFO L87 Difference]: Start difference. First operand 59 states and 110 transitions. Second operand 3 states. 48.71/31.66 [2019-03-28 12:43:03,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 48.71/31.66 [2019-03-28 12:43:03,763 INFO L93 Difference]: Finished difference Result 59 states and 110 transitions. 48.71/31.66 [2019-03-28 12:43:03,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 48.71/31.66 [2019-03-28 12:43:03,764 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 48.71/31.66 [2019-03-28 12:43:03,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 48.71/31.66 [2019-03-28 12:43:03,765 INFO L225 Difference]: With dead ends: 59 48.71/31.66 [2019-03-28 12:43:03,766 INFO L226 Difference]: Without dead ends: 56 48.71/31.66 [2019-03-28 12:43:03,766 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 48.71/31.66 [2019-03-28 12:43:03,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. 48.71/31.66 [2019-03-28 12:43:03,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. 48.71/31.66 [2019-03-28 12:43:03,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. 48.71/31.66 [2019-03-28 12:43:03,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 104 transitions. 48.71/31.66 [2019-03-28 12:43:03,772 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 104 transitions. Word has length 4 48.71/31.66 [2019-03-28 12:43:03,772 INFO L84 Accepts]: Finished accepts. word is rejected. 48.71/31.66 [2019-03-28 12:43:03,772 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 104 transitions. 48.71/31.66 [2019-03-28 12:43:03,773 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 48.71/31.66 [2019-03-28 12:43:03,773 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 104 transitions. 48.71/31.66 [2019-03-28 12:43:03,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 48.71/31.66 [2019-03-28 12:43:03,773 INFO L394 BasicCegarLoop]: Found error trace 48.71/31.66 [2019-03-28 12:43:03,773 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] 48.71/31.66 [2019-03-28 12:43:03,774 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION]=== 48.71/31.66 [2019-03-28 12:43:03,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 48.71/31.66 [2019-03-28 12:43:03,774 INFO L82 PathProgramCache]: Analyzing trace with hash 5714366, now seen corresponding path program 1 times 48.71/31.66 [2019-03-28 12:43:03,775 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 48.71/31.66 [2019-03-28 12:43:03,775 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 48.71/31.66 [2019-03-28 12:43:03,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 48.71/31.66 [2019-03-28 12:43:03,776 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 48.71/31.66 [2019-03-28 12:43:03,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 48.71/31.66 [2019-03-28 12:43:03,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 48.71/31.66 [2019-03-28 12:43:03,802 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 48.71/31.66 [2019-03-28 12:43:03,802 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 48.71/31.66 [2019-03-28 12:43:03,802 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 48.71/31.66 [2019-03-28 12:43:03,802 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 48.71/31.66 [2019-03-28 12:43:03,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 48.71/31.66 [2019-03-28 12:43:03,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 48.71/31.66 [2019-03-28 12:43:03,803 INFO L87 Difference]: Start difference. First operand 56 states and 104 transitions. Second operand 3 states. 48.71/31.66 [2019-03-28 12:43:03,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 48.71/31.66 [2019-03-28 12:43:03,939 INFO L93 Difference]: Finished difference Result 59 states and 104 transitions. 48.71/31.66 [2019-03-28 12:43:03,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 48.71/31.66 [2019-03-28 12:43:03,940 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 48.71/31.66 [2019-03-28 12:43:03,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 48.71/31.66 [2019-03-28 12:43:03,941 INFO L225 Difference]: With dead ends: 59 48.71/31.66 [2019-03-28 12:43:03,941 INFO L226 Difference]: Without dead ends: 56 48.71/31.66 [2019-03-28 12:43:03,942 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 48.71/31.66 [2019-03-28 12:43:03,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. 48.71/31.66 [2019-03-28 12:43:03,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. 48.71/31.66 [2019-03-28 12:43:03,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. 48.71/31.66 [2019-03-28 12:43:03,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 101 transitions. 48.71/31.66 [2019-03-28 12:43:03,947 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 101 transitions. Word has length 4 48.71/31.66 [2019-03-28 12:43:03,947 INFO L84 Accepts]: Finished accepts. word is rejected. 48.71/31.66 [2019-03-28 12:43:03,948 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 101 transitions. 48.71/31.66 [2019-03-28 12:43:03,948 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 48.71/31.66 [2019-03-28 12:43:03,948 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 101 transitions. 48.71/31.66 [2019-03-28 12:43:03,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 48.71/31.66 [2019-03-28 12:43:03,948 INFO L394 BasicCegarLoop]: Found error trace 48.71/31.66 [2019-03-28 12:43:03,948 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] 48.71/31.66 [2019-03-28 12:43:03,949 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION]=== 48.71/31.66 [2019-03-28 12:43:03,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 48.71/31.66 [2019-03-28 12:43:03,950 INFO L82 PathProgramCache]: Analyzing trace with hash 5714367, now seen corresponding path program 1 times 48.71/31.66 [2019-03-28 12:43:03,950 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 48.71/31.66 [2019-03-28 12:43:03,950 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 48.71/31.66 [2019-03-28 12:43:03,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 48.71/31.66 [2019-03-28 12:43:03,951 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 48.71/31.66 [2019-03-28 12:43:03,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 48.71/31.66 [2019-03-28 12:43:03,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 48.71/31.66 [2019-03-28 12:43:03,989 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 48.71/31.66 [2019-03-28 12:43:03,989 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 48.71/31.66 [2019-03-28 12:43:03,989 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 48.71/31.66 [2019-03-28 12:43:03,990 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 48.71/31.66 [2019-03-28 12:43:03,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 48.71/31.66 [2019-03-28 12:43:03,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 48.71/31.66 [2019-03-28 12:43:03,990 INFO L87 Difference]: Start difference. First operand 56 states and 101 transitions. Second operand 3 states. 48.71/31.66 [2019-03-28 12:43:04,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 48.71/31.66 [2019-03-28 12:43:04,140 INFO L93 Difference]: Finished difference Result 56 states and 101 transitions. 48.71/31.66 [2019-03-28 12:43:04,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 48.71/31.66 [2019-03-28 12:43:04,140 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 48.71/31.66 [2019-03-28 12:43:04,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 48.71/31.66 [2019-03-28 12:43:04,142 INFO L225 Difference]: With dead ends: 56 48.71/31.66 [2019-03-28 12:43:04,142 INFO L226 Difference]: Without dead ends: 53 48.71/31.66 [2019-03-28 12:43:04,142 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 48.71/31.66 [2019-03-28 12:43:04,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. 48.71/31.66 [2019-03-28 12:43:04,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. 48.71/31.66 [2019-03-28 12:43:04,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. 48.71/31.66 [2019-03-28 12:43:04,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 98 transitions. 48.71/31.66 [2019-03-28 12:43:04,148 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 98 transitions. Word has length 4 48.71/31.66 [2019-03-28 12:43:04,148 INFO L84 Accepts]: Finished accepts. word is rejected. 48.71/31.66 [2019-03-28 12:43:04,148 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 98 transitions. 48.71/31.66 [2019-03-28 12:43:04,148 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 48.71/31.66 [2019-03-28 12:43:04,148 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 98 transitions. 48.71/31.66 [2019-03-28 12:43:04,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 48.71/31.66 [2019-03-28 12:43:04,149 INFO L394 BasicCegarLoop]: Found error trace 48.71/31.66 [2019-03-28 12:43:04,149 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] 48.71/31.66 [2019-03-28 12:43:04,149 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION]=== 48.71/31.66 [2019-03-28 12:43:04,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 48.71/31.66 [2019-03-28 12:43:04,149 INFO L82 PathProgramCache]: Analyzing trace with hash 177143159, now seen corresponding path program 1 times 48.71/31.66 [2019-03-28 12:43:04,149 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 48.71/31.66 [2019-03-28 12:43:04,150 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 48.71/31.66 [2019-03-28 12:43:04,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 48.71/31.66 [2019-03-28 12:43:04,151 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 48.71/31.66 [2019-03-28 12:43:04,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 48.71/31.66 [2019-03-28 12:43:04,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 48.71/31.66 [2019-03-28 12:43:04,186 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 48.71/31.66 [2019-03-28 12:43:04,186 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 48.71/31.66 [2019-03-28 12:43:04,187 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 48.71/31.66 [2019-03-28 12:43:04,187 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 48.71/31.66 [2019-03-28 12:43:04,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 48.71/31.66 [2019-03-28 12:43:04,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 48.71/31.66 [2019-03-28 12:43:04,188 INFO L87 Difference]: Start difference. First operand 53 states and 98 transitions. Second operand 3 states. 48.71/31.66 [2019-03-28 12:43:04,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 48.71/31.66 [2019-03-28 12:43:04,329 INFO L93 Difference]: Finished difference Result 53 states and 98 transitions. 48.71/31.66 [2019-03-28 12:43:04,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 48.71/31.66 [2019-03-28 12:43:04,330 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 48.71/31.66 [2019-03-28 12:43:04,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 48.71/31.66 [2019-03-28 12:43:04,330 INFO L225 Difference]: With dead ends: 53 48.71/31.66 [2019-03-28 12:43:04,331 INFO L226 Difference]: Without dead ends: 47 48.71/31.66 [2019-03-28 12:43:04,331 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 48.71/31.66 [2019-03-28 12:43:04,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. 48.71/31.66 [2019-03-28 12:43:04,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. 48.71/31.66 [2019-03-28 12:43:04,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. 48.71/31.66 [2019-03-28 12:43:04,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 86 transitions. 48.71/31.66 [2019-03-28 12:43:04,336 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 86 transitions. Word has length 5 48.71/31.66 [2019-03-28 12:43:04,336 INFO L84 Accepts]: Finished accepts. word is rejected. 48.71/31.66 [2019-03-28 12:43:04,336 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 86 transitions. 48.71/31.66 [2019-03-28 12:43:04,336 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 48.71/31.66 [2019-03-28 12:43:04,336 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 86 transitions. 48.71/31.66 [2019-03-28 12:43:04,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 48.71/31.66 [2019-03-28 12:43:04,337 INFO L394 BasicCegarLoop]: Found error trace 48.71/31.66 [2019-03-28 12:43:04,337 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] 48.71/31.66 [2019-03-28 12:43:04,337 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION]=== 48.71/31.66 [2019-03-28 12:43:04,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 48.71/31.66 [2019-03-28 12:43:04,337 INFO L82 PathProgramCache]: Analyzing trace with hash 177143161, now seen corresponding path program 1 times 48.71/31.66 [2019-03-28 12:43:04,337 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 48.71/31.66 [2019-03-28 12:43:04,338 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 48.71/31.66 [2019-03-28 12:43:04,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 48.71/31.66 [2019-03-28 12:43:04,339 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 48.71/31.66 [2019-03-28 12:43:04,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 48.71/31.66 [2019-03-28 12:43:04,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 48.71/31.66 [2019-03-28 12:43:04,372 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 48.71/31.66 [2019-03-28 12:43:04,373 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 48.71/31.66 [2019-03-28 12:43:04,373 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 48.71/31.66 [2019-03-28 12:43:04,373 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 48.71/31.66 [2019-03-28 12:43:04,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 48.71/31.66 [2019-03-28 12:43:04,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 48.71/31.66 [2019-03-28 12:43:04,374 INFO L87 Difference]: Start difference. First operand 47 states and 86 transitions. Second operand 3 states. 48.71/31.66 [2019-03-28 12:43:04,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 48.71/31.66 [2019-03-28 12:43:04,496 INFO L93 Difference]: Finished difference Result 47 states and 86 transitions. 48.71/31.66 [2019-03-28 12:43:04,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 48.71/31.66 [2019-03-28 12:43:04,497 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 48.71/31.66 [2019-03-28 12:43:04,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 48.71/31.66 [2019-03-28 12:43:04,498 INFO L225 Difference]: With dead ends: 47 48.71/31.66 [2019-03-28 12:43:04,498 INFO L226 Difference]: Without dead ends: 40 48.71/31.66 [2019-03-28 12:43:04,498 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 48.71/31.66 [2019-03-28 12:43:04,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. 48.71/31.66 [2019-03-28 12:43:04,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. 48.71/31.66 [2019-03-28 12:43:04,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. 48.71/31.66 [2019-03-28 12:43:04,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 73 transitions. 48.71/31.66 [2019-03-28 12:43:04,502 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 73 transitions. Word has length 5 48.71/31.66 [2019-03-28 12:43:04,502 INFO L84 Accepts]: Finished accepts. word is rejected. 48.71/31.66 [2019-03-28 12:43:04,503 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 73 transitions. 48.71/31.66 [2019-03-28 12:43:04,503 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 48.71/31.66 [2019-03-28 12:43:04,503 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 73 transitions. 48.71/31.66 [2019-03-28 12:43:04,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 48.71/31.66 [2019-03-28 12:43:04,503 INFO L394 BasicCegarLoop]: Found error trace 48.71/31.66 [2019-03-28 12:43:04,503 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] 48.71/31.66 [2019-03-28 12:43:04,504 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION]=== 48.71/31.66 [2019-03-28 12:43:04,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 48.71/31.66 [2019-03-28 12:43:04,504 INFO L82 PathProgramCache]: Analyzing trace with hash -1564214473, now seen corresponding path program 1 times 48.71/31.66 [2019-03-28 12:43:04,504 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 48.71/31.66 [2019-03-28 12:43:04,504 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 48.71/31.66 [2019-03-28 12:43:04,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 48.71/31.66 [2019-03-28 12:43:04,505 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 48.71/31.66 [2019-03-28 12:43:04,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 48.71/31.66 [2019-03-28 12:43:04,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 48.71/31.66 [2019-03-28 12:43:04,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 48.71/31.66 [2019-03-28 12:43:04,531 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 48.71/31.66 [2019-03-28 12:43:04,532 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 48.71/31.66 [2019-03-28 12:43:04,532 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 48.71/31.66 [2019-03-28 12:43:04,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 48.71/31.66 [2019-03-28 12:43:04,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 48.71/31.66 [2019-03-28 12:43:04,533 INFO L87 Difference]: Start difference. First operand 40 states and 73 transitions. Second operand 3 states. 48.71/31.66 [2019-03-28 12:43:04,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 48.71/31.66 [2019-03-28 12:43:04,621 INFO L93 Difference]: Finished difference Result 47 states and 73 transitions. 48.71/31.66 [2019-03-28 12:43:04,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 48.71/31.66 [2019-03-28 12:43:04,621 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 48.71/31.66 [2019-03-28 12:43:04,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 48.71/31.66 [2019-03-28 12:43:04,622 INFO L225 Difference]: With dead ends: 47 48.71/31.66 [2019-03-28 12:43:04,622 INFO L226 Difference]: Without dead ends: 40 48.71/31.66 [2019-03-28 12:43:04,623 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 48.71/31.66 [2019-03-28 12:43:04,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. 48.71/31.66 [2019-03-28 12:43:04,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. 48.71/31.66 [2019-03-28 12:43:04,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. 48.71/31.66 [2019-03-28 12:43:04,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 66 transitions. 48.71/31.66 [2019-03-28 12:43:04,627 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 66 transitions. Word has length 7 48.71/31.66 [2019-03-28 12:43:04,627 INFO L84 Accepts]: Finished accepts. word is rejected. 48.71/31.66 [2019-03-28 12:43:04,627 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 66 transitions. 48.71/31.66 [2019-03-28 12:43:04,627 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 48.71/31.66 [2019-03-28 12:43:04,627 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 66 transitions. 48.71/31.66 [2019-03-28 12:43:04,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 48.71/31.66 [2019-03-28 12:43:04,628 INFO L394 BasicCegarLoop]: Found error trace 48.71/31.66 [2019-03-28 12:43:04,628 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] 48.71/31.66 [2019-03-28 12:43:04,628 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION]=== 48.71/31.66 [2019-03-28 12:43:04,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 48.71/31.66 [2019-03-28 12:43:04,628 INFO L82 PathProgramCache]: Analyzing trace with hash -1564214472, now seen corresponding path program 1 times 48.71/31.66 [2019-03-28 12:43:04,629 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 48.71/31.66 [2019-03-28 12:43:04,629 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 48.71/31.66 [2019-03-28 12:43:04,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 48.71/31.66 [2019-03-28 12:43:04,630 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 48.71/31.66 [2019-03-28 12:43:04,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 48.71/31.66 [2019-03-28 12:43:04,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 48.71/31.66 [2019-03-28 12:43:04,660 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 48.71/31.66 [2019-03-28 12:43:04,660 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 48.71/31.66 [2019-03-28 12:43:04,660 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 48.71/31.66 [2019-03-28 12:43:04,661 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 48.71/31.66 [2019-03-28 12:43:04,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 48.71/31.66 [2019-03-28 12:43:04,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 48.71/31.66 [2019-03-28 12:43:04,661 INFO L87 Difference]: Start difference. First operand 40 states and 66 transitions. Second operand 3 states. 48.71/31.66 [2019-03-28 12:43:04,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 48.71/31.66 [2019-03-28 12:43:04,760 INFO L93 Difference]: Finished difference Result 40 states and 66 transitions. 48.71/31.66 [2019-03-28 12:43:04,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 48.71/31.66 [2019-03-28 12:43:04,761 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 48.71/31.66 [2019-03-28 12:43:04,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 48.71/31.66 [2019-03-28 12:43:04,762 INFO L225 Difference]: With dead ends: 40 48.71/31.66 [2019-03-28 12:43:04,762 INFO L226 Difference]: Without dead ends: 33 48.71/31.66 [2019-03-28 12:43:04,762 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 48.71/31.66 [2019-03-28 12:43:04,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. 48.71/31.66 [2019-03-28 12:43:04,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. 48.71/31.66 [2019-03-28 12:43:04,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. 48.71/31.66 [2019-03-28 12:43:04,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 59 transitions. 48.71/31.66 [2019-03-28 12:43:04,765 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 59 transitions. Word has length 7 48.71/31.66 [2019-03-28 12:43:04,766 INFO L84 Accepts]: Finished accepts. word is rejected. 48.71/31.66 [2019-03-28 12:43:04,766 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 59 transitions. 48.71/31.66 [2019-03-28 12:43:04,766 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 48.71/31.66 [2019-03-28 12:43:04,766 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 59 transitions. 48.71/31.66 [2019-03-28 12:43:04,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 48.71/31.66 [2019-03-28 12:43:04,766 INFO L394 BasicCegarLoop]: Found error trace 48.71/31.66 [2019-03-28 12:43:04,767 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] 48.71/31.66 [2019-03-28 12:43:04,767 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION]=== 48.71/31.66 [2019-03-28 12:43:04,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 48.71/31.66 [2019-03-28 12:43:04,767 INFO L82 PathProgramCache]: Analyzing trace with hash -1564214475, now seen corresponding path program 1 times 48.71/31.66 [2019-03-28 12:43:04,767 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 48.71/31.66 [2019-03-28 12:43:04,767 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 48.71/31.66 [2019-03-28 12:43:04,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 48.71/31.66 [2019-03-28 12:43:04,768 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 48.71/31.66 [2019-03-28 12:43:04,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 48.71/31.66 [2019-03-28 12:43:04,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 48.71/31.66 [2019-03-28 12:43:04,800 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 48.71/31.66 [2019-03-28 12:43:04,800 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 48.71/31.66 [2019-03-28 12:43:04,800 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 48.71/31.66 [2019-03-28 12:43:04,800 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 48.71/31.66 [2019-03-28 12:43:04,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 48.71/31.66 [2019-03-28 12:43:04,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 48.71/31.66 [2019-03-28 12:43:04,801 INFO L87 Difference]: Start difference. First operand 33 states and 59 transitions. Second operand 3 states. 48.71/31.66 [2019-03-28 12:43:04,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 48.71/31.66 [2019-03-28 12:43:04,891 INFO L93 Difference]: Finished difference Result 33 states and 59 transitions. 48.71/31.66 [2019-03-28 12:43:04,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 48.71/31.66 [2019-03-28 12:43:04,892 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 48.71/31.66 [2019-03-28 12:43:04,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 48.71/31.66 [2019-03-28 12:43:04,892 INFO L225 Difference]: With dead ends: 33 48.71/31.66 [2019-03-28 12:43:04,892 INFO L226 Difference]: Without dead ends: 0 48.71/31.66 [2019-03-28 12:43:04,893 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 48.71/31.66 [2019-03-28 12:43:04,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. 48.71/31.66 [2019-03-28 12:43:04,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. 48.71/31.66 [2019-03-28 12:43:04,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. 48.71/31.66 [2019-03-28 12:43:04,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. 48.71/31.66 [2019-03-28 12:43:04,894 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 7 48.71/31.66 [2019-03-28 12:43:04,894 INFO L84 Accepts]: Finished accepts. word is rejected. 48.71/31.66 [2019-03-28 12:43:04,894 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. 48.71/31.66 [2019-03-28 12:43:04,894 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 48.71/31.66 [2019-03-28 12:43:04,894 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. 48.71/31.66 [2019-03-28 12:43:04,894 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. 48.71/31.66 [2019-03-28 12:43:04,899 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. 48.71/31.66 [2019-03-28 12:43:04,935 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. 48.71/31.66 [2019-03-28 12:43:04,935 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr4REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. 48.71/31.66 [2019-03-28 12:43:04,935 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0REQUIRES_VIOLATION(line 10) no Hoare annotation was computed. 48.71/31.66 [2019-03-28 12:43:04,935 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr12REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. 48.71/31.66 [2019-03-28 12:43:04,935 INFO L448 ceAbstractionStarter]: For program point L23(line 23) no Hoare annotation was computed. 48.71/31.66 [2019-03-28 12:43:04,936 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr10REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. 48.71/31.66 [2019-03-28 12:43:04,936 INFO L448 ceAbstractionStarter]: For program point L23-2(line 23) no Hoare annotation was computed. 48.71/31.66 [2019-03-28 12:43:04,936 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr8REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. 48.71/31.66 [2019-03-28 12:43:04,936 INFO L448 ceAbstractionStarter]: For program point L19(line 19) no Hoare annotation was computed. 48.71/31.66 [2019-03-28 12:43:04,936 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr6REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. 48.71/31.66 [2019-03-28 12:43:04,936 INFO L448 ceAbstractionStarter]: For program point L19-2(line 19) no Hoare annotation was computed. 48.71/31.66 [2019-03-28 12:43:04,936 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr20REQUIRES_VIOLATION(line 19) no Hoare annotation was computed. 48.71/31.66 [2019-03-28 12:43:04,936 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr18REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. 48.71/31.66 [2019-03-28 12:43:04,937 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr16REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. 48.71/31.66 [2019-03-28 12:43:04,937 INFO L448 ceAbstractionStarter]: For program point L11(line 11) no Hoare annotation was computed. 48.71/31.66 [2019-03-28 12:43:04,937 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr14REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. 48.71/31.66 [2019-03-28 12:43:04,937 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr28REQUIRES_VIOLATION(line 22) no Hoare annotation was computed. 48.71/31.66 [2019-03-28 12:43:04,937 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr26REQUIRES_VIOLATION(line 21) no Hoare annotation was computed. 48.71/31.66 [2019-03-28 12:43:04,937 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr24REQUIRES_VIOLATION(line 21) no Hoare annotation was computed. 48.71/31.66 [2019-03-28 12:43:04,937 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr22REQUIRES_VIOLATION(line 19) no Hoare annotation was computed. 48.71/31.66 [2019-03-28 12:43:04,937 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr36REQUIRES_VIOLATION(line 25) no Hoare annotation was computed. 48.71/31.66 [2019-03-28 12:43:04,937 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. 48.71/31.66 [2019-03-28 12:43:04,938 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr34REQUIRES_VIOLATION(line 23) no Hoare annotation was computed. 48.71/31.66 [2019-03-28 12:43:04,938 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. 48.71/31.66 [2019-03-28 12:43:04,938 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr32REQUIRES_VIOLATION(line 23) no Hoare annotation was computed. 48.71/31.66 [2019-03-28 12:43:04,938 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr30REQUIRES_VIOLATION(line 22) no Hoare annotation was computed. 48.71/31.66 [2019-03-28 12:43:04,938 INFO L448 ceAbstractionStarter]: For program point L12(line 12) no Hoare annotation was computed. 48.71/31.66 [2019-03-28 12:43:04,938 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr3REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. 48.71/31.66 [2019-03-28 12:43:04,938 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1REQUIRES_VIOLATION(line 10) no Hoare annotation was computed. 48.71/31.66 [2019-03-28 12:43:04,938 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr11REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. 48.71/31.66 [2019-03-28 12:43:04,939 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr9REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. 48.71/31.66 [2019-03-28 12:43:04,939 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr7REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. 48.71/31.66 [2019-03-28 12:43:04,939 INFO L448 ceAbstractionStarter]: For program point L21(line 21) no Hoare annotation was computed. 48.71/31.66 [2019-03-28 12:43:04,939 INFO L448 ceAbstractionStarter]: For program point L21-1(lines 21 24) no Hoare annotation was computed. 48.71/31.66 [2019-03-28 12:43:04,939 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr5REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. 48.71/31.66 [2019-03-28 12:43:04,939 INFO L448 ceAbstractionStarter]: For program point L21-3(lines 5 26) no Hoare annotation was computed. 48.71/31.66 [2019-03-28 12:43:04,939 INFO L448 ceAbstractionStarter]: For program point L21-4(lines 21 24) no Hoare annotation was computed. 48.71/31.66 [2019-03-28 12:43:04,939 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr19REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. 48.71/31.66 [2019-03-28 12:43:04,939 INFO L448 ceAbstractionStarter]: For program point L17-1(lines 17 20) no Hoare annotation was computed. 48.71/31.66 [2019-03-28 12:43:04,940 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr17REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. 48.71/31.66 [2019-03-28 12:43:04,940 INFO L444 ceAbstractionStarter]: At program point L17-3(lines 17 20) the Hoare annotation is: (and (= (select |#length| ULTIMATE.start_subxy_~z~0.base) 4) (= (select |#length| ULTIMATE.start_subxy_~i~0.base) 4) (= ULTIMATE.start_subxy_~i~0.offset 0) (= 4 (select |#length| ULTIMATE.start_subxy_~x_ref~0.base)) (= 1 (select |#valid| ULTIMATE.start_subxy_~z~0.base)) (= ULTIMATE.start_subxy_~z~0.offset 0) (= 1 (select |#valid| ULTIMATE.start_subxy_~y_ref~0.base)) (= (select |#valid| ULTIMATE.start_subxy_~x_ref~0.base) 1) (= (select |#valid| ULTIMATE.start_subxy_~i~0.base) 1) (= 0 ULTIMATE.start_subxy_~x_ref~0.offset) (= 0 ULTIMATE.start_subxy_~y_ref~0.offset) (= (select |#length| ULTIMATE.start_subxy_~y_ref~0.base) 4)) 48.71/31.66 [2019-03-28 12:43:04,940 INFO L448 ceAbstractionStarter]: For program point L13(line 13) no Hoare annotation was computed. 48.71/31.66 [2019-03-28 12:43:04,940 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr15REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. 48.71/31.66 [2019-03-28 12:43:04,940 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr13REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. 48.71/31.66 [2019-03-28 12:43:04,941 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr27REQUIRES_VIOLATION(line 21) no Hoare annotation was computed. 48.71/31.66 [2019-03-28 12:43:04,941 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr25REQUIRES_VIOLATION(line 21) no Hoare annotation was computed. 48.71/31.66 [2019-03-28 12:43:04,941 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr23REQUIRES_VIOLATION(line 19) no Hoare annotation was computed. 48.71/31.66 [2019-03-28 12:43:04,941 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr21REQUIRES_VIOLATION(line 19) no Hoare annotation was computed. 48.71/31.66 [2019-03-28 12:43:04,941 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr35REQUIRES_VIOLATION(line 23) no Hoare annotation was computed. 48.71/31.66 [2019-03-28 12:43:04,941 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr33REQUIRES_VIOLATION(line 23) no Hoare annotation was computed. 48.71/31.66 [2019-03-28 12:43:04,941 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr31REQUIRES_VIOLATION(line 22) no Hoare annotation was computed. 48.71/31.66 [2019-03-28 12:43:04,941 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr29REQUIRES_VIOLATION(line 22) no Hoare annotation was computed. 48.71/31.66 [2019-03-28 12:43:04,942 INFO L448 ceAbstractionStarter]: For program point L22(line 22) no Hoare annotation was computed. 48.71/31.66 [2019-03-28 12:43:04,942 INFO L448 ceAbstractionStarter]: For program point L22-2(line 22) no Hoare annotation was computed. 48.71/31.66 [2019-03-28 12:43:04,942 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr37REQUIRES_VIOLATION(line 25) no Hoare annotation was computed. 48.71/31.66 [2019-03-28 12:43:04,942 INFO L448 ceAbstractionStarter]: For program point L18(line 18) no Hoare annotation was computed. 48.71/31.66 [2019-03-28 12:43:04,942 INFO L448 ceAbstractionStarter]: For program point L18-2(line 18) no Hoare annotation was computed. 48.71/31.66 [2019-03-28 12:43:04,942 INFO L448 ceAbstractionStarter]: For program point L14(line 14) no Hoare annotation was computed. 48.71/31.66 [2019-03-28 12:43:04,942 INFO L448 ceAbstractionStarter]: For program point L14-1(line 14) no Hoare annotation was computed. 48.71/31.66 [2019-03-28 12:43:04,942 INFO L448 ceAbstractionStarter]: For program point L14-2(line 14) no Hoare annotation was computed. 48.71/31.66 [2019-03-28 12:43:04,942 INFO L448 ceAbstractionStarter]: For program point L10(line 10) no Hoare annotation was computed. 48.71/31.66 [2019-03-28 12:43:04,943 INFO L448 ceAbstractionStarter]: For program point L14-4(line 14) no Hoare annotation was computed. 48.71/31.66 [2019-03-28 12:43:04,943 INFO L448 ceAbstractionStarter]: For program point L10-1(line 10) no Hoare annotation was computed. 48.71/31.66 [2019-03-28 12:43:04,943 INFO L448 ceAbstractionStarter]: For program point L14-5(line 14) no Hoare annotation was computed. 48.71/31.66 [2019-03-28 12:43:04,943 INFO L448 ceAbstractionStarter]: For program point L14-6(lines 14 16) no Hoare annotation was computed. 48.71/31.66 [2019-03-28 12:43:04,943 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg 48.71/31.66 [2019-03-28 12:43:04,952 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 48.71/31.66 [2019-03-28 12:43:04,954 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 48.71/31.66 [2019-03-28 12:43:04,954 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 48.71/31.66 [2019-03-28 12:43:04,954 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 48.71/31.66 [2019-03-28 12:43:04,960 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 48.71/31.66 [2019-03-28 12:43:04,961 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 48.71/31.66 [2019-03-28 12:43:04,961 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 48.71/31.66 [2019-03-28 12:43:04,961 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 48.71/31.66 [2019-03-28 12:43:04,963 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:43:04 BasicIcfg 48.71/31.66 [2019-03-28 12:43:04,964 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- 48.71/31.66 [2019-03-28 12:43:04,964 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- 48.71/31.66 [2019-03-28 12:43:04,964 INFO L271 PluginConnector]: Initializing BuchiAutomizer... 48.71/31.66 [2019-03-28 12:43:04,968 INFO L276 PluginConnector]: BuchiAutomizer initialized 48.71/31.66 [2019-03-28 12:43:04,968 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 48.71/31.66 [2019-03-28 12:43:04,968 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.03 12:43:01" (1/5) ... 48.71/31.66 [2019-03-28 12:43:04,969 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@742bba52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.03 12:43:04, skipping insertion in model container 48.71/31.66 [2019-03-28 12:43:04,969 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 48.71/31.66 [2019-03-28 12:43:04,969 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:43:01" (2/5) ... 48.71/31.66 [2019-03-28 12:43:04,970 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@742bba52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.03 12:43:04, skipping insertion in model container 48.71/31.66 [2019-03-28 12:43:04,970 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 48.71/31.66 [2019-03-28 12:43:04,970 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:43:02" (3/5) ... 48.71/31.66 [2019-03-28 12:43:04,970 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@742bba52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:43:04, skipping insertion in model container 48.71/31.66 [2019-03-28 12:43:04,970 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 48.71/31.66 [2019-03-28 12:43:04,970 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:43:02" (4/5) ... 48.71/31.66 [2019-03-28 12:43:04,971 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@742bba52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:43:04, skipping insertion in model container 48.71/31.66 [2019-03-28 12:43:04,971 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 48.71/31.66 [2019-03-28 12:43:04,971 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:43:04" (5/5) ... 48.71/31.66 [2019-03-28 12:43:04,973 INFO L375 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 48.71/31.66 [2019-03-28 12:43:04,993 INFO L133 ementStrategyFactory]: Using default assertion order modulation 48.71/31.66 [2019-03-28 12:43:04,993 INFO L374 BuchiCegarLoop]: Interprodecural is true 48.71/31.66 [2019-03-28 12:43:04,994 INFO L375 BuchiCegarLoop]: Hoare is true 48.71/31.66 [2019-03-28 12:43:04,994 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates 48.71/31.66 [2019-03-28 12:43:04,994 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE 48.71/31.66 [2019-03-28 12:43:04,994 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION 48.71/31.66 [2019-03-28 12:43:04,994 INFO L379 BuchiCegarLoop]: Difference is false 48.71/31.66 [2019-03-28 12:43:04,994 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA 48.71/31.66 [2019-03-28 12:43:04,994 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== 48.71/31.66 [2019-03-28 12:43:04,998 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 65 states. 48.71/31.66 [2019-03-28 12:43:05,005 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 48.71/31.66 [2019-03-28 12:43:05,005 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 48.71/31.66 [2019-03-28 12:43:05,005 INFO L119 BuchiIsEmpty]: Starting construction of run 48.71/31.66 [2019-03-28 12:43:05,010 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 48.71/31.66 [2019-03-28 12:43:05,010 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] 48.71/31.66 [2019-03-28 12:43:05,010 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ 48.71/31.66 [2019-03-28 12:43:05,010 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 65 states. 48.71/31.66 [2019-03-28 12:43:05,013 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 48.71/31.66 [2019-03-28 12:43:05,013 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 48.71/31.66 [2019-03-28 12:43:05,013 INFO L119 BuchiIsEmpty]: Starting construction of run 48.71/31.66 [2019-03-28 12:43:05,014 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 48.71/31.66 [2019-03-28 12:43:05,014 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] 48.71/31.66 [2019-03-28 12:43:05,019 INFO L794 eck$LassoCheckResult]: Stem: 30#ULTIMATE.startENTRYtrue [153] ULTIMATE.startENTRY-->L-1: Formula: (and (= |v_#NULL.offset_1| 0) (= |v_#NULL.base_1| 0) (= |v_#valid_1| (store |v_#valid_2| 0 0))) InVars {#valid=|v_#valid_2|} OutVars{#NULL.offset=|v_#NULL.offset_1|, #NULL.base=|v_#NULL.base_1|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid, #NULL.offset, #NULL.base] 12#L-1true [253] L-1-->L10: Formula: (let ((.cse0 (store |v_#valid_7| |v_ULTIMATE.start_subxy_#t~malloc0.base_1| 1))) (let ((.cse1 (store .cse0 |v_ULTIMATE.start_subxy_#t~malloc1.base_1| 1))) (let ((.cse2 (store .cse1 |v_ULTIMATE.start_subxy_#t~malloc2.base_1| 1))) (and (< |v_ULTIMATE.start_subxy_#t~malloc1.base_1| 0) (= 0 |v_ULTIMATE.start_subxy_#t~malloc2.offset_1|) (= v_ULTIMATE.start_subxy_~x_1 |v_ULTIMATE.start_subxy_#in~x_1|) (= v_ULTIMATE.start_subxy_~y_1 |v_ULTIMATE.start_subxy_#in~y_1|) (= |v_#length_1| (store (store (store (store |v_#length_5| |v_ULTIMATE.start_subxy_#t~malloc0.base_1| 4) |v_ULTIMATE.start_subxy_#t~malloc1.base_1| 4) |v_ULTIMATE.start_subxy_#t~malloc2.base_1| 4) |v_ULTIMATE.start_subxy_#t~malloc3.base_1| 4)) (= |v_ULTIMATE.start_subxy_#t~malloc0.offset_1| 0) (= 0 |v_ULTIMATE.start_subxy_#t~malloc1.offset_1|) (= (select .cse0 |v_ULTIMATE.start_subxy_#t~malloc1.base_1|) 0) (= v_ULTIMATE.start_subxy_~x_ref~0.offset_1 |v_ULTIMATE.start_subxy_#t~malloc0.offset_1|) (= v_ULTIMATE.start_subxy_~x_ref~0.base_1 |v_ULTIMATE.start_subxy_#t~malloc0.base_1|) (= 0 (select .cse1 |v_ULTIMATE.start_subxy_#t~malloc2.base_1|)) (< |v_ULTIMATE.start_subxy_#t~malloc2.base_1| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_subxy_~i~0.base_1 |v_ULTIMATE.start_subxy_#t~malloc3.base_1|) (< |v_ULTIMATE.start_subxy_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_subxy_#in~y_1| v_ULTIMATE.start_main_~y~0_1) (= 0 |v_ULTIMATE.start_subxy_#t~malloc3.offset_1|) (= v_ULTIMATE.start_subxy_~y_ref~0.base_1 |v_ULTIMATE.start_subxy_#t~malloc1.base_1|) (> |v_ULTIMATE.start_subxy_#t~malloc2.base_1| 0) (= |v_ULTIMATE.start_subxy_#in~x_1| v_ULTIMATE.start_main_~x~0_1) (= v_ULTIMATE.start_subxy_~z~0.base_1 |v_ULTIMATE.start_subxy_#t~malloc2.base_1|) (= 0 (select .cse2 |v_ULTIMATE.start_subxy_#t~malloc3.base_1|)) (= v_ULTIMATE.start_main_~y~0_1 |v_ULTIMATE.start_main_#t~nondet21_22|) (< |v_ULTIMATE.start_subxy_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_subxy_~y_ref~0.offset_1 |v_ULTIMATE.start_subxy_#t~malloc1.offset_1|) (< |v_ULTIMATE.start_subxy_#t~malloc3.base_1| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_subxy_~i~0.offset_1 |v_ULTIMATE.start_subxy_#t~malloc3.offset_1|) (= v_ULTIMATE.start_main_~x~0_1 |v_ULTIMATE.start_main_#t~nondet20_22|) (< 0 |v_ULTIMATE.start_subxy_#t~malloc0.base_1|) (= (store .cse2 |v_ULTIMATE.start_subxy_#t~malloc3.base_1| 1) |v_#valid_3|) (< 0 |v_ULTIMATE.start_subxy_#t~malloc3.base_1|) (= v_ULTIMATE.start_subxy_~z~0.offset_1 |v_ULTIMATE.start_subxy_#t~malloc2.offset_1|) (= (select |v_#valid_7| |v_ULTIMATE.start_subxy_#t~malloc0.base_1|) 0))))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_5|, #valid=|v_#valid_7|} OutVars{ULTIMATE.start_subxy_~x_ref~0.offset=v_ULTIMATE.start_subxy_~x_ref~0.offset_1, ULTIMATE.start_subxy_#t~malloc2.offset=|v_ULTIMATE.start_subxy_#t~malloc2.offset_1|, ULTIMATE.start_subxy_~y_ref~0.base=v_ULTIMATE.start_subxy_~y_ref~0.base_1, ULTIMATE.start_subxy_#res=|v_ULTIMATE.start_subxy_#res_1|, ULTIMATE.start_subxy_#t~mem8=|v_ULTIMATE.start_subxy_#t~mem8_1|, ULTIMATE.start_subxy_#t~mem9=|v_ULTIMATE.start_subxy_#t~mem9_1|, ULTIMATE.start_subxy_#t~short7=|v_ULTIMATE.start_subxy_#t~short7_1|, ULTIMATE.start_subxy_~y_ref~0.offset=v_ULTIMATE.start_subxy_~y_ref~0.offset_1, ULTIMATE.start_subxy_#t~post12=|v_ULTIMATE.start_subxy_#t~post12_1|, ULTIMATE.start_subxy_~z~0.offset=v_ULTIMATE.start_subxy_~z~0.offset_1, ULTIMATE.start_subxy_#t~mem19=|v_ULTIMATE.start_subxy_#t~mem19_1|, ULTIMATE.start_subxy_#t~post10=|v_ULTIMATE.start_subxy_#t~post10_1|, ULTIMATE.start_subxy_#t~mem14=|v_ULTIMATE.start_subxy_#t~mem14_1|, ULTIMATE.start_subxy_#t~mem15=|v_ULTIMATE.start_subxy_#t~mem15_1|, ULTIMATE.start_main_#t~ret22=|v_ULTIMATE.start_main_#t~ret22_1|, ULTIMATE.start_subxy_#t~mem17=|v_ULTIMATE.start_subxy_#t~mem17_1|, ULTIMATE.start_subxy_#t~mem11=|v_ULTIMATE.start_subxy_#t~mem11_1|, #length=|v_#length_1|, ULTIMATE.start_subxy_#t~mem13=|v_ULTIMATE.start_subxy_#t~mem13_1|, ULTIMATE.start_subxy_~x_ref~0.base=v_ULTIMATE.start_subxy_~x_ref~0.base_1, ULTIMATE.start_subxy_~z~0.base=v_ULTIMATE.start_subxy_~z~0.base_1, ULTIMATE.start_main_#t~nondet21=|v_ULTIMATE.start_main_#t~nondet21_1|, ULTIMATE.start_main_#t~nondet20=|v_ULTIMATE.start_main_#t~nondet20_1|, ULTIMATE.start_subxy_#in~x=|v_ULTIMATE.start_subxy_#in~x_1|, ULTIMATE.start_subxy_#t~malloc2.base=|v_ULTIMATE.start_subxy_#t~malloc2.base_1|, ULTIMATE.start_subxy_#t~malloc0.offset=|v_ULTIMATE.start_subxy_#t~malloc0.offset_1|, ULTIMATE.start_subxy_#t~post18=|v_ULTIMATE.start_subxy_#t~post18_1|, ULTIMATE.start_subxy_#t~post16=|v_ULTIMATE.start_subxy_#t~post16_1|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1, ULTIMATE.start_subxy_#t~malloc0.base=|v_ULTIMATE.start_subxy_#t~malloc0.base_1|, ULTIMATE.start_subxy_#t~malloc1.base=|v_ULTIMATE.start_subxy_#t~malloc1.base_1|, ULTIMATE.start_subxy_#t~malloc3.offset=|v_ULTIMATE.start_subxy_#t~malloc3.offset_1|, ULTIMATE.start_subxy_#t~malloc3.base=|v_ULTIMATE.start_subxy_#t~malloc3.base_1|, ULTIMATE.start_subxy_#in~y=|v_ULTIMATE.start_subxy_#in~y_1|, ULTIMATE.start_subxy_~i~0.base=v_ULTIMATE.start_subxy_~i~0.base_1, ULTIMATE.start_subxy_#t~malloc1.offset=|v_ULTIMATE.start_subxy_#t~malloc1.offset_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_subxy_#t~mem4=|v_ULTIMATE.start_subxy_#t~mem4_1|, ULTIMATE.start_subxy_~x=v_ULTIMATE.start_subxy_~x_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_subxy_#t~mem6=|v_ULTIMATE.start_subxy_#t~mem6_1|, #valid=|v_#valid_3|, ULTIMATE.start_subxy_#t~mem5=|v_ULTIMATE.start_subxy_#t~mem5_1|, ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_1, ULTIMATE.start_subxy_~y=v_ULTIMATE.start_subxy_~y_1, ULTIMATE.start_subxy_~i~0.offset=v_ULTIMATE.start_subxy_~i~0.offset_1} AuxVars[|v_ULTIMATE.start_main_#t~nondet21_22|, |v_ULTIMATE.start_main_#t~nondet20_22|] AssignedVars[ULTIMATE.start_subxy_~x_ref~0.offset, ULTIMATE.start_subxy_#t~malloc2.offset, ULTIMATE.start_subxy_~y_ref~0.base, ULTIMATE.start_subxy_#res, ULTIMATE.start_subxy_#t~mem8, ULTIMATE.start_subxy_#t~mem9, ULTIMATE.start_subxy_#t~short7, ULTIMATE.start_subxy_~y_ref~0.offset, ULTIMATE.start_subxy_#t~post12, ULTIMATE.start_subxy_~z~0.offset, ULTIMATE.start_subxy_#t~mem19, ULTIMATE.start_subxy_#t~post10, ULTIMATE.start_subxy_#t~mem14, ULTIMATE.start_subxy_#t~mem15, ULTIMATE.start_main_#t~ret22, ULTIMATE.start_subxy_#t~mem17, ULTIMATE.start_subxy_#t~mem11, #length, ULTIMATE.start_subxy_#t~mem13, ULTIMATE.start_subxy_~x_ref~0.base, ULTIMATE.start_subxy_~z~0.base, ULTIMATE.start_main_#t~nondet21, ULTIMATE.start_main_#t~nondet20, ULTIMATE.start_subxy_#in~x, ULTIMATE.start_subxy_#t~malloc2.base, ULTIMATE.start_subxy_#t~malloc0.offset, ULTIMATE.start_subxy_#t~post18, ULTIMATE.start_subxy_#t~post16, ULTIMATE.start_main_~x~0, ULTIMATE.start_subxy_#t~malloc0.base, ULTIMATE.start_subxy_#t~malloc1.base, ULTIMATE.start_subxy_#t~malloc3.offset, ULTIMATE.start_subxy_#t~malloc3.base, ULTIMATE.start_subxy_#in~y, ULTIMATE.start_subxy_~i~0.base, ULTIMATE.start_subxy_#t~malloc1.offset, ULTIMATE.start_subxy_#t~mem4, ULTIMATE.start_subxy_~x, ULTIMATE.start_main_#res, ULTIMATE.start_subxy_#t~mem6, #valid, ULTIMATE.start_subxy_#t~mem5, ULTIMATE.start_main_~y~0, ULTIMATE.start_subxy_~y, ULTIMATE.start_subxy_~i~0.offset] 13#L10true [124] L10-->L10-1: Formula: (and (= (select |v_#valid_8| v_ULTIMATE.start_subxy_~x_ref~0.base_3) 1) (<= (+ v_ULTIMATE.start_subxy_~x_ref~0.offset_3 4) (select |v_#length_6| v_ULTIMATE.start_subxy_~x_ref~0.base_3)) (<= 0 v_ULTIMATE.start_subxy_~x_ref~0.offset_3) (= (store |v_#memory_int_2| v_ULTIMATE.start_subxy_~x_ref~0.base_3 (store (select |v_#memory_int_2| v_ULTIMATE.start_subxy_~x_ref~0.base_3) v_ULTIMATE.start_subxy_~x_ref~0.offset_3 v_ULTIMATE.start_subxy_~x_3)) |v_#memory_int_1|)) InVars {ULTIMATE.start_subxy_~x_ref~0.offset=v_ULTIMATE.start_subxy_~x_ref~0.offset_3, ULTIMATE.start_subxy_~x=v_ULTIMATE.start_subxy_~x_3, #valid=|v_#valid_8|, #memory_int=|v_#memory_int_2|, #length=|v_#length_6|, ULTIMATE.start_subxy_~x_ref~0.base=v_ULTIMATE.start_subxy_~x_ref~0.base_3} OutVars{ULTIMATE.start_subxy_~x_ref~0.offset=v_ULTIMATE.start_subxy_~x_ref~0.offset_3, ULTIMATE.start_subxy_~x=v_ULTIMATE.start_subxy_~x_3, #valid=|v_#valid_8|, #memory_int=|v_#memory_int_1|, #length=|v_#length_6|, ULTIMATE.start_subxy_~x_ref~0.base=v_ULTIMATE.start_subxy_~x_ref~0.base_3} AuxVars[] AssignedVars[#memory_int] 57#L10-1true [181] L10-1-->L11: Formula: (and (= |v_#memory_int_3| (store |v_#memory_int_4| v_ULTIMATE.start_subxy_~y_ref~0.base_3 (store (select |v_#memory_int_4| v_ULTIMATE.start_subxy_~y_ref~0.base_3) v_ULTIMATE.start_subxy_~y_ref~0.offset_3 v_ULTIMATE.start_subxy_~y_3))) (= 1 (select |v_#valid_10| v_ULTIMATE.start_subxy_~y_ref~0.base_3)) (<= (+ v_ULTIMATE.start_subxy_~y_ref~0.offset_3 4) (select |v_#length_8| v_ULTIMATE.start_subxy_~y_ref~0.base_3)) (<= 0 v_ULTIMATE.start_subxy_~y_ref~0.offset_3)) InVars {ULTIMATE.start_subxy_~y_ref~0.offset=v_ULTIMATE.start_subxy_~y_ref~0.offset_3, ULTIMATE.start_subxy_~y_ref~0.base=v_ULTIMATE.start_subxy_~y_ref~0.base_3, #valid=|v_#valid_10|, #memory_int=|v_#memory_int_4|, ULTIMATE.start_subxy_~y=v_ULTIMATE.start_subxy_~y_3, #length=|v_#length_8|} OutVars{ULTIMATE.start_subxy_~y_ref~0.offset=v_ULTIMATE.start_subxy_~y_ref~0.offset_3, ULTIMATE.start_subxy_~y_ref~0.base=v_ULTIMATE.start_subxy_~y_ref~0.base_3, #valid=|v_#valid_10|, #memory_int=|v_#memory_int_3|, ULTIMATE.start_subxy_~y=v_ULTIMATE.start_subxy_~y_3, #length=|v_#length_8|} AuxVars[] AssignedVars[#memory_int] 31#L11true [154] L11-->L12: Formula: (and (= (store |v_#memory_int_6| v_ULTIMATE.start_subxy_~z~0.base_3 (store (select |v_#memory_int_6| v_ULTIMATE.start_subxy_~z~0.base_3) v_ULTIMATE.start_subxy_~z~0.offset_3 0)) |v_#memory_int_5|) (= 1 (select |v_#valid_12| v_ULTIMATE.start_subxy_~z~0.base_3)) (<= 0 v_ULTIMATE.start_subxy_~z~0.offset_3) (<= (+ v_ULTIMATE.start_subxy_~z~0.offset_3 4) (select |v_#length_10| v_ULTIMATE.start_subxy_~z~0.base_3))) InVars {#memory_int=|v_#memory_int_6|, ULTIMATE.start_subxy_~z~0.base=v_ULTIMATE.start_subxy_~z~0.base_3, ULTIMATE.start_subxy_~z~0.offset=v_ULTIMATE.start_subxy_~z~0.offset_3, #length=|v_#length_10|, #valid=|v_#valid_12|} OutVars{#memory_int=|v_#memory_int_5|, ULTIMATE.start_subxy_~z~0.base=v_ULTIMATE.start_subxy_~z~0.base_3, ULTIMATE.start_subxy_~z~0.offset=v_ULTIMATE.start_subxy_~z~0.offset_3, #length=|v_#length_10|, #valid=|v_#valid_12|} AuxVars[] AssignedVars[#memory_int] 45#L12true [164] L12-->L13: Formula: (and (<= 0 v_ULTIMATE.start_subxy_~x_ref~0.offset_5) (<= (+ v_ULTIMATE.start_subxy_~x_ref~0.offset_5 4) (select |v_#length_12| v_ULTIMATE.start_subxy_~x_ref~0.base_6)) (= 1 (select |v_#valid_14| v_ULTIMATE.start_subxy_~x_ref~0.base_6)) (= (select (select |v_#memory_int_7| v_ULTIMATE.start_subxy_~x_ref~0.base_6) v_ULTIMATE.start_subxy_~x_ref~0.offset_5) |v_ULTIMATE.start_subxy_#t~mem4_2|)) InVars {#memory_int=|v_#memory_int_7|, ULTIMATE.start_subxy_~x_ref~0.offset=v_ULTIMATE.start_subxy_~x_ref~0.offset_5, #length=|v_#length_12|, ULTIMATE.start_subxy_~x_ref~0.base=v_ULTIMATE.start_subxy_~x_ref~0.base_6, #valid=|v_#valid_14|} OutVars{ULTIMATE.start_subxy_~x_ref~0.offset=v_ULTIMATE.start_subxy_~x_ref~0.offset_5, ULTIMATE.start_subxy_#t~mem4=|v_ULTIMATE.start_subxy_#t~mem4_2|, #valid=|v_#valid_14|, #memory_int=|v_#memory_int_7|, #length=|v_#length_12|, ULTIMATE.start_subxy_~x_ref~0.base=v_ULTIMATE.start_subxy_~x_ref~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_subxy_#t~mem4] 64#L13true [334] L13-->L14: Formula: (and (= (store |v_#memory_int_29| v_ULTIMATE.start_subxy_~i~0.base_24 (store (select |v_#memory_int_29| v_ULTIMATE.start_subxy_~i~0.base_24) v_ULTIMATE.start_subxy_~i~0.offset_17 |v_ULTIMATE.start_subxy_#t~mem4_6|)) |v_#memory_int_28|) (<= 0 v_ULTIMATE.start_subxy_~i~0.offset_17) (<= (+ v_ULTIMATE.start_subxy_~i~0.offset_17 4) (select |v_#length_44| v_ULTIMATE.start_subxy_~i~0.base_24)) (= 1 (select |v_#valid_56| v_ULTIMATE.start_subxy_~i~0.base_24))) InVars {ULTIMATE.start_subxy_~i~0.base=v_ULTIMATE.start_subxy_~i~0.base_24, ULTIMATE.start_subxy_#t~mem4=|v_ULTIMATE.start_subxy_#t~mem4_6|, #valid=|v_#valid_56|, #memory_int=|v_#memory_int_29|, #length=|v_#length_44|, ULTIMATE.start_subxy_~i~0.offset=v_ULTIMATE.start_subxy_~i~0.offset_17} OutVars{ULTIMATE.start_subxy_~i~0.base=v_ULTIMATE.start_subxy_~i~0.base_24, ULTIMATE.start_subxy_#t~mem4=|v_ULTIMATE.start_subxy_#t~mem4_5|, #valid=|v_#valid_56|, #memory_int=|v_#memory_int_28|, #length=|v_#length_44|, ULTIMATE.start_subxy_~i~0.offset=v_ULTIMATE.start_subxy_~i~0.offset_17} AuxVars[] AssignedVars[ULTIMATE.start_subxy_#t~mem4, #memory_int] 20#L14true [139] L14-->L14-1: Formula: (and (= (select (select |v_#memory_int_10| v_ULTIMATE.start_subxy_~y_ref~0.base_6) v_ULTIMATE.start_subxy_~y_ref~0.offset_5) |v_ULTIMATE.start_subxy_#t~mem5_2|) (<= (+ v_ULTIMATE.start_subxy_~y_ref~0.offset_5 4) (select |v_#length_16| v_ULTIMATE.start_subxy_~y_ref~0.base_6)) (<= 0 v_ULTIMATE.start_subxy_~y_ref~0.offset_5) (= 1 (select |v_#valid_18| v_ULTIMATE.start_subxy_~y_ref~0.base_6))) InVars {ULTIMATE.start_subxy_~y_ref~0.offset=v_ULTIMATE.start_subxy_~y_ref~0.offset_5, #memory_int=|v_#memory_int_10|, #length=|v_#length_16|, ULTIMATE.start_subxy_~y_ref~0.base=v_ULTIMATE.start_subxy_~y_ref~0.base_6, #valid=|v_#valid_18|} OutVars{ULTIMATE.start_subxy_~y_ref~0.offset=v_ULTIMATE.start_subxy_~y_ref~0.offset_5, ULTIMATE.start_subxy_~y_ref~0.base=v_ULTIMATE.start_subxy_~y_ref~0.base_6, ULTIMATE.start_subxy_#t~mem5=|v_ULTIMATE.start_subxy_#t~mem5_2|, #valid=|v_#valid_18|, #memory_int=|v_#memory_int_10|, #length=|v_#length_16|} AuxVars[] AssignedVars[ULTIMATE.start_subxy_#t~mem5] 19#L14-1true [279] L14-1-->L14-2: Formula: (and (<= |v_ULTIMATE.start_subxy_#t~mem5_3| 0) |v_ULTIMATE.start_subxy_#t~short7_2|) InVars {ULTIMATE.start_subxy_#t~mem5=|v_ULTIMATE.start_subxy_#t~mem5_3|} OutVars{ULTIMATE.start_subxy_#t~short7=|v_ULTIMATE.start_subxy_#t~short7_2|, ULTIMATE.start_subxy_#t~mem5=|v_ULTIMATE.start_subxy_#t~mem5_3|} AuxVars[] AssignedVars[ULTIMATE.start_subxy_#t~short7] 16#L14-2true [134] L14-2-->L14-6: Formula: |v_ULTIMATE.start_subxy_#t~short7_3| InVars {ULTIMATE.start_subxy_#t~short7=|v_ULTIMATE.start_subxy_#t~short7_3|} OutVars{ULTIMATE.start_subxy_#t~short7=|v_ULTIMATE.start_subxy_#t~short7_3|} AuxVars[] AssignedVars[] 56#L14-6true [180] L14-6-->L17-3: Formula: (not |v_ULTIMATE.start_subxy_#t~short7_9|) InVars {ULTIMATE.start_subxy_#t~short7=|v_ULTIMATE.start_subxy_#t~short7_9|} OutVars{ULTIMATE.start_subxy_#t~short7=|v_ULTIMATE.start_subxy_#t~short7_8|, ULTIMATE.start_subxy_#t~mem6=|v_ULTIMATE.start_subxy_#t~mem6_5|, ULTIMATE.start_subxy_#t~mem5=|v_ULTIMATE.start_subxy_#t~mem5_5|} AuxVars[] AssignedVars[ULTIMATE.start_subxy_#t~mem6, ULTIMATE.start_subxy_#t~mem5, ULTIMATE.start_subxy_#t~short7] 66#L17-3true 48.71/31.66 [2019-03-28 12:43:05,020 INFO L796 eck$LassoCheckResult]: Loop: 66#L17-3true [192] L17-3-->L17-1: Formula: (and (= (select (select |v_#memory_int_12| v_ULTIMATE.start_subxy_~i~0.base_6) v_ULTIMATE.start_subxy_~i~0.offset_5) |v_ULTIMATE.start_subxy_#t~mem8_2|) (= 1 (select |v_#valid_27| v_ULTIMATE.start_subxy_~i~0.base_6)) (<= 0 v_ULTIMATE.start_subxy_~i~0.offset_5) (<= (+ v_ULTIMATE.start_subxy_~i~0.offset_5 4) (select |v_#length_20| v_ULTIMATE.start_subxy_~i~0.base_6))) InVars {ULTIMATE.start_subxy_~i~0.base=v_ULTIMATE.start_subxy_~i~0.base_6, #memory_int=|v_#memory_int_12|, #length=|v_#length_20|, ULTIMATE.start_subxy_~i~0.offset=v_ULTIMATE.start_subxy_~i~0.offset_5, #valid=|v_#valid_27|} OutVars{ULTIMATE.start_subxy_~i~0.base=v_ULTIMATE.start_subxy_~i~0.base_6, #valid=|v_#valid_27|, ULTIMATE.start_subxy_#t~mem8=|v_ULTIMATE.start_subxy_#t~mem8_2|, #memory_int=|v_#memory_int_12|, #length=|v_#length_20|, ULTIMATE.start_subxy_~i~0.offset=v_ULTIMATE.start_subxy_~i~0.offset_5} AuxVars[] AssignedVars[ULTIMATE.start_subxy_#t~mem8] 49#L17-1true [171] L17-1-->L18: Formula: (< 0 |v_ULTIMATE.start_subxy_#t~mem8_6|) InVars {ULTIMATE.start_subxy_#t~mem8=|v_ULTIMATE.start_subxy_#t~mem8_6|} OutVars{ULTIMATE.start_subxy_#t~mem8=|v_ULTIMATE.start_subxy_#t~mem8_5|} AuxVars[] AssignedVars[ULTIMATE.start_subxy_#t~mem8] 6#L18true [337] L18-->L18-2: Formula: (and (= 1 (select |v_#valid_57| v_ULTIMATE.start_subxy_~i~0.base_25)) (<= 0 v_ULTIMATE.start_subxy_~i~0.offset_18) (= |v_ULTIMATE.start_subxy_#t~post10_5| |v_ULTIMATE.start_subxy_#t~mem9_5|) (<= (+ v_ULTIMATE.start_subxy_~i~0.offset_18 4) (select |v_#length_45| v_ULTIMATE.start_subxy_~i~0.base_25)) (= (select (select |v_#memory_int_30| v_ULTIMATE.start_subxy_~i~0.base_25) v_ULTIMATE.start_subxy_~i~0.offset_18) |v_ULTIMATE.start_subxy_#t~mem9_5|)) InVars {ULTIMATE.start_subxy_~i~0.base=v_ULTIMATE.start_subxy_~i~0.base_25, #valid=|v_#valid_57|, #memory_int=|v_#memory_int_30|, #length=|v_#length_45|, ULTIMATE.start_subxy_~i~0.offset=v_ULTIMATE.start_subxy_~i~0.offset_18} OutVars{ULTIMATE.start_subxy_~i~0.base=v_ULTIMATE.start_subxy_~i~0.base_25, ULTIMATE.start_subxy_#t~post10=|v_ULTIMATE.start_subxy_#t~post10_5|, #valid=|v_#valid_57|, #memory_int=|v_#memory_int_30|, #length=|v_#length_45|, ULTIMATE.start_subxy_#t~mem9=|v_ULTIMATE.start_subxy_#t~mem9_5|, ULTIMATE.start_subxy_~i~0.offset=v_ULTIMATE.start_subxy_~i~0.offset_18} AuxVars[] AssignedVars[ULTIMATE.start_subxy_#t~post10, ULTIMATE.start_subxy_#t~mem9] 5#L18-2true [338] L18-2-->L19: Formula: (and (= (select |v_#valid_58| v_ULTIMATE.start_subxy_~i~0.base_26) 1) (= (store |v_#memory_int_32| v_ULTIMATE.start_subxy_~i~0.base_26 (store (select |v_#memory_int_32| v_ULTIMATE.start_subxy_~i~0.base_26) v_ULTIMATE.start_subxy_~i~0.offset_19 (+ |v_ULTIMATE.start_subxy_#t~post10_7| (- 1)))) |v_#memory_int_31|) (<= 0 v_ULTIMATE.start_subxy_~i~0.offset_19) (<= (+ v_ULTIMATE.start_subxy_~i~0.offset_19 4) (select |v_#length_46| v_ULTIMATE.start_subxy_~i~0.base_26))) InVars {ULTIMATE.start_subxy_~i~0.base=v_ULTIMATE.start_subxy_~i~0.base_26, ULTIMATE.start_subxy_#t~post10=|v_ULTIMATE.start_subxy_#t~post10_7|, #valid=|v_#valid_58|, #memory_int=|v_#memory_int_32|, #length=|v_#length_46|, ULTIMATE.start_subxy_~i~0.offset=v_ULTIMATE.start_subxy_~i~0.offset_19} OutVars{ULTIMATE.start_subxy_~i~0.base=v_ULTIMATE.start_subxy_~i~0.base_26, ULTIMATE.start_subxy_#t~post10=|v_ULTIMATE.start_subxy_#t~post10_6|, #valid=|v_#valid_58|, #memory_int=|v_#memory_int_31|, #length=|v_#length_46|, ULTIMATE.start_subxy_#t~mem9=|v_ULTIMATE.start_subxy_#t~mem9_6|, ULTIMATE.start_subxy_~i~0.offset=v_ULTIMATE.start_subxy_~i~0.offset_19} AuxVars[] AssignedVars[ULTIMATE.start_subxy_#t~post10, #memory_int, ULTIMATE.start_subxy_#t~mem9] 26#L19true [341] L19-->L19-2: Formula: (and (<= 0 v_ULTIMATE.start_subxy_~z~0.offset_16) (= |v_ULTIMATE.start_subxy_#t~post12_5| |v_ULTIMATE.start_subxy_#t~mem11_5|) (= (select |v_#valid_62| v_ULTIMATE.start_subxy_~z~0.base_22) 1) (<= (+ v_ULTIMATE.start_subxy_~z~0.offset_16 4) (select |v_#length_49| v_ULTIMATE.start_subxy_~z~0.base_22)) (= (select (select |v_#memory_int_35| v_ULTIMATE.start_subxy_~z~0.base_22) v_ULTIMATE.start_subxy_~z~0.offset_16) |v_ULTIMATE.start_subxy_#t~mem11_5|)) InVars {ULTIMATE.start_subxy_~z~0.base=v_ULTIMATE.start_subxy_~z~0.base_22, ULTIMATE.start_subxy_~z~0.offset=v_ULTIMATE.start_subxy_~z~0.offset_16, #valid=|v_#valid_62|, #memory_int=|v_#memory_int_35|, #length=|v_#length_49|} OutVars{ULTIMATE.start_subxy_#t~post12=|v_ULTIMATE.start_subxy_#t~post12_5|, ULTIMATE.start_subxy_~z~0.base=v_ULTIMATE.start_subxy_~z~0.base_22, ULTIMATE.start_subxy_~z~0.offset=v_ULTIMATE.start_subxy_~z~0.offset_16, #valid=|v_#valid_62|, #memory_int=|v_#memory_int_35|, ULTIMATE.start_subxy_#t~mem11=|v_ULTIMATE.start_subxy_#t~mem11_5|, #length=|v_#length_49|} AuxVars[] AssignedVars[ULTIMATE.start_subxy_#t~post12, ULTIMATE.start_subxy_#t~mem11] 24#L19-2true [343] L19-2-->L17-3: Formula: (and (= 1 (select |v_#valid_64| v_ULTIMATE.start_subxy_~z~0.base_23)) (<= (+ v_ULTIMATE.start_subxy_~z~0.offset_17 4) (select |v_#length_51| v_ULTIMATE.start_subxy_~z~0.base_23)) (<= 0 v_ULTIMATE.start_subxy_~z~0.offset_17) (= (store |v_#memory_int_39| v_ULTIMATE.start_subxy_~z~0.base_23 (store (select |v_#memory_int_39| v_ULTIMATE.start_subxy_~z~0.base_23) v_ULTIMATE.start_subxy_~z~0.offset_17 (+ |v_ULTIMATE.start_subxy_#t~post12_7| 1))) |v_#memory_int_38|)) InVars {ULTIMATE.start_subxy_#t~post12=|v_ULTIMATE.start_subxy_#t~post12_7|, ULTIMATE.start_subxy_~z~0.base=v_ULTIMATE.start_subxy_~z~0.base_23, ULTIMATE.start_subxy_~z~0.offset=v_ULTIMATE.start_subxy_~z~0.offset_17, #valid=|v_#valid_64|, #memory_int=|v_#memory_int_39|, #length=|v_#length_51|} OutVars{ULTIMATE.start_subxy_#t~post12=|v_ULTIMATE.start_subxy_#t~post12_6|, ULTIMATE.start_subxy_~z~0.base=v_ULTIMATE.start_subxy_~z~0.base_23, ULTIMATE.start_subxy_~z~0.offset=v_ULTIMATE.start_subxy_~z~0.offset_17, #valid=|v_#valid_64|, #memory_int=|v_#memory_int_38|, ULTIMATE.start_subxy_#t~mem11=|v_ULTIMATE.start_subxy_#t~mem11_6|, #length=|v_#length_51|} AuxVars[] AssignedVars[ULTIMATE.start_subxy_#t~post12, #memory_int, ULTIMATE.start_subxy_#t~mem11] 66#L17-3true 48.71/31.66 [2019-03-28 12:43:05,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 48.71/31.66 [2019-03-28 12:43:05,021 INFO L82 PathProgramCache]: Analyzing trace with hash -1320144480, now seen corresponding path program 1 times 48.71/31.66 [2019-03-28 12:43:05,021 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 48.71/31.66 [2019-03-28 12:43:05,021 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 48.71/31.66 [2019-03-28 12:43:05,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 48.71/31.66 [2019-03-28 12:43:05,022 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 48.71/31.66 [2019-03-28 12:43:05,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 48.71/31.66 [2019-03-28 12:43:05,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 48.71/31.66 [2019-03-28 12:43:05,049 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 48.71/31.66 [2019-03-28 12:43:05,049 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 48.71/31.66 [2019-03-28 12:43:05,049 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 48.71/31.66 [2019-03-28 12:43:05,050 INFO L799 eck$LassoCheckResult]: stem already infeasible 48.71/31.66 [2019-03-28 12:43:05,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 48.71/31.66 [2019-03-28 12:43:05,050 INFO L82 PathProgramCache]: Analyzing trace with hash -2037336529, now seen corresponding path program 1 times 48.71/31.66 [2019-03-28 12:43:05,051 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 48.71/31.66 [2019-03-28 12:43:05,051 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 48.71/31.66 [2019-03-28 12:43:05,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 48.71/31.66 [2019-03-28 12:43:05,052 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 48.71/31.66 [2019-03-28 12:43:05,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 48.71/31.66 [2019-03-28 12:43:05,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 48.71/31.66 [2019-03-28 12:43:05,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 48.71/31.66 [2019-03-28 12:43:05,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 48.71/31.66 [2019-03-28 12:43:05,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 48.71/31.66 [2019-03-28 12:43:05,169 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 3 states. 48.71/31.66 [2019-03-28 12:43:05,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 48.71/31.66 [2019-03-28 12:43:05,381 INFO L93 Difference]: Finished difference Result 67 states and 123 transitions. 48.71/31.66 [2019-03-28 12:43:05,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 48.71/31.66 [2019-03-28 12:43:05,384 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 67 states and 123 transitions. 48.71/31.66 [2019-03-28 12:43:05,387 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 48.71/31.66 [2019-03-28 12:43:05,387 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 67 states to 26 states and 42 transitions. 48.71/31.66 [2019-03-28 12:43:05,389 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 48.71/31.66 [2019-03-28 12:43:05,389 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 48.71/31.66 [2019-03-28 12:43:05,390 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 42 transitions. 48.71/31.66 [2019-03-28 12:43:05,390 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 48.71/31.66 [2019-03-28 12:43:05,390 INFO L706 BuchiCegarLoop]: Abstraction has 26 states and 42 transitions. 48.71/31.66 [2019-03-28 12:43:05,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 42 transitions. 48.71/31.66 [2019-03-28 12:43:05,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. 48.71/31.66 [2019-03-28 12:43:05,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. 48.71/31.66 [2019-03-28 12:43:05,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 42 transitions. 48.71/31.66 [2019-03-28 12:43:05,393 INFO L729 BuchiCegarLoop]: Abstraction has 26 states and 42 transitions. 48.71/31.66 [2019-03-28 12:43:05,393 INFO L609 BuchiCegarLoop]: Abstraction has 26 states and 42 transitions. 48.71/31.66 [2019-03-28 12:43:05,394 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ 48.71/31.66 [2019-03-28 12:43:05,394 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 42 transitions. 48.71/31.66 [2019-03-28 12:43:05,394 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 48.71/31.66 [2019-03-28 12:43:05,395 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 48.71/31.66 [2019-03-28 12:43:05,395 INFO L119 BuchiIsEmpty]: Starting construction of run 48.71/31.66 [2019-03-28 12:43:05,395 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 48.71/31.66 [2019-03-28 12:43:05,395 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] 48.71/31.66 [2019-03-28 12:43:05,396 INFO L794 eck$LassoCheckResult]: Stem: 166#ULTIMATE.startENTRY [153] ULTIMATE.startENTRY-->L-1: Formula: (and (= |v_#NULL.offset_1| 0) (= |v_#NULL.base_1| 0) (= |v_#valid_1| (store |v_#valid_2| 0 0))) InVars {#valid=|v_#valid_2|} OutVars{#NULL.offset=|v_#NULL.offset_1|, #NULL.base=|v_#NULL.base_1|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid, #NULL.offset, #NULL.base] 146#L-1 [253] L-1-->L10: Formula: (let ((.cse0 (store |v_#valid_7| |v_ULTIMATE.start_subxy_#t~malloc0.base_1| 1))) (let ((.cse1 (store .cse0 |v_ULTIMATE.start_subxy_#t~malloc1.base_1| 1))) (let ((.cse2 (store .cse1 |v_ULTIMATE.start_subxy_#t~malloc2.base_1| 1))) (and (< |v_ULTIMATE.start_subxy_#t~malloc1.base_1| 0) (= 0 |v_ULTIMATE.start_subxy_#t~malloc2.offset_1|) (= v_ULTIMATE.start_subxy_~x_1 |v_ULTIMATE.start_subxy_#in~x_1|) (= v_ULTIMATE.start_subxy_~y_1 |v_ULTIMATE.start_subxy_#in~y_1|) (= |v_#length_1| (store (store (store (store |v_#length_5| |v_ULTIMATE.start_subxy_#t~malloc0.base_1| 4) |v_ULTIMATE.start_subxy_#t~malloc1.base_1| 4) |v_ULTIMATE.start_subxy_#t~malloc2.base_1| 4) |v_ULTIMATE.start_subxy_#t~malloc3.base_1| 4)) (= |v_ULTIMATE.start_subxy_#t~malloc0.offset_1| 0) (= 0 |v_ULTIMATE.start_subxy_#t~malloc1.offset_1|) (= (select .cse0 |v_ULTIMATE.start_subxy_#t~malloc1.base_1|) 0) (= v_ULTIMATE.start_subxy_~x_ref~0.offset_1 |v_ULTIMATE.start_subxy_#t~malloc0.offset_1|) (= v_ULTIMATE.start_subxy_~x_ref~0.base_1 |v_ULTIMATE.start_subxy_#t~malloc0.base_1|) (= 0 (select .cse1 |v_ULTIMATE.start_subxy_#t~malloc2.base_1|)) (< |v_ULTIMATE.start_subxy_#t~malloc2.base_1| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_subxy_~i~0.base_1 |v_ULTIMATE.start_subxy_#t~malloc3.base_1|) (< |v_ULTIMATE.start_subxy_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_subxy_#in~y_1| v_ULTIMATE.start_main_~y~0_1) (= 0 |v_ULTIMATE.start_subxy_#t~malloc3.offset_1|) (= v_ULTIMATE.start_subxy_~y_ref~0.base_1 |v_ULTIMATE.start_subxy_#t~malloc1.base_1|) (> |v_ULTIMATE.start_subxy_#t~malloc2.base_1| 0) (= |v_ULTIMATE.start_subxy_#in~x_1| v_ULTIMATE.start_main_~x~0_1) (= v_ULTIMATE.start_subxy_~z~0.base_1 |v_ULTIMATE.start_subxy_#t~malloc2.base_1|) (= 0 (select .cse2 |v_ULTIMATE.start_subxy_#t~malloc3.base_1|)) (= v_ULTIMATE.start_main_~y~0_1 |v_ULTIMATE.start_main_#t~nondet21_22|) (< |v_ULTIMATE.start_subxy_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_subxy_~y_ref~0.offset_1 |v_ULTIMATE.start_subxy_#t~malloc1.offset_1|) (< |v_ULTIMATE.start_subxy_#t~malloc3.base_1| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_subxy_~i~0.offset_1 |v_ULTIMATE.start_subxy_#t~malloc3.offset_1|) (= v_ULTIMATE.start_main_~x~0_1 |v_ULTIMATE.start_main_#t~nondet20_22|) (< 0 |v_ULTIMATE.start_subxy_#t~malloc0.base_1|) (= (store .cse2 |v_ULTIMATE.start_subxy_#t~malloc3.base_1| 1) |v_#valid_3|) (< 0 |v_ULTIMATE.start_subxy_#t~malloc3.base_1|) (= v_ULTIMATE.start_subxy_~z~0.offset_1 |v_ULTIMATE.start_subxy_#t~malloc2.offset_1|) (= (select |v_#valid_7| |v_ULTIMATE.start_subxy_#t~malloc0.base_1|) 0))))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_5|, #valid=|v_#valid_7|} OutVars{ULTIMATE.start_subxy_~x_ref~0.offset=v_ULTIMATE.start_subxy_~x_ref~0.offset_1, ULTIMATE.start_subxy_#t~malloc2.offset=|v_ULTIMATE.start_subxy_#t~malloc2.offset_1|, ULTIMATE.start_subxy_~y_ref~0.base=v_ULTIMATE.start_subxy_~y_ref~0.base_1, ULTIMATE.start_subxy_#res=|v_ULTIMATE.start_subxy_#res_1|, ULTIMATE.start_subxy_#t~mem8=|v_ULTIMATE.start_subxy_#t~mem8_1|, ULTIMATE.start_subxy_#t~mem9=|v_ULTIMATE.start_subxy_#t~mem9_1|, ULTIMATE.start_subxy_#t~short7=|v_ULTIMATE.start_subxy_#t~short7_1|, ULTIMATE.start_subxy_~y_ref~0.offset=v_ULTIMATE.start_subxy_~y_ref~0.offset_1, ULTIMATE.start_subxy_#t~post12=|v_ULTIMATE.start_subxy_#t~post12_1|, ULTIMATE.start_subxy_~z~0.offset=v_ULTIMATE.start_subxy_~z~0.offset_1, ULTIMATE.start_subxy_#t~mem19=|v_ULTIMATE.start_subxy_#t~mem19_1|, ULTIMATE.start_subxy_#t~post10=|v_ULTIMATE.start_subxy_#t~post10_1|, ULTIMATE.start_subxy_#t~mem14=|v_ULTIMATE.start_subxy_#t~mem14_1|, ULTIMATE.start_subxy_#t~mem15=|v_ULTIMATE.start_subxy_#t~mem15_1|, ULTIMATE.start_main_#t~ret22=|v_ULTIMATE.start_main_#t~ret22_1|, ULTIMATE.start_subxy_#t~mem17=|v_ULTIMATE.start_subxy_#t~mem17_1|, ULTIMATE.start_subxy_#t~mem11=|v_ULTIMATE.start_subxy_#t~mem11_1|, #length=|v_#length_1|, ULTIMATE.start_subxy_#t~mem13=|v_ULTIMATE.start_subxy_#t~mem13_1|, ULTIMATE.start_subxy_~x_ref~0.base=v_ULTIMATE.start_subxy_~x_ref~0.base_1, ULTIMATE.start_subxy_~z~0.base=v_ULTIMATE.start_subxy_~z~0.base_1, ULTIMATE.start_main_#t~nondet21=|v_ULTIMATE.start_main_#t~nondet21_1|, ULTIMATE.start_main_#t~nondet20=|v_ULTIMATE.start_main_#t~nondet20_1|, ULTIMATE.start_subxy_#in~x=|v_ULTIMATE.start_subxy_#in~x_1|, ULTIMATE.start_subxy_#t~malloc2.base=|v_ULTIMATE.start_subxy_#t~malloc2.base_1|, ULTIMATE.start_subxy_#t~malloc0.offset=|v_ULTIMATE.start_subxy_#t~malloc0.offset_1|, ULTIMATE.start_subxy_#t~post18=|v_ULTIMATE.start_subxy_#t~post18_1|, ULTIMATE.start_subxy_#t~post16=|v_ULTIMATE.start_subxy_#t~post16_1|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1, ULTIMATE.start_subxy_#t~malloc0.base=|v_ULTIMATE.start_subxy_#t~malloc0.base_1|, ULTIMATE.start_subxy_#t~malloc1.base=|v_ULTIMATE.start_subxy_#t~malloc1.base_1|, ULTIMATE.start_subxy_#t~malloc3.offset=|v_ULTIMATE.start_subxy_#t~malloc3.offset_1|, ULTIMATE.start_subxy_#t~malloc3.base=|v_ULTIMATE.start_subxy_#t~malloc3.base_1|, ULTIMATE.start_subxy_#in~y=|v_ULTIMATE.start_subxy_#in~y_1|, ULTIMATE.start_subxy_~i~0.base=v_ULTIMATE.start_subxy_~i~0.base_1, ULTIMATE.start_subxy_#t~malloc1.offset=|v_ULTIMATE.start_subxy_#t~malloc1.offset_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_subxy_#t~mem4=|v_ULTIMATE.start_subxy_#t~mem4_1|, ULTIMATE.start_subxy_~x=v_ULTIMATE.start_subxy_~x_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_subxy_#t~mem6=|v_ULTIMATE.start_subxy_#t~mem6_1|, #valid=|v_#valid_3|, ULTIMATE.start_subxy_#t~mem5=|v_ULTIMATE.start_subxy_#t~mem5_1|, ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_1, ULTIMATE.start_subxy_~y=v_ULTIMATE.start_subxy_~y_1, ULTIMATE.start_subxy_~i~0.offset=v_ULTIMATE.start_subxy_~i~0.offset_1} AuxVars[|v_ULTIMATE.start_main_#t~nondet21_22|, |v_ULTIMATE.start_main_#t~nondet20_22|] AssignedVars[ULTIMATE.start_subxy_~x_ref~0.offset, ULTIMATE.start_subxy_#t~malloc2.offset, ULTIMATE.start_subxy_~y_ref~0.base, ULTIMATE.start_subxy_#res, ULTIMATE.start_subxy_#t~mem8, ULTIMATE.start_subxy_#t~mem9, ULTIMATE.start_subxy_#t~short7, ULTIMATE.start_subxy_~y_ref~0.offset, ULTIMATE.start_subxy_#t~post12, ULTIMATE.start_subxy_~z~0.offset, ULTIMATE.start_subxy_#t~mem19, ULTIMATE.start_subxy_#t~post10, ULTIMATE.start_subxy_#t~mem14, ULTIMATE.start_subxy_#t~mem15, ULTIMATE.start_main_#t~ret22, ULTIMATE.start_subxy_#t~mem17, ULTIMATE.start_subxy_#t~mem11, #length, ULTIMATE.start_subxy_#t~mem13, ULTIMATE.start_subxy_~x_ref~0.base, ULTIMATE.start_subxy_~z~0.base, ULTIMATE.start_main_#t~nondet21, ULTIMATE.start_main_#t~nondet20, ULTIMATE.start_subxy_#in~x, ULTIMATE.start_subxy_#t~malloc2.base, ULTIMATE.start_subxy_#t~malloc0.offset, ULTIMATE.start_subxy_#t~post18, ULTIMATE.start_subxy_#t~post16, ULTIMATE.start_main_~x~0, ULTIMATE.start_subxy_#t~malloc0.base, ULTIMATE.start_subxy_#t~malloc1.base, ULTIMATE.start_subxy_#t~malloc3.offset, ULTIMATE.start_subxy_#t~malloc3.base, ULTIMATE.start_subxy_#in~y, ULTIMATE.start_subxy_~i~0.base, ULTIMATE.start_subxy_#t~malloc1.offset, ULTIMATE.start_subxy_#t~mem4, ULTIMATE.start_subxy_~x, ULTIMATE.start_main_#res, ULTIMATE.start_subxy_#t~mem6, #valid, ULTIMATE.start_subxy_#t~mem5, ULTIMATE.start_main_~y~0, ULTIMATE.start_subxy_~y, ULTIMATE.start_subxy_~i~0.offset] 147#L10 [124] L10-->L10-1: Formula: (and (= (select |v_#valid_8| v_ULTIMATE.start_subxy_~x_ref~0.base_3) 1) (<= (+ v_ULTIMATE.start_subxy_~x_ref~0.offset_3 4) (select |v_#length_6| v_ULTIMATE.start_subxy_~x_ref~0.base_3)) (<= 0 v_ULTIMATE.start_subxy_~x_ref~0.offset_3) (= (store |v_#memory_int_2| v_ULTIMATE.start_subxy_~x_ref~0.base_3 (store (select |v_#memory_int_2| v_ULTIMATE.start_subxy_~x_ref~0.base_3) v_ULTIMATE.start_subxy_~x_ref~0.offset_3 v_ULTIMATE.start_subxy_~x_3)) |v_#memory_int_1|)) InVars {ULTIMATE.start_subxy_~x_ref~0.offset=v_ULTIMATE.start_subxy_~x_ref~0.offset_3, ULTIMATE.start_subxy_~x=v_ULTIMATE.start_subxy_~x_3, #valid=|v_#valid_8|, #memory_int=|v_#memory_int_2|, #length=|v_#length_6|, ULTIMATE.start_subxy_~x_ref~0.base=v_ULTIMATE.start_subxy_~x_ref~0.base_3} OutVars{ULTIMATE.start_subxy_~x_ref~0.offset=v_ULTIMATE.start_subxy_~x_ref~0.offset_3, ULTIMATE.start_subxy_~x=v_ULTIMATE.start_subxy_~x_3, #valid=|v_#valid_8|, #memory_int=|v_#memory_int_1|, #length=|v_#length_6|, ULTIMATE.start_subxy_~x_ref~0.base=v_ULTIMATE.start_subxy_~x_ref~0.base_3} AuxVars[] AssignedVars[#memory_int] 148#L10-1 [181] L10-1-->L11: Formula: (and (= |v_#memory_int_3| (store |v_#memory_int_4| v_ULTIMATE.start_subxy_~y_ref~0.base_3 (store (select |v_#memory_int_4| v_ULTIMATE.start_subxy_~y_ref~0.base_3) v_ULTIMATE.start_subxy_~y_ref~0.offset_3 v_ULTIMATE.start_subxy_~y_3))) (= 1 (select |v_#valid_10| v_ULTIMATE.start_subxy_~y_ref~0.base_3)) (<= (+ v_ULTIMATE.start_subxy_~y_ref~0.offset_3 4) (select |v_#length_8| v_ULTIMATE.start_subxy_~y_ref~0.base_3)) (<= 0 v_ULTIMATE.start_subxy_~y_ref~0.offset_3)) InVars {ULTIMATE.start_subxy_~y_ref~0.offset=v_ULTIMATE.start_subxy_~y_ref~0.offset_3, ULTIMATE.start_subxy_~y_ref~0.base=v_ULTIMATE.start_subxy_~y_ref~0.base_3, #valid=|v_#valid_10|, #memory_int=|v_#memory_int_4|, ULTIMATE.start_subxy_~y=v_ULTIMATE.start_subxy_~y_3, #length=|v_#length_8|} OutVars{ULTIMATE.start_subxy_~y_ref~0.offset=v_ULTIMATE.start_subxy_~y_ref~0.offset_3, ULTIMATE.start_subxy_~y_ref~0.base=v_ULTIMATE.start_subxy_~y_ref~0.base_3, #valid=|v_#valid_10|, #memory_int=|v_#memory_int_3|, ULTIMATE.start_subxy_~y=v_ULTIMATE.start_subxy_~y_3, #length=|v_#length_8|} AuxVars[] AssignedVars[#memory_int] 164#L11 [154] L11-->L12: Formula: (and (= (store |v_#memory_int_6| v_ULTIMATE.start_subxy_~z~0.base_3 (store (select |v_#memory_int_6| v_ULTIMATE.start_subxy_~z~0.base_3) v_ULTIMATE.start_subxy_~z~0.offset_3 0)) |v_#memory_int_5|) (= 1 (select |v_#valid_12| v_ULTIMATE.start_subxy_~z~0.base_3)) (<= 0 v_ULTIMATE.start_subxy_~z~0.offset_3) (<= (+ v_ULTIMATE.start_subxy_~z~0.offset_3 4) (select |v_#length_10| v_ULTIMATE.start_subxy_~z~0.base_3))) InVars {#memory_int=|v_#memory_int_6|, ULTIMATE.start_subxy_~z~0.base=v_ULTIMATE.start_subxy_~z~0.base_3, ULTIMATE.start_subxy_~z~0.offset=v_ULTIMATE.start_subxy_~z~0.offset_3, #length=|v_#length_10|, #valid=|v_#valid_12|} OutVars{#memory_int=|v_#memory_int_5|, ULTIMATE.start_subxy_~z~0.base=v_ULTIMATE.start_subxy_~z~0.base_3, ULTIMATE.start_subxy_~z~0.offset=v_ULTIMATE.start_subxy_~z~0.offset_3, #length=|v_#length_10|, #valid=|v_#valid_12|} AuxVars[] AssignedVars[#memory_int] 155#L12 [164] L12-->L13: Formula: (and (<= 0 v_ULTIMATE.start_subxy_~x_ref~0.offset_5) (<= (+ v_ULTIMATE.start_subxy_~x_ref~0.offset_5 4) (select |v_#length_12| v_ULTIMATE.start_subxy_~x_ref~0.base_6)) (= 1 (select |v_#valid_14| v_ULTIMATE.start_subxy_~x_ref~0.base_6)) (= (select (select |v_#memory_int_7| v_ULTIMATE.start_subxy_~x_ref~0.base_6) v_ULTIMATE.start_subxy_~x_ref~0.offset_5) |v_ULTIMATE.start_subxy_#t~mem4_2|)) InVars {#memory_int=|v_#memory_int_7|, ULTIMATE.start_subxy_~x_ref~0.offset=v_ULTIMATE.start_subxy_~x_ref~0.offset_5, #length=|v_#length_12|, ULTIMATE.start_subxy_~x_ref~0.base=v_ULTIMATE.start_subxy_~x_ref~0.base_6, #valid=|v_#valid_14|} OutVars{ULTIMATE.start_subxy_~x_ref~0.offset=v_ULTIMATE.start_subxy_~x_ref~0.offset_5, ULTIMATE.start_subxy_#t~mem4=|v_ULTIMATE.start_subxy_#t~mem4_2|, #valid=|v_#valid_14|, #memory_int=|v_#memory_int_7|, #length=|v_#length_12|, ULTIMATE.start_subxy_~x_ref~0.base=v_ULTIMATE.start_subxy_~x_ref~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_subxy_#t~mem4] 156#L13 [334] L13-->L14: Formula: (and (= (store |v_#memory_int_29| v_ULTIMATE.start_subxy_~i~0.base_24 (store (select |v_#memory_int_29| v_ULTIMATE.start_subxy_~i~0.base_24) v_ULTIMATE.start_subxy_~i~0.offset_17 |v_ULTIMATE.start_subxy_#t~mem4_6|)) |v_#memory_int_28|) (<= 0 v_ULTIMATE.start_subxy_~i~0.offset_17) (<= (+ v_ULTIMATE.start_subxy_~i~0.offset_17 4) (select |v_#length_44| v_ULTIMATE.start_subxy_~i~0.base_24)) (= 1 (select |v_#valid_56| v_ULTIMATE.start_subxy_~i~0.base_24))) InVars {ULTIMATE.start_subxy_~i~0.base=v_ULTIMATE.start_subxy_~i~0.base_24, ULTIMATE.start_subxy_#t~mem4=|v_ULTIMATE.start_subxy_#t~mem4_6|, #valid=|v_#valid_56|, #memory_int=|v_#memory_int_29|, #length=|v_#length_44|, ULTIMATE.start_subxy_~i~0.offset=v_ULTIMATE.start_subxy_~i~0.offset_17} OutVars{ULTIMATE.start_subxy_~i~0.base=v_ULTIMATE.start_subxy_~i~0.base_24, ULTIMATE.start_subxy_#t~mem4=|v_ULTIMATE.start_subxy_#t~mem4_5|, #valid=|v_#valid_56|, #memory_int=|v_#memory_int_28|, #length=|v_#length_44|, ULTIMATE.start_subxy_~i~0.offset=v_ULTIMATE.start_subxy_~i~0.offset_17} AuxVars[] AssignedVars[ULTIMATE.start_subxy_#t~mem4, #memory_int] 159#L14 [139] L14-->L14-1: Formula: (and (= (select (select |v_#memory_int_10| v_ULTIMATE.start_subxy_~y_ref~0.base_6) v_ULTIMATE.start_subxy_~y_ref~0.offset_5) |v_ULTIMATE.start_subxy_#t~mem5_2|) (<= (+ v_ULTIMATE.start_subxy_~y_ref~0.offset_5 4) (select |v_#length_16| v_ULTIMATE.start_subxy_~y_ref~0.base_6)) (<= 0 v_ULTIMATE.start_subxy_~y_ref~0.offset_5) (= 1 (select |v_#valid_18| v_ULTIMATE.start_subxy_~y_ref~0.base_6))) InVars {ULTIMATE.start_subxy_~y_ref~0.offset=v_ULTIMATE.start_subxy_~y_ref~0.offset_5, #memory_int=|v_#memory_int_10|, #length=|v_#length_16|, ULTIMATE.start_subxy_~y_ref~0.base=v_ULTIMATE.start_subxy_~y_ref~0.base_6, #valid=|v_#valid_18|} OutVars{ULTIMATE.start_subxy_~y_ref~0.offset=v_ULTIMATE.start_subxy_~y_ref~0.offset_5, ULTIMATE.start_subxy_~y_ref~0.base=v_ULTIMATE.start_subxy_~y_ref~0.base_6, ULTIMATE.start_subxy_#t~mem5=|v_ULTIMATE.start_subxy_#t~mem5_2|, #valid=|v_#valid_18|, #memory_int=|v_#memory_int_10|, #length=|v_#length_16|} AuxVars[] AssignedVars[ULTIMATE.start_subxy_#t~mem5] 158#L14-1 [278] L14-1-->L14-2: Formula: (and (not |v_ULTIMATE.start_subxy_#t~short7_2|) (> |v_ULTIMATE.start_subxy_#t~mem5_3| 0)) InVars {ULTIMATE.start_subxy_#t~mem5=|v_ULTIMATE.start_subxy_#t~mem5_3|} OutVars{ULTIMATE.start_subxy_#t~short7=|v_ULTIMATE.start_subxy_#t~short7_2|, ULTIMATE.start_subxy_#t~mem5=|v_ULTIMATE.start_subxy_#t~mem5_3|} AuxVars[] AssignedVars[ULTIMATE.start_subxy_#t~short7] 157#L14-2 [135] L14-2-->L14-4: Formula: (not |v_ULTIMATE.start_subxy_#t~short7_4|) InVars {ULTIMATE.start_subxy_#t~short7=|v_ULTIMATE.start_subxy_#t~short7_4|} OutVars{ULTIMATE.start_subxy_#t~short7=|v_ULTIMATE.start_subxy_#t~short7_4|} AuxVars[] AssignedVars[] 149#L14-4 [127] L14-4-->L14-5: Formula: (and (= |v_ULTIMATE.start_subxy_#t~mem6_2| (select (select |v_#memory_int_11| v_ULTIMATE.start_subxy_~x_ref~0.base_9) v_ULTIMATE.start_subxy_~x_ref~0.offset_7)) (<= (+ v_ULTIMATE.start_subxy_~x_ref~0.offset_7 4) (select |v_#length_18| v_ULTIMATE.start_subxy_~x_ref~0.base_9)) (= 1 (select |v_#valid_20| v_ULTIMATE.start_subxy_~x_ref~0.base_9)) (<= 0 v_ULTIMATE.start_subxy_~x_ref~0.offset_7)) InVars {#memory_int=|v_#memory_int_11|, ULTIMATE.start_subxy_~x_ref~0.offset=v_ULTIMATE.start_subxy_~x_ref~0.offset_7, #length=|v_#length_18|, ULTIMATE.start_subxy_~x_ref~0.base=v_ULTIMATE.start_subxy_~x_ref~0.base_9, #valid=|v_#valid_20|} OutVars{ULTIMATE.start_subxy_~x_ref~0.offset=v_ULTIMATE.start_subxy_~x_ref~0.offset_7, ULTIMATE.start_subxy_#t~mem6=|v_ULTIMATE.start_subxy_#t~mem6_2|, #valid=|v_#valid_20|, #memory_int=|v_#memory_int_11|, #length=|v_#length_18|, ULTIMATE.start_subxy_~x_ref~0.base=v_ULTIMATE.start_subxy_~x_ref~0.base_9} AuxVars[] AssignedVars[ULTIMATE.start_subxy_#t~mem6] 150#L14-5 [288] L14-5-->L14-6: Formula: (and (not |v_ULTIMATE.start_subxy_#t~short7_5|) (> |v_ULTIMATE.start_subxy_#t~mem6_3| 0)) InVars {ULTIMATE.start_subxy_#t~mem6=|v_ULTIMATE.start_subxy_#t~mem6_3|} OutVars{ULTIMATE.start_subxy_#t~short7=|v_ULTIMATE.start_subxy_#t~short7_5|, ULTIMATE.start_subxy_#t~mem6=|v_ULTIMATE.start_subxy_#t~mem6_3|} AuxVars[] AssignedVars[ULTIMATE.start_subxy_#t~short7] 163#L14-6 [180] L14-6-->L17-3: Formula: (not |v_ULTIMATE.start_subxy_#t~short7_9|) InVars {ULTIMATE.start_subxy_#t~short7=|v_ULTIMATE.start_subxy_#t~short7_9|} OutVars{ULTIMATE.start_subxy_#t~short7=|v_ULTIMATE.start_subxy_#t~short7_8|, ULTIMATE.start_subxy_#t~mem6=|v_ULTIMATE.start_subxy_#t~mem6_5|, ULTIMATE.start_subxy_#t~mem5=|v_ULTIMATE.start_subxy_#t~mem5_5|} AuxVars[] AssignedVars[ULTIMATE.start_subxy_#t~mem6, ULTIMATE.start_subxy_#t~mem5, ULTIMATE.start_subxy_#t~short7] 162#L17-3 48.71/31.66 [2019-03-28 12:43:05,397 INFO L796 eck$LassoCheckResult]: Loop: 162#L17-3 [192] L17-3-->L17-1: Formula: (and (= (select (select |v_#memory_int_12| v_ULTIMATE.start_subxy_~i~0.base_6) v_ULTIMATE.start_subxy_~i~0.offset_5) |v_ULTIMATE.start_subxy_#t~mem8_2|) (= 1 (select |v_#valid_27| v_ULTIMATE.start_subxy_~i~0.base_6)) (<= 0 v_ULTIMATE.start_subxy_~i~0.offset_5) (<= (+ v_ULTIMATE.start_subxy_~i~0.offset_5 4) (select |v_#length_20| v_ULTIMATE.start_subxy_~i~0.base_6))) InVars {ULTIMATE.start_subxy_~i~0.base=v_ULTIMATE.start_subxy_~i~0.base_6, #memory_int=|v_#memory_int_12|, #length=|v_#length_20|, ULTIMATE.start_subxy_~i~0.offset=v_ULTIMATE.start_subxy_~i~0.offset_5, #valid=|v_#valid_27|} OutVars{ULTIMATE.start_subxy_~i~0.base=v_ULTIMATE.start_subxy_~i~0.base_6, #valid=|v_#valid_27|, ULTIMATE.start_subxy_#t~mem8=|v_ULTIMATE.start_subxy_#t~mem8_2|, #memory_int=|v_#memory_int_12|, #length=|v_#length_20|, ULTIMATE.start_subxy_~i~0.offset=v_ULTIMATE.start_subxy_~i~0.offset_5} AuxVars[] AssignedVars[ULTIMATE.start_subxy_#t~mem8] 160#L17-1 [171] L17-1-->L18: Formula: (< 0 |v_ULTIMATE.start_subxy_#t~mem8_6|) InVars {ULTIMATE.start_subxy_#t~mem8=|v_ULTIMATE.start_subxy_#t~mem8_6|} OutVars{ULTIMATE.start_subxy_#t~mem8=|v_ULTIMATE.start_subxy_#t~mem8_5|} AuxVars[] AssignedVars[ULTIMATE.start_subxy_#t~mem8] 143#L18 [337] L18-->L18-2: Formula: (and (= 1 (select |v_#valid_57| v_ULTIMATE.start_subxy_~i~0.base_25)) (<= 0 v_ULTIMATE.start_subxy_~i~0.offset_18) (= |v_ULTIMATE.start_subxy_#t~post10_5| |v_ULTIMATE.start_subxy_#t~mem9_5|) (<= (+ v_ULTIMATE.start_subxy_~i~0.offset_18 4) (select |v_#length_45| v_ULTIMATE.start_subxy_~i~0.base_25)) (= (select (select |v_#memory_int_30| v_ULTIMATE.start_subxy_~i~0.base_25) v_ULTIMATE.start_subxy_~i~0.offset_18) |v_ULTIMATE.start_subxy_#t~mem9_5|)) InVars {ULTIMATE.start_subxy_~i~0.base=v_ULTIMATE.start_subxy_~i~0.base_25, #valid=|v_#valid_57|, #memory_int=|v_#memory_int_30|, #length=|v_#length_45|, ULTIMATE.start_subxy_~i~0.offset=v_ULTIMATE.start_subxy_~i~0.offset_18} OutVars{ULTIMATE.start_subxy_~i~0.base=v_ULTIMATE.start_subxy_~i~0.base_25, ULTIMATE.start_subxy_#t~post10=|v_ULTIMATE.start_subxy_#t~post10_5|, #valid=|v_#valid_57|, #memory_int=|v_#memory_int_30|, #length=|v_#length_45|, ULTIMATE.start_subxy_#t~mem9=|v_ULTIMATE.start_subxy_#t~mem9_5|, ULTIMATE.start_subxy_~i~0.offset=v_ULTIMATE.start_subxy_~i~0.offset_18} AuxVars[] AssignedVars[ULTIMATE.start_subxy_#t~post10, ULTIMATE.start_subxy_#t~mem9] 141#L18-2 [338] L18-2-->L19: Formula: (and (= (select |v_#valid_58| v_ULTIMATE.start_subxy_~i~0.base_26) 1) (= (store |v_#memory_int_32| v_ULTIMATE.start_subxy_~i~0.base_26 (store (select |v_#memory_int_32| v_ULTIMATE.start_subxy_~i~0.base_26) v_ULTIMATE.start_subxy_~i~0.offset_19 (+ |v_ULTIMATE.start_subxy_#t~post10_7| (- 1)))) |v_#memory_int_31|) (<= 0 v_ULTIMATE.start_subxy_~i~0.offset_19) (<= (+ v_ULTIMATE.start_subxy_~i~0.offset_19 4) (select |v_#length_46| v_ULTIMATE.start_subxy_~i~0.base_26))) InVars {ULTIMATE.start_subxy_~i~0.base=v_ULTIMATE.start_subxy_~i~0.base_26, ULTIMATE.start_subxy_#t~post10=|v_ULTIMATE.start_subxy_#t~post10_7|, #valid=|v_#valid_58|, #memory_int=|v_#memory_int_32|, #length=|v_#length_46|, ULTIMATE.start_subxy_~i~0.offset=v_ULTIMATE.start_subxy_~i~0.offset_19} OutVars{ULTIMATE.start_subxy_~i~0.base=v_ULTIMATE.start_subxy_~i~0.base_26, ULTIMATE.start_subxy_#t~post10=|v_ULTIMATE.start_subxy_#t~post10_6|, #valid=|v_#valid_58|, #memory_int=|v_#memory_int_31|, #length=|v_#length_46|, ULTIMATE.start_subxy_#t~mem9=|v_ULTIMATE.start_subxy_#t~mem9_6|, ULTIMATE.start_subxy_~i~0.offset=v_ULTIMATE.start_subxy_~i~0.offset_19} AuxVars[] AssignedVars[ULTIMATE.start_subxy_#t~post10, #memory_int, ULTIMATE.start_subxy_#t~mem9] 142#L19 [341] L19-->L19-2: Formula: (and (<= 0 v_ULTIMATE.start_subxy_~z~0.offset_16) (= |v_ULTIMATE.start_subxy_#t~post12_5| |v_ULTIMATE.start_subxy_#t~mem11_5|) (= (select |v_#valid_62| v_ULTIMATE.start_subxy_~z~0.base_22) 1) (<= (+ v_ULTIMATE.start_subxy_~z~0.offset_16 4) (select |v_#length_49| v_ULTIMATE.start_subxy_~z~0.base_22)) (= (select (select |v_#memory_int_35| v_ULTIMATE.start_subxy_~z~0.base_22) v_ULTIMATE.start_subxy_~z~0.offset_16) |v_ULTIMATE.start_subxy_#t~mem11_5|)) InVars {ULTIMATE.start_subxy_~z~0.base=v_ULTIMATE.start_subxy_~z~0.base_22, ULTIMATE.start_subxy_~z~0.offset=v_ULTIMATE.start_subxy_~z~0.offset_16, #valid=|v_#valid_62|, #memory_int=|v_#memory_int_35|, #length=|v_#length_49|} OutVars{ULTIMATE.start_subxy_#t~post12=|v_ULTIMATE.start_subxy_#t~post12_5|, ULTIMATE.start_subxy_~z~0.base=v_ULTIMATE.start_subxy_~z~0.base_22, ULTIMATE.start_subxy_~z~0.offset=v_ULTIMATE.start_subxy_~z~0.offset_16, #valid=|v_#valid_62|, #memory_int=|v_#memory_int_35|, ULTIMATE.start_subxy_#t~mem11=|v_ULTIMATE.start_subxy_#t~mem11_5|, #length=|v_#length_49|} AuxVars[] AssignedVars[ULTIMATE.start_subxy_#t~post12, ULTIMATE.start_subxy_#t~mem11] 161#L19-2 [343] L19-2-->L17-3: Formula: (and (= 1 (select |v_#valid_64| v_ULTIMATE.start_subxy_~z~0.base_23)) (<= (+ v_ULTIMATE.start_subxy_~z~0.offset_17 4) (select |v_#length_51| v_ULTIMATE.start_subxy_~z~0.base_23)) (<= 0 v_ULTIMATE.start_subxy_~z~0.offset_17) (= (store |v_#memory_int_39| v_ULTIMATE.start_subxy_~z~0.base_23 (store (select |v_#memory_int_39| v_ULTIMATE.start_subxy_~z~0.base_23) v_ULTIMATE.start_subxy_~z~0.offset_17 (+ |v_ULTIMATE.start_subxy_#t~post12_7| 1))) |v_#memory_int_38|)) InVars {ULTIMATE.start_subxy_#t~post12=|v_ULTIMATE.start_subxy_#t~post12_7|, ULTIMATE.start_subxy_~z~0.base=v_ULTIMATE.start_subxy_~z~0.base_23, ULTIMATE.start_subxy_~z~0.offset=v_ULTIMATE.start_subxy_~z~0.offset_17, #valid=|v_#valid_64|, #memory_int=|v_#memory_int_39|, #length=|v_#length_51|} OutVars{ULTIMATE.start_subxy_#t~post12=|v_ULTIMATE.start_subxy_#t~post12_6|, ULTIMATE.start_subxy_~z~0.base=v_ULTIMATE.start_subxy_~z~0.base_23, ULTIMATE.start_subxy_~z~0.offset=v_ULTIMATE.start_subxy_~z~0.offset_17, #valid=|v_#valid_64|, #memory_int=|v_#memory_int_38|, ULTIMATE.start_subxy_#t~mem11=|v_ULTIMATE.start_subxy_#t~mem11_6|, #length=|v_#length_51|} AuxVars[] AssignedVars[ULTIMATE.start_subxy_#t~post12, #memory_int, ULTIMATE.start_subxy_#t~mem11] 162#L17-3 48.71/31.66 [2019-03-28 12:43:05,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 48.71/31.66 [2019-03-28 12:43:05,397 INFO L82 PathProgramCache]: Analyzing trace with hash -1644428515, now seen corresponding path program 1 times 48.71/31.66 [2019-03-28 12:43:05,398 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 48.71/31.66 [2019-03-28 12:43:05,398 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 48.71/31.66 [2019-03-28 12:43:05,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 48.71/31.66 [2019-03-28 12:43:05,399 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 48.71/31.66 [2019-03-28 12:43:05,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 48.71/31.66 [2019-03-28 12:43:05,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 48.71/31.66 [2019-03-28 12:43:05,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 48.71/31.66 [2019-03-28 12:43:05,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 48.71/31.66 [2019-03-28 12:43:05,438 INFO L82 PathProgramCache]: Analyzing trace with hash -2037336529, now seen corresponding path program 2 times 48.71/31.66 [2019-03-28 12:43:05,438 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 48.71/31.66 [2019-03-28 12:43:05,438 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 48.71/31.66 [2019-03-28 12:43:05,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 48.71/31.66 [2019-03-28 12:43:05,439 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 48.71/31.66 [2019-03-28 12:43:05,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 48.71/31.66 [2019-03-28 12:43:05,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 48.71/31.66 [2019-03-28 12:43:05,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 48.71/31.66 [2019-03-28 12:43:05,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 48.71/31.66 [2019-03-28 12:43:05,450 INFO L82 PathProgramCache]: Analyzing trace with hash 862778443, now seen corresponding path program 1 times 48.71/31.66 [2019-03-28 12:43:05,450 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 48.71/31.66 [2019-03-28 12:43:05,451 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 48.71/31.66 [2019-03-28 12:43:05,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 48.71/31.66 [2019-03-28 12:43:05,452 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 48.71/31.66 [2019-03-28 12:43:05,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 48.71/31.66 [2019-03-28 12:43:05,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 48.71/31.66 [2019-03-28 12:43:05,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 48.71/31.66 [2019-03-28 12:43:06,141 WARN L188 SmtUtils]: Spent 578.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 125 48.71/31.66 [2019-03-28 12:43:06,377 WARN L188 SmtUtils]: Spent 220.00 ms on a formula simplification that was a NOOP. DAG size: 103 48.71/31.66 [2019-03-28 12:43:06,392 INFO L216 LassoAnalysis]: Preferences: 48.71/31.66 [2019-03-28 12:43:06,393 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 48.71/31.66 [2019-03-28 12:43:06,393 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 48.71/31.66 [2019-03-28 12:43:06,393 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 48.71/31.66 [2019-03-28 12:43:06,393 INFO L127 ssoRankerPreferences]: Use exernal solver: false 48.71/31.66 [2019-03-28 12:43:06,393 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 48.71/31.66 [2019-03-28 12:43:06,393 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 48.71/31.66 [2019-03-28 12:43:06,394 INFO L130 ssoRankerPreferences]: Path of dumped script: 48.71/31.66 [2019-03-28 12:43:06,394 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration2_Lasso 48.71/31.66 [2019-03-28 12:43:06,394 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 48.71/31.66 [2019-03-28 12:43:06,394 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 48.71/31.66 [2019-03-28 12:43:06,413 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 48.71/31.66 [2019-03-28 12:43:06,419 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 48.71/31.66 [2019-03-28 12:43:06,421 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 48.71/31.66 [2019-03-28 12:43:06,422 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 48.71/31.66 [2019-03-28 12:43:06,431 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 48.71/31.66 [2019-03-28 12:43:06,432 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 48.71/31.66 [2019-03-28 12:43:06,434 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 48.71/31.66 [2019-03-28 12:43:06,436 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 48.71/31.66 [2019-03-28 12:43:06,440 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 48.71/31.66 [2019-03-28 12:43:06,441 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 48.71/31.66 [2019-03-28 12:43:06,443 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 48.71/31.66 [2019-03-28 12:43:06,445 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 48.71/31.66 [2019-03-28 12:43:06,447 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 48.71/31.66 [2019-03-28 12:43:06,448 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 48.71/31.66 [2019-03-28 12:43:06,450 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 48.71/31.66 [2019-03-28 12:43:06,452 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 48.71/31.66 [2019-03-28 12:43:06,454 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 48.71/31.66 [2019-03-28 12:43:06,456 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 48.71/31.66 [2019-03-28 12:43:06,457 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 48.71/31.66 [2019-03-28 12:43:06,459 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 48.71/31.66 [2019-03-28 12:43:06,891 WARN L188 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 86 48.71/31.66 [2019-03-28 12:43:06,979 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 48.71/31.66 [2019-03-28 12:43:06,981 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 48.71/31.66 [2019-03-28 12:43:06,983 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 48.71/31.66 [2019-03-28 12:43:06,984 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 48.71/31.66 [2019-03-28 12:43:07,422 INFO L300 LassoAnalysis]: Preprocessing complete. 48.71/31.66 [2019-03-28 12:43:07,427 INFO L497 LassoAnalysis]: Using template 'affine'. 48.71/31.66 [2019-03-28 12:43:07,444 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 48.71/31.66 Termination analysis: LINEAR_WITH_GUESSES 48.71/31.66 Number of strict supporting invariants: 0 48.71/31.66 Number of non-strict supporting invariants: 1 48.71/31.66 Consider only non-deceasing supporting invariants: true 48.71/31.66 Simplify termination arguments: true 48.71/31.66 Simplify supporting invariants: trueOverapproximate stem: false 48.71/31.66 [2019-03-28 12:43:07,446 INFO L339 nArgumentSynthesizer]: Template has degree 0. 48.71/31.66 [2019-03-28 12:43:07,446 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 48.71/31.66 [2019-03-28 12:43:07,446 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 48.71/31.66 [2019-03-28 12:43:07,447 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 48.71/31.66 [2019-03-28 12:43:07,447 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 48.71/31.66 [2019-03-28 12:43:07,449 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 48.71/31.66 [2019-03-28 12:43:07,449 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 48.71/31.66 [2019-03-28 12:43:07,451 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 48.71/31.66 [2019-03-28 12:43:07,451 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 48.71/31.66 Termination analysis: LINEAR_WITH_GUESSES 48.71/31.66 Number of strict supporting invariants: 0 48.71/31.66 Number of non-strict supporting invariants: 1 48.71/31.66 Consider only non-deceasing supporting invariants: true 48.71/31.66 Simplify termination arguments: true 48.71/31.66 Simplify supporting invariants: trueOverapproximate stem: false 48.71/31.66 [2019-03-28 12:43:07,452 INFO L339 nArgumentSynthesizer]: Template has degree 0. 48.71/31.66 [2019-03-28 12:43:07,452 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 48.71/31.66 [2019-03-28 12:43:07,452 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 48.71/31.66 [2019-03-28 12:43:07,452 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 48.71/31.66 [2019-03-28 12:43:07,453 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 48.71/31.66 [2019-03-28 12:43:07,453 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 48.71/31.66 [2019-03-28 12:43:07,453 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 48.71/31.66 [2019-03-28 12:43:07,454 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 48.71/31.66 [2019-03-28 12:43:07,454 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 48.71/31.66 Termination analysis: LINEAR_WITH_GUESSES 48.71/31.66 Number of strict supporting invariants: 0 48.71/31.66 Number of non-strict supporting invariants: 1 48.71/31.66 Consider only non-deceasing supporting invariants: true 48.71/31.66 Simplify termination arguments: true 48.71/31.66 Simplify supporting invariants: trueOverapproximate stem: false 48.71/31.66 [2019-03-28 12:43:07,455 INFO L339 nArgumentSynthesizer]: Template has degree 0. 48.71/31.66 [2019-03-28 12:43:07,455 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 48.71/31.66 [2019-03-28 12:43:07,455 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 48.71/31.66 [2019-03-28 12:43:07,455 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 48.71/31.66 [2019-03-28 12:43:07,455 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 48.71/31.66 [2019-03-28 12:43:07,456 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 48.71/31.66 [2019-03-28 12:43:07,456 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 48.71/31.66 [2019-03-28 12:43:07,457 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 48.71/31.66 [2019-03-28 12:43:07,457 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 48.71/31.66 Termination analysis: LINEAR_WITH_GUESSES 48.71/31.66 Number of strict supporting invariants: 0 48.71/31.66 Number of non-strict supporting invariants: 1 48.71/31.66 Consider only non-deceasing supporting invariants: true 48.71/31.66 Simplify termination arguments: true 48.71/31.66 Simplify supporting invariants: trueOverapproximate stem: false 48.71/31.66 [2019-03-28 12:43:07,457 INFO L339 nArgumentSynthesizer]: Template has degree 0. 48.71/31.66 [2019-03-28 12:43:07,458 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 48.71/31.66 [2019-03-28 12:43:07,458 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 48.71/31.66 [2019-03-28 12:43:07,458 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 48.71/31.66 [2019-03-28 12:43:07,458 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 48.71/31.66 [2019-03-28 12:43:07,458 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 48.71/31.66 [2019-03-28 12:43:07,459 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 48.71/31.66 [2019-03-28 12:43:07,459 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 48.71/31.66 [2019-03-28 12:43:07,459 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 48.71/31.66 Termination analysis: LINEAR_WITH_GUESSES 48.71/31.66 Number of strict supporting invariants: 0 48.71/31.66 Number of non-strict supporting invariants: 1 48.71/31.66 Consider only non-deceasing supporting invariants: true 48.71/31.66 Simplify termination arguments: true 48.71/31.66 Simplify supporting invariants: trueOverapproximate stem: false 48.71/31.66 [2019-03-28 12:43:07,460 INFO L339 nArgumentSynthesizer]: Template has degree 0. 48.71/31.66 [2019-03-28 12:43:07,460 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 48.71/31.66 [2019-03-28 12:43:07,460 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 48.71/31.66 [2019-03-28 12:43:07,460 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 48.71/31.66 [2019-03-28 12:43:07,460 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 48.71/31.66 [2019-03-28 12:43:07,461 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 48.71/31.66 [2019-03-28 12:43:07,461 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 48.71/31.66 [2019-03-28 12:43:07,462 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 48.71/31.66 [2019-03-28 12:43:07,462 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 48.71/31.66 Termination analysis: LINEAR_WITH_GUESSES 48.71/31.66 Number of strict supporting invariants: 0 48.71/31.66 Number of non-strict supporting invariants: 1 48.71/31.66 Consider only non-deceasing supporting invariants: true 48.71/31.66 Simplify termination arguments: true 48.71/31.66 Simplify supporting invariants: trueOverapproximate stem: false 48.71/31.66 [2019-03-28 12:43:07,462 INFO L339 nArgumentSynthesizer]: Template has degree 0. 48.71/31.66 [2019-03-28 12:43:07,462 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 48.71/31.66 [2019-03-28 12:43:07,463 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 48.71/31.66 [2019-03-28 12:43:07,463 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 48.71/31.66 [2019-03-28 12:43:07,463 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 48.71/31.66 [2019-03-28 12:43:07,463 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 48.71/31.66 [2019-03-28 12:43:07,463 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 48.71/31.66 [2019-03-28 12:43:07,464 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 48.71/31.66 [2019-03-28 12:43:07,464 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 48.71/31.66 Termination analysis: LINEAR_WITH_GUESSES 48.71/31.66 Number of strict supporting invariants: 0 48.71/31.66 Number of non-strict supporting invariants: 1 48.71/31.66 Consider only non-deceasing supporting invariants: true 48.71/31.66 Simplify termination arguments: true 48.71/31.66 Simplify supporting invariants: trueOverapproximate stem: false 48.71/31.66 [2019-03-28 12:43:07,464 INFO L339 nArgumentSynthesizer]: Template has degree 0. 48.71/31.66 [2019-03-28 12:43:07,465 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 48.71/31.66 [2019-03-28 12:43:07,465 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 48.71/31.66 [2019-03-28 12:43:07,465 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 48.71/31.66 [2019-03-28 12:43:07,465 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 48.71/31.66 [2019-03-28 12:43:07,465 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 48.71/31.66 [2019-03-28 12:43:07,466 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 48.71/31.66 [2019-03-28 12:43:07,466 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 48.71/31.66 [2019-03-28 12:43:07,466 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 48.71/31.66 Termination analysis: LINEAR_WITH_GUESSES 48.71/31.66 Number of strict supporting invariants: 0 48.71/31.66 Number of non-strict supporting invariants: 1 48.71/31.66 Consider only non-deceasing supporting invariants: true 48.71/31.66 Simplify termination arguments: true 48.71/31.66 Simplify supporting invariants: trueOverapproximate stem: false 48.71/31.66 [2019-03-28 12:43:07,467 INFO L339 nArgumentSynthesizer]: Template has degree 0. 48.71/31.66 [2019-03-28 12:43:07,467 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 48.71/31.66 [2019-03-28 12:43:07,467 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 48.71/31.66 [2019-03-28 12:43:07,467 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 48.71/31.66 [2019-03-28 12:43:07,470 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 48.71/31.66 [2019-03-28 12:43:07,470 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 48.71/31.66 [2019-03-28 12:43:07,473 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 48.71/31.66 [2019-03-28 12:43:07,473 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 48.71/31.66 Termination analysis: LINEAR_WITH_GUESSES 48.71/31.66 Number of strict supporting invariants: 0 48.71/31.66 Number of non-strict supporting invariants: 1 48.71/31.66 Consider only non-deceasing supporting invariants: true 48.71/31.66 Simplify termination arguments: true 48.71/31.66 Simplify supporting invariants: trueOverapproximate stem: false 48.71/31.66 [2019-03-28 12:43:07,474 INFO L339 nArgumentSynthesizer]: Template has degree 0. 48.71/31.66 [2019-03-28 12:43:07,474 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 48.71/31.66 [2019-03-28 12:43:07,474 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 48.71/31.66 [2019-03-28 12:43:07,474 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 48.71/31.66 [2019-03-28 12:43:07,475 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 48.71/31.66 [2019-03-28 12:43:07,475 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 48.71/31.66 [2019-03-28 12:43:07,475 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 48.71/31.66 [2019-03-28 12:43:07,476 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 48.71/31.66 [2019-03-28 12:43:07,476 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 48.71/31.66 Termination analysis: LINEAR_WITH_GUESSES 48.71/31.66 Number of strict supporting invariants: 0 48.71/31.66 Number of non-strict supporting invariants: 1 48.71/31.66 Consider only non-deceasing supporting invariants: true 48.71/31.66 Simplify termination arguments: true 48.71/31.66 Simplify supporting invariants: trueOverapproximate stem: false 48.71/31.66 [2019-03-28 12:43:07,476 INFO L339 nArgumentSynthesizer]: Template has degree 0. 48.71/31.66 [2019-03-28 12:43:07,477 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 48.71/31.66 [2019-03-28 12:43:07,477 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 48.71/31.66 [2019-03-28 12:43:07,477 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 48.71/31.66 [2019-03-28 12:43:07,477 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 48.71/31.66 [2019-03-28 12:43:07,477 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 48.71/31.66 [2019-03-28 12:43:07,478 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 48.71/31.66 [2019-03-28 12:43:07,478 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 48.71/31.66 [2019-03-28 12:43:07,478 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 48.71/31.66 Termination analysis: LINEAR_WITH_GUESSES 48.71/31.66 Number of strict supporting invariants: 0 48.71/31.66 Number of non-strict supporting invariants: 1 48.71/31.66 Consider only non-deceasing supporting invariants: true 48.71/31.66 Simplify termination arguments: true 48.71/31.66 Simplify supporting invariants: trueOverapproximate stem: false 48.71/31.66 [2019-03-28 12:43:07,479 INFO L339 nArgumentSynthesizer]: Template has degree 0. 48.71/31.66 [2019-03-28 12:43:07,479 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 48.71/31.66 [2019-03-28 12:43:07,479 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 48.71/31.66 [2019-03-28 12:43:07,479 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 48.71/31.66 [2019-03-28 12:43:07,479 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 48.71/31.66 [2019-03-28 12:43:07,480 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 48.71/31.66 [2019-03-28 12:43:07,480 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 48.71/31.66 [2019-03-28 12:43:07,481 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 48.71/31.66 [2019-03-28 12:43:07,481 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 48.71/31.66 Termination analysis: LINEAR_WITH_GUESSES 48.71/31.66 Number of strict supporting invariants: 0 48.71/31.66 Number of non-strict supporting invariants: 1 48.71/31.66 Consider only non-deceasing supporting invariants: true 48.71/31.66 Simplify termination arguments: true 48.71/31.66 Simplify supporting invariants: trueOverapproximate stem: false 48.71/31.66 [2019-03-28 12:43:07,481 INFO L339 nArgumentSynthesizer]: Template has degree 0. 48.71/31.66 [2019-03-28 12:43:07,481 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 48.71/31.66 [2019-03-28 12:43:07,482 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 48.71/31.66 [2019-03-28 12:43:07,482 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 48.71/31.66 [2019-03-28 12:43:07,482 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 48.71/31.66 [2019-03-28 12:43:07,482 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 48.71/31.66 [2019-03-28 12:43:07,482 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 48.71/31.66 [2019-03-28 12:43:07,483 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 48.71/31.66 [2019-03-28 12:43:07,483 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 48.71/31.66 Termination analysis: LINEAR_WITH_GUESSES 48.71/31.66 Number of strict supporting invariants: 0 48.71/31.66 Number of non-strict supporting invariants: 1 48.71/31.66 Consider only non-deceasing supporting invariants: true 48.71/31.66 Simplify termination arguments: true 48.71/31.66 Simplify supporting invariants: trueOverapproximate stem: false 48.71/31.66 [2019-03-28 12:43:07,484 INFO L339 nArgumentSynthesizer]: Template has degree 0. 48.71/31.66 [2019-03-28 12:43:07,484 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 48.71/31.66 [2019-03-28 12:43:07,484 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 48.71/31.66 [2019-03-28 12:43:07,484 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 48.71/31.66 [2019-03-28 12:43:07,484 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 48.71/31.66 [2019-03-28 12:43:07,485 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 48.71/31.66 [2019-03-28 12:43:07,485 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 48.71/31.66 [2019-03-28 12:43:07,485 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 48.71/31.66 [2019-03-28 12:43:07,486 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 48.71/31.66 Termination analysis: LINEAR_WITH_GUESSES 48.71/31.66 Number of strict supporting invariants: 0 48.71/31.66 Number of non-strict supporting invariants: 1 48.71/31.66 Consider only non-deceasing supporting invariants: true 48.71/31.66 Simplify termination arguments: true 48.71/31.66 Simplify supporting invariants: trueOverapproximate stem: false 48.71/31.66 [2019-03-28 12:43:07,486 INFO L339 nArgumentSynthesizer]: Template has degree 0. 48.71/31.66 [2019-03-28 12:43:07,486 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 48.71/31.66 [2019-03-28 12:43:07,486 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 48.71/31.66 [2019-03-28 12:43:07,486 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 48.71/31.66 [2019-03-28 12:43:07,488 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 48.71/31.66 [2019-03-28 12:43:07,488 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 48.71/31.66 [2019-03-28 12:43:07,490 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 48.71/31.66 [2019-03-28 12:43:07,491 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 48.71/31.66 Termination analysis: LINEAR_WITH_GUESSES 48.71/31.66 Number of strict supporting invariants: 0 48.71/31.66 Number of non-strict supporting invariants: 1 48.71/31.66 Consider only non-deceasing supporting invariants: true 48.71/31.66 Simplify termination arguments: true 48.71/31.66 Simplify supporting invariants: trueOverapproximate stem: false 48.71/31.66 [2019-03-28 12:43:07,491 INFO L339 nArgumentSynthesizer]: Template has degree 0. 48.71/31.66 [2019-03-28 12:43:07,491 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 48.71/31.66 [2019-03-28 12:43:07,491 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 48.71/31.66 [2019-03-28 12:43:07,491 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 48.71/31.66 [2019-03-28 12:43:07,492 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 48.71/31.66 [2019-03-28 12:43:07,492 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 48.71/31.66 [2019-03-28 12:43:07,492 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 48.71/31.66 [2019-03-28 12:43:07,493 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 48.71/31.66 [2019-03-28 12:43:07,493 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 48.71/31.66 Termination analysis: LINEAR_WITH_GUESSES 48.71/31.66 Number of strict supporting invariants: 0 48.71/31.66 Number of non-strict supporting invariants: 1 48.71/31.66 Consider only non-deceasing supporting invariants: true 48.71/31.66 Simplify termination arguments: true 48.71/31.66 Simplify supporting invariants: trueOverapproximate stem: false 48.71/31.66 [2019-03-28 12:43:07,493 INFO L339 nArgumentSynthesizer]: Template has degree 0. 48.71/31.66 [2019-03-28 12:43:07,494 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 48.71/31.66 [2019-03-28 12:43:07,494 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 48.71/31.66 [2019-03-28 12:43:07,494 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 48.71/31.66 [2019-03-28 12:43:07,494 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 48.71/31.66 [2019-03-28 12:43:07,494 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 48.71/31.66 [2019-03-28 12:43:07,495 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 48.71/31.66 [2019-03-28 12:43:07,495 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 48.71/31.66 [2019-03-28 12:43:07,496 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 48.71/31.66 Termination analysis: LINEAR_WITH_GUESSES 48.71/31.66 Number of strict supporting invariants: 0 48.71/31.66 Number of non-strict supporting invariants: 1 48.71/31.66 Consider only non-deceasing supporting invariants: true 48.71/31.66 Simplify termination arguments: true 48.71/31.66 Simplify supporting invariants: trueOverapproximate stem: false 48.71/31.66 [2019-03-28 12:43:07,496 INFO L339 nArgumentSynthesizer]: Template has degree 0. 48.71/31.66 [2019-03-28 12:43:07,496 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 48.71/31.66 [2019-03-28 12:43:07,496 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 48.71/31.66 [2019-03-28 12:43:07,496 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 48.71/31.66 [2019-03-28 12:43:07,497 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 48.71/31.66 [2019-03-28 12:43:07,497 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 48.71/31.66 [2019-03-28 12:43:07,497 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 48.71/31.66 [2019-03-28 12:43:07,498 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 48.71/31.66 [2019-03-28 12:43:07,498 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 48.71/31.66 Termination analysis: LINEAR_WITH_GUESSES 48.71/31.66 Number of strict supporting invariants: 0 48.71/31.66 Number of non-strict supporting invariants: 1 48.71/31.66 Consider only non-deceasing supporting invariants: true 48.71/31.66 Simplify termination arguments: true 48.71/31.66 Simplify supporting invariants: trueOverapproximate stem: false 48.71/31.66 [2019-03-28 12:43:07,498 INFO L339 nArgumentSynthesizer]: Template has degree 0. 48.71/31.66 [2019-03-28 12:43:07,499 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 48.71/31.66 [2019-03-28 12:43:07,499 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 48.71/31.66 [2019-03-28 12:43:07,499 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 48.71/31.66 [2019-03-28 12:43:07,499 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 48.71/31.66 [2019-03-28 12:43:07,499 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 48.71/31.66 [2019-03-28 12:43:07,500 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 48.71/31.66 [2019-03-28 12:43:07,500 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 48.71/31.66 [2019-03-28 12:43:07,501 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 48.71/31.66 Termination analysis: LINEAR_WITH_GUESSES 48.71/31.66 Number of strict supporting invariants: 0 48.71/31.66 Number of non-strict supporting invariants: 1 48.71/31.66 Consider only non-deceasing supporting invariants: true 48.71/31.66 Simplify termination arguments: true 48.71/31.66 Simplify supporting invariants: trueOverapproximate stem: false 48.71/31.66 [2019-03-28 12:43:07,501 INFO L339 nArgumentSynthesizer]: Template has degree 0. 48.71/31.66 [2019-03-28 12:43:07,501 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 48.71/31.66 [2019-03-28 12:43:07,501 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 48.71/31.66 [2019-03-28 12:43:07,501 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 48.71/31.66 [2019-03-28 12:43:07,502 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 48.71/31.66 [2019-03-28 12:43:07,502 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 48.71/31.66 [2019-03-28 12:43:07,502 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 48.71/31.66 [2019-03-28 12:43:07,503 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 48.71/31.66 [2019-03-28 12:43:07,503 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 48.71/31.66 Termination analysis: LINEAR_WITH_GUESSES 48.71/31.66 Number of strict supporting invariants: 0 48.71/31.66 Number of non-strict supporting invariants: 1 48.71/31.66 Consider only non-deceasing supporting invariants: true 48.71/31.66 Simplify termination arguments: true 48.71/31.66 Simplify supporting invariants: trueOverapproximate stem: false 48.71/31.66 [2019-03-28 12:43:07,503 INFO L339 nArgumentSynthesizer]: Template has degree 0. 48.71/31.66 [2019-03-28 12:43:07,504 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 48.71/31.66 [2019-03-28 12:43:07,504 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 48.71/31.66 [2019-03-28 12:43:07,504 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 48.71/31.66 [2019-03-28 12:43:07,509 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 48.71/31.66 [2019-03-28 12:43:07,509 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 48.71/31.66 [2019-03-28 12:43:07,532 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 48.71/31.66 [2019-03-28 12:43:07,533 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 48.71/31.66 Termination analysis: LINEAR_WITH_GUESSES 48.71/31.66 Number of strict supporting invariants: 0 48.71/31.66 Number of non-strict supporting invariants: 1 48.71/31.66 Consider only non-deceasing supporting invariants: true 48.71/31.66 Simplify termination arguments: true 48.71/31.66 Simplify supporting invariants: trueOverapproximate stem: false 48.71/31.66 [2019-03-28 12:43:07,533 INFO L339 nArgumentSynthesizer]: Template has degree 0. 48.71/31.66 [2019-03-28 12:43:07,534 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 48.71/31.66 [2019-03-28 12:43:07,534 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 48.71/31.66 [2019-03-28 12:43:07,534 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 48.71/31.66 [2019-03-28 12:43:07,537 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 48.71/31.66 [2019-03-28 12:43:07,537 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 48.71/31.66 [2019-03-28 12:43:07,547 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 48.71/31.66 [2019-03-28 12:43:07,548 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 48.71/31.66 Termination analysis: LINEAR_WITH_GUESSES 48.71/31.66 Number of strict supporting invariants: 0 48.71/31.66 Number of non-strict supporting invariants: 1 48.71/31.66 Consider only non-deceasing supporting invariants: true 48.71/31.66 Simplify termination arguments: true 48.71/31.66 Simplify supporting invariants: trueOverapproximate stem: false 48.71/31.66 [2019-03-28 12:43:07,548 INFO L339 nArgumentSynthesizer]: Template has degree 0. 48.71/31.66 [2019-03-28 12:43:07,548 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 48.71/31.66 [2019-03-28 12:43:07,548 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 48.71/31.66 [2019-03-28 12:43:07,548 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 48.71/31.66 [2019-03-28 12:43:07,550 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 48.71/31.66 [2019-03-28 12:43:07,550 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 48.71/31.66 [2019-03-28 12:43:07,556 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 48.71/31.66 [2019-03-28 12:43:07,557 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 48.71/31.66 Termination analysis: LINEAR_WITH_GUESSES 48.71/31.66 Number of strict supporting invariants: 0 48.71/31.66 Number of non-strict supporting invariants: 1 48.71/31.66 Consider only non-deceasing supporting invariants: true 48.71/31.66 Simplify termination arguments: true 48.71/31.66 Simplify supporting invariants: trueOverapproximate stem: false 48.71/31.66 [2019-03-28 12:43:07,557 INFO L339 nArgumentSynthesizer]: Template has degree 0. 48.71/31.66 [2019-03-28 12:43:07,557 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 48.71/31.66 [2019-03-28 12:43:07,557 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 48.71/31.66 [2019-03-28 12:43:07,557 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 48.71/31.66 [2019-03-28 12:43:07,559 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 48.71/31.66 [2019-03-28 12:43:07,559 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 48.71/31.66 [2019-03-28 12:43:07,562 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 48.71/31.66 [2019-03-28 12:43:07,562 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 48.71/31.66 Termination analysis: LINEAR_WITH_GUESSES 48.71/31.66 Number of strict supporting invariants: 0 48.71/31.66 Number of non-strict supporting invariants: 1 48.71/31.66 Consider only non-deceasing supporting invariants: true 48.71/31.66 Simplify termination arguments: true 48.71/31.66 Simplify supporting invariants: trueOverapproximate stem: false 48.71/31.66 [2019-03-28 12:43:07,562 INFO L339 nArgumentSynthesizer]: Template has degree 0. 48.71/31.66 [2019-03-28 12:43:07,563 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 48.71/31.66 [2019-03-28 12:43:07,563 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 48.71/31.66 [2019-03-28 12:43:07,563 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 48.71/31.66 [2019-03-28 12:43:07,564 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 48.71/31.66 [2019-03-28 12:43:07,564 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 48.71/31.66 [2019-03-28 12:43:07,567 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 48.71/31.66 [2019-03-28 12:43:07,567 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 48.71/31.66 Termination analysis: LINEAR_WITH_GUESSES 48.71/31.66 Number of strict supporting invariants: 0 48.71/31.66 Number of non-strict supporting invariants: 1 48.71/31.66 Consider only non-deceasing supporting invariants: true 48.71/31.66 Simplify termination arguments: true 48.71/31.66 Simplify supporting invariants: trueOverapproximate stem: false 48.71/31.66 [2019-03-28 12:43:07,568 INFO L339 nArgumentSynthesizer]: Template has degree 0. 48.71/31.66 [2019-03-28 12:43:07,568 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 48.71/31.66 [2019-03-28 12:43:07,568 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 48.71/31.66 [2019-03-28 12:43:07,568 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 48.71/31.66 [2019-03-28 12:43:07,569 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 48.71/31.66 [2019-03-28 12:43:07,569 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 48.71/31.66 [2019-03-28 12:43:07,572 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 48.71/31.66 [2019-03-28 12:43:07,573 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 48.71/31.66 Termination analysis: LINEAR_WITH_GUESSES 48.71/31.66 Number of strict supporting invariants: 0 48.71/31.66 Number of non-strict supporting invariants: 1 48.71/31.66 Consider only non-deceasing supporting invariants: true 48.71/31.66 Simplify termination arguments: true 48.71/31.66 Simplify supporting invariants: trueOverapproximate stem: false 48.71/31.66 [2019-03-28 12:43:07,573 INFO L339 nArgumentSynthesizer]: Template has degree 0. 48.71/31.66 [2019-03-28 12:43:07,573 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 48.71/31.66 [2019-03-28 12:43:07,573 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 48.71/31.66 [2019-03-28 12:43:07,574 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 48.71/31.66 [2019-03-28 12:43:07,576 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 48.71/31.66 [2019-03-28 12:43:07,576 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 48.71/31.66 [2019-03-28 12:43:07,588 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 48.71/31.66 [2019-03-28 12:43:07,599 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. 48.71/31.66 [2019-03-28 12:43:07,600 INFO L444 ModelExtractionUtils]: 13 out of 19 variables were initially zero. Simplification set additionally 4 variables to zero. 48.71/31.66 [2019-03-28 12:43:07,602 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 48.71/31.66 [2019-03-28 12:43:07,604 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. 48.71/31.66 [2019-03-28 12:43:07,604 INFO L518 LassoAnalysis]: Proved termination. 48.71/31.66 [2019-03-28 12:43:07,604 INFO L520 LassoAnalysis]: Termination argument consisting of: 48.71/31.66 Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_subxy_~i~0.base) ULTIMATE.start_subxy_~i~0.offset)_1) = 1*v_rep(select (select #memory_int ULTIMATE.start_subxy_~i~0.base) ULTIMATE.start_subxy_~i~0.offset)_1 48.71/31.66 Supporting invariants [] 48.71/31.66 [2019-03-28 12:43:07,719 INFO L297 tatePredicateManager]: 30 out of 32 supporting invariants were superfluous and have been removed 48.71/31.66 [2019-03-28 12:43:07,725 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 48.71/31.66 [2019-03-28 12:43:07,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 48.71/31.66 [2019-03-28 12:43:07,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 48.71/31.66 [2019-03-28 12:43:07,772 INFO L256 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 8 conjunts are in the unsatisfiable core 48.71/31.66 [2019-03-28 12:43:07,774 INFO L279 TraceCheckSpWp]: Computing forward predicates... 48.71/31.66 [2019-03-28 12:43:07,813 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 48.71/31.66 [2019-03-28 12:43:07,814 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 48.71/31.66 [2019-03-28 12:43:07,825 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 48.71/31.66 [2019-03-28 12:43:07,827 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. 48.71/31.66 [2019-03-28 12:43:07,827 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:9 48.71/31.66 [2019-03-28 12:43:07,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 48.71/31.66 [2019-03-28 12:43:07,839 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 11 conjunts are in the unsatisfiable core 48.71/31.66 [2019-03-28 12:43:07,840 INFO L279 TraceCheckSpWp]: Computing forward predicates... 48.71/31.66 [2019-03-28 12:43:07,914 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 35 treesize of output 19 48.71/31.66 [2019-03-28 12:43:07,915 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 48.71/31.66 [2019-03-28 12:43:07,934 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 48.71/31.66 [2019-03-28 12:43:07,935 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 48.71/31.66 [2019-03-28 12:43:07,935 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:42, output treesize:20 48.71/31.66 [2019-03-28 12:43:07,957 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 48.71/31.66 [2019-03-28 12:43:08,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 48.71/31.66 [2019-03-28 12:43:08,074 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 48.71/31.66 [2019-03-28 12:43:08,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 48.71/31.66 [2019-03-28 12:43:08,083 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 11 conjunts are in the unsatisfiable core 48.71/31.66 [2019-03-28 12:43:08,083 INFO L279 TraceCheckSpWp]: Computing forward predicates... 48.71/31.66 [2019-03-28 12:43:08,090 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 21 treesize of output 20 48.71/31.66 [2019-03-28 12:43:08,091 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 48.71/31.66 [2019-03-28 12:43:08,099 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 48.71/31.66 [2019-03-28 12:43:08,099 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 48.71/31.66 [2019-03-28 12:43:08,100 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:15 48.71/31.66 [2019-03-28 12:43:08,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 48.71/31.66 [2019-03-28 12:43:08,115 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 11 conjunts are in the unsatisfiable core 48.71/31.66 [2019-03-28 12:43:08,116 INFO L279 TraceCheckSpWp]: Computing forward predicates... 48.71/31.66 [2019-03-28 12:43:08,122 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 21 treesize of output 20 48.71/31.66 [2019-03-28 12:43:08,122 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 48.71/31.66 [2019-03-28 12:43:08,132 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 48.71/31.66 [2019-03-28 12:43:08,133 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 48.71/31.66 [2019-03-28 12:43:08,133 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:15 48.71/31.66 [2019-03-28 12:43:08,148 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 35 treesize of output 19 48.71/31.66 [2019-03-28 12:43:08,148 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 48.71/31.66 [2019-03-28 12:43:08,160 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 48.71/31.66 [2019-03-28 12:43:08,161 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 48.71/31.66 [2019-03-28 12:43:08,161 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:42, output treesize:20 48.71/31.66 [2019-03-28 12:43:08,162 INFO L98 LoopCannibalizer]: 8 predicates before loop cannibalization 8 predicates after loop cannibalization 48.71/31.66 [2019-03-28 12:43:08,166 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.3 stem predicates 8 loop predicates 48.71/31.66 [2019-03-28 12:43:08,167 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 26 states and 42 transitions. cyclomatic complexity: 18 Second operand 7 states. 48.71/31.66 [2019-03-28 12:43:08,417 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 26 states and 42 transitions. cyclomatic complexity: 18. Second operand 7 states. Result 50 states and 69 transitions. Complement of second has 13 states. 48.71/31.66 [2019-03-28 12:43:08,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 2 stem states 5 non-accepting loop states 1 accepting loop states 48.71/31.66 [2019-03-28 12:43:08,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. 48.71/31.66 [2019-03-28 12:43:08,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 63 transitions. 48.71/31.66 [2019-03-28 12:43:08,419 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 63 transitions. Stem has 13 letters. Loop has 6 letters. 48.71/31.66 [2019-03-28 12:43:08,420 INFO L116 BuchiAccepts]: Finished buchiAccepts. 48.71/31.66 [2019-03-28 12:43:08,420 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 63 transitions. Stem has 19 letters. Loop has 6 letters. 48.71/31.66 [2019-03-28 12:43:08,421 INFO L116 BuchiAccepts]: Finished buchiAccepts. 48.71/31.66 [2019-03-28 12:43:08,421 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 63 transitions. Stem has 13 letters. Loop has 12 letters. 48.71/31.66 [2019-03-28 12:43:08,422 INFO L116 BuchiAccepts]: Finished buchiAccepts. 48.71/31.66 [2019-03-28 12:43:08,434 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 50 states and 69 transitions. 48.71/31.66 [2019-03-28 12:43:08,436 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 48.71/31.66 [2019-03-28 12:43:08,436 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 50 states to 36 states and 53 transitions. 48.71/31.66 [2019-03-28 12:43:08,437 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 48.71/31.66 [2019-03-28 12:43:08,437 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 48.71/31.66 [2019-03-28 12:43:08,437 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 53 transitions. 48.71/31.66 [2019-03-28 12:43:08,437 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 48.71/31.66 [2019-03-28 12:43:08,437 INFO L706 BuchiCegarLoop]: Abstraction has 36 states and 53 transitions. 48.71/31.66 [2019-03-28 12:43:08,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 53 transitions. 48.71/31.66 [2019-03-28 12:43:08,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 30. 48.71/31.66 [2019-03-28 12:43:08,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. 48.71/31.66 [2019-03-28 12:43:08,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 47 transitions. 48.71/31.66 [2019-03-28 12:43:08,439 INFO L729 BuchiCegarLoop]: Abstraction has 30 states and 47 transitions. 48.71/31.66 [2019-03-28 12:43:08,440 INFO L609 BuchiCegarLoop]: Abstraction has 30 states and 47 transitions. 48.71/31.66 [2019-03-28 12:43:08,440 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ 48.71/31.66 [2019-03-28 12:43:08,440 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 47 transitions. 48.71/31.66 [2019-03-28 12:43:08,440 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 48.71/31.66 [2019-03-28 12:43:08,441 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 48.71/31.66 [2019-03-28 12:43:08,441 INFO L119 BuchiIsEmpty]: Starting construction of run 48.71/31.66 [2019-03-28 12:43:08,441 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 48.71/31.66 [2019-03-28 12:43:08,441 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] 48.71/31.66 [2019-03-28 12:43:08,442 INFO L794 eck$LassoCheckResult]: Stem: 511#ULTIMATE.startENTRY [153] ULTIMATE.startENTRY-->L-1: Formula: (and (= |v_#NULL.offset_1| 0) (= |v_#NULL.base_1| 0) (= |v_#valid_1| (store |v_#valid_2| 0 0))) InVars {#valid=|v_#valid_2|} OutVars{#NULL.offset=|v_#NULL.offset_1|, #NULL.base=|v_#NULL.base_1|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid, #NULL.offset, #NULL.base] 487#L-1 [253] L-1-->L10: Formula: (let ((.cse0 (store |v_#valid_7| |v_ULTIMATE.start_subxy_#t~malloc0.base_1| 1))) (let ((.cse1 (store .cse0 |v_ULTIMATE.start_subxy_#t~malloc1.base_1| 1))) (let ((.cse2 (store .cse1 |v_ULTIMATE.start_subxy_#t~malloc2.base_1| 1))) (and (< |v_ULTIMATE.start_subxy_#t~malloc1.base_1| 0) (= 0 |v_ULTIMATE.start_subxy_#t~malloc2.offset_1|) (= v_ULTIMATE.start_subxy_~x_1 |v_ULTIMATE.start_subxy_#in~x_1|) (= v_ULTIMATE.start_subxy_~y_1 |v_ULTIMATE.start_subxy_#in~y_1|) (= |v_#length_1| (store (store (store (store |v_#length_5| |v_ULTIMATE.start_subxy_#t~malloc0.base_1| 4) |v_ULTIMATE.start_subxy_#t~malloc1.base_1| 4) |v_ULTIMATE.start_subxy_#t~malloc2.base_1| 4) |v_ULTIMATE.start_subxy_#t~malloc3.base_1| 4)) (= |v_ULTIMATE.start_subxy_#t~malloc0.offset_1| 0) (= 0 |v_ULTIMATE.start_subxy_#t~malloc1.offset_1|) (= (select .cse0 |v_ULTIMATE.start_subxy_#t~malloc1.base_1|) 0) (= v_ULTIMATE.start_subxy_~x_ref~0.offset_1 |v_ULTIMATE.start_subxy_#t~malloc0.offset_1|) (= v_ULTIMATE.start_subxy_~x_ref~0.base_1 |v_ULTIMATE.start_subxy_#t~malloc0.base_1|) (= 0 (select .cse1 |v_ULTIMATE.start_subxy_#t~malloc2.base_1|)) (< |v_ULTIMATE.start_subxy_#t~malloc2.base_1| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_subxy_~i~0.base_1 |v_ULTIMATE.start_subxy_#t~malloc3.base_1|) (< |v_ULTIMATE.start_subxy_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_subxy_#in~y_1| v_ULTIMATE.start_main_~y~0_1) (= 0 |v_ULTIMATE.start_subxy_#t~malloc3.offset_1|) (= v_ULTIMATE.start_subxy_~y_ref~0.base_1 |v_ULTIMATE.start_subxy_#t~malloc1.base_1|) (> |v_ULTIMATE.start_subxy_#t~malloc2.base_1| 0) (= |v_ULTIMATE.start_subxy_#in~x_1| v_ULTIMATE.start_main_~x~0_1) (= v_ULTIMATE.start_subxy_~z~0.base_1 |v_ULTIMATE.start_subxy_#t~malloc2.base_1|) (= 0 (select .cse2 |v_ULTIMATE.start_subxy_#t~malloc3.base_1|)) (= v_ULTIMATE.start_main_~y~0_1 |v_ULTIMATE.start_main_#t~nondet21_22|) (< |v_ULTIMATE.start_subxy_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_subxy_~y_ref~0.offset_1 |v_ULTIMATE.start_subxy_#t~malloc1.offset_1|) (< |v_ULTIMATE.start_subxy_#t~malloc3.base_1| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_subxy_~i~0.offset_1 |v_ULTIMATE.start_subxy_#t~malloc3.offset_1|) (= v_ULTIMATE.start_main_~x~0_1 |v_ULTIMATE.start_main_#t~nondet20_22|) (< 0 |v_ULTIMATE.start_subxy_#t~malloc0.base_1|) (= (store .cse2 |v_ULTIMATE.start_subxy_#t~malloc3.base_1| 1) |v_#valid_3|) (< 0 |v_ULTIMATE.start_subxy_#t~malloc3.base_1|) (= v_ULTIMATE.start_subxy_~z~0.offset_1 |v_ULTIMATE.start_subxy_#t~malloc2.offset_1|) (= (select |v_#valid_7| |v_ULTIMATE.start_subxy_#t~malloc0.base_1|) 0))))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_5|, #valid=|v_#valid_7|} OutVars{ULTIMATE.start_subxy_~x_ref~0.offset=v_ULTIMATE.start_subxy_~x_ref~0.offset_1, ULTIMATE.start_subxy_#t~malloc2.offset=|v_ULTIMATE.start_subxy_#t~malloc2.offset_1|, ULTIMATE.start_subxy_~y_ref~0.base=v_ULTIMATE.start_subxy_~y_ref~0.base_1, ULTIMATE.start_subxy_#res=|v_ULTIMATE.start_subxy_#res_1|, ULTIMATE.start_subxy_#t~mem8=|v_ULTIMATE.start_subxy_#t~mem8_1|, ULTIMATE.start_subxy_#t~mem9=|v_ULTIMATE.start_subxy_#t~mem9_1|, ULTIMATE.start_subxy_#t~short7=|v_ULTIMATE.start_subxy_#t~short7_1|, ULTIMATE.start_subxy_~y_ref~0.offset=v_ULTIMATE.start_subxy_~y_ref~0.offset_1, ULTIMATE.start_subxy_#t~post12=|v_ULTIMATE.start_subxy_#t~post12_1|, ULTIMATE.start_subxy_~z~0.offset=v_ULTIMATE.start_subxy_~z~0.offset_1, ULTIMATE.start_subxy_#t~mem19=|v_ULTIMATE.start_subxy_#t~mem19_1|, ULTIMATE.start_subxy_#t~post10=|v_ULTIMATE.start_subxy_#t~post10_1|, ULTIMATE.start_subxy_#t~mem14=|v_ULTIMATE.start_subxy_#t~mem14_1|, ULTIMATE.start_subxy_#t~mem15=|v_ULTIMATE.start_subxy_#t~mem15_1|, ULTIMATE.start_main_#t~ret22=|v_ULTIMATE.start_main_#t~ret22_1|, ULTIMATE.start_subxy_#t~mem17=|v_ULTIMATE.start_subxy_#t~mem17_1|, ULTIMATE.start_subxy_#t~mem11=|v_ULTIMATE.start_subxy_#t~mem11_1|, #length=|v_#length_1|, ULTIMATE.start_subxy_#t~mem13=|v_ULTIMATE.start_subxy_#t~mem13_1|, ULTIMATE.start_subxy_~x_ref~0.base=v_ULTIMATE.start_subxy_~x_ref~0.base_1, ULTIMATE.start_subxy_~z~0.base=v_ULTIMATE.start_subxy_~z~0.base_1, ULTIMATE.start_main_#t~nondet21=|v_ULTIMATE.start_main_#t~nondet21_1|, ULTIMATE.start_main_#t~nondet20=|v_ULTIMATE.start_main_#t~nondet20_1|, ULTIMATE.start_subxy_#in~x=|v_ULTIMATE.start_subxy_#in~x_1|, ULTIMATE.start_subxy_#t~malloc2.base=|v_ULTIMATE.start_subxy_#t~malloc2.base_1|, ULTIMATE.start_subxy_#t~malloc0.offset=|v_ULTIMATE.start_subxy_#t~malloc0.offset_1|, ULTIMATE.start_subxy_#t~post18=|v_ULTIMATE.start_subxy_#t~post18_1|, ULTIMATE.start_subxy_#t~post16=|v_ULTIMATE.start_subxy_#t~post16_1|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1, ULTIMATE.start_subxy_#t~malloc0.base=|v_ULTIMATE.start_subxy_#t~malloc0.base_1|, ULTIMATE.start_subxy_#t~malloc1.base=|v_ULTIMATE.start_subxy_#t~malloc1.base_1|, ULTIMATE.start_subxy_#t~malloc3.offset=|v_ULTIMATE.start_subxy_#t~malloc3.offset_1|, ULTIMATE.start_subxy_#t~malloc3.base=|v_ULTIMATE.start_subxy_#t~malloc3.base_1|, ULTIMATE.start_subxy_#in~y=|v_ULTIMATE.start_subxy_#in~y_1|, ULTIMATE.start_subxy_~i~0.base=v_ULTIMATE.start_subxy_~i~0.base_1, ULTIMATE.start_subxy_#t~malloc1.offset=|v_ULTIMATE.start_subxy_#t~malloc1.offset_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_subxy_#t~mem4=|v_ULTIMATE.start_subxy_#t~mem4_1|, ULTIMATE.start_subxy_~x=v_ULTIMATE.start_subxy_~x_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_subxy_#t~mem6=|v_ULTIMATE.start_subxy_#t~mem6_1|, #valid=|v_#valid_3|, ULTIMATE.start_subxy_#t~mem5=|v_ULTIMATE.start_subxy_#t~mem5_1|, ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_1, ULTIMATE.start_subxy_~y=v_ULTIMATE.start_subxy_~y_1, ULTIMATE.start_subxy_~i~0.offset=v_ULTIMATE.start_subxy_~i~0.offset_1} AuxVars[|v_ULTIMATE.start_main_#t~nondet21_22|, |v_ULTIMATE.start_main_#t~nondet20_22|] AssignedVars[ULTIMATE.start_subxy_~x_ref~0.offset, ULTIMATE.start_subxy_#t~malloc2.offset, ULTIMATE.start_subxy_~y_ref~0.base, ULTIMATE.start_subxy_#res, ULTIMATE.start_subxy_#t~mem8, ULTIMATE.start_subxy_#t~mem9, ULTIMATE.start_subxy_#t~short7, ULTIMATE.start_subxy_~y_ref~0.offset, ULTIMATE.start_subxy_#t~post12, ULTIMATE.start_subxy_~z~0.offset, ULTIMATE.start_subxy_#t~mem19, ULTIMATE.start_subxy_#t~post10, ULTIMATE.start_subxy_#t~mem14, ULTIMATE.start_subxy_#t~mem15, ULTIMATE.start_main_#t~ret22, ULTIMATE.start_subxy_#t~mem17, ULTIMATE.start_subxy_#t~mem11, #length, ULTIMATE.start_subxy_#t~mem13, ULTIMATE.start_subxy_~x_ref~0.base, ULTIMATE.start_subxy_~z~0.base, ULTIMATE.start_main_#t~nondet21, ULTIMATE.start_main_#t~nondet20, ULTIMATE.start_subxy_#in~x, ULTIMATE.start_subxy_#t~malloc2.base, ULTIMATE.start_subxy_#t~malloc0.offset, ULTIMATE.start_subxy_#t~post18, ULTIMATE.start_subxy_#t~post16, ULTIMATE.start_main_~x~0, ULTIMATE.start_subxy_#t~malloc0.base, ULTIMATE.start_subxy_#t~malloc1.base, ULTIMATE.start_subxy_#t~malloc3.offset, ULTIMATE.start_subxy_#t~malloc3.base, ULTIMATE.start_subxy_#in~y, ULTIMATE.start_subxy_~i~0.base, ULTIMATE.start_subxy_#t~malloc1.offset, ULTIMATE.start_subxy_#t~mem4, ULTIMATE.start_subxy_~x, ULTIMATE.start_main_#res, ULTIMATE.start_subxy_#t~mem6, #valid, ULTIMATE.start_subxy_#t~mem5, ULTIMATE.start_main_~y~0, ULTIMATE.start_subxy_~y, ULTIMATE.start_subxy_~i~0.offset] 488#L10 [124] L10-->L10-1: Formula: (and (= (select |v_#valid_8| v_ULTIMATE.start_subxy_~x_ref~0.base_3) 1) (<= (+ v_ULTIMATE.start_subxy_~x_ref~0.offset_3 4) (select |v_#length_6| v_ULTIMATE.start_subxy_~x_ref~0.base_3)) (<= 0 v_ULTIMATE.start_subxy_~x_ref~0.offset_3) (= (store |v_#memory_int_2| v_ULTIMATE.start_subxy_~x_ref~0.base_3 (store (select |v_#memory_int_2| v_ULTIMATE.start_subxy_~x_ref~0.base_3) v_ULTIMATE.start_subxy_~x_ref~0.offset_3 v_ULTIMATE.start_subxy_~x_3)) |v_#memory_int_1|)) InVars {ULTIMATE.start_subxy_~x_ref~0.offset=v_ULTIMATE.start_subxy_~x_ref~0.offset_3, ULTIMATE.start_subxy_~x=v_ULTIMATE.start_subxy_~x_3, #valid=|v_#valid_8|, #memory_int=|v_#memory_int_2|, #length=|v_#length_6|, ULTIMATE.start_subxy_~x_ref~0.base=v_ULTIMATE.start_subxy_~x_ref~0.base_3} OutVars{ULTIMATE.start_subxy_~x_ref~0.offset=v_ULTIMATE.start_subxy_~x_ref~0.offset_3, ULTIMATE.start_subxy_~x=v_ULTIMATE.start_subxy_~x_3, #valid=|v_#valid_8|, #memory_int=|v_#memory_int_1|, #length=|v_#length_6|, ULTIMATE.start_subxy_~x_ref~0.base=v_ULTIMATE.start_subxy_~x_ref~0.base_3} AuxVars[] AssignedVars[#memory_int] 489#L10-1 [181] L10-1-->L11: Formula: (and (= |v_#memory_int_3| (store |v_#memory_int_4| v_ULTIMATE.start_subxy_~y_ref~0.base_3 (store (select |v_#memory_int_4| v_ULTIMATE.start_subxy_~y_ref~0.base_3) v_ULTIMATE.start_subxy_~y_ref~0.offset_3 v_ULTIMATE.start_subxy_~y_3))) (= 1 (select |v_#valid_10| v_ULTIMATE.start_subxy_~y_ref~0.base_3)) (<= (+ v_ULTIMATE.start_subxy_~y_ref~0.offset_3 4) (select |v_#length_8| v_ULTIMATE.start_subxy_~y_ref~0.base_3)) (<= 0 v_ULTIMATE.start_subxy_~y_ref~0.offset_3)) InVars {ULTIMATE.start_subxy_~y_ref~0.offset=v_ULTIMATE.start_subxy_~y_ref~0.offset_3, ULTIMATE.start_subxy_~y_ref~0.base=v_ULTIMATE.start_subxy_~y_ref~0.base_3, #valid=|v_#valid_10|, #memory_int=|v_#memory_int_4|, ULTIMATE.start_subxy_~y=v_ULTIMATE.start_subxy_~y_3, #length=|v_#length_8|} OutVars{ULTIMATE.start_subxy_~y_ref~0.offset=v_ULTIMATE.start_subxy_~y_ref~0.offset_3, ULTIMATE.start_subxy_~y_ref~0.base=v_ULTIMATE.start_subxy_~y_ref~0.base_3, #valid=|v_#valid_10|, #memory_int=|v_#memory_int_3|, ULTIMATE.start_subxy_~y=v_ULTIMATE.start_subxy_~y_3, #length=|v_#length_8|} AuxVars[] AssignedVars[#memory_int] 509#L11 [154] L11-->L12: Formula: (and (= (store |v_#memory_int_6| v_ULTIMATE.start_subxy_~z~0.base_3 (store (select |v_#memory_int_6| v_ULTIMATE.start_subxy_~z~0.base_3) v_ULTIMATE.start_subxy_~z~0.offset_3 0)) |v_#memory_int_5|) (= 1 (select |v_#valid_12| v_ULTIMATE.start_subxy_~z~0.base_3)) (<= 0 v_ULTIMATE.start_subxy_~z~0.offset_3) (<= (+ v_ULTIMATE.start_subxy_~z~0.offset_3 4) (select |v_#length_10| v_ULTIMATE.start_subxy_~z~0.base_3))) InVars {#memory_int=|v_#memory_int_6|, ULTIMATE.start_subxy_~z~0.base=v_ULTIMATE.start_subxy_~z~0.base_3, ULTIMATE.start_subxy_~z~0.offset=v_ULTIMATE.start_subxy_~z~0.offset_3, #length=|v_#length_10|, #valid=|v_#valid_12|} OutVars{#memory_int=|v_#memory_int_5|, ULTIMATE.start_subxy_~z~0.base=v_ULTIMATE.start_subxy_~z~0.base_3, ULTIMATE.start_subxy_~z~0.offset=v_ULTIMATE.start_subxy_~z~0.offset_3, #length=|v_#length_10|, #valid=|v_#valid_12|} AuxVars[] AssignedVars[#memory_int] 496#L12 [164] L12-->L13: Formula: (and (<= 0 v_ULTIMATE.start_subxy_~x_ref~0.offset_5) (<= (+ v_ULTIMATE.start_subxy_~x_ref~0.offset_5 4) (select |v_#length_12| v_ULTIMATE.start_subxy_~x_ref~0.base_6)) (= 1 (select |v_#valid_14| v_ULTIMATE.start_subxy_~x_ref~0.base_6)) (= (select (select |v_#memory_int_7| v_ULTIMATE.start_subxy_~x_ref~0.base_6) v_ULTIMATE.start_subxy_~x_ref~0.offset_5) |v_ULTIMATE.start_subxy_#t~mem4_2|)) InVars {#memory_int=|v_#memory_int_7|, ULTIMATE.start_subxy_~x_ref~0.offset=v_ULTIMATE.start_subxy_~x_ref~0.offset_5, #length=|v_#length_12|, ULTIMATE.start_subxy_~x_ref~0.base=v_ULTIMATE.start_subxy_~x_ref~0.base_6, #valid=|v_#valid_14|} OutVars{ULTIMATE.start_subxy_~x_ref~0.offset=v_ULTIMATE.start_subxy_~x_ref~0.offset_5, ULTIMATE.start_subxy_#t~mem4=|v_ULTIMATE.start_subxy_#t~mem4_2|, #valid=|v_#valid_14|, #memory_int=|v_#memory_int_7|, #length=|v_#length_12|, ULTIMATE.start_subxy_~x_ref~0.base=v_ULTIMATE.start_subxy_~x_ref~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_subxy_#t~mem4] 497#L13 [334] L13-->L14: Formula: (and (= (store |v_#memory_int_29| v_ULTIMATE.start_subxy_~i~0.base_24 (store (select |v_#memory_int_29| v_ULTIMATE.start_subxy_~i~0.base_24) v_ULTIMATE.start_subxy_~i~0.offset_17 |v_ULTIMATE.start_subxy_#t~mem4_6|)) |v_#memory_int_28|) (<= 0 v_ULTIMATE.start_subxy_~i~0.offset_17) (<= (+ v_ULTIMATE.start_subxy_~i~0.offset_17 4) (select |v_#length_44| v_ULTIMATE.start_subxy_~i~0.base_24)) (= 1 (select |v_#valid_56| v_ULTIMATE.start_subxy_~i~0.base_24))) InVars {ULTIMATE.start_subxy_~i~0.base=v_ULTIMATE.start_subxy_~i~0.base_24, ULTIMATE.start_subxy_#t~mem4=|v_ULTIMATE.start_subxy_#t~mem4_6|, #valid=|v_#valid_56|, #memory_int=|v_#memory_int_29|, #length=|v_#length_44|, ULTIMATE.start_subxy_~i~0.offset=v_ULTIMATE.start_subxy_~i~0.offset_17} OutVars{ULTIMATE.start_subxy_~i~0.base=v_ULTIMATE.start_subxy_~i~0.base_24, ULTIMATE.start_subxy_#t~mem4=|v_ULTIMATE.start_subxy_#t~mem4_5|, #valid=|v_#valid_56|, #memory_int=|v_#memory_int_28|, #length=|v_#length_44|, ULTIMATE.start_subxy_~i~0.offset=v_ULTIMATE.start_subxy_~i~0.offset_17} AuxVars[] AssignedVars[ULTIMATE.start_subxy_#t~mem4, #memory_int] 500#L14 [139] L14-->L14-1: Formula: (and (= (select (select |v_#memory_int_10| v_ULTIMATE.start_subxy_~y_ref~0.base_6) v_ULTIMATE.start_subxy_~y_ref~0.offset_5) |v_ULTIMATE.start_subxy_#t~mem5_2|) (<= (+ v_ULTIMATE.start_subxy_~y_ref~0.offset_5 4) (select |v_#length_16| v_ULTIMATE.start_subxy_~y_ref~0.base_6)) (<= 0 v_ULTIMATE.start_subxy_~y_ref~0.offset_5) (= 1 (select |v_#valid_18| v_ULTIMATE.start_subxy_~y_ref~0.base_6))) InVars {ULTIMATE.start_subxy_~y_ref~0.offset=v_ULTIMATE.start_subxy_~y_ref~0.offset_5, #memory_int=|v_#memory_int_10|, #length=|v_#length_16|, ULTIMATE.start_subxy_~y_ref~0.base=v_ULTIMATE.start_subxy_~y_ref~0.base_6, #valid=|v_#valid_18|} OutVars{ULTIMATE.start_subxy_~y_ref~0.offset=v_ULTIMATE.start_subxy_~y_ref~0.offset_5, ULTIMATE.start_subxy_~y_ref~0.base=v_ULTIMATE.start_subxy_~y_ref~0.base_6, ULTIMATE.start_subxy_#t~mem5=|v_ULTIMATE.start_subxy_#t~mem5_2|, #valid=|v_#valid_18|, #memory_int=|v_#memory_int_10|, #length=|v_#length_16|} AuxVars[] AssignedVars[ULTIMATE.start_subxy_#t~mem5] 499#L14-1 [278] L14-1-->L14-2: Formula: (and (not |v_ULTIMATE.start_subxy_#t~short7_2|) (> |v_ULTIMATE.start_subxy_#t~mem5_3| 0)) InVars {ULTIMATE.start_subxy_#t~mem5=|v_ULTIMATE.start_subxy_#t~mem5_3|} OutVars{ULTIMATE.start_subxy_#t~short7=|v_ULTIMATE.start_subxy_#t~short7_2|, ULTIMATE.start_subxy_#t~mem5=|v_ULTIMATE.start_subxy_#t~mem5_3|} AuxVars[] AssignedVars[ULTIMATE.start_subxy_#t~short7] 498#L14-2 [135] L14-2-->L14-4: Formula: (not |v_ULTIMATE.start_subxy_#t~short7_4|) InVars {ULTIMATE.start_subxy_#t~short7=|v_ULTIMATE.start_subxy_#t~short7_4|} OutVars{ULTIMATE.start_subxy_#t~short7=|v_ULTIMATE.start_subxy_#t~short7_4|} AuxVars[] AssignedVars[] 490#L14-4 [127] L14-4-->L14-5: Formula: (and (= |v_ULTIMATE.start_subxy_#t~mem6_2| (select (select |v_#memory_int_11| v_ULTIMATE.start_subxy_~x_ref~0.base_9) v_ULTIMATE.start_subxy_~x_ref~0.offset_7)) (<= (+ v_ULTIMATE.start_subxy_~x_ref~0.offset_7 4) (select |v_#length_18| v_ULTIMATE.start_subxy_~x_ref~0.base_9)) (= 1 (select |v_#valid_20| v_ULTIMATE.start_subxy_~x_ref~0.base_9)) (<= 0 v_ULTIMATE.start_subxy_~x_ref~0.offset_7)) InVars {#memory_int=|v_#memory_int_11|, ULTIMATE.start_subxy_~x_ref~0.offset=v_ULTIMATE.start_subxy_~x_ref~0.offset_7, #length=|v_#length_18|, ULTIMATE.start_subxy_~x_ref~0.base=v_ULTIMATE.start_subxy_~x_ref~0.base_9, #valid=|v_#valid_20|} OutVars{ULTIMATE.start_subxy_~x_ref~0.offset=v_ULTIMATE.start_subxy_~x_ref~0.offset_7, ULTIMATE.start_subxy_#t~mem6=|v_ULTIMATE.start_subxy_#t~mem6_2|, #valid=|v_#valid_20|, #memory_int=|v_#memory_int_11|, #length=|v_#length_18|, ULTIMATE.start_subxy_~x_ref~0.base=v_ULTIMATE.start_subxy_~x_ref~0.base_9} AuxVars[] AssignedVars[ULTIMATE.start_subxy_#t~mem6] 491#L14-5 [288] L14-5-->L14-6: Formula: (and (not |v_ULTIMATE.start_subxy_#t~short7_5|) (> |v_ULTIMATE.start_subxy_#t~mem6_3| 0)) InVars {ULTIMATE.start_subxy_#t~mem6=|v_ULTIMATE.start_subxy_#t~mem6_3|} OutVars{ULTIMATE.start_subxy_#t~short7=|v_ULTIMATE.start_subxy_#t~short7_5|, ULTIMATE.start_subxy_#t~mem6=|v_ULTIMATE.start_subxy_#t~mem6_3|} AuxVars[] AssignedVars[ULTIMATE.start_subxy_#t~short7] 507#L14-6 [180] L14-6-->L17-3: Formula: (not |v_ULTIMATE.start_subxy_#t~short7_9|) InVars {ULTIMATE.start_subxy_#t~short7=|v_ULTIMATE.start_subxy_#t~short7_9|} OutVars{ULTIMATE.start_subxy_#t~short7=|v_ULTIMATE.start_subxy_#t~short7_8|, ULTIMATE.start_subxy_#t~mem6=|v_ULTIMATE.start_subxy_#t~mem6_5|, ULTIMATE.start_subxy_#t~mem5=|v_ULTIMATE.start_subxy_#t~mem5_5|} AuxVars[] AssignedVars[ULTIMATE.start_subxy_#t~mem6, ULTIMATE.start_subxy_#t~mem5, ULTIMATE.start_subxy_#t~short7] 508#L17-3 [192] L17-3-->L17-1: Formula: (and (= (select (select |v_#memory_int_12| v_ULTIMATE.start_subxy_~i~0.base_6) v_ULTIMATE.start_subxy_~i~0.offset_5) |v_ULTIMATE.start_subxy_#t~mem8_2|) (= 1 (select |v_#valid_27| v_ULTIMATE.start_subxy_~i~0.base_6)) (<= 0 v_ULTIMATE.start_subxy_~i~0.offset_5) (<= (+ v_ULTIMATE.start_subxy_~i~0.offset_5 4) (select |v_#length_20| v_ULTIMATE.start_subxy_~i~0.base_6))) InVars {ULTIMATE.start_subxy_~i~0.base=v_ULTIMATE.start_subxy_~i~0.base_6, #memory_int=|v_#memory_int_12|, #length=|v_#length_20|, ULTIMATE.start_subxy_~i~0.offset=v_ULTIMATE.start_subxy_~i~0.offset_5, #valid=|v_#valid_27|} OutVars{ULTIMATE.start_subxy_~i~0.base=v_ULTIMATE.start_subxy_~i~0.base_6, #valid=|v_#valid_27|, ULTIMATE.start_subxy_#t~mem8=|v_ULTIMATE.start_subxy_#t~mem8_2|, #memory_int=|v_#memory_int_12|, #length=|v_#length_20|, ULTIMATE.start_subxy_~i~0.offset=v_ULTIMATE.start_subxy_~i~0.offset_5} AuxVars[] AssignedVars[ULTIMATE.start_subxy_#t~mem8] 501#L17-1 [216] L17-1-->L21-3: Formula: (>= 0 |v_ULTIMATE.start_subxy_#t~mem8_4|) InVars {ULTIMATE.start_subxy_#t~mem8=|v_ULTIMATE.start_subxy_#t~mem8_4|} OutVars{ULTIMATE.start_subxy_#t~mem8=|v_ULTIMATE.start_subxy_#t~mem8_3|} AuxVars[] AssignedVars[ULTIMATE.start_subxy_#t~mem8] 495#L21-3 48.71/31.66 [2019-03-28 12:43:08,443 INFO L796 eck$LassoCheckResult]: Loop: 495#L21-3 [176] L21-3-->L21: Formula: (and (<= 0 v_ULTIMATE.start_subxy_~i~0.offset_11) (= 1 (select |v_#valid_37| v_ULTIMATE.start_subxy_~i~0.base_15)) (<= (+ v_ULTIMATE.start_subxy_~i~0.offset_11 4) (select |v_#length_30| v_ULTIMATE.start_subxy_~i~0.base_15)) (= (select (select |v_#memory_int_19| v_ULTIMATE.start_subxy_~i~0.base_15) v_ULTIMATE.start_subxy_~i~0.offset_11) |v_ULTIMATE.start_subxy_#t~mem13_2|)) InVars {ULTIMATE.start_subxy_~i~0.base=v_ULTIMATE.start_subxy_~i~0.base_15, #memory_int=|v_#memory_int_19|, #length=|v_#length_30|, ULTIMATE.start_subxy_~i~0.offset=v_ULTIMATE.start_subxy_~i~0.offset_11, #valid=|v_#valid_37|} OutVars{ULTIMATE.start_subxy_~i~0.base=v_ULTIMATE.start_subxy_~i~0.base_15, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_19|, #length=|v_#length_30|, ULTIMATE.start_subxy_#t~mem13=|v_ULTIMATE.start_subxy_#t~mem13_2|, ULTIMATE.start_subxy_~i~0.offset=v_ULTIMATE.start_subxy_~i~0.offset_11} AuxVars[] AssignedVars[ULTIMATE.start_subxy_#t~mem13] 492#L21 [130] L21-->L21-1: Formula: (and (<= 0 v_ULTIMATE.start_subxy_~y_ref~0.offset_7) (= (select (select |v_#memory_int_20| v_ULTIMATE.start_subxy_~y_ref~0.base_9) v_ULTIMATE.start_subxy_~y_ref~0.offset_7) |v_ULTIMATE.start_subxy_#t~mem14_2|) (= (select |v_#valid_39| v_ULTIMATE.start_subxy_~y_ref~0.base_9) 1) (<= (+ v_ULTIMATE.start_subxy_~y_ref~0.offset_7 4) (select |v_#length_32| v_ULTIMATE.start_subxy_~y_ref~0.base_9))) InVars {ULTIMATE.start_subxy_~y_ref~0.offset=v_ULTIMATE.start_subxy_~y_ref~0.offset_7, #memory_int=|v_#memory_int_20|, #length=|v_#length_32|, ULTIMATE.start_subxy_~y_ref~0.base=v_ULTIMATE.start_subxy_~y_ref~0.base_9, #valid=|v_#valid_39|} OutVars{ULTIMATE.start_subxy_~y_ref~0.offset=v_ULTIMATE.start_subxy_~y_ref~0.offset_7, ULTIMATE.start_subxy_#t~mem14=|v_ULTIMATE.start_subxy_#t~mem14_2|, ULTIMATE.start_subxy_~y_ref~0.base=v_ULTIMATE.start_subxy_~y_ref~0.base_9, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_20|, #length=|v_#length_32|} AuxVars[] AssignedVars[ULTIMATE.start_subxy_#t~mem14] 493#L21-1 [186] L21-1-->L22: Formula: (< |v_ULTIMATE.start_subxy_#t~mem13_6| |v_ULTIMATE.start_subxy_#t~mem14_6|) InVars {ULTIMATE.start_subxy_#t~mem14=|v_ULTIMATE.start_subxy_#t~mem14_6|, ULTIMATE.start_subxy_#t~mem13=|v_ULTIMATE.start_subxy_#t~mem13_6|} OutVars{ULTIMATE.start_subxy_#t~mem14=|v_ULTIMATE.start_subxy_#t~mem14_5|, ULTIMATE.start_subxy_#t~mem13=|v_ULTIMATE.start_subxy_#t~mem13_5|} AuxVars[] AssignedVars[ULTIMATE.start_subxy_#t~mem14, ULTIMATE.start_subxy_#t~mem13] 510#L22 [339] L22-->L22-2: Formula: (and (= 1 (select |v_#valid_59| v_ULTIMATE.start_subxy_~i~0.base_27)) (<= (+ v_ULTIMATE.start_subxy_~i~0.offset_20 4) (select |v_#length_47| v_ULTIMATE.start_subxy_~i~0.base_27)) (<= 0 v_ULTIMATE.start_subxy_~i~0.offset_20) (= (select (select |v_#memory_int_33| v_ULTIMATE.start_subxy_~i~0.base_27) v_ULTIMATE.start_subxy_~i~0.offset_20) |v_ULTIMATE.start_subxy_#t~mem15_5|) (= |v_ULTIMATE.start_subxy_#t~post16_5| |v_ULTIMATE.start_subxy_#t~mem15_5|)) InVars {ULTIMATE.start_subxy_~i~0.base=v_ULTIMATE.start_subxy_~i~0.base_27, #valid=|v_#valid_59|, #memory_int=|v_#memory_int_33|, #length=|v_#length_47|, ULTIMATE.start_subxy_~i~0.offset=v_ULTIMATE.start_subxy_~i~0.offset_20} OutVars{ULTIMATE.start_subxy_~i~0.base=v_ULTIMATE.start_subxy_~i~0.base_27, ULTIMATE.start_subxy_#t~mem15=|v_ULTIMATE.start_subxy_#t~mem15_5|, #valid=|v_#valid_59|, #memory_int=|v_#memory_int_33|, #length=|v_#length_47|, ULTIMATE.start_subxy_#t~post16=|v_ULTIMATE.start_subxy_#t~post16_5|, ULTIMATE.start_subxy_~i~0.offset=v_ULTIMATE.start_subxy_~i~0.offset_20} AuxVars[] AssignedVars[ULTIMATE.start_subxy_#t~mem15, ULTIMATE.start_subxy_#t~post16] 485#L22-2 [342] L22-2-->L23: Formula: (and (<= (+ v_ULTIMATE.start_subxy_~i~0.offset_21 4) (select |v_#length_50| v_ULTIMATE.start_subxy_~i~0.base_28)) (= (store |v_#memory_int_37| v_ULTIMATE.start_subxy_~i~0.base_28 (store (select |v_#memory_int_37| v_ULTIMATE.start_subxy_~i~0.base_28) v_ULTIMATE.start_subxy_~i~0.offset_21 (+ |v_ULTIMATE.start_subxy_#t~post16_7| 1))) |v_#memory_int_36|) (= 1 (select |v_#valid_63| v_ULTIMATE.start_subxy_~i~0.base_28)) (<= 0 v_ULTIMATE.start_subxy_~i~0.offset_21)) InVars {ULTIMATE.start_subxy_~i~0.base=v_ULTIMATE.start_subxy_~i~0.base_28, #valid=|v_#valid_63|, #memory_int=|v_#memory_int_37|, #length=|v_#length_50|, ULTIMATE.start_subxy_#t~post16=|v_ULTIMATE.start_subxy_#t~post16_7|, ULTIMATE.start_subxy_~i~0.offset=v_ULTIMATE.start_subxy_~i~0.offset_21} OutVars{ULTIMATE.start_subxy_~i~0.base=v_ULTIMATE.start_subxy_~i~0.base_28, ULTIMATE.start_subxy_#t~mem15=|v_ULTIMATE.start_subxy_#t~mem15_6|, #valid=|v_#valid_63|, #memory_int=|v_#memory_int_36|, #length=|v_#length_50|, ULTIMATE.start_subxy_#t~post16=|v_ULTIMATE.start_subxy_#t~post16_6|, ULTIMATE.start_subxy_~i~0.offset=v_ULTIMATE.start_subxy_~i~0.offset_21} AuxVars[] AssignedVars[ULTIMATE.start_subxy_#t~mem15, #memory_int, ULTIMATE.start_subxy_#t~post16] 486#L23 [344] L23-->L23-2: Formula: (and (= (select (select |v_#memory_int_40| v_ULTIMATE.start_subxy_~z~0.base_24) v_ULTIMATE.start_subxy_~z~0.offset_18) |v_ULTIMATE.start_subxy_#t~mem17_5|) (= |v_ULTIMATE.start_subxy_#t~post18_5| |v_ULTIMATE.start_subxy_#t~mem17_5|) (<= 0 v_ULTIMATE.start_subxy_~z~0.offset_18) (<= (+ v_ULTIMATE.start_subxy_~z~0.offset_18 4) (select |v_#length_52| v_ULTIMATE.start_subxy_~z~0.base_24)) (= (select |v_#valid_65| v_ULTIMATE.start_subxy_~z~0.base_24) 1)) InVars {ULTIMATE.start_subxy_~z~0.base=v_ULTIMATE.start_subxy_~z~0.base_24, ULTIMATE.start_subxy_~z~0.offset=v_ULTIMATE.start_subxy_~z~0.offset_18, #valid=|v_#valid_65|, #memory_int=|v_#memory_int_40|, #length=|v_#length_52|} OutVars{ULTIMATE.start_subxy_~z~0.base=v_ULTIMATE.start_subxy_~z~0.base_24, ULTIMATE.start_subxy_~z~0.offset=v_ULTIMATE.start_subxy_~z~0.offset_18, ULTIMATE.start_subxy_#t~mem17=|v_ULTIMATE.start_subxy_#t~mem17_5|, #valid=|v_#valid_65|, #memory_int=|v_#memory_int_40|, ULTIMATE.start_subxy_#t~post18=|v_ULTIMATE.start_subxy_#t~post18_5|, #length=|v_#length_52|} AuxVars[] AssignedVars[ULTIMATE.start_subxy_#t~mem17, ULTIMATE.start_subxy_#t~post18] 494#L23-2 [345] L23-2-->L21-3: Formula: (and (<= (+ v_ULTIMATE.start_subxy_~z~0.offset_19 4) (select |v_#length_53| v_ULTIMATE.start_subxy_~z~0.base_25)) (= (store |v_#memory_int_42| v_ULTIMATE.start_subxy_~z~0.base_25 (store (select |v_#memory_int_42| v_ULTIMATE.start_subxy_~z~0.base_25) v_ULTIMATE.start_subxy_~z~0.offset_19 (+ |v_ULTIMATE.start_subxy_#t~post18_7| (- 1)))) |v_#memory_int_41|) (= 1 (select |v_#valid_66| v_ULTIMATE.start_subxy_~z~0.base_25)) (<= 0 v_ULTIMATE.start_subxy_~z~0.offset_19)) InVars {ULTIMATE.start_subxy_~z~0.base=v_ULTIMATE.start_subxy_~z~0.base_25, ULTIMATE.start_subxy_~z~0.offset=v_ULTIMATE.start_subxy_~z~0.offset_19, #valid=|v_#valid_66|, #memory_int=|v_#memory_int_42|, ULTIMATE.start_subxy_#t~post18=|v_ULTIMATE.start_subxy_#t~post18_7|, #length=|v_#length_53|} OutVars{ULTIMATE.start_subxy_~z~0.base=v_ULTIMATE.start_subxy_~z~0.base_25, ULTIMATE.start_subxy_~z~0.offset=v_ULTIMATE.start_subxy_~z~0.offset_19, ULTIMATE.start_subxy_#t~mem17=|v_ULTIMATE.start_subxy_#t~mem17_6|, #valid=|v_#valid_66|, #memory_int=|v_#memory_int_41|, ULTIMATE.start_subxy_#t~post18=|v_ULTIMATE.start_subxy_#t~post18_6|, #length=|v_#length_53|} AuxVars[] AssignedVars[ULTIMATE.start_subxy_#t~mem17, #memory_int, ULTIMATE.start_subxy_#t~post18] 495#L21-3 48.71/31.66 [2019-03-28 12:43:08,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 48.71/31.66 [2019-03-28 12:43:08,443 INFO L82 PathProgramCache]: Analyzing trace with hash 252168181, now seen corresponding path program 1 times 48.71/31.66 [2019-03-28 12:43:08,443 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 48.71/31.66 [2019-03-28 12:43:08,444 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 48.71/31.66 [2019-03-28 12:43:08,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 48.71/31.66 [2019-03-28 12:43:08,445 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 48.71/31.66 [2019-03-28 12:43:08,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 48.71/31.66 [2019-03-28 12:43:08,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 48.71/31.66 [2019-03-28 12:43:08,551 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 48.71/31.66 [2019-03-28 12:43:08,552 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 48.71/31.66 [2019-03-28 12:43:08,552 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 48.71/31.66 [2019-03-28 12:43:08,552 INFO L799 eck$LassoCheckResult]: stem already infeasible 48.71/31.66 [2019-03-28 12:43:08,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 48.71/31.66 [2019-03-28 12:43:08,553 INFO L82 PathProgramCache]: Analyzing trace with hash -1361295701, now seen corresponding path program 1 times 48.71/31.66 [2019-03-28 12:43:08,553 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 48.71/31.66 [2019-03-28 12:43:08,553 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 48.71/31.66 [2019-03-28 12:43:08,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 48.71/31.66 [2019-03-28 12:43:08,554 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 48.71/31.66 [2019-03-28 12:43:08,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 48.71/31.66 [2019-03-28 12:43:08,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 48.71/31.66 [2019-03-28 12:43:08,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 48.71/31.66 [2019-03-28 12:43:08,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. 48.71/31.66 [2019-03-28 12:43:08,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 48.71/31.66 [2019-03-28 12:43:08,663 INFO L87 Difference]: Start difference. First operand 30 states and 47 transitions. cyclomatic complexity: 19 Second operand 8 states. 48.71/31.66 [2019-03-28 12:43:08,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 48.71/31.66 [2019-03-28 12:43:08,941 INFO L93 Difference]: Finished difference Result 34 states and 50 transitions. 48.71/31.66 [2019-03-28 12:43:08,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 48.71/31.66 [2019-03-28 12:43:08,951 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 50 transitions. 48.71/31.66 [2019-03-28 12:43:08,952 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 48.71/31.66 [2019-03-28 12:43:08,952 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 33 states and 49 transitions. 48.71/31.66 [2019-03-28 12:43:08,953 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 48.71/31.66 [2019-03-28 12:43:08,953 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 48.71/31.66 [2019-03-28 12:43:08,953 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 49 transitions. 48.71/31.66 [2019-03-28 12:43:08,953 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 48.71/31.66 [2019-03-28 12:43:08,953 INFO L706 BuchiCegarLoop]: Abstraction has 33 states and 49 transitions. 48.71/31.66 [2019-03-28 12:43:08,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 49 transitions. 48.71/31.66 [2019-03-28 12:43:08,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 30. 48.71/31.66 [2019-03-28 12:43:08,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. 48.71/31.66 [2019-03-28 12:43:08,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 46 transitions. 48.71/31.66 [2019-03-28 12:43:08,956 INFO L729 BuchiCegarLoop]: Abstraction has 30 states and 46 transitions. 48.71/31.66 [2019-03-28 12:43:08,956 INFO L609 BuchiCegarLoop]: Abstraction has 30 states and 46 transitions. 48.71/31.66 [2019-03-28 12:43:08,956 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ 48.71/31.66 [2019-03-28 12:43:08,956 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 46 transitions. 48.71/31.66 [2019-03-28 12:43:08,957 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 48.71/31.66 [2019-03-28 12:43:08,957 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 48.71/31.66 [2019-03-28 12:43:08,957 INFO L119 BuchiIsEmpty]: Starting construction of run 48.71/31.66 [2019-03-28 12:43:08,958 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 48.71/31.66 [2019-03-28 12:43:08,958 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] 48.71/31.66 [2019-03-28 12:43:08,959 INFO L794 eck$LassoCheckResult]: Stem: 596#ULTIMATE.startENTRY [153] ULTIMATE.startENTRY-->L-1: Formula: (and (= |v_#NULL.offset_1| 0) (= |v_#NULL.base_1| 0) (= |v_#valid_1| (store |v_#valid_2| 0 0))) InVars {#valid=|v_#valid_2|} OutVars{#NULL.offset=|v_#NULL.offset_1|, #NULL.base=|v_#NULL.base_1|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid, #NULL.offset, #NULL.base] 572#L-1 [253] L-1-->L10: Formula: (let ((.cse0 (store |v_#valid_7| |v_ULTIMATE.start_subxy_#t~malloc0.base_1| 1))) (let ((.cse1 (store .cse0 |v_ULTIMATE.start_subxy_#t~malloc1.base_1| 1))) (let ((.cse2 (store .cse1 |v_ULTIMATE.start_subxy_#t~malloc2.base_1| 1))) (and (< |v_ULTIMATE.start_subxy_#t~malloc1.base_1| 0) (= 0 |v_ULTIMATE.start_subxy_#t~malloc2.offset_1|) (= v_ULTIMATE.start_subxy_~x_1 |v_ULTIMATE.start_subxy_#in~x_1|) (= v_ULTIMATE.start_subxy_~y_1 |v_ULTIMATE.start_subxy_#in~y_1|) (= |v_#length_1| (store (store (store (store |v_#length_5| |v_ULTIMATE.start_subxy_#t~malloc0.base_1| 4) |v_ULTIMATE.start_subxy_#t~malloc1.base_1| 4) |v_ULTIMATE.start_subxy_#t~malloc2.base_1| 4) |v_ULTIMATE.start_subxy_#t~malloc3.base_1| 4)) (= |v_ULTIMATE.start_subxy_#t~malloc0.offset_1| 0) (= 0 |v_ULTIMATE.start_subxy_#t~malloc1.offset_1|) (= (select .cse0 |v_ULTIMATE.start_subxy_#t~malloc1.base_1|) 0) (= v_ULTIMATE.start_subxy_~x_ref~0.offset_1 |v_ULTIMATE.start_subxy_#t~malloc0.offset_1|) (= v_ULTIMATE.start_subxy_~x_ref~0.base_1 |v_ULTIMATE.start_subxy_#t~malloc0.base_1|) (= 0 (select .cse1 |v_ULTIMATE.start_subxy_#t~malloc2.base_1|)) (< |v_ULTIMATE.start_subxy_#t~malloc2.base_1| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_subxy_~i~0.base_1 |v_ULTIMATE.start_subxy_#t~malloc3.base_1|) (< |v_ULTIMATE.start_subxy_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_subxy_#in~y_1| v_ULTIMATE.start_main_~y~0_1) (= 0 |v_ULTIMATE.start_subxy_#t~malloc3.offset_1|) (= v_ULTIMATE.start_subxy_~y_ref~0.base_1 |v_ULTIMATE.start_subxy_#t~malloc1.base_1|) (> |v_ULTIMATE.start_subxy_#t~malloc2.base_1| 0) (= |v_ULTIMATE.start_subxy_#in~x_1| v_ULTIMATE.start_main_~x~0_1) (= v_ULTIMATE.start_subxy_~z~0.base_1 |v_ULTIMATE.start_subxy_#t~malloc2.base_1|) (= 0 (select .cse2 |v_ULTIMATE.start_subxy_#t~malloc3.base_1|)) (= v_ULTIMATE.start_main_~y~0_1 |v_ULTIMATE.start_main_#t~nondet21_22|) (< |v_ULTIMATE.start_subxy_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_subxy_~y_ref~0.offset_1 |v_ULTIMATE.start_subxy_#t~malloc1.offset_1|) (< |v_ULTIMATE.start_subxy_#t~malloc3.base_1| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_subxy_~i~0.offset_1 |v_ULTIMATE.start_subxy_#t~malloc3.offset_1|) (= v_ULTIMATE.start_main_~x~0_1 |v_ULTIMATE.start_main_#t~nondet20_22|) (< 0 |v_ULTIMATE.start_subxy_#t~malloc0.base_1|) (= (store .cse2 |v_ULTIMATE.start_subxy_#t~malloc3.base_1| 1) |v_#valid_3|) (< 0 |v_ULTIMATE.start_subxy_#t~malloc3.base_1|) (= v_ULTIMATE.start_subxy_~z~0.offset_1 |v_ULTIMATE.start_subxy_#t~malloc2.offset_1|) (= (select |v_#valid_7| |v_ULTIMATE.start_subxy_#t~malloc0.base_1|) 0))))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_5|, #valid=|v_#valid_7|} OutVars{ULTIMATE.start_subxy_~x_ref~0.offset=v_ULTIMATE.start_subxy_~x_ref~0.offset_1, ULTIMATE.start_subxy_#t~malloc2.offset=|v_ULTIMATE.start_subxy_#t~malloc2.offset_1|, ULTIMATE.start_subxy_~y_ref~0.base=v_ULTIMATE.start_subxy_~y_ref~0.base_1, ULTIMATE.start_subxy_#res=|v_ULTIMATE.start_subxy_#res_1|, ULTIMATE.start_subxy_#t~mem8=|v_ULTIMATE.start_subxy_#t~mem8_1|, ULTIMATE.start_subxy_#t~mem9=|v_ULTIMATE.start_subxy_#t~mem9_1|, ULTIMATE.start_subxy_#t~short7=|v_ULTIMATE.start_subxy_#t~short7_1|, ULTIMATE.start_subxy_~y_ref~0.offset=v_ULTIMATE.start_subxy_~y_ref~0.offset_1, ULTIMATE.start_subxy_#t~post12=|v_ULTIMATE.start_subxy_#t~post12_1|, ULTIMATE.start_subxy_~z~0.offset=v_ULTIMATE.start_subxy_~z~0.offset_1, ULTIMATE.start_subxy_#t~mem19=|v_ULTIMATE.start_subxy_#t~mem19_1|, ULTIMATE.start_subxy_#t~post10=|v_ULTIMATE.start_subxy_#t~post10_1|, ULTIMATE.start_subxy_#t~mem14=|v_ULTIMATE.start_subxy_#t~mem14_1|, ULTIMATE.start_subxy_#t~mem15=|v_ULTIMATE.start_subxy_#t~mem15_1|, ULTIMATE.start_main_#t~ret22=|v_ULTIMATE.start_main_#t~ret22_1|, ULTIMATE.start_subxy_#t~mem17=|v_ULTIMATE.start_subxy_#t~mem17_1|, ULTIMATE.start_subxy_#t~mem11=|v_ULTIMATE.start_subxy_#t~mem11_1|, #length=|v_#length_1|, ULTIMATE.start_subxy_#t~mem13=|v_ULTIMATE.start_subxy_#t~mem13_1|, ULTIMATE.start_subxy_~x_ref~0.base=v_ULTIMATE.start_subxy_~x_ref~0.base_1, ULTIMATE.start_subxy_~z~0.base=v_ULTIMATE.start_subxy_~z~0.base_1, ULTIMATE.start_main_#t~nondet21=|v_ULTIMATE.start_main_#t~nondet21_1|, ULTIMATE.start_main_#t~nondet20=|v_ULTIMATE.start_main_#t~nondet20_1|, ULTIMATE.start_subxy_#in~x=|v_ULTIMATE.start_subxy_#in~x_1|, ULTIMATE.start_subxy_#t~malloc2.base=|v_ULTIMATE.start_subxy_#t~malloc2.base_1|, ULTIMATE.start_subxy_#t~malloc0.offset=|v_ULTIMATE.start_subxy_#t~malloc0.offset_1|, ULTIMATE.start_subxy_#t~post18=|v_ULTIMATE.start_subxy_#t~post18_1|, ULTIMATE.start_subxy_#t~post16=|v_ULTIMATE.start_subxy_#t~post16_1|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1, ULTIMATE.start_subxy_#t~malloc0.base=|v_ULTIMATE.start_subxy_#t~malloc0.base_1|, ULTIMATE.start_subxy_#t~malloc1.base=|v_ULTIMATE.start_subxy_#t~malloc1.base_1|, ULTIMATE.start_subxy_#t~malloc3.offset=|v_ULTIMATE.start_subxy_#t~malloc3.offset_1|, ULTIMATE.start_subxy_#t~malloc3.base=|v_ULTIMATE.start_subxy_#t~malloc3.base_1|, ULTIMATE.start_subxy_#in~y=|v_ULTIMATE.start_subxy_#in~y_1|, ULTIMATE.start_subxy_~i~0.base=v_ULTIMATE.start_subxy_~i~0.base_1, ULTIMATE.start_subxy_#t~malloc1.offset=|v_ULTIMATE.start_subxy_#t~malloc1.offset_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_subxy_#t~mem4=|v_ULTIMATE.start_subxy_#t~mem4_1|, ULTIMATE.start_subxy_~x=v_ULTIMATE.start_subxy_~x_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_subxy_#t~mem6=|v_ULTIMATE.start_subxy_#t~mem6_1|, #valid=|v_#valid_3|, ULTIMATE.start_subxy_#t~mem5=|v_ULTIMATE.start_subxy_#t~mem5_1|, ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_1, ULTIMATE.start_subxy_~y=v_ULTIMATE.start_subxy_~y_1, ULTIMATE.start_subxy_~i~0.offset=v_ULTIMATE.start_subxy_~i~0.offset_1} AuxVars[|v_ULTIMATE.start_main_#t~nondet21_22|, |v_ULTIMATE.start_main_#t~nondet20_22|] AssignedVars[ULTIMATE.start_subxy_~x_ref~0.offset, ULTIMATE.start_subxy_#t~malloc2.offset, ULTIMATE.start_subxy_~y_ref~0.base, ULTIMATE.start_subxy_#res, ULTIMATE.start_subxy_#t~mem8, ULTIMATE.start_subxy_#t~mem9, ULTIMATE.start_subxy_#t~short7, ULTIMATE.start_subxy_~y_ref~0.offset, ULTIMATE.start_subxy_#t~post12, ULTIMATE.start_subxy_~z~0.offset, ULTIMATE.start_subxy_#t~mem19, ULTIMATE.start_subxy_#t~post10, ULTIMATE.start_subxy_#t~mem14, ULTIMATE.start_subxy_#t~mem15, ULTIMATE.start_main_#t~ret22, ULTIMATE.start_subxy_#t~mem17, ULTIMATE.start_subxy_#t~mem11, #length, ULTIMATE.start_subxy_#t~mem13, ULTIMATE.start_subxy_~x_ref~0.base, ULTIMATE.start_subxy_~z~0.base, ULTIMATE.start_main_#t~nondet21, ULTIMATE.start_main_#t~nondet20, ULTIMATE.start_subxy_#in~x, ULTIMATE.start_subxy_#t~malloc2.base, ULTIMATE.start_subxy_#t~malloc0.offset, ULTIMATE.start_subxy_#t~post18, ULTIMATE.start_subxy_#t~post16, ULTIMATE.start_main_~x~0, ULTIMATE.start_subxy_#t~malloc0.base, ULTIMATE.start_subxy_#t~malloc1.base, ULTIMATE.start_subxy_#t~malloc3.offset, ULTIMATE.start_subxy_#t~malloc3.base, ULTIMATE.start_subxy_#in~y, ULTIMATE.start_subxy_~i~0.base, ULTIMATE.start_subxy_#t~malloc1.offset, ULTIMATE.start_subxy_#t~mem4, ULTIMATE.start_subxy_~x, ULTIMATE.start_main_#res, ULTIMATE.start_subxy_#t~mem6, #valid, ULTIMATE.start_subxy_#t~mem5, ULTIMATE.start_main_~y~0, ULTIMATE.start_subxy_~y, ULTIMATE.start_subxy_~i~0.offset] 573#L10 [124] L10-->L10-1: Formula: (and (= (select |v_#valid_8| v_ULTIMATE.start_subxy_~x_ref~0.base_3) 1) (<= (+ v_ULTIMATE.start_subxy_~x_ref~0.offset_3 4) (select |v_#length_6| v_ULTIMATE.start_subxy_~x_ref~0.base_3)) (<= 0 v_ULTIMATE.start_subxy_~x_ref~0.offset_3) (= (store |v_#memory_int_2| v_ULTIMATE.start_subxy_~x_ref~0.base_3 (store (select |v_#memory_int_2| v_ULTIMATE.start_subxy_~x_ref~0.base_3) v_ULTIMATE.start_subxy_~x_ref~0.offset_3 v_ULTIMATE.start_subxy_~x_3)) |v_#memory_int_1|)) InVars {ULTIMATE.start_subxy_~x_ref~0.offset=v_ULTIMATE.start_subxy_~x_ref~0.offset_3, ULTIMATE.start_subxy_~x=v_ULTIMATE.start_subxy_~x_3, #valid=|v_#valid_8|, #memory_int=|v_#memory_int_2|, #length=|v_#length_6|, ULTIMATE.start_subxy_~x_ref~0.base=v_ULTIMATE.start_subxy_~x_ref~0.base_3} OutVars{ULTIMATE.start_subxy_~x_ref~0.offset=v_ULTIMATE.start_subxy_~x_ref~0.offset_3, ULTIMATE.start_subxy_~x=v_ULTIMATE.start_subxy_~x_3, #valid=|v_#valid_8|, #memory_int=|v_#memory_int_1|, #length=|v_#length_6|, ULTIMATE.start_subxy_~x_ref~0.base=v_ULTIMATE.start_subxy_~x_ref~0.base_3} AuxVars[] AssignedVars[#memory_int] 574#L10-1 [181] L10-1-->L11: Formula: (and (= |v_#memory_int_3| (store |v_#memory_int_4| v_ULTIMATE.start_subxy_~y_ref~0.base_3 (store (select |v_#memory_int_4| v_ULTIMATE.start_subxy_~y_ref~0.base_3) v_ULTIMATE.start_subxy_~y_ref~0.offset_3 v_ULTIMATE.start_subxy_~y_3))) (= 1 (select |v_#valid_10| v_ULTIMATE.start_subxy_~y_ref~0.base_3)) (<= (+ v_ULTIMATE.start_subxy_~y_ref~0.offset_3 4) (select |v_#length_8| v_ULTIMATE.start_subxy_~y_ref~0.base_3)) (<= 0 v_ULTIMATE.start_subxy_~y_ref~0.offset_3)) InVars {ULTIMATE.start_subxy_~y_ref~0.offset=v_ULTIMATE.start_subxy_~y_ref~0.offset_3, ULTIMATE.start_subxy_~y_ref~0.base=v_ULTIMATE.start_subxy_~y_ref~0.base_3, #valid=|v_#valid_10|, #memory_int=|v_#memory_int_4|, ULTIMATE.start_subxy_~y=v_ULTIMATE.start_subxy_~y_3, #length=|v_#length_8|} OutVars{ULTIMATE.start_subxy_~y_ref~0.offset=v_ULTIMATE.start_subxy_~y_ref~0.offset_3, ULTIMATE.start_subxy_~y_ref~0.base=v_ULTIMATE.start_subxy_~y_ref~0.base_3, #valid=|v_#valid_10|, #memory_int=|v_#memory_int_3|, ULTIMATE.start_subxy_~y=v_ULTIMATE.start_subxy_~y_3, #length=|v_#length_8|} AuxVars[] AssignedVars[#memory_int] 594#L11 [154] L11-->L12: Formula: (and (= (store |v_#memory_int_6| v_ULTIMATE.start_subxy_~z~0.base_3 (store (select |v_#memory_int_6| v_ULTIMATE.start_subxy_~z~0.base_3) v_ULTIMATE.start_subxy_~z~0.offset_3 0)) |v_#memory_int_5|) (= 1 (select |v_#valid_12| v_ULTIMATE.start_subxy_~z~0.base_3)) (<= 0 v_ULTIMATE.start_subxy_~z~0.offset_3) (<= (+ v_ULTIMATE.start_subxy_~z~0.offset_3 4) (select |v_#length_10| v_ULTIMATE.start_subxy_~z~0.base_3))) InVars {#memory_int=|v_#memory_int_6|, ULTIMATE.start_subxy_~z~0.base=v_ULTIMATE.start_subxy_~z~0.base_3, ULTIMATE.start_subxy_~z~0.offset=v_ULTIMATE.start_subxy_~z~0.offset_3, #length=|v_#length_10|, #valid=|v_#valid_12|} OutVars{#memory_int=|v_#memory_int_5|, ULTIMATE.start_subxy_~z~0.base=v_ULTIMATE.start_subxy_~z~0.base_3, ULTIMATE.start_subxy_~z~0.offset=v_ULTIMATE.start_subxy_~z~0.offset_3, #length=|v_#length_10|, #valid=|v_#valid_12|} AuxVars[] AssignedVars[#memory_int] 581#L12 [164] L12-->L13: Formula: (and (<= 0 v_ULTIMATE.start_subxy_~x_ref~0.offset_5) (<= (+ v_ULTIMATE.start_subxy_~x_ref~0.offset_5 4) (select |v_#length_12| v_ULTIMATE.start_subxy_~x_ref~0.base_6)) (= 1 (select |v_#valid_14| v_ULTIMATE.start_subxy_~x_ref~0.base_6)) (= (select (select |v_#memory_int_7| v_ULTIMATE.start_subxy_~x_ref~0.base_6) v_ULTIMATE.start_subxy_~x_ref~0.offset_5) |v_ULTIMATE.start_subxy_#t~mem4_2|)) InVars {#memory_int=|v_#memory_int_7|, ULTIMATE.start_subxy_~x_ref~0.offset=v_ULTIMATE.start_subxy_~x_ref~0.offset_5, #length=|v_#length_12|, ULTIMATE.start_subxy_~x_ref~0.base=v_ULTIMATE.start_subxy_~x_ref~0.base_6, #valid=|v_#valid_14|} OutVars{ULTIMATE.start_subxy_~x_ref~0.offset=v_ULTIMATE.start_subxy_~x_ref~0.offset_5, ULTIMATE.start_subxy_#t~mem4=|v_ULTIMATE.start_subxy_#t~mem4_2|, #valid=|v_#valid_14|, #memory_int=|v_#memory_int_7|, #length=|v_#length_12|, ULTIMATE.start_subxy_~x_ref~0.base=v_ULTIMATE.start_subxy_~x_ref~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_subxy_#t~mem4] 582#L13 [334] L13-->L14: Formula: (and (= (store |v_#memory_int_29| v_ULTIMATE.start_subxy_~i~0.base_24 (store (select |v_#memory_int_29| v_ULTIMATE.start_subxy_~i~0.base_24) v_ULTIMATE.start_subxy_~i~0.offset_17 |v_ULTIMATE.start_subxy_#t~mem4_6|)) |v_#memory_int_28|) (<= 0 v_ULTIMATE.start_subxy_~i~0.offset_17) (<= (+ v_ULTIMATE.start_subxy_~i~0.offset_17 4) (select |v_#length_44| v_ULTIMATE.start_subxy_~i~0.base_24)) (= 1 (select |v_#valid_56| v_ULTIMATE.start_subxy_~i~0.base_24))) InVars {ULTIMATE.start_subxy_~i~0.base=v_ULTIMATE.start_subxy_~i~0.base_24, ULTIMATE.start_subxy_#t~mem4=|v_ULTIMATE.start_subxy_#t~mem4_6|, #valid=|v_#valid_56|, #memory_int=|v_#memory_int_29|, #length=|v_#length_44|, ULTIMATE.start_subxy_~i~0.offset=v_ULTIMATE.start_subxy_~i~0.offset_17} OutVars{ULTIMATE.start_subxy_~i~0.base=v_ULTIMATE.start_subxy_~i~0.base_24, ULTIMATE.start_subxy_#t~mem4=|v_ULTIMATE.start_subxy_#t~mem4_5|, #valid=|v_#valid_56|, #memory_int=|v_#memory_int_28|, #length=|v_#length_44|, ULTIMATE.start_subxy_~i~0.offset=v_ULTIMATE.start_subxy_~i~0.offset_17} AuxVars[] AssignedVars[ULTIMATE.start_subxy_#t~mem4, #memory_int] 585#L14 [139] L14-->L14-1: Formula: (and (= (select (select |v_#memory_int_10| v_ULTIMATE.start_subxy_~y_ref~0.base_6) v_ULTIMATE.start_subxy_~y_ref~0.offset_5) |v_ULTIMATE.start_subxy_#t~mem5_2|) (<= (+ v_ULTIMATE.start_subxy_~y_ref~0.offset_5 4) (select |v_#length_16| v_ULTIMATE.start_subxy_~y_ref~0.base_6)) (<= 0 v_ULTIMATE.start_subxy_~y_ref~0.offset_5) (= 1 (select |v_#valid_18| v_ULTIMATE.start_subxy_~y_ref~0.base_6))) InVars {ULTIMATE.start_subxy_~y_ref~0.offset=v_ULTIMATE.start_subxy_~y_ref~0.offset_5, #memory_int=|v_#memory_int_10|, #length=|v_#length_16|, ULTIMATE.start_subxy_~y_ref~0.base=v_ULTIMATE.start_subxy_~y_ref~0.base_6, #valid=|v_#valid_18|} OutVars{ULTIMATE.start_subxy_~y_ref~0.offset=v_ULTIMATE.start_subxy_~y_ref~0.offset_5, ULTIMATE.start_subxy_~y_ref~0.base=v_ULTIMATE.start_subxy_~y_ref~0.base_6, ULTIMATE.start_subxy_#t~mem5=|v_ULTIMATE.start_subxy_#t~mem5_2|, #valid=|v_#valid_18|, #memory_int=|v_#memory_int_10|, #length=|v_#length_16|} AuxVars[] AssignedVars[ULTIMATE.start_subxy_#t~mem5] 584#L14-1 [278] L14-1-->L14-2: Formula: (and (not |v_ULTIMATE.start_subxy_#t~short7_2|) (> |v_ULTIMATE.start_subxy_#t~mem5_3| 0)) InVars {ULTIMATE.start_subxy_#t~mem5=|v_ULTIMATE.start_subxy_#t~mem5_3|} OutVars{ULTIMATE.start_subxy_#t~short7=|v_ULTIMATE.start_subxy_#t~short7_2|, ULTIMATE.start_subxy_#t~mem5=|v_ULTIMATE.start_subxy_#t~mem5_3|} AuxVars[] AssignedVars[ULTIMATE.start_subxy_#t~short7] 583#L14-2 [135] L14-2-->L14-4: Formula: (not |v_ULTIMATE.start_subxy_#t~short7_4|) InVars {ULTIMATE.start_subxy_#t~short7=|v_ULTIMATE.start_subxy_#t~short7_4|} OutVars{ULTIMATE.start_subxy_#t~short7=|v_ULTIMATE.start_subxy_#t~short7_4|} AuxVars[] AssignedVars[] 575#L14-4 [127] L14-4-->L14-5: Formula: (and (= |v_ULTIMATE.start_subxy_#t~mem6_2| (select (select |v_#memory_int_11| v_ULTIMATE.start_subxy_~x_ref~0.base_9) v_ULTIMATE.start_subxy_~x_ref~0.offset_7)) (<= (+ v_ULTIMATE.start_subxy_~x_ref~0.offset_7 4) (select |v_#length_18| v_ULTIMATE.start_subxy_~x_ref~0.base_9)) (= 1 (select |v_#valid_20| v_ULTIMATE.start_subxy_~x_ref~0.base_9)) (<= 0 v_ULTIMATE.start_subxy_~x_ref~0.offset_7)) InVars {#memory_int=|v_#memory_int_11|, ULTIMATE.start_subxy_~x_ref~0.offset=v_ULTIMATE.start_subxy_~x_ref~0.offset_7, #length=|v_#length_18|, ULTIMATE.start_subxy_~x_ref~0.base=v_ULTIMATE.start_subxy_~x_ref~0.base_9, #valid=|v_#valid_20|} OutVars{ULTIMATE.start_subxy_~x_ref~0.offset=v_ULTIMATE.start_subxy_~x_ref~0.offset_7, ULTIMATE.start_subxy_#t~mem6=|v_ULTIMATE.start_subxy_#t~mem6_2|, #valid=|v_#valid_20|, #memory_int=|v_#memory_int_11|, #length=|v_#length_18|, ULTIMATE.start_subxy_~x_ref~0.base=v_ULTIMATE.start_subxy_~x_ref~0.base_9} AuxVars[] AssignedVars[ULTIMATE.start_subxy_#t~mem6] 576#L14-5 [288] L14-5-->L14-6: Formula: (and (not |v_ULTIMATE.start_subxy_#t~short7_5|) (> |v_ULTIMATE.start_subxy_#t~mem6_3| 0)) InVars {ULTIMATE.start_subxy_#t~mem6=|v_ULTIMATE.start_subxy_#t~mem6_3|} OutVars{ULTIMATE.start_subxy_#t~short7=|v_ULTIMATE.start_subxy_#t~short7_5|, ULTIMATE.start_subxy_#t~mem6=|v_ULTIMATE.start_subxy_#t~mem6_3|} AuxVars[] AssignedVars[ULTIMATE.start_subxy_#t~short7] 592#L14-6 [180] L14-6-->L17-3: Formula: (not |v_ULTIMATE.start_subxy_#t~short7_9|) InVars {ULTIMATE.start_subxy_#t~short7=|v_ULTIMATE.start_subxy_#t~short7_9|} OutVars{ULTIMATE.start_subxy_#t~short7=|v_ULTIMATE.start_subxy_#t~short7_8|, ULTIMATE.start_subxy_#t~mem6=|v_ULTIMATE.start_subxy_#t~mem6_5|, ULTIMATE.start_subxy_#t~mem5=|v_ULTIMATE.start_subxy_#t~mem5_5|} AuxVars[] AssignedVars[ULTIMATE.start_subxy_#t~mem6, ULTIMATE.start_subxy_#t~mem5, ULTIMATE.start_subxy_#t~short7] 593#L17-3 [192] L17-3-->L17-1: Formula: (and (= (select (select |v_#memory_int_12| v_ULTIMATE.start_subxy_~i~0.base_6) v_ULTIMATE.start_subxy_~i~0.offset_5) |v_ULTIMATE.start_subxy_#t~mem8_2|) (= 1 (select |v_#valid_27| v_ULTIMATE.start_subxy_~i~0.base_6)) (<= 0 v_ULTIMATE.start_subxy_~i~0.offset_5) (<= (+ v_ULTIMATE.start_subxy_~i~0.offset_5 4) (select |v_#length_20| v_ULTIMATE.start_subxy_~i~0.base_6))) InVars {ULTIMATE.start_subxy_~i~0.base=v_ULTIMATE.start_subxy_~i~0.base_6, #memory_int=|v_#memory_int_12|, #length=|v_#length_20|, ULTIMATE.start_subxy_~i~0.offset=v_ULTIMATE.start_subxy_~i~0.offset_5, #valid=|v_#valid_27|} OutVars{ULTIMATE.start_subxy_~i~0.base=v_ULTIMATE.start_subxy_~i~0.base_6, #valid=|v_#valid_27|, ULTIMATE.start_subxy_#t~mem8=|v_ULTIMATE.start_subxy_#t~mem8_2|, #memory_int=|v_#memory_int_12|, #length=|v_#length_20|, ULTIMATE.start_subxy_~i~0.offset=v_ULTIMATE.start_subxy_~i~0.offset_5} AuxVars[] AssignedVars[ULTIMATE.start_subxy_#t~mem8] 587#L17-1 [171] L17-1-->L18: Formula: (< 0 |v_ULTIMATE.start_subxy_#t~mem8_6|) InVars {ULTIMATE.start_subxy_#t~mem8=|v_ULTIMATE.start_subxy_#t~mem8_6|} OutVars{ULTIMATE.start_subxy_#t~mem8=|v_ULTIMATE.start_subxy_#t~mem8_5|} AuxVars[] AssignedVars[ULTIMATE.start_subxy_#t~mem8] 569#L18 [337] L18-->L18-2: Formula: (and (= 1 (select |v_#valid_57| v_ULTIMATE.start_subxy_~i~0.base_25)) (<= 0 v_ULTIMATE.start_subxy_~i~0.offset_18) (= |v_ULTIMATE.start_subxy_#t~post10_5| |v_ULTIMATE.start_subxy_#t~mem9_5|) (<= (+ v_ULTIMATE.start_subxy_~i~0.offset_18 4) (select |v_#length_45| v_ULTIMATE.start_subxy_~i~0.base_25)) (= (select (select |v_#memory_int_30| v_ULTIMATE.start_subxy_~i~0.base_25) v_ULTIMATE.start_subxy_~i~0.offset_18) |v_ULTIMATE.start_subxy_#t~mem9_5|)) InVars {ULTIMATE.start_subxy_~i~0.base=v_ULTIMATE.start_subxy_~i~0.base_25, #valid=|v_#valid_57|, #memory_int=|v_#memory_int_30|, #length=|v_#length_45|, ULTIMATE.start_subxy_~i~0.offset=v_ULTIMATE.start_subxy_~i~0.offset_18} OutVars{ULTIMATE.start_subxy_~i~0.base=v_ULTIMATE.start_subxy_~i~0.base_25, ULTIMATE.start_subxy_#t~post10=|v_ULTIMATE.start_subxy_#t~post10_5|, #valid=|v_#valid_57|, #memory_int=|v_#memory_int_30|, #length=|v_#length_45|, ULTIMATE.start_subxy_#t~mem9=|v_ULTIMATE.start_subxy_#t~mem9_5|, ULTIMATE.start_subxy_~i~0.offset=v_ULTIMATE.start_subxy_~i~0.offset_18} AuxVars[] AssignedVars[ULTIMATE.start_subxy_#t~post10, ULTIMATE.start_subxy_#t~mem9] 567#L18-2 [338] L18-2-->L19: Formula: (and (= (select |v_#valid_58| v_ULTIMATE.start_subxy_~i~0.base_26) 1) (= (store |v_#memory_int_32| v_ULTIMATE.start_subxy_~i~0.base_26 (store (select |v_#memory_int_32| v_ULTIMATE.start_subxy_~i~0.base_26) v_ULTIMATE.start_subxy_~i~0.offset_19 (+ |v_ULTIMATE.start_subxy_#t~post10_7| (- 1)))) |v_#memory_int_31|) (<= 0 v_ULTIMATE.start_subxy_~i~0.offset_19) (<= (+ v_ULTIMATE.start_subxy_~i~0.offset_19 4) (select |v_#length_46| v_ULTIMATE.start_subxy_~i~0.base_26))) InVars {ULTIMATE.start_subxy_~i~0.base=v_ULTIMATE.start_subxy_~i~0.base_26, ULTIMATE.start_subxy_#t~post10=|v_ULTIMATE.start_subxy_#t~post10_7|, #valid=|v_#valid_58|, #memory_int=|v_#memory_int_32|, #length=|v_#length_46|, ULTIMATE.start_subxy_~i~0.offset=v_ULTIMATE.start_subxy_~i~0.offset_19} OutVars{ULTIMATE.start_subxy_~i~0.base=v_ULTIMATE.start_subxy_~i~0.base_26, ULTIMATE.start_subxy_#t~post10=|v_ULTIMATE.start_subxy_#t~post10_6|, #valid=|v_#valid_58|, #memory_int=|v_#memory_int_31|, #length=|v_#length_46|, ULTIMATE.start_subxy_#t~mem9=|v_ULTIMATE.start_subxy_#t~mem9_6|, ULTIMATE.start_subxy_~i~0.offset=v_ULTIMATE.start_subxy_~i~0.offset_19} AuxVars[] AssignedVars[ULTIMATE.start_subxy_#t~post10, #memory_int, ULTIMATE.start_subxy_#t~mem9] 568#L19 [341] L19-->L19-2: Formula: (and (<= 0 v_ULTIMATE.start_subxy_~z~0.offset_16) (= |v_ULTIMATE.start_subxy_#t~post12_5| |v_ULTIMATE.start_subxy_#t~mem11_5|) (= (select |v_#valid_62| v_ULTIMATE.start_subxy_~z~0.base_22) 1) (<= (+ v_ULTIMATE.start_subxy_~z~0.offset_16 4) (select |v_#length_49| v_ULTIMATE.start_subxy_~z~0.base_22)) (= (select (select |v_#memory_int_35| v_ULTIMATE.start_subxy_~z~0.base_22) v_ULTIMATE.start_subxy_~z~0.offset_16) |v_ULTIMATE.start_subxy_#t~mem11_5|)) InVars {ULTIMATE.start_subxy_~z~0.base=v_ULTIMATE.start_subxy_~z~0.base_22, ULTIMATE.start_subxy_~z~0.offset=v_ULTIMATE.start_subxy_~z~0.offset_16, #valid=|v_#valid_62|, #memory_int=|v_#memory_int_35|, #length=|v_#length_49|} OutVars{ULTIMATE.start_subxy_#t~post12=|v_ULTIMATE.start_subxy_#t~post12_5|, ULTIMATE.start_subxy_~z~0.base=v_ULTIMATE.start_subxy_~z~0.base_22, ULTIMATE.start_subxy_~z~0.offset=v_ULTIMATE.start_subxy_~z~0.offset_16, #valid=|v_#valid_62|, #memory_int=|v_#memory_int_35|, ULTIMATE.start_subxy_#t~mem11=|v_ULTIMATE.start_subxy_#t~mem11_5|, #length=|v_#length_49|} AuxVars[] AssignedVars[ULTIMATE.start_subxy_#t~post12, ULTIMATE.start_subxy_#t~mem11] 588#L19-2 [343] L19-2-->L17-3: Formula: (and (= 1 (select |v_#valid_64| v_ULTIMATE.start_subxy_~z~0.base_23)) (<= (+ v_ULTIMATE.start_subxy_~z~0.offset_17 4) (select |v_#length_51| v_ULTIMATE.start_subxy_~z~0.base_23)) (<= 0 v_ULTIMATE.start_subxy_~z~0.offset_17) (= (store |v_#memory_int_39| v_ULTIMATE.start_subxy_~z~0.base_23 (store (select |v_#memory_int_39| v_ULTIMATE.start_subxy_~z~0.base_23) v_ULTIMATE.start_subxy_~z~0.offset_17 (+ |v_ULTIMATE.start_subxy_#t~post12_7| 1))) |v_#memory_int_38|)) InVars {ULTIMATE.start_subxy_#t~post12=|v_ULTIMATE.start_subxy_#t~post12_7|, ULTIMATE.start_subxy_~z~0.base=v_ULTIMATE.start_subxy_~z~0.base_23, ULTIMATE.start_subxy_~z~0.offset=v_ULTIMATE.start_subxy_~z~0.offset_17, #valid=|v_#valid_64|, #memory_int=|v_#memory_int_39|, #length=|v_#length_51|} OutVars{ULTIMATE.start_subxy_#t~post12=|v_ULTIMATE.start_subxy_#t~post12_6|, ULTIMATE.start_subxy_~z~0.base=v_ULTIMATE.start_subxy_~z~0.base_23, ULTIMATE.start_subxy_~z~0.offset=v_ULTIMATE.start_subxy_~z~0.offset_17, #valid=|v_#valid_64|, #memory_int=|v_#memory_int_38|, ULTIMATE.start_subxy_#t~mem11=|v_ULTIMATE.start_subxy_#t~mem11_6|, #length=|v_#length_51|} AuxVars[] AssignedVars[ULTIMATE.start_subxy_#t~post12, #memory_int, ULTIMATE.start_subxy_#t~mem11] 589#L17-3 [192] L17-3-->L17-1: Formula: (and (= (select (select |v_#memory_int_12| v_ULTIMATE.start_subxy_~i~0.base_6) v_ULTIMATE.start_subxy_~i~0.offset_5) |v_ULTIMATE.start_subxy_#t~mem8_2|) (= 1 (select |v_#valid_27| v_ULTIMATE.start_subxy_~i~0.base_6)) (<= 0 v_ULTIMATE.start_subxy_~i~0.offset_5) (<= (+ v_ULTIMATE.start_subxy_~i~0.offset_5 4) (select |v_#length_20| v_ULTIMATE.start_subxy_~i~0.base_6))) InVars {ULTIMATE.start_subxy_~i~0.base=v_ULTIMATE.start_subxy_~i~0.base_6, #memory_int=|v_#memory_int_12|, #length=|v_#length_20|, ULTIMATE.start_subxy_~i~0.offset=v_ULTIMATE.start_subxy_~i~0.offset_5, #valid=|v_#valid_27|} OutVars{ULTIMATE.start_subxy_~i~0.base=v_ULTIMATE.start_subxy_~i~0.base_6, #valid=|v_#valid_27|, ULTIMATE.start_subxy_#t~mem8=|v_ULTIMATE.start_subxy_#t~mem8_2|, #memory_int=|v_#memory_int_12|, #length=|v_#length_20|, ULTIMATE.start_subxy_~i~0.offset=v_ULTIMATE.start_subxy_~i~0.offset_5} AuxVars[] AssignedVars[ULTIMATE.start_subxy_#t~mem8] 586#L17-1 [216] L17-1-->L21-3: Formula: (>= 0 |v_ULTIMATE.start_subxy_#t~mem8_4|) InVars {ULTIMATE.start_subxy_#t~mem8=|v_ULTIMATE.start_subxy_#t~mem8_4|} OutVars{ULTIMATE.start_subxy_#t~mem8=|v_ULTIMATE.start_subxy_#t~mem8_3|} AuxVars[] AssignedVars[ULTIMATE.start_subxy_#t~mem8] 580#L21-3 48.71/31.66 [2019-03-28 12:43:08,959 INFO L796 eck$LassoCheckResult]: Loop: 580#L21-3 [176] L21-3-->L21: Formula: (and (<= 0 v_ULTIMATE.start_subxy_~i~0.offset_11) (= 1 (select |v_#valid_37| v_ULTIMATE.start_subxy_~i~0.base_15)) (<= (+ v_ULTIMATE.start_subxy_~i~0.offset_11 4) (select |v_#length_30| v_ULTIMATE.start_subxy_~i~0.base_15)) (= (select (select |v_#memory_int_19| v_ULTIMATE.start_subxy_~i~0.base_15) v_ULTIMATE.start_subxy_~i~0.offset_11) |v_ULTIMATE.start_subxy_#t~mem13_2|)) InVars {ULTIMATE.start_subxy_~i~0.base=v_ULTIMATE.start_subxy_~i~0.base_15, #memory_int=|v_#memory_int_19|, #length=|v_#length_30|, ULTIMATE.start_subxy_~i~0.offset=v_ULTIMATE.start_subxy_~i~0.offset_11, #valid=|v_#valid_37|} OutVars{ULTIMATE.start_subxy_~i~0.base=v_ULTIMATE.start_subxy_~i~0.base_15, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_19|, #length=|v_#length_30|, ULTIMATE.start_subxy_#t~mem13=|v_ULTIMATE.start_subxy_#t~mem13_2|, ULTIMATE.start_subxy_~i~0.offset=v_ULTIMATE.start_subxy_~i~0.offset_11} AuxVars[] AssignedVars[ULTIMATE.start_subxy_#t~mem13] 577#L21 [130] L21-->L21-1: Formula: (and (<= 0 v_ULTIMATE.start_subxy_~y_ref~0.offset_7) (= (select (select |v_#memory_int_20| v_ULTIMATE.start_subxy_~y_ref~0.base_9) v_ULTIMATE.start_subxy_~y_ref~0.offset_7) |v_ULTIMATE.start_subxy_#t~mem14_2|) (= (select |v_#valid_39| v_ULTIMATE.start_subxy_~y_ref~0.base_9) 1) (<= (+ v_ULTIMATE.start_subxy_~y_ref~0.offset_7 4) (select |v_#length_32| v_ULTIMATE.start_subxy_~y_ref~0.base_9))) InVars {ULTIMATE.start_subxy_~y_ref~0.offset=v_ULTIMATE.start_subxy_~y_ref~0.offset_7, #memory_int=|v_#memory_int_20|, #length=|v_#length_32|, ULTIMATE.start_subxy_~y_ref~0.base=v_ULTIMATE.start_subxy_~y_ref~0.base_9, #valid=|v_#valid_39|} OutVars{ULTIMATE.start_subxy_~y_ref~0.offset=v_ULTIMATE.start_subxy_~y_ref~0.offset_7, ULTIMATE.start_subxy_#t~mem14=|v_ULTIMATE.start_subxy_#t~mem14_2|, ULTIMATE.start_subxy_~y_ref~0.base=v_ULTIMATE.start_subxy_~y_ref~0.base_9, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_20|, #length=|v_#length_32|} AuxVars[] AssignedVars[ULTIMATE.start_subxy_#t~mem14] 578#L21-1 [186] L21-1-->L22: Formula: (< |v_ULTIMATE.start_subxy_#t~mem13_6| |v_ULTIMATE.start_subxy_#t~mem14_6|) InVars {ULTIMATE.start_subxy_#t~mem14=|v_ULTIMATE.start_subxy_#t~mem14_6|, ULTIMATE.start_subxy_#t~mem13=|v_ULTIMATE.start_subxy_#t~mem13_6|} OutVars{ULTIMATE.start_subxy_#t~mem14=|v_ULTIMATE.start_subxy_#t~mem14_5|, ULTIMATE.start_subxy_#t~mem13=|v_ULTIMATE.start_subxy_#t~mem13_5|} AuxVars[] AssignedVars[ULTIMATE.start_subxy_#t~mem14, ULTIMATE.start_subxy_#t~mem13] 595#L22 [339] L22-->L22-2: Formula: (and (= 1 (select |v_#valid_59| v_ULTIMATE.start_subxy_~i~0.base_27)) (<= (+ v_ULTIMATE.start_subxy_~i~0.offset_20 4) (select |v_#length_47| v_ULTIMATE.start_subxy_~i~0.base_27)) (<= 0 v_ULTIMATE.start_subxy_~i~0.offset_20) (= (select (select |v_#memory_int_33| v_ULTIMATE.start_subxy_~i~0.base_27) v_ULTIMATE.start_subxy_~i~0.offset_20) |v_ULTIMATE.start_subxy_#t~mem15_5|) (= |v_ULTIMATE.start_subxy_#t~post16_5| |v_ULTIMATE.start_subxy_#t~mem15_5|)) InVars {ULTIMATE.start_subxy_~i~0.base=v_ULTIMATE.start_subxy_~i~0.base_27, #valid=|v_#valid_59|, #memory_int=|v_#memory_int_33|, #length=|v_#length_47|, ULTIMATE.start_subxy_~i~0.offset=v_ULTIMATE.start_subxy_~i~0.offset_20} OutVars{ULTIMATE.start_subxy_~i~0.base=v_ULTIMATE.start_subxy_~i~0.base_27, ULTIMATE.start_subxy_#t~mem15=|v_ULTIMATE.start_subxy_#t~mem15_5|, #valid=|v_#valid_59|, #memory_int=|v_#memory_int_33|, #length=|v_#length_47|, ULTIMATE.start_subxy_#t~post16=|v_ULTIMATE.start_subxy_#t~post16_5|, ULTIMATE.start_subxy_~i~0.offset=v_ULTIMATE.start_subxy_~i~0.offset_20} AuxVars[] AssignedVars[ULTIMATE.start_subxy_#t~mem15, ULTIMATE.start_subxy_#t~post16] 570#L22-2 [342] L22-2-->L23: Formula: (and (<= (+ v_ULTIMATE.start_subxy_~i~0.offset_21 4) (select |v_#length_50| v_ULTIMATE.start_subxy_~i~0.base_28)) (= (store |v_#memory_int_37| v_ULTIMATE.start_subxy_~i~0.base_28 (store (select |v_#memory_int_37| v_ULTIMATE.start_subxy_~i~0.base_28) v_ULTIMATE.start_subxy_~i~0.offset_21 (+ |v_ULTIMATE.start_subxy_#t~post16_7| 1))) |v_#memory_int_36|) (= 1 (select |v_#valid_63| v_ULTIMATE.start_subxy_~i~0.base_28)) (<= 0 v_ULTIMATE.start_subxy_~i~0.offset_21)) InVars {ULTIMATE.start_subxy_~i~0.base=v_ULTIMATE.start_subxy_~i~0.base_28, #valid=|v_#valid_63|, #memory_int=|v_#memory_int_37|, #length=|v_#length_50|, ULTIMATE.start_subxy_#t~post16=|v_ULTIMATE.start_subxy_#t~post16_7|, ULTIMATE.start_subxy_~i~0.offset=v_ULTIMATE.start_subxy_~i~0.offset_21} OutVars{ULTIMATE.start_subxy_~i~0.base=v_ULTIMATE.start_subxy_~i~0.base_28, ULTIMATE.start_subxy_#t~mem15=|v_ULTIMATE.start_subxy_#t~mem15_6|, #valid=|v_#valid_63|, #memory_int=|v_#memory_int_36|, #length=|v_#length_50|, ULTIMATE.start_subxy_#t~post16=|v_ULTIMATE.start_subxy_#t~post16_6|, ULTIMATE.start_subxy_~i~0.offset=v_ULTIMATE.start_subxy_~i~0.offset_21} AuxVars[] AssignedVars[ULTIMATE.start_subxy_#t~mem15, #memory_int, ULTIMATE.start_subxy_#t~post16] 571#L23 [344] L23-->L23-2: Formula: (and (= (select (select |v_#memory_int_40| v_ULTIMATE.start_subxy_~z~0.base_24) v_ULTIMATE.start_subxy_~z~0.offset_18) |v_ULTIMATE.start_subxy_#t~mem17_5|) (= |v_ULTIMATE.start_subxy_#t~post18_5| |v_ULTIMATE.start_subxy_#t~mem17_5|) (<= 0 v_ULTIMATE.start_subxy_~z~0.offset_18) (<= (+ v_ULTIMATE.start_subxy_~z~0.offset_18 4) (select |v_#length_52| v_ULTIMATE.start_subxy_~z~0.base_24)) (= (select |v_#valid_65| v_ULTIMATE.start_subxy_~z~0.base_24) 1)) InVars {ULTIMATE.start_subxy_~z~0.base=v_ULTIMATE.start_subxy_~z~0.base_24, ULTIMATE.start_subxy_~z~0.offset=v_ULTIMATE.start_subxy_~z~0.offset_18, #valid=|v_#valid_65|, #memory_int=|v_#memory_int_40|, #length=|v_#length_52|} OutVars{ULTIMATE.start_subxy_~z~0.base=v_ULTIMATE.start_subxy_~z~0.base_24, ULTIMATE.start_subxy_~z~0.offset=v_ULTIMATE.start_subxy_~z~0.offset_18, ULTIMATE.start_subxy_#t~mem17=|v_ULTIMATE.start_subxy_#t~mem17_5|, #valid=|v_#valid_65|, #memory_int=|v_#memory_int_40|, ULTIMATE.start_subxy_#t~post18=|v_ULTIMATE.start_subxy_#t~post18_5|, #length=|v_#length_52|} AuxVars[] AssignedVars[ULTIMATE.start_subxy_#t~mem17, ULTIMATE.start_subxy_#t~post18] 579#L23-2 [345] L23-2-->L21-3: Formula: (and (<= (+ v_ULTIMATE.start_subxy_~z~0.offset_19 4) (select |v_#length_53| v_ULTIMATE.start_subxy_~z~0.base_25)) (= (store |v_#memory_int_42| v_ULTIMATE.start_subxy_~z~0.base_25 (store (select |v_#memory_int_42| v_ULTIMATE.start_subxy_~z~0.base_25) v_ULTIMATE.start_subxy_~z~0.offset_19 (+ |v_ULTIMATE.start_subxy_#t~post18_7| (- 1)))) |v_#memory_int_41|) (= 1 (select |v_#valid_66| v_ULTIMATE.start_subxy_~z~0.base_25)) (<= 0 v_ULTIMATE.start_subxy_~z~0.offset_19)) InVars {ULTIMATE.start_subxy_~z~0.base=v_ULTIMATE.start_subxy_~z~0.base_25, ULTIMATE.start_subxy_~z~0.offset=v_ULTIMATE.start_subxy_~z~0.offset_19, #valid=|v_#valid_66|, #memory_int=|v_#memory_int_42|, ULTIMATE.start_subxy_#t~post18=|v_ULTIMATE.start_subxy_#t~post18_7|, #length=|v_#length_53|} OutVars{ULTIMATE.start_subxy_~z~0.base=v_ULTIMATE.start_subxy_~z~0.base_25, ULTIMATE.start_subxy_~z~0.offset=v_ULTIMATE.start_subxy_~z~0.offset_19, ULTIMATE.start_subxy_#t~mem17=|v_ULTIMATE.start_subxy_#t~mem17_6|, #valid=|v_#valid_66|, #memory_int=|v_#memory_int_41|, ULTIMATE.start_subxy_#t~post18=|v_ULTIMATE.start_subxy_#t~post18_6|, #length=|v_#length_53|} AuxVars[] AssignedVars[ULTIMATE.start_subxy_#t~mem17, #memory_int, ULTIMATE.start_subxy_#t~post18] 580#L21-3 48.71/31.66 [2019-03-28 12:43:08,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 48.71/31.66 [2019-03-28 12:43:08,960 INFO L82 PathProgramCache]: Analyzing trace with hash 201401763, now seen corresponding path program 1 times 48.71/31.66 [2019-03-28 12:43:08,960 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 48.71/31.66 [2019-03-28 12:43:08,960 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 48.71/31.66 [2019-03-28 12:43:08,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 48.71/31.66 [2019-03-28 12:43:08,961 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 48.71/31.66 [2019-03-28 12:43:08,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 48.71/31.66 [2019-03-28 12:43:08,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 48.71/31.66 [2019-03-28 12:43:08,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 48.71/31.66 [2019-03-28 12:43:08,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 48.71/31.66 [2019-03-28 12:43:08,998 INFO L82 PathProgramCache]: Analyzing trace with hash -1361295701, now seen corresponding path program 2 times 48.71/31.66 [2019-03-28 12:43:08,998 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 48.71/31.66 [2019-03-28 12:43:08,998 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 48.71/31.66 [2019-03-28 12:43:08,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 48.71/31.66 [2019-03-28 12:43:08,999 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 48.71/31.66 [2019-03-28 12:43:08,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 48.71/31.66 [2019-03-28 12:43:09,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 48.71/31.66 [2019-03-28 12:43:09,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 48.71/31.66 [2019-03-28 12:43:09,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 48.71/31.66 [2019-03-28 12:43:09,009 INFO L82 PathProgramCache]: Analyzing trace with hash -1749686583, now seen corresponding path program 1 times 48.71/31.66 [2019-03-28 12:43:09,009 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 48.71/31.66 [2019-03-28 12:43:09,009 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 48.71/31.66 [2019-03-28 12:43:09,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 48.71/31.66 [2019-03-28 12:43:09,010 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 48.71/31.66 [2019-03-28 12:43:09,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 48.71/31.66 [2019-03-28 12:43:09,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 48.71/31.66 [2019-03-28 12:43:09,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 48.71/31.66 [2019-03-28 12:43:11,032 WARN L188 SmtUtils]: Spent 1.86 s on a formula simplification. DAG size of input: 178 DAG size of output: 161 48.71/31.66 [2019-03-28 12:43:11,617 WARN L188 SmtUtils]: Spent 577.00 ms on a formula simplification that was a NOOP. DAG size: 119 48.71/31.66 [2019-03-28 12:43:11,621 INFO L216 LassoAnalysis]: Preferences: 48.71/31.66 [2019-03-28 12:43:11,621 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 48.71/31.66 [2019-03-28 12:43:11,621 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 48.71/31.66 [2019-03-28 12:43:11,621 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 48.71/31.66 [2019-03-28 12:43:11,621 INFO L127 ssoRankerPreferences]: Use exernal solver: false 48.71/31.66 [2019-03-28 12:43:11,621 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 48.71/31.66 [2019-03-28 12:43:11,622 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 48.71/31.66 [2019-03-28 12:43:11,622 INFO L130 ssoRankerPreferences]: Path of dumped script: 48.71/31.66 [2019-03-28 12:43:11,622 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration4_Lasso 48.71/31.66 [2019-03-28 12:43:11,622 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 48.71/31.66 [2019-03-28 12:43:11,622 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 48.71/31.66 [2019-03-28 12:43:11,626 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 48.71/31.66 [2019-03-28 12:43:11,628 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 48.71/31.66 [2019-03-28 12:43:11,630 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 48.71/31.66 [2019-03-28 12:43:11,631 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 48.71/31.66 [2019-03-28 12:43:11,633 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 48.71/31.66 [2019-03-28 12:43:11,635 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 48.71/31.66 [2019-03-28 12:43:11,637 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 48.71/31.66 [2019-03-28 12:43:11,638 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 48.71/31.66 [2019-03-28 12:43:11,640 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 48.71/31.66 [2019-03-28 12:43:11,641 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 48.71/31.66 [2019-03-28 12:43:11,643 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 48.71/31.66 [2019-03-28 12:43:11,645 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 48.71/31.66 [2019-03-28 12:43:11,647 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 48.71/31.66 [2019-03-28 12:43:11,648 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 48.71/31.66 [2019-03-28 12:43:11,650 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 48.71/31.66 [2019-03-28 12:43:11,651 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 48.71/31.66 [2019-03-28 12:43:11,653 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 48.71/31.66 [2019-03-28 12:43:11,654 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 48.71/31.66 [2019-03-28 12:43:11,656 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 48.71/31.66 [2019-03-28 12:43:12,358 WARN L188 SmtUtils]: Spent 337.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 94 48.71/31.66 [2019-03-28 12:43:12,485 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 69 48.71/31.66 [2019-03-28 12:43:12,486 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 48.71/31.66 [2019-03-28 12:43:12,508 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 48.71/31.66 [2019-03-28 12:43:12,509 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 48.71/31.66 [2019-03-28 12:43:12,511 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 48.71/31.66 [2019-03-28 12:43:12,512 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 48.71/31.66 [2019-03-28 12:43:12,513 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 48.71/31.66 [2019-03-28 12:43:12,694 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 45 48.71/31.66 [2019-03-28 12:43:13,060 INFO L300 LassoAnalysis]: Preprocessing complete. 48.71/31.66 [2019-03-28 12:43:13,061 INFO L497 LassoAnalysis]: Using template 'affine'. 48.71/31.66 [2019-03-28 12:43:13,061 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 48.71/31.66 Termination analysis: LINEAR_WITH_GUESSES 48.71/31.66 Number of strict supporting invariants: 0 48.71/31.66 Number of non-strict supporting invariants: 1 48.71/31.66 Consider only non-deceasing supporting invariants: true 48.71/31.66 Simplify termination arguments: true 48.71/31.66 Simplify supporting invariants: trueOverapproximate stem: false 48.71/31.66 [2019-03-28 12:43:13,062 INFO L339 nArgumentSynthesizer]: Template has degree 0. 48.71/31.66 [2019-03-28 12:43:13,062 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 48.71/31.66 [2019-03-28 12:43:13,062 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 48.71/31.66 [2019-03-28 12:43:13,062 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 48.71/31.66 [2019-03-28 12:43:13,063 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 48.71/31.66 [2019-03-28 12:43:13,063 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 48.71/31.66 [2019-03-28 12:43:13,063 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 48.71/31.66 [2019-03-28 12:43:13,064 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 48.71/31.66 [2019-03-28 12:43:13,064 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 48.71/31.66 Termination analysis: LINEAR_WITH_GUESSES 48.71/31.66 Number of strict supporting invariants: 0 48.71/31.66 Number of non-strict supporting invariants: 1 48.71/31.66 Consider only non-deceasing supporting invariants: true 48.71/31.66 Simplify termination arguments: true 48.71/31.66 Simplify supporting invariants: trueOverapproximate stem: false 48.71/31.66 [2019-03-28 12:43:13,064 INFO L339 nArgumentSynthesizer]: Template has degree 0. 48.71/31.66 [2019-03-28 12:43:13,065 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 48.71/31.66 [2019-03-28 12:43:13,065 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 48.71/31.66 [2019-03-28 12:43:13,065 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 48.71/31.66 [2019-03-28 12:43:13,065 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 48.71/31.66 [2019-03-28 12:43:13,065 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 48.71/31.66 [2019-03-28 12:43:13,065 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 48.71/31.66 [2019-03-28 12:43:13,066 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 48.71/31.66 [2019-03-28 12:43:13,066 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 48.71/31.66 Termination analysis: LINEAR_WITH_GUESSES 48.71/31.66 Number of strict supporting invariants: 0 48.71/31.66 Number of non-strict supporting invariants: 1 48.71/31.66 Consider only non-deceasing supporting invariants: true 48.71/31.66 Simplify termination arguments: true 48.71/31.66 Simplify supporting invariants: trueOverapproximate stem: false 48.71/31.66 [2019-03-28 12:43:13,066 INFO L339 nArgumentSynthesizer]: Template has degree 0. 48.71/31.66 [2019-03-28 12:43:13,067 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 48.71/31.66 [2019-03-28 12:43:13,067 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 48.71/31.66 [2019-03-28 12:43:13,067 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 48.71/31.66 [2019-03-28 12:43:13,067 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 48.71/31.66 [2019-03-28 12:43:13,067 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 48.71/31.66 [2019-03-28 12:43:13,067 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 48.71/31.66 [2019-03-28 12:43:13,068 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 48.71/31.66 [2019-03-28 12:43:13,068 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 48.71/31.66 Termination analysis: LINEAR_WITH_GUESSES 48.71/31.66 Number of strict supporting invariants: 0 48.71/31.66 Number of non-strict supporting invariants: 1 48.71/31.66 Consider only non-deceasing supporting invariants: true 48.71/31.66 Simplify termination arguments: true 48.71/31.66 Simplify supporting invariants: trueOverapproximate stem: false 48.71/31.66 [2019-03-28 12:43:13,069 INFO L339 nArgumentSynthesizer]: Template has degree 0. 48.71/31.66 [2019-03-28 12:43:13,069 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 48.71/31.66 [2019-03-28 12:43:13,069 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 48.71/31.66 [2019-03-28 12:43:13,069 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 48.71/31.66 [2019-03-28 12:43:13,069 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 48.71/31.66 [2019-03-28 12:43:13,069 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 48.71/31.66 [2019-03-28 12:43:13,070 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 48.71/31.66 [2019-03-28 12:43:13,070 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 48.71/31.66 [2019-03-28 12:43:13,070 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 48.71/31.66 Termination analysis: LINEAR_WITH_GUESSES 48.71/31.66 Number of strict supporting invariants: 0 48.71/31.66 Number of non-strict supporting invariants: 1 48.71/31.66 Consider only non-deceasing supporting invariants: true 48.71/31.66 Simplify termination arguments: true 48.71/31.66 Simplify supporting invariants: trueOverapproximate stem: false 48.71/31.66 [2019-03-28 12:43:13,071 INFO L339 nArgumentSynthesizer]: Template has degree 0. 48.71/31.66 [2019-03-28 12:43:13,071 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 48.71/31.66 [2019-03-28 12:43:13,071 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 48.71/31.66 [2019-03-28 12:43:13,071 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 48.71/31.66 [2019-03-28 12:43:13,072 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 48.71/31.66 [2019-03-28 12:43:13,072 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 48.71/31.66 [2019-03-28 12:43:13,073 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 48.71/31.66 [2019-03-28 12:43:13,074 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 48.71/31.66 Termination analysis: LINEAR_WITH_GUESSES 48.71/31.66 Number of strict supporting invariants: 0 48.71/31.66 Number of non-strict supporting invariants: 1 48.71/31.66 Consider only non-deceasing supporting invariants: true 48.71/31.66 Simplify termination arguments: true 48.71/31.66 Simplify supporting invariants: trueOverapproximate stem: false 48.71/31.66 [2019-03-28 12:43:13,074 INFO L339 nArgumentSynthesizer]: Template has degree 0. 48.71/31.66 [2019-03-28 12:43:13,074 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 48.71/31.66 [2019-03-28 12:43:13,074 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 48.71/31.66 [2019-03-28 12:43:13,074 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 48.71/31.66 [2019-03-28 12:43:13,075 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 48.71/31.66 [2019-03-28 12:43:13,075 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 48.71/31.66 [2019-03-28 12:43:13,075 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 48.71/31.66 [2019-03-28 12:43:13,075 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 48.71/31.66 [2019-03-28 12:43:13,076 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 48.71/31.66 Termination analysis: LINEAR_WITH_GUESSES 48.71/31.66 Number of strict supporting invariants: 0 48.71/31.66 Number of non-strict supporting invariants: 1 48.71/31.66 Consider only non-deceasing supporting invariants: true 48.71/31.66 Simplify termination arguments: true 48.71/31.66 Simplify supporting invariants: trueOverapproximate stem: false 48.71/31.66 [2019-03-28 12:43:13,076 INFO L339 nArgumentSynthesizer]: Template has degree 0. 48.71/31.66 [2019-03-28 12:43:13,076 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 48.71/31.66 [2019-03-28 12:43:13,076 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 48.71/31.66 [2019-03-28 12:43:13,076 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 48.71/31.66 [2019-03-28 12:43:13,077 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 48.71/31.66 [2019-03-28 12:43:13,077 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 48.71/31.66 [2019-03-28 12:43:13,077 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 48.71/31.66 [2019-03-28 12:43:13,077 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 48.71/31.66 [2019-03-28 12:43:13,078 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 48.71/31.66 Termination analysis: LINEAR_WITH_GUESSES 48.71/31.66 Number of strict supporting invariants: 0 48.71/31.66 Number of non-strict supporting invariants: 1 48.71/31.66 Consider only non-deceasing supporting invariants: true 48.71/31.66 Simplify termination arguments: true 48.71/31.66 Simplify supporting invariants: trueOverapproximate stem: false 48.71/31.66 [2019-03-28 12:43:13,078 INFO L339 nArgumentSynthesizer]: Template has degree 0. 48.71/31.66 [2019-03-28 12:43:13,078 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 48.71/31.66 [2019-03-28 12:43:13,078 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 48.71/31.66 [2019-03-28 12:43:13,078 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 48.71/31.66 [2019-03-28 12:43:13,079 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 48.71/31.66 [2019-03-28 12:43:13,079 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 48.71/31.66 [2019-03-28 12:43:13,079 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 48.71/31.66 [2019-03-28 12:43:13,079 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 48.71/31.66 [2019-03-28 12:43:13,080 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 48.71/31.66 Termination analysis: LINEAR_WITH_GUESSES 48.71/31.66 Number of strict supporting invariants: 0 48.71/31.66 Number of non-strict supporting invariants: 1 48.71/31.66 Consider only non-deceasing supporting invariants: true 48.71/31.66 Simplify termination arguments: true 48.71/31.66 Simplify supporting invariants: trueOverapproximate stem: false 48.71/31.66 [2019-03-28 12:43:13,080 INFO L339 nArgumentSynthesizer]: Template has degree 0. 48.71/31.66 [2019-03-28 12:43:13,080 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 48.71/31.66 [2019-03-28 12:43:13,080 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 48.71/31.66 [2019-03-28 12:43:13,080 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 48.71/31.66 [2019-03-28 12:43:13,081 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 48.71/31.66 [2019-03-28 12:43:13,081 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 48.71/31.66 [2019-03-28 12:43:13,081 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 48.71/31.66 [2019-03-28 12:43:13,082 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 48.71/31.66 [2019-03-28 12:43:13,082 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 48.71/31.66 Termination analysis: LINEAR_WITH_GUESSES 48.71/31.66 Number of strict supporting invariants: 0 48.71/31.66 Number of non-strict supporting invariants: 1 48.71/31.66 Consider only non-deceasing supporting invariants: true 48.71/31.66 Simplify termination arguments: true 48.71/31.66 Simplify supporting invariants: trueOverapproximate stem: false 48.71/31.66 [2019-03-28 12:43:13,082 INFO L339 nArgumentSynthesizer]: Template has degree 0. 48.71/31.66 [2019-03-28 12:43:13,082 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 48.71/31.66 [2019-03-28 12:43:13,082 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 48.71/31.66 [2019-03-28 12:43:13,083 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 48.71/31.66 [2019-03-28 12:43:13,083 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 48.71/31.66 [2019-03-28 12:43:13,084 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 48.71/31.66 [2019-03-28 12:43:13,085 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 48.71/31.66 [2019-03-28 12:43:13,085 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 48.71/31.66 Termination analysis: LINEAR_WITH_GUESSES 48.71/31.66 Number of strict supporting invariants: 0 48.71/31.66 Number of non-strict supporting invariants: 1 48.71/31.66 Consider only non-deceasing supporting invariants: true 48.71/31.66 Simplify termination arguments: true 48.71/31.66 Simplify supporting invariants: trueOverapproximate stem: false 48.71/31.66 [2019-03-28 12:43:13,085 INFO L339 nArgumentSynthesizer]: Template has degree 0. 48.71/31.66 [2019-03-28 12:43:13,086 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 48.71/31.66 [2019-03-28 12:43:13,086 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 48.71/31.66 [2019-03-28 12:43:13,086 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 48.71/31.66 [2019-03-28 12:43:13,087 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 48.71/31.66 [2019-03-28 12:43:13,087 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 48.71/31.66 [2019-03-28 12:43:13,088 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 48.71/31.66 [2019-03-28 12:43:13,088 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 48.71/31.66 Termination analysis: LINEAR_WITH_GUESSES 48.71/31.66 Number of strict supporting invariants: 0 48.71/31.66 Number of non-strict supporting invariants: 1 48.71/31.66 Consider only non-deceasing supporting invariants: true 48.71/31.66 Simplify termination arguments: true 48.71/31.66 Simplify supporting invariants: trueOverapproximate stem: false 48.71/31.66 [2019-03-28 12:43:13,089 INFO L339 nArgumentSynthesizer]: Template has degree 0. 48.71/31.66 [2019-03-28 12:43:13,089 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 48.71/31.66 [2019-03-28 12:43:13,089 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 48.71/31.66 [2019-03-28 12:43:13,089 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 48.71/31.66 [2019-03-28 12:43:13,089 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 48.71/31.66 [2019-03-28 12:43:13,090 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 48.71/31.66 [2019-03-28 12:43:13,090 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 48.71/31.66 [2019-03-28 12:43:13,090 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 48.71/31.66 [2019-03-28 12:43:13,090 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 48.71/31.66 Termination analysis: LINEAR_WITH_GUESSES 48.71/31.66 Number of strict supporting invariants: 0 48.71/31.66 Number of non-strict supporting invariants: 1 48.71/31.66 Consider only non-deceasing supporting invariants: true 48.71/31.66 Simplify termination arguments: true 48.71/31.66 Simplify supporting invariants: trueOverapproximate stem: false 48.71/31.66 [2019-03-28 12:43:13,091 INFO L339 nArgumentSynthesizer]: Template has degree 0. 48.71/31.66 [2019-03-28 12:43:13,091 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 48.71/31.66 [2019-03-28 12:43:13,091 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 48.71/31.66 [2019-03-28 12:43:13,091 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 48.71/31.66 [2019-03-28 12:43:13,091 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 48.71/31.66 [2019-03-28 12:43:13,092 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 48.71/31.66 [2019-03-28 12:43:13,092 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 48.71/31.66 [2019-03-28 12:43:13,092 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 48.71/31.66 [2019-03-28 12:43:13,092 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 48.71/31.66 Termination analysis: LINEAR_WITH_GUESSES 48.71/31.66 Number of strict supporting invariants: 0 48.71/31.66 Number of non-strict supporting invariants: 1 48.71/31.66 Consider only non-deceasing supporting invariants: true 48.71/31.66 Simplify termination arguments: true 48.71/31.66 Simplify supporting invariants: trueOverapproximate stem: false 48.71/31.66 [2019-03-28 12:43:13,093 INFO L339 nArgumentSynthesizer]: Template has degree 0. 48.71/31.66 [2019-03-28 12:43:13,093 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 48.71/31.66 [2019-03-28 12:43:13,093 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 48.71/31.66 [2019-03-28 12:43:13,093 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 48.71/31.66 [2019-03-28 12:43:13,093 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 48.71/31.66 [2019-03-28 12:43:13,094 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 48.71/31.66 [2019-03-28 12:43:13,094 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 48.71/31.66 [2019-03-28 12:43:13,094 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 48.71/31.66 [2019-03-28 12:43:13,095 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 48.71/31.66 Termination analysis: LINEAR_WITH_GUESSES 48.71/31.66 Number of strict supporting invariants: 0 48.71/31.66 Number of non-strict supporting invariants: 1 48.71/31.66 Consider only non-deceasing supporting invariants: true 48.71/31.66 Simplify termination arguments: true 48.71/31.66 Simplify supporting invariants: trueOverapproximate stem: false 48.71/31.66 [2019-03-28 12:43:13,095 INFO L339 nArgumentSynthesizer]: Template has degree 0. 48.71/31.66 [2019-03-28 12:43:13,095 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 48.71/31.66 [2019-03-28 12:43:13,095 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 48.71/31.66 [2019-03-28 12:43:13,095 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 48.71/31.66 [2019-03-28 12:43:13,095 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 48.71/31.66 [2019-03-28 12:43:13,096 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 48.71/31.66 [2019-03-28 12:43:13,096 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 48.71/31.66 [2019-03-28 12:43:13,096 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 48.71/31.66 [2019-03-28 12:43:13,097 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 48.71/31.66 Termination analysis: LINEAR_WITH_GUESSES 48.71/31.66 Number of strict supporting invariants: 0 48.71/31.66 Number of non-strict supporting invariants: 1 48.71/31.66 Consider only non-deceasing supporting invariants: true 48.71/31.66 Simplify termination arguments: true 48.71/31.66 Simplify supporting invariants: trueOverapproximate stem: false 48.71/31.66 [2019-03-28 12:43:13,097 INFO L339 nArgumentSynthesizer]: Template has degree 0. 48.71/31.66 [2019-03-28 12:43:13,097 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 48.71/31.66 [2019-03-28 12:43:13,097 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 48.71/31.66 [2019-03-28 12:43:13,097 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 48.71/31.66 [2019-03-28 12:43:13,097 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 48.71/31.66 [2019-03-28 12:43:13,098 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 48.71/31.66 [2019-03-28 12:43:13,098 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 48.71/31.66 [2019-03-28 12:43:13,098 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 48.71/31.66 [2019-03-28 12:43:13,099 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 48.71/31.66 Termination analysis: LINEAR_WITH_GUESSES 48.71/31.66 Number of strict supporting invariants: 0 48.71/31.66 Number of non-strict supporting invariants: 1 48.71/31.66 Consider only non-deceasing supporting invariants: true 48.71/31.66 Simplify termination arguments: true 48.71/31.66 Simplify supporting invariants: trueOverapproximate stem: false 48.71/31.66 [2019-03-28 12:43:13,099 INFO L339 nArgumentSynthesizer]: Template has degree 0. 48.71/31.66 [2019-03-28 12:43:13,099 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 48.71/31.66 [2019-03-28 12:43:13,099 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 48.71/31.66 [2019-03-28 12:43:13,099 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 48.71/31.66 [2019-03-28 12:43:13,100 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 48.71/31.66 [2019-03-28 12:43:13,100 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 48.71/31.66 [2019-03-28 12:43:13,100 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 48.71/31.66 [2019-03-28 12:43:13,101 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 48.71/31.66 [2019-03-28 12:43:13,101 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 48.71/31.66 Termination analysis: LINEAR_WITH_GUESSES 48.71/31.66 Number of strict supporting invariants: 0 48.71/31.66 Number of non-strict supporting invariants: 1 48.71/31.66 Consider only non-deceasing supporting invariants: true 48.71/31.66 Simplify termination arguments: true 48.71/31.66 Simplify supporting invariants: trueOverapproximate stem: false 48.71/31.66 [2019-03-28 12:43:13,101 INFO L339 nArgumentSynthesizer]: Template has degree 0. 48.71/31.66 [2019-03-28 12:43:13,101 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 48.71/31.66 [2019-03-28 12:43:13,101 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 48.71/31.66 [2019-03-28 12:43:13,102 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 48.71/31.66 [2019-03-28 12:43:13,102 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 48.71/31.66 [2019-03-28 12:43:13,102 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 48.71/31.66 [2019-03-28 12:43:13,102 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 48.71/31.66 [2019-03-28 12:43:13,103 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 48.71/31.66 [2019-03-28 12:43:13,103 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 48.71/31.66 Termination analysis: LINEAR_WITH_GUESSES 48.71/31.66 Number of strict supporting invariants: 0 48.71/31.66 Number of non-strict supporting invariants: 1 48.71/31.66 Consider only non-deceasing supporting invariants: true 48.71/31.66 Simplify termination arguments: true 48.71/31.66 Simplify supporting invariants: trueOverapproximate stem: false 48.71/31.66 [2019-03-28 12:43:13,103 INFO L339 nArgumentSynthesizer]: Template has degree 0. 48.71/31.66 [2019-03-28 12:43:13,104 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 48.71/31.66 [2019-03-28 12:43:13,104 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 48.71/31.66 [2019-03-28 12:43:13,104 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 48.71/31.66 [2019-03-28 12:43:13,105 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 48.71/31.66 [2019-03-28 12:43:13,105 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 48.71/31.66 [2019-03-28 12:43:13,108 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 48.71/31.66 [2019-03-28 12:43:13,109 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 48.71/31.66 Termination analysis: LINEAR_WITH_GUESSES 48.71/31.66 Number of strict supporting invariants: 0 48.71/31.66 Number of non-strict supporting invariants: 1 48.71/31.66 Consider only non-deceasing supporting invariants: true 48.71/31.66 Simplify termination arguments: true 48.71/31.66 Simplify supporting invariants: trueOverapproximate stem: false 48.71/31.66 [2019-03-28 12:43:13,109 INFO L339 nArgumentSynthesizer]: Template has degree 0. 48.71/31.66 [2019-03-28 12:43:13,109 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 48.71/31.66 [2019-03-28 12:43:13,110 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 48.71/31.66 [2019-03-28 12:43:13,110 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 48.71/31.66 [2019-03-28 12:43:13,111 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 48.71/31.66 [2019-03-28 12:43:13,111 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 48.71/31.66 [2019-03-28 12:43:13,115 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 48.71/31.66 [2019-03-28 12:43:13,116 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 48.71/31.66 Termination analysis: LINEAR_WITH_GUESSES 48.71/31.66 Number of strict supporting invariants: 0 48.71/31.66 Number of non-strict supporting invariants: 1 48.71/31.66 Consider only non-deceasing supporting invariants: true 48.71/31.66 Simplify termination arguments: true 48.71/31.66 Simplify supporting invariants: trueOverapproximate stem: false 48.71/31.66 [2019-03-28 12:43:13,116 INFO L339 nArgumentSynthesizer]: Template has degree 0. 48.71/31.66 [2019-03-28 12:43:13,116 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 48.71/31.66 [2019-03-28 12:43:13,116 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 48.71/31.66 [2019-03-28 12:43:13,117 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 48.71/31.66 [2019-03-28 12:43:13,118 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 48.71/31.66 [2019-03-28 12:43:13,118 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 48.71/31.66 [2019-03-28 12:43:13,122 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 48.71/31.66 [2019-03-28 12:43:13,123 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 48.71/31.66 Termination analysis: LINEAR_WITH_GUESSES 48.71/31.66 Number of strict supporting invariants: 0 48.71/31.66 Number of non-strict supporting invariants: 1 48.71/31.66 Consider only non-deceasing supporting invariants: true 48.71/31.66 Simplify termination arguments: true 48.71/31.66 Simplify supporting invariants: trueOverapproximate stem: false 48.71/31.66 [2019-03-28 12:43:13,123 INFO L339 nArgumentSynthesizer]: Template has degree 0. 48.71/31.66 [2019-03-28 12:43:13,123 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 48.71/31.66 [2019-03-28 12:43:13,123 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 48.71/31.66 [2019-03-28 12:43:13,124 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 48.71/31.66 [2019-03-28 12:43:13,124 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 48.71/31.66 [2019-03-28 12:43:13,124 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 48.71/31.66 [2019-03-28 12:43:13,126 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 48.71/31.66 [2019-03-28 12:43:13,127 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 48.71/31.66 Termination analysis: LINEAR_WITH_GUESSES 48.71/31.66 Number of strict supporting invariants: 0 48.71/31.66 Number of non-strict supporting invariants: 1 48.71/31.66 Consider only non-deceasing supporting invariants: true 48.71/31.66 Simplify termination arguments: true 48.71/31.66 Simplify supporting invariants: trueOverapproximate stem: false 48.71/31.66 [2019-03-28 12:43:13,127 INFO L339 nArgumentSynthesizer]: Template has degree 0. 48.71/31.66 [2019-03-28 12:43:13,127 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 48.71/31.66 [2019-03-28 12:43:13,127 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 48.71/31.66 [2019-03-28 12:43:13,128 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 48.71/31.66 [2019-03-28 12:43:13,128 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 48.71/31.66 [2019-03-28 12:43:13,128 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 48.71/31.66 [2019-03-28 12:43:13,130 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 48.71/31.66 [2019-03-28 12:43:13,130 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 48.71/31.66 Termination analysis: LINEAR_WITH_GUESSES 48.71/31.66 Number of strict supporting invariants: 0 48.71/31.66 Number of non-strict supporting invariants: 1 48.71/31.66 Consider only non-deceasing supporting invariants: true 48.71/31.66 Simplify termination arguments: true 48.71/31.66 Simplify supporting invariants: trueOverapproximate stem: false 48.71/31.66 [2019-03-28 12:43:13,130 INFO L339 nArgumentSynthesizer]: Template has degree 0. 48.71/31.66 [2019-03-28 12:43:13,131 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 48.71/31.66 [2019-03-28 12:43:13,131 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 48.71/31.66 [2019-03-28 12:43:13,131 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 48.71/31.66 [2019-03-28 12:43:13,132 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 48.71/31.66 [2019-03-28 12:43:13,132 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 48.71/31.66 [2019-03-28 12:43:13,136 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 48.71/31.66 [2019-03-28 12:43:13,136 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 48.71/31.66 Termination analysis: LINEAR_WITH_GUESSES 48.71/31.66 Number of strict supporting invariants: 0 48.71/31.66 Number of non-strict supporting invariants: 1 48.71/31.66 Consider only non-deceasing supporting invariants: true 48.71/31.66 Simplify termination arguments: true 48.71/31.66 Simplify supporting invariants: trueOverapproximate stem: false 48.71/31.66 [2019-03-28 12:43:13,137 INFO L339 nArgumentSynthesizer]: Template has degree 0. 48.71/31.66 [2019-03-28 12:43:13,137 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 48.71/31.66 [2019-03-28 12:43:13,137 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 48.71/31.66 [2019-03-28 12:43:13,137 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 48.71/31.66 [2019-03-28 12:43:13,140 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 48.71/31.66 [2019-03-28 12:43:13,140 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 48.71/31.66 [2019-03-28 12:43:13,161 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 48.71/31.66 [2019-03-28 12:43:13,162 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 48.71/31.66 Termination analysis: LINEAR_WITH_GUESSES 48.71/31.66 Number of strict supporting invariants: 0 48.71/31.66 Number of non-strict supporting invariants: 1 48.71/31.66 Consider only non-deceasing supporting invariants: true 48.71/31.66 Simplify termination arguments: true 48.71/31.66 Simplify supporting invariants: trueOverapproximate stem: false 48.71/31.66 [2019-03-28 12:43:13,162 INFO L339 nArgumentSynthesizer]: Template has degree 0. 48.71/31.66 [2019-03-28 12:43:13,162 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 48.71/31.66 [2019-03-28 12:43:13,163 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 48.71/31.66 [2019-03-28 12:43:13,163 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 48.71/31.66 [2019-03-28 12:43:13,164 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 48.71/31.66 [2019-03-28 12:43:13,165 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 48.71/31.66 [2019-03-28 12:43:13,177 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 48.71/31.66 [2019-03-28 12:43:13,186 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 48.71/31.66 [2019-03-28 12:43:13,186 INFO L444 ModelExtractionUtils]: 27 out of 31 variables were initially zero. Simplification set additionally 1 variables to zero. 48.71/31.66 [2019-03-28 12:43:13,186 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 48.71/31.66 [2019-03-28 12:43:13,187 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. 48.71/31.66 [2019-03-28 12:43:13,188 INFO L518 LassoAnalysis]: Proved termination. 48.71/31.66 [2019-03-28 12:43:13,188 INFO L520 LassoAnalysis]: Termination argument consisting of: 48.71/31.66 Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_subxy_~i~0.base) ULTIMATE.start_subxy_~i~0.offset)_2, v_rep(select (select #memory_int ULTIMATE.start_subxy_~y_ref~0.base) ULTIMATE.start_subxy_~y_ref~0.offset)_2) = -1*v_rep(select (select #memory_int ULTIMATE.start_subxy_~i~0.base) ULTIMATE.start_subxy_~i~0.offset)_2 + 1*v_rep(select (select #memory_int ULTIMATE.start_subxy_~y_ref~0.base) ULTIMATE.start_subxy_~y_ref~0.offset)_2 48.71/31.66 Supporting invariants [] 48.71/31.66 [2019-03-28 12:43:13,370 INFO L297 tatePredicateManager]: 39 out of 41 supporting invariants were superfluous and have been removed 48.71/31.66 [2019-03-28 12:43:13,375 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 48.71/31.66 [2019-03-28 12:43:13,375 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 48.71/31.66 [2019-03-28 12:43:13,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 48.71/31.66 [2019-03-28 12:43:13,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 48.71/31.66 [2019-03-28 12:43:13,429 INFO L256 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 8 conjunts are in the unsatisfiable core 48.71/31.66 [2019-03-28 12:43:13,430 INFO L279 TraceCheckSpWp]: Computing forward predicates... 48.71/31.66 [2019-03-28 12:43:13,436 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 48.71/31.66 [2019-03-28 12:43:13,436 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 48.71/31.66 [2019-03-28 12:43:13,443 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 48.71/31.66 [2019-03-28 12:43:13,444 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. 48.71/31.66 [2019-03-28 12:43:13,444 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:9 48.71/31.66 [2019-03-28 12:43:13,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 48.71/31.66 [2019-03-28 12:43:13,458 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 14 conjunts are in the unsatisfiable core 48.71/31.66 [2019-03-28 12:43:13,458 INFO L279 TraceCheckSpWp]: Computing forward predicates... 48.71/31.66 [2019-03-28 12:43:13,569 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 48.71/31.66 [2019-03-28 12:43:13,570 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 68 48.71/31.66 [2019-03-28 12:43:13,579 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 48.71/31.66 [2019-03-28 12:43:13,616 INFO L497 ElimStorePlain]: treesize reduction 37, result has 50.7 percent of original size 48.71/31.66 [2019-03-28 12:43:13,617 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 48.71/31.66 [2019-03-28 12:43:13,618 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:54, output treesize:34 48.71/31.66 [2019-03-28 12:43:13,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 48.71/31.66 [2019-03-28 12:43:13,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 48.71/31.66 [2019-03-28 12:43:13,835 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 48.71/31.66 [2019-03-28 12:43:13,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 48.71/31.66 [2019-03-28 12:43:13,843 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 48.71/31.66 [2019-03-28 12:43:13,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 48.71/31.66 [2019-03-28 12:43:13,852 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 14 conjunts are in the unsatisfiable core 48.71/31.66 [2019-03-28 12:43:13,853 INFO L279 TraceCheckSpWp]: Computing forward predicates... 48.71/31.66 [2019-03-28 12:43:13,913 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 48.71/31.66 [2019-03-28 12:43:13,913 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 82 48.71/31.66 [2019-03-28 12:43:13,925 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 48.71/31.66 [2019-03-28 12:43:13,995 INFO L497 ElimStorePlain]: treesize reduction 85, result has 39.7 percent of original size 48.71/31.66 [2019-03-28 12:43:13,996 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 48.71/31.66 [2019-03-28 12:43:13,997 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:41, output treesize:50 48.71/31.66 [2019-03-28 12:43:22,368 WARN L188 SmtUtils]: Spent 3.63 s on a formula simplification that was a NOOP. DAG size: 32 48.71/31.66 [2019-03-28 12:43:23,306 WARN L860 $PredicateComparison]: unable to prove that (or (<= (+ (select (select |c_#memory_int| c_ULTIMATE.start_subxy_~z~0.base) c_ULTIMATE.start_subxy_~y_ref~0.offset) 1) (+ c_oldRank0 (select (select |c_#memory_int| c_ULTIMATE.start_subxy_~i~0.base) c_ULTIMATE.start_subxy_~i~0.offset))) (exists ((ULTIMATE.start_subxy_~z~0.offset Int)) (not (and (= ULTIMATE.start_subxy_~z~0.offset c_ULTIMATE.start_subxy_~y_ref~0.offset) (= c_ULTIMATE.start_subxy_~z~0.base c_ULTIMATE.start_subxy_~y_ref~0.base))))) is different from true 48.71/31.66 [2019-03-28 12:43:23,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 48.71/31.66 [2019-03-28 12:43:23,372 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 48.71/31.66 [2019-03-28 12:43:23,372 INFO L98 LoopCannibalizer]: 11 predicates before loop cannibalization 15 predicates after loop cannibalization 48.71/31.66 [2019-03-28 12:43:23,373 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.3 stem predicates 15 loop predicates 48.71/31.66 [2019-03-28 12:43:23,373 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 30 states and 46 transitions. cyclomatic complexity: 18 Second operand 9 states. 48.71/31.66 [2019-03-28 12:43:27,764 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 30 states and 46 transitions. cyclomatic complexity: 18. Second operand 9 states. Result 41 states and 58 transitions. Complement of second has 20 states. 48.71/31.66 [2019-03-28 12:43:28,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 12 states 2 stem states 8 non-accepting loop states 2 accepting loop states 48.71/31.66 [2019-03-28 12:43:28,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. 48.71/31.66 [2019-03-28 12:43:28,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 53 transitions. 48.71/31.66 [2019-03-28 12:43:28,217 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 53 transitions. Stem has 21 letters. Loop has 7 letters. 48.71/31.66 [2019-03-28 12:43:28,218 INFO L116 BuchiAccepts]: Finished buchiAccepts. 48.71/31.66 [2019-03-28 12:43:28,218 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 53 transitions. Stem has 28 letters. Loop has 7 letters. 48.71/31.66 [2019-03-28 12:43:28,218 INFO L116 BuchiAccepts]: Finished buchiAccepts. 48.71/31.66 [2019-03-28 12:43:28,218 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 53 transitions. Stem has 21 letters. Loop has 14 letters. 48.71/31.66 [2019-03-28 12:43:28,219 INFO L116 BuchiAccepts]: Finished buchiAccepts. 48.71/31.66 [2019-03-28 12:43:28,227 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 58 transitions. 48.71/31.66 [2019-03-28 12:43:28,228 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 48.71/31.66 [2019-03-28 12:43:28,228 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 0 states and 0 transitions. 48.71/31.66 [2019-03-28 12:43:28,228 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 48.71/31.66 [2019-03-28 12:43:28,228 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 48.71/31.66 [2019-03-28 12:43:28,229 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. 48.71/31.66 [2019-03-28 12:43:28,229 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 48.71/31.66 [2019-03-28 12:43:28,229 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 48.71/31.66 [2019-03-28 12:43:28,229 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 48.71/31.66 [2019-03-28 12:43:28,229 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 48.71/31.66 [2019-03-28 12:43:28,229 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ 48.71/31.66 [2019-03-28 12:43:28,229 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. 48.71/31.66 [2019-03-28 12:43:28,229 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 48.71/31.66 [2019-03-28 12:43:28,230 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true 48.71/31.66 [2019-03-28 12:43:28,236 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:43:28 BasicIcfg 48.71/31.66 [2019-03-28 12:43:28,236 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- 48.71/31.66 [2019-03-28 12:43:28,236 INFO L168 Benchmark]: Toolchain (without parser) took 26697.47 ms. Allocated memory was 649.6 MB in the beginning and 932.2 MB in the end (delta: 282.6 MB). Free memory was 559.5 MB in the beginning and 781.0 MB in the end (delta: -221.4 MB). Peak memory consumption was 61.2 MB. Max. memory is 50.3 GB. 48.71/31.66 [2019-03-28 12:43:28,237 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 649.6 MB. Free memory is still 581.1 MB. There was no memory consumed. Max. memory is 50.3 GB. 48.71/31.66 [2019-03-28 12:43:28,237 INFO L168 Benchmark]: CACSL2BoogieTranslator took 309.05 ms. Allocated memory was 649.6 MB in the beginning and 662.2 MB in the end (delta: 12.6 MB). Free memory was 559.5 MB in the beginning and 625.5 MB in the end (delta: -66.0 MB). Peak memory consumption was 29.9 MB. Max. memory is 50.3 GB. 48.71/31.66 [2019-03-28 12:43:28,238 INFO L168 Benchmark]: Boogie Procedure Inliner took 45.36 ms. Allocated memory is still 662.2 MB. Free memory was 625.5 MB in the beginning and 624.2 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. 48.71/31.66 [2019-03-28 12:43:28,239 INFO L168 Benchmark]: Boogie Preprocessor took 26.97 ms. Allocated memory is still 662.2 MB. Free memory was 624.2 MB in the beginning and 622.8 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. 48.71/31.66 [2019-03-28 12:43:28,239 INFO L168 Benchmark]: RCFGBuilder took 505.28 ms. Allocated memory is still 662.2 MB. Free memory was 621.5 MB in the beginning and 589.7 MB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 50.3 GB. 48.71/31.66 [2019-03-28 12:43:28,240 INFO L168 Benchmark]: BlockEncodingV2 took 166.83 ms. Allocated memory is still 662.2 MB. Free memory was 589.7 MB in the beginning and 572.2 MB in the end (delta: 17.5 MB). Peak memory consumption was 17.5 MB. Max. memory is 50.3 GB. 48.71/31.66 [2019-03-28 12:43:28,240 INFO L168 Benchmark]: TraceAbstraction took 2367.07 ms. Allocated memory was 662.2 MB in the beginning and 736.6 MB in the end (delta: 74.4 MB). Free memory was 572.2 MB in the beginning and 586.8 MB in the end (delta: -14.6 MB). Peak memory consumption was 59.8 MB. Max. memory is 50.3 GB. 48.71/31.66 [2019-03-28 12:43:28,241 INFO L168 Benchmark]: BuchiAutomizer took 23271.65 ms. Allocated memory was 736.6 MB in the beginning and 932.2 MB in the end (delta: 195.6 MB). Free memory was 586.8 MB in the beginning and 781.0 MB in the end (delta: -194.1 MB). Peak memory consumption was 1.4 MB. Max. memory is 50.3 GB. 48.71/31.66 [2019-03-28 12:43:28,245 INFO L337 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### 48.71/31.66 --- Results --- 48.71/31.66 * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: 48.71/31.66 - StatisticsResult: Initial Icfg 48.71/31.66 79 locations, 84 edges 48.71/31.66 - StatisticsResult: Encoded RCFG 48.71/31.66 65 locations, 122 edges 48.71/31.66 * Results from de.uni_freiburg.informatik.ultimate.core: 48.71/31.66 - StatisticsResult: Toolchain Benchmarks 48.71/31.66 Benchmark results are: 48.71/31.66 * CDTParser took 0.16 ms. Allocated memory is still 649.6 MB. Free memory is still 581.1 MB. There was no memory consumed. Max. memory is 50.3 GB. 48.71/31.66 * CACSL2BoogieTranslator took 309.05 ms. Allocated memory was 649.6 MB in the beginning and 662.2 MB in the end (delta: 12.6 MB). Free memory was 559.5 MB in the beginning and 625.5 MB in the end (delta: -66.0 MB). Peak memory consumption was 29.9 MB. Max. memory is 50.3 GB. 48.71/31.66 * Boogie Procedure Inliner took 45.36 ms. Allocated memory is still 662.2 MB. Free memory was 625.5 MB in the beginning and 624.2 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. 48.71/31.66 * Boogie Preprocessor took 26.97 ms. Allocated memory is still 662.2 MB. Free memory was 624.2 MB in the beginning and 622.8 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. 48.71/31.66 * RCFGBuilder took 505.28 ms. Allocated memory is still 662.2 MB. Free memory was 621.5 MB in the beginning and 589.7 MB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 50.3 GB. 48.71/31.66 * BlockEncodingV2 took 166.83 ms. Allocated memory is still 662.2 MB. Free memory was 589.7 MB in the beginning and 572.2 MB in the end (delta: 17.5 MB). Peak memory consumption was 17.5 MB. Max. memory is 50.3 GB. 48.71/31.66 * TraceAbstraction took 2367.07 ms. Allocated memory was 662.2 MB in the beginning and 736.6 MB in the end (delta: 74.4 MB). Free memory was 572.2 MB in the beginning and 586.8 MB in the end (delta: -14.6 MB). Peak memory consumption was 59.8 MB. Max. memory is 50.3 GB. 48.71/31.66 * BuchiAutomizer took 23271.65 ms. Allocated memory was 736.6 MB in the beginning and 932.2 MB in the end (delta: 195.6 MB). Free memory was 586.8 MB in the beginning and 781.0 MB in the end (delta: -194.1 MB). Peak memory consumption was 1.4 MB. Max. memory is 50.3 GB. 48.71/31.66 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: 48.71/31.66 - GenericResult: Unfinished Backtranslation 48.71/31.66 unknown boogie variable #length 48.71/31.66 - GenericResult: Unfinished Backtranslation 48.71/31.66 unknown boogie variable #length 48.71/31.66 - GenericResult: Unfinished Backtranslation 48.71/31.66 unknown boogie variable #length 48.71/31.66 - GenericResult: Unfinished Backtranslation 48.71/31.66 unknown boogie variable #length 48.71/31.66 - GenericResult: Unfinished Backtranslation 48.71/31.66 unknown boogie variable #length 48.71/31.66 - GenericResult: Unfinished Backtranslation 48.71/31.66 unknown boogie variable #length 48.71/31.66 - GenericResult: Unfinished Backtranslation 48.71/31.66 unknown boogie variable #length 48.71/31.66 - GenericResult: Unfinished Backtranslation 48.71/31.66 unknown boogie variable #length 48.71/31.66 - GenericResult: Unfinished Backtranslation 48.71/31.66 unknown boogie variable #memory_int 48.71/31.66 - GenericResult: Unfinished Backtranslation 48.71/31.66 unknown boogie variable #memory_int 48.71/31.66 - GenericResult: Unfinished Backtranslation 48.71/31.66 unknown boogie variable #memory_int 48.71/31.66 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: 48.71/31.66 - PositiveResult [Line: 23]: pointer dereference always succeeds 48.71/31.66 For all program executions holds that pointer dereference always succeeds at this location 48.71/31.66 - PositiveResult [Line: 14]: pointer dereference always succeeds 48.71/31.66 For all program executions holds that pointer dereference always succeeds at this location 48.71/31.66 - PositiveResult [Line: 14]: pointer dereference always succeeds 48.71/31.66 For all program executions holds that pointer dereference always succeeds at this location 48.71/31.66 - PositiveResult [Line: 14]: pointer dereference always succeeds 48.71/31.66 For all program executions holds that pointer dereference always succeeds at this location 48.71/31.66 - PositiveResult [Line: 23]: pointer dereference always succeeds 48.71/31.66 For all program executions holds that pointer dereference always succeeds at this location 48.71/31.66 - PositiveResult [Line: 23]: pointer dereference always succeeds 48.71/31.66 For all program executions holds that pointer dereference always succeeds at this location 48.71/31.66 - PositiveResult [Line: 23]: pointer dereference always succeeds 48.71/31.66 For all program executions holds that pointer dereference always succeeds at this location 48.71/31.66 - PositiveResult [Line: 14]: pointer dereference always succeeds 48.71/31.66 For all program executions holds that pointer dereference always succeeds at this location 48.71/31.66 - PositiveResult [Line: 17]: pointer dereference always succeeds 48.71/31.66 For all program executions holds that pointer dereference always succeeds at this location 48.71/31.66 - PositiveResult [Line: 25]: pointer dereference always succeeds 48.71/31.66 For all program executions holds that pointer dereference always succeeds at this location 48.71/31.66 - PositiveResult [Line: 17]: pointer dereference always succeeds 48.71/31.66 For all program executions holds that pointer dereference always succeeds at this location 48.71/31.66 - PositiveResult [Line: 18]: pointer dereference always succeeds 48.71/31.66 For all program executions holds that pointer dereference always succeeds at this location 48.71/31.66 - PositiveResult [Line: 25]: pointer dereference always succeeds 48.71/31.66 For all program executions holds that pointer dereference always succeeds at this location 48.71/31.66 - PositiveResult [Line: 18]: pointer dereference always succeeds 48.71/31.66 For all program executions holds that pointer dereference always succeeds at this location 48.71/31.66 - PositiveResult [Line: 18]: pointer dereference always succeeds 48.71/31.66 For all program executions holds that pointer dereference always succeeds at this location 48.71/31.66 - PositiveResult [Line: 18]: pointer dereference always succeeds 48.71/31.66 For all program executions holds that pointer dereference always succeeds at this location 48.71/31.66 - PositiveResult [Line: 19]: pointer dereference always succeeds 48.71/31.66 For all program executions holds that pointer dereference always succeeds at this location 48.71/31.66 - PositiveResult [Line: 10]: pointer dereference always succeeds 48.71/31.66 For all program executions holds that pointer dereference always succeeds at this location 48.71/31.66 - PositiveResult [Line: 19]: pointer dereference always succeeds 48.71/31.66 For all program executions holds that pointer dereference always succeeds at this location 48.71/31.66 - PositiveResult [Line: 10]: pointer dereference always succeeds 48.71/31.66 For all program executions holds that pointer dereference always succeeds at this location 48.71/31.66 - PositiveResult [Line: 19]: pointer dereference always succeeds 48.71/31.66 For all program executions holds that pointer dereference always succeeds at this location 48.71/31.66 - PositiveResult [Line: 19]: pointer dereference always succeeds 48.71/31.66 For all program executions holds that pointer dereference always succeeds at this location 48.71/31.66 - PositiveResult [Line: 21]: pointer dereference always succeeds 48.71/31.66 For all program executions holds that pointer dereference always succeeds at this location 48.71/31.66 - PositiveResult [Line: 11]: pointer dereference always succeeds 48.71/31.66 For all program executions holds that pointer dereference always succeeds at this location 48.71/31.66 - PositiveResult [Line: 11]: pointer dereference always succeeds 48.71/31.66 For all program executions holds that pointer dereference always succeeds at this location 48.71/31.66 - PositiveResult [Line: 12]: pointer dereference always succeeds 48.71/31.66 For all program executions holds that pointer dereference always succeeds at this location 48.71/31.66 - PositiveResult [Line: 21]: pointer dereference always succeeds 48.71/31.66 For all program executions holds that pointer dereference always succeeds at this location 48.71/31.66 - PositiveResult [Line: 12]: pointer dereference always succeeds 48.71/31.66 For all program executions holds that pointer dereference always succeeds at this location 48.71/31.66 - PositiveResult [Line: 21]: pointer dereference always succeeds 48.71/31.66 For all program executions holds that pointer dereference always succeeds at this location 48.71/31.66 - PositiveResult [Line: 21]: pointer dereference always succeeds 48.71/31.66 For all program executions holds that pointer dereference always succeeds at this location 48.71/31.66 - PositiveResult [Line: 22]: pointer dereference always succeeds 48.71/31.66 For all program executions holds that pointer dereference always succeeds at this location 48.71/31.66 - PositiveResult [Line: 13]: pointer dereference always succeeds 48.71/31.66 For all program executions holds that pointer dereference always succeeds at this location 48.71/31.66 - PositiveResult [Line: 13]: pointer dereference always succeeds 48.71/31.66 For all program executions holds that pointer dereference always succeeds at this location 48.71/31.66 - PositiveResult [Line: 13]: pointer dereference always succeeds 48.71/31.66 For all program executions holds that pointer dereference always succeeds at this location 48.71/31.66 - PositiveResult [Line: 22]: pointer dereference always succeeds 48.71/31.66 For all program executions holds that pointer dereference always succeeds at this location 48.71/31.66 - PositiveResult [Line: 13]: pointer dereference always succeeds 48.71/31.66 For all program executions holds that pointer dereference always succeeds at this location 48.71/31.66 - PositiveResult [Line: 22]: pointer dereference always succeeds 48.71/31.66 For all program executions holds that pointer dereference always succeeds at this location 48.71/31.66 - PositiveResult [Line: 22]: pointer dereference always succeeds 48.71/31.66 For all program executions holds that pointer dereference always succeeds at this location 48.71/31.66 - AllSpecificationsHoldResult: All specifications hold 48.71/31.66 38 specifications checked. All of them hold 48.71/31.66 - InvariantResult [Line: 17]: Loop Invariant 48.71/31.66 [2019-03-28 12:43:28,255 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 48.71/31.66 [2019-03-28 12:43:28,256 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 48.71/31.66 [2019-03-28 12:43:28,256 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 48.71/31.66 [2019-03-28 12:43:28,256 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 48.71/31.66 [2019-03-28 12:43:28,257 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 48.71/31.66 [2019-03-28 12:43:28,257 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 48.71/31.66 [2019-03-28 12:43:28,258 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 48.71/31.66 [2019-03-28 12:43:28,258 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 48.71/31.66 Derived loop invariant: ((((((((((unknown-#length-unknown[z] == 4 && unknown-#length-unknown[i] == 4) && i == 0) && 4 == unknown-#length-unknown[x_ref]) && 1 == \valid[z]) && z == 0) && 1 == \valid[y_ref]) && \valid[x_ref] == 1) && \valid[i] == 1) && 0 == x_ref) && 0 == y_ref) && unknown-#length-unknown[y_ref] == 4 48.71/31.66 - StatisticsResult: Ultimate Automizer benchmark data 48.71/31.66 CFG has 1 procedures, 65 locations, 38 error locations. SAFE Result, 2.2s OverallTime, 10 OverallIterations, 1 TraceHistogramMax, 1.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 86 SDtfs, 670 SDslu, 6 SDs, 0 SdLazy, 777 SolverSat, 216 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 20 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=65occurred in iteration=0, 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.0s AutomataMinimizationTime, 10 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 1 NumberOfFragments, 53 HoareAnnotationTreeSize, 1 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 1 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 49 NumberOfCodeBlocks, 49 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 39 ConstructedInterpolants, 0 QuantifiedInterpolants, 847 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available 48.71/31.67 - StatisticsResult: Constructed decomposition of program 48.71/31.67 Your program was decomposed into 4 terminating modules (2 trivial, 0 deterministic, 2 nondeterministic). One nondeterministic module has affine ranking function unknown-#memory_int-unknown[i][i] and consists of 8 locations. One nondeterministic module has affine ranking function -1 * unknown-#memory_int-unknown[i][i] + unknown-#memory_int-unknown[y_ref][y_ref] and consists of 12 locations. 2 modules have a trivial ranking function, the largest among these consists of 8 locations. 48.71/31.67 - StatisticsResult: Timing statistics 48.71/31.67 BüchiAutomizer plugin needed 23.2s and 5 iterations. TraceHistogramMax:2. Analysis of lassos took 7.1s. Construction of modules took 0.6s. Büchi inclusion checks took 15.4s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 2. Automata minimization 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 9 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 30 states and ocurred in iteration 2. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 58 SDtfs, 276 SDslu, 152 SDs, 0 SdLazy, 629 SolverSat, 128 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU2 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital788 mio100 ax100 hnf100 lsp98 ukn31 mio100 lsp35 div100 bol100 ite100 ukn100 eq196 hnf87 smp98 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 6ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s 48.71/31.67 - TerminationAnalysisResult: Termination proven 48.71/31.67 Buchi Automizer proved that your program is terminating 48.71/31.67 RESULT: Ultimate proved your program to be correct! 48.71/31.67 !SESSION 2019-03-28 12:42:58.229 ----------------------------------------------- 48.71/31.67 eclipse.buildId=unknown 48.71/31.67 java.version=1.8.0_181 48.71/31.67 java.vendor=Oracle Corporation 48.71/31.67 BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US 48.71/31.67 Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox/benchmark/theBenchmark.c 48.71/31.67 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 48.71/31.67 48.71/31.67 !ENTRY org.eclipse.core.resources 2 10035 2019-03-28 12:43:28.484 48.71/31.67 !MESSAGE The workspace will exit with unsaved changes in this session. 48.71/31.67 Received shutdown request... 48.71/31.67 Ultimate: 48.71/31.67 GTK+ Version Check 48.71/31.67 EOF