159.86/136.29 YES 159.86/136.29 159.86/136.29 Ultimate: Cannot open display: 159.86/136.29 This is Ultimate 0.1.24-8dc7c08-m 159.86/136.29 [2019-03-28 12:42:33,482 INFO L170 SettingsManager]: Resetting all preferences to default values... 159.86/136.29 [2019-03-28 12:42:33,484 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values 159.86/136.29 [2019-03-28 12:42:33,495 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... 159.86/136.29 [2019-03-28 12:42:33,496 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values 159.86/136.29 [2019-03-28 12:42:33,497 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values 159.86/136.29 [2019-03-28 12:42:33,498 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values 159.86/136.29 [2019-03-28 12:42:33,500 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values 159.86/136.29 [2019-03-28 12:42:33,501 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values 159.86/136.29 [2019-03-28 12:42:33,502 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values 159.86/136.29 [2019-03-28 12:42:33,503 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... 159.86/136.29 [2019-03-28 12:42:33,503 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values 159.86/136.29 [2019-03-28 12:42:33,504 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values 159.86/136.29 [2019-03-28 12:42:33,505 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values 159.86/136.29 [2019-03-28 12:42:33,506 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values 159.86/136.29 [2019-03-28 12:42:33,507 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values 159.86/136.29 [2019-03-28 12:42:33,507 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values 159.86/136.29 [2019-03-28 12:42:33,509 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values 159.86/136.29 [2019-03-28 12:42:33,511 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values 159.86/136.29 [2019-03-28 12:42:33,513 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values 159.86/136.29 [2019-03-28 12:42:33,514 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values 159.86/136.29 [2019-03-28 12:42:33,515 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values 159.86/136.29 [2019-03-28 12:42:33,517 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... 159.86/136.29 [2019-03-28 12:42:33,517 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... 159.86/136.29 [2019-03-28 12:42:33,517 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values 159.86/136.29 [2019-03-28 12:42:33,518 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values 159.86/136.29 [2019-03-28 12:42:33,519 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values 159.86/136.29 [2019-03-28 12:42:33,519 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... 159.86/136.29 [2019-03-28 12:42:33,520 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values 159.86/136.29 [2019-03-28 12:42:33,520 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values 159.86/136.29 [2019-03-28 12:42:33,521 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values 159.86/136.29 [2019-03-28 12:42:33,522 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values 159.86/136.29 [2019-03-28 12:42:33,523 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... 159.86/136.29 [2019-03-28 12:42:33,523 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values 159.86/136.29 [2019-03-28 12:42:33,524 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... 159.86/136.29 [2019-03-28 12:42:33,524 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... 159.86/136.29 [2019-03-28 12:42:33,524 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values 159.86/136.29 [2019-03-28 12:42:33,525 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values 159.86/136.29 [2019-03-28 12:42:33,526 INFO L181 SettingsManager]: Finished resetting all preferences to default values... 159.86/136.29 [2019-03-28 12:42:33,526 INFO L98 SettingsManager]: Beginning loading settings from /export/starexec/sandbox2/solver/bin/./../termcomp2017.epf 159.86/136.29 [2019-03-28 12:42:33,541 INFO L110 SettingsManager]: Loading preferences was successful 159.86/136.29 [2019-03-28 12:42:33,541 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: 159.86/136.29 [2019-03-28 12:42:33,542 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: 159.86/136.29 [2019-03-28 12:42:33,543 INFO L133 SettingsManager]: * Rewrite not-equals=true 159.86/136.29 [2019-03-28 12:42:33,543 INFO L133 SettingsManager]: * Create parallel compositions if possible=false 159.86/136.29 [2019-03-28 12:42:33,543 INFO L133 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE 159.86/136.29 [2019-03-28 12:42:33,543 INFO L133 SettingsManager]: * Use SBE=true 159.86/136.29 [2019-03-28 12:42:33,543 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: 159.86/136.29 [2019-03-28 12:42:33,544 INFO L133 SettingsManager]: * Use old map elimination=false 159.86/136.29 [2019-03-28 12:42:33,544 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false 159.86/136.29 [2019-03-28 12:42:33,544 INFO L133 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION 159.86/136.29 [2019-03-28 12:42:33,544 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true 159.86/136.29 [2019-03-28 12:42:33,544 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES 159.86/136.29 [2019-03-28 12:42:33,544 INFO L133 SettingsManager]: * Construct termination proof for TermComp=true 159.86/136.29 [2019-03-28 12:42:33,545 INFO L133 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 159.86/136.29 [2019-03-28 12:42:33,545 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: 159.86/136.29 [2019-03-28 12:42:33,545 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false 159.86/136.29 [2019-03-28 12:42:33,545 INFO L133 SettingsManager]: * Check division by zero=IGNORE 159.86/136.29 [2019-03-28 12:42:33,545 INFO L133 SettingsManager]: * Check if freed pointer was valid=false 159.86/136.29 [2019-03-28 12:42:33,546 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false 159.86/136.29 [2019-03-28 12:42:33,546 INFO L133 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE 159.86/136.29 [2019-03-28 12:42:33,546 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: 159.86/136.29 [2019-03-28 12:42:33,546 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements 159.86/136.29 [2019-03-28 12:42:33,546 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump 159.86/136.29 [2019-03-28 12:42:33,547 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 159.86/136.29 [2019-03-28 12:42:33,547 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: 159.86/136.29 [2019-03-28 12:42:33,547 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles 159.86/136.29 [2019-03-28 12:42:33,547 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL 159.86/136.29 [2019-03-28 12:42:33,547 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 159.86/136.29 [2019-03-28 12:42:33,573 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp 159.86/136.29 [2019-03-28 12:42:33,586 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized 159.86/136.29 [2019-03-28 12:42:33,589 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. 159.86/136.29 [2019-03-28 12:42:33,591 INFO L271 PluginConnector]: Initializing CDTParser... 159.86/136.29 [2019-03-28 12:42:33,591 INFO L276 PluginConnector]: CDTParser initialized 159.86/136.29 [2019-03-28 12:42:33,592 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox2/benchmark/theBenchmark.c 159.86/136.29 [2019-03-28 12:42:33,663 INFO L221 CDTParser]: Created temporary CDT project at /export/starexec/sandbox2/tmp/5d23407d494d4563b453ab87bc933a8c/FLAG0210fffd2 159.86/136.29 [2019-03-28 12:42:34,004 INFO L307 CDTParser]: Found 1 translation units. 159.86/136.29 [2019-03-28 12:42:34,005 INFO L161 CDTParser]: Scanning /export/starexec/sandbox2/benchmark/theBenchmark.c 159.86/136.29 [2019-03-28 12:42:34,005 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. 159.86/136.29 [2019-03-28 12:42:34,012 INFO L355 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox2/tmp/5d23407d494d4563b453ab87bc933a8c/FLAG0210fffd2 159.86/136.29 [2019-03-28 12:42:34,419 INFO L363 CDTParser]: Successfully deleted /export/starexec/sandbox2/tmp/5d23407d494d4563b453ab87bc933a8c 159.86/136.29 [2019-03-28 12:42:34,430 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### 159.86/136.29 [2019-03-28 12:42:34,432 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. 159.86/136.29 [2019-03-28 12:42:34,433 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- 159.86/136.29 [2019-03-28 12:42:34,433 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... 159.86/136.29 [2019-03-28 12:42:34,437 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized 159.86/136.29 [2019-03-28 12:42:34,438 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 12:42:34" (1/1) ... 159.86/136.29 [2019-03-28 12:42:34,441 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@347d0c9e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:42:34, skipping insertion in model container 159.86/136.29 [2019-03-28 12:42:34,441 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 12:42:34" (1/1) ... 159.86/136.29 [2019-03-28 12:42:34,449 INFO L145 MainTranslator]: Starting translation in SV-COMP mode 159.86/136.29 [2019-03-28 12:42:34,466 INFO L176 MainTranslator]: Built tables and reachable declarations 159.86/136.29 [2019-03-28 12:42:34,636 INFO L206 PostProcessor]: Analyzing one entry point: main 159.86/136.29 [2019-03-28 12:42:34,649 INFO L191 MainTranslator]: Completed pre-run 159.86/136.29 [2019-03-28 12:42:34,733 INFO L206 PostProcessor]: Analyzing one entry point: main 159.86/136.29 [2019-03-28 12:42:34,750 INFO L195 MainTranslator]: Completed translation 159.86/136.29 [2019-03-28 12:42:34,750 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:42:34 WrapperNode 159.86/136.29 [2019-03-28 12:42:34,751 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- 159.86/136.29 [2019-03-28 12:42:34,751 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- 159.86/136.29 [2019-03-28 12:42:34,752 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... 159.86/136.29 [2019-03-28 12:42:34,752 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized 159.86/136.29 [2019-03-28 12:42:34,762 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:42:34" (1/1) ... 159.86/136.29 [2019-03-28 12:42:34,771 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:42:34" (1/1) ... 159.86/136.29 [2019-03-28 12:42:34,795 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- 159.86/136.29 [2019-03-28 12:42:34,796 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- 159.86/136.29 [2019-03-28 12:42:34,796 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... 159.86/136.29 [2019-03-28 12:42:34,796 INFO L276 PluginConnector]: Boogie Preprocessor initialized 159.86/136.29 [2019-03-28 12:42:34,806 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:42:34" (1/1) ... 159.86/136.29 [2019-03-28 12:42:34,806 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:42:34" (1/1) ... 159.86/136.29 [2019-03-28 12:42:34,808 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:42:34" (1/1) ... 159.86/136.29 [2019-03-28 12:42:34,808 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:42:34" (1/1) ... 159.86/136.29 [2019-03-28 12:42:34,813 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:42:34" (1/1) ... 159.86/136.29 [2019-03-28 12:42:34,818 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:42:34" (1/1) ... 159.86/136.29 [2019-03-28 12:42:34,819 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:42:34" (1/1) ... 159.86/136.29 [2019-03-28 12:42:34,822 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- 159.86/136.29 [2019-03-28 12:42:34,822 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- 159.86/136.29 [2019-03-28 12:42:34,822 INFO L271 PluginConnector]: Initializing RCFGBuilder... 159.86/136.29 [2019-03-28 12:42:34,822 INFO L276 PluginConnector]: RCFGBuilder initialized 159.86/136.29 [2019-03-28 12:42:34,824 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:42:34" (1/1) ... 159.86/136.29 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 159.86/136.29 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) 159.86/136.29 Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 159.86/136.29 [2019-03-28 12:42:34,888 INFO L130 BoogieDeclarations]: Found specification of procedure write~int 159.86/136.29 [2019-03-28 12:42:34,888 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start 159.86/136.29 [2019-03-28 12:42:34,888 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start 159.86/136.29 [2019-03-28 12:42:34,888 INFO L130 BoogieDeclarations]: Found specification of procedure read~int 159.86/136.29 [2019-03-28 12:42:34,888 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack 159.86/136.29 [2019-03-28 12:42:34,889 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc 159.86/136.29 [2019-03-28 12:42:35,225 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) 159.86/136.29 [2019-03-28 12:42:35,225 INFO L286 CfgBuilder]: Removed 7 assue(true) statements. 159.86/136.29 [2019-03-28 12:42:35,227 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:42:35 BoogieIcfgContainer 159.86/136.29 [2019-03-28 12:42:35,227 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- 159.86/136.29 [2019-03-28 12:42:35,227 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- 159.86/136.29 [2019-03-28 12:42:35,227 INFO L271 PluginConnector]: Initializing BlockEncodingV2... 159.86/136.29 [2019-03-28 12:42:35,230 INFO L276 PluginConnector]: BlockEncodingV2 initialized 159.86/136.29 [2019-03-28 12:42:35,231 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:42:35" (1/1) ... 159.86/136.29 [2019-03-28 12:42:35,249 INFO L313 BlockEncoder]: Initial Icfg 59 locations, 61 edges 159.86/136.29 [2019-03-28 12:42:35,251 INFO L258 BlockEncoder]: Using Remove infeasible edges 159.86/136.29 [2019-03-28 12:42:35,252 INFO L263 BlockEncoder]: Using Maximize final states 159.86/136.29 [2019-03-28 12:42:35,252 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false 159.86/136.29 [2019-03-28 12:42:35,253 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE 159.86/136.29 [2019-03-28 12:42:35,254 INFO L296 BlockEncoder]: Using Remove sink states 159.86/136.29 [2019-03-28 12:42:35,255 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true 159.86/136.29 [2019-03-28 12:42:35,256 INFO L179 BlockEncoder]: Using Rewrite not-equals 159.86/136.29 [2019-03-28 12:42:35,283 INFO L185 BlockEncoder]: Using Use SBE 159.86/136.29 [2019-03-28 12:42:35,329 INFO L200 BlockEncoder]: SBE split 33 edges 159.86/136.29 [2019-03-28 12:42:35,335 INFO L70 emoveInfeasibleEdges]: Removed 1 edges and 0 locations because of local infeasibility 159.86/136.29 [2019-03-28 12:42:35,337 INFO L71 MaximizeFinalStates]: 0 new accepting states 159.86/136.29 [2019-03-28 12:42:35,370 INFO L100 BaseMinimizeStates]: Removed 14 edges and 7 locations by large block encoding 159.86/136.29 [2019-03-28 12:42:35,373 INFO L70 RemoveSinkStates]: Removed 1 edges and 1 locations by removing sink states 159.86/136.29 [2019-03-28 12:42:35,375 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility 159.86/136.29 [2019-03-28 12:42:35,375 INFO L71 MaximizeFinalStates]: 0 new accepting states 159.86/136.29 [2019-03-28 12:42:35,376 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding 159.86/136.29 [2019-03-28 12:42:35,376 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states 159.86/136.29 [2019-03-28 12:42:35,377 INFO L313 BlockEncoder]: Encoded RCFG 51 locations, 99 edges 159.86/136.29 [2019-03-28 12:42:35,377 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:42:35 BasicIcfg 159.86/136.29 [2019-03-28 12:42:35,377 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- 159.86/136.29 [2019-03-28 12:42:35,378 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- 159.86/136.29 [2019-03-28 12:42:35,379 INFO L271 PluginConnector]: Initializing TraceAbstraction... 159.86/136.29 [2019-03-28 12:42:35,383 INFO L276 PluginConnector]: TraceAbstraction initialized 159.86/136.29 [2019-03-28 12:42:35,384 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.03 12:42:34" (1/4) ... 159.86/136.29 [2019-03-28 12:42:35,385 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@475cb3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 12:42:35, skipping insertion in model container 159.86/136.29 [2019-03-28 12:42:35,385 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:42:34" (2/4) ... 159.86/136.29 [2019-03-28 12:42:35,385 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@475cb3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 12:42:35, skipping insertion in model container 159.86/136.29 [2019-03-28 12:42:35,386 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:42:35" (3/4) ... 159.86/136.29 [2019-03-28 12:42:35,386 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@475cb3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:42:35, skipping insertion in model container 159.86/136.29 [2019-03-28 12:42:35,386 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:42:35" (4/4) ... 159.86/136.29 [2019-03-28 12:42:35,388 INFO L112 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 159.86/136.29 [2019-03-28 12:42:35,398 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION 159.86/136.29 [2019-03-28 12:42:35,407 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 30 error locations. 159.86/136.29 [2019-03-28 12:42:35,424 INFO L257 AbstractCegarLoop]: Starting to check reachability of 30 error locations. 159.86/136.29 [2019-03-28 12:42:35,453 INFO L133 ementStrategyFactory]: Using default assertion order modulation 159.86/136.29 [2019-03-28 12:42:35,454 INFO L382 AbstractCegarLoop]: Interprodecural is true 159.86/136.29 [2019-03-28 12:42:35,454 INFO L383 AbstractCegarLoop]: Hoare is true 159.86/136.29 [2019-03-28 12:42:35,455 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates 159.86/136.29 [2019-03-28 12:42:35,455 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE 159.86/136.29 [2019-03-28 12:42:35,455 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION 159.86/136.29 [2019-03-28 12:42:35,455 INFO L387 AbstractCegarLoop]: Difference is false 159.86/136.29 [2019-03-28 12:42:35,455 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA 159.86/136.29 [2019-03-28 12:42:35,455 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== 159.86/136.29 [2019-03-28 12:42:35,472 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states. 159.86/136.29 [2019-03-28 12:42:35,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 159.86/136.29 [2019-03-28 12:42:35,478 INFO L394 BasicCegarLoop]: Found error trace 159.86/136.29 [2019-03-28 12:42:35,478 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] 159.86/136.29 [2019-03-28 12:42:35,479 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION]=== 159.86/136.29 [2019-03-28 12:42:35,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 159.86/136.29 [2019-03-28 12:42:35,484 INFO L82 PathProgramCache]: Analyzing trace with hash 133301, now seen corresponding path program 1 times 159.86/136.29 [2019-03-28 12:42:35,486 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 159.86/136.29 [2019-03-28 12:42:35,487 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 159.86/136.29 [2019-03-28 12:42:35,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 159.86/136.29 [2019-03-28 12:42:35,540 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 159.86/136.29 [2019-03-28 12:42:35,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 159.86/136.29 [2019-03-28 12:42:35,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 159.86/136.29 [2019-03-28 12:42:35,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 159.86/136.29 [2019-03-28 12:42:35,682 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 159.86/136.29 [2019-03-28 12:42:35,683 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 159.86/136.29 [2019-03-28 12:42:35,686 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 159.86/136.29 [2019-03-28 12:42:35,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 159.86/136.29 [2019-03-28 12:42:35,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 159.86/136.29 [2019-03-28 12:42:35,704 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 3 states. 159.86/136.29 [2019-03-28 12:42:35,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 159.86/136.29 [2019-03-28 12:42:35,945 INFO L93 Difference]: Finished difference Result 51 states and 99 transitions. 159.86/136.29 [2019-03-28 12:42:35,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 159.86/136.29 [2019-03-28 12:42:35,947 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 159.86/136.29 [2019-03-28 12:42:35,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 159.86/136.29 [2019-03-28 12:42:35,962 INFO L225 Difference]: With dead ends: 51 159.86/136.29 [2019-03-28 12:42:35,962 INFO L226 Difference]: Without dead ends: 47 159.86/136.29 [2019-03-28 12:42:35,965 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 159.86/136.29 [2019-03-28 12:42:35,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. 159.86/136.29 [2019-03-28 12:42:36,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. 159.86/136.29 [2019-03-28 12:42:36,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. 159.86/136.29 [2019-03-28 12:42:36,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 91 transitions. 159.86/136.29 [2019-03-28 12:42:36,008 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 91 transitions. Word has length 3 159.86/136.29 [2019-03-28 12:42:36,009 INFO L84 Accepts]: Finished accepts. word is rejected. 159.86/136.29 [2019-03-28 12:42:36,009 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 91 transitions. 159.86/136.29 [2019-03-28 12:42:36,009 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 159.86/136.29 [2019-03-28 12:42:36,009 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 91 transitions. 159.86/136.29 [2019-03-28 12:42:36,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 159.86/136.29 [2019-03-28 12:42:36,010 INFO L394 BasicCegarLoop]: Found error trace 159.86/136.29 [2019-03-28 12:42:36,010 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] 159.86/136.29 [2019-03-28 12:42:36,010 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION]=== 159.86/136.29 [2019-03-28 12:42:36,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 159.86/136.29 [2019-03-28 12:42:36,011 INFO L82 PathProgramCache]: Analyzing trace with hash 133303, now seen corresponding path program 1 times 159.86/136.29 [2019-03-28 12:42:36,011 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 159.86/136.29 [2019-03-28 12:42:36,011 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 159.86/136.29 [2019-03-28 12:42:36,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 159.86/136.29 [2019-03-28 12:42:36,012 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 159.86/136.29 [2019-03-28 12:42:36,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 159.86/136.29 [2019-03-28 12:42:36,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 159.86/136.29 [2019-03-28 12:42:36,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 159.86/136.29 [2019-03-28 12:42:36,042 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 159.86/136.29 [2019-03-28 12:42:36,042 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 159.86/136.29 [2019-03-28 12:42:36,044 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 159.86/136.29 [2019-03-28 12:42:36,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 159.86/136.29 [2019-03-28 12:42:36,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 159.86/136.29 [2019-03-28 12:42:36,045 INFO L87 Difference]: Start difference. First operand 47 states and 91 transitions. Second operand 3 states. 159.86/136.29 [2019-03-28 12:42:36,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 159.86/136.29 [2019-03-28 12:42:36,206 INFO L93 Difference]: Finished difference Result 51 states and 91 transitions. 159.86/136.29 [2019-03-28 12:42:36,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 159.86/136.29 [2019-03-28 12:42:36,207 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 159.86/136.29 [2019-03-28 12:42:36,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 159.86/136.29 [2019-03-28 12:42:36,208 INFO L225 Difference]: With dead ends: 51 159.86/136.29 [2019-03-28 12:42:36,208 INFO L226 Difference]: Without dead ends: 47 159.86/136.29 [2019-03-28 12:42:36,209 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 159.86/136.29 [2019-03-28 12:42:36,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. 159.86/136.29 [2019-03-28 12:42:36,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. 159.86/136.29 [2019-03-28 12:42:36,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. 159.86/136.29 [2019-03-28 12:42:36,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 87 transitions. 159.86/136.29 [2019-03-28 12:42:36,216 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 87 transitions. Word has length 3 159.86/136.29 [2019-03-28 12:42:36,216 INFO L84 Accepts]: Finished accepts. word is rejected. 159.86/136.29 [2019-03-28 12:42:36,216 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 87 transitions. 159.86/136.29 [2019-03-28 12:42:36,216 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 159.86/136.29 [2019-03-28 12:42:36,216 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 87 transitions. 159.86/136.29 [2019-03-28 12:42:36,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 159.86/136.29 [2019-03-28 12:42:36,217 INFO L394 BasicCegarLoop]: Found error trace 159.86/136.29 [2019-03-28 12:42:36,217 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] 159.86/136.29 [2019-03-28 12:42:36,217 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION]=== 159.91/136.29 [2019-03-28 12:42:36,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 159.91/136.29 [2019-03-28 12:42:36,218 INFO L82 PathProgramCache]: Analyzing trace with hash 133304, now seen corresponding path program 1 times 159.91/136.29 [2019-03-28 12:42:36,218 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 159.91/136.29 [2019-03-28 12:42:36,218 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 159.91/136.29 [2019-03-28 12:42:36,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 159.91/136.29 [2019-03-28 12:42:36,219 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 159.91/136.29 [2019-03-28 12:42:36,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 159.91/136.29 [2019-03-28 12:42:36,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 159.91/136.29 [2019-03-28 12:42:36,262 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 159.91/136.29 [2019-03-28 12:42:36,262 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 159.91/136.29 [2019-03-28 12:42:36,262 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 159.91/136.29 [2019-03-28 12:42:36,263 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 159.91/136.29 [2019-03-28 12:42:36,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 159.91/136.29 [2019-03-28 12:42:36,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 159.91/136.29 [2019-03-28 12:42:36,264 INFO L87 Difference]: Start difference. First operand 47 states and 87 transitions. Second operand 3 states. 159.91/136.29 [2019-03-28 12:42:36,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 159.91/136.29 [2019-03-28 12:42:36,448 INFO L93 Difference]: Finished difference Result 47 states and 87 transitions. 159.91/136.29 [2019-03-28 12:42:36,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 159.91/136.29 [2019-03-28 12:42:36,448 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 159.91/136.29 [2019-03-28 12:42:36,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 159.91/136.29 [2019-03-28 12:42:36,449 INFO L225 Difference]: With dead ends: 47 159.91/136.29 [2019-03-28 12:42:36,450 INFO L226 Difference]: Without dead ends: 43 159.91/136.29 [2019-03-28 12:42:36,450 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 159.91/136.29 [2019-03-28 12:42:36,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. 159.91/136.29 [2019-03-28 12:42:36,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. 159.91/136.29 [2019-03-28 12:42:36,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. 159.91/136.29 [2019-03-28 12:42:36,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 83 transitions. 159.91/136.29 [2019-03-28 12:42:36,456 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 83 transitions. Word has length 3 159.91/136.29 [2019-03-28 12:42:36,456 INFO L84 Accepts]: Finished accepts. word is rejected. 159.91/136.29 [2019-03-28 12:42:36,456 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 83 transitions. 159.91/136.29 [2019-03-28 12:42:36,456 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 159.91/136.29 [2019-03-28 12:42:36,457 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 83 transitions. 159.91/136.29 [2019-03-28 12:42:36,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 159.91/136.29 [2019-03-28 12:42:36,457 INFO L394 BasicCegarLoop]: Found error trace 159.91/136.29 [2019-03-28 12:42:36,457 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] 159.91/136.29 [2019-03-28 12:42:36,458 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION]=== 159.91/136.29 [2019-03-28 12:42:36,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 159.91/136.29 [2019-03-28 12:42:36,458 INFO L82 PathProgramCache]: Analyzing trace with hash 4129919, now seen corresponding path program 1 times 159.91/136.29 [2019-03-28 12:42:36,458 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 159.91/136.29 [2019-03-28 12:42:36,459 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 159.91/136.29 [2019-03-28 12:42:36,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 159.91/136.29 [2019-03-28 12:42:36,460 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 159.91/136.29 [2019-03-28 12:42:36,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 159.91/136.29 [2019-03-28 12:42:36,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 159.91/136.29 [2019-03-28 12:42:36,498 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 159.91/136.29 [2019-03-28 12:42:36,498 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 159.91/136.29 [2019-03-28 12:42:36,498 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 159.91/136.29 [2019-03-28 12:42:36,498 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 159.91/136.29 [2019-03-28 12:42:36,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 159.91/136.29 [2019-03-28 12:42:36,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 159.91/136.29 [2019-03-28 12:42:36,500 INFO L87 Difference]: Start difference. First operand 43 states and 83 transitions. Second operand 3 states. 159.91/136.29 [2019-03-28 12:42:36,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 159.91/136.29 [2019-03-28 12:42:36,641 INFO L93 Difference]: Finished difference Result 43 states and 83 transitions. 159.91/136.29 [2019-03-28 12:42:36,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 159.91/136.29 [2019-03-28 12:42:36,642 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 159.91/136.29 [2019-03-28 12:42:36,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 159.91/136.29 [2019-03-28 12:42:36,643 INFO L225 Difference]: With dead ends: 43 159.91/136.29 [2019-03-28 12:42:36,644 INFO L226 Difference]: Without dead ends: 39 159.91/136.29 [2019-03-28 12:42:36,644 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 159.91/136.29 [2019-03-28 12:42:36,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. 159.91/136.29 [2019-03-28 12:42:36,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. 159.91/136.29 [2019-03-28 12:42:36,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. 159.91/136.29 [2019-03-28 12:42:36,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 75 transitions. 159.91/136.29 [2019-03-28 12:42:36,649 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 75 transitions. Word has length 4 159.91/136.29 [2019-03-28 12:42:36,649 INFO L84 Accepts]: Finished accepts. word is rejected. 159.91/136.29 [2019-03-28 12:42:36,649 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 75 transitions. 159.91/136.29 [2019-03-28 12:42:36,649 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 159.91/136.29 [2019-03-28 12:42:36,649 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 75 transitions. 159.91/136.29 [2019-03-28 12:42:36,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 159.91/136.29 [2019-03-28 12:42:36,650 INFO L394 BasicCegarLoop]: Found error trace 159.91/136.29 [2019-03-28 12:42:36,650 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] 159.91/136.29 [2019-03-28 12:42:36,650 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION]=== 159.91/136.29 [2019-03-28 12:42:36,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 159.91/136.29 [2019-03-28 12:42:36,650 INFO L82 PathProgramCache]: Analyzing trace with hash 4129920, now seen corresponding path program 1 times 159.91/136.29 [2019-03-28 12:42:36,651 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 159.91/136.29 [2019-03-28 12:42:36,651 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 159.91/136.29 [2019-03-28 12:42:36,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 159.91/136.29 [2019-03-28 12:42:36,652 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 159.91/136.29 [2019-03-28 12:42:36,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 159.91/136.29 [2019-03-28 12:42:36,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 159.91/136.29 [2019-03-28 12:42:36,689 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 159.91/136.29 [2019-03-28 12:42:36,689 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 159.91/136.29 [2019-03-28 12:42:36,690 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 159.91/136.29 [2019-03-28 12:42:36,690 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 159.91/136.29 [2019-03-28 12:42:36,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 159.91/136.29 [2019-03-28 12:42:36,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 159.91/136.29 [2019-03-28 12:42:36,691 INFO L87 Difference]: Start difference. First operand 39 states and 75 transitions. Second operand 3 states. 159.91/136.29 [2019-03-28 12:42:36,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 159.91/136.29 [2019-03-28 12:42:36,815 INFO L93 Difference]: Finished difference Result 39 states and 75 transitions. 159.91/136.29 [2019-03-28 12:42:36,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 159.91/136.29 [2019-03-28 12:42:36,816 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 159.91/136.29 [2019-03-28 12:42:36,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 159.91/136.29 [2019-03-28 12:42:36,817 INFO L225 Difference]: With dead ends: 39 159.91/136.29 [2019-03-28 12:42:36,817 INFO L226 Difference]: Without dead ends: 35 159.91/136.29 [2019-03-28 12:42:36,817 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 159.91/136.29 [2019-03-28 12:42:36,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. 159.91/136.29 [2019-03-28 12:42:36,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. 159.91/136.29 [2019-03-28 12:42:36,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. 159.91/136.29 [2019-03-28 12:42:36,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 67 transitions. 159.91/136.29 [2019-03-28 12:42:36,822 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 67 transitions. Word has length 4 159.91/136.29 [2019-03-28 12:42:36,822 INFO L84 Accepts]: Finished accepts. word is rejected. 159.91/136.29 [2019-03-28 12:42:36,822 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 67 transitions. 159.91/136.29 [2019-03-28 12:42:36,823 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 159.91/136.29 [2019-03-28 12:42:36,823 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 67 transitions. 159.91/136.29 [2019-03-28 12:42:36,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 159.91/136.29 [2019-03-28 12:42:36,823 INFO L394 BasicCegarLoop]: Found error trace 159.91/136.29 [2019-03-28 12:42:36,823 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] 159.91/136.29 [2019-03-28 12:42:36,823 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION]=== 159.91/136.29 [2019-03-28 12:42:36,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 159.91/136.29 [2019-03-28 12:42:36,824 INFO L82 PathProgramCache]: Analyzing trace with hash 128024770, now seen corresponding path program 1 times 159.91/136.29 [2019-03-28 12:42:36,824 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 159.91/136.29 [2019-03-28 12:42:36,824 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 159.91/136.29 [2019-03-28 12:42:36,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 159.91/136.29 [2019-03-28 12:42:36,825 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 159.91/136.29 [2019-03-28 12:42:36,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 159.91/136.29 [2019-03-28 12:42:36,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 159.91/136.29 [2019-03-28 12:42:36,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 159.91/136.29 [2019-03-28 12:42:36,858 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 159.91/136.29 [2019-03-28 12:42:36,858 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 159.91/136.29 [2019-03-28 12:42:36,858 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 159.91/136.29 [2019-03-28 12:42:36,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 159.91/136.29 [2019-03-28 12:42:36,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 159.91/136.29 [2019-03-28 12:42:36,859 INFO L87 Difference]: Start difference. First operand 35 states and 67 transitions. Second operand 3 states. 159.91/136.29 [2019-03-28 12:42:36,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 159.91/136.29 [2019-03-28 12:42:36,973 INFO L93 Difference]: Finished difference Result 35 states and 67 transitions. 159.91/136.29 [2019-03-28 12:42:36,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 159.91/136.29 [2019-03-28 12:42:36,973 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 159.91/136.29 [2019-03-28 12:42:36,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 159.91/136.29 [2019-03-28 12:42:36,975 INFO L225 Difference]: With dead ends: 35 159.91/136.29 [2019-03-28 12:42:36,975 INFO L226 Difference]: Without dead ends: 32 159.91/136.29 [2019-03-28 12:42:36,975 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 159.91/136.29 [2019-03-28 12:42:36,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. 159.91/136.29 [2019-03-28 12:42:36,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. 159.91/136.29 [2019-03-28 12:42:36,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. 159.91/136.29 [2019-03-28 12:42:36,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 61 transitions. 159.91/136.29 [2019-03-28 12:42:36,979 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 61 transitions. Word has length 5 159.91/136.29 [2019-03-28 12:42:36,979 INFO L84 Accepts]: Finished accepts. word is rejected. 159.91/136.29 [2019-03-28 12:42:36,979 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 61 transitions. 159.91/136.29 [2019-03-28 12:42:36,980 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 159.91/136.29 [2019-03-28 12:42:36,980 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 61 transitions. 159.91/136.29 [2019-03-28 12:42:36,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 159.91/136.29 [2019-03-28 12:42:36,980 INFO L394 BasicCegarLoop]: Found error trace 159.91/136.29 [2019-03-28 12:42:36,980 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] 159.91/136.29 [2019-03-28 12:42:36,980 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION]=== 159.91/136.29 [2019-03-28 12:42:36,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 159.91/136.29 [2019-03-28 12:42:36,981 INFO L82 PathProgramCache]: Analyzing trace with hash 128024772, now seen corresponding path program 1 times 159.91/136.29 [2019-03-28 12:42:36,981 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 159.91/136.29 [2019-03-28 12:42:36,981 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 159.91/136.29 [2019-03-28 12:42:36,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 159.91/136.29 [2019-03-28 12:42:36,982 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 159.91/136.29 [2019-03-28 12:42:36,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 159.91/136.29 [2019-03-28 12:42:36,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 159.91/136.29 [2019-03-28 12:42:37,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 159.91/136.29 [2019-03-28 12:42:37,004 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 159.91/136.29 [2019-03-28 12:42:37,004 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 159.91/136.29 [2019-03-28 12:42:37,005 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 159.91/136.29 [2019-03-28 12:42:37,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 159.91/136.29 [2019-03-28 12:42:37,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 159.91/136.29 [2019-03-28 12:42:37,005 INFO L87 Difference]: Start difference. First operand 32 states and 61 transitions. Second operand 3 states. 159.91/136.29 [2019-03-28 12:42:37,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 159.91/136.29 [2019-03-28 12:42:37,084 INFO L93 Difference]: Finished difference Result 35 states and 61 transitions. 159.91/136.29 [2019-03-28 12:42:37,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 159.91/136.29 [2019-03-28 12:42:37,084 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 159.91/136.29 [2019-03-28 12:42:37,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 159.91/136.29 [2019-03-28 12:42:37,085 INFO L225 Difference]: With dead ends: 35 159.91/136.29 [2019-03-28 12:42:37,085 INFO L226 Difference]: Without dead ends: 32 159.91/136.29 [2019-03-28 12:42:37,086 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 159.91/136.29 [2019-03-28 12:42:37,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. 159.91/136.29 [2019-03-28 12:42:37,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. 159.91/136.29 [2019-03-28 12:42:37,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. 159.91/136.29 [2019-03-28 12:42:37,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 58 transitions. 159.91/136.29 [2019-03-28 12:42:37,091 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 58 transitions. Word has length 5 159.91/136.29 [2019-03-28 12:42:37,091 INFO L84 Accepts]: Finished accepts. word is rejected. 159.91/136.29 [2019-03-28 12:42:37,091 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 58 transitions. 159.91/136.29 [2019-03-28 12:42:37,091 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 159.91/136.29 [2019-03-28 12:42:37,091 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 58 transitions. 159.91/136.29 [2019-03-28 12:42:37,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 159.91/136.29 [2019-03-28 12:42:37,092 INFO L394 BasicCegarLoop]: Found error trace 159.91/136.29 [2019-03-28 12:42:37,092 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] 159.91/136.29 [2019-03-28 12:42:37,092 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION]=== 159.91/136.29 [2019-03-28 12:42:37,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 159.91/136.29 [2019-03-28 12:42:37,093 INFO L82 PathProgramCache]: Analyzing trace with hash 128024773, now seen corresponding path program 1 times 159.91/136.29 [2019-03-28 12:42:37,093 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 159.91/136.29 [2019-03-28 12:42:37,093 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 159.91/136.29 [2019-03-28 12:42:37,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 159.91/136.29 [2019-03-28 12:42:37,094 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 159.91/136.29 [2019-03-28 12:42:37,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 159.91/136.29 [2019-03-28 12:42:37,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 159.91/136.29 [2019-03-28 12:42:37,127 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 159.91/136.29 [2019-03-28 12:42:37,127 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 159.91/136.29 [2019-03-28 12:42:37,128 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 159.91/136.29 [2019-03-28 12:42:37,128 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 159.91/136.29 [2019-03-28 12:42:37,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 159.91/136.29 [2019-03-28 12:42:37,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 159.91/136.29 [2019-03-28 12:42:37,129 INFO L87 Difference]: Start difference. First operand 32 states and 58 transitions. Second operand 3 states. 159.91/136.29 [2019-03-28 12:42:37,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 159.91/136.29 [2019-03-28 12:42:37,234 INFO L93 Difference]: Finished difference Result 32 states and 58 transitions. 159.91/136.29 [2019-03-28 12:42:37,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 159.91/136.29 [2019-03-28 12:42:37,234 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 159.91/136.29 [2019-03-28 12:42:37,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 159.91/136.29 [2019-03-28 12:42:37,235 INFO L225 Difference]: With dead ends: 32 159.91/136.29 [2019-03-28 12:42:37,235 INFO L226 Difference]: Without dead ends: 29 159.91/136.29 [2019-03-28 12:42:37,236 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 159.91/136.29 [2019-03-28 12:42:37,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. 159.91/136.29 [2019-03-28 12:42:37,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. 159.91/136.29 [2019-03-28 12:42:37,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. 159.91/136.29 [2019-03-28 12:42:37,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 55 transitions. 159.91/136.29 [2019-03-28 12:42:37,239 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 55 transitions. Word has length 5 159.91/136.29 [2019-03-28 12:42:37,240 INFO L84 Accepts]: Finished accepts. word is rejected. 159.91/136.29 [2019-03-28 12:42:37,240 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 55 transitions. 159.91/136.29 [2019-03-28 12:42:37,240 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 159.91/136.29 [2019-03-28 12:42:37,240 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 55 transitions. 159.91/136.29 [2019-03-28 12:42:37,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 159.91/136.29 [2019-03-28 12:42:37,240 INFO L394 BasicCegarLoop]: Found error trace 159.91/136.29 [2019-03-28 12:42:37,240 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] 159.91/136.29 [2019-03-28 12:42:37,241 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION]=== 159.91/136.29 [2019-03-28 12:42:37,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 159.91/136.29 [2019-03-28 12:42:37,241 INFO L82 PathProgramCache]: Analyzing trace with hash -326201459, now seen corresponding path program 1 times 159.91/136.29 [2019-03-28 12:42:37,241 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 159.91/136.29 [2019-03-28 12:42:37,241 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 159.91/136.29 [2019-03-28 12:42:37,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 159.91/136.29 [2019-03-28 12:42:37,243 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 159.91/136.29 [2019-03-28 12:42:37,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 159.91/136.29 [2019-03-28 12:42:37,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 159.91/136.29 [2019-03-28 12:42:37,267 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 159.91/136.29 [2019-03-28 12:42:37,268 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 159.91/136.29 [2019-03-28 12:42:37,268 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 159.91/136.29 [2019-03-28 12:42:37,268 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 159.91/136.29 [2019-03-28 12:42:37,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 159.91/136.29 [2019-03-28 12:42:37,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 159.91/136.29 [2019-03-28 12:42:37,269 INFO L87 Difference]: Start difference. First operand 29 states and 55 transitions. Second operand 3 states. 159.91/136.29 [2019-03-28 12:42:37,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 159.91/136.29 [2019-03-28 12:42:37,364 INFO L93 Difference]: Finished difference Result 29 states and 55 transitions. 159.91/136.29 [2019-03-28 12:42:37,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 159.91/136.29 [2019-03-28 12:42:37,364 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 159.91/136.29 [2019-03-28 12:42:37,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 159.91/136.29 [2019-03-28 12:42:37,365 INFO L225 Difference]: With dead ends: 29 159.91/136.29 [2019-03-28 12:42:37,365 INFO L226 Difference]: Without dead ends: 25 159.91/136.29 [2019-03-28 12:42:37,366 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 159.91/136.29 [2019-03-28 12:42:37,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. 159.91/136.29 [2019-03-28 12:42:37,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. 159.91/136.29 [2019-03-28 12:42:37,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. 159.91/136.29 [2019-03-28 12:42:37,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 47 transitions. 159.91/136.29 [2019-03-28 12:42:37,369 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 47 transitions. Word has length 6 159.91/136.29 [2019-03-28 12:42:37,369 INFO L84 Accepts]: Finished accepts. word is rejected. 159.91/136.29 [2019-03-28 12:42:37,369 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 47 transitions. 159.91/136.29 [2019-03-28 12:42:37,369 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 159.91/136.29 [2019-03-28 12:42:37,370 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 47 transitions. 159.91/136.29 [2019-03-28 12:42:37,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 159.91/136.29 [2019-03-28 12:42:37,370 INFO L394 BasicCegarLoop]: Found error trace 159.91/136.29 [2019-03-28 12:42:37,370 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] 159.91/136.29 [2019-03-28 12:42:37,370 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION]=== 159.91/136.29 [2019-03-28 12:42:37,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 159.91/136.29 [2019-03-28 12:42:37,371 INFO L82 PathProgramCache]: Analyzing trace with hash -326201457, now seen corresponding path program 1 times 159.91/136.29 [2019-03-28 12:42:37,371 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 159.91/136.29 [2019-03-28 12:42:37,371 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 159.91/136.29 [2019-03-28 12:42:37,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 159.91/136.29 [2019-03-28 12:42:37,372 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 159.91/136.29 [2019-03-28 12:42:37,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 159.91/136.29 [2019-03-28 12:42:37,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 159.91/136.29 [2019-03-28 12:42:37,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 159.91/136.29 [2019-03-28 12:42:37,396 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 159.91/136.29 [2019-03-28 12:42:37,396 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 159.91/136.29 [2019-03-28 12:42:37,397 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 159.91/136.29 [2019-03-28 12:42:37,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 159.91/136.29 [2019-03-28 12:42:37,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 159.91/136.29 [2019-03-28 12:42:37,398 INFO L87 Difference]: Start difference. First operand 25 states and 47 transitions. Second operand 3 states. 159.91/136.29 [2019-03-28 12:42:37,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 159.91/136.29 [2019-03-28 12:42:37,484 INFO L93 Difference]: Finished difference Result 29 states and 47 transitions. 159.91/136.29 [2019-03-28 12:42:37,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 159.91/136.29 [2019-03-28 12:42:37,485 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 159.91/136.29 [2019-03-28 12:42:37,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 159.91/136.29 [2019-03-28 12:42:37,486 INFO L225 Difference]: With dead ends: 29 159.91/136.29 [2019-03-28 12:42:37,486 INFO L226 Difference]: Without dead ends: 25 159.91/136.29 [2019-03-28 12:42:37,487 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 159.91/136.29 [2019-03-28 12:42:37,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. 159.91/136.29 [2019-03-28 12:42:37,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. 159.91/136.29 [2019-03-28 12:42:37,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. 159.91/136.29 [2019-03-28 12:42:37,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 43 transitions. 159.91/136.29 [2019-03-28 12:42:37,490 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 43 transitions. Word has length 6 159.91/136.29 [2019-03-28 12:42:37,490 INFO L84 Accepts]: Finished accepts. word is rejected. 159.91/136.29 [2019-03-28 12:42:37,491 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 43 transitions. 159.91/136.29 [2019-03-28 12:42:37,491 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 159.91/136.29 [2019-03-28 12:42:37,491 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 43 transitions. 159.91/136.29 [2019-03-28 12:42:37,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 159.91/136.29 [2019-03-28 12:42:37,491 INFO L394 BasicCegarLoop]: Found error trace 159.91/136.29 [2019-03-28 12:42:37,491 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] 159.91/136.29 [2019-03-28 12:42:37,492 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION]=== 159.91/136.29 [2019-03-28 12:42:37,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 159.91/136.29 [2019-03-28 12:42:37,492 INFO L82 PathProgramCache]: Analyzing trace with hash -326201456, now seen corresponding path program 1 times 159.91/136.29 [2019-03-28 12:42:37,492 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 159.91/136.29 [2019-03-28 12:42:37,492 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 159.91/136.29 [2019-03-28 12:42:37,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 159.91/136.29 [2019-03-28 12:42:37,493 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 159.91/136.29 [2019-03-28 12:42:37,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 159.91/136.29 [2019-03-28 12:42:37,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 159.91/136.29 [2019-03-28 12:42:37,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 159.91/136.29 [2019-03-28 12:42:37,521 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 159.91/136.29 [2019-03-28 12:42:37,522 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 159.91/136.29 [2019-03-28 12:42:37,522 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 159.91/136.29 [2019-03-28 12:42:37,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 159.91/136.29 [2019-03-28 12:42:37,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 159.91/136.29 [2019-03-28 12:42:37,523 INFO L87 Difference]: Start difference. First operand 25 states and 43 transitions. Second operand 3 states. 159.91/136.29 [2019-03-28 12:42:37,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 159.91/136.29 [2019-03-28 12:42:37,610 INFO L93 Difference]: Finished difference Result 25 states and 43 transitions. 159.91/136.29 [2019-03-28 12:42:37,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 159.91/136.29 [2019-03-28 12:42:37,610 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 159.91/136.29 [2019-03-28 12:42:37,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 159.91/136.29 [2019-03-28 12:42:37,611 INFO L225 Difference]: With dead ends: 25 159.91/136.29 [2019-03-28 12:42:37,611 INFO L226 Difference]: Without dead ends: 0 159.91/136.29 [2019-03-28 12:42:37,611 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 159.91/136.29 [2019-03-28 12:42:37,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. 159.91/136.29 [2019-03-28 12:42:37,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. 159.91/136.29 [2019-03-28 12:42:37,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. 159.91/136.29 [2019-03-28 12:42:37,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. 159.91/136.29 [2019-03-28 12:42:37,612 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 6 159.91/136.29 [2019-03-28 12:42:37,612 INFO L84 Accepts]: Finished accepts. word is rejected. 159.91/136.29 [2019-03-28 12:42:37,613 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. 159.91/136.29 [2019-03-28 12:42:37,613 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 159.91/136.29 [2019-03-28 12:42:37,613 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. 159.91/136.29 [2019-03-28 12:42:37,613 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. 159.91/136.29 [2019-03-28 12:42:37,618 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. 159.91/136.29 [2019-03-28 12:42:37,659 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr17REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. 159.91/136.29 [2019-03-28 12:42:37,659 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr15REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. 159.91/136.29 [2019-03-28 12:42:37,659 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr13REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. 159.91/136.29 [2019-03-28 12:42:37,659 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr11REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. 159.91/136.29 [2019-03-28 12:42:37,659 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr9REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. 159.91/136.29 [2019-03-28 12:42:37,659 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr7REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. 159.91/136.29 [2019-03-28 12:42:37,660 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr5REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. 159.91/136.29 [2019-03-28 12:42:37,660 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr3REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. 159.91/136.29 [2019-03-28 12:42:37,660 INFO L448 ceAbstractionStarter]: For program point L15(line 15) no Hoare annotation was computed. 159.91/136.29 [2019-03-28 12:42:37,660 INFO L448 ceAbstractionStarter]: For program point L15-1(line 15) no Hoare annotation was computed. 159.91/136.29 [2019-03-28 12:42:37,660 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr29REQUIRES_VIOLATION(line 20) no Hoare annotation was computed. 159.91/136.29 [2019-03-28 12:42:37,660 INFO L448 ceAbstractionStarter]: For program point L15-2(line 15) no Hoare annotation was computed. 159.91/136.29 [2019-03-28 12:42:37,660 INFO L448 ceAbstractionStarter]: For program point L15-3(line 15) no Hoare annotation was computed. 159.91/136.29 [2019-03-28 12:42:37,660 INFO L448 ceAbstractionStarter]: For program point L11(line 11) no Hoare annotation was computed. 159.91/136.29 [2019-03-28 12:42:37,661 INFO L448 ceAbstractionStarter]: For program point L15-4(line 15) no Hoare annotation was computed. 159.91/136.29 [2019-03-28 12:42:37,661 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr27REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. 159.91/136.29 [2019-03-28 12:42:37,661 INFO L448 ceAbstractionStarter]: For program point L11-1(line 11) no Hoare annotation was computed. 159.91/136.29 [2019-03-28 12:42:37,661 INFO L448 ceAbstractionStarter]: For program point L15-5(line 15) no Hoare annotation was computed. 159.91/136.29 [2019-03-28 12:42:37,661 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr25REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. 159.91/136.29 [2019-03-28 12:42:37,661 INFO L448 ceAbstractionStarter]: For program point L15-7(lines 15 19) no Hoare annotation was computed. 159.91/136.29 [2019-03-28 12:42:37,661 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr23REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. 159.91/136.29 [2019-03-28 12:42:37,662 INFO L444 ceAbstractionStarter]: At program point L15-9(lines 14 19) the Hoare annotation is: (and (= (select |#valid| ULTIMATE.start_test_fun_~z_ref~0.base) 1) (= 4 (select |#length| ULTIMATE.start_test_fun_~x_ref~0.base)) (= 0 ULTIMATE.start_test_fun_~c~0.offset) (= 0 ULTIMATE.start_test_fun_~z_ref~0.offset) (= (select |#length| ULTIMATE.start_test_fun_~y_ref~0.base) 4) (= ULTIMATE.start_test_fun_~x_ref~0.offset 0) (= (select |#valid| ULTIMATE.start_test_fun_~y_ref~0.base) 1) (= 4 (select |#length| ULTIMATE.start_test_fun_~z_ref~0.base)) (= 1 (select |#valid| ULTIMATE.start_test_fun_~x_ref~0.base)) (= ULTIMATE.start_test_fun_~y_ref~0.offset 0) (= 4 (select |#length| ULTIMATE.start_test_fun_~c~0.base)) (= 1 (select |#valid| ULTIMATE.start_test_fun_~c~0.base))) 159.91/136.29 [2019-03-28 12:42:37,662 INFO L448 ceAbstractionStarter]: For program point L15-10(lines 15 19) no Hoare annotation was computed. 159.91/136.29 [2019-03-28 12:42:37,662 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr21REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. 159.91/136.29 [2019-03-28 12:42:37,662 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr19REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. 159.91/136.29 [2019-03-28 12:42:37,662 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. 159.91/136.29 [2019-03-28 12:42:37,662 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. 159.91/136.29 [2019-03-28 12:42:37,662 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. 159.91/136.29 [2019-03-28 12:42:37,663 INFO L448 ceAbstractionStarter]: For program point L16(line 16) no Hoare annotation was computed. 159.91/136.29 [2019-03-28 12:42:37,663 INFO L448 ceAbstractionStarter]: For program point L16-1(line 16) no Hoare annotation was computed. 159.91/136.29 [2019-03-28 12:42:37,663 INFO L448 ceAbstractionStarter]: For program point L12(line 12) no Hoare annotation was computed. 159.91/136.29 [2019-03-28 12:42:37,663 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr16REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. 159.91/136.29 [2019-03-28 12:42:37,663 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr14REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. 159.91/136.29 [2019-03-28 12:42:37,663 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr12REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. 159.91/136.29 [2019-03-28 12:42:37,663 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr10REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. 159.91/136.29 [2019-03-28 12:42:37,663 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr8REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. 159.91/136.29 [2019-03-28 12:42:37,663 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr6REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. 159.91/136.29 [2019-03-28 12:42:37,664 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr4REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. 159.91/136.29 [2019-03-28 12:42:37,664 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. 159.91/136.29 [2019-03-28 12:42:37,664 INFO L448 ceAbstractionStarter]: For program point L17(line 17) no Hoare annotation was computed. 159.91/136.29 [2019-03-28 12:42:37,664 INFO L448 ceAbstractionStarter]: For program point L17-1(line 17) no Hoare annotation was computed. 159.91/136.29 [2019-03-28 12:42:37,664 INFO L448 ceAbstractionStarter]: For program point L13(line 13) no Hoare annotation was computed. 159.91/136.29 [2019-03-28 12:42:37,664 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr28REQUIRES_VIOLATION(line 20) no Hoare annotation was computed. 159.91/136.29 [2019-03-28 12:42:37,664 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr26REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. 159.91/136.29 [2019-03-28 12:42:37,664 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr24REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. 159.91/136.29 [2019-03-28 12:42:37,665 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr22REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. 159.91/136.29 [2019-03-28 12:42:37,665 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr20REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. 159.91/136.29 [2019-03-28 12:42:37,665 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr18REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. 159.91/136.29 [2019-03-28 12:42:37,665 INFO L448 ceAbstractionStarter]: For program point L18(line 18) no Hoare annotation was computed. 159.91/136.29 [2019-03-28 12:42:37,665 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. 159.91/136.29 [2019-03-28 12:42:37,665 INFO L448 ceAbstractionStarter]: For program point L18-1(line 18) no Hoare annotation was computed. 159.91/136.29 [2019-03-28 12:42:37,666 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg 159.91/136.29 [2019-03-28 12:42:37,676 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 159.91/136.29 [2019-03-28 12:42:37,677 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 159.91/136.29 [2019-03-28 12:42:37,677 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 159.91/136.29 [2019-03-28 12:42:37,677 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 159.91/136.29 [2019-03-28 12:42:37,684 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 159.91/136.29 [2019-03-28 12:42:37,684 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 159.91/136.29 [2019-03-28 12:42:37,685 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 159.91/136.29 [2019-03-28 12:42:37,685 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 159.91/136.29 [2019-03-28 12:42:37,687 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:42:37 BasicIcfg 159.91/136.29 [2019-03-28 12:42:37,687 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- 159.91/136.29 [2019-03-28 12:42:37,688 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- 159.91/136.29 [2019-03-28 12:42:37,688 INFO L271 PluginConnector]: Initializing BuchiAutomizer... 159.91/136.29 [2019-03-28 12:42:37,691 INFO L276 PluginConnector]: BuchiAutomizer initialized 159.91/136.29 [2019-03-28 12:42:37,692 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 159.91/136.29 [2019-03-28 12:42:37,692 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.03 12:42:34" (1/5) ... 159.91/136.29 [2019-03-28 12:42:37,693 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7b5d689e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.03 12:42:37, skipping insertion in model container 159.91/136.29 [2019-03-28 12:42:37,693 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 159.91/136.29 [2019-03-28 12:42:37,693 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:42:34" (2/5) ... 159.91/136.29 [2019-03-28 12:42:37,694 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7b5d689e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.03 12:42:37, skipping insertion in model container 159.91/136.29 [2019-03-28 12:42:37,694 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 159.91/136.29 [2019-03-28 12:42:37,694 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:42:35" (3/5) ... 159.91/136.29 [2019-03-28 12:42:37,694 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7b5d689e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:42:37, skipping insertion in model container 159.91/136.29 [2019-03-28 12:42:37,694 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 159.91/136.29 [2019-03-28 12:42:37,694 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:42:35" (4/5) ... 159.91/136.29 [2019-03-28 12:42:37,695 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7b5d689e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:42:37, skipping insertion in model container 159.91/136.29 [2019-03-28 12:42:37,695 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 159.91/136.29 [2019-03-28 12:42:37,695 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:42:37" (5/5) ... 159.91/136.29 [2019-03-28 12:42:37,696 INFO L375 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 159.91/136.29 [2019-03-28 12:42:37,718 INFO L133 ementStrategyFactory]: Using default assertion order modulation 159.91/136.29 [2019-03-28 12:42:37,718 INFO L374 BuchiCegarLoop]: Interprodecural is true 159.91/136.29 [2019-03-28 12:42:37,719 INFO L375 BuchiCegarLoop]: Hoare is true 159.91/136.29 [2019-03-28 12:42:37,719 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates 159.91/136.29 [2019-03-28 12:42:37,719 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE 159.91/136.29 [2019-03-28 12:42:37,719 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION 159.91/136.29 [2019-03-28 12:42:37,719 INFO L379 BuchiCegarLoop]: Difference is false 159.91/136.29 [2019-03-28 12:42:37,719 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA 159.91/136.29 [2019-03-28 12:42:37,719 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== 159.91/136.29 [2019-03-28 12:42:37,723 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 51 states. 159.91/136.29 [2019-03-28 12:42:37,729 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 159.91/136.29 [2019-03-28 12:42:37,729 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 159.91/136.29 [2019-03-28 12:42:37,729 INFO L119 BuchiIsEmpty]: Starting construction of run 159.91/136.29 [2019-03-28 12:42:37,734 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] 159.91/136.29 [2019-03-28 12:42:37,734 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 159.91/136.29 [2019-03-28 12:42:37,734 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ 159.91/136.29 [2019-03-28 12:42:37,734 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 51 states. 159.91/136.29 [2019-03-28 12:42:37,736 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 159.91/136.29 [2019-03-28 12:42:37,736 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 159.91/136.29 [2019-03-28 12:42:37,737 INFO L119 BuchiIsEmpty]: Starting construction of run 159.91/136.29 [2019-03-28 12:42:37,737 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] 159.91/136.29 [2019-03-28 12:42:37,737 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 159.91/136.29 [2019-03-28 12:42:37,743 INFO L794 eck$LassoCheckResult]: Stem: 22#ULTIMATE.startENTRYtrue [102] 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 [186] L-1-->L11: Formula: (let ((.cse1 (store |v_#valid_7| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 1))) (let ((.cse2 (store .cse1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 1))) (let ((.cse0 (store .cse2 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1| 1))) (and (< |v_ULTIMATE.start_test_fun_#t~malloc2.base_1| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_test_fun_#t~malloc3.offset_1| 0) (= v_ULTIMATE.start_test_fun_~c~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc3.offset_1|) (= |v_ULTIMATE.start_test_fun_#t~malloc0.offset_1| 0) (= |v_ULTIMATE.start_test_fun_#t~malloc1.offset_1| 0) (> |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 0) (> |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 0) (= v_ULTIMATE.start_test_fun_~y_ref~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc1.offset_1|) (< |v_ULTIMATE.start_test_fun_#t~malloc3.base_1| |v_#StackHeapBarrier_1|) (> |v_ULTIMATE.start_test_fun_#t~malloc3.base_1| 0) (= v_ULTIMATE.start_test_fun_~x_ref~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc0.offset_1|) (= v_ULTIMATE.start_test_fun_~y_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|) (= v_ULTIMATE.start_test_fun_~c~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc3.base_1|) (= (store (store (store (store |v_#length_5| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 4) |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 4) |v_ULTIMATE.start_test_fun_#t~malloc2.base_1| 4) |v_ULTIMATE.start_test_fun_#t~malloc3.base_1| 4) |v_#length_1|) (= |v_#valid_3| (store .cse0 |v_ULTIMATE.start_test_fun_#t~malloc3.base_1| 1)) (= 0 (select .cse0 |v_ULTIMATE.start_test_fun_#t~malloc3.base_1|)) (= v_ULTIMATE.start_test_fun_~x_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc0.base_1|) (= 0 (select .cse1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|)) (= |v_ULTIMATE.start_test_fun_#in~x_1| |v_ULTIMATE.start_main_#t~nondet13_1|) (= v_ULTIMATE.start_test_fun_~y_1 |v_ULTIMATE.start_test_fun_#in~y_1|) (= |v_ULTIMATE.start_test_fun_#in~y_1| |v_ULTIMATE.start_main_#t~nondet14_1|) (< |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (= (select |v_#valid_7| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1|) 0) (= 0 (select .cse2 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|)) (= v_ULTIMATE.start_test_fun_~z_1 |v_ULTIMATE.start_test_fun_#in~z_1|) (> 0 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|) (= v_ULTIMATE.start_test_fun_~x_1 |v_ULTIMATE.start_test_fun_#in~x_1|) (= v_ULTIMATE.start_test_fun_~z_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|) (= |v_ULTIMATE.start_test_fun_#t~malloc2.offset_1| 0) (= |v_ULTIMATE.start_test_fun_#in~z_1| |v_ULTIMATE.start_main_#t~nondet15_1|) (< |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_test_fun_~z_ref~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc2.offset_1|))))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_5|, #valid=|v_#valid_7|} OutVars{ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_1, ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_1, ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_1|, ULTIMATE.start_test_fun_#t~mem11=|v_ULTIMATE.start_test_fun_#t~mem11_1|, ULTIMATE.start_test_fun_#t~mem12=|v_ULTIMATE.start_test_fun_#t~mem12_1|, ULTIMATE.start_main_#t~nondet13=|v_ULTIMATE.start_main_#t~nondet13_1|, ULTIMATE.start_main_#t~nondet14=|v_ULTIMATE.start_main_#t~nondet14_1|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_1, ULTIMATE.start_test_fun_#t~malloc1.offset=|v_ULTIMATE.start_test_fun_#t~malloc1.offset_1|, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_1|, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_1|, ULTIMATE.start_test_fun_~z=v_ULTIMATE.start_test_fun_~z_1, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_1|, ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_1|, ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_1|, ULTIMATE.start_test_fun_#res=|v_ULTIMATE.start_test_fun_#res_1|, #length=|v_#length_1|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_1, ULTIMATE.start_test_fun_#t~malloc3.offset=|v_ULTIMATE.start_test_fun_#t~malloc3.offset_1|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_1, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_1, ULTIMATE.start_test_fun_~z_ref~0.base=v_ULTIMATE.start_test_fun_~z_ref~0.base_1, ULTIMATE.start_test_fun_#t~malloc0.offset=|v_ULTIMATE.start_test_fun_#t~malloc0.offset_1|, ULTIMATE.start_test_fun_#t~short8=|v_ULTIMATE.start_test_fun_#t~short8_1|, ULTIMATE.start_test_fun_#in~z=|v_ULTIMATE.start_test_fun_#in~z_1|, ULTIMATE.start_test_fun_#in~y=|v_ULTIMATE.start_test_fun_#in~y_1|, ULTIMATE.start_test_fun_#in~x=|v_ULTIMATE.start_test_fun_#in~x_1|, ULTIMATE.start_test_fun_~z_ref~0.offset=v_ULTIMATE.start_test_fun_~z_ref~0.offset_1, ULTIMATE.start_main_#t~ret16=|v_ULTIMATE.start_main_#t~ret16_1|, ULTIMATE.start_test_fun_#t~malloc1.base=|v_ULTIMATE.start_test_fun_#t~malloc1.base_1|, ULTIMATE.start_test_fun_#t~malloc2.base=|v_ULTIMATE.start_test_fun_#t~malloc2.base_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_test_fun_#t~malloc2.offset=|v_ULTIMATE.start_test_fun_#t~malloc2.offset_1|, ULTIMATE.start_test_fun_#t~malloc3.base=|v_ULTIMATE.start_test_fun_#t~malloc3.base_1|, ULTIMATE.start_test_fun_#t~malloc0.base=|v_ULTIMATE.start_test_fun_#t~malloc0.base_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_1|, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_1, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_1} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_~y, ULTIMATE.start_test_fun_~x, ULTIMATE.start_test_fun_#t~mem10, ULTIMATE.start_test_fun_#t~mem11, ULTIMATE.start_test_fun_#t~mem12, ULTIMATE.start_main_#t~nondet13, ULTIMATE.start_main_#t~nondet14, ULTIMATE.start_test_fun_~x_ref~0.offset, ULTIMATE.start_test_fun_#t~malloc1.offset, ULTIMATE.start_test_fun_#t~mem9, ULTIMATE.start_test_fun_#t~mem6, ULTIMATE.start_test_fun_~z, ULTIMATE.start_test_fun_#t~mem7, ULTIMATE.start_test_fun_#t~mem4, ULTIMATE.start_test_fun_#t~mem5, ULTIMATE.start_test_fun_#res, #length, ULTIMATE.start_test_fun_~y_ref~0.base, ULTIMATE.start_test_fun_#t~malloc3.offset, ULTIMATE.start_test_fun_~x_ref~0.base, ULTIMATE.start_test_fun_~c~0.offset, ULTIMATE.start_test_fun_~z_ref~0.base, ULTIMATE.start_test_fun_#t~malloc0.offset, ULTIMATE.start_test_fun_#t~short8, ULTIMATE.start_test_fun_#in~z, ULTIMATE.start_test_fun_#in~y, ULTIMATE.start_test_fun_#in~x, ULTIMATE.start_test_fun_~z_ref~0.offset, ULTIMATE.start_main_#t~ret16, ULTIMATE.start_test_fun_#t~malloc1.base, ULTIMATE.start_test_fun_#t~malloc2.base, ULTIMATE.start_test_fun_#t~malloc2.offset, ULTIMATE.start_test_fun_#t~malloc3.base, ULTIMATE.start_test_fun_#t~malloc0.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_#t~nondet15, ULTIMATE.start_test_fun_~y_ref~0.offset, ULTIMATE.start_test_fun_~c~0.base] 23#L11true [103] L11-->L11-1: Formula: (and (= (select |v_#valid_8| v_ULTIMATE.start_test_fun_~x_ref~0.base_3) 1) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_3 4) (select |v_#length_6| v_ULTIMATE.start_test_fun_~x_ref~0.base_3)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_3) (= (store |v_#memory_int_2| v_ULTIMATE.start_test_fun_~x_ref~0.base_3 (store (select |v_#memory_int_2| v_ULTIMATE.start_test_fun_~x_ref~0.base_3) v_ULTIMATE.start_test_fun_~x_ref~0.offset_3 v_ULTIMATE.start_test_fun_~x_3)) |v_#memory_int_1|)) InVars {ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_3, #valid=|v_#valid_8|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_3, #length=|v_#length_6|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_3} OutVars{ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_3, #valid=|v_#valid_8|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_3, #length=|v_#length_6|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_3} AuxVars[] AssignedVars[#memory_int] 20#L11-1true [98] L11-1-->L12: Formula: (and (= |v_#memory_int_3| (store |v_#memory_int_4| v_ULTIMATE.start_test_fun_~y_ref~0.base_3 (store (select |v_#memory_int_4| v_ULTIMATE.start_test_fun_~y_ref~0.base_3) v_ULTIMATE.start_test_fun_~y_ref~0.offset_3 v_ULTIMATE.start_test_fun_~y_3))) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_3 4) (select |v_#length_8| v_ULTIMATE.start_test_fun_~y_ref~0.base_3)) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_3) (= 1 (select |v_#valid_10| v_ULTIMATE.start_test_fun_~y_ref~0.base_3))) InVars {ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_3, #valid=|v_#valid_10|, #memory_int=|v_#memory_int_4|, #length=|v_#length_8|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_3, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_3} OutVars{ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_3, #valid=|v_#valid_10|, #memory_int=|v_#memory_int_3|, #length=|v_#length_8|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_3, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_3} AuxVars[] AssignedVars[#memory_int] 41#L12true [123] L12-->L13: Formula: (and (= 1 (select |v_#valid_12| v_ULTIMATE.start_test_fun_~z_ref~0.base_3)) (= (store |v_#memory_int_6| v_ULTIMATE.start_test_fun_~z_ref~0.base_3 (store (select |v_#memory_int_6| v_ULTIMATE.start_test_fun_~z_ref~0.base_3) v_ULTIMATE.start_test_fun_~z_ref~0.offset_3 v_ULTIMATE.start_test_fun_~z_3)) |v_#memory_int_5|) (<= (+ v_ULTIMATE.start_test_fun_~z_ref~0.offset_3 4) (select |v_#length_10| v_ULTIMATE.start_test_fun_~z_ref~0.base_3)) (<= 0 v_ULTIMATE.start_test_fun_~z_ref~0.offset_3)) InVars {ULTIMATE.start_test_fun_~z_ref~0.base=v_ULTIMATE.start_test_fun_~z_ref~0.base_3, #valid=|v_#valid_12|, #memory_int=|v_#memory_int_6|, #length=|v_#length_10|, ULTIMATE.start_test_fun_~z=v_ULTIMATE.start_test_fun_~z_3, ULTIMATE.start_test_fun_~z_ref~0.offset=v_ULTIMATE.start_test_fun_~z_ref~0.offset_3} OutVars{ULTIMATE.start_test_fun_~z_ref~0.base=v_ULTIMATE.start_test_fun_~z_ref~0.base_3, #valid=|v_#valid_12|, #memory_int=|v_#memory_int_5|, #length=|v_#length_10|, ULTIMATE.start_test_fun_~z=v_ULTIMATE.start_test_fun_~z_3, ULTIMATE.start_test_fun_~z_ref~0.offset=v_ULTIMATE.start_test_fun_~z_ref~0.offset_3} AuxVars[] AssignedVars[#memory_int] 50#L13true [134] L13-->L15-9: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_3) (= (store |v_#memory_int_8| v_ULTIMATE.start_test_fun_~c~0.base_3 (store (select |v_#memory_int_8| v_ULTIMATE.start_test_fun_~c~0.base_3) v_ULTIMATE.start_test_fun_~c~0.offset_3 0)) |v_#memory_int_7|) (= 1 (select |v_#valid_14| v_ULTIMATE.start_test_fun_~c~0.base_3)) (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_3 4) (select |v_#length_12| v_ULTIMATE.start_test_fun_~c~0.base_3))) InVars {#memory_int=|v_#memory_int_8|, #length=|v_#length_12|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_3, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_3, #valid=|v_#valid_14|} OutVars{#memory_int=|v_#memory_int_7|, #length=|v_#length_12|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_3, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_3, #valid=|v_#valid_14|} AuxVars[] AssignedVars[#memory_int] 5#L15-9true 159.91/136.29 [2019-03-28 12:42:37,744 INFO L796 eck$LassoCheckResult]: Loop: 5#L15-9true [82] L15-9-->L15: Formula: (and (= |v_ULTIMATE.start_test_fun_#t~mem4_2| (select (select |v_#memory_int_9| v_ULTIMATE.start_test_fun_~x_ref~0.base_6) v_ULTIMATE.start_test_fun_~x_ref~0.offset_5)) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_5 4) (select |v_#length_14| v_ULTIMATE.start_test_fun_~x_ref~0.base_6)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_5) (= 1 (select |v_#valid_16| v_ULTIMATE.start_test_fun_~x_ref~0.base_6))) InVars {#memory_int=|v_#memory_int_9|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_5, #length=|v_#length_14|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_6, #valid=|v_#valid_16|} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_2|, #valid=|v_#valid_16|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_5, #length=|v_#length_14|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem4] 16#L15true [95] L15-->L15-1: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~z_ref~0.offset_5 4) (select |v_#length_16| v_ULTIMATE.start_test_fun_~z_ref~0.base_6)) (= (select |v_#valid_18| v_ULTIMATE.start_test_fun_~z_ref~0.base_6) 1) (= |v_ULTIMATE.start_test_fun_#t~mem5_2| (select (select |v_#memory_int_10| v_ULTIMATE.start_test_fun_~z_ref~0.base_6) v_ULTIMATE.start_test_fun_~z_ref~0.offset_5)) (<= 0 v_ULTIMATE.start_test_fun_~z_ref~0.offset_5)) InVars {#memory_int=|v_#memory_int_10|, #length=|v_#length_16|, ULTIMATE.start_test_fun_~z_ref~0.base=v_ULTIMATE.start_test_fun_~z_ref~0.base_6, #valid=|v_#valid_18|, ULTIMATE.start_test_fun_~z_ref~0.offset=v_ULTIMATE.start_test_fun_~z_ref~0.offset_5} OutVars{ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_2|, ULTIMATE.start_test_fun_~z_ref~0.base=v_ULTIMATE.start_test_fun_~z_ref~0.base_6, #valid=|v_#valid_18|, #memory_int=|v_#memory_int_10|, #length=|v_#length_16|, ULTIMATE.start_test_fun_~z_ref~0.offset=v_ULTIMATE.start_test_fun_~z_ref~0.offset_5} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem5] 31#L15-1true [215] L15-1-->L15-2: Formula: (and |v_ULTIMATE.start_test_fun_#t~short8_2| (< |v_ULTIMATE.start_test_fun_#t~mem5_3| |v_ULTIMATE.start_test_fun_#t~mem4_3|)) InVars {ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_3|, ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_3|} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_3|, ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_3|, ULTIMATE.start_test_fun_#t~short8=|v_ULTIMATE.start_test_fun_#t~short8_2|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~short8] 30#L15-2true [113] L15-2-->L15-7: Formula: (not |v_ULTIMATE.start_test_fun_#t~short8_5|) InVars {ULTIMATE.start_test_fun_#t~short8=|v_ULTIMATE.start_test_fun_#t~short8_5|} OutVars{ULTIMATE.start_test_fun_#t~short8=|v_ULTIMATE.start_test_fun_#t~short8_5|} AuxVars[] AssignedVars[] 11#L15-7true [92] L15-7-->L16: Formula: |v_ULTIMATE.start_test_fun_#t~short8_9| InVars {ULTIMATE.start_test_fun_#t~short8=|v_ULTIMATE.start_test_fun_#t~short8_9|} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_5|, ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_5|, ULTIMATE.start_test_fun_#t~short8=|v_ULTIMATE.start_test_fun_#t~short8_8|, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_5|, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_5|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem4, ULTIMATE.start_test_fun_#t~mem5, ULTIMATE.start_test_fun_#t~short8, ULTIMATE.start_test_fun_#t~mem6, ULTIMATE.start_test_fun_#t~mem7] 34#L16true [118] L16-->L16-1: Formula: (and (= (select |v_#valid_24| v_ULTIMATE.start_test_fun_~x_ref~0.base_9) 1) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_7) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_7 4) (select |v_#length_22| v_ULTIMATE.start_test_fun_~x_ref~0.base_9)) (= |v_ULTIMATE.start_test_fun_#t~mem9_2| (select (select |v_#memory_int_13| v_ULTIMATE.start_test_fun_~x_ref~0.base_9) v_ULTIMATE.start_test_fun_~x_ref~0.offset_7))) InVars {#memory_int=|v_#memory_int_13|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_7, #length=|v_#length_22|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_9, #valid=|v_#valid_24|} OutVars{#valid=|v_#valid_24|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_7, #length=|v_#length_22|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_9, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_2|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem9] 32#L16-1true [253] L16-1-->L17: Formula: (and (= (select |v_#valid_47| v_ULTIMATE.start_test_fun_~x_ref~0.base_15) 1) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_11 4) (select |v_#length_38| v_ULTIMATE.start_test_fun_~x_ref~0.base_15)) (= (store |v_#memory_int_26| v_ULTIMATE.start_test_fun_~x_ref~0.base_15 (store (select |v_#memory_int_26| v_ULTIMATE.start_test_fun_~x_ref~0.base_15) v_ULTIMATE.start_test_fun_~x_ref~0.offset_11 (+ |v_ULTIMATE.start_test_fun_#t~mem9_6| (- 1)))) |v_#memory_int_25|) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_11)) InVars {#valid=|v_#valid_47|, #memory_int=|v_#memory_int_26|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_11, #length=|v_#length_38|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_15, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_6|} OutVars{#valid=|v_#valid_47|, #memory_int=|v_#memory_int_25|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_11, #length=|v_#length_38|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_15, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_5|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_test_fun_#t~mem9] 46#L17true [131] L17-->L17-1: Formula: (and (= (select (select |v_#memory_int_16| v_ULTIMATE.start_test_fun_~y_ref~0.base_9) v_ULTIMATE.start_test_fun_~y_ref~0.offset_7) |v_ULTIMATE.start_test_fun_#t~mem10_2|) (= (select |v_#valid_28| v_ULTIMATE.start_test_fun_~y_ref~0.base_9) 1) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_7) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_7 4) (select |v_#length_26| v_ULTIMATE.start_test_fun_~y_ref~0.base_9))) InVars {#memory_int=|v_#memory_int_16|, #length=|v_#length_26|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_9, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_7, #valid=|v_#valid_28|} OutVars{ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_2|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_16|, #length=|v_#length_26|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_9, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_7} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem10] 44#L17-1true [256] L17-1-->L18: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_11) (= (store |v_#memory_int_30| v_ULTIMATE.start_test_fun_~y_ref~0.base_15 (store (select |v_#memory_int_30| v_ULTIMATE.start_test_fun_~y_ref~0.base_15) v_ULTIMATE.start_test_fun_~y_ref~0.offset_11 (+ |v_ULTIMATE.start_test_fun_#t~mem10_6| (- 1)))) |v_#memory_int_29|) (= 1 (select |v_#valid_52| v_ULTIMATE.start_test_fun_~y_ref~0.base_15)) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_11 4) (select |v_#length_41| v_ULTIMATE.start_test_fun_~y_ref~0.base_15))) InVars {ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_6|, #valid=|v_#valid_52|, #memory_int=|v_#memory_int_30|, #length=|v_#length_41|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_15, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_11} OutVars{ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_5|, #valid=|v_#valid_52|, #memory_int=|v_#memory_int_29|, #length=|v_#length_41|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_15, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_11} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem10, #memory_int] 9#L18true [88] L18-->L18-1: Formula: (and (= (select |v_#valid_32| v_ULTIMATE.start_test_fun_~c~0.base_6) 1) (= |v_ULTIMATE.start_test_fun_#t~mem11_2| (select (select |v_#memory_int_19| v_ULTIMATE.start_test_fun_~c~0.base_6) v_ULTIMATE.start_test_fun_~c~0.offset_5)) (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_5) (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_5 4) (select |v_#length_30| v_ULTIMATE.start_test_fun_~c~0.base_6))) InVars {#memory_int=|v_#memory_int_19|, #length=|v_#length_30|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_5, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_6, #valid=|v_#valid_32|} OutVars{ULTIMATE.start_test_fun_#t~mem11=|v_ULTIMATE.start_test_fun_#t~mem11_2|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_5, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_19|, #length=|v_#length_30|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem11] 6#L18-1true [257] L18-1-->L15-9: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_15 4) (select |v_#length_42| v_ULTIMATE.start_test_fun_~c~0.base_19)) (= (store |v_#memory_int_32| v_ULTIMATE.start_test_fun_~c~0.base_19 (store (select |v_#memory_int_32| v_ULTIMATE.start_test_fun_~c~0.base_19) v_ULTIMATE.start_test_fun_~c~0.offset_15 (+ |v_ULTIMATE.start_test_fun_#t~mem11_6| 1))) |v_#memory_int_31|) (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_15) (= (select |v_#valid_53| v_ULTIMATE.start_test_fun_~c~0.base_19) 1)) InVars {ULTIMATE.start_test_fun_#t~mem11=|v_ULTIMATE.start_test_fun_#t~mem11_6|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_15, #valid=|v_#valid_53|, #memory_int=|v_#memory_int_32|, #length=|v_#length_42|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_19} OutVars{ULTIMATE.start_test_fun_#t~mem11=|v_ULTIMATE.start_test_fun_#t~mem11_5|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_15, #valid=|v_#valid_53|, #memory_int=|v_#memory_int_31|, #length=|v_#length_42|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_19} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem11, #memory_int] 5#L15-9true 159.91/136.29 [2019-03-28 12:42:37,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 159.91/136.29 [2019-03-28 12:42:37,745 INFO L82 PathProgramCache]: Analyzing trace with hash -312348709, now seen corresponding path program 1 times 159.91/136.29 [2019-03-28 12:42:37,745 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 159.91/136.29 [2019-03-28 12:42:37,745 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 159.91/136.29 [2019-03-28 12:42:37,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 159.91/136.29 [2019-03-28 12:42:37,746 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 159.91/136.29 [2019-03-28 12:42:37,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 159.91/136.29 [2019-03-28 12:42:37,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 159.91/136.29 [2019-03-28 12:42:37,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 159.91/136.29 [2019-03-28 12:42:37,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 159.91/136.29 [2019-03-28 12:42:37,801 INFO L82 PathProgramCache]: Analyzing trace with hash -1705532831, now seen corresponding path program 1 times 159.91/136.29 [2019-03-28 12:42:37,801 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 159.91/136.29 [2019-03-28 12:42:37,801 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 159.91/136.29 [2019-03-28 12:42:37,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 159.91/136.29 [2019-03-28 12:42:37,802 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 159.91/136.29 [2019-03-28 12:42:37,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 159.91/136.29 [2019-03-28 12:42:37,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 159.91/136.29 [2019-03-28 12:42:37,812 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 159.91/136.29 [2019-03-28 12:42:37,813 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 159.91/136.29 [2019-03-28 12:42:37,813 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 159.91/136.29 [2019-03-28 12:42:37,813 INFO L811 eck$LassoCheckResult]: loop already infeasible 159.91/136.29 [2019-03-28 12:42:37,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 159.91/136.29 [2019-03-28 12:42:37,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 159.91/136.29 [2019-03-28 12:42:37,815 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 3 states. 159.91/136.29 [2019-03-28 12:42:37,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 159.91/136.29 [2019-03-28 12:42:37,974 INFO L93 Difference]: Finished difference Result 53 states and 101 transitions. 159.91/136.29 [2019-03-28 12:42:37,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 159.91/136.29 [2019-03-28 12:42:37,977 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 53 states and 101 transitions. 159.91/136.29 [2019-03-28 12:42:37,979 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 159.91/136.29 [2019-03-28 12:42:37,980 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 53 states to 22 states and 40 transitions. 159.91/136.29 [2019-03-28 12:42:37,981 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 159.91/136.29 [2019-03-28 12:42:37,981 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 159.91/136.29 [2019-03-28 12:42:37,982 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 40 transitions. 159.91/136.29 [2019-03-28 12:42:37,982 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 159.91/136.29 [2019-03-28 12:42:37,982 INFO L706 BuchiCegarLoop]: Abstraction has 22 states and 40 transitions. 159.91/136.29 [2019-03-28 12:42:37,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 40 transitions. 159.91/136.29 [2019-03-28 12:42:37,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. 159.91/136.29 [2019-03-28 12:42:37,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. 159.91/136.29 [2019-03-28 12:42:37,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 39 transitions. 159.91/136.29 [2019-03-28 12:42:37,986 INFO L729 BuchiCegarLoop]: Abstraction has 21 states and 39 transitions. 159.91/136.29 [2019-03-28 12:42:37,986 INFO L609 BuchiCegarLoop]: Abstraction has 21 states and 39 transitions. 159.91/136.29 [2019-03-28 12:42:37,986 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ 159.91/136.29 [2019-03-28 12:42:37,986 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 39 transitions. 159.91/136.29 [2019-03-28 12:42:37,987 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 159.91/136.29 [2019-03-28 12:42:37,987 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 159.91/136.29 [2019-03-28 12:42:37,987 INFO L119 BuchiIsEmpty]: Starting construction of run 159.91/136.29 [2019-03-28 12:42:37,988 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] 159.91/136.29 [2019-03-28 12:42:37,988 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 159.91/136.29 [2019-03-28 12:42:37,989 INFO L794 eck$LassoCheckResult]: Stem: 128#ULTIMATE.startENTRY [102] 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] 123#L-1 [186] L-1-->L11: Formula: (let ((.cse1 (store |v_#valid_7| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 1))) (let ((.cse2 (store .cse1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 1))) (let ((.cse0 (store .cse2 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1| 1))) (and (< |v_ULTIMATE.start_test_fun_#t~malloc2.base_1| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_test_fun_#t~malloc3.offset_1| 0) (= v_ULTIMATE.start_test_fun_~c~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc3.offset_1|) (= |v_ULTIMATE.start_test_fun_#t~malloc0.offset_1| 0) (= |v_ULTIMATE.start_test_fun_#t~malloc1.offset_1| 0) (> |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 0) (> |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 0) (= v_ULTIMATE.start_test_fun_~y_ref~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc1.offset_1|) (< |v_ULTIMATE.start_test_fun_#t~malloc3.base_1| |v_#StackHeapBarrier_1|) (> |v_ULTIMATE.start_test_fun_#t~malloc3.base_1| 0) (= v_ULTIMATE.start_test_fun_~x_ref~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc0.offset_1|) (= v_ULTIMATE.start_test_fun_~y_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|) (= v_ULTIMATE.start_test_fun_~c~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc3.base_1|) (= (store (store (store (store |v_#length_5| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 4) |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 4) |v_ULTIMATE.start_test_fun_#t~malloc2.base_1| 4) |v_ULTIMATE.start_test_fun_#t~malloc3.base_1| 4) |v_#length_1|) (= |v_#valid_3| (store .cse0 |v_ULTIMATE.start_test_fun_#t~malloc3.base_1| 1)) (= 0 (select .cse0 |v_ULTIMATE.start_test_fun_#t~malloc3.base_1|)) (= v_ULTIMATE.start_test_fun_~x_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc0.base_1|) (= 0 (select .cse1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|)) (= |v_ULTIMATE.start_test_fun_#in~x_1| |v_ULTIMATE.start_main_#t~nondet13_1|) (= v_ULTIMATE.start_test_fun_~y_1 |v_ULTIMATE.start_test_fun_#in~y_1|) (= |v_ULTIMATE.start_test_fun_#in~y_1| |v_ULTIMATE.start_main_#t~nondet14_1|) (< |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (= (select |v_#valid_7| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1|) 0) (= 0 (select .cse2 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|)) (= v_ULTIMATE.start_test_fun_~z_1 |v_ULTIMATE.start_test_fun_#in~z_1|) (> 0 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|) (= v_ULTIMATE.start_test_fun_~x_1 |v_ULTIMATE.start_test_fun_#in~x_1|) (= v_ULTIMATE.start_test_fun_~z_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|) (= |v_ULTIMATE.start_test_fun_#t~malloc2.offset_1| 0) (= |v_ULTIMATE.start_test_fun_#in~z_1| |v_ULTIMATE.start_main_#t~nondet15_1|) (< |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_test_fun_~z_ref~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc2.offset_1|))))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_5|, #valid=|v_#valid_7|} OutVars{ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_1, ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_1, ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_1|, ULTIMATE.start_test_fun_#t~mem11=|v_ULTIMATE.start_test_fun_#t~mem11_1|, ULTIMATE.start_test_fun_#t~mem12=|v_ULTIMATE.start_test_fun_#t~mem12_1|, ULTIMATE.start_main_#t~nondet13=|v_ULTIMATE.start_main_#t~nondet13_1|, ULTIMATE.start_main_#t~nondet14=|v_ULTIMATE.start_main_#t~nondet14_1|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_1, ULTIMATE.start_test_fun_#t~malloc1.offset=|v_ULTIMATE.start_test_fun_#t~malloc1.offset_1|, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_1|, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_1|, ULTIMATE.start_test_fun_~z=v_ULTIMATE.start_test_fun_~z_1, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_1|, ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_1|, ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_1|, ULTIMATE.start_test_fun_#res=|v_ULTIMATE.start_test_fun_#res_1|, #length=|v_#length_1|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_1, ULTIMATE.start_test_fun_#t~malloc3.offset=|v_ULTIMATE.start_test_fun_#t~malloc3.offset_1|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_1, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_1, ULTIMATE.start_test_fun_~z_ref~0.base=v_ULTIMATE.start_test_fun_~z_ref~0.base_1, ULTIMATE.start_test_fun_#t~malloc0.offset=|v_ULTIMATE.start_test_fun_#t~malloc0.offset_1|, ULTIMATE.start_test_fun_#t~short8=|v_ULTIMATE.start_test_fun_#t~short8_1|, ULTIMATE.start_test_fun_#in~z=|v_ULTIMATE.start_test_fun_#in~z_1|, ULTIMATE.start_test_fun_#in~y=|v_ULTIMATE.start_test_fun_#in~y_1|, ULTIMATE.start_test_fun_#in~x=|v_ULTIMATE.start_test_fun_#in~x_1|, ULTIMATE.start_test_fun_~z_ref~0.offset=v_ULTIMATE.start_test_fun_~z_ref~0.offset_1, ULTIMATE.start_main_#t~ret16=|v_ULTIMATE.start_main_#t~ret16_1|, ULTIMATE.start_test_fun_#t~malloc1.base=|v_ULTIMATE.start_test_fun_#t~malloc1.base_1|, ULTIMATE.start_test_fun_#t~malloc2.base=|v_ULTIMATE.start_test_fun_#t~malloc2.base_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_test_fun_#t~malloc2.offset=|v_ULTIMATE.start_test_fun_#t~malloc2.offset_1|, ULTIMATE.start_test_fun_#t~malloc3.base=|v_ULTIMATE.start_test_fun_#t~malloc3.base_1|, ULTIMATE.start_test_fun_#t~malloc0.base=|v_ULTIMATE.start_test_fun_#t~malloc0.base_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_1|, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_1, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_1} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_~y, ULTIMATE.start_test_fun_~x, ULTIMATE.start_test_fun_#t~mem10, ULTIMATE.start_test_fun_#t~mem11, ULTIMATE.start_test_fun_#t~mem12, ULTIMATE.start_main_#t~nondet13, ULTIMATE.start_main_#t~nondet14, ULTIMATE.start_test_fun_~x_ref~0.offset, ULTIMATE.start_test_fun_#t~malloc1.offset, ULTIMATE.start_test_fun_#t~mem9, ULTIMATE.start_test_fun_#t~mem6, ULTIMATE.start_test_fun_~z, ULTIMATE.start_test_fun_#t~mem7, ULTIMATE.start_test_fun_#t~mem4, ULTIMATE.start_test_fun_#t~mem5, ULTIMATE.start_test_fun_#res, #length, ULTIMATE.start_test_fun_~y_ref~0.base, ULTIMATE.start_test_fun_#t~malloc3.offset, ULTIMATE.start_test_fun_~x_ref~0.base, ULTIMATE.start_test_fun_~c~0.offset, ULTIMATE.start_test_fun_~z_ref~0.base, ULTIMATE.start_test_fun_#t~malloc0.offset, ULTIMATE.start_test_fun_#t~short8, ULTIMATE.start_test_fun_#in~z, ULTIMATE.start_test_fun_#in~y, ULTIMATE.start_test_fun_#in~x, ULTIMATE.start_test_fun_~z_ref~0.offset, ULTIMATE.start_main_#t~ret16, ULTIMATE.start_test_fun_#t~malloc1.base, ULTIMATE.start_test_fun_#t~malloc2.base, ULTIMATE.start_test_fun_#t~malloc2.offset, ULTIMATE.start_test_fun_#t~malloc3.base, ULTIMATE.start_test_fun_#t~malloc0.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_#t~nondet15, ULTIMATE.start_test_fun_~y_ref~0.offset, ULTIMATE.start_test_fun_~c~0.base] 124#L11 [103] L11-->L11-1: Formula: (and (= (select |v_#valid_8| v_ULTIMATE.start_test_fun_~x_ref~0.base_3) 1) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_3 4) (select |v_#length_6| v_ULTIMATE.start_test_fun_~x_ref~0.base_3)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_3) (= (store |v_#memory_int_2| v_ULTIMATE.start_test_fun_~x_ref~0.base_3 (store (select |v_#memory_int_2| v_ULTIMATE.start_test_fun_~x_ref~0.base_3) v_ULTIMATE.start_test_fun_~x_ref~0.offset_3 v_ULTIMATE.start_test_fun_~x_3)) |v_#memory_int_1|)) InVars {ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_3, #valid=|v_#valid_8|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_3, #length=|v_#length_6|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_3} OutVars{ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_3, #valid=|v_#valid_8|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_3, #length=|v_#length_6|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_3} AuxVars[] AssignedVars[#memory_int] 126#L11-1 [98] L11-1-->L12: Formula: (and (= |v_#memory_int_3| (store |v_#memory_int_4| v_ULTIMATE.start_test_fun_~y_ref~0.base_3 (store (select |v_#memory_int_4| v_ULTIMATE.start_test_fun_~y_ref~0.base_3) v_ULTIMATE.start_test_fun_~y_ref~0.offset_3 v_ULTIMATE.start_test_fun_~y_3))) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_3 4) (select |v_#length_8| v_ULTIMATE.start_test_fun_~y_ref~0.base_3)) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_3) (= 1 (select |v_#valid_10| v_ULTIMATE.start_test_fun_~y_ref~0.base_3))) InVars {ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_3, #valid=|v_#valid_10|, #memory_int=|v_#memory_int_4|, #length=|v_#length_8|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_3, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_3} OutVars{ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_3, #valid=|v_#valid_10|, #memory_int=|v_#memory_int_3|, #length=|v_#length_8|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_3, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_3} AuxVars[] AssignedVars[#memory_int] 127#L12 [123] L12-->L13: Formula: (and (= 1 (select |v_#valid_12| v_ULTIMATE.start_test_fun_~z_ref~0.base_3)) (= (store |v_#memory_int_6| v_ULTIMATE.start_test_fun_~z_ref~0.base_3 (store (select |v_#memory_int_6| v_ULTIMATE.start_test_fun_~z_ref~0.base_3) v_ULTIMATE.start_test_fun_~z_ref~0.offset_3 v_ULTIMATE.start_test_fun_~z_3)) |v_#memory_int_5|) (<= (+ v_ULTIMATE.start_test_fun_~z_ref~0.offset_3 4) (select |v_#length_10| v_ULTIMATE.start_test_fun_~z_ref~0.base_3)) (<= 0 v_ULTIMATE.start_test_fun_~z_ref~0.offset_3)) InVars {ULTIMATE.start_test_fun_~z_ref~0.base=v_ULTIMATE.start_test_fun_~z_ref~0.base_3, #valid=|v_#valid_12|, #memory_int=|v_#memory_int_6|, #length=|v_#length_10|, ULTIMATE.start_test_fun_~z=v_ULTIMATE.start_test_fun_~z_3, ULTIMATE.start_test_fun_~z_ref~0.offset=v_ULTIMATE.start_test_fun_~z_ref~0.offset_3} OutVars{ULTIMATE.start_test_fun_~z_ref~0.base=v_ULTIMATE.start_test_fun_~z_ref~0.base_3, #valid=|v_#valid_12|, #memory_int=|v_#memory_int_5|, #length=|v_#length_10|, ULTIMATE.start_test_fun_~z=v_ULTIMATE.start_test_fun_~z_3, ULTIMATE.start_test_fun_~z_ref~0.offset=v_ULTIMATE.start_test_fun_~z_ref~0.offset_3} AuxVars[] AssignedVars[#memory_int] 130#L13 [134] L13-->L15-9: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_3) (= (store |v_#memory_int_8| v_ULTIMATE.start_test_fun_~c~0.base_3 (store (select |v_#memory_int_8| v_ULTIMATE.start_test_fun_~c~0.base_3) v_ULTIMATE.start_test_fun_~c~0.offset_3 0)) |v_#memory_int_7|) (= 1 (select |v_#valid_14| v_ULTIMATE.start_test_fun_~c~0.base_3)) (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_3 4) (select |v_#length_12| v_ULTIMATE.start_test_fun_~c~0.base_3))) InVars {#memory_int=|v_#memory_int_8|, #length=|v_#length_12|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_3, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_3, #valid=|v_#valid_14|} OutVars{#memory_int=|v_#memory_int_7|, #length=|v_#length_12|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_3, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_3, #valid=|v_#valid_14|} AuxVars[] AssignedVars[#memory_int] 120#L15-9 159.91/136.29 [2019-03-28 12:42:37,989 INFO L796 eck$LassoCheckResult]: Loop: 120#L15-9 [82] L15-9-->L15: Formula: (and (= |v_ULTIMATE.start_test_fun_#t~mem4_2| (select (select |v_#memory_int_9| v_ULTIMATE.start_test_fun_~x_ref~0.base_6) v_ULTIMATE.start_test_fun_~x_ref~0.offset_5)) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_5 4) (select |v_#length_14| v_ULTIMATE.start_test_fun_~x_ref~0.base_6)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_5) (= 1 (select |v_#valid_16| v_ULTIMATE.start_test_fun_~x_ref~0.base_6))) InVars {#memory_int=|v_#memory_int_9|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_5, #length=|v_#length_14|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_6, #valid=|v_#valid_16|} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_2|, #valid=|v_#valid_16|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_5, #length=|v_#length_14|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem4] 115#L15 [95] L15-->L15-1: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~z_ref~0.offset_5 4) (select |v_#length_16| v_ULTIMATE.start_test_fun_~z_ref~0.base_6)) (= (select |v_#valid_18| v_ULTIMATE.start_test_fun_~z_ref~0.base_6) 1) (= |v_ULTIMATE.start_test_fun_#t~mem5_2| (select (select |v_#memory_int_10| v_ULTIMATE.start_test_fun_~z_ref~0.base_6) v_ULTIMATE.start_test_fun_~z_ref~0.offset_5)) (<= 0 v_ULTIMATE.start_test_fun_~z_ref~0.offset_5)) InVars {#memory_int=|v_#memory_int_10|, #length=|v_#length_16|, ULTIMATE.start_test_fun_~z_ref~0.base=v_ULTIMATE.start_test_fun_~z_ref~0.base_6, #valid=|v_#valid_18|, ULTIMATE.start_test_fun_~z_ref~0.offset=v_ULTIMATE.start_test_fun_~z_ref~0.offset_5} OutVars{ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_2|, ULTIMATE.start_test_fun_~z_ref~0.base=v_ULTIMATE.start_test_fun_~z_ref~0.base_6, #valid=|v_#valid_18|, #memory_int=|v_#memory_int_10|, #length=|v_#length_16|, ULTIMATE.start_test_fun_~z_ref~0.offset=v_ULTIMATE.start_test_fun_~z_ref~0.offset_5} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem5] 116#L15-1 [216] L15-1-->L15-2: Formula: (and (>= |v_ULTIMATE.start_test_fun_#t~mem5_3| |v_ULTIMATE.start_test_fun_#t~mem4_3|) (not |v_ULTIMATE.start_test_fun_#t~short8_2|)) InVars {ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_3|, ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_3|} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_3|, ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_3|, ULTIMATE.start_test_fun_#t~short8=|v_ULTIMATE.start_test_fun_#t~short8_2|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~short8] 133#L15-2 [113] L15-2-->L15-7: Formula: (not |v_ULTIMATE.start_test_fun_#t~short8_5|) InVars {ULTIMATE.start_test_fun_#t~short8=|v_ULTIMATE.start_test_fun_#t~short8_5|} OutVars{ULTIMATE.start_test_fun_#t~short8=|v_ULTIMATE.start_test_fun_#t~short8_5|} AuxVars[] AssignedVars[] 122#L15-7 [92] L15-7-->L16: Formula: |v_ULTIMATE.start_test_fun_#t~short8_9| InVars {ULTIMATE.start_test_fun_#t~short8=|v_ULTIMATE.start_test_fun_#t~short8_9|} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_5|, ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_5|, ULTIMATE.start_test_fun_#t~short8=|v_ULTIMATE.start_test_fun_#t~short8_8|, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_5|, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_5|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem4, ULTIMATE.start_test_fun_#t~mem5, ULTIMATE.start_test_fun_#t~short8, ULTIMATE.start_test_fun_#t~mem6, ULTIMATE.start_test_fun_#t~mem7] 119#L16 [118] L16-->L16-1: Formula: (and (= (select |v_#valid_24| v_ULTIMATE.start_test_fun_~x_ref~0.base_9) 1) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_7) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_7 4) (select |v_#length_22| v_ULTIMATE.start_test_fun_~x_ref~0.base_9)) (= |v_ULTIMATE.start_test_fun_#t~mem9_2| (select (select |v_#memory_int_13| v_ULTIMATE.start_test_fun_~x_ref~0.base_9) v_ULTIMATE.start_test_fun_~x_ref~0.offset_7))) InVars {#memory_int=|v_#memory_int_13|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_7, #length=|v_#length_22|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_9, #valid=|v_#valid_24|} OutVars{#valid=|v_#valid_24|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_7, #length=|v_#length_22|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_9, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_2|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem9] 113#L16-1 [253] L16-1-->L17: Formula: (and (= (select |v_#valid_47| v_ULTIMATE.start_test_fun_~x_ref~0.base_15) 1) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_11 4) (select |v_#length_38| v_ULTIMATE.start_test_fun_~x_ref~0.base_15)) (= (store |v_#memory_int_26| v_ULTIMATE.start_test_fun_~x_ref~0.base_15 (store (select |v_#memory_int_26| v_ULTIMATE.start_test_fun_~x_ref~0.base_15) v_ULTIMATE.start_test_fun_~x_ref~0.offset_11 (+ |v_ULTIMATE.start_test_fun_#t~mem9_6| (- 1)))) |v_#memory_int_25|) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_11)) InVars {#valid=|v_#valid_47|, #memory_int=|v_#memory_int_26|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_11, #length=|v_#length_38|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_15, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_6|} OutVars{#valid=|v_#valid_47|, #memory_int=|v_#memory_int_25|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_11, #length=|v_#length_38|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_15, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_5|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_test_fun_#t~mem9] 114#L17 [131] L17-->L17-1: Formula: (and (= (select (select |v_#memory_int_16| v_ULTIMATE.start_test_fun_~y_ref~0.base_9) v_ULTIMATE.start_test_fun_~y_ref~0.offset_7) |v_ULTIMATE.start_test_fun_#t~mem10_2|) (= (select |v_#valid_28| v_ULTIMATE.start_test_fun_~y_ref~0.base_9) 1) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_7) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_7 4) (select |v_#length_26| v_ULTIMATE.start_test_fun_~y_ref~0.base_9))) InVars {#memory_int=|v_#memory_int_16|, #length=|v_#length_26|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_9, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_7, #valid=|v_#valid_28|} OutVars{ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_2|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_16|, #length=|v_#length_26|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_9, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_7} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem10] 117#L17-1 [256] L17-1-->L18: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_11) (= (store |v_#memory_int_30| v_ULTIMATE.start_test_fun_~y_ref~0.base_15 (store (select |v_#memory_int_30| v_ULTIMATE.start_test_fun_~y_ref~0.base_15) v_ULTIMATE.start_test_fun_~y_ref~0.offset_11 (+ |v_ULTIMATE.start_test_fun_#t~mem10_6| (- 1)))) |v_#memory_int_29|) (= 1 (select |v_#valid_52| v_ULTIMATE.start_test_fun_~y_ref~0.base_15)) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_11 4) (select |v_#length_41| v_ULTIMATE.start_test_fun_~y_ref~0.base_15))) InVars {ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_6|, #valid=|v_#valid_52|, #memory_int=|v_#memory_int_30|, #length=|v_#length_41|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_15, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_11} OutVars{ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_5|, #valid=|v_#valid_52|, #memory_int=|v_#memory_int_29|, #length=|v_#length_41|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_15, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_11} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem10, #memory_int] 118#L18 [88] L18-->L18-1: Formula: (and (= (select |v_#valid_32| v_ULTIMATE.start_test_fun_~c~0.base_6) 1) (= |v_ULTIMATE.start_test_fun_#t~mem11_2| (select (select |v_#memory_int_19| v_ULTIMATE.start_test_fun_~c~0.base_6) v_ULTIMATE.start_test_fun_~c~0.offset_5)) (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_5) (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_5 4) (select |v_#length_30| v_ULTIMATE.start_test_fun_~c~0.base_6))) InVars {#memory_int=|v_#memory_int_19|, #length=|v_#length_30|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_5, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_6, #valid=|v_#valid_32|} OutVars{ULTIMATE.start_test_fun_#t~mem11=|v_ULTIMATE.start_test_fun_#t~mem11_2|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_5, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_19|, #length=|v_#length_30|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem11] 121#L18-1 [257] L18-1-->L15-9: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_15 4) (select |v_#length_42| v_ULTIMATE.start_test_fun_~c~0.base_19)) (= (store |v_#memory_int_32| v_ULTIMATE.start_test_fun_~c~0.base_19 (store (select |v_#memory_int_32| v_ULTIMATE.start_test_fun_~c~0.base_19) v_ULTIMATE.start_test_fun_~c~0.offset_15 (+ |v_ULTIMATE.start_test_fun_#t~mem11_6| 1))) |v_#memory_int_31|) (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_15) (= (select |v_#valid_53| v_ULTIMATE.start_test_fun_~c~0.base_19) 1)) InVars {ULTIMATE.start_test_fun_#t~mem11=|v_ULTIMATE.start_test_fun_#t~mem11_6|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_15, #valid=|v_#valid_53|, #memory_int=|v_#memory_int_32|, #length=|v_#length_42|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_19} OutVars{ULTIMATE.start_test_fun_#t~mem11=|v_ULTIMATE.start_test_fun_#t~mem11_5|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_15, #valid=|v_#valid_53|, #memory_int=|v_#memory_int_31|, #length=|v_#length_42|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_19} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem11, #memory_int] 120#L15-9 159.91/136.29 [2019-03-28 12:42:37,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 159.91/136.29 [2019-03-28 12:42:37,990 INFO L82 PathProgramCache]: Analyzing trace with hash -312348709, now seen corresponding path program 2 times 159.91/136.29 [2019-03-28 12:42:37,990 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 159.91/136.29 [2019-03-28 12:42:37,990 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 159.91/136.29 [2019-03-28 12:42:37,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 159.91/136.29 [2019-03-28 12:42:37,991 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 159.91/136.29 [2019-03-28 12:42:37,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 159.91/136.29 [2019-03-28 12:42:38,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 159.91/136.29 [2019-03-28 12:42:38,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 159.91/136.29 [2019-03-28 12:42:38,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 159.91/136.29 [2019-03-28 12:42:38,025 INFO L82 PathProgramCache]: Analyzing trace with hash 781980002, now seen corresponding path program 1 times 159.91/136.29 [2019-03-28 12:42:38,025 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 159.91/136.29 [2019-03-28 12:42:38,026 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 159.91/136.29 [2019-03-28 12:42:38,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 159.91/136.29 [2019-03-28 12:42:38,027 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 159.91/136.29 [2019-03-28 12:42:38,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 159.91/136.29 [2019-03-28 12:42:38,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 159.91/136.29 [2019-03-28 12:42:38,045 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 159.91/136.29 [2019-03-28 12:42:38,045 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 159.91/136.29 [2019-03-28 12:42:38,045 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 159.91/136.29 [2019-03-28 12:42:38,046 INFO L811 eck$LassoCheckResult]: loop already infeasible 159.91/136.29 [2019-03-28 12:42:38,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 159.91/136.29 [2019-03-28 12:42:38,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 159.91/136.29 [2019-03-28 12:42:38,046 INFO L87 Difference]: Start difference. First operand 21 states and 39 transitions. cyclomatic complexity: 19 Second operand 3 states. 159.91/136.29 [2019-03-28 12:42:38,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 159.91/136.29 [2019-03-28 12:42:38,114 INFO L93 Difference]: Finished difference Result 22 states and 38 transitions. 159.91/136.29 [2019-03-28 12:42:38,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 159.91/136.29 [2019-03-28 12:42:38,114 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 38 transitions. 159.91/136.29 [2019-03-28 12:42:38,115 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 159.91/136.29 [2019-03-28 12:42:38,116 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 20 states and 35 transitions. 159.91/136.29 [2019-03-28 12:42:38,116 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 159.91/136.29 [2019-03-28 12:42:38,116 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 159.91/136.29 [2019-03-28 12:42:38,116 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 35 transitions. 159.91/136.29 [2019-03-28 12:42:38,116 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 159.91/136.29 [2019-03-28 12:42:38,117 INFO L706 BuchiCegarLoop]: Abstraction has 20 states and 35 transitions. 159.91/136.29 [2019-03-28 12:42:38,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 35 transitions. 159.91/136.29 [2019-03-28 12:42:38,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. 159.91/136.29 [2019-03-28 12:42:38,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. 159.91/136.29 [2019-03-28 12:42:38,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 35 transitions. 159.91/136.29 [2019-03-28 12:42:38,118 INFO L729 BuchiCegarLoop]: Abstraction has 20 states and 35 transitions. 159.91/136.29 [2019-03-28 12:42:38,118 INFO L609 BuchiCegarLoop]: Abstraction has 20 states and 35 transitions. 159.91/136.29 [2019-03-28 12:42:38,119 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ 159.91/136.29 [2019-03-28 12:42:38,119 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 35 transitions. 159.91/136.29 [2019-03-28 12:42:38,119 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 159.91/136.29 [2019-03-28 12:42:38,119 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 159.91/136.29 [2019-03-28 12:42:38,119 INFO L119 BuchiIsEmpty]: Starting construction of run 159.91/136.29 [2019-03-28 12:42:38,120 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] 159.91/136.29 [2019-03-28 12:42:38,120 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 159.91/136.29 [2019-03-28 12:42:38,121 INFO L794 eck$LassoCheckResult]: Stem: 177#ULTIMATE.startENTRY [102] 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] 172#L-1 [186] L-1-->L11: Formula: (let ((.cse1 (store |v_#valid_7| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 1))) (let ((.cse2 (store .cse1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 1))) (let ((.cse0 (store .cse2 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1| 1))) (and (< |v_ULTIMATE.start_test_fun_#t~malloc2.base_1| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_test_fun_#t~malloc3.offset_1| 0) (= v_ULTIMATE.start_test_fun_~c~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc3.offset_1|) (= |v_ULTIMATE.start_test_fun_#t~malloc0.offset_1| 0) (= |v_ULTIMATE.start_test_fun_#t~malloc1.offset_1| 0) (> |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 0) (> |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 0) (= v_ULTIMATE.start_test_fun_~y_ref~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc1.offset_1|) (< |v_ULTIMATE.start_test_fun_#t~malloc3.base_1| |v_#StackHeapBarrier_1|) (> |v_ULTIMATE.start_test_fun_#t~malloc3.base_1| 0) (= v_ULTIMATE.start_test_fun_~x_ref~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc0.offset_1|) (= v_ULTIMATE.start_test_fun_~y_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|) (= v_ULTIMATE.start_test_fun_~c~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc3.base_1|) (= (store (store (store (store |v_#length_5| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 4) |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 4) |v_ULTIMATE.start_test_fun_#t~malloc2.base_1| 4) |v_ULTIMATE.start_test_fun_#t~malloc3.base_1| 4) |v_#length_1|) (= |v_#valid_3| (store .cse0 |v_ULTIMATE.start_test_fun_#t~malloc3.base_1| 1)) (= 0 (select .cse0 |v_ULTIMATE.start_test_fun_#t~malloc3.base_1|)) (= v_ULTIMATE.start_test_fun_~x_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc0.base_1|) (= 0 (select .cse1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|)) (= |v_ULTIMATE.start_test_fun_#in~x_1| |v_ULTIMATE.start_main_#t~nondet13_1|) (= v_ULTIMATE.start_test_fun_~y_1 |v_ULTIMATE.start_test_fun_#in~y_1|) (= |v_ULTIMATE.start_test_fun_#in~y_1| |v_ULTIMATE.start_main_#t~nondet14_1|) (< |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (= (select |v_#valid_7| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1|) 0) (= 0 (select .cse2 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|)) (= v_ULTIMATE.start_test_fun_~z_1 |v_ULTIMATE.start_test_fun_#in~z_1|) (> 0 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|) (= v_ULTIMATE.start_test_fun_~x_1 |v_ULTIMATE.start_test_fun_#in~x_1|) (= v_ULTIMATE.start_test_fun_~z_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|) (= |v_ULTIMATE.start_test_fun_#t~malloc2.offset_1| 0) (= |v_ULTIMATE.start_test_fun_#in~z_1| |v_ULTIMATE.start_main_#t~nondet15_1|) (< |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_test_fun_~z_ref~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc2.offset_1|))))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_5|, #valid=|v_#valid_7|} OutVars{ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_1, ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_1, ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_1|, ULTIMATE.start_test_fun_#t~mem11=|v_ULTIMATE.start_test_fun_#t~mem11_1|, ULTIMATE.start_test_fun_#t~mem12=|v_ULTIMATE.start_test_fun_#t~mem12_1|, ULTIMATE.start_main_#t~nondet13=|v_ULTIMATE.start_main_#t~nondet13_1|, ULTIMATE.start_main_#t~nondet14=|v_ULTIMATE.start_main_#t~nondet14_1|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_1, ULTIMATE.start_test_fun_#t~malloc1.offset=|v_ULTIMATE.start_test_fun_#t~malloc1.offset_1|, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_1|, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_1|, ULTIMATE.start_test_fun_~z=v_ULTIMATE.start_test_fun_~z_1, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_1|, ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_1|, ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_1|, ULTIMATE.start_test_fun_#res=|v_ULTIMATE.start_test_fun_#res_1|, #length=|v_#length_1|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_1, ULTIMATE.start_test_fun_#t~malloc3.offset=|v_ULTIMATE.start_test_fun_#t~malloc3.offset_1|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_1, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_1, ULTIMATE.start_test_fun_~z_ref~0.base=v_ULTIMATE.start_test_fun_~z_ref~0.base_1, ULTIMATE.start_test_fun_#t~malloc0.offset=|v_ULTIMATE.start_test_fun_#t~malloc0.offset_1|, ULTIMATE.start_test_fun_#t~short8=|v_ULTIMATE.start_test_fun_#t~short8_1|, ULTIMATE.start_test_fun_#in~z=|v_ULTIMATE.start_test_fun_#in~z_1|, ULTIMATE.start_test_fun_#in~y=|v_ULTIMATE.start_test_fun_#in~y_1|, ULTIMATE.start_test_fun_#in~x=|v_ULTIMATE.start_test_fun_#in~x_1|, ULTIMATE.start_test_fun_~z_ref~0.offset=v_ULTIMATE.start_test_fun_~z_ref~0.offset_1, ULTIMATE.start_main_#t~ret16=|v_ULTIMATE.start_main_#t~ret16_1|, ULTIMATE.start_test_fun_#t~malloc1.base=|v_ULTIMATE.start_test_fun_#t~malloc1.base_1|, ULTIMATE.start_test_fun_#t~malloc2.base=|v_ULTIMATE.start_test_fun_#t~malloc2.base_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_test_fun_#t~malloc2.offset=|v_ULTIMATE.start_test_fun_#t~malloc2.offset_1|, ULTIMATE.start_test_fun_#t~malloc3.base=|v_ULTIMATE.start_test_fun_#t~malloc3.base_1|, ULTIMATE.start_test_fun_#t~malloc0.base=|v_ULTIMATE.start_test_fun_#t~malloc0.base_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_1|, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_1, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_1} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_~y, ULTIMATE.start_test_fun_~x, ULTIMATE.start_test_fun_#t~mem10, ULTIMATE.start_test_fun_#t~mem11, ULTIMATE.start_test_fun_#t~mem12, ULTIMATE.start_main_#t~nondet13, ULTIMATE.start_main_#t~nondet14, ULTIMATE.start_test_fun_~x_ref~0.offset, ULTIMATE.start_test_fun_#t~malloc1.offset, ULTIMATE.start_test_fun_#t~mem9, ULTIMATE.start_test_fun_#t~mem6, ULTIMATE.start_test_fun_~z, ULTIMATE.start_test_fun_#t~mem7, ULTIMATE.start_test_fun_#t~mem4, ULTIMATE.start_test_fun_#t~mem5, ULTIMATE.start_test_fun_#res, #length, ULTIMATE.start_test_fun_~y_ref~0.base, ULTIMATE.start_test_fun_#t~malloc3.offset, ULTIMATE.start_test_fun_~x_ref~0.base, ULTIMATE.start_test_fun_~c~0.offset, ULTIMATE.start_test_fun_~z_ref~0.base, ULTIMATE.start_test_fun_#t~malloc0.offset, ULTIMATE.start_test_fun_#t~short8, ULTIMATE.start_test_fun_#in~z, ULTIMATE.start_test_fun_#in~y, ULTIMATE.start_test_fun_#in~x, ULTIMATE.start_test_fun_~z_ref~0.offset, ULTIMATE.start_main_#t~ret16, ULTIMATE.start_test_fun_#t~malloc1.base, ULTIMATE.start_test_fun_#t~malloc2.base, ULTIMATE.start_test_fun_#t~malloc2.offset, ULTIMATE.start_test_fun_#t~malloc3.base, ULTIMATE.start_test_fun_#t~malloc0.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_#t~nondet15, ULTIMATE.start_test_fun_~y_ref~0.offset, ULTIMATE.start_test_fun_~c~0.base] 173#L11 [103] L11-->L11-1: Formula: (and (= (select |v_#valid_8| v_ULTIMATE.start_test_fun_~x_ref~0.base_3) 1) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_3 4) (select |v_#length_6| v_ULTIMATE.start_test_fun_~x_ref~0.base_3)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_3) (= (store |v_#memory_int_2| v_ULTIMATE.start_test_fun_~x_ref~0.base_3 (store (select |v_#memory_int_2| v_ULTIMATE.start_test_fun_~x_ref~0.base_3) v_ULTIMATE.start_test_fun_~x_ref~0.offset_3 v_ULTIMATE.start_test_fun_~x_3)) |v_#memory_int_1|)) InVars {ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_3, #valid=|v_#valid_8|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_3, #length=|v_#length_6|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_3} OutVars{ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_3, #valid=|v_#valid_8|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_3, #length=|v_#length_6|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_3} AuxVars[] AssignedVars[#memory_int] 174#L11-1 [98] L11-1-->L12: Formula: (and (= |v_#memory_int_3| (store |v_#memory_int_4| v_ULTIMATE.start_test_fun_~y_ref~0.base_3 (store (select |v_#memory_int_4| v_ULTIMATE.start_test_fun_~y_ref~0.base_3) v_ULTIMATE.start_test_fun_~y_ref~0.offset_3 v_ULTIMATE.start_test_fun_~y_3))) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_3 4) (select |v_#length_8| v_ULTIMATE.start_test_fun_~y_ref~0.base_3)) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_3) (= 1 (select |v_#valid_10| v_ULTIMATE.start_test_fun_~y_ref~0.base_3))) InVars {ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_3, #valid=|v_#valid_10|, #memory_int=|v_#memory_int_4|, #length=|v_#length_8|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_3, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_3} OutVars{ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_3, #valid=|v_#valid_10|, #memory_int=|v_#memory_int_3|, #length=|v_#length_8|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_3, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_3} AuxVars[] AssignedVars[#memory_int] 175#L12 [123] L12-->L13: Formula: (and (= 1 (select |v_#valid_12| v_ULTIMATE.start_test_fun_~z_ref~0.base_3)) (= (store |v_#memory_int_6| v_ULTIMATE.start_test_fun_~z_ref~0.base_3 (store (select |v_#memory_int_6| v_ULTIMATE.start_test_fun_~z_ref~0.base_3) v_ULTIMATE.start_test_fun_~z_ref~0.offset_3 v_ULTIMATE.start_test_fun_~z_3)) |v_#memory_int_5|) (<= (+ v_ULTIMATE.start_test_fun_~z_ref~0.offset_3 4) (select |v_#length_10| v_ULTIMATE.start_test_fun_~z_ref~0.base_3)) (<= 0 v_ULTIMATE.start_test_fun_~z_ref~0.offset_3)) InVars {ULTIMATE.start_test_fun_~z_ref~0.base=v_ULTIMATE.start_test_fun_~z_ref~0.base_3, #valid=|v_#valid_12|, #memory_int=|v_#memory_int_6|, #length=|v_#length_10|, ULTIMATE.start_test_fun_~z=v_ULTIMATE.start_test_fun_~z_3, ULTIMATE.start_test_fun_~z_ref~0.offset=v_ULTIMATE.start_test_fun_~z_ref~0.offset_3} OutVars{ULTIMATE.start_test_fun_~z_ref~0.base=v_ULTIMATE.start_test_fun_~z_ref~0.base_3, #valid=|v_#valid_12|, #memory_int=|v_#memory_int_5|, #length=|v_#length_10|, ULTIMATE.start_test_fun_~z=v_ULTIMATE.start_test_fun_~z_3, ULTIMATE.start_test_fun_~z_ref~0.offset=v_ULTIMATE.start_test_fun_~z_ref~0.offset_3} AuxVars[] AssignedVars[#memory_int] 179#L13 [134] L13-->L15-9: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_3) (= (store |v_#memory_int_8| v_ULTIMATE.start_test_fun_~c~0.base_3 (store (select |v_#memory_int_8| v_ULTIMATE.start_test_fun_~c~0.base_3) v_ULTIMATE.start_test_fun_~c~0.offset_3 0)) |v_#memory_int_7|) (= 1 (select |v_#valid_14| v_ULTIMATE.start_test_fun_~c~0.base_3)) (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_3 4) (select |v_#length_12| v_ULTIMATE.start_test_fun_~c~0.base_3))) InVars {#memory_int=|v_#memory_int_8|, #length=|v_#length_12|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_3, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_3, #valid=|v_#valid_14|} OutVars{#memory_int=|v_#memory_int_7|, #length=|v_#length_12|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_3, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_3, #valid=|v_#valid_14|} AuxVars[] AssignedVars[#memory_int] 169#L15-9 159.91/136.29 [2019-03-28 12:42:38,122 INFO L796 eck$LassoCheckResult]: Loop: 169#L15-9 [82] L15-9-->L15: Formula: (and (= |v_ULTIMATE.start_test_fun_#t~mem4_2| (select (select |v_#memory_int_9| v_ULTIMATE.start_test_fun_~x_ref~0.base_6) v_ULTIMATE.start_test_fun_~x_ref~0.offset_5)) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_5 4) (select |v_#length_14| v_ULTIMATE.start_test_fun_~x_ref~0.base_6)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_5) (= 1 (select |v_#valid_16| v_ULTIMATE.start_test_fun_~x_ref~0.base_6))) InVars {#memory_int=|v_#memory_int_9|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_5, #length=|v_#length_14|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_6, #valid=|v_#valid_16|} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_2|, #valid=|v_#valid_16|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_5, #length=|v_#length_14|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem4] 162#L15 [95] L15-->L15-1: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~z_ref~0.offset_5 4) (select |v_#length_16| v_ULTIMATE.start_test_fun_~z_ref~0.base_6)) (= (select |v_#valid_18| v_ULTIMATE.start_test_fun_~z_ref~0.base_6) 1) (= |v_ULTIMATE.start_test_fun_#t~mem5_2| (select (select |v_#memory_int_10| v_ULTIMATE.start_test_fun_~z_ref~0.base_6) v_ULTIMATE.start_test_fun_~z_ref~0.offset_5)) (<= 0 v_ULTIMATE.start_test_fun_~z_ref~0.offset_5)) InVars {#memory_int=|v_#memory_int_10|, #length=|v_#length_16|, ULTIMATE.start_test_fun_~z_ref~0.base=v_ULTIMATE.start_test_fun_~z_ref~0.base_6, #valid=|v_#valid_18|, ULTIMATE.start_test_fun_~z_ref~0.offset=v_ULTIMATE.start_test_fun_~z_ref~0.offset_5} OutVars{ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_2|, ULTIMATE.start_test_fun_~z_ref~0.base=v_ULTIMATE.start_test_fun_~z_ref~0.base_6, #valid=|v_#valid_18|, #memory_int=|v_#memory_int_10|, #length=|v_#length_16|, ULTIMATE.start_test_fun_~z_ref~0.offset=v_ULTIMATE.start_test_fun_~z_ref~0.offset_5} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem5] 163#L15-1 [215] L15-1-->L15-2: Formula: (and |v_ULTIMATE.start_test_fun_#t~short8_2| (< |v_ULTIMATE.start_test_fun_#t~mem5_3| |v_ULTIMATE.start_test_fun_#t~mem4_3|)) InVars {ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_3|, ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_3|} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_3|, ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_3|, ULTIMATE.start_test_fun_#t~short8=|v_ULTIMATE.start_test_fun_#t~short8_2|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~short8] 181#L15-2 [112] L15-2-->L15-3: Formula: |v_ULTIMATE.start_test_fun_#t~short8_3| InVars {ULTIMATE.start_test_fun_#t~short8=|v_ULTIMATE.start_test_fun_#t~short8_3|} OutVars{ULTIMATE.start_test_fun_#t~short8=|v_ULTIMATE.start_test_fun_#t~short8_3|} AuxVars[] AssignedVars[] 180#L15-3 [109] L15-3-->L15-4: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_5) (= |v_ULTIMATE.start_test_fun_#t~mem6_2| (select (select |v_#memory_int_11| v_ULTIMATE.start_test_fun_~y_ref~0.base_6) v_ULTIMATE.start_test_fun_~y_ref~0.offset_5)) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_5 4) (select |v_#length_18| v_ULTIMATE.start_test_fun_~y_ref~0.base_6)) (= (select |v_#valid_20| v_ULTIMATE.start_test_fun_~y_ref~0.base_6) 1)) InVars {#memory_int=|v_#memory_int_11|, #length=|v_#length_18|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_6, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_5, #valid=|v_#valid_20|} OutVars{#valid=|v_#valid_20|, #memory_int=|v_#memory_int_11|, #length=|v_#length_18|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_6, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_2|, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_5} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem6] 178#L15-4 [106] L15-4-->L15-5: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~z_ref~0.offset_7) (<= (+ v_ULTIMATE.start_test_fun_~z_ref~0.offset_7 4) (select |v_#length_20| v_ULTIMATE.start_test_fun_~z_ref~0.base_9)) (= (select (select |v_#memory_int_12| v_ULTIMATE.start_test_fun_~z_ref~0.base_9) v_ULTIMATE.start_test_fun_~z_ref~0.offset_7) |v_ULTIMATE.start_test_fun_#t~mem7_2|) (= 1 (select |v_#valid_22| v_ULTIMATE.start_test_fun_~z_ref~0.base_9))) InVars {#memory_int=|v_#memory_int_12|, #length=|v_#length_20|, ULTIMATE.start_test_fun_~z_ref~0.base=v_ULTIMATE.start_test_fun_~z_ref~0.base_9, #valid=|v_#valid_22|, ULTIMATE.start_test_fun_~z_ref~0.offset=v_ULTIMATE.start_test_fun_~z_ref~0.offset_7} OutVars{ULTIMATE.start_test_fun_~z_ref~0.base=v_ULTIMATE.start_test_fun_~z_ref~0.base_9, #valid=|v_#valid_22|, #memory_int=|v_#memory_int_12|, #length=|v_#length_20|, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_2|, ULTIMATE.start_test_fun_~z_ref~0.offset=v_ULTIMATE.start_test_fun_~z_ref~0.offset_7} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem7] 176#L15-5 [229] L15-5-->L15-7: Formula: (and (< |v_ULTIMATE.start_test_fun_#t~mem7_3| |v_ULTIMATE.start_test_fun_#t~mem6_3|) |v_ULTIMATE.start_test_fun_#t~short8_4|) InVars {ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_3|, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_3|} OutVars{ULTIMATE.start_test_fun_#t~short8=|v_ULTIMATE.start_test_fun_#t~short8_4|, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_3|, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_3|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~short8] 171#L15-7 [92] L15-7-->L16: Formula: |v_ULTIMATE.start_test_fun_#t~short8_9| InVars {ULTIMATE.start_test_fun_#t~short8=|v_ULTIMATE.start_test_fun_#t~short8_9|} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_5|, ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_5|, ULTIMATE.start_test_fun_#t~short8=|v_ULTIMATE.start_test_fun_#t~short8_8|, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_5|, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_5|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem4, ULTIMATE.start_test_fun_#t~mem5, ULTIMATE.start_test_fun_#t~short8, ULTIMATE.start_test_fun_#t~mem6, ULTIMATE.start_test_fun_#t~mem7] 166#L16 [118] L16-->L16-1: Formula: (and (= (select |v_#valid_24| v_ULTIMATE.start_test_fun_~x_ref~0.base_9) 1) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_7) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_7 4) (select |v_#length_22| v_ULTIMATE.start_test_fun_~x_ref~0.base_9)) (= |v_ULTIMATE.start_test_fun_#t~mem9_2| (select (select |v_#memory_int_13| v_ULTIMATE.start_test_fun_~x_ref~0.base_9) v_ULTIMATE.start_test_fun_~x_ref~0.offset_7))) InVars {#memory_int=|v_#memory_int_13|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_7, #length=|v_#length_22|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_9, #valid=|v_#valid_24|} OutVars{#valid=|v_#valid_24|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_7, #length=|v_#length_22|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_9, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_2|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem9] 164#L16-1 [253] L16-1-->L17: Formula: (and (= (select |v_#valid_47| v_ULTIMATE.start_test_fun_~x_ref~0.base_15) 1) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_11 4) (select |v_#length_38| v_ULTIMATE.start_test_fun_~x_ref~0.base_15)) (= (store |v_#memory_int_26| v_ULTIMATE.start_test_fun_~x_ref~0.base_15 (store (select |v_#memory_int_26| v_ULTIMATE.start_test_fun_~x_ref~0.base_15) v_ULTIMATE.start_test_fun_~x_ref~0.offset_11 (+ |v_ULTIMATE.start_test_fun_#t~mem9_6| (- 1)))) |v_#memory_int_25|) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_11)) InVars {#valid=|v_#valid_47|, #memory_int=|v_#memory_int_26|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_11, #length=|v_#length_38|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_15, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_6|} OutVars{#valid=|v_#valid_47|, #memory_int=|v_#memory_int_25|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_11, #length=|v_#length_38|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_15, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_5|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_test_fun_#t~mem9] 165#L17 [131] L17-->L17-1: Formula: (and (= (select (select |v_#memory_int_16| v_ULTIMATE.start_test_fun_~y_ref~0.base_9) v_ULTIMATE.start_test_fun_~y_ref~0.offset_7) |v_ULTIMATE.start_test_fun_#t~mem10_2|) (= (select |v_#valid_28| v_ULTIMATE.start_test_fun_~y_ref~0.base_9) 1) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_7) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_7 4) (select |v_#length_26| v_ULTIMATE.start_test_fun_~y_ref~0.base_9))) InVars {#memory_int=|v_#memory_int_16|, #length=|v_#length_26|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_9, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_7, #valid=|v_#valid_28|} OutVars{ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_2|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_16|, #length=|v_#length_26|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_9, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_7} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem10] 167#L17-1 [256] L17-1-->L18: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_11) (= (store |v_#memory_int_30| v_ULTIMATE.start_test_fun_~y_ref~0.base_15 (store (select |v_#memory_int_30| v_ULTIMATE.start_test_fun_~y_ref~0.base_15) v_ULTIMATE.start_test_fun_~y_ref~0.offset_11 (+ |v_ULTIMATE.start_test_fun_#t~mem10_6| (- 1)))) |v_#memory_int_29|) (= 1 (select |v_#valid_52| v_ULTIMATE.start_test_fun_~y_ref~0.base_15)) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_11 4) (select |v_#length_41| v_ULTIMATE.start_test_fun_~y_ref~0.base_15))) InVars {ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_6|, #valid=|v_#valid_52|, #memory_int=|v_#memory_int_30|, #length=|v_#length_41|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_15, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_11} OutVars{ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_5|, #valid=|v_#valid_52|, #memory_int=|v_#memory_int_29|, #length=|v_#length_41|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_15, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_11} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem10, #memory_int] 168#L18 [88] L18-->L18-1: Formula: (and (= (select |v_#valid_32| v_ULTIMATE.start_test_fun_~c~0.base_6) 1) (= |v_ULTIMATE.start_test_fun_#t~mem11_2| (select (select |v_#memory_int_19| v_ULTIMATE.start_test_fun_~c~0.base_6) v_ULTIMATE.start_test_fun_~c~0.offset_5)) (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_5) (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_5 4) (select |v_#length_30| v_ULTIMATE.start_test_fun_~c~0.base_6))) InVars {#memory_int=|v_#memory_int_19|, #length=|v_#length_30|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_5, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_6, #valid=|v_#valid_32|} OutVars{ULTIMATE.start_test_fun_#t~mem11=|v_ULTIMATE.start_test_fun_#t~mem11_2|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_5, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_19|, #length=|v_#length_30|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem11] 170#L18-1 [257] L18-1-->L15-9: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_15 4) (select |v_#length_42| v_ULTIMATE.start_test_fun_~c~0.base_19)) (= (store |v_#memory_int_32| v_ULTIMATE.start_test_fun_~c~0.base_19 (store (select |v_#memory_int_32| v_ULTIMATE.start_test_fun_~c~0.base_19) v_ULTIMATE.start_test_fun_~c~0.offset_15 (+ |v_ULTIMATE.start_test_fun_#t~mem11_6| 1))) |v_#memory_int_31|) (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_15) (= (select |v_#valid_53| v_ULTIMATE.start_test_fun_~c~0.base_19) 1)) InVars {ULTIMATE.start_test_fun_#t~mem11=|v_ULTIMATE.start_test_fun_#t~mem11_6|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_15, #valid=|v_#valid_53|, #memory_int=|v_#memory_int_32|, #length=|v_#length_42|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_19} OutVars{ULTIMATE.start_test_fun_#t~mem11=|v_ULTIMATE.start_test_fun_#t~mem11_5|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_15, #valid=|v_#valid_53|, #memory_int=|v_#memory_int_31|, #length=|v_#length_42|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_19} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem11, #memory_int] 169#L15-9 159.91/136.29 [2019-03-28 12:42:38,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 159.91/136.29 [2019-03-28 12:42:38,122 INFO L82 PathProgramCache]: Analyzing trace with hash -312348709, now seen corresponding path program 3 times 159.91/136.29 [2019-03-28 12:42:38,122 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 159.91/136.29 [2019-03-28 12:42:38,122 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 159.91/136.29 [2019-03-28 12:42:38,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 159.91/136.29 [2019-03-28 12:42:38,123 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 159.91/136.29 [2019-03-28 12:42:38,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 159.91/136.29 [2019-03-28 12:42:38,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 159.91/136.29 [2019-03-28 12:42:38,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 159.91/136.29 [2019-03-28 12:42:38,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 159.91/136.29 [2019-03-28 12:42:38,149 INFO L82 PathProgramCache]: Analyzing trace with hash -32277304, now seen corresponding path program 1 times 159.91/136.29 [2019-03-28 12:42:38,149 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 159.91/136.29 [2019-03-28 12:42:38,149 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 159.91/136.29 [2019-03-28 12:42:38,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 159.91/136.29 [2019-03-28 12:42:38,150 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 159.91/136.29 [2019-03-28 12:42:38,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 159.91/136.29 [2019-03-28 12:42:38,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 159.91/136.29 [2019-03-28 12:42:38,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 159.91/136.29 [2019-03-28 12:42:38,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 159.91/136.29 [2019-03-28 12:42:38,170 INFO L82 PathProgramCache]: Analyzing trace with hash -893409502, now seen corresponding path program 1 times 159.91/136.29 [2019-03-28 12:42:38,170 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 159.91/136.29 [2019-03-28 12:42:38,170 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 159.91/136.29 [2019-03-28 12:42:38,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 159.91/136.29 [2019-03-28 12:42:38,171 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 159.91/136.29 [2019-03-28 12:42:38,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 159.91/136.29 [2019-03-28 12:42:38,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 159.91/136.29 [2019-03-28 12:42:38,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 159.91/136.29 [2019-03-28 12:42:38,338 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 83 159.91/136.29 [2019-03-28 12:42:38,944 WARN L188 SmtUtils]: Spent 521.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 111 159.91/136.29 [2019-03-28 12:42:39,198 WARN L188 SmtUtils]: Spent 251.00 ms on a formula simplification that was a NOOP. DAG size: 103 159.91/136.29 [2019-03-28 12:42:39,213 INFO L216 LassoAnalysis]: Preferences: 159.91/136.29 [2019-03-28 12:42:39,215 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 159.91/136.29 [2019-03-28 12:42:39,215 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 159.91/136.29 [2019-03-28 12:42:39,215 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 159.91/136.29 [2019-03-28 12:42:39,215 INFO L127 ssoRankerPreferences]: Use exernal solver: false 159.91/136.29 [2019-03-28 12:42:39,215 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 159.91/136.29 [2019-03-28 12:42:39,215 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 159.91/136.29 [2019-03-28 12:42:39,216 INFO L130 ssoRankerPreferences]: Path of dumped script: 159.91/136.29 [2019-03-28 12:42:39,216 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration3_Lasso 159.91/136.29 [2019-03-28 12:42:39,216 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 159.91/136.29 [2019-03-28 12:42:39,216 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 159.91/136.29 [2019-03-28 12:42:39,237 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 159.91/136.29 [2019-03-28 12:42:39,246 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 159.91/136.29 [2019-03-28 12:42:39,251 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 159.91/136.29 [2019-03-28 12:42:39,253 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 159.91/136.29 [2019-03-28 12:42:39,255 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 159.91/136.29 [2019-03-28 12:42:39,258 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 159.91/136.29 [2019-03-28 12:42:39,263 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 159.91/136.29 [2019-03-28 12:42:39,267 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 159.91/136.29 [2019-03-28 12:42:39,270 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 159.91/136.29 [2019-03-28 12:42:39,271 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 159.91/136.29 [2019-03-28 12:42:39,273 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 159.91/136.29 [2019-03-28 12:42:39,274 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 159.91/136.29 [2019-03-28 12:42:39,832 WARN L188 SmtUtils]: Spent 315.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 97 159.91/136.29 [2019-03-28 12:42:39,992 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 78 159.91/136.29 [2019-03-28 12:42:39,992 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 159.91/136.29 [2019-03-28 12:42:39,994 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 159.91/136.29 [2019-03-28 12:42:39,995 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 159.91/136.29 [2019-03-28 12:42:39,997 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 159.91/136.29 [2019-03-28 12:42:40,203 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 48 159.91/136.29 [2019-03-28 12:42:40,591 INFO L300 LassoAnalysis]: Preprocessing complete. 159.91/136.29 [2019-03-28 12:42:40,597 INFO L497 LassoAnalysis]: Using template 'affine'. 159.91/136.29 [2019-03-28 12:42:40,599 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 159.91/136.29 Termination analysis: LINEAR_WITH_GUESSES 159.91/136.29 Number of strict supporting invariants: 0 159.91/136.29 Number of non-strict supporting invariants: 1 159.91/136.29 Consider only non-deceasing supporting invariants: true 159.91/136.29 Simplify termination arguments: true 159.91/136.29 Simplify supporting invariants: trueOverapproximate stem: false 159.91/136.29 [2019-03-28 12:42:40,601 INFO L339 nArgumentSynthesizer]: Template has degree 0. 159.91/136.29 [2019-03-28 12:42:40,601 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 159.91/136.29 [2019-03-28 12:42:40,601 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 159.91/136.29 [2019-03-28 12:42:40,602 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 159.91/136.29 [2019-03-28 12:42:40,602 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 159.91/136.29 [2019-03-28 12:42:40,604 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 159.91/136.29 [2019-03-28 12:42:40,604 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 159.91/136.29 [2019-03-28 12:42:40,606 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 159.91/136.29 [2019-03-28 12:42:40,606 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 159.91/136.29 Termination analysis: LINEAR_WITH_GUESSES 159.91/136.29 Number of strict supporting invariants: 0 159.91/136.29 Number of non-strict supporting invariants: 1 159.91/136.29 Consider only non-deceasing supporting invariants: true 159.91/136.29 Simplify termination arguments: true 159.91/136.29 Simplify supporting invariants: trueOverapproximate stem: false 159.91/136.29 [2019-03-28 12:42:40,607 INFO L339 nArgumentSynthesizer]: Template has degree 0. 159.91/136.29 [2019-03-28 12:42:40,607 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 159.91/136.29 [2019-03-28 12:42:40,607 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 159.91/136.29 [2019-03-28 12:42:40,607 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 159.91/136.29 [2019-03-28 12:42:40,610 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 159.91/136.29 [2019-03-28 12:42:40,610 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 159.91/136.29 [2019-03-28 12:42:40,612 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 159.91/136.29 [2019-03-28 12:42:40,613 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 159.91/136.29 Termination analysis: LINEAR_WITH_GUESSES 159.91/136.29 Number of strict supporting invariants: 0 159.91/136.29 Number of non-strict supporting invariants: 1 159.91/136.29 Consider only non-deceasing supporting invariants: true 159.91/136.29 Simplify termination arguments: true 159.91/136.29 Simplify supporting invariants: trueOverapproximate stem: false 159.91/136.29 [2019-03-28 12:42:40,613 INFO L339 nArgumentSynthesizer]: Template has degree 0. 159.91/136.29 [2019-03-28 12:42:40,614 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 159.91/136.29 [2019-03-28 12:42:40,614 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 159.91/136.29 [2019-03-28 12:42:40,614 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 159.91/136.29 [2019-03-28 12:42:40,614 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 159.91/136.29 [2019-03-28 12:42:40,614 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 159.91/136.29 [2019-03-28 12:42:40,615 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 159.91/136.29 [2019-03-28 12:42:40,615 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 159.91/136.29 [2019-03-28 12:42:40,616 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 159.91/136.29 Termination analysis: LINEAR_WITH_GUESSES 159.91/136.29 Number of strict supporting invariants: 0 159.91/136.29 Number of non-strict supporting invariants: 1 159.91/136.29 Consider only non-deceasing supporting invariants: true 159.91/136.29 Simplify termination arguments: true 159.91/136.29 Simplify supporting invariants: trueOverapproximate stem: false 159.91/136.29 [2019-03-28 12:42:40,616 INFO L339 nArgumentSynthesizer]: Template has degree 0. 159.91/136.29 [2019-03-28 12:42:40,616 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 159.91/136.29 [2019-03-28 12:42:40,616 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 159.91/136.29 [2019-03-28 12:42:40,617 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 159.91/136.29 [2019-03-28 12:42:40,617 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 159.91/136.29 [2019-03-28 12:42:40,617 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 159.91/136.29 [2019-03-28 12:42:40,617 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 159.91/136.29 [2019-03-28 12:42:40,618 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 159.91/136.29 [2019-03-28 12:42:40,618 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 159.91/136.29 Termination analysis: LINEAR_WITH_GUESSES 159.91/136.29 Number of strict supporting invariants: 0 159.91/136.29 Number of non-strict supporting invariants: 1 159.91/136.29 Consider only non-deceasing supporting invariants: true 159.91/136.29 Simplify termination arguments: true 159.91/136.29 Simplify supporting invariants: trueOverapproximate stem: false 159.91/136.29 [2019-03-28 12:42:40,619 INFO L339 nArgumentSynthesizer]: Template has degree 0. 159.91/136.29 [2019-03-28 12:42:40,619 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 159.91/136.29 [2019-03-28 12:42:40,619 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 159.91/136.29 [2019-03-28 12:42:40,619 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 159.91/136.29 [2019-03-28 12:42:40,619 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 159.91/136.29 [2019-03-28 12:42:40,620 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 159.91/136.29 [2019-03-28 12:42:40,620 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 159.91/136.29 [2019-03-28 12:42:40,620 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 159.91/136.29 [2019-03-28 12:42:40,621 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 159.91/136.29 Termination analysis: LINEAR_WITH_GUESSES 159.91/136.29 Number of strict supporting invariants: 0 159.91/136.29 Number of non-strict supporting invariants: 1 159.91/136.29 Consider only non-deceasing supporting invariants: true 159.91/136.29 Simplify termination arguments: true 159.91/136.29 Simplify supporting invariants: trueOverapproximate stem: false 159.91/136.29 [2019-03-28 12:42:40,621 INFO L339 nArgumentSynthesizer]: Template has degree 0. 159.91/136.29 [2019-03-28 12:42:40,621 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 159.91/136.29 [2019-03-28 12:42:40,621 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 159.91/136.29 [2019-03-28 12:42:40,622 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 159.91/136.29 [2019-03-28 12:42:40,622 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 159.91/136.29 [2019-03-28 12:42:40,622 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 159.91/136.29 [2019-03-28 12:42:40,622 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 159.91/136.29 [2019-03-28 12:42:40,623 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 159.91/136.29 [2019-03-28 12:42:40,623 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 159.91/136.29 Termination analysis: LINEAR_WITH_GUESSES 159.91/136.29 Number of strict supporting invariants: 0 159.91/136.29 Number of non-strict supporting invariants: 1 159.91/136.29 Consider only non-deceasing supporting invariants: true 159.91/136.29 Simplify termination arguments: true 159.91/136.29 Simplify supporting invariants: trueOverapproximate stem: false 159.91/136.29 [2019-03-28 12:42:40,624 INFO L339 nArgumentSynthesizer]: Template has degree 0. 159.91/136.29 [2019-03-28 12:42:40,624 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 159.91/136.29 [2019-03-28 12:42:40,624 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 159.91/136.29 [2019-03-28 12:42:40,624 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 159.91/136.29 [2019-03-28 12:42:40,626 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 159.91/136.29 [2019-03-28 12:42:40,626 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 159.91/136.29 [2019-03-28 12:42:40,628 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 159.91/136.29 [2019-03-28 12:42:40,628 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 159.91/136.29 Termination analysis: LINEAR_WITH_GUESSES 159.91/136.29 Number of strict supporting invariants: 0 159.91/136.29 Number of non-strict supporting invariants: 1 159.91/136.29 Consider only non-deceasing supporting invariants: true 159.91/136.29 Simplify termination arguments: true 159.91/136.29 Simplify supporting invariants: trueOverapproximate stem: false 159.91/136.29 [2019-03-28 12:42:40,629 INFO L339 nArgumentSynthesizer]: Template has degree 0. 159.91/136.29 [2019-03-28 12:42:40,629 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 159.91/136.29 [2019-03-28 12:42:40,629 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 159.91/136.29 [2019-03-28 12:42:40,629 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 159.91/136.29 [2019-03-28 12:42:40,631 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 159.91/136.29 [2019-03-28 12:42:40,631 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 159.91/136.29 [2019-03-28 12:42:40,633 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 159.91/136.29 [2019-03-28 12:42:40,633 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 159.91/136.29 Termination analysis: LINEAR_WITH_GUESSES 159.91/136.29 Number of strict supporting invariants: 0 159.91/136.29 Number of non-strict supporting invariants: 1 159.91/136.29 Consider only non-deceasing supporting invariants: true 159.91/136.29 Simplify termination arguments: true 159.91/136.29 Simplify supporting invariants: trueOverapproximate stem: false 159.91/136.29 [2019-03-28 12:42:40,634 INFO L339 nArgumentSynthesizer]: Template has degree 0. 159.91/136.29 [2019-03-28 12:42:40,634 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 159.91/136.29 [2019-03-28 12:42:40,634 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 159.91/136.29 [2019-03-28 12:42:40,634 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 159.91/136.29 [2019-03-28 12:42:40,634 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 159.91/136.29 [2019-03-28 12:42:40,635 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 159.91/136.29 [2019-03-28 12:42:40,635 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 159.91/136.29 [2019-03-28 12:42:40,635 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 159.91/136.29 [2019-03-28 12:42:40,636 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 159.91/136.29 Termination analysis: LINEAR_WITH_GUESSES 159.91/136.29 Number of strict supporting invariants: 0 159.91/136.29 Number of non-strict supporting invariants: 1 159.91/136.29 Consider only non-deceasing supporting invariants: true 159.91/136.29 Simplify termination arguments: true 159.91/136.29 Simplify supporting invariants: trueOverapproximate stem: false 159.91/136.29 [2019-03-28 12:42:40,636 INFO L339 nArgumentSynthesizer]: Template has degree 0. 159.91/136.29 [2019-03-28 12:42:40,636 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 159.91/136.29 [2019-03-28 12:42:40,637 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 159.91/136.29 [2019-03-28 12:42:40,637 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 159.91/136.29 [2019-03-28 12:42:40,637 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 159.91/136.29 [2019-03-28 12:42:40,637 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 159.91/136.29 [2019-03-28 12:42:40,637 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 159.91/136.29 [2019-03-28 12:42:40,638 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 159.91/136.29 [2019-03-28 12:42:40,638 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 159.91/136.29 Termination analysis: LINEAR_WITH_GUESSES 159.91/136.29 Number of strict supporting invariants: 0 159.91/136.29 Number of non-strict supporting invariants: 1 159.91/136.29 Consider only non-deceasing supporting invariants: true 159.91/136.29 Simplify termination arguments: true 159.91/136.29 Simplify supporting invariants: trueOverapproximate stem: false 159.91/136.29 [2019-03-28 12:42:40,639 INFO L339 nArgumentSynthesizer]: Template has degree 0. 159.91/136.29 [2019-03-28 12:42:40,639 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 159.91/136.29 [2019-03-28 12:42:40,639 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 159.91/136.29 [2019-03-28 12:42:40,639 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 159.91/136.29 [2019-03-28 12:42:40,639 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 159.91/136.29 [2019-03-28 12:42:40,640 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 159.91/136.29 [2019-03-28 12:42:40,640 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 159.91/136.29 [2019-03-28 12:42:40,640 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 159.91/136.29 [2019-03-28 12:42:40,641 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 159.91/136.29 Termination analysis: LINEAR_WITH_GUESSES 159.91/136.29 Number of strict supporting invariants: 0 159.91/136.29 Number of non-strict supporting invariants: 1 159.91/136.29 Consider only non-deceasing supporting invariants: true 159.91/136.29 Simplify termination arguments: true 159.91/136.29 Simplify supporting invariants: trueOverapproximate stem: false 159.91/136.29 [2019-03-28 12:42:40,641 INFO L339 nArgumentSynthesizer]: Template has degree 0. 159.91/136.29 [2019-03-28 12:42:40,641 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 159.91/136.29 [2019-03-28 12:42:40,641 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 159.91/136.29 [2019-03-28 12:42:40,642 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 159.91/136.29 [2019-03-28 12:42:40,647 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 159.91/136.29 [2019-03-28 12:42:40,647 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 159.91/136.29 [2019-03-28 12:42:40,678 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 159.91/136.29 [2019-03-28 12:42:40,712 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. 159.91/136.29 [2019-03-28 12:42:40,713 INFO L444 ModelExtractionUtils]: 30 out of 40 variables were initially zero. Simplification set additionally 7 variables to zero. 159.91/136.29 [2019-03-28 12:42:40,715 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 159.91/136.29 [2019-03-28 12:42:40,717 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. 159.91/136.29 [2019-03-28 12:42:40,717 INFO L518 LassoAnalysis]: Proved termination. 159.91/136.29 [2019-03-28 12:42:40,717 INFO L520 LassoAnalysis]: Termination argument consisting of: 159.91/136.29 Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset)_1, v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_1) = -1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset)_1 + 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_1 159.91/136.29 Supporting invariants [] 159.91/136.29 [2019-03-28 12:42:40,925 INFO L297 tatePredicateManager]: 41 out of 42 supporting invariants were superfluous and have been removed 159.91/136.29 [2019-03-28 12:42:40,928 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 159.91/136.29 [2019-03-28 12:42:40,929 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 159.91/136.29 [2019-03-28 12:42:40,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 159.91/136.29 [2019-03-28 12:42:40,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 159.91/136.29 [2019-03-28 12:42:40,984 INFO L256 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 10 conjunts are in the unsatisfiable core 159.91/136.29 [2019-03-28 12:42:40,986 INFO L279 TraceCheckSpWp]: Computing forward predicates... 159.91/136.29 [2019-03-28 12:42:41,015 INFO L189 IndexEqualityManager]: detected not equals via solver 159.91/136.29 [2019-03-28 12:42:41,032 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 14 treesize of output 12 159.91/136.29 [2019-03-28 12:42:41,033 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 159.91/136.29 [2019-03-28 12:42:41,046 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 159.91/136.29 [2019-03-28 12:42:41,047 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. 159.91/136.29 [2019-03-28 12:42:41,047 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:22, output treesize:9 159.91/136.29 [2019-03-28 12:42:41,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 159.91/136.29 [2019-03-28 12:42:41,082 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 15 conjunts are in the unsatisfiable core 159.91/136.29 [2019-03-28 12:42:41,083 INFO L279 TraceCheckSpWp]: Computing forward predicates... 159.91/136.29 [2019-03-28 12:42:41,373 INFO L340 Elim1Store]: treesize reduction 12, result has 88.3 percent of original size 159.91/136.29 [2019-03-28 12:42:41,374 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 5 case distinctions, treesize of input 60 treesize of output 118 159.91/136.29 [2019-03-28 12:42:41,431 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 159.91/136.29 [2019-03-28 12:42:41,554 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 38 159.91/136.29 [2019-03-28 12:42:41,554 INFO L497 ElimStorePlain]: treesize reduction 162, result has 30.2 percent of original size 159.91/136.29 [2019-03-28 12:42:41,555 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 159.91/136.29 [2019-03-28 12:42:41,556 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:64, output treesize:71 159.91/136.29 [2019-03-28 12:42:41,743 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 159.91/136.29 [2019-03-28 12:42:41,744 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 60 treesize of output 126 159.91/136.29 [2019-03-28 12:42:41,791 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 159.91/136.29 [2019-03-28 12:42:41,828 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 159.91/136.29 [2019-03-28 12:42:41,828 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 38 159.91/136.29 [2019-03-28 12:42:41,829 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 159.91/136.29 [2019-03-28 12:42:41,898 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 159.91/136.29 [2019-03-28 12:42:41,899 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 60 treesize of output 126 159.91/136.29 [2019-03-28 12:42:41,945 INFO L427 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. 159.91/136.29 [2019-03-28 12:42:41,967 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 38 159.91/136.29 [2019-03-28 12:42:41,968 INFO L427 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. 159.91/136.29 [2019-03-28 12:42:42,172 WARN L188 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 50 159.91/136.29 [2019-03-28 12:42:42,172 INFO L497 ElimStorePlain]: treesize reduction 375, result has 31.6 percent of original size 159.91/136.29 [2019-03-28 12:42:42,174 INFO L427 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. 159.91/136.29 [2019-03-28 12:42:42,174 INFO L217 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:215, output treesize:141 159.91/136.29 [2019-03-28 12:42:57,389 WARN L188 SmtUtils]: Spent 10.15 s on a formula simplification. DAG size of input: 54 DAG size of output: 37 159.91/136.29 [2019-03-28 12:43:02,482 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 159.91/136.29 [2019-03-28 12:43:07,772 WARN L860 $PredicateComparison]: unable to prove that (or (not (= c_ULTIMATE.start_test_fun_~x_ref~0.offset c_ULTIMATE.start_test_fun_~z_ref~0.offset)) (exists ((ULTIMATE.start_test_fun_~y_ref~0.offset Int) (ULTIMATE.start_test_fun_~y_ref~0.base Int)) (and (not (and (= ULTIMATE.start_test_fun_~y_ref~0.offset c_ULTIMATE.start_test_fun_~x_ref~0.offset) (= c_ULTIMATE.start_test_fun_~x_ref~0.base ULTIMATE.start_test_fun_~y_ref~0.base))) (not (and (= ULTIMATE.start_test_fun_~y_ref~0.offset c_ULTIMATE.start_test_fun_~z_ref~0.offset) (= ULTIMATE.start_test_fun_~y_ref~0.base c_ULTIMATE.start_test_fun_~z_ref~0.base)))))) is different from true 159.91/136.29 [2019-03-28 12:43:07,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 159.91/136.29 [2019-03-28 12:43:07,822 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 159.91/136.29 [2019-03-28 12:43:07,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 159.91/136.29 [2019-03-28 12:43:07,843 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 159.91/136.29 [2019-03-28 12:43:07,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 159.91/136.29 [2019-03-28 12:43:07,860 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 159.91/136.29 [2019-03-28 12:43:07,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 159.91/136.29 [2019-03-28 12:43:07,874 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 159.91/136.29 [2019-03-28 12:43:07,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 159.91/136.29 [2019-03-28 12:43:07,894 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 15 conjunts are in the unsatisfiable core 159.91/136.29 [2019-03-28 12:43:07,896 INFO L279 TraceCheckSpWp]: Computing forward predicates... 159.91/136.29 [2019-03-28 12:43:08,021 INFO L340 Elim1Store]: treesize reduction 12, result has 88.3 percent of original size 159.91/136.29 [2019-03-28 12:43:08,022 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 5 case distinctions, treesize of input 34 treesize of output 108 159.91/136.29 [2019-03-28 12:43:08,058 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 159.91/136.29 [2019-03-28 12:43:08,264 WARN L188 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 40 159.91/136.29 [2019-03-28 12:43:08,265 INFO L497 ElimStorePlain]: treesize reduction 170, result has 32.0 percent of original size 159.91/136.29 [2019-03-28 12:43:08,266 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 159.91/136.29 [2019-03-28 12:43:08,266 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:76 159.91/136.29 [2019-03-28 12:43:08,493 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 159.91/136.29 [2019-03-28 12:43:08,493 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 90 159.91/136.29 [2019-03-28 12:43:08,502 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 159.91/136.29 [2019-03-28 12:43:08,516 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 27 159.91/136.29 [2019-03-28 12:43:08,516 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 159.91/136.29 [2019-03-28 12:43:08,528 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 40 treesize of output 32 159.91/136.29 [2019-03-28 12:43:08,529 INFO L427 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. 159.91/136.29 [2019-03-28 12:43:08,595 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 159.91/136.29 [2019-03-28 12:43:08,595 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 46 treesize of output 94 159.91/136.29 [2019-03-28 12:43:08,604 INFO L427 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. 159.91/136.29 [2019-03-28 12:43:08,621 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 27 159.91/136.29 [2019-03-28 12:43:08,622 INFO L427 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. 159.91/136.29 [2019-03-28 12:43:08,677 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 159.91/136.29 [2019-03-28 12:43:08,678 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 90 159.91/136.29 [2019-03-28 12:43:08,687 INFO L427 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. 159.91/136.29 [2019-03-28 12:43:09,055 WARN L188 SmtUtils]: Spent 367.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 58 159.91/136.29 [2019-03-28 12:43:09,055 INFO L497 ElimStorePlain]: treesize reduction 333, result has 42.8 percent of original size 159.91/136.29 [2019-03-28 12:43:09,058 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 6 xjuncts. 159.91/136.29 [2019-03-28 12:43:09,058 INFO L217 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:241, output treesize:202 159.91/136.29 [2019-03-28 12:43:36,644 WARN L188 SmtUtils]: Spent 17.90 s on a formula simplification. DAG size of input: 69 DAG size of output: 58 159.91/136.29 [2019-03-28 12:43:38,706 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 40 159.91/136.29 [2019-03-28 12:43:44,051 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 159.91/136.29 [2019-03-28 12:43:45,037 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| c_ULTIMATE.start_test_fun_~y_ref~0.base) c_ULTIMATE.start_test_fun_~y_ref~0.offset))) (or (<= (+ .cse0 1) (+ c_oldRank0 (select (select |c_#memory_int| c_ULTIMATE.start_test_fun_~z_ref~0.base) c_ULTIMATE.start_test_fun_~z_ref~0.offset))) (= c_ULTIMATE.start_test_fun_~y_ref~0.base c_ULTIMATE.start_test_fun_~z_ref~0.base) (exists ((v_prenex_4 Int)) (not (and (= c_ULTIMATE.start_test_fun_~z_ref~0.base c_ULTIMATE.start_test_fun_~c~0.base) (= v_prenex_4 c_ULTIMATE.start_test_fun_~z_ref~0.offset)))) (<= (+ .cse0 2) (+ (select (select |c_#memory_int| c_ULTIMATE.start_test_fun_~c~0.base) c_ULTIMATE.start_test_fun_~z_ref~0.offset) c_oldRank0)) (not (= c_ULTIMATE.start_test_fun_~y_ref~0.offset c_ULTIMATE.start_test_fun_~x_ref~0.offset)))) is different from true 159.91/136.29 [2019-03-28 12:43:46,021 WARN L860 $PredicateComparison]: unable to prove that (or (= c_ULTIMATE.start_test_fun_~y_ref~0.offset c_ULTIMATE.start_test_fun_~z_ref~0.offset) (= c_ULTIMATE.start_test_fun_~x_ref~0.base c_ULTIMATE.start_test_fun_~y_ref~0.base) (exists ((v_prenex_4 Int)) (not (and (= c_ULTIMATE.start_test_fun_~z_ref~0.base c_ULTIMATE.start_test_fun_~c~0.base) (= v_prenex_4 c_ULTIMATE.start_test_fun_~z_ref~0.offset)))) (not (= c_ULTIMATE.start_test_fun_~y_ref~0.offset c_ULTIMATE.start_test_fun_~x_ref~0.offset))) is different from true 159.91/136.29 [2019-03-28 12:43:47,074 WARN L860 $PredicateComparison]: unable to prove that (or (= c_ULTIMATE.start_test_fun_~y_ref~0.base c_ULTIMATE.start_test_fun_~z_ref~0.base) (= c_ULTIMATE.start_test_fun_~x_ref~0.base c_ULTIMATE.start_test_fun_~y_ref~0.base) (exists ((v_prenex_4 Int)) (not (and (= c_ULTIMATE.start_test_fun_~z_ref~0.base c_ULTIMATE.start_test_fun_~c~0.base) (= v_prenex_4 c_ULTIMATE.start_test_fun_~z_ref~0.offset)))) (not (= c_ULTIMATE.start_test_fun_~y_ref~0.offset c_ULTIMATE.start_test_fun_~x_ref~0.offset))) is different from true 159.91/136.29 [2019-03-28 12:43:48,327 WARN L860 $PredicateComparison]: unable to prove that (or (= c_ULTIMATE.start_test_fun_~y_ref~0.offset c_ULTIMATE.start_test_fun_~z_ref~0.offset) (exists ((v_prenex_4 Int)) (not (and (= c_ULTIMATE.start_test_fun_~z_ref~0.base c_ULTIMATE.start_test_fun_~c~0.base) (= v_prenex_4 c_ULTIMATE.start_test_fun_~z_ref~0.offset)))) (<= (+ (select (select |c_#memory_int| c_ULTIMATE.start_test_fun_~y_ref~0.base) c_ULTIMATE.start_test_fun_~y_ref~0.offset) 2) (+ (select (select |c_#memory_int| c_ULTIMATE.start_test_fun_~c~0.base) c_ULTIMATE.start_test_fun_~z_ref~0.offset) c_oldRank0)) (not (= c_ULTIMATE.start_test_fun_~y_ref~0.offset c_ULTIMATE.start_test_fun_~x_ref~0.offset)) (exists ((ULTIMATE.start_test_fun_~c~0.offset Int)) (not (and (= ULTIMATE.start_test_fun_~c~0.offset c_ULTIMATE.start_test_fun_~z_ref~0.offset) (= c_ULTIMATE.start_test_fun_~z_ref~0.base c_ULTIMATE.start_test_fun_~c~0.base))))) is different from true 159.91/136.30 [2019-03-28 12:43:49,362 WARN L860 $PredicateComparison]: unable to prove that (or (not (= c_ULTIMATE.start_test_fun_~x_ref~0.base c_ULTIMATE.start_test_fun_~y_ref~0.base)) (<= 0 c_oldRank0) (<= (+ (select (select |c_#memory_int| c_ULTIMATE.start_test_fun_~y_ref~0.base) c_ULTIMATE.start_test_fun_~y_ref~0.offset) 2) (+ (select (select |c_#memory_int| c_ULTIMATE.start_test_fun_~c~0.base) c_ULTIMATE.start_test_fun_~z_ref~0.offset) c_oldRank0)) (not (= c_ULTIMATE.start_test_fun_~y_ref~0.offset c_ULTIMATE.start_test_fun_~x_ref~0.offset)) (exists ((ULTIMATE.start_test_fun_~c~0.offset Int)) (not (and (= ULTIMATE.start_test_fun_~c~0.offset c_ULTIMATE.start_test_fun_~z_ref~0.offset) (= c_ULTIMATE.start_test_fun_~z_ref~0.base c_ULTIMATE.start_test_fun_~c~0.base))))) is different from true 159.91/136.30 [2019-03-28 12:43:50,330 WARN L860 $PredicateComparison]: unable to prove that (or (= c_ULTIMATE.start_test_fun_~y_ref~0.offset c_ULTIMATE.start_test_fun_~z_ref~0.offset) (not (= c_ULTIMATE.start_test_fun_~x_ref~0.base c_ULTIMATE.start_test_fun_~y_ref~0.base)) (<= (+ (select (select |c_#memory_int| c_ULTIMATE.start_test_fun_~y_ref~0.base) c_ULTIMATE.start_test_fun_~y_ref~0.offset) 2) (+ (select (select |c_#memory_int| c_ULTIMATE.start_test_fun_~c~0.base) c_ULTIMATE.start_test_fun_~z_ref~0.offset) c_oldRank0)) (not (= c_ULTIMATE.start_test_fun_~y_ref~0.offset c_ULTIMATE.start_test_fun_~x_ref~0.offset)) (exists ((ULTIMATE.start_test_fun_~c~0.offset Int)) (not (and (= ULTIMATE.start_test_fun_~c~0.offset c_ULTIMATE.start_test_fun_~z_ref~0.offset) (= c_ULTIMATE.start_test_fun_~z_ref~0.base c_ULTIMATE.start_test_fun_~c~0.base))))) is different from true 159.91/136.30 [2019-03-28 12:43:51,490 WARN L860 $PredicateComparison]: unable to prove that (or (not (= c_ULTIMATE.start_test_fun_~x_ref~0.base c_ULTIMATE.start_test_fun_~y_ref~0.base)) (= c_ULTIMATE.start_test_fun_~y_ref~0.base c_ULTIMATE.start_test_fun_~z_ref~0.base) (<= (+ (select (select |c_#memory_int| c_ULTIMATE.start_test_fun_~y_ref~0.base) c_ULTIMATE.start_test_fun_~y_ref~0.offset) 2) (+ (select (select |c_#memory_int| c_ULTIMATE.start_test_fun_~c~0.base) c_ULTIMATE.start_test_fun_~z_ref~0.offset) c_oldRank0)) (not (= c_ULTIMATE.start_test_fun_~y_ref~0.offset c_ULTIMATE.start_test_fun_~x_ref~0.offset)) (exists ((ULTIMATE.start_test_fun_~c~0.offset Int)) (not (and (= ULTIMATE.start_test_fun_~c~0.offset c_ULTIMATE.start_test_fun_~z_ref~0.offset) (= c_ULTIMATE.start_test_fun_~z_ref~0.base c_ULTIMATE.start_test_fun_~c~0.base))))) is different from true 159.91/136.30 [2019-03-28 12:43:52,476 WARN L860 $PredicateComparison]: unable to prove that (or (= c_ULTIMATE.start_test_fun_~y_ref~0.offset c_ULTIMATE.start_test_fun_~z_ref~0.offset) (<= (select (select |c_#memory_int| c_ULTIMATE.start_test_fun_~x_ref~0.base) c_ULTIMATE.start_test_fun_~x_ref~0.offset) (+ c_oldRank0 (select (select |c_#memory_int| c_ULTIMATE.start_test_fun_~z_ref~0.base) c_ULTIMATE.start_test_fun_~z_ref~0.offset))) (<= (+ (select (select |c_#memory_int| c_ULTIMATE.start_test_fun_~y_ref~0.base) c_ULTIMATE.start_test_fun_~y_ref~0.offset) 2) (+ (select (select |c_#memory_int| c_ULTIMATE.start_test_fun_~c~0.base) c_ULTIMATE.start_test_fun_~z_ref~0.offset) c_oldRank0)) (exists ((ULTIMATE.start_test_fun_~c~0.offset Int)) (not (and (= ULTIMATE.start_test_fun_~c~0.offset c_ULTIMATE.start_test_fun_~z_ref~0.offset) (= c_ULTIMATE.start_test_fun_~z_ref~0.base c_ULTIMATE.start_test_fun_~c~0.base))))) is different from true 159.91/136.30 [2019-03-28 12:43:53,531 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| c_ULTIMATE.start_test_fun_~y_ref~0.base) c_ULTIMATE.start_test_fun_~y_ref~0.offset))) (or (<= (+ .cse0 1) (+ c_oldRank0 (select (select |c_#memory_int| c_ULTIMATE.start_test_fun_~z_ref~0.base) c_ULTIMATE.start_test_fun_~z_ref~0.offset))) (= c_ULTIMATE.start_test_fun_~y_ref~0.offset c_ULTIMATE.start_test_fun_~z_ref~0.offset) (exists ((v_prenex_4 Int)) (not (and (= c_ULTIMATE.start_test_fun_~z_ref~0.base c_ULTIMATE.start_test_fun_~c~0.base) (= v_prenex_4 c_ULTIMATE.start_test_fun_~z_ref~0.offset)))) (<= (+ .cse0 2) (+ (select (select |c_#memory_int| c_ULTIMATE.start_test_fun_~c~0.base) c_ULTIMATE.start_test_fun_~z_ref~0.offset) c_oldRank0)) (not (= c_ULTIMATE.start_test_fun_~y_ref~0.offset c_ULTIMATE.start_test_fun_~x_ref~0.offset)))) is different from true 159.91/136.30 [2019-03-28 12:43:53,677 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 159.91/136.30 [2019-03-28 12:43:53,679 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 159.91/136.30 [2019-03-28 12:43:54,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 159.91/136.30 [2019-03-28 12:43:54,519 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 159.91/136.30 [2019-03-28 12:43:54,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 159.91/136.30 [2019-03-28 12:43:54,534 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 16 conjunts are in the unsatisfiable core 159.91/136.30 [2019-03-28 12:43:54,536 INFO L279 TraceCheckSpWp]: Computing forward predicates... 159.91/136.30 [2019-03-28 12:43:54,648 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 159.91/136.30 [2019-03-28 12:43:54,649 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 159.91/136.30 [2019-03-28 12:43:54,655 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 159.91/136.30 [2019-03-28 12:43:54,752 INFO L497 ElimStorePlain]: treesize reduction 96, result has 35.6 percent of original size 159.91/136.30 [2019-03-28 12:43:54,753 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. 159.91/136.30 [2019-03-28 12:43:54,753 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:38, output treesize:47 159.91/136.30 [2019-03-28 12:44:10,832 WARN L188 SmtUtils]: Spent 3.88 s on a formula simplification that was a NOOP. DAG size: 31 159.91/136.30 [2019-03-28 12:44:10,930 INFO L340 Elim1Store]: treesize reduction 12, result has 88.3 percent of original size 159.91/136.30 [2019-03-28 12:44:10,931 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 5 case distinctions, treesize of input 60 treesize of output 118 159.91/136.30 [2019-03-28 12:44:10,964 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 159.91/136.30 [2019-03-28 12:44:11,059 INFO L497 ElimStorePlain]: treesize reduction 183, result has 27.4 percent of original size 159.91/136.30 [2019-03-28 12:44:11,059 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 159.91/136.30 [2019-03-28 12:44:11,060 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:64, output treesize:71 159.91/136.30 [2019-03-28 12:44:12,163 WARN L860 $PredicateComparison]: unable to prove that (or (<= (+ (select (select |c_#memory_int| c_ULTIMATE.start_test_fun_~x_ref~0.base) c_ULTIMATE.start_test_fun_~x_ref~0.offset) 1) (+ (select (select |c_#memory_int| c_ULTIMATE.start_test_fun_~c~0.base) c_ULTIMATE.start_test_fun_~z_ref~0.offset) c_oldRank0)) (exists ((ULTIMATE.start_test_fun_~c~0.offset Int)) (not (and (= ULTIMATE.start_test_fun_~c~0.offset c_ULTIMATE.start_test_fun_~z_ref~0.offset) (= c_ULTIMATE.start_test_fun_~z_ref~0.base c_ULTIMATE.start_test_fun_~c~0.base))))) is different from true 159.91/136.30 [2019-03-28 12:44:12,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 159.91/136.30 [2019-03-28 12:44:12,309 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 159.91/136.30 [2019-03-28 12:44:12,309 INFO L98 LoopCannibalizer]: 17 predicates before loop cannibalization 58 predicates after loop cannibalization 159.91/136.30 [2019-03-28 12:44:12,313 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 58 loop predicates 159.91/136.30 [2019-03-28 12:44:12,314 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 20 states and 35 transitions. cyclomatic complexity: 16 Second operand 14 states. 159.91/136.30 [2019-03-28 12:44:16,003 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 29 159.91/136.30 [2019-03-28 12:44:16,550 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 32 159.91/136.30 [2019-03-28 12:44:36,811 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 36 159.91/136.30 [2019-03-28 12:44:37,123 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 38 159.91/136.30 [2019-03-28 12:44:37,539 WARN L188 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 39 159.91/136.30 [2019-03-28 12:44:41,017 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 31 159.91/136.30 [2019-03-28 12:44:41,298 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 33 159.91/136.30 [2019-03-28 12:44:46,316 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 20 states and 35 transitions. cyclomatic complexity: 16. Second operand 14 states. Result 102 states and 117 transitions. Complement of second has 83 states. 159.91/136.30 [2019-03-28 12:44:46,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 24 states 3 stem states 19 non-accepting loop states 2 accepting loop states 159.91/136.30 [2019-03-28 12:44:46,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. 159.91/136.30 [2019-03-28 12:44:46,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 79 transitions. 159.91/136.30 [2019-03-28 12:44:46,320 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 79 transitions. Stem has 6 letters. Loop has 14 letters. 159.91/136.30 [2019-03-28 12:44:46,321 INFO L116 BuchiAccepts]: Finished buchiAccepts. 159.91/136.30 [2019-03-28 12:44:46,321 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 79 transitions. Stem has 20 letters. Loop has 14 letters. 159.91/136.30 [2019-03-28 12:44:46,322 INFO L116 BuchiAccepts]: Finished buchiAccepts. 159.91/136.30 [2019-03-28 12:44:46,322 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 79 transitions. Stem has 6 letters. Loop has 28 letters. 159.91/136.30 [2019-03-28 12:44:46,323 INFO L116 BuchiAccepts]: Finished buchiAccepts. 159.91/136.30 [2019-03-28 12:44:46,334 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 102 states and 117 transitions. 159.91/136.30 [2019-03-28 12:44:46,337 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 159.91/136.30 [2019-03-28 12:44:46,338 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 102 states to 0 states and 0 transitions. 159.91/136.30 [2019-03-28 12:44:46,338 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 159.91/136.30 [2019-03-28 12:44:46,338 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 159.91/136.30 [2019-03-28 12:44:46,338 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. 159.91/136.30 [2019-03-28 12:44:46,338 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 159.91/136.30 [2019-03-28 12:44:46,338 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 159.91/136.30 [2019-03-28 12:44:46,338 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 159.91/136.30 [2019-03-28 12:44:46,338 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 159.91/136.30 [2019-03-28 12:44:46,338 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ 159.91/136.30 [2019-03-28 12:44:46,339 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. 159.91/136.30 [2019-03-28 12:44:46,339 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 159.91/136.30 [2019-03-28 12:44:46,339 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true 159.91/136.30 [2019-03-28 12:44:46,345 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:44:46 BasicIcfg 159.91/136.30 [2019-03-28 12:44:46,345 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- 159.91/136.30 [2019-03-28 12:44:46,346 INFO L168 Benchmark]: Toolchain (without parser) took 131914.75 ms. Allocated memory was 649.6 MB in the beginning and 878.2 MB in the end (delta: 228.6 MB). Free memory was 563.9 MB in the beginning and 672.6 MB in the end (delta: -108.7 MB). Peak memory consumption was 119.9 MB. Max. memory is 50.3 GB. 159.91/136.30 [2019-03-28 12:44:46,346 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 649.6 MB. Free memory is still 586.5 MB. There was no memory consumed. Max. memory is 50.3 GB. 159.91/136.30 [2019-03-28 12:44:46,347 INFO L168 Benchmark]: CACSL2BoogieTranslator took 318.04 ms. Allocated memory was 649.6 MB in the beginning and 653.3 MB in the end (delta: 3.7 MB). Free memory was 563.9 MB in the beginning and 619.4 MB in the end (delta: -55.6 MB). Peak memory consumption was 30.1 MB. Max. memory is 50.3 GB. 159.91/136.30 [2019-03-28 12:44:46,347 INFO L168 Benchmark]: Boogie Procedure Inliner took 44.22 ms. Allocated memory is still 653.3 MB. Free memory was 619.4 MB in the beginning and 616.3 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 50.3 GB. 159.91/136.30 [2019-03-28 12:44:46,348 INFO L168 Benchmark]: Boogie Preprocessor took 25.85 ms. Allocated memory is still 653.3 MB. Free memory was 616.3 MB in the beginning and 615.0 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. 159.91/136.30 [2019-03-28 12:44:46,348 INFO L168 Benchmark]: RCFGBuilder took 404.80 ms. Allocated memory is still 653.3 MB. Free memory was 615.0 MB in the beginning and 586.1 MB in the end (delta: 28.9 MB). Peak memory consumption was 28.9 MB. Max. memory is 50.3 GB. 159.91/136.30 [2019-03-28 12:44:46,349 INFO L168 Benchmark]: BlockEncodingV2 took 150.32 ms. Allocated memory is still 653.3 MB. Free memory was 586.1 MB in the beginning and 572.6 MB in the end (delta: 13.5 MB). Peak memory consumption was 13.5 MB. Max. memory is 50.3 GB. 159.91/136.30 [2019-03-28 12:44:46,349 INFO L168 Benchmark]: TraceAbstraction took 2308.98 ms. Allocated memory was 653.3 MB in the beginning and 729.3 MB in the end (delta: 76.0 MB). Free memory was 572.6 MB in the beginning and 617.2 MB in the end (delta: -44.5 MB). Peak memory consumption was 31.5 MB. Max. memory is 50.3 GB. 159.91/136.30 [2019-03-28 12:44:46,350 INFO L168 Benchmark]: BuchiAutomizer took 128657.05 ms. Allocated memory was 729.3 MB in the beginning and 878.2 MB in the end (delta: 148.9 MB). Free memory was 617.2 MB in the beginning and 672.6 MB in the end (delta: -55.4 MB). Peak memory consumption was 93.4 MB. Max. memory is 50.3 GB. 159.91/136.30 [2019-03-28 12:44:46,355 INFO L337 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### 159.91/136.30 --- Results --- 159.91/136.30 * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: 159.91/136.30 - StatisticsResult: Initial Icfg 159.91/136.30 59 locations, 61 edges 159.91/136.30 - StatisticsResult: Encoded RCFG 159.91/136.30 51 locations, 99 edges 159.91/136.30 * Results from de.uni_freiburg.informatik.ultimate.core: 159.91/136.30 - StatisticsResult: Toolchain Benchmarks 159.91/136.30 Benchmark results are: 159.91/136.30 * CDTParser took 0.18 ms. Allocated memory is still 649.6 MB. Free memory is still 586.5 MB. There was no memory consumed. Max. memory is 50.3 GB. 159.91/136.30 * CACSL2BoogieTranslator took 318.04 ms. Allocated memory was 649.6 MB in the beginning and 653.3 MB in the end (delta: 3.7 MB). Free memory was 563.9 MB in the beginning and 619.4 MB in the end (delta: -55.6 MB). Peak memory consumption was 30.1 MB. Max. memory is 50.3 GB. 159.91/136.30 * Boogie Procedure Inliner took 44.22 ms. Allocated memory is still 653.3 MB. Free memory was 619.4 MB in the beginning and 616.3 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 50.3 GB. 159.91/136.30 * Boogie Preprocessor took 25.85 ms. Allocated memory is still 653.3 MB. Free memory was 616.3 MB in the beginning and 615.0 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. 159.91/136.30 * RCFGBuilder took 404.80 ms. Allocated memory is still 653.3 MB. Free memory was 615.0 MB in the beginning and 586.1 MB in the end (delta: 28.9 MB). Peak memory consumption was 28.9 MB. Max. memory is 50.3 GB. 159.91/136.30 * BlockEncodingV2 took 150.32 ms. Allocated memory is still 653.3 MB. Free memory was 586.1 MB in the beginning and 572.6 MB in the end (delta: 13.5 MB). Peak memory consumption was 13.5 MB. Max. memory is 50.3 GB. 159.91/136.30 * TraceAbstraction took 2308.98 ms. Allocated memory was 653.3 MB in the beginning and 729.3 MB in the end (delta: 76.0 MB). Free memory was 572.6 MB in the beginning and 617.2 MB in the end (delta: -44.5 MB). Peak memory consumption was 31.5 MB. Max. memory is 50.3 GB. 159.91/136.30 * BuchiAutomizer took 128657.05 ms. Allocated memory was 729.3 MB in the beginning and 878.2 MB in the end (delta: 148.9 MB). Free memory was 617.2 MB in the beginning and 672.6 MB in the end (delta: -55.4 MB). Peak memory consumption was 93.4 MB. Max. memory is 50.3 GB. 159.91/136.30 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: 159.91/136.30 - GenericResult: Unfinished Backtranslation 159.91/136.30 unknown boogie variable #length 159.91/136.30 - GenericResult: Unfinished Backtranslation 159.91/136.30 unknown boogie variable #length 159.91/136.30 - GenericResult: Unfinished Backtranslation 159.91/136.30 unknown boogie variable #length 159.91/136.30 - GenericResult: Unfinished Backtranslation 159.91/136.30 unknown boogie variable #length 159.91/136.30 - GenericResult: Unfinished Backtranslation 159.91/136.30 unknown boogie variable #length 159.91/136.30 - GenericResult: Unfinished Backtranslation 159.91/136.30 unknown boogie variable #length 159.91/136.30 - GenericResult: Unfinished Backtranslation 159.91/136.30 unknown boogie variable #length 159.91/136.30 - GenericResult: Unfinished Backtranslation 159.91/136.30 unknown boogie variable #length 159.91/136.30 - GenericResult: Unfinished Backtranslation 159.91/136.30 unknown boogie variable #memory_int 159.91/136.30 - GenericResult: Unfinished Backtranslation 159.91/136.30 unknown boogie variable #memory_int 159.91/136.30 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: 159.91/136.30 - PositiveResult [Line: 12]: pointer dereference always succeeds 159.91/136.30 For all program executions holds that pointer dereference always succeeds at this location 159.91/136.30 - PositiveResult [Line: 13]: pointer dereference always succeeds 159.91/136.30 For all program executions holds that pointer dereference always succeeds at this location 159.91/136.30 - PositiveResult [Line: 18]: pointer dereference always succeeds 159.91/136.30 For all program executions holds that pointer dereference always succeeds at this location 159.91/136.30 - PositiveResult [Line: 12]: pointer dereference always succeeds 159.91/136.30 For all program executions holds that pointer dereference always succeeds at this location 159.91/136.30 - PositiveResult [Line: 17]: pointer dereference always succeeds 159.91/136.30 For all program executions holds that pointer dereference always succeeds at this location 159.91/136.30 - PositiveResult [Line: 18]: pointer dereference always succeeds 159.91/136.30 For all program executions holds that pointer dereference always succeeds at this location 159.91/136.30 - PositiveResult [Line: 17]: pointer dereference always succeeds 159.91/136.30 For all program executions holds that pointer dereference always succeeds at this location 159.91/136.30 - PositiveResult [Line: 11]: pointer dereference always succeeds 159.91/136.30 For all program executions holds that pointer dereference always succeeds at this location 159.91/136.30 - PositiveResult [Line: 11]: pointer dereference always succeeds 159.91/136.30 For all program executions holds that pointer dereference always succeeds at this location 159.91/136.30 - PositiveResult [Line: 17]: pointer dereference always succeeds 159.91/136.30 For all program executions holds that pointer dereference always succeeds at this location 159.91/136.30 - PositiveResult [Line: 16]: pointer dereference always succeeds 159.91/136.30 For all program executions holds that pointer dereference always succeeds at this location 159.91/136.30 - PositiveResult [Line: 17]: pointer dereference always succeeds 159.91/136.30 For all program executions holds that pointer dereference always succeeds at this location 159.91/136.30 - PositiveResult [Line: 16]: pointer dereference always succeeds 159.91/136.30 For all program executions holds that pointer dereference always succeeds at this location 159.91/136.30 - PositiveResult [Line: 16]: pointer dereference always succeeds 159.91/136.30 For all program executions holds that pointer dereference always succeeds at this location 159.91/136.30 - PositiveResult [Line: 15]: pointer dereference always succeeds 159.91/136.30 For all program executions holds that pointer dereference always succeeds at this location 159.91/136.30 - PositiveResult [Line: 16]: pointer dereference always succeeds 159.91/136.30 For all program executions holds that pointer dereference always succeeds at this location 159.91/136.30 - PositiveResult [Line: 15]: pointer dereference always succeeds 159.91/136.30 For all program executions holds that pointer dereference always succeeds at this location 159.91/136.30 - PositiveResult [Line: 15]: pointer dereference always succeeds 159.91/136.30 For all program executions holds that pointer dereference always succeeds at this location 159.91/136.30 - PositiveResult [Line: 15]: pointer dereference always succeeds 159.91/136.30 For all program executions holds that pointer dereference always succeeds at this location 159.91/136.30 - PositiveResult [Line: 15]: pointer dereference always succeeds 159.91/136.30 For all program executions holds that pointer dereference always succeeds at this location 159.91/136.30 - PositiveResult [Line: 15]: pointer dereference always succeeds 159.91/136.30 For all program executions holds that pointer dereference always succeeds at this location 159.91/136.30 - PositiveResult [Line: 15]: pointer dereference always succeeds 159.91/136.30 For all program executions holds that pointer dereference always succeeds at this location 159.91/136.30 - PositiveResult [Line: 14]: pointer dereference always succeeds 159.91/136.30 For all program executions holds that pointer dereference always succeeds at this location 159.91/136.30 - PositiveResult [Line: 15]: pointer dereference always succeeds 159.91/136.30 For all program executions holds that pointer dereference always succeeds at this location 159.91/136.30 - PositiveResult [Line: 20]: pointer dereference always succeeds 159.91/136.30 For all program executions holds that pointer dereference always succeeds at this location 159.91/136.30 - PositiveResult [Line: 14]: pointer dereference always succeeds 159.91/136.30 For all program executions holds that pointer dereference always succeeds at this location 159.91/136.30 - PositiveResult [Line: 18]: pointer dereference always succeeds 159.91/136.30 For all program executions holds that pointer dereference always succeeds at this location 159.91/136.30 - PositiveResult [Line: 20]: pointer dereference always succeeds 159.91/136.30 For all program executions holds that pointer dereference always succeeds at this location 159.91/136.30 - PositiveResult [Line: 18]: pointer dereference always succeeds 159.91/136.30 For all program executions holds that pointer dereference always succeeds at this location 159.91/136.30 - PositiveResult [Line: 13]: pointer dereference always succeeds 159.91/136.30 For all program executions holds that pointer dereference always succeeds at this location 159.91/136.30 - AllSpecificationsHoldResult: All specifications hold 159.91/136.30 30 specifications checked. All of them hold 159.91/136.30 - InvariantResult [Line: 14]: Loop Invariant 159.91/136.30 [2019-03-28 12:44:46,364 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 159.91/136.30 [2019-03-28 12:44:46,365 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 159.91/136.30 [2019-03-28 12:44:46,365 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 159.91/136.30 [2019-03-28 12:44:46,365 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 159.91/136.30 [2019-03-28 12:44:46,366 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 159.91/136.30 [2019-03-28 12:44:46,366 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 159.91/136.30 [2019-03-28 12:44:46,367 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 159.91/136.30 [2019-03-28 12:44:46,367 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 159.91/136.30 Derived loop invariant: ((((((((((\valid[z_ref] == 1 && 4 == unknown-#length-unknown[x_ref]) && 0 == c) && 0 == z_ref) && unknown-#length-unknown[y_ref] == 4) && x_ref == 0) && \valid[y_ref] == 1) && 4 == unknown-#length-unknown[z_ref]) && 1 == \valid[x_ref]) && y_ref == 0) && 4 == unknown-#length-unknown[c]) && 1 == \valid[c] 159.91/136.30 - StatisticsResult: Ultimate Automizer benchmark data 159.91/136.30 CFG has 1 procedures, 51 locations, 30 error locations. SAFE Result, 2.2s OverallTime, 11 OverallIterations, 1 TraceHistogramMax, 1.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 87 SDtfs, 502 SDslu, 7 SDs, 0 SdLazy, 623 SolverSat, 214 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 22 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=51occurred 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, 11 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, 50 NumberOfCodeBlocks, 50 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 39 ConstructedInterpolants, 0 QuantifiedInterpolants, 701 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available 159.91/136.30 - StatisticsResult: Constructed decomposition of program 159.91/136.30 Your program was decomposed into 3 terminating modules (2 trivial, 0 deterministic, 1 nondeterministic). One nondeterministic module has affine ranking function -1 * unknown-#memory_int-unknown[z_ref][z_ref] + unknown-#memory_int-unknown[x_ref][x_ref] and consists of 24 locations. 2 modules have a trivial ranking function, the largest among these consists of 3 locations. 159.91/136.30 - StatisticsResult: Timing statistics 159.91/136.30 BüchiAutomizer plugin needed 128.6s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 2.9s. Construction of modules took 6.2s. Büchi inclusion checks took 119.4s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 21 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 49 SDtfs, 295 SDslu, 134 SDs, 0 SdLazy, 538 SolverSat, 81 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 6.2s Time LassoAnalysisResults: nont0 unkn0 SFLI2 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital570 mio100 ax100 hnf100 lsp98 ukn43 mio100 lsp39 div100 bol100 ite100 ukn100 eq187 hnf88 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 159.91/136.30 - TerminationAnalysisResult: Termination proven 159.91/136.30 Buchi Automizer proved that your program is terminating 159.91/136.30 RESULT: Ultimate proved your program to be correct! 159.91/136.30 !SESSION 2019-03-28 12:42:31.082 ----------------------------------------------- 159.91/136.30 eclipse.buildId=unknown 159.91/136.30 java.version=1.8.0_181 159.91/136.30 java.vendor=Oracle Corporation 159.91/136.30 BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US 159.91/136.30 Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox2/benchmark/theBenchmark.c 159.91/136.30 Command-line arguments: -os linux -ws gtk -arch x86_64 -consoleLog -data @user.home/.ultimate -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -data /export/starexec/sandbox2/tmp -i /export/starexec/sandbox2/benchmark/theBenchmark.c 159.91/136.30 159.91/136.30 !ENTRY org.eclipse.core.resources 2 10035 2019-03-28 12:44:46.594 159.91/136.30 !MESSAGE The workspace will exit with unsaved changes in this session. 159.91/136.30 Received shutdown request... 159.91/136.30 Ultimate: 159.91/136.30 GTK+ Version Check 159.91/136.30 EOF