150.94/116.99 YES 150.94/116.99 150.94/116.99 Ultimate: Cannot open display: 150.94/116.99 This is Ultimate 0.1.24-8dc7c08-m 150.94/116.99 [2019-03-28 12:37:30,312 INFO L170 SettingsManager]: Resetting all preferences to default values... 150.94/116.99 [2019-03-28 12:37:30,314 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values 150.94/116.99 [2019-03-28 12:37:30,325 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... 150.94/116.99 [2019-03-28 12:37:30,326 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values 150.94/116.99 [2019-03-28 12:37:30,327 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values 150.94/116.99 [2019-03-28 12:37:30,328 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values 150.94/116.99 [2019-03-28 12:37:30,330 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values 150.94/116.99 [2019-03-28 12:37:30,332 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values 150.94/116.99 [2019-03-28 12:37:30,332 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values 150.94/116.99 [2019-03-28 12:37:30,333 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... 150.94/116.99 [2019-03-28 12:37:30,333 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values 150.94/116.99 [2019-03-28 12:37:30,334 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values 150.94/116.99 [2019-03-28 12:37:30,335 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values 150.94/116.99 [2019-03-28 12:37:30,336 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values 150.94/116.99 [2019-03-28 12:37:30,337 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values 150.94/116.99 [2019-03-28 12:37:30,338 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values 150.94/116.99 [2019-03-28 12:37:30,340 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values 150.94/116.99 [2019-03-28 12:37:30,342 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values 150.94/116.99 [2019-03-28 12:37:30,343 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values 150.94/116.99 [2019-03-28 12:37:30,344 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values 150.94/116.99 [2019-03-28 12:37:30,345 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values 150.94/116.99 [2019-03-28 12:37:30,347 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... 150.94/116.99 [2019-03-28 12:37:30,347 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... 150.94/116.99 [2019-03-28 12:37:30,348 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values 150.94/116.99 [2019-03-28 12:37:30,348 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values 150.94/116.99 [2019-03-28 12:37:30,349 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values 150.94/116.99 [2019-03-28 12:37:30,350 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... 150.94/116.99 [2019-03-28 12:37:30,350 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values 150.94/116.99 [2019-03-28 12:37:30,351 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values 150.94/116.99 [2019-03-28 12:37:30,351 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values 150.94/116.99 [2019-03-28 12:37:30,352 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values 150.94/116.99 [2019-03-28 12:37:30,353 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... 150.94/116.99 [2019-03-28 12:37:30,353 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values 150.94/116.99 [2019-03-28 12:37:30,354 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... 150.94/116.99 [2019-03-28 12:37:30,354 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... 150.94/116.99 [2019-03-28 12:37:30,354 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values 150.94/116.99 [2019-03-28 12:37:30,355 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values 150.94/116.99 [2019-03-28 12:37:30,356 INFO L181 SettingsManager]: Finished resetting all preferences to default values... 150.94/116.99 [2019-03-28 12:37:30,356 INFO L98 SettingsManager]: Beginning loading settings from /export/starexec/sandbox/solver/bin/./../termcomp2017.epf 150.94/116.99 [2019-03-28 12:37:30,371 INFO L110 SettingsManager]: Loading preferences was successful 150.94/116.99 [2019-03-28 12:37:30,371 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: 150.94/116.99 [2019-03-28 12:37:30,372 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: 150.94/116.99 [2019-03-28 12:37:30,372 INFO L133 SettingsManager]: * Rewrite not-equals=true 150.94/116.99 [2019-03-28 12:37:30,372 INFO L133 SettingsManager]: * Create parallel compositions if possible=false 150.94/116.99 [2019-03-28 12:37:30,372 INFO L133 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE 150.94/116.99 [2019-03-28 12:37:30,373 INFO L133 SettingsManager]: * Use SBE=true 150.94/116.99 [2019-03-28 12:37:30,373 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: 150.94/116.99 [2019-03-28 12:37:30,373 INFO L133 SettingsManager]: * Use old map elimination=false 150.94/116.99 [2019-03-28 12:37:30,373 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false 150.94/116.99 [2019-03-28 12:37:30,373 INFO L133 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION 150.94/116.99 [2019-03-28 12:37:30,373 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true 150.94/116.99 [2019-03-28 12:37:30,374 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES 150.94/116.99 [2019-03-28 12:37:30,374 INFO L133 SettingsManager]: * Construct termination proof for TermComp=true 150.94/116.99 [2019-03-28 12:37:30,374 INFO L133 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 150.94/116.99 [2019-03-28 12:37:30,374 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: 150.94/116.99 [2019-03-28 12:37:30,374 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false 150.94/116.99 [2019-03-28 12:37:30,375 INFO L133 SettingsManager]: * Check division by zero=IGNORE 150.94/116.99 [2019-03-28 12:37:30,375 INFO L133 SettingsManager]: * Check if freed pointer was valid=false 150.94/116.99 [2019-03-28 12:37:30,375 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false 150.94/116.99 [2019-03-28 12:37:30,375 INFO L133 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE 150.94/116.99 [2019-03-28 12:37:30,375 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: 150.94/116.99 [2019-03-28 12:37:30,375 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements 150.94/116.99 [2019-03-28 12:37:30,376 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump 150.94/116.99 [2019-03-28 12:37:30,376 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 150.94/116.99 [2019-03-28 12:37:30,376 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: 150.94/116.99 [2019-03-28 12:37:30,376 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles 150.94/116.99 [2019-03-28 12:37:30,376 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL 150.94/116.99 [2019-03-28 12:37:30,376 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 150.94/116.99 [2019-03-28 12:37:30,402 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp 150.94/116.99 [2019-03-28 12:37:30,416 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized 150.94/116.99 [2019-03-28 12:37:30,419 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. 150.94/116.99 [2019-03-28 12:37:30,421 INFO L271 PluginConnector]: Initializing CDTParser... 150.94/116.99 [2019-03-28 12:37:30,421 INFO L276 PluginConnector]: CDTParser initialized 150.94/116.99 [2019-03-28 12:37:30,422 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox/benchmark/theBenchmark.c 150.94/116.99 [2019-03-28 12:37:30,481 INFO L221 CDTParser]: Created temporary CDT project at /export/starexec/sandbox/tmp/ef3fa888609242f29990e2bfd9daf928/FLAGc55f56cb5 150.94/116.99 [2019-03-28 12:37:30,830 INFO L307 CDTParser]: Found 1 translation units. 150.94/116.99 [2019-03-28 12:37:30,830 INFO L161 CDTParser]: Scanning /export/starexec/sandbox/benchmark/theBenchmark.c 150.94/116.99 [2019-03-28 12:37:30,831 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. 150.94/116.99 [2019-03-28 12:37:30,837 INFO L355 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox/tmp/ef3fa888609242f29990e2bfd9daf928/FLAGc55f56cb5 150.94/116.99 [2019-03-28 12:37:31,259 INFO L363 CDTParser]: Successfully deleted /export/starexec/sandbox/tmp/ef3fa888609242f29990e2bfd9daf928 150.94/116.99 [2019-03-28 12:37:31,270 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### 150.94/116.99 [2019-03-28 12:37:31,272 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. 150.94/116.99 [2019-03-28 12:37:31,273 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- 150.94/116.99 [2019-03-28 12:37:31,273 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... 150.94/116.99 [2019-03-28 12:37:31,277 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized 150.94/116.99 [2019-03-28 12:37:31,278 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 12:37:31" (1/1) ... 150.94/116.99 [2019-03-28 12:37:31,281 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33327c67 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:37:31, skipping insertion in model container 150.94/116.99 [2019-03-28 12:37:31,281 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 12:37:31" (1/1) ... 150.94/116.99 [2019-03-28 12:37:31,289 INFO L145 MainTranslator]: Starting translation in SV-COMP mode 150.94/116.99 [2019-03-28 12:37:31,307 INFO L176 MainTranslator]: Built tables and reachable declarations 150.94/116.99 [2019-03-28 12:37:31,470 INFO L206 PostProcessor]: Analyzing one entry point: main 150.94/116.99 [2019-03-28 12:37:31,482 INFO L191 MainTranslator]: Completed pre-run 150.94/116.99 [2019-03-28 12:37:31,556 INFO L206 PostProcessor]: Analyzing one entry point: main 150.94/116.99 [2019-03-28 12:37:31,572 INFO L195 MainTranslator]: Completed translation 150.94/116.99 [2019-03-28 12:37:31,572 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:37:31 WrapperNode 150.94/116.99 [2019-03-28 12:37:31,573 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- 150.94/116.99 [2019-03-28 12:37:31,573 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- 150.94/116.99 [2019-03-28 12:37:31,574 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... 150.94/116.99 [2019-03-28 12:37:31,574 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized 150.94/116.99 [2019-03-28 12:37:31,583 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:37:31" (1/1) ... 150.94/116.99 [2019-03-28 12:37:31,592 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:37:31" (1/1) ... 150.94/116.99 [2019-03-28 12:37:31,613 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- 150.94/116.99 [2019-03-28 12:37:31,614 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- 150.94/116.99 [2019-03-28 12:37:31,614 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... 150.94/116.99 [2019-03-28 12:37:31,614 INFO L276 PluginConnector]: Boogie Preprocessor initialized 150.94/116.99 [2019-03-28 12:37:31,623 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:37:31" (1/1) ... 150.94/116.99 [2019-03-28 12:37:31,624 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:37:31" (1/1) ... 150.94/116.99 [2019-03-28 12:37:31,625 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:37:31" (1/1) ... 150.94/116.99 [2019-03-28 12:37:31,626 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:37:31" (1/1) ... 150.94/116.99 [2019-03-28 12:37:31,631 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:37:31" (1/1) ... 150.94/116.99 [2019-03-28 12:37:31,636 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:37:31" (1/1) ... 150.94/116.99 [2019-03-28 12:37:31,637 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:37:31" (1/1) ... 150.94/116.99 [2019-03-28 12:37:31,639 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- 150.94/116.99 [2019-03-28 12:37:31,640 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- 150.94/116.99 [2019-03-28 12:37:31,640 INFO L271 PluginConnector]: Initializing RCFGBuilder... 150.94/116.99 [2019-03-28 12:37:31,640 INFO L276 PluginConnector]: RCFGBuilder initialized 150.94/116.99 [2019-03-28 12:37:31,641 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:37:31" (1/1) ... 150.94/116.99 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 150.94/116.99 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) 150.94/116.99 Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 150.94/116.99 [2019-03-28 12:37:31,702 INFO L130 BoogieDeclarations]: Found specification of procedure write~int 150.94/116.99 [2019-03-28 12:37:31,702 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start 150.94/116.99 [2019-03-28 12:37:31,702 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start 150.94/116.99 [2019-03-28 12:37:31,702 INFO L130 BoogieDeclarations]: Found specification of procedure read~int 150.94/116.99 [2019-03-28 12:37:31,702 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack 150.94/116.99 [2019-03-28 12:37:31,703 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc 150.94/116.99 [2019-03-28 12:37:31,935 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) 150.94/116.99 [2019-03-28 12:37:31,935 INFO L286 CfgBuilder]: Removed 6 assue(true) statements. 150.94/116.99 [2019-03-28 12:37:31,937 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:37:31 BoogieIcfgContainer 150.94/116.99 [2019-03-28 12:37:31,937 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- 150.94/116.99 [2019-03-28 12:37:31,937 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- 150.94/116.99 [2019-03-28 12:37:31,938 INFO L271 PluginConnector]: Initializing BlockEncodingV2... 150.94/116.99 [2019-03-28 12:37:31,940 INFO L276 PluginConnector]: BlockEncodingV2 initialized 150.94/116.99 [2019-03-28 12:37:31,940 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:37:31" (1/1) ... 150.94/116.99 [2019-03-28 12:37:31,959 INFO L313 BlockEncoder]: Initial Icfg 27 locations, 33 edges 150.94/116.99 [2019-03-28 12:37:31,961 INFO L258 BlockEncoder]: Using Remove infeasible edges 150.94/116.99 [2019-03-28 12:37:31,963 INFO L263 BlockEncoder]: Using Maximize final states 150.94/116.99 [2019-03-28 12:37:31,963 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false 150.94/116.99 [2019-03-28 12:37:31,964 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE 150.94/116.99 [2019-03-28 12:37:31,965 INFO L296 BlockEncoder]: Using Remove sink states 150.94/116.99 [2019-03-28 12:37:31,966 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true 150.94/116.99 [2019-03-28 12:37:31,967 INFO L179 BlockEncoder]: Using Rewrite not-equals 150.94/116.99 [2019-03-28 12:37:32,011 INFO L185 BlockEncoder]: Using Use SBE 150.94/116.99 [2019-03-28 12:37:32,118 WARN L177 XnfTransformerHelper]: Simplifying disjunction of 22736 conjuctions. This might take some time... 150.94/116.99 [2019-03-28 12:38:47,920 INFO L193 XnfTransformerHelper]: Simplified to disjunction of 22736 conjuctions. 150.94/116.99 [2019-03-28 12:38:48,300 INFO L200 BlockEncoder]: SBE split 10 edges 150.94/116.99 [2019-03-28 12:38:48,312 INFO L70 emoveInfeasibleEdges]: Removed 2 edges and 0 locations because of local infeasibility 150.94/116.99 [2019-03-28 12:38:48,315 INFO L71 MaximizeFinalStates]: 0 new accepting states 150.94/116.99 [2019-03-28 12:38:48,385 INFO L100 BaseMinimizeStates]: Removed 16 edges and 8 locations by large block encoding 150.94/116.99 [2019-03-28 12:38:48,388 INFO L70 RemoveSinkStates]: Removed 4 edges and 2 locations by removing sink states 150.94/116.99 [2019-03-28 12:38:48,394 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility 150.94/116.99 [2019-03-28 12:38:48,395 INFO L71 MaximizeFinalStates]: 0 new accepting states 150.94/116.99 [2019-03-28 12:38:48,396 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding 150.94/116.99 [2019-03-28 12:38:48,396 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states 150.94/116.99 [2019-03-28 12:38:48,402 INFO L313 BlockEncoder]: Encoded RCFG 17 locations, 1425 edges 150.94/116.99 [2019-03-28 12:38:48,403 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:38:48 BasicIcfg 150.94/116.99 [2019-03-28 12:38:48,404 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- 150.94/116.99 [2019-03-28 12:38:48,405 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- 150.94/116.99 [2019-03-28 12:38:48,405 INFO L271 PluginConnector]: Initializing TraceAbstraction... 150.94/116.99 [2019-03-28 12:38:48,410 INFO L276 PluginConnector]: TraceAbstraction initialized 150.94/116.99 [2019-03-28 12:38:48,410 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.03 12:37:31" (1/4) ... 150.94/116.99 [2019-03-28 12:38:48,411 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@626435cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 12:38:48, skipping insertion in model container 150.94/116.99 [2019-03-28 12:38:48,412 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:37:31" (2/4) ... 150.94/116.99 [2019-03-28 12:38:48,412 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@626435cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 12:38:48, skipping insertion in model container 150.94/116.99 [2019-03-28 12:38:48,412 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:37:31" (3/4) ... 150.94/116.99 [2019-03-28 12:38:48,413 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@626435cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:38:48, skipping insertion in model container 150.94/116.99 [2019-03-28 12:38:48,413 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:38:48" (4/4) ... 150.94/116.99 [2019-03-28 12:38:48,415 INFO L112 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 150.94/116.99 [2019-03-28 12:38:48,426 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION 150.94/116.99 [2019-03-28 12:38:48,436 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. 150.94/116.99 [2019-03-28 12:38:48,455 INFO L257 AbstractCegarLoop]: Starting to check reachability of 6 error locations. 150.94/116.99 [2019-03-28 12:38:48,489 INFO L133 ementStrategyFactory]: Using default assertion order modulation 150.94/116.99 [2019-03-28 12:38:48,489 INFO L382 AbstractCegarLoop]: Interprodecural is true 150.94/116.99 [2019-03-28 12:38:48,490 INFO L383 AbstractCegarLoop]: Hoare is true 150.94/116.99 [2019-03-28 12:38:48,490 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates 150.94/116.99 [2019-03-28 12:38:48,490 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE 150.94/116.99 [2019-03-28 12:38:48,490 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION 150.94/116.99 [2019-03-28 12:38:48,490 INFO L387 AbstractCegarLoop]: Difference is false 150.94/116.99 [2019-03-28 12:38:48,490 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA 150.94/116.99 [2019-03-28 12:38:48,491 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== 150.94/116.99 [2019-03-28 12:38:48,511 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states. 150.94/116.99 [2019-03-28 12:38:48,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 150.94/116.99 [2019-03-28 12:38:48,523 INFO L394 BasicCegarLoop]: Found error trace 150.94/116.99 [2019-03-28 12:38:48,524 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] 150.94/116.99 [2019-03-28 12:38:48,524 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== 150.94/116.99 [2019-03-28 12:38:48,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 150.94/116.99 [2019-03-28 12:38:48,531 INFO L82 PathProgramCache]: Analyzing trace with hash -1379208988, now seen corresponding path program 1 times 150.94/116.99 [2019-03-28 12:38:48,533 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 150.94/116.99 [2019-03-28 12:38:48,533 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 150.94/116.99 [2019-03-28 12:38:48,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 150.94/116.99 [2019-03-28 12:38:48,589 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 150.94/116.99 [2019-03-28 12:38:48,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 150.94/116.99 [2019-03-28 12:38:48,627 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic 150.94/116.99 [2019-03-28 12:38:48,627 INFO L258 seRefinementStrategy]: Advancing trace checker 150.94/116.99 [2019-03-28 12:38:48,627 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 150.94/116.99 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 150.94/116.99 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) 150.94/116.99 Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true 150.94/116.99 [2019-03-28 12:38:48,642 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 150.94/116.99 [2019-03-28 12:38:48,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 150.94/116.99 [2019-03-28 12:38:48,669 INFO L256 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 3 conjunts are in the unsatisfiable core 150.94/116.99 [2019-03-28 12:38:48,674 INFO L279 TraceCheckSpWp]: Computing forward predicates... 150.94/116.99 [2019-03-28 12:38:48,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 150.94/116.99 [2019-03-28 12:38:48,760 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 150.94/116.99 [2019-03-28 12:38:48,760 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 150.94/116.99 [2019-03-28 12:38:48,764 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 150.94/116.99 [2019-03-28 12:38:48,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 150.94/116.99 [2019-03-28 12:38:48,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 150.94/116.99 [2019-03-28 12:38:48,781 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 3 states. 150.94/116.99 [2019-03-28 12:38:52,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 150.94/116.99 [2019-03-28 12:38:52,122 INFO L93 Difference]: Finished difference Result 40 states and 4239 transitions. 150.94/116.99 [2019-03-28 12:38:52,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 150.94/116.99 [2019-03-28 12:38:52,123 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 150.94/116.99 [2019-03-28 12:38:52,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 150.94/116.99 [2019-03-28 12:38:52,138 INFO L225 Difference]: With dead ends: 40 150.94/116.99 [2019-03-28 12:38:52,138 INFO L226 Difference]: Without dead ends: 29 150.94/116.99 [2019-03-28 12:38:52,142 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 150.94/116.99 [2019-03-28 12:38:52,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. 150.94/116.99 [2019-03-28 12:38:52,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 18. 150.94/116.99 [2019-03-28 12:38:52,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. 150.94/116.99 [2019-03-28 12:38:52,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 94 transitions. 150.94/116.99 [2019-03-28 12:38:52,183 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 94 transitions. Word has length 8 150.94/116.99 [2019-03-28 12:38:52,184 INFO L84 Accepts]: Finished accepts. word is rejected. 150.94/116.99 [2019-03-28 12:38:52,184 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 94 transitions. 150.94/116.99 [2019-03-28 12:38:52,184 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 150.94/116.99 [2019-03-28 12:38:52,184 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 94 transitions. 150.94/116.99 [2019-03-28 12:38:52,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 150.94/116.99 [2019-03-28 12:38:52,185 INFO L394 BasicCegarLoop]: Found error trace 150.94/116.99 [2019-03-28 12:38:52,185 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] 150.94/116.99 [2019-03-28 12:38:52,185 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== 150.94/116.99 [2019-03-28 12:38:52,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 150.94/116.99 [2019-03-28 12:38:52,186 INFO L82 PathProgramCache]: Analyzing trace with hash -1379208027, now seen corresponding path program 1 times 150.94/116.99 [2019-03-28 12:38:52,186 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 150.94/116.99 [2019-03-28 12:38:52,186 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 150.94/116.99 [2019-03-28 12:38:52,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 150.94/116.99 [2019-03-28 12:38:52,187 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 150.94/116.99 [2019-03-28 12:38:52,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 150.94/116.99 [2019-03-28 12:38:52,192 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic 150.94/116.99 [2019-03-28 12:38:52,192 INFO L258 seRefinementStrategy]: Advancing trace checker 150.94/116.99 [2019-03-28 12:38:52,192 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 150.94/116.99 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 150.94/116.99 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) 150.94/116.99 Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true 150.94/116.99 [2019-03-28 12:38:52,209 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 150.94/116.99 [2019-03-28 12:38:52,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 150.94/116.99 [2019-03-28 12:38:52,223 INFO L256 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 3 conjunts are in the unsatisfiable core 150.94/116.99 [2019-03-28 12:38:52,224 INFO L279 TraceCheckSpWp]: Computing forward predicates... 150.94/116.99 [2019-03-28 12:38:52,230 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 150.94/116.99 [2019-03-28 12:38:52,257 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 150.94/116.99 [2019-03-28 12:38:52,257 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 150.94/116.99 [2019-03-28 12:38:52,259 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 150.94/116.99 [2019-03-28 12:38:52,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 150.94/116.99 [2019-03-28 12:38:52,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 150.94/116.99 [2019-03-28 12:38:52,260 INFO L87 Difference]: Start difference. First operand 18 states and 94 transitions. Second operand 3 states. 150.94/116.99 [2019-03-28 12:38:52,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 150.94/116.99 [2019-03-28 12:38:52,490 INFO L93 Difference]: Finished difference Result 42 states and 234 transitions. 150.94/116.99 [2019-03-28 12:38:52,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 150.94/116.99 [2019-03-28 12:38:52,490 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 150.94/116.99 [2019-03-28 12:38:52,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 150.94/116.99 [2019-03-28 12:38:52,492 INFO L225 Difference]: With dead ends: 42 150.94/116.99 [2019-03-28 12:38:52,492 INFO L226 Difference]: Without dead ends: 31 150.94/116.99 [2019-03-28 12:38:52,493 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 150.94/116.99 [2019-03-28 12:38:52,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. 150.94/116.99 [2019-03-28 12:38:52,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 20. 150.94/116.99 [2019-03-28 12:38:52,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. 150.94/116.99 [2019-03-28 12:38:52,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 115 transitions. 150.94/116.99 [2019-03-28 12:38:52,498 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 115 transitions. Word has length 8 150.94/116.99 [2019-03-28 12:38:52,499 INFO L84 Accepts]: Finished accepts. word is rejected. 150.94/116.99 [2019-03-28 12:38:52,499 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 115 transitions. 150.94/116.99 [2019-03-28 12:38:52,499 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 150.94/116.99 [2019-03-28 12:38:52,499 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 115 transitions. 150.94/116.99 [2019-03-28 12:38:52,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 150.94/116.99 [2019-03-28 12:38:52,500 INFO L394 BasicCegarLoop]: Found error trace 150.94/116.99 [2019-03-28 12:38:52,500 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] 150.94/116.99 [2019-03-28 12:38:52,500 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== 150.94/116.99 [2019-03-28 12:38:52,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 150.94/116.99 [2019-03-28 12:38:52,500 INFO L82 PathProgramCache]: Analyzing trace with hash -1379207066, now seen corresponding path program 1 times 150.94/116.99 [2019-03-28 12:38:52,500 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 150.94/116.99 [2019-03-28 12:38:52,501 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 150.94/116.99 [2019-03-28 12:38:52,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 150.94/116.99 [2019-03-28 12:38:52,502 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 150.94/116.99 [2019-03-28 12:38:52,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 150.94/116.99 [2019-03-28 12:38:52,505 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic 150.94/116.99 [2019-03-28 12:38:52,506 INFO L258 seRefinementStrategy]: Advancing trace checker 150.94/116.99 [2019-03-28 12:38:52,506 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 150.94/116.99 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 150.94/116.99 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) 150.94/116.99 Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true 150.94/116.99 [2019-03-28 12:38:52,519 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 150.94/116.99 [2019-03-28 12:38:52,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 150.94/116.99 [2019-03-28 12:38:52,530 INFO L256 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 6 conjunts are in the unsatisfiable core 150.94/116.99 [2019-03-28 12:38:52,531 INFO L279 TraceCheckSpWp]: Computing forward predicates... 150.94/116.99 [2019-03-28 12:38:52,581 INFO L340 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size 150.94/116.99 [2019-03-28 12:38:52,582 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 150.94/116.99 [2019-03-28 12:38:52,583 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 150.94/116.99 [2019-03-28 12:38:52,591 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 150.94/116.99 [2019-03-28 12:38:52,592 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 150.94/116.99 [2019-03-28 12:38:52,592 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:15 150.94/116.99 [2019-03-28 12:38:52,616 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 150.94/116.99 [2019-03-28 12:38:52,643 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 150.94/116.99 [2019-03-28 12:38:52,644 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 150.94/116.99 [2019-03-28 12:38:52,644 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 150.94/116.99 [2019-03-28 12:38:52,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 150.94/116.99 [2019-03-28 12:38:52,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 150.94/116.99 [2019-03-28 12:38:52,645 INFO L87 Difference]: Start difference. First operand 20 states and 115 transitions. Second operand 3 states. 150.94/116.99 [2019-03-28 12:38:52,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 150.94/116.99 [2019-03-28 12:38:52,791 INFO L93 Difference]: Finished difference Result 20 states and 115 transitions. 150.94/116.99 [2019-03-28 12:38:52,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 150.94/116.99 [2019-03-28 12:38:52,791 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 150.94/116.99 [2019-03-28 12:38:52,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 150.94/116.99 [2019-03-28 12:38:52,792 INFO L225 Difference]: With dead ends: 20 150.94/116.99 [2019-03-28 12:38:52,792 INFO L226 Difference]: Without dead ends: 18 150.94/116.99 [2019-03-28 12:38:52,793 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 150.94/116.99 [2019-03-28 12:38:52,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. 150.94/116.99 [2019-03-28 12:38:52,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. 150.94/116.99 [2019-03-28 12:38:52,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. 150.94/116.99 [2019-03-28 12:38:52,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 111 transitions. 150.94/116.99 [2019-03-28 12:38:52,797 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 111 transitions. Word has length 8 150.94/116.99 [2019-03-28 12:38:52,797 INFO L84 Accepts]: Finished accepts. word is rejected. 150.94/116.99 [2019-03-28 12:38:52,798 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 111 transitions. 150.94/116.99 [2019-03-28 12:38:52,798 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 150.94/116.99 [2019-03-28 12:38:52,798 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 111 transitions. 150.94/116.99 [2019-03-28 12:38:52,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 150.94/116.99 [2019-03-28 12:38:52,798 INFO L394 BasicCegarLoop]: Found error trace 150.94/116.99 [2019-03-28 12:38:52,799 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] 150.94/116.99 [2019-03-28 12:38:52,799 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== 150.94/116.99 [2019-03-28 12:38:52,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 150.94/116.99 [2019-03-28 12:38:52,799 INFO L82 PathProgramCache]: Analyzing trace with hash -1379207064, now seen corresponding path program 1 times 150.94/116.99 [2019-03-28 12:38:52,799 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 150.94/116.99 [2019-03-28 12:38:52,800 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 150.94/116.99 [2019-03-28 12:38:52,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 150.94/116.99 [2019-03-28 12:38:52,801 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 150.94/116.99 [2019-03-28 12:38:52,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 150.94/116.99 [2019-03-28 12:38:52,805 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic 150.94/116.99 [2019-03-28 12:38:52,805 INFO L258 seRefinementStrategy]: Advancing trace checker 150.94/116.99 [2019-03-28 12:38:52,805 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 150.94/116.99 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 150.94/116.99 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) 150.94/116.99 Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true 150.94/116.99 [2019-03-28 12:38:52,817 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 150.94/116.99 [2019-03-28 12:38:52,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 150.94/116.99 [2019-03-28 12:38:52,828 INFO L256 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 4 conjunts are in the unsatisfiable core 150.94/116.99 [2019-03-28 12:38:52,829 INFO L279 TraceCheckSpWp]: Computing forward predicates... 150.94/116.99 [2019-03-28 12:38:52,844 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 150.94/116.99 [2019-03-28 12:38:52,870 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 150.94/116.99 [2019-03-28 12:38:52,871 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 150.94/116.99 [2019-03-28 12:38:52,871 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states 150.94/116.99 [2019-03-28 12:38:52,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. 150.94/116.99 [2019-03-28 12:38:52,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 150.94/116.99 [2019-03-28 12:38:52,872 INFO L87 Difference]: Start difference. First operand 18 states and 111 transitions. Second operand 4 states. 150.94/116.99 [2019-03-28 12:38:52,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 150.94/116.99 [2019-03-28 12:38:52,986 INFO L93 Difference]: Finished difference Result 27 states and 163 transitions. 150.94/116.99 [2019-03-28 12:38:52,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 150.94/116.99 [2019-03-28 12:38:52,986 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 150.94/116.99 [2019-03-28 12:38:52,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 150.94/116.99 [2019-03-28 12:38:52,987 INFO L225 Difference]: With dead ends: 27 150.94/116.99 [2019-03-28 12:38:52,987 INFO L226 Difference]: Without dead ends: 18 150.94/116.99 [2019-03-28 12:38:52,988 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 150.94/116.99 [2019-03-28 12:38:52,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. 150.94/116.99 [2019-03-28 12:38:52,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. 150.94/116.99 [2019-03-28 12:38:52,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. 150.94/116.99 [2019-03-28 12:38:52,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 74 transitions. 150.94/116.99 [2019-03-28 12:38:52,992 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 74 transitions. Word has length 8 150.94/116.99 [2019-03-28 12:38:52,992 INFO L84 Accepts]: Finished accepts. word is rejected. 150.94/116.99 [2019-03-28 12:38:52,992 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 74 transitions. 150.94/116.99 [2019-03-28 12:38:52,993 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. 150.94/116.99 [2019-03-28 12:38:52,993 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 74 transitions. 150.94/116.99 [2019-03-28 12:38:52,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 150.94/116.99 [2019-03-28 12:38:52,993 INFO L394 BasicCegarLoop]: Found error trace 150.94/116.99 [2019-03-28 12:38:52,993 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] 150.94/116.99 [2019-03-28 12:38:52,994 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== 150.94/116.99 [2019-03-28 12:38:52,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 150.94/116.99 [2019-03-28 12:38:52,994 INFO L82 PathProgramCache]: Analyzing trace with hash -1379207063, now seen corresponding path program 1 times 150.94/116.99 [2019-03-28 12:38:52,994 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 150.94/116.99 [2019-03-28 12:38:52,994 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 150.94/116.99 [2019-03-28 12:38:52,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 150.94/116.99 [2019-03-28 12:38:52,995 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 150.94/116.99 [2019-03-28 12:38:52,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 150.94/116.99 [2019-03-28 12:38:52,999 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic 150.94/116.99 [2019-03-28 12:38:52,999 INFO L258 seRefinementStrategy]: Advancing trace checker 150.94/116.99 [2019-03-28 12:38:52,999 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 150.94/116.99 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 150.94/116.99 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) 150.94/116.99 Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true 150.94/116.99 [2019-03-28 12:38:53,011 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 150.94/116.99 [2019-03-28 12:38:53,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 150.94/116.99 [2019-03-28 12:38:53,021 INFO L256 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 10 conjunts are in the unsatisfiable core 150.94/116.99 [2019-03-28 12:38:53,022 INFO L279 TraceCheckSpWp]: Computing forward predicates... 150.94/116.99 [2019-03-28 12:38:53,034 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 10 treesize of output 8 150.94/116.99 [2019-03-28 12:38:53,035 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 150.94/116.99 [2019-03-28 12:38:53,042 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 150.94/116.99 [2019-03-28 12:38:53,047 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 150.94/116.99 [2019-03-28 12:38:53,047 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 150.94/116.99 [2019-03-28 12:38:53,056 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 150.94/116.99 [2019-03-28 12:38:53,057 INFO L427 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. 150.94/116.99 [2019-03-28 12:38:53,058 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:30, output treesize:27 150.94/116.99 [2019-03-28 12:38:53,088 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 150.94/116.99 [2019-03-28 12:38:53,115 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 150.94/116.99 [2019-03-28 12:38:53,115 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 150.94/116.99 [2019-03-28 12:38:53,115 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states 150.94/116.99 [2019-03-28 12:38:53,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. 150.94/116.99 [2019-03-28 12:38:53,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 150.94/116.99 [2019-03-28 12:38:53,116 INFO L87 Difference]: Start difference. First operand 18 states and 74 transitions. Second operand 5 states. 150.94/116.99 [2019-03-28 12:39:09,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 150.94/116.99 [2019-03-28 12:39:09,030 INFO L93 Difference]: Finished difference Result 29 states and 107 transitions. 150.94/116.99 [2019-03-28 12:39:09,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 150.94/116.99 [2019-03-28 12:39:09,031 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 150.94/116.99 [2019-03-28 12:39:09,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 150.94/116.99 [2019-03-28 12:39:09,032 INFO L225 Difference]: With dead ends: 29 150.94/116.99 [2019-03-28 12:39:09,032 INFO L226 Difference]: Without dead ends: 20 150.94/116.99 [2019-03-28 12:39:09,032 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 150.94/116.99 [2019-03-28 12:39:09,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. 150.94/116.99 [2019-03-28 12:39:09,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. 150.94/116.99 [2019-03-28 12:39:09,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. 150.94/116.99 [2019-03-28 12:39:09,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 53 transitions. 150.94/116.99 [2019-03-28 12:39:09,036 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 53 transitions. Word has length 8 150.94/116.99 [2019-03-28 12:39:09,037 INFO L84 Accepts]: Finished accepts. word is rejected. 150.94/116.99 [2019-03-28 12:39:09,037 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 53 transitions. 150.94/116.99 [2019-03-28 12:39:09,037 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. 150.94/116.99 [2019-03-28 12:39:09,037 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 53 transitions. 150.94/116.99 [2019-03-28 12:39:09,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 150.94/116.99 [2019-03-28 12:39:09,038 INFO L394 BasicCegarLoop]: Found error trace 150.94/116.99 [2019-03-28 12:39:09,038 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] 150.94/116.99 [2019-03-28 12:39:09,038 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== 150.94/116.99 [2019-03-28 12:39:09,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 150.94/116.99 [2019-03-28 12:39:09,038 INFO L82 PathProgramCache]: Analyzing trace with hash -1379176311, now seen corresponding path program 1 times 150.94/116.99 [2019-03-28 12:39:09,038 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 150.94/116.99 [2019-03-28 12:39:09,039 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 150.94/116.99 [2019-03-28 12:39:09,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 150.94/116.99 [2019-03-28 12:39:09,040 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 150.94/116.99 [2019-03-28 12:39:09,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 150.94/116.99 [2019-03-28 12:39:09,043 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic 150.94/116.99 [2019-03-28 12:39:09,044 INFO L258 seRefinementStrategy]: Advancing trace checker 150.94/116.99 [2019-03-28 12:39:09,044 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 150.94/116.99 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 150.94/116.99 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) 150.94/116.99 Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true 150.94/116.99 [2019-03-28 12:39:09,055 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 150.94/116.99 [2019-03-28 12:39:09,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 150.94/116.99 [2019-03-28 12:39:09,064 INFO L256 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 3 conjunts are in the unsatisfiable core 150.94/116.99 [2019-03-28 12:39:09,065 INFO L279 TraceCheckSpWp]: Computing forward predicates... 150.94/116.99 [2019-03-28 12:39:09,069 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 150.94/116.99 [2019-03-28 12:39:09,095 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 150.94/116.99 [2019-03-28 12:39:09,096 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 150.94/116.99 [2019-03-28 12:39:09,096 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 150.94/116.99 [2019-03-28 12:39:09,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 150.94/116.99 [2019-03-28 12:39:09,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 150.94/116.99 [2019-03-28 12:39:09,097 INFO L87 Difference]: Start difference. First operand 20 states and 53 transitions. Second operand 3 states. 150.94/116.99 [2019-03-28 12:39:09,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 150.94/116.99 [2019-03-28 12:39:09,169 INFO L93 Difference]: Finished difference Result 42 states and 97 transitions. 150.94/116.99 [2019-03-28 12:39:09,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 150.94/116.99 [2019-03-28 12:39:09,169 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 150.94/116.99 [2019-03-28 12:39:09,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 150.94/116.99 [2019-03-28 12:39:09,170 INFO L225 Difference]: With dead ends: 42 150.94/116.99 [2019-03-28 12:39:09,170 INFO L226 Difference]: Without dead ends: 31 150.94/116.99 [2019-03-28 12:39:09,171 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 150.94/116.99 [2019-03-28 12:39:09,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. 150.94/116.99 [2019-03-28 12:39:09,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 20. 150.94/116.99 [2019-03-28 12:39:09,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. 150.94/116.99 [2019-03-28 12:39:09,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 50 transitions. 150.94/116.99 [2019-03-28 12:39:09,175 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 50 transitions. Word has length 8 150.94/116.99 [2019-03-28 12:39:09,176 INFO L84 Accepts]: Finished accepts. word is rejected. 150.94/116.99 [2019-03-28 12:39:09,176 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 50 transitions. 150.94/116.99 [2019-03-28 12:39:09,176 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 150.94/116.99 [2019-03-28 12:39:09,176 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 50 transitions. 150.94/116.99 [2019-03-28 12:39:09,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 150.94/116.99 [2019-03-28 12:39:09,176 INFO L394 BasicCegarLoop]: Found error trace 150.94/116.99 [2019-03-28 12:39:09,177 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] 150.94/116.99 [2019-03-28 12:39:09,177 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== 150.94/116.99 [2019-03-28 12:39:09,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 150.94/116.99 [2019-03-28 12:39:09,177 INFO L82 PathProgramCache]: Analyzing trace with hash -1379190726, now seen corresponding path program 1 times 150.94/116.99 [2019-03-28 12:39:09,177 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 150.94/116.99 [2019-03-28 12:39:09,177 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 150.94/116.99 [2019-03-28 12:39:09,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 150.94/116.99 [2019-03-28 12:39:09,179 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 150.94/116.99 [2019-03-28 12:39:09,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 150.94/116.99 [2019-03-28 12:39:09,182 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic 150.94/116.99 [2019-03-28 12:39:09,182 INFO L258 seRefinementStrategy]: Advancing trace checker 150.94/116.99 [2019-03-28 12:39:09,182 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 150.94/116.99 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 150.94/116.99 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) 150.94/116.99 Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true 150.94/116.99 [2019-03-28 12:39:09,193 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 150.94/116.99 [2019-03-28 12:39:09,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 150.94/116.99 [2019-03-28 12:39:09,202 INFO L256 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 3 conjunts are in the unsatisfiable core 150.94/116.99 [2019-03-28 12:39:09,203 INFO L279 TraceCheckSpWp]: Computing forward predicates... 150.94/116.99 [2019-03-28 12:39:09,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 150.94/116.99 [2019-03-28 12:39:09,233 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 150.94/116.99 [2019-03-28 12:39:09,234 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 150.94/116.99 [2019-03-28 12:39:09,234 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 150.94/116.99 [2019-03-28 12:39:09,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 150.94/116.99 [2019-03-28 12:39:09,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 150.94/116.99 [2019-03-28 12:39:09,235 INFO L87 Difference]: Start difference. First operand 20 states and 50 transitions. Second operand 3 states. 150.94/116.99 [2019-03-28 12:39:09,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 150.94/116.99 [2019-03-28 12:39:09,277 INFO L93 Difference]: Finished difference Result 31 states and 72 transitions. 150.94/116.99 [2019-03-28 12:39:09,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 150.94/116.99 [2019-03-28 12:39:09,277 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 150.94/116.99 [2019-03-28 12:39:09,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 150.94/116.99 [2019-03-28 12:39:09,278 INFO L225 Difference]: With dead ends: 31 150.94/116.99 [2019-03-28 12:39:09,278 INFO L226 Difference]: Without dead ends: 20 150.94/116.99 [2019-03-28 12:39:09,278 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 150.94/116.99 [2019-03-28 12:39:09,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. 150.94/116.99 [2019-03-28 12:39:09,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. 150.94/116.99 [2019-03-28 12:39:09,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. 150.94/116.99 [2019-03-28 12:39:09,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 44 transitions. 150.94/116.99 [2019-03-28 12:39:09,282 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 44 transitions. Word has length 8 150.94/116.99 [2019-03-28 12:39:09,283 INFO L84 Accepts]: Finished accepts. word is rejected. 150.94/116.99 [2019-03-28 12:39:09,283 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 44 transitions. 150.94/116.99 [2019-03-28 12:39:09,283 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 150.94/116.99 [2019-03-28 12:39:09,283 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 44 transitions. 150.94/116.99 [2019-03-28 12:39:09,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 150.94/116.99 [2019-03-28 12:39:09,284 INFO L394 BasicCegarLoop]: Found error trace 150.94/116.99 [2019-03-28 12:39:09,284 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] 150.94/116.99 [2019-03-28 12:39:09,284 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== 150.94/116.99 [2019-03-28 12:39:09,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 150.94/116.99 [2019-03-28 12:39:09,284 INFO L82 PathProgramCache]: Analyzing trace with hash -1379184960, now seen corresponding path program 1 times 150.94/116.99 [2019-03-28 12:39:09,284 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 150.94/116.99 [2019-03-28 12:39:09,285 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 150.94/116.99 [2019-03-28 12:39:09,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 150.94/116.99 [2019-03-28 12:39:09,286 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 150.94/116.99 [2019-03-28 12:39:09,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 150.94/116.99 [2019-03-28 12:39:09,289 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic 150.94/116.99 [2019-03-28 12:39:09,289 INFO L258 seRefinementStrategy]: Advancing trace checker 150.94/116.99 [2019-03-28 12:39:09,289 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 150.94/116.99 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 150.94/116.99 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) 150.94/116.99 Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true 150.94/116.99 [2019-03-28 12:39:09,303 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 150.94/116.99 [2019-03-28 12:39:09,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 150.94/116.99 [2019-03-28 12:39:09,312 INFO L256 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 10 conjunts are in the unsatisfiable core 150.94/116.99 [2019-03-28 12:39:09,313 INFO L279 TraceCheckSpWp]: Computing forward predicates... 150.94/116.99 [2019-03-28 12:39:09,325 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 10 treesize of output 8 150.94/116.99 [2019-03-28 12:39:09,325 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 150.94/116.99 [2019-03-28 12:39:09,333 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 150.94/116.99 [2019-03-28 12:39:09,336 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 150.94/116.99 [2019-03-28 12:39:09,336 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 150.94/116.99 [2019-03-28 12:39:09,346 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 150.94/116.99 [2019-03-28 12:39:09,347 INFO L427 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. 150.94/116.99 [2019-03-28 12:39:09,347 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:30, output treesize:27 150.94/116.99 [2019-03-28 12:39:09,378 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 150.94/116.99 [2019-03-28 12:39:09,404 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 150.94/116.99 [2019-03-28 12:39:09,404 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 150.94/116.99 [2019-03-28 12:39:09,405 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states 150.94/116.99 [2019-03-28 12:39:09,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. 150.94/116.99 [2019-03-28 12:39:09,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 150.94/116.99 [2019-03-28 12:39:09,405 INFO L87 Difference]: Start difference. First operand 20 states and 44 transitions. Second operand 5 states. 150.94/116.99 [2019-03-28 12:39:09,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 150.94/116.99 [2019-03-28 12:39:09,617 INFO L93 Difference]: Finished difference Result 29 states and 64 transitions. 150.94/116.99 [2019-03-28 12:39:09,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 150.94/116.99 [2019-03-28 12:39:09,618 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 150.94/116.99 [2019-03-28 12:39:09,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 150.94/116.99 [2019-03-28 12:39:09,618 INFO L225 Difference]: With dead ends: 29 150.94/116.99 [2019-03-28 12:39:09,618 INFO L226 Difference]: Without dead ends: 22 150.94/116.99 [2019-03-28 12:39:09,619 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 150.94/116.99 [2019-03-28 12:39:09,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. 150.94/116.99 [2019-03-28 12:39:09,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 20. 150.94/116.99 [2019-03-28 12:39:09,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. 150.94/116.99 [2019-03-28 12:39:09,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 44 transitions. 150.94/116.99 [2019-03-28 12:39:09,623 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 44 transitions. Word has length 8 150.94/116.99 [2019-03-28 12:39:09,623 INFO L84 Accepts]: Finished accepts. word is rejected. 150.94/116.99 [2019-03-28 12:39:09,623 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 44 transitions. 150.94/116.99 [2019-03-28 12:39:09,623 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. 150.94/116.99 [2019-03-28 12:39:09,624 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 44 transitions. 150.94/116.99 [2019-03-28 12:39:09,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 150.94/116.99 [2019-03-28 12:39:09,624 INFO L394 BasicCegarLoop]: Found error trace 150.94/116.99 [2019-03-28 12:39:09,624 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] 150.94/116.99 [2019-03-28 12:39:09,624 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== 150.94/116.99 [2019-03-28 12:39:09,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 150.94/116.99 [2019-03-28 12:39:09,625 INFO L82 PathProgramCache]: Analyzing trace with hash 1728250565, now seen corresponding path program 1 times 150.94/116.99 [2019-03-28 12:39:09,625 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 150.94/116.99 [2019-03-28 12:39:09,625 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 150.94/116.99 [2019-03-28 12:39:09,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 150.94/116.99 [2019-03-28 12:39:09,626 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 150.94/116.99 [2019-03-28 12:39:09,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 150.94/116.99 [2019-03-28 12:39:09,630 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic 150.94/116.99 [2019-03-28 12:39:09,630 INFO L258 seRefinementStrategy]: Advancing trace checker 150.94/116.99 [2019-03-28 12:39:09,630 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 150.94/116.99 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 150.94/116.99 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) 150.94/116.99 Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true 150.94/116.99 [2019-03-28 12:39:09,641 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 150.94/116.99 [2019-03-28 12:39:09,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 150.94/116.99 [2019-03-28 12:39:09,652 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 4 conjunts are in the unsatisfiable core 150.94/116.99 [2019-03-28 12:39:09,652 INFO L279 TraceCheckSpWp]: Computing forward predicates... 150.94/116.99 [2019-03-28 12:39:09,669 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 150.94/116.99 [2019-03-28 12:39:09,696 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 150.94/116.99 [2019-03-28 12:39:09,696 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 150.94/116.99 [2019-03-28 12:39:09,696 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states 150.94/116.99 [2019-03-28 12:39:09,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. 150.94/116.99 [2019-03-28 12:39:09,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 150.94/116.99 [2019-03-28 12:39:09,697 INFO L87 Difference]: Start difference. First operand 20 states and 44 transitions. Second operand 5 states. 150.94/116.99 [2019-03-28 12:39:09,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 150.94/116.99 [2019-03-28 12:39:09,802 INFO L93 Difference]: Finished difference Result 45 states and 103 transitions. 150.94/116.99 [2019-03-28 12:39:09,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 150.94/116.99 [2019-03-28 12:39:09,802 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 150.94/116.99 [2019-03-28 12:39:09,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 150.94/116.99 [2019-03-28 12:39:09,803 INFO L225 Difference]: With dead ends: 45 150.94/116.99 [2019-03-28 12:39:09,803 INFO L226 Difference]: Without dead ends: 36 150.94/116.99 [2019-03-28 12:39:09,804 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 150.94/116.99 [2019-03-28 12:39:09,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. 150.94/116.99 [2019-03-28 12:39:09,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 30. 150.94/116.99 [2019-03-28 12:39:09,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. 150.94/116.99 [2019-03-28 12:39:09,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 66 transitions. 150.94/116.99 [2019-03-28 12:39:09,809 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 66 transitions. Word has length 10 150.94/116.99 [2019-03-28 12:39:09,809 INFO L84 Accepts]: Finished accepts. word is rejected. 150.94/116.99 [2019-03-28 12:39:09,809 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 66 transitions. 150.94/116.99 [2019-03-28 12:39:09,809 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. 150.94/116.99 [2019-03-28 12:39:09,809 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 66 transitions. 150.94/116.99 [2019-03-28 12:39:09,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 150.94/116.99 [2019-03-28 12:39:09,810 INFO L394 BasicCegarLoop]: Found error trace 150.94/116.99 [2019-03-28 12:39:09,810 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] 150.94/116.99 [2019-03-28 12:39:09,810 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== 150.94/116.99 [2019-03-28 12:39:09,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 150.94/116.99 [2019-03-28 12:39:09,811 INFO L82 PathProgramCache]: Analyzing trace with hash -275717403, now seen corresponding path program 1 times 150.94/116.99 [2019-03-28 12:39:09,811 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 150.94/116.99 [2019-03-28 12:39:09,811 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 150.94/116.99 [2019-03-28 12:39:09,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 150.94/116.99 [2019-03-28 12:39:09,812 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 150.94/116.99 [2019-03-28 12:39:09,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 150.94/116.99 [2019-03-28 12:39:09,816 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic 150.94/116.99 [2019-03-28 12:39:09,816 INFO L258 seRefinementStrategy]: Advancing trace checker 150.94/116.99 [2019-03-28 12:39:09,816 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 150.94/116.99 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 150.94/116.99 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) 150.94/116.99 Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true 150.94/116.99 [2019-03-28 12:39:09,827 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 150.94/116.99 [2019-03-28 12:39:09,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 150.94/116.99 [2019-03-28 12:39:09,838 INFO L256 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 9 conjunts are in the unsatisfiable core 150.94/116.99 [2019-03-28 12:39:09,839 INFO L279 TraceCheckSpWp]: Computing forward predicates... 150.94/116.99 [2019-03-28 12:39:09,848 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 10 treesize of output 8 150.94/116.99 [2019-03-28 12:39:09,849 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 150.94/116.99 [2019-03-28 12:39:09,856 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 150.94/116.99 [2019-03-28 12:39:09,859 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 150.94/116.99 [2019-03-28 12:39:09,859 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 150.94/116.99 [2019-03-28 12:39:09,867 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 150.94/116.99 [2019-03-28 12:39:09,868 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. 150.94/116.99 [2019-03-28 12:39:09,869 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:27, output treesize:24 150.94/116.99 [2019-03-28 12:39:09,898 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. 150.94/116.99 [2019-03-28 12:39:09,925 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. 150.94/116.99 [2019-03-28 12:39:09,925 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 150.94/116.99 [2019-03-28 12:39:09,926 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states 150.94/116.99 [2019-03-28 12:39:09,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. 150.94/116.99 [2019-03-28 12:39:09,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 150.94/116.99 [2019-03-28 12:39:09,926 INFO L87 Difference]: Start difference. First operand 30 states and 66 transitions. Second operand 4 states. 150.94/116.99 [2019-03-28 12:39:10,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 150.94/116.99 [2019-03-28 12:39:10,708 INFO L93 Difference]: Finished difference Result 30 states and 66 transitions. 150.94/116.99 [2019-03-28 12:39:10,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 150.94/116.99 [2019-03-28 12:39:10,708 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 150.94/116.99 [2019-03-28 12:39:10,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 150.94/116.99 [2019-03-28 12:39:10,709 INFO L225 Difference]: With dead ends: 30 150.94/116.99 [2019-03-28 12:39:10,709 INFO L226 Difference]: Without dead ends: 29 150.94/116.99 [2019-03-28 12:39:10,710 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 150.94/116.99 [2019-03-28 12:39:10,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. 150.94/116.99 [2019-03-28 12:39:10,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. 150.94/116.99 [2019-03-28 12:39:10,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. 150.94/116.99 [2019-03-28 12:39:10,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 64 transitions. 150.94/116.99 [2019-03-28 12:39:10,716 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 64 transitions. Word has length 10 150.94/116.99 [2019-03-28 12:39:10,716 INFO L84 Accepts]: Finished accepts. word is rejected. 150.94/116.99 [2019-03-28 12:39:10,716 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 64 transitions. 150.94/116.99 [2019-03-28 12:39:10,716 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. 150.94/116.99 [2019-03-28 12:39:10,716 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 64 transitions. 150.94/116.99 [2019-03-28 12:39:10,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 150.94/116.99 [2019-03-28 12:39:10,717 INFO L394 BasicCegarLoop]: Found error trace 150.94/116.99 [2019-03-28 12:39:10,717 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 150.94/116.99 [2019-03-28 12:39:10,717 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== 150.94/116.99 [2019-03-28 12:39:10,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 150.94/116.99 [2019-03-28 12:39:10,718 INFO L82 PathProgramCache]: Analyzing trace with hash 2037537744, now seen corresponding path program 1 times 150.94/116.99 [2019-03-28 12:39:10,718 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 150.94/116.99 [2019-03-28 12:39:10,718 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 150.94/116.99 [2019-03-28 12:39:10,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 150.94/116.99 [2019-03-28 12:39:10,719 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 150.94/116.99 [2019-03-28 12:39:10,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 150.94/116.99 [2019-03-28 12:39:10,722 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic 150.94/116.99 [2019-03-28 12:39:10,722 INFO L258 seRefinementStrategy]: Advancing trace checker 150.94/116.99 [2019-03-28 12:39:10,722 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 150.94/116.99 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 150.94/116.99 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) 150.94/116.99 Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true 150.94/116.99 [2019-03-28 12:39:10,734 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 150.94/116.99 [2019-03-28 12:39:10,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 150.94/116.99 [2019-03-28 12:39:10,745 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 7 conjunts are in the unsatisfiable core 150.94/116.99 [2019-03-28 12:39:10,746 INFO L279 TraceCheckSpWp]: Computing forward predicates... 150.94/116.99 [2019-03-28 12:39:10,760 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. 150.94/116.99 [2019-03-28 12:39:10,786 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 150.94/116.99 [2019-03-28 12:39:10,786 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 150.94/116.99 [2019-03-28 12:39:10,786 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states 150.94/116.99 [2019-03-28 12:39:10,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. 150.94/116.99 [2019-03-28 12:39:10,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 150.94/116.99 [2019-03-28 12:39:10,787 INFO L87 Difference]: Start difference. First operand 28 states and 64 transitions. Second operand 4 states. 150.94/116.99 [2019-03-28 12:39:10,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 150.94/116.99 [2019-03-28 12:39:10,868 INFO L93 Difference]: Finished difference Result 35 states and 80 transitions. 150.94/116.99 [2019-03-28 12:39:10,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 150.94/116.99 [2019-03-28 12:39:10,868 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 150.94/116.99 [2019-03-28 12:39:10,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 150.94/116.99 [2019-03-28 12:39:10,870 INFO L225 Difference]: With dead ends: 35 150.94/116.99 [2019-03-28 12:39:10,870 INFO L226 Difference]: Without dead ends: 34 150.94/116.99 [2019-03-28 12:39:10,870 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 150.94/116.99 [2019-03-28 12:39:10,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. 150.94/116.99 [2019-03-28 12:39:10,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 31. 150.94/116.99 [2019-03-28 12:39:10,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. 150.94/116.99 [2019-03-28 12:39:10,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 77 transitions. 150.94/116.99 [2019-03-28 12:39:10,877 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 77 transitions. Word has length 11 150.94/116.99 [2019-03-28 12:39:10,877 INFO L84 Accepts]: Finished accepts. word is rejected. 150.94/116.99 [2019-03-28 12:39:10,878 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 77 transitions. 150.94/116.99 [2019-03-28 12:39:10,878 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. 150.94/116.99 [2019-03-28 12:39:10,878 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 77 transitions. 150.94/116.99 [2019-03-28 12:39:10,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 150.94/116.99 [2019-03-28 12:39:10,878 INFO L394 BasicCegarLoop]: Found error trace 150.94/116.99 [2019-03-28 12:39:10,879 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 150.94/116.99 [2019-03-28 12:39:10,879 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== 150.94/116.99 [2019-03-28 12:39:10,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 150.94/116.99 [2019-03-28 12:39:10,879 INFO L82 PathProgramCache]: Analyzing trace with hash 2037537735, now seen corresponding path program 1 times 150.94/116.99 [2019-03-28 12:39:10,879 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 150.94/116.99 [2019-03-28 12:39:10,879 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 150.94/116.99 [2019-03-28 12:39:10,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 150.94/116.99 [2019-03-28 12:39:10,880 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 150.94/116.99 [2019-03-28 12:39:10,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 150.94/116.99 [2019-03-28 12:39:10,883 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic 150.94/116.99 [2019-03-28 12:39:10,884 INFO L258 seRefinementStrategy]: Advancing trace checker 150.94/116.99 [2019-03-28 12:39:10,884 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 150.94/116.99 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 150.94/116.99 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) 150.94/116.99 Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true 150.94/116.99 [2019-03-28 12:39:10,896 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 150.94/116.99 [2019-03-28 12:39:10,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 150.94/116.99 [2019-03-28 12:39:10,910 INFO L256 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 5 conjunts are in the unsatisfiable core 150.94/116.99 [2019-03-28 12:39:10,910 INFO L279 TraceCheckSpWp]: Computing forward predicates... 150.94/116.99 [2019-03-28 12:39:10,936 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 150.94/116.99 [2019-03-28 12:39:10,962 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. 150.94/116.99 [2019-03-28 12:39:10,962 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 150.94/116.99 [2019-03-28 12:39:10,962 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states 150.94/116.99 [2019-03-28 12:39:10,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. 150.94/116.99 [2019-03-28 12:39:10,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 150.94/116.99 [2019-03-28 12:39:10,963 INFO L87 Difference]: Start difference. First operand 31 states and 77 transitions. Second operand 5 states. 150.94/116.99 [2019-03-28 12:39:11,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 150.94/116.99 [2019-03-28 12:39:11,107 INFO L93 Difference]: Finished difference Result 34 states and 77 transitions. 150.94/116.99 [2019-03-28 12:39:11,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 150.94/116.99 [2019-03-28 12:39:11,109 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 150.94/116.99 [2019-03-28 12:39:11,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 150.94/116.99 [2019-03-28 12:39:11,110 INFO L225 Difference]: With dead ends: 34 150.94/116.99 [2019-03-28 12:39:11,110 INFO L226 Difference]: Without dead ends: 33 150.94/116.99 [2019-03-28 12:39:11,111 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 150.94/116.99 [2019-03-28 12:39:11,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. 150.94/116.99 [2019-03-28 12:39:11,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 31. 150.94/116.99 [2019-03-28 12:39:11,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. 150.94/116.99 [2019-03-28 12:39:11,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 76 transitions. 150.94/116.99 [2019-03-28 12:39:11,120 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 76 transitions. Word has length 11 150.94/116.99 [2019-03-28 12:39:11,120 INFO L84 Accepts]: Finished accepts. word is rejected. 150.94/116.99 [2019-03-28 12:39:11,120 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 76 transitions. 150.94/116.99 [2019-03-28 12:39:11,121 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. 150.94/116.99 [2019-03-28 12:39:11,121 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 76 transitions. 150.94/116.99 [2019-03-28 12:39:11,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 150.94/116.99 [2019-03-28 12:39:11,121 INFO L394 BasicCegarLoop]: Found error trace 150.94/116.99 [2019-03-28 12:39:11,121 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 150.94/116.99 [2019-03-28 12:39:11,122 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== 150.94/116.99 [2019-03-28 12:39:11,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 150.94/116.99 [2019-03-28 12:39:11,122 INFO L82 PathProgramCache]: Analyzing trace with hash 44072880, now seen corresponding path program 1 times 150.94/116.99 [2019-03-28 12:39:11,122 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 150.94/116.99 [2019-03-28 12:39:11,122 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 150.94/116.99 [2019-03-28 12:39:11,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 150.94/116.99 [2019-03-28 12:39:11,123 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 150.94/116.99 [2019-03-28 12:39:11,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 150.94/116.99 [2019-03-28 12:39:11,126 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic 150.94/116.99 [2019-03-28 12:39:11,126 INFO L258 seRefinementStrategy]: Advancing trace checker 150.94/116.99 [2019-03-28 12:39:11,127 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 150.94/116.99 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 150.94/116.99 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) 150.94/116.99 Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true 150.94/116.99 [2019-03-28 12:39:11,139 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 150.94/116.99 [2019-03-28 12:39:11,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 150.94/116.99 [2019-03-28 12:39:11,153 INFO L256 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 4 conjunts are in the unsatisfiable core 150.94/116.99 [2019-03-28 12:39:11,154 INFO L279 TraceCheckSpWp]: Computing forward predicates... 150.94/116.99 [2019-03-28 12:39:11,164 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. 150.94/116.99 [2019-03-28 12:39:11,190 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 150.94/116.99 [2019-03-28 12:39:11,191 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 150.94/116.99 [2019-03-28 12:39:11,191 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states 150.94/116.99 [2019-03-28 12:39:11,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. 150.94/116.99 [2019-03-28 12:39:11,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 150.94/116.99 [2019-03-28 12:39:11,192 INFO L87 Difference]: Start difference. First operand 31 states and 76 transitions. Second operand 4 states. 150.94/116.99 [2019-03-28 12:39:11,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 150.94/116.99 [2019-03-28 12:39:11,241 INFO L93 Difference]: Finished difference Result 32 states and 76 transitions. 150.94/116.99 [2019-03-28 12:39:11,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 150.94/116.99 [2019-03-28 12:39:11,242 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 150.94/116.99 [2019-03-28 12:39:11,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 150.94/116.99 [2019-03-28 12:39:11,242 INFO L225 Difference]: With dead ends: 32 150.94/116.99 [2019-03-28 12:39:11,243 INFO L226 Difference]: Without dead ends: 31 150.94/116.99 [2019-03-28 12:39:11,243 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 150.94/116.99 [2019-03-28 12:39:11,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. 150.94/116.99 [2019-03-28 12:39:11,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. 150.94/116.99 [2019-03-28 12:39:11,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. 150.94/116.99 [2019-03-28 12:39:11,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 73 transitions. 150.94/116.99 [2019-03-28 12:39:11,249 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 73 transitions. Word has length 11 150.94/116.99 [2019-03-28 12:39:11,249 INFO L84 Accepts]: Finished accepts. word is rejected. 150.94/116.99 [2019-03-28 12:39:11,249 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 73 transitions. 150.94/116.99 [2019-03-28 12:39:11,249 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. 150.94/116.99 [2019-03-28 12:39:11,249 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 73 transitions. 150.94/116.99 [2019-03-28 12:39:11,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 150.94/116.99 [2019-03-28 12:39:11,250 INFO L394 BasicCegarLoop]: Found error trace 150.94/116.99 [2019-03-28 12:39:11,250 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 150.94/116.99 [2019-03-28 12:39:11,250 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== 150.94/116.99 [2019-03-28 12:39:11,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 150.94/116.99 [2019-03-28 12:39:11,250 INFO L82 PathProgramCache]: Analyzing trace with hash 44072871, now seen corresponding path program 1 times 150.94/116.99 [2019-03-28 12:39:11,250 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 150.94/116.99 [2019-03-28 12:39:11,251 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 150.94/116.99 [2019-03-28 12:39:11,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 150.94/116.99 [2019-03-28 12:39:11,252 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 150.94/116.99 [2019-03-28 12:39:11,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 150.94/116.99 [2019-03-28 12:39:11,254 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic 150.94/116.99 [2019-03-28 12:39:11,255 INFO L258 seRefinementStrategy]: Advancing trace checker 150.94/116.99 [2019-03-28 12:39:11,255 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 150.94/116.99 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 150.94/116.99 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) 150.94/116.99 Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true 150.94/116.99 [2019-03-28 12:39:11,266 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 150.94/116.99 [2019-03-28 12:39:11,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 150.94/116.99 [2019-03-28 12:39:11,279 INFO L256 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 5 conjunts are in the unsatisfiable core 150.94/116.99 [2019-03-28 12:39:11,281 INFO L279 TraceCheckSpWp]: Computing forward predicates... 150.94/116.99 [2019-03-28 12:39:11,328 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 150.94/116.99 [2019-03-28 12:39:11,355 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 150.94/116.99 [2019-03-28 12:39:11,355 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 150.94/116.99 [2019-03-28 12:39:11,356 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states 150.94/116.99 [2019-03-28 12:39:11,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. 150.94/116.99 [2019-03-28 12:39:11,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 150.94/116.99 [2019-03-28 12:39:11,356 INFO L87 Difference]: Start difference. First operand 31 states and 73 transitions. Second operand 5 states. 150.94/116.99 [2019-03-28 12:39:11,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 150.94/116.99 [2019-03-28 12:39:11,439 INFO L93 Difference]: Finished difference Result 32 states and 74 transitions. 150.94/116.99 [2019-03-28 12:39:11,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 150.94/116.99 [2019-03-28 12:39:11,440 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 150.94/116.99 [2019-03-28 12:39:11,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 150.94/116.99 [2019-03-28 12:39:11,441 INFO L225 Difference]: With dead ends: 32 150.94/116.99 [2019-03-28 12:39:11,441 INFO L226 Difference]: Without dead ends: 31 150.94/116.99 [2019-03-28 12:39:11,441 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 150.94/116.99 [2019-03-28 12:39:11,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. 150.94/116.99 [2019-03-28 12:39:11,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 27. 150.94/116.99 [2019-03-28 12:39:11,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. 150.94/116.99 [2019-03-28 12:39:11,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 60 transitions. 150.94/116.99 [2019-03-28 12:39:11,447 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 60 transitions. Word has length 11 150.94/116.99 [2019-03-28 12:39:11,447 INFO L84 Accepts]: Finished accepts. word is rejected. 150.94/116.99 [2019-03-28 12:39:11,447 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 60 transitions. 150.94/116.99 [2019-03-28 12:39:11,447 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. 150.94/116.99 [2019-03-28 12:39:11,447 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 60 transitions. 150.94/116.99 [2019-03-28 12:39:11,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 150.94/116.99 [2019-03-28 12:39:11,448 INFO L394 BasicCegarLoop]: Found error trace 150.94/116.99 [2019-03-28 12:39:11,448 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 150.94/116.99 [2019-03-28 12:39:11,448 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== 150.94/116.99 [2019-03-28 12:39:11,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 150.94/116.99 [2019-03-28 12:39:11,449 INFO L82 PathProgramCache]: Analyzing trace with hash -1260859089, now seen corresponding path program 1 times 150.94/116.99 [2019-03-28 12:39:11,449 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 150.94/117.00 [2019-03-28 12:39:11,449 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 150.94/117.00 [2019-03-28 12:39:11,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 150.94/117.00 [2019-03-28 12:39:11,450 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 150.94/117.00 [2019-03-28 12:39:11,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 150.94/117.00 [2019-03-28 12:39:11,453 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic 150.94/117.00 [2019-03-28 12:39:11,454 INFO L258 seRefinementStrategy]: Advancing trace checker 150.94/117.00 [2019-03-28 12:39:11,454 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 150.94/117.00 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 150.94/117.00 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) 150.94/117.00 Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true 150.94/117.00 [2019-03-28 12:39:11,470 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 150.94/117.00 [2019-03-28 12:39:11,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 150.94/117.00 [2019-03-28 12:39:11,486 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 4 conjunts are in the unsatisfiable core 150.94/117.00 [2019-03-28 12:39:11,487 INFO L279 TraceCheckSpWp]: Computing forward predicates... 150.94/117.00 [2019-03-28 12:39:11,503 INFO L340 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size 150.94/117.00 [2019-03-28 12:39:11,503 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 11 150.94/117.00 [2019-03-28 12:39:11,504 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 150.94/117.00 [2019-03-28 12:39:11,509 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 150.94/117.00 [2019-03-28 12:39:11,510 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 150.94/117.00 [2019-03-28 12:39:11,510 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:9, output treesize:11 150.94/117.00 [2019-03-28 12:39:11,521 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. 150.94/117.00 [2019-03-28 12:39:11,547 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 150.94/117.00 [2019-03-28 12:39:11,548 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 150.94/117.00 [2019-03-28 12:39:11,548 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 150.94/117.00 [2019-03-28 12:39:11,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 150.94/117.00 [2019-03-28 12:39:11,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 150.94/117.00 [2019-03-28 12:39:11,549 INFO L87 Difference]: Start difference. First operand 27 states and 60 transitions. Second operand 3 states. 150.94/117.00 [2019-03-28 12:39:11,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 150.94/117.00 [2019-03-28 12:39:11,596 INFO L93 Difference]: Finished difference Result 27 states and 60 transitions. 150.94/117.00 [2019-03-28 12:39:11,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 150.94/117.00 [2019-03-28 12:39:11,596 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 150.94/117.00 [2019-03-28 12:39:11,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 150.94/117.00 [2019-03-28 12:39:11,597 INFO L225 Difference]: With dead ends: 27 150.94/117.00 [2019-03-28 12:39:11,597 INFO L226 Difference]: Without dead ends: 26 150.94/117.00 [2019-03-28 12:39:11,597 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 150.94/117.00 [2019-03-28 12:39:11,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. 150.94/117.00 [2019-03-28 12:39:11,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. 150.94/117.00 [2019-03-28 12:39:11,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. 150.94/117.00 [2019-03-28 12:39:11,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 58 transitions. 150.94/117.00 [2019-03-28 12:39:11,603 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 58 transitions. Word has length 12 150.94/117.00 [2019-03-28 12:39:11,603 INFO L84 Accepts]: Finished accepts. word is rejected. 150.94/117.00 [2019-03-28 12:39:11,603 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 58 transitions. 150.94/117.00 [2019-03-28 12:39:11,603 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 150.94/117.00 [2019-03-28 12:39:11,604 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 58 transitions. 150.94/117.00 [2019-03-28 12:39:11,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 150.94/117.00 [2019-03-28 12:39:11,604 INFO L394 BasicCegarLoop]: Found error trace 150.94/117.00 [2019-03-28 12:39:11,604 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 150.94/117.00 [2019-03-28 12:39:11,604 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== 150.94/117.00 [2019-03-28 12:39:11,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 150.94/117.00 [2019-03-28 12:39:11,605 INFO L82 PathProgramCache]: Analyzing trace with hash -1260859087, now seen corresponding path program 1 times 150.94/117.00 [2019-03-28 12:39:11,605 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 150.94/117.00 [2019-03-28 12:39:11,605 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 150.94/117.00 [2019-03-28 12:39:11,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 150.94/117.00 [2019-03-28 12:39:11,606 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 150.94/117.00 [2019-03-28 12:39:11,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 150.94/117.00 [2019-03-28 12:39:11,609 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic 150.94/117.00 [2019-03-28 12:39:11,609 INFO L258 seRefinementStrategy]: Advancing trace checker 150.94/117.00 [2019-03-28 12:39:11,609 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 150.94/117.00 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 150.94/117.00 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) 150.94/117.00 Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true 150.94/117.00 [2019-03-28 12:39:11,623 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 150.94/117.00 [2019-03-28 12:39:11,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 150.94/117.00 [2019-03-28 12:39:11,639 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 4 conjunts are in the unsatisfiable core 150.94/117.00 [2019-03-28 12:39:11,639 INFO L279 TraceCheckSpWp]: Computing forward predicates... 150.94/117.00 [2019-03-28 12:39:11,663 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. 150.94/117.00 [2019-03-28 12:39:11,689 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 150.94/117.00 [2019-03-28 12:39:11,690 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 150.94/117.00 [2019-03-28 12:39:11,690 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states 150.94/117.00 [2019-03-28 12:39:11,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. 150.94/117.00 [2019-03-28 12:39:11,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 150.94/117.00 [2019-03-28 12:39:11,691 INFO L87 Difference]: Start difference. First operand 26 states and 58 transitions. Second operand 4 states. 150.94/117.00 [2019-03-28 12:39:11,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 150.94/117.00 [2019-03-28 12:39:11,737 INFO L93 Difference]: Finished difference Result 36 states and 75 transitions. 150.94/117.00 [2019-03-28 12:39:11,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 150.94/117.00 [2019-03-28 12:39:11,738 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 150.94/117.00 [2019-03-28 12:39:11,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 150.94/117.00 [2019-03-28 12:39:11,738 INFO L225 Difference]: With dead ends: 36 150.94/117.00 [2019-03-28 12:39:11,739 INFO L226 Difference]: Without dead ends: 26 150.94/117.00 [2019-03-28 12:39:11,739 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 150.94/117.00 [2019-03-28 12:39:11,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. 150.94/117.00 [2019-03-28 12:39:11,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. 150.94/117.00 [2019-03-28 12:39:11,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. 150.94/117.00 [2019-03-28 12:39:11,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 45 transitions. 150.94/117.00 [2019-03-28 12:39:11,744 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 45 transitions. Word has length 12 150.94/117.00 [2019-03-28 12:39:11,745 INFO L84 Accepts]: Finished accepts. word is rejected. 150.94/117.00 [2019-03-28 12:39:11,745 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 45 transitions. 150.94/117.00 [2019-03-28 12:39:11,745 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. 150.94/117.00 [2019-03-28 12:39:11,745 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 45 transitions. 150.94/117.00 [2019-03-28 12:39:11,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 150.94/117.00 [2019-03-28 12:39:11,745 INFO L394 BasicCegarLoop]: Found error trace 150.94/117.00 [2019-03-28 12:39:11,746 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 150.94/117.00 [2019-03-28 12:39:11,746 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== 150.94/117.00 [2019-03-28 12:39:11,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 150.94/117.00 [2019-03-28 12:39:11,746 INFO L82 PathProgramCache]: Analyzing trace with hash -1260859086, now seen corresponding path program 1 times 150.94/117.00 [2019-03-28 12:39:11,746 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 150.94/117.00 [2019-03-28 12:39:11,746 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 150.94/117.00 [2019-03-28 12:39:11,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 150.94/117.00 [2019-03-28 12:39:11,747 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 150.94/117.00 [2019-03-28 12:39:11,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 150.94/117.00 [2019-03-28 12:39:11,750 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic 150.94/117.00 [2019-03-28 12:39:11,750 INFO L258 seRefinementStrategy]: Advancing trace checker 150.94/117.00 [2019-03-28 12:39:11,751 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 150.94/117.00 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 150.94/117.00 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) 150.94/117.00 Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true 150.94/117.00 [2019-03-28 12:39:11,762 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 150.94/117.00 [2019-03-28 12:39:11,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 150.94/117.00 [2019-03-28 12:39:11,778 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 7 conjunts are in the unsatisfiable core 150.94/117.00 [2019-03-28 12:39:11,779 INFO L279 TraceCheckSpWp]: Computing forward predicates... 150.94/117.00 [2019-03-28 12:39:11,800 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 150.94/117.00 [2019-03-28 12:39:11,801 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 35 150.94/117.00 [2019-03-28 12:39:11,801 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 150.94/117.00 [2019-03-28 12:39:11,831 INFO L497 ElimStorePlain]: treesize reduction 14, result has 63.2 percent of original size 150.94/117.00 [2019-03-28 12:39:11,832 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. 150.94/117.00 [2019-03-28 12:39:11,832 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:13 150.94/117.00 [2019-03-28 12:39:11,856 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. 150.94/117.00 [2019-03-28 12:39:11,884 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 150.94/117.00 [2019-03-28 12:39:11,885 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 150.94/117.00 [2019-03-28 12:39:11,885 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states 150.94/117.00 [2019-03-28 12:39:11,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. 150.94/117.00 [2019-03-28 12:39:11,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 150.94/117.00 [2019-03-28 12:39:11,886 INFO L87 Difference]: Start difference. First operand 26 states and 45 transitions. Second operand 4 states. 150.94/117.00 [2019-03-28 12:39:12,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 150.94/117.00 [2019-03-28 12:39:12,085 INFO L93 Difference]: Finished difference Result 26 states and 45 transitions. 150.94/117.00 [2019-03-28 12:39:12,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 150.94/117.00 [2019-03-28 12:39:12,086 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 150.94/117.00 [2019-03-28 12:39:12,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 150.94/117.00 [2019-03-28 12:39:12,086 INFO L225 Difference]: With dead ends: 26 150.94/117.00 [2019-03-28 12:39:12,086 INFO L226 Difference]: Without dead ends: 0 150.94/117.00 [2019-03-28 12:39:12,087 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 150.94/117.00 [2019-03-28 12:39:12,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. 150.94/117.00 [2019-03-28 12:39:12,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. 150.94/117.00 [2019-03-28 12:39:12,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. 150.94/117.00 [2019-03-28 12:39:12,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. 150.94/117.00 [2019-03-28 12:39:12,087 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 12 150.94/117.00 [2019-03-28 12:39:12,088 INFO L84 Accepts]: Finished accepts. word is rejected. 150.94/117.00 [2019-03-28 12:39:12,088 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. 150.94/117.00 [2019-03-28 12:39:12,088 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. 150.94/117.00 [2019-03-28 12:39:12,088 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. 150.94/117.00 [2019-03-28 12:39:12,088 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. 150.94/117.00 [2019-03-28 12:39:12,092 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. 150.94/117.00 [2019-03-28 12:39:12,143 WARN L250 erpolLogProxyWrapper]: Already inconsistent. 150.94/117.00 [2019-03-28 12:39:12,147 WARN L250 erpolLogProxyWrapper]: Already inconsistent. 150.94/117.00 [2019-03-28 12:39:12,171 WARN L250 erpolLogProxyWrapper]: Already inconsistent. 150.94/117.00 [2019-03-28 12:39:12,332 WARN L188 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 49 150.94/117.00 [2019-03-28 12:39:13,754 WARN L188 SmtUtils]: Spent 1.42 s on a formula simplification. DAG size of input: 54 DAG size of output: 50 150.94/117.00 [2019-03-28 12:39:13,757 INFO L448 ceAbstractionStarter]: For program point L17(line 17) no Hoare annotation was computed. 150.94/117.00 [2019-03-28 12:39:13,757 INFO L448 ceAbstractionStarter]: For program point L17-1(line 17) no Hoare annotation was computed. 150.94/117.00 [2019-03-28 12:39:13,757 INFO L444 ceAbstractionStarter]: At program point L13-3(lines 13 15) the Hoare annotation is: (and (= (* 4 ULTIMATE.start_main_~length~0) (select |#length| ULTIMATE.start_main_~arr~0.base)) (exists ((v_ULTIMATE.start_main_~i~0_20 Int)) (and (<= ULTIMATE.start_main_~i~0 (+ v_ULTIMATE.start_main_~i~0_20 1)) (<= (+ (* 4 v_ULTIMATE.start_main_~i~0_20) ULTIMATE.start_main_~arr~0.offset 4) (select |#length| ULTIMATE.start_main_~arr~0.base)))) (exists ((|ULTIMATE.start_main_#t~malloc3.base| Int)) (and (not (= ULTIMATE.start_main_~arr~0.base |ULTIMATE.start_main_#t~malloc3.base|)) (= 1 (select |#valid| |ULTIMATE.start_main_#t~malloc3.base|)))) (= 1 (select |#valid| ULTIMATE.start_main_~arr2~0.base)) (= (* 4 (* ULTIMATE.start_main_~fac~0 ULTIMATE.start_main_~length~0)) (select |#length| ULTIMATE.start_main_~arr2~0.base)) (= (select |#valid| ULTIMATE.start_main_~arr~0.base) 1) (<= ULTIMATE.start_main_~arr2~0.offset 0) (<= ULTIMATE.start_main_~arr~0.offset 0) (<= 0 ULTIMATE.start_main_~arr~0.offset) (<= 0 ULTIMATE.start_main_~arr2~0.offset) (exists ((|ULTIMATE.start_main_#t~malloc3.base| Int) (ULTIMATE.start_main_~fac~0 Int) (ULTIMATE.start_main_~length~0 Int)) (and (<= 1 ULTIMATE.start_main_~length~0) (= (* 4 ULTIMATE.start_main_~length~0) (select |#length| ULTIMATE.start_main_~arr~0.base)) (= (* 4 (* ULTIMATE.start_main_~fac~0 ULTIMATE.start_main_~length~0)) (select |#length| |ULTIMATE.start_main_#t~malloc3.base|)) (not (= ULTIMATE.start_main_~arr~0.base |ULTIMATE.start_main_#t~malloc3.base|)))) (<= 0 ULTIMATE.start_main_~i~0)) 150.94/117.00 [2019-03-28 12:39:13,758 INFO L448 ceAbstractionStarter]: For program point L9(line 9) no Hoare annotation was computed. 150.94/117.00 [2019-03-28 12:39:13,758 INFO L448 ceAbstractionStarter]: For program point L7(line 7) no Hoare annotation was computed. 150.94/117.00 [2019-03-28 12:39:13,758 INFO L448 ceAbstractionStarter]: For program point L9-2(line 9) no Hoare annotation was computed. 150.94/117.00 [2019-03-28 12:39:13,758 INFO L448 ceAbstractionStarter]: For program point L7-2(line 7) no Hoare annotation was computed. 150.94/117.00 [2019-03-28 12:39:13,758 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr5REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. 150.94/117.00 [2019-03-28 12:39:13,758 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. 150.94/117.00 [2019-03-28 12:39:13,758 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. 150.94/117.00 [2019-03-28 12:39:13,758 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. 150.94/117.00 [2019-03-28 12:39:13,759 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. 150.94/117.00 [2019-03-28 12:39:13,759 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr3REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. 150.94/117.00 [2019-03-28 12:39:13,759 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr4REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. 150.94/117.00 [2019-03-28 12:39:13,759 INFO L448 ceAbstractionStarter]: For program point L14(line 14) no Hoare annotation was computed. 150.94/117.00 [2019-03-28 12:39:13,759 INFO L444 ceAbstractionStarter]: At program point L16-3(lines 16 18) the Hoare annotation is: (and (= (* 4 ULTIMATE.start_main_~length~0) (select |#length| ULTIMATE.start_main_~arr~0.base)) (<= ULTIMATE.start_main_~length~0 ULTIMATE.start_main_~i~0) (exists ((v_ULTIMATE.start_main_~i~0_20 Int)) (and (<= ULTIMATE.start_main_~i~0 (+ v_ULTIMATE.start_main_~i~0_20 1)) (<= (+ (* 4 v_ULTIMATE.start_main_~i~0_20) ULTIMATE.start_main_~arr~0.offset 4) (select |#length| ULTIMATE.start_main_~arr~0.base)))) (exists ((|ULTIMATE.start_main_#t~malloc3.base| Int)) (and (not (= ULTIMATE.start_main_~arr~0.base |ULTIMATE.start_main_#t~malloc3.base|)) (= 1 (select |#valid| |ULTIMATE.start_main_#t~malloc3.base|)))) (= 1 (select |#valid| ULTIMATE.start_main_~arr2~0.base)) (= (* 4 (* ULTIMATE.start_main_~fac~0 ULTIMATE.start_main_~length~0)) (select |#length| ULTIMATE.start_main_~arr2~0.base)) (= (select |#valid| ULTIMATE.start_main_~arr~0.base) 1) (<= ULTIMATE.start_main_~arr2~0.offset 0) (<= 0 ULTIMATE.start_main_~arr~0.offset) (<= 0 ULTIMATE.start_main_~j~0) (<= 0 ULTIMATE.start_main_~arr2~0.offset) (exists ((|ULTIMATE.start_main_#t~malloc3.base| Int) (ULTIMATE.start_main_~fac~0 Int) (ULTIMATE.start_main_~length~0 Int)) (and (<= 1 ULTIMATE.start_main_~length~0) (= (* 4 ULTIMATE.start_main_~length~0) (select |#length| ULTIMATE.start_main_~arr~0.base)) (= (* 4 (* ULTIMATE.start_main_~fac~0 ULTIMATE.start_main_~length~0)) (select |#length| |ULTIMATE.start_main_#t~malloc3.base|)) (not (= ULTIMATE.start_main_~arr~0.base |ULTIMATE.start_main_#t~malloc3.base|))))) 150.94/117.00 [2019-03-28 12:39:13,759 INFO L448 ceAbstractionStarter]: For program point L12(line 12) no Hoare annotation was computed. 150.94/117.00 [2019-03-28 12:39:13,760 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg 150.94/117.00 [2019-03-28 12:39:13,769 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_20,QUANTIFIED] 150.94/117.00 [2019-03-28 12:39:13,770 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_20,QUANTIFIED] 150.94/117.00 [2019-03-28 12:39:13,771 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_#t~malloc3.base,QUANTIFIED] 150.94/117.00 [2019-03-28 12:39:13,771 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_#t~malloc3.base,QUANTIFIED] 150.94/117.00 [2019-03-28 12:39:13,771 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] 150.94/117.00 [2019-03-28 12:39:13,771 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] 150.94/117.00 [2019-03-28 12:39:13,772 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~fac~0,QUANTIFIED] 150.94/117.00 [2019-03-28 12:39:13,772 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] 150.94/117.00 [2019-03-28 12:39:13,772 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_#t~malloc3.base,QUANTIFIED] 150.94/117.00 [2019-03-28 12:39:13,772 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_#t~malloc3.base,QUANTIFIED] 150.94/117.00 [2019-03-28 12:39:13,775 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 150.94/117.00 [2019-03-28 12:39:13,775 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 150.94/117.00 [2019-03-28 12:39:13,776 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 150.94/117.00 [2019-03-28 12:39:13,776 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 150.94/117.00 [2019-03-28 12:39:13,776 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 150.94/117.00 [2019-03-28 12:39:13,783 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_20,QUANTIFIED] 150.94/117.00 [2019-03-28 12:39:13,783 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_20,QUANTIFIED] 150.94/117.00 [2019-03-28 12:39:13,783 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_#t~malloc3.base,QUANTIFIED] 150.94/117.00 [2019-03-28 12:39:13,784 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_#t~malloc3.base,QUANTIFIED] 150.94/117.00 [2019-03-28 12:39:13,784 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] 150.94/117.00 [2019-03-28 12:39:13,784 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] 150.94/117.00 [2019-03-28 12:39:13,784 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~fac~0,QUANTIFIED] 150.94/117.00 [2019-03-28 12:39:13,785 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] 150.94/117.00 [2019-03-28 12:39:13,785 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_#t~malloc3.base,QUANTIFIED] 150.94/117.00 [2019-03-28 12:39:13,785 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_#t~malloc3.base,QUANTIFIED] 150.94/117.00 [2019-03-28 12:39:13,786 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 150.94/117.00 [2019-03-28 12:39:13,786 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 150.94/117.00 [2019-03-28 12:39:13,786 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 150.94/117.00 [2019-03-28 12:39:13,787 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 150.94/117.00 [2019-03-28 12:39:13,787 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 150.94/117.00 [2019-03-28 12:39:13,788 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_20,QUANTIFIED] 150.94/117.00 [2019-03-28 12:39:13,789 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_20,QUANTIFIED] 150.94/117.00 [2019-03-28 12:39:13,789 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_#t~malloc3.base,QUANTIFIED] 150.94/117.00 [2019-03-28 12:39:13,789 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_#t~malloc3.base,QUANTIFIED] 150.94/117.00 [2019-03-28 12:39:13,790 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] 150.94/117.00 [2019-03-28 12:39:13,790 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] 150.94/117.00 [2019-03-28 12:39:13,790 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~fac~0,QUANTIFIED] 150.94/117.00 [2019-03-28 12:39:13,790 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] 150.94/117.00 [2019-03-28 12:39:13,790 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_#t~malloc3.base,QUANTIFIED] 150.94/117.00 [2019-03-28 12:39:13,791 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_#t~malloc3.base,QUANTIFIED] 150.94/117.00 [2019-03-28 12:39:13,791 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 150.94/117.00 [2019-03-28 12:39:13,792 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 150.94/117.00 [2019-03-28 12:39:13,792 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 150.94/117.00 [2019-03-28 12:39:13,792 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 150.94/117.00 [2019-03-28 12:39:13,792 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 150.94/117.00 [2019-03-28 12:39:13,793 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_20,QUANTIFIED] 150.94/117.00 [2019-03-28 12:39:13,793 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_20,QUANTIFIED] 150.94/117.00 [2019-03-28 12:39:13,794 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_#t~malloc3.base,QUANTIFIED] 150.94/117.00 [2019-03-28 12:39:13,794 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_#t~malloc3.base,QUANTIFIED] 150.94/117.00 [2019-03-28 12:39:13,794 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] 150.94/117.00 [2019-03-28 12:39:13,794 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] 150.94/117.00 [2019-03-28 12:39:13,795 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~fac~0,QUANTIFIED] 150.94/117.00 [2019-03-28 12:39:13,795 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] 150.94/117.00 [2019-03-28 12:39:13,795 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_#t~malloc3.base,QUANTIFIED] 150.94/117.00 [2019-03-28 12:39:13,795 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_#t~malloc3.base,QUANTIFIED] 150.94/117.00 [2019-03-28 12:39:13,796 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 150.94/117.00 [2019-03-28 12:39:13,796 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 150.94/117.00 [2019-03-28 12:39:13,796 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 150.94/117.00 [2019-03-28 12:39:13,797 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 150.94/117.00 [2019-03-28 12:39:13,797 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 150.94/117.00 [2019-03-28 12:39:13,799 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:39:13 BasicIcfg 150.94/117.00 [2019-03-28 12:39:13,799 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- 150.94/117.00 [2019-03-28 12:39:13,800 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- 150.94/117.00 [2019-03-28 12:39:13,800 INFO L271 PluginConnector]: Initializing BuchiAutomizer... 150.94/117.00 [2019-03-28 12:39:13,803 INFO L276 PluginConnector]: BuchiAutomizer initialized 150.94/117.00 [2019-03-28 12:39:13,804 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 150.94/117.00 [2019-03-28 12:39:13,804 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.03 12:37:31" (1/5) ... 150.94/117.00 [2019-03-28 12:39:13,804 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2d1e12b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.03 12:39:13, skipping insertion in model container 150.94/117.00 [2019-03-28 12:39:13,805 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 150.94/117.00 [2019-03-28 12:39:13,805 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:37:31" (2/5) ... 150.94/117.00 [2019-03-28 12:39:13,805 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2d1e12b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.03 12:39:13, skipping insertion in model container 150.94/117.00 [2019-03-28 12:39:13,805 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 150.94/117.00 [2019-03-28 12:39:13,805 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:37:31" (3/5) ... 150.94/117.00 [2019-03-28 12:39:13,805 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2d1e12b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:39:13, skipping insertion in model container 150.94/117.00 [2019-03-28 12:39:13,806 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 150.94/117.00 [2019-03-28 12:39:13,806 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:38:48" (4/5) ... 150.94/117.00 [2019-03-28 12:39:13,806 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2d1e12b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:39:13, skipping insertion in model container 150.94/117.00 [2019-03-28 12:39:13,806 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 150.94/117.00 [2019-03-28 12:39:13,806 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:39:13" (5/5) ... 150.94/117.00 [2019-03-28 12:39:13,808 INFO L375 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 150.94/117.00 [2019-03-28 12:39:13,828 INFO L133 ementStrategyFactory]: Using default assertion order modulation 150.94/117.00 [2019-03-28 12:39:13,828 INFO L374 BuchiCegarLoop]: Interprodecural is true 150.94/117.00 [2019-03-28 12:39:13,828 INFO L375 BuchiCegarLoop]: Hoare is true 150.94/117.00 [2019-03-28 12:39:13,828 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates 150.94/117.00 [2019-03-28 12:39:13,828 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE 150.94/117.00 [2019-03-28 12:39:13,828 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION 150.94/117.00 [2019-03-28 12:39:13,829 INFO L379 BuchiCegarLoop]: Difference is false 150.94/117.00 [2019-03-28 12:39:13,829 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA 150.94/117.00 [2019-03-28 12:39:13,829 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== 150.94/117.00 [2019-03-28 12:39:13,834 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states. 150.94/117.00 [2019-03-28 12:39:13,844 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 150.94/117.00 [2019-03-28 12:39:13,844 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 150.94/117.00 [2019-03-28 12:39:13,844 INFO L119 BuchiIsEmpty]: Starting construction of run 150.94/117.00 [2019-03-28 12:39:13,849 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] 150.94/117.00 [2019-03-28 12:39:13,849 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] 150.94/117.00 [2019-03-28 12:39:13,849 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ 150.94/117.00 [2019-03-28 12:39:13,849 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states. 150.94/117.00 [2019-03-28 12:39:13,853 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 150.94/117.00 [2019-03-28 12:39:13,853 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 150.94/117.00 [2019-03-28 12:39:13,853 INFO L119 BuchiIsEmpty]: Starting construction of run 150.94/117.00 [2019-03-28 12:39:13,853 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] 150.94/117.00 [2019-03-28 12:39:13,853 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] 150.94/117.00 [2019-03-28 12:39:13,859 INFO L794 eck$LassoCheckResult]: Stem: 15#ULTIMATE.startENTRYtrue [1526] ULTIMATE.startENTRY-->L7: Formula: (and (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|) (= |v_#valid_18| (store |v_#valid_19| 0 0))) InVars {#valid=|v_#valid_19|} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_6|, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_4|, ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_9, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_4|, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13, ULTIMATE.start_main_~fac~0=v_ULTIMATE.start_main_~fac~0_9, ULTIMATE.start_main_#t~malloc3.offset=|v_ULTIMATE.start_main_#t~malloc3.offset_7|, ULTIMATE.start_main_#t~post6=|v_ULTIMATE.start_main_#t~post6_4|, ULTIMATE.start_main_~arr2~0.base=v_ULTIMATE.start_main_~arr2~0.base_8, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~post4=|v_ULTIMATE.start_main_#t~post4_4|, ULTIMATE.start_main_~arr2~0.offset=v_ULTIMATE.start_main_~arr2~0.offset_7, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_5|, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_11, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_11, ULTIMATE.start_main_#t~malloc2.base=|v_ULTIMATE.start_main_#t~malloc2.base_7|, ULTIMATE.start_main_#t~malloc2.offset=|v_ULTIMATE.start_main_#t~malloc2.offset_7|, ULTIMATE.start_main_#t~malloc3.base=|v_ULTIMATE.start_main_#t~malloc3.base_7|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_5|, #valid=|v_#valid_18|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_~arr~0.offset, ULTIMATE.start_main_#t~nondet5, #NULL.offset, ULTIMATE.start_main_~i~0, ULTIMATE.start_main_~fac~0, ULTIMATE.start_main_#t~malloc3.offset, ULTIMATE.start_main_#t~post6, ULTIMATE.start_main_~arr2~0.base, #NULL.base, ULTIMATE.start_main_#t~post4, ULTIMATE.start_main_~arr2~0.offset, ULTIMATE.start_main_#t~mem7, ULTIMATE.start_main_~arr~0.base, ULTIMATE.start_main_~j~0, ULTIMATE.start_main_#t~malloc2.base, ULTIMATE.start_main_#t~malloc2.offset, ULTIMATE.start_main_#t~malloc3.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_~length~0] 8#L7true [97] L7-->L7-2: Formula: (>= v_ULTIMATE.start_main_~length~0_6 1) InVars {ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_6} OutVars{ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_6} AuxVars[] AssignedVars[] 3#L7-2true [64] L7-2-->L9: Formula: (= v_ULTIMATE.start_main_~fac~0_2 |v_ULTIMATE.start_main_#t~nondet1_3|) InVars {ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_3|} OutVars{ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_2|, ULTIMATE.start_main_~fac~0=v_ULTIMATE.start_main_~fac~0_2} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_~fac~0] 12#L9true [68] L9-->L9-2: Formula: (and (= v_ULTIMATE.start_main_~fac~0_3 1) (< v_ULTIMATE.start_main_~fac~0_4 1)) InVars {ULTIMATE.start_main_~fac~0=v_ULTIMATE.start_main_~fac~0_4} OutVars{ULTIMATE.start_main_~fac~0=v_ULTIMATE.start_main_~fac~0_3} AuxVars[] AssignedVars[ULTIMATE.start_main_~fac~0] 9#L9-2true [111] L9-2-->L12: Formula: (let ((.cse0 (store |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc2.base_2| 1))) (and (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc3.base_2|) 0) (= 0 |v_ULTIMATE.start_main_#t~malloc2.offset_2|) (> |v_ULTIMATE.start_main_#t~malloc3.base_2| 0) (= v_ULTIMATE.start_main_~arr~0.offset_2 |v_ULTIMATE.start_main_#t~malloc2.offset_2|) (= v_ULTIMATE.start_main_~arr2~0.base_2 |v_ULTIMATE.start_main_#t~malloc3.base_2|) (= |v_#length_1| (store (store |v_#length_3| |v_ULTIMATE.start_main_#t~malloc2.base_2| (* 4 v_ULTIMATE.start_main_~length~0_7)) |v_ULTIMATE.start_main_#t~malloc3.base_2| (* 4 (* v_ULTIMATE.start_main_~fac~0_6 v_ULTIMATE.start_main_~length~0_7)))) (= 0 |v_ULTIMATE.start_main_#t~malloc3.offset_2|) (> 0 |v_ULTIMATE.start_main_#t~malloc2.base_2|) (< |v_ULTIMATE.start_main_#t~malloc2.base_2| |v_#StackHeapBarrier_1|) (= (store .cse0 |v_ULTIMATE.start_main_#t~malloc3.base_2| 1) |v_#valid_3|) (= v_ULTIMATE.start_main_~arr~0.base_2 |v_ULTIMATE.start_main_#t~malloc2.base_2|) (= v_ULTIMATE.start_main_~arr2~0.offset_2 |v_ULTIMATE.start_main_#t~malloc3.offset_2|) (= (select |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc2.base_2|) 0) (< |v_ULTIMATE.start_main_#t~malloc3.base_2| |v_#StackHeapBarrier_1|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, ULTIMATE.start_main_~fac~0=v_ULTIMATE.start_main_~fac~0_6, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_7, #valid=|v_#valid_5|} OutVars{ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_2, ULTIMATE.start_main_~fac~0=v_ULTIMATE.start_main_~fac~0_6, ULTIMATE.start_main_#t~malloc3.offset=|v_ULTIMATE.start_main_#t~malloc3.offset_2|, ULTIMATE.start_main_~arr2~0.base=v_ULTIMATE.start_main_~arr2~0.base_2, ULTIMATE.start_main_~arr2~0.offset=v_ULTIMATE.start_main_~arr2~0.offset_2, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_2, ULTIMATE.start_main_#t~malloc2.base=|v_ULTIMATE.start_main_#t~malloc2.base_2|, ULTIMATE.start_main_#t~malloc2.offset=|v_ULTIMATE.start_main_#t~malloc2.offset_2|, ULTIMATE.start_main_#t~malloc3.base=|v_ULTIMATE.start_main_#t~malloc3.base_2|, #valid=|v_#valid_3|, #length=|v_#length_1|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~arr~0.offset, ULTIMATE.start_main_~arr~0.base, ULTIMATE.start_main_#t~malloc2.base, ULTIMATE.start_main_#t~malloc2.offset, ULTIMATE.start_main_#t~malloc3.base, #valid, #length, ULTIMATE.start_main_#t~malloc3.offset, ULTIMATE.start_main_~arr2~0.base, ULTIMATE.start_main_~arr2~0.offset] 17#L12true [127] L12-->L13-3: Formula: (and (= v_ULTIMATE.start_main_~i~0_4 0) (> 0 v_ULTIMATE.start_main_~arr2~0.offset_4) (< 0 v_ULTIMATE.start_main_~arr~0.offset_4)) InVars {ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_4, ULTIMATE.start_main_~arr2~0.offset=v_ULTIMATE.start_main_~arr2~0.offset_4} OutVars{ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_4, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_4, ULTIMATE.start_main_~arr2~0.offset=v_ULTIMATE.start_main_~arr2~0.offset_4} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 14#L13-3true 150.94/117.00 [2019-03-28 12:39:13,859 INFO L796 eck$LassoCheckResult]: Loop: 14#L13-3true [94] L13-3-->L14: Formula: (< v_ULTIMATE.start_main_~i~0_6 v_ULTIMATE.start_main_~length~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_6, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_6, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_9} AuxVars[] AssignedVars[] 19#L14true [1530] L14-->L13-3: Formula: (let ((.cse0 (* 4 v_ULTIMATE.start_main_~i~0_17))) (let ((.cse1 (+ .cse0 v_ULTIMATE.start_main_~arr~0.offset_11))) (and (<= (+ .cse0 v_ULTIMATE.start_main_~arr~0.offset_11 4) (select |v_#length_11| v_ULTIMATE.start_main_~arr~0.base_13)) (= (store |v_#memory_int_9| v_ULTIMATE.start_main_~arr~0.base_13 (store (select |v_#memory_int_9| v_ULTIMATE.start_main_~arr~0.base_13) .cse1 |v_ULTIMATE.start_main_#t~nondet5_8|)) |v_#memory_int_8|) (= (+ v_ULTIMATE.start_main_~i~0_17 1) v_ULTIMATE.start_main_~i~0_16) (<= 0 .cse1) (= 1 (select |v_#valid_21| v_ULTIMATE.start_main_~arr~0.base_13))))) InVars {ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_11, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_13, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_8|, #valid=|v_#valid_21|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_17, #length=|v_#length_11|} OutVars{ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_11, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_13, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_7|, #valid=|v_#valid_21|, #memory_int=|v_#memory_int_8|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_16, #length=|v_#length_11|, ULTIMATE.start_main_#t~post4=|v_ULTIMATE.start_main_#t~post4_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5, #memory_int, ULTIMATE.start_main_~i~0, ULTIMATE.start_main_#t~post4] 14#L13-3true 150.94/117.00 [2019-03-28 12:39:13,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 150.94/117.00 [2019-03-28 12:39:13,860 INFO L82 PathProgramCache]: Analyzing trace with hash 1717472224, now seen corresponding path program 1 times 150.94/117.00 [2019-03-28 12:39:13,860 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 150.94/117.00 [2019-03-28 12:39:13,860 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 150.94/117.00 [2019-03-28 12:39:13,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 150.94/117.00 [2019-03-28 12:39:13,861 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 150.94/117.00 [2019-03-28 12:39:13,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 150.94/117.00 [2019-03-28 12:39:13,864 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic 150.94/117.00 [2019-03-28 12:39:13,865 INFO L258 seRefinementStrategy]: Advancing trace checker 150.94/117.00 [2019-03-28 12:39:13,865 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 150.94/117.00 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 150.94/117.00 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) 150.94/117.00 Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true 150.94/117.00 [2019-03-28 12:39:13,877 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 150.94/117.00 [2019-03-28 12:39:13,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 150.94/117.00 [2019-03-28 12:39:13,893 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 3 conjunts are in the unsatisfiable core 150.94/117.00 [2019-03-28 12:39:13,894 INFO L279 TraceCheckSpWp]: Computing forward predicates... 150.94/117.00 [2019-03-28 12:39:13,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 150.94/117.00 [2019-03-28 12:39:13,923 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 150.94/117.00 [2019-03-28 12:39:13,924 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 150.94/117.00 [2019-03-28 12:39:13,925 INFO L799 eck$LassoCheckResult]: stem already infeasible 150.94/117.00 [2019-03-28 12:39:13,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 150.94/117.00 [2019-03-28 12:39:13,925 INFO L82 PathProgramCache]: Analyzing trace with hash 5405, now seen corresponding path program 1 times 150.94/117.00 [2019-03-28 12:39:13,925 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 150.94/117.00 [2019-03-28 12:39:13,925 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 150.94/117.00 [2019-03-28 12:39:13,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 150.94/117.00 [2019-03-28 12:39:13,926 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 150.94/117.00 [2019-03-28 12:39:13,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 150.94/117.00 [2019-03-28 12:39:13,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 150.94/117.00 [2019-03-28 12:39:13,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 150.94/117.00 [2019-03-28 12:39:13,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 150.94/117.00 [2019-03-28 12:39:13,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 150.94/117.00 [2019-03-28 12:39:13,991 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 3 states. 150.94/117.00 [2019-03-28 12:39:15,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 150.94/117.00 [2019-03-28 12:39:15,433 INFO L93 Difference]: Finished difference Result 17 states and 76 transitions. 150.94/117.00 [2019-03-28 12:39:15,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 150.94/117.00 [2019-03-28 12:39:15,436 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 76 transitions. 150.94/117.00 [2019-03-28 12:39:15,438 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 150.94/117.00 [2019-03-28 12:39:15,438 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 11 states and 39 transitions. 150.94/117.00 [2019-03-28 12:39:15,440 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 150.94/117.00 [2019-03-28 12:39:15,440 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 150.94/117.00 [2019-03-28 12:39:15,441 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 39 transitions. 150.94/117.00 [2019-03-28 12:39:15,441 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 150.94/117.00 [2019-03-28 12:39:15,441 INFO L706 BuchiCegarLoop]: Abstraction has 11 states and 39 transitions. 150.94/117.00 [2019-03-28 12:39:15,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 39 transitions. 150.94/117.00 [2019-03-28 12:39:15,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. 150.94/117.00 [2019-03-28 12:39:15,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. 150.94/117.00 [2019-03-28 12:39:15,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 39 transitions. 150.94/117.00 [2019-03-28 12:39:15,444 INFO L729 BuchiCegarLoop]: Abstraction has 11 states and 39 transitions. 150.94/117.00 [2019-03-28 12:39:15,444 INFO L609 BuchiCegarLoop]: Abstraction has 11 states and 39 transitions. 150.94/117.00 [2019-03-28 12:39:15,444 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ 150.94/117.00 [2019-03-28 12:39:15,444 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 39 transitions. 150.94/117.00 [2019-03-28 12:39:15,445 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 150.94/117.00 [2019-03-28 12:39:15,445 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 150.94/117.00 [2019-03-28 12:39:15,445 INFO L119 BuchiIsEmpty]: Starting construction of run 150.94/117.00 [2019-03-28 12:39:15,446 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] 150.94/117.00 [2019-03-28 12:39:15,446 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] 150.94/117.00 [2019-03-28 12:39:15,446 INFO L794 eck$LassoCheckResult]: Stem: 64#ULTIMATE.startENTRY [1526] ULTIMATE.startENTRY-->L7: Formula: (and (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|) (= |v_#valid_18| (store |v_#valid_19| 0 0))) InVars {#valid=|v_#valid_19|} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_6|, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_4|, ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_9, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_4|, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13, ULTIMATE.start_main_~fac~0=v_ULTIMATE.start_main_~fac~0_9, ULTIMATE.start_main_#t~malloc3.offset=|v_ULTIMATE.start_main_#t~malloc3.offset_7|, ULTIMATE.start_main_#t~post6=|v_ULTIMATE.start_main_#t~post6_4|, ULTIMATE.start_main_~arr2~0.base=v_ULTIMATE.start_main_~arr2~0.base_8, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~post4=|v_ULTIMATE.start_main_#t~post4_4|, ULTIMATE.start_main_~arr2~0.offset=v_ULTIMATE.start_main_~arr2~0.offset_7, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_5|, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_11, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_11, ULTIMATE.start_main_#t~malloc2.base=|v_ULTIMATE.start_main_#t~malloc2.base_7|, ULTIMATE.start_main_#t~malloc2.offset=|v_ULTIMATE.start_main_#t~malloc2.offset_7|, ULTIMATE.start_main_#t~malloc3.base=|v_ULTIMATE.start_main_#t~malloc3.base_7|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_5|, #valid=|v_#valid_18|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_~arr~0.offset, ULTIMATE.start_main_#t~nondet5, #NULL.offset, ULTIMATE.start_main_~i~0, ULTIMATE.start_main_~fac~0, ULTIMATE.start_main_#t~malloc3.offset, ULTIMATE.start_main_#t~post6, ULTIMATE.start_main_~arr2~0.base, #NULL.base, ULTIMATE.start_main_#t~post4, ULTIMATE.start_main_~arr2~0.offset, ULTIMATE.start_main_#t~mem7, ULTIMATE.start_main_~arr~0.base, ULTIMATE.start_main_~j~0, ULTIMATE.start_main_#t~malloc2.base, ULTIMATE.start_main_#t~malloc2.offset, ULTIMATE.start_main_#t~malloc3.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_~length~0] 65#L7 [97] L7-->L7-2: Formula: (>= v_ULTIMATE.start_main_~length~0_6 1) InVars {ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_6} OutVars{ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_6} AuxVars[] AssignedVars[] 61#L7-2 [64] L7-2-->L9: Formula: (= v_ULTIMATE.start_main_~fac~0_2 |v_ULTIMATE.start_main_#t~nondet1_3|) InVars {ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_3|} OutVars{ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_2|, ULTIMATE.start_main_~fac~0=v_ULTIMATE.start_main_~fac~0_2} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_~fac~0] 62#L9 [68] L9-->L9-2: Formula: (and (= v_ULTIMATE.start_main_~fac~0_3 1) (< v_ULTIMATE.start_main_~fac~0_4 1)) InVars {ULTIMATE.start_main_~fac~0=v_ULTIMATE.start_main_~fac~0_4} OutVars{ULTIMATE.start_main_~fac~0=v_ULTIMATE.start_main_~fac~0_3} AuxVars[] AssignedVars[ULTIMATE.start_main_~fac~0] 68#L9-2 [111] L9-2-->L12: Formula: (let ((.cse0 (store |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc2.base_2| 1))) (and (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc3.base_2|) 0) (= 0 |v_ULTIMATE.start_main_#t~malloc2.offset_2|) (> |v_ULTIMATE.start_main_#t~malloc3.base_2| 0) (= v_ULTIMATE.start_main_~arr~0.offset_2 |v_ULTIMATE.start_main_#t~malloc2.offset_2|) (= v_ULTIMATE.start_main_~arr2~0.base_2 |v_ULTIMATE.start_main_#t~malloc3.base_2|) (= |v_#length_1| (store (store |v_#length_3| |v_ULTIMATE.start_main_#t~malloc2.base_2| (* 4 v_ULTIMATE.start_main_~length~0_7)) |v_ULTIMATE.start_main_#t~malloc3.base_2| (* 4 (* v_ULTIMATE.start_main_~fac~0_6 v_ULTIMATE.start_main_~length~0_7)))) (= 0 |v_ULTIMATE.start_main_#t~malloc3.offset_2|) (> 0 |v_ULTIMATE.start_main_#t~malloc2.base_2|) (< |v_ULTIMATE.start_main_#t~malloc2.base_2| |v_#StackHeapBarrier_1|) (= (store .cse0 |v_ULTIMATE.start_main_#t~malloc3.base_2| 1) |v_#valid_3|) (= v_ULTIMATE.start_main_~arr~0.base_2 |v_ULTIMATE.start_main_#t~malloc2.base_2|) (= v_ULTIMATE.start_main_~arr2~0.offset_2 |v_ULTIMATE.start_main_#t~malloc3.offset_2|) (= (select |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc2.base_2|) 0) (< |v_ULTIMATE.start_main_#t~malloc3.base_2| |v_#StackHeapBarrier_1|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, ULTIMATE.start_main_~fac~0=v_ULTIMATE.start_main_~fac~0_6, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_7, #valid=|v_#valid_5|} OutVars{ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_2, ULTIMATE.start_main_~fac~0=v_ULTIMATE.start_main_~fac~0_6, ULTIMATE.start_main_#t~malloc3.offset=|v_ULTIMATE.start_main_#t~malloc3.offset_2|, ULTIMATE.start_main_~arr2~0.base=v_ULTIMATE.start_main_~arr2~0.base_2, ULTIMATE.start_main_~arr2~0.offset=v_ULTIMATE.start_main_~arr2~0.offset_2, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_2, ULTIMATE.start_main_#t~malloc2.base=|v_ULTIMATE.start_main_#t~malloc2.base_2|, ULTIMATE.start_main_#t~malloc2.offset=|v_ULTIMATE.start_main_#t~malloc2.offset_2|, ULTIMATE.start_main_#t~malloc3.base=|v_ULTIMATE.start_main_#t~malloc3.base_2|, #valid=|v_#valid_3|, #length=|v_#length_1|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~arr~0.offset, ULTIMATE.start_main_~arr~0.base, ULTIMATE.start_main_#t~malloc2.base, ULTIMATE.start_main_#t~malloc2.offset, ULTIMATE.start_main_#t~malloc3.base, #valid, #length, ULTIMATE.start_main_#t~malloc3.offset, ULTIMATE.start_main_~arr2~0.base, ULTIMATE.start_main_~arr2~0.offset] 67#L12 [125] L12-->L13-3: Formula: (and (= v_ULTIMATE.start_main_~i~0_4 0) (> 0 v_ULTIMATE.start_main_~arr~0.offset_4) (< v_ULTIMATE.start_main_~arr2~0.base_4 0)) InVars {ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_4, ULTIMATE.start_main_~arr2~0.base=v_ULTIMATE.start_main_~arr2~0.base_4} OutVars{ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_4, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_4, ULTIMATE.start_main_~arr2~0.base=v_ULTIMATE.start_main_~arr2~0.base_4} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 58#L13-3 150.94/117.00 [2019-03-28 12:39:15,447 INFO L796 eck$LassoCheckResult]: Loop: 58#L13-3 [94] L13-3-->L14: Formula: (< v_ULTIMATE.start_main_~i~0_6 v_ULTIMATE.start_main_~length~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_6, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_6, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_9} AuxVars[] AssignedVars[] 60#L14 [1530] L14-->L13-3: Formula: (let ((.cse0 (* 4 v_ULTIMATE.start_main_~i~0_17))) (let ((.cse1 (+ .cse0 v_ULTIMATE.start_main_~arr~0.offset_11))) (and (<= (+ .cse0 v_ULTIMATE.start_main_~arr~0.offset_11 4) (select |v_#length_11| v_ULTIMATE.start_main_~arr~0.base_13)) (= (store |v_#memory_int_9| v_ULTIMATE.start_main_~arr~0.base_13 (store (select |v_#memory_int_9| v_ULTIMATE.start_main_~arr~0.base_13) .cse1 |v_ULTIMATE.start_main_#t~nondet5_8|)) |v_#memory_int_8|) (= (+ v_ULTIMATE.start_main_~i~0_17 1) v_ULTIMATE.start_main_~i~0_16) (<= 0 .cse1) (= 1 (select |v_#valid_21| v_ULTIMATE.start_main_~arr~0.base_13))))) InVars {ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_11, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_13, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_8|, #valid=|v_#valid_21|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_17, #length=|v_#length_11|} OutVars{ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_11, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_13, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_7|, #valid=|v_#valid_21|, #memory_int=|v_#memory_int_8|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_16, #length=|v_#length_11|, ULTIMATE.start_main_#t~post4=|v_ULTIMATE.start_main_#t~post4_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5, #memory_int, ULTIMATE.start_main_~i~0, ULTIMATE.start_main_#t~post4] 58#L13-3 150.94/117.00 [2019-03-28 12:39:15,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 150.94/117.00 [2019-03-28 12:39:15,447 INFO L82 PathProgramCache]: Analyzing trace with hash 1717472222, now seen corresponding path program 1 times 150.94/117.00 [2019-03-28 12:39:15,447 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 150.94/117.00 [2019-03-28 12:39:15,447 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 150.94/117.00 [2019-03-28 12:39:15,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 150.94/117.00 [2019-03-28 12:39:15,449 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 150.94/117.00 [2019-03-28 12:39:15,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 150.94/117.00 [2019-03-28 12:39:15,452 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic 150.94/117.00 [2019-03-28 12:39:15,452 INFO L258 seRefinementStrategy]: Advancing trace checker 150.94/117.00 [2019-03-28 12:39:15,452 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 150.94/117.00 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 150.94/117.00 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) 150.94/117.00 Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true 150.94/117.00 [2019-03-28 12:39:15,472 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 150.94/117.00 [2019-03-28 12:39:15,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 150.94/117.00 [2019-03-28 12:39:15,483 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 3 conjunts are in the unsatisfiable core 150.94/117.00 [2019-03-28 12:39:15,484 INFO L279 TraceCheckSpWp]: Computing forward predicates... 150.94/117.00 [2019-03-28 12:39:15,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 150.94/117.00 [2019-03-28 12:39:15,529 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 150.94/117.00 [2019-03-28 12:39:15,529 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 150.94/117.00 [2019-03-28 12:39:15,529 INFO L799 eck$LassoCheckResult]: stem already infeasible 150.94/117.00 [2019-03-28 12:39:15,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 150.94/117.00 [2019-03-28 12:39:15,530 INFO L82 PathProgramCache]: Analyzing trace with hash 5405, now seen corresponding path program 2 times 150.94/117.00 [2019-03-28 12:39:15,530 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 150.94/117.00 [2019-03-28 12:39:15,530 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 150.94/117.00 [2019-03-28 12:39:15,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 150.94/117.00 [2019-03-28 12:39:15,531 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 150.94/117.00 [2019-03-28 12:39:15,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 150.94/117.00 [2019-03-28 12:39:15,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 150.94/117.00 [2019-03-28 12:39:15,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 150.94/117.00 [2019-03-28 12:39:15,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 150.94/117.00 [2019-03-28 12:39:15,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 150.94/117.00 [2019-03-28 12:39:15,571 INFO L87 Difference]: Start difference. First operand 11 states and 39 transitions. cyclomatic complexity: 30 Second operand 3 states. 150.94/117.00 [2019-03-28 12:39:15,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 150.94/117.00 [2019-03-28 12:39:15,620 INFO L93 Difference]: Finished difference Result 11 states and 35 transitions. 150.94/117.00 [2019-03-28 12:39:15,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 150.94/117.00 [2019-03-28 12:39:15,621 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 35 transitions. 150.94/117.00 [2019-03-28 12:39:15,622 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 150.94/117.00 [2019-03-28 12:39:15,622 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 11 states and 35 transitions. 150.94/117.00 [2019-03-28 12:39:15,622 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 150.94/117.00 [2019-03-28 12:39:15,622 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 150.94/117.00 [2019-03-28 12:39:15,623 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 35 transitions. 150.94/117.00 [2019-03-28 12:39:15,623 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 150.94/117.00 [2019-03-28 12:39:15,623 INFO L706 BuchiCegarLoop]: Abstraction has 11 states and 35 transitions. 150.94/117.00 [2019-03-28 12:39:15,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 35 transitions. 150.94/117.00 [2019-03-28 12:39:15,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. 150.94/117.00 [2019-03-28 12:39:15,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. 150.94/117.00 [2019-03-28 12:39:15,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 35 transitions. 150.94/117.00 [2019-03-28 12:39:15,624 INFO L729 BuchiCegarLoop]: Abstraction has 11 states and 35 transitions. 150.94/117.00 [2019-03-28 12:39:15,624 INFO L609 BuchiCegarLoop]: Abstraction has 11 states and 35 transitions. 150.94/117.00 [2019-03-28 12:39:15,624 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ 150.94/117.00 [2019-03-28 12:39:15,625 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 35 transitions. 150.94/117.00 [2019-03-28 12:39:15,625 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 150.94/117.00 [2019-03-28 12:39:15,625 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 150.94/117.00 [2019-03-28 12:39:15,625 INFO L119 BuchiIsEmpty]: Starting construction of run 150.94/117.00 [2019-03-28 12:39:15,626 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] 150.94/117.00 [2019-03-28 12:39:15,626 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] 150.94/117.00 [2019-03-28 12:39:15,626 INFO L794 eck$LassoCheckResult]: Stem: 107#ULTIMATE.startENTRY [1526] ULTIMATE.startENTRY-->L7: Formula: (and (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|) (= |v_#valid_18| (store |v_#valid_19| 0 0))) InVars {#valid=|v_#valid_19|} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_6|, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_4|, ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_9, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_4|, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13, ULTIMATE.start_main_~fac~0=v_ULTIMATE.start_main_~fac~0_9, ULTIMATE.start_main_#t~malloc3.offset=|v_ULTIMATE.start_main_#t~malloc3.offset_7|, ULTIMATE.start_main_#t~post6=|v_ULTIMATE.start_main_#t~post6_4|, ULTIMATE.start_main_~arr2~0.base=v_ULTIMATE.start_main_~arr2~0.base_8, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~post4=|v_ULTIMATE.start_main_#t~post4_4|, ULTIMATE.start_main_~arr2~0.offset=v_ULTIMATE.start_main_~arr2~0.offset_7, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_5|, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_11, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_11, ULTIMATE.start_main_#t~malloc2.base=|v_ULTIMATE.start_main_#t~malloc2.base_7|, ULTIMATE.start_main_#t~malloc2.offset=|v_ULTIMATE.start_main_#t~malloc2.offset_7|, ULTIMATE.start_main_#t~malloc3.base=|v_ULTIMATE.start_main_#t~malloc3.base_7|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_5|, #valid=|v_#valid_18|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_~arr~0.offset, ULTIMATE.start_main_#t~nondet5, #NULL.offset, ULTIMATE.start_main_~i~0, ULTIMATE.start_main_~fac~0, ULTIMATE.start_main_#t~malloc3.offset, ULTIMATE.start_main_#t~post6, ULTIMATE.start_main_~arr2~0.base, #NULL.base, ULTIMATE.start_main_#t~post4, ULTIMATE.start_main_~arr2~0.offset, ULTIMATE.start_main_#t~mem7, ULTIMATE.start_main_~arr~0.base, ULTIMATE.start_main_~j~0, ULTIMATE.start_main_#t~malloc2.base, ULTIMATE.start_main_#t~malloc2.offset, ULTIMATE.start_main_#t~malloc3.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_~length~0] 108#L7 [97] L7-->L7-2: Formula: (>= v_ULTIMATE.start_main_~length~0_6 1) InVars {ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_6} OutVars{ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_6} AuxVars[] AssignedVars[] 104#L7-2 [64] L7-2-->L9: Formula: (= v_ULTIMATE.start_main_~fac~0_2 |v_ULTIMATE.start_main_#t~nondet1_3|) InVars {ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_3|} OutVars{ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_2|, ULTIMATE.start_main_~fac~0=v_ULTIMATE.start_main_~fac~0_2} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_~fac~0] 105#L9 [68] L9-->L9-2: Formula: (and (= v_ULTIMATE.start_main_~fac~0_3 1) (< v_ULTIMATE.start_main_~fac~0_4 1)) InVars {ULTIMATE.start_main_~fac~0=v_ULTIMATE.start_main_~fac~0_4} OutVars{ULTIMATE.start_main_~fac~0=v_ULTIMATE.start_main_~fac~0_3} AuxVars[] AssignedVars[ULTIMATE.start_main_~fac~0] 111#L9-2 [111] L9-2-->L12: Formula: (let ((.cse0 (store |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc2.base_2| 1))) (and (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc3.base_2|) 0) (= 0 |v_ULTIMATE.start_main_#t~malloc2.offset_2|) (> |v_ULTIMATE.start_main_#t~malloc3.base_2| 0) (= v_ULTIMATE.start_main_~arr~0.offset_2 |v_ULTIMATE.start_main_#t~malloc2.offset_2|) (= v_ULTIMATE.start_main_~arr2~0.base_2 |v_ULTIMATE.start_main_#t~malloc3.base_2|) (= |v_#length_1| (store (store |v_#length_3| |v_ULTIMATE.start_main_#t~malloc2.base_2| (* 4 v_ULTIMATE.start_main_~length~0_7)) |v_ULTIMATE.start_main_#t~malloc3.base_2| (* 4 (* v_ULTIMATE.start_main_~fac~0_6 v_ULTIMATE.start_main_~length~0_7)))) (= 0 |v_ULTIMATE.start_main_#t~malloc3.offset_2|) (> 0 |v_ULTIMATE.start_main_#t~malloc2.base_2|) (< |v_ULTIMATE.start_main_#t~malloc2.base_2| |v_#StackHeapBarrier_1|) (= (store .cse0 |v_ULTIMATE.start_main_#t~malloc3.base_2| 1) |v_#valid_3|) (= v_ULTIMATE.start_main_~arr~0.base_2 |v_ULTIMATE.start_main_#t~malloc2.base_2|) (= v_ULTIMATE.start_main_~arr2~0.offset_2 |v_ULTIMATE.start_main_#t~malloc3.offset_2|) (= (select |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc2.base_2|) 0) (< |v_ULTIMATE.start_main_#t~malloc3.base_2| |v_#StackHeapBarrier_1|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, ULTIMATE.start_main_~fac~0=v_ULTIMATE.start_main_~fac~0_6, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_7, #valid=|v_#valid_5|} OutVars{ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_2, ULTIMATE.start_main_~fac~0=v_ULTIMATE.start_main_~fac~0_6, ULTIMATE.start_main_#t~malloc3.offset=|v_ULTIMATE.start_main_#t~malloc3.offset_2|, ULTIMATE.start_main_~arr2~0.base=v_ULTIMATE.start_main_~arr2~0.base_2, ULTIMATE.start_main_~arr2~0.offset=v_ULTIMATE.start_main_~arr2~0.offset_2, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_2, ULTIMATE.start_main_#t~malloc2.base=|v_ULTIMATE.start_main_#t~malloc2.base_2|, ULTIMATE.start_main_#t~malloc2.offset=|v_ULTIMATE.start_main_#t~malloc2.offset_2|, ULTIMATE.start_main_#t~malloc3.base=|v_ULTIMATE.start_main_#t~malloc3.base_2|, #valid=|v_#valid_3|, #length=|v_#length_1|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~arr~0.offset, ULTIMATE.start_main_~arr~0.base, ULTIMATE.start_main_#t~malloc2.base, ULTIMATE.start_main_#t~malloc2.offset, ULTIMATE.start_main_#t~malloc3.base, #valid, #length, ULTIMATE.start_main_#t~malloc3.offset, ULTIMATE.start_main_~arr2~0.base, ULTIMATE.start_main_~arr2~0.offset] 110#L12 [122] L12-->L13-3: Formula: (and (= v_ULTIMATE.start_main_~i~0_4 0) (> v_ULTIMATE.start_main_~arr2~0.base_4 0) (> v_ULTIMATE.start_main_~arr~0.base_4 0)) InVars {ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_4, ULTIMATE.start_main_~arr2~0.base=v_ULTIMATE.start_main_~arr2~0.base_4} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_4, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_4, ULTIMATE.start_main_~arr2~0.base=v_ULTIMATE.start_main_~arr2~0.base_4} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 101#L13-3 150.94/117.00 [2019-03-28 12:39:15,627 INFO L796 eck$LassoCheckResult]: Loop: 101#L13-3 [94] L13-3-->L14: Formula: (< v_ULTIMATE.start_main_~i~0_6 v_ULTIMATE.start_main_~length~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_6, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_6, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_9} AuxVars[] AssignedVars[] 103#L14 [1530] L14-->L13-3: Formula: (let ((.cse0 (* 4 v_ULTIMATE.start_main_~i~0_17))) (let ((.cse1 (+ .cse0 v_ULTIMATE.start_main_~arr~0.offset_11))) (and (<= (+ .cse0 v_ULTIMATE.start_main_~arr~0.offset_11 4) (select |v_#length_11| v_ULTIMATE.start_main_~arr~0.base_13)) (= (store |v_#memory_int_9| v_ULTIMATE.start_main_~arr~0.base_13 (store (select |v_#memory_int_9| v_ULTIMATE.start_main_~arr~0.base_13) .cse1 |v_ULTIMATE.start_main_#t~nondet5_8|)) |v_#memory_int_8|) (= (+ v_ULTIMATE.start_main_~i~0_17 1) v_ULTIMATE.start_main_~i~0_16) (<= 0 .cse1) (= 1 (select |v_#valid_21| v_ULTIMATE.start_main_~arr~0.base_13))))) InVars {ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_11, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_13, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_8|, #valid=|v_#valid_21|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_17, #length=|v_#length_11|} OutVars{ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_11, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_13, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_7|, #valid=|v_#valid_21|, #memory_int=|v_#memory_int_8|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_16, #length=|v_#length_11|, ULTIMATE.start_main_#t~post4=|v_ULTIMATE.start_main_#t~post4_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5, #memory_int, ULTIMATE.start_main_~i~0, ULTIMATE.start_main_#t~post4] 101#L13-3 150.94/117.00 [2019-03-28 12:39:15,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 150.94/117.00 [2019-03-28 12:39:15,627 INFO L82 PathProgramCache]: Analyzing trace with hash 1717472219, now seen corresponding path program 1 times 150.94/117.00 [2019-03-28 12:39:15,627 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 150.94/117.00 [2019-03-28 12:39:15,627 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 150.94/117.00 [2019-03-28 12:39:15,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 150.94/117.00 [2019-03-28 12:39:15,628 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 150.94/117.00 [2019-03-28 12:39:15,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 150.94/117.00 [2019-03-28 12:39:15,630 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic 150.94/117.00 [2019-03-28 12:39:15,630 INFO L258 seRefinementStrategy]: Advancing trace checker 150.94/117.00 [2019-03-28 12:39:15,631 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 150.94/117.00 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 150.94/117.00 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) 150.94/117.00 Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true 150.94/117.00 [2019-03-28 12:39:15,644 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 150.94/117.00 [2019-03-28 12:39:15,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 150.94/117.00 [2019-03-28 12:39:15,655 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 3 conjunts are in the unsatisfiable core 150.94/117.00 [2019-03-28 12:39:15,655 INFO L279 TraceCheckSpWp]: Computing forward predicates... 150.94/117.00 [2019-03-28 12:39:15,662 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 150.94/117.00 [2019-03-28 12:39:15,689 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 150.94/117.00 [2019-03-28 12:39:15,690 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 150.94/117.00 [2019-03-28 12:39:15,690 INFO L799 eck$LassoCheckResult]: stem already infeasible 150.94/117.00 [2019-03-28 12:39:15,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 150.94/117.00 [2019-03-28 12:39:15,690 INFO L82 PathProgramCache]: Analyzing trace with hash 5405, now seen corresponding path program 3 times 150.94/117.00 [2019-03-28 12:39:15,691 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 150.94/117.00 [2019-03-28 12:39:15,691 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 150.94/117.00 [2019-03-28 12:39:15,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 150.94/117.00 [2019-03-28 12:39:15,692 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 150.94/117.00 [2019-03-28 12:39:15,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 150.94/117.00 [2019-03-28 12:39:15,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 150.94/117.00 [2019-03-28 12:39:15,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 150.94/117.00 [2019-03-28 12:39:15,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 150.94/117.00 [2019-03-28 12:39:15,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 150.94/117.00 [2019-03-28 12:39:15,733 INFO L87 Difference]: Start difference. First operand 11 states and 35 transitions. cyclomatic complexity: 26 Second operand 3 states. 150.94/117.00 [2019-03-28 12:39:15,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 150.94/117.00 [2019-03-28 12:39:15,814 INFO L93 Difference]: Finished difference Result 17 states and 56 transitions. 150.94/117.00 [2019-03-28 12:39:15,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 150.94/117.00 [2019-03-28 12:39:15,814 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 56 transitions. 150.94/117.00 [2019-03-28 12:39:15,815 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 10 150.94/117.00 [2019-03-28 12:39:15,816 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 17 states and 56 transitions. 150.94/117.00 [2019-03-28 12:39:15,816 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 150.94/117.00 [2019-03-28 12:39:15,816 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 150.94/117.00 [2019-03-28 12:39:15,816 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 56 transitions. 150.94/117.00 [2019-03-28 12:39:15,817 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 150.94/117.00 [2019-03-28 12:39:15,817 INFO L706 BuchiCegarLoop]: Abstraction has 17 states and 56 transitions. 150.94/117.00 [2019-03-28 12:39:15,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 56 transitions. 150.94/117.00 [2019-03-28 12:39:15,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 12. 150.94/117.00 [2019-03-28 12:39:15,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. 150.94/117.00 [2019-03-28 12:39:15,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 39 transitions. 150.94/117.00 [2019-03-28 12:39:15,818 INFO L729 BuchiCegarLoop]: Abstraction has 12 states and 39 transitions. 150.94/117.00 [2019-03-28 12:39:15,818 INFO L609 BuchiCegarLoop]: Abstraction has 12 states and 39 transitions. 150.94/117.00 [2019-03-28 12:39:15,818 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ 150.94/117.00 [2019-03-28 12:39:15,819 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 39 transitions. 150.94/117.00 [2019-03-28 12:39:15,819 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 150.94/117.00 [2019-03-28 12:39:15,819 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 150.94/117.00 [2019-03-28 12:39:15,819 INFO L119 BuchiIsEmpty]: Starting construction of run 150.94/117.00 [2019-03-28 12:39:15,820 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] 150.94/117.00 [2019-03-28 12:39:15,820 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] 150.94/117.00 [2019-03-28 12:39:15,820 INFO L794 eck$LassoCheckResult]: Stem: 155#ULTIMATE.startENTRY [1526] ULTIMATE.startENTRY-->L7: Formula: (and (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|) (= |v_#valid_18| (store |v_#valid_19| 0 0))) InVars {#valid=|v_#valid_19|} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_6|, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_4|, ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_9, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_4|, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13, ULTIMATE.start_main_~fac~0=v_ULTIMATE.start_main_~fac~0_9, ULTIMATE.start_main_#t~malloc3.offset=|v_ULTIMATE.start_main_#t~malloc3.offset_7|, ULTIMATE.start_main_#t~post6=|v_ULTIMATE.start_main_#t~post6_4|, ULTIMATE.start_main_~arr2~0.base=v_ULTIMATE.start_main_~arr2~0.base_8, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~post4=|v_ULTIMATE.start_main_#t~post4_4|, ULTIMATE.start_main_~arr2~0.offset=v_ULTIMATE.start_main_~arr2~0.offset_7, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_5|, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_11, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_11, ULTIMATE.start_main_#t~malloc2.base=|v_ULTIMATE.start_main_#t~malloc2.base_7|, ULTIMATE.start_main_#t~malloc2.offset=|v_ULTIMATE.start_main_#t~malloc2.offset_7|, ULTIMATE.start_main_#t~malloc3.base=|v_ULTIMATE.start_main_#t~malloc3.base_7|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_5|, #valid=|v_#valid_18|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_~arr~0.offset, ULTIMATE.start_main_#t~nondet5, #NULL.offset, ULTIMATE.start_main_~i~0, ULTIMATE.start_main_~fac~0, ULTIMATE.start_main_#t~malloc3.offset, ULTIMATE.start_main_#t~post6, ULTIMATE.start_main_~arr2~0.base, #NULL.base, ULTIMATE.start_main_#t~post4, ULTIMATE.start_main_~arr2~0.offset, ULTIMATE.start_main_#t~mem7, ULTIMATE.start_main_~arr~0.base, ULTIMATE.start_main_~j~0, ULTIMATE.start_main_#t~malloc2.base, ULTIMATE.start_main_#t~malloc2.offset, ULTIMATE.start_main_#t~malloc3.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_~length~0] 156#L7 [97] L7-->L7-2: Formula: (>= v_ULTIMATE.start_main_~length~0_6 1) InVars {ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_6} OutVars{ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_6} AuxVars[] AssignedVars[] 153#L7-2 [64] L7-2-->L9: Formula: (= v_ULTIMATE.start_main_~fac~0_2 |v_ULTIMATE.start_main_#t~nondet1_3|) InVars {ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_3|} OutVars{ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_2|, ULTIMATE.start_main_~fac~0=v_ULTIMATE.start_main_~fac~0_2} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_~fac~0] 154#L9 [68] L9-->L9-2: Formula: (and (= v_ULTIMATE.start_main_~fac~0_3 1) (< v_ULTIMATE.start_main_~fac~0_4 1)) InVars {ULTIMATE.start_main_~fac~0=v_ULTIMATE.start_main_~fac~0_4} OutVars{ULTIMATE.start_main_~fac~0=v_ULTIMATE.start_main_~fac~0_3} AuxVars[] AssignedVars[ULTIMATE.start_main_~fac~0] 160#L9-2 [111] L9-2-->L12: Formula: (let ((.cse0 (store |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc2.base_2| 1))) (and (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc3.base_2|) 0) (= 0 |v_ULTIMATE.start_main_#t~malloc2.offset_2|) (> |v_ULTIMATE.start_main_#t~malloc3.base_2| 0) (= v_ULTIMATE.start_main_~arr~0.offset_2 |v_ULTIMATE.start_main_#t~malloc2.offset_2|) (= v_ULTIMATE.start_main_~arr2~0.base_2 |v_ULTIMATE.start_main_#t~malloc3.base_2|) (= |v_#length_1| (store (store |v_#length_3| |v_ULTIMATE.start_main_#t~malloc2.base_2| (* 4 v_ULTIMATE.start_main_~length~0_7)) |v_ULTIMATE.start_main_#t~malloc3.base_2| (* 4 (* v_ULTIMATE.start_main_~fac~0_6 v_ULTIMATE.start_main_~length~0_7)))) (= 0 |v_ULTIMATE.start_main_#t~malloc3.offset_2|) (> 0 |v_ULTIMATE.start_main_#t~malloc2.base_2|) (< |v_ULTIMATE.start_main_#t~malloc2.base_2| |v_#StackHeapBarrier_1|) (= (store .cse0 |v_ULTIMATE.start_main_#t~malloc3.base_2| 1) |v_#valid_3|) (= v_ULTIMATE.start_main_~arr~0.base_2 |v_ULTIMATE.start_main_#t~malloc2.base_2|) (= v_ULTIMATE.start_main_~arr2~0.offset_2 |v_ULTIMATE.start_main_#t~malloc3.offset_2|) (= (select |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc2.base_2|) 0) (< |v_ULTIMATE.start_main_#t~malloc3.base_2| |v_#StackHeapBarrier_1|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, ULTIMATE.start_main_~fac~0=v_ULTIMATE.start_main_~fac~0_6, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_7, #valid=|v_#valid_5|} OutVars{ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_2, ULTIMATE.start_main_~fac~0=v_ULTIMATE.start_main_~fac~0_6, ULTIMATE.start_main_#t~malloc3.offset=|v_ULTIMATE.start_main_#t~malloc3.offset_2|, ULTIMATE.start_main_~arr2~0.base=v_ULTIMATE.start_main_~arr2~0.base_2, ULTIMATE.start_main_~arr2~0.offset=v_ULTIMATE.start_main_~arr2~0.offset_2, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_2, ULTIMATE.start_main_#t~malloc2.base=|v_ULTIMATE.start_main_#t~malloc2.base_2|, ULTIMATE.start_main_#t~malloc2.offset=|v_ULTIMATE.start_main_#t~malloc2.offset_2|, ULTIMATE.start_main_#t~malloc3.base=|v_ULTIMATE.start_main_#t~malloc3.base_2|, #valid=|v_#valid_3|, #length=|v_#length_1|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~arr~0.offset, ULTIMATE.start_main_~arr~0.base, ULTIMATE.start_main_#t~malloc2.base, ULTIMATE.start_main_#t~malloc2.offset, ULTIMATE.start_main_#t~malloc3.base, #valid, #length, ULTIMATE.start_main_#t~malloc3.offset, ULTIMATE.start_main_~arr2~0.base, ULTIMATE.start_main_~arr2~0.offset] 159#L12 [120] L12-->L13-3: Formula: (and (< 0 v_ULTIMATE.start_main_~arr2~0.offset_4) (= v_ULTIMATE.start_main_~i~0_4 0) (< v_ULTIMATE.start_main_~arr~0.base_4 0)) InVars {ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_4, ULTIMATE.start_main_~arr2~0.offset=v_ULTIMATE.start_main_~arr2~0.offset_4} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_4, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_4, ULTIMATE.start_main_~arr2~0.offset=v_ULTIMATE.start_main_~arr2~0.offset_4} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 150#L13-3 150.94/117.00 [2019-03-28 12:39:15,821 INFO L796 eck$LassoCheckResult]: Loop: 150#L13-3 [94] L13-3-->L14: Formula: (< v_ULTIMATE.start_main_~i~0_6 v_ULTIMATE.start_main_~length~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_6, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_6, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_9} AuxVars[] AssignedVars[] 152#L14 [1530] L14-->L13-3: Formula: (let ((.cse0 (* 4 v_ULTIMATE.start_main_~i~0_17))) (let ((.cse1 (+ .cse0 v_ULTIMATE.start_main_~arr~0.offset_11))) (and (<= (+ .cse0 v_ULTIMATE.start_main_~arr~0.offset_11 4) (select |v_#length_11| v_ULTIMATE.start_main_~arr~0.base_13)) (= (store |v_#memory_int_9| v_ULTIMATE.start_main_~arr~0.base_13 (store (select |v_#memory_int_9| v_ULTIMATE.start_main_~arr~0.base_13) .cse1 |v_ULTIMATE.start_main_#t~nondet5_8|)) |v_#memory_int_8|) (= (+ v_ULTIMATE.start_main_~i~0_17 1) v_ULTIMATE.start_main_~i~0_16) (<= 0 .cse1) (= 1 (select |v_#valid_21| v_ULTIMATE.start_main_~arr~0.base_13))))) InVars {ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_11, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_13, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_8|, #valid=|v_#valid_21|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_17, #length=|v_#length_11|} OutVars{ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_11, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_13, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_7|, #valid=|v_#valid_21|, #memory_int=|v_#memory_int_8|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_16, #length=|v_#length_11|, ULTIMATE.start_main_#t~post4=|v_ULTIMATE.start_main_#t~post4_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5, #memory_int, ULTIMATE.start_main_~i~0, ULTIMATE.start_main_#t~post4] 150#L13-3 150.94/117.00 [2019-03-28 12:39:15,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 150.94/117.00 [2019-03-28 12:39:15,821 INFO L82 PathProgramCache]: Analyzing trace with hash 1717472217, now seen corresponding path program 1 times 150.94/117.00 [2019-03-28 12:39:15,821 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 150.94/117.00 [2019-03-28 12:39:15,821 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 150.94/117.00 [2019-03-28 12:39:15,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 150.94/117.00 [2019-03-28 12:39:15,822 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 150.94/117.00 [2019-03-28 12:39:15,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 150.94/117.00 [2019-03-28 12:39:15,824 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic 150.94/117.00 [2019-03-28 12:39:15,825 INFO L258 seRefinementStrategy]: Advancing trace checker 150.94/117.00 [2019-03-28 12:39:15,825 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 150.94/117.00 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 150.94/117.00 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) 150.94/117.00 Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true 150.94/117.00 [2019-03-28 12:39:15,838 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 150.94/117.00 [2019-03-28 12:39:15,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 150.94/117.00 [2019-03-28 12:39:15,848 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 3 conjunts are in the unsatisfiable core 150.94/117.00 [2019-03-28 12:39:15,849 INFO L279 TraceCheckSpWp]: Computing forward predicates... 150.94/117.00 [2019-03-28 12:39:15,853 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 150.94/117.00 [2019-03-28 12:39:15,879 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 150.94/117.00 [2019-03-28 12:39:15,879 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 150.94/117.00 [2019-03-28 12:39:15,880 INFO L799 eck$LassoCheckResult]: stem already infeasible 150.94/117.00 [2019-03-28 12:39:15,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 150.94/117.00 [2019-03-28 12:39:15,880 INFO L82 PathProgramCache]: Analyzing trace with hash 5405, now seen corresponding path program 4 times 150.94/117.00 [2019-03-28 12:39:15,880 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 150.94/117.00 [2019-03-28 12:39:15,880 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 150.94/117.00 [2019-03-28 12:39:15,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 150.94/117.00 [2019-03-28 12:39:15,881 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 150.94/117.00 [2019-03-28 12:39:15,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 150.94/117.00 [2019-03-28 12:39:15,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 150.94/117.00 [2019-03-28 12:39:15,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 150.94/117.00 [2019-03-28 12:39:15,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 150.94/117.00 [2019-03-28 12:39:15,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 150.94/117.00 [2019-03-28 12:39:15,921 INFO L87 Difference]: Start difference. First operand 12 states and 39 transitions. cyclomatic complexity: 29 Second operand 3 states. 150.94/117.00 [2019-03-28 12:39:15,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 150.94/117.00 [2019-03-28 12:39:15,967 INFO L93 Difference]: Finished difference Result 12 states and 36 transitions. 150.94/117.00 [2019-03-28 12:39:15,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 150.94/117.00 [2019-03-28 12:39:15,968 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 36 transitions. 150.94/117.00 [2019-03-28 12:39:15,968 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 150.94/117.00 [2019-03-28 12:39:15,969 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 12 states and 36 transitions. 150.94/117.00 [2019-03-28 12:39:15,969 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 150.94/117.00 [2019-03-28 12:39:15,969 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 150.94/117.00 [2019-03-28 12:39:15,969 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 36 transitions. 150.94/117.00 [2019-03-28 12:39:15,969 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 150.94/117.00 [2019-03-28 12:39:15,970 INFO L706 BuchiCegarLoop]: Abstraction has 12 states and 36 transitions. 150.94/117.00 [2019-03-28 12:39:15,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 36 transitions. 150.94/117.00 [2019-03-28 12:39:15,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. 150.94/117.00 [2019-03-28 12:39:15,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. 150.94/117.00 [2019-03-28 12:39:15,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 36 transitions. 150.94/117.00 [2019-03-28 12:39:15,971 INFO L729 BuchiCegarLoop]: Abstraction has 12 states and 36 transitions. 150.94/117.00 [2019-03-28 12:39:15,971 INFO L609 BuchiCegarLoop]: Abstraction has 12 states and 36 transitions. 150.94/117.00 [2019-03-28 12:39:15,971 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ 150.94/117.00 [2019-03-28 12:39:15,971 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 36 transitions. 150.94/117.00 [2019-03-28 12:39:15,972 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 150.94/117.00 [2019-03-28 12:39:15,972 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 150.94/117.00 [2019-03-28 12:39:15,972 INFO L119 BuchiIsEmpty]: Starting construction of run 150.94/117.00 [2019-03-28 12:39:15,972 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] 150.94/117.00 [2019-03-28 12:39:15,972 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] 150.94/117.00 [2019-03-28 12:39:15,973 INFO L794 eck$LassoCheckResult]: Stem: 201#ULTIMATE.startENTRY [1526] ULTIMATE.startENTRY-->L7: Formula: (and (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|) (= |v_#valid_18| (store |v_#valid_19| 0 0))) InVars {#valid=|v_#valid_19|} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_6|, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_4|, ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_9, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_4|, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13, ULTIMATE.start_main_~fac~0=v_ULTIMATE.start_main_~fac~0_9, ULTIMATE.start_main_#t~malloc3.offset=|v_ULTIMATE.start_main_#t~malloc3.offset_7|, ULTIMATE.start_main_#t~post6=|v_ULTIMATE.start_main_#t~post6_4|, ULTIMATE.start_main_~arr2~0.base=v_ULTIMATE.start_main_~arr2~0.base_8, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~post4=|v_ULTIMATE.start_main_#t~post4_4|, ULTIMATE.start_main_~arr2~0.offset=v_ULTIMATE.start_main_~arr2~0.offset_7, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_5|, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_11, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_11, ULTIMATE.start_main_#t~malloc2.base=|v_ULTIMATE.start_main_#t~malloc2.base_7|, ULTIMATE.start_main_#t~malloc2.offset=|v_ULTIMATE.start_main_#t~malloc2.offset_7|, ULTIMATE.start_main_#t~malloc3.base=|v_ULTIMATE.start_main_#t~malloc3.base_7|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_5|, #valid=|v_#valid_18|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_~arr~0.offset, ULTIMATE.start_main_#t~nondet5, #NULL.offset, ULTIMATE.start_main_~i~0, ULTIMATE.start_main_~fac~0, ULTIMATE.start_main_#t~malloc3.offset, ULTIMATE.start_main_#t~post6, ULTIMATE.start_main_~arr2~0.base, #NULL.base, ULTIMATE.start_main_#t~post4, ULTIMATE.start_main_~arr2~0.offset, ULTIMATE.start_main_#t~mem7, ULTIMATE.start_main_~arr~0.base, ULTIMATE.start_main_~j~0, ULTIMATE.start_main_#t~malloc2.base, ULTIMATE.start_main_#t~malloc2.offset, ULTIMATE.start_main_#t~malloc3.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_~length~0] 202#L7 [97] L7-->L7-2: Formula: (>= v_ULTIMATE.start_main_~length~0_6 1) InVars {ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_6} OutVars{ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_6} AuxVars[] AssignedVars[] 198#L7-2 [64] L7-2-->L9: Formula: (= v_ULTIMATE.start_main_~fac~0_2 |v_ULTIMATE.start_main_#t~nondet1_3|) InVars {ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_3|} OutVars{ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_2|, ULTIMATE.start_main_~fac~0=v_ULTIMATE.start_main_~fac~0_2} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_~fac~0] 199#L9 [68] L9-->L9-2: Formula: (and (= v_ULTIMATE.start_main_~fac~0_3 1) (< v_ULTIMATE.start_main_~fac~0_4 1)) InVars {ULTIMATE.start_main_~fac~0=v_ULTIMATE.start_main_~fac~0_4} OutVars{ULTIMATE.start_main_~fac~0=v_ULTIMATE.start_main_~fac~0_3} AuxVars[] AssignedVars[ULTIMATE.start_main_~fac~0] 205#L9-2 [111] L9-2-->L12: Formula: (let ((.cse0 (store |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc2.base_2| 1))) (and (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc3.base_2|) 0) (= 0 |v_ULTIMATE.start_main_#t~malloc2.offset_2|) (> |v_ULTIMATE.start_main_#t~malloc3.base_2| 0) (= v_ULTIMATE.start_main_~arr~0.offset_2 |v_ULTIMATE.start_main_#t~malloc2.offset_2|) (= v_ULTIMATE.start_main_~arr2~0.base_2 |v_ULTIMATE.start_main_#t~malloc3.base_2|) (= |v_#length_1| (store (store |v_#length_3| |v_ULTIMATE.start_main_#t~malloc2.base_2| (* 4 v_ULTIMATE.start_main_~length~0_7)) |v_ULTIMATE.start_main_#t~malloc3.base_2| (* 4 (* v_ULTIMATE.start_main_~fac~0_6 v_ULTIMATE.start_main_~length~0_7)))) (= 0 |v_ULTIMATE.start_main_#t~malloc3.offset_2|) (> 0 |v_ULTIMATE.start_main_#t~malloc2.base_2|) (< |v_ULTIMATE.start_main_#t~malloc2.base_2| |v_#StackHeapBarrier_1|) (= (store .cse0 |v_ULTIMATE.start_main_#t~malloc3.base_2| 1) |v_#valid_3|) (= v_ULTIMATE.start_main_~arr~0.base_2 |v_ULTIMATE.start_main_#t~malloc2.base_2|) (= v_ULTIMATE.start_main_~arr2~0.offset_2 |v_ULTIMATE.start_main_#t~malloc3.offset_2|) (= (select |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc2.base_2|) 0) (< |v_ULTIMATE.start_main_#t~malloc3.base_2| |v_#StackHeapBarrier_1|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, ULTIMATE.start_main_~fac~0=v_ULTIMATE.start_main_~fac~0_6, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_7, #valid=|v_#valid_5|} OutVars{ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_2, ULTIMATE.start_main_~fac~0=v_ULTIMATE.start_main_~fac~0_6, ULTIMATE.start_main_#t~malloc3.offset=|v_ULTIMATE.start_main_#t~malloc3.offset_2|, ULTIMATE.start_main_~arr2~0.base=v_ULTIMATE.start_main_~arr2~0.base_2, ULTIMATE.start_main_~arr2~0.offset=v_ULTIMATE.start_main_~arr2~0.offset_2, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_2, ULTIMATE.start_main_#t~malloc2.base=|v_ULTIMATE.start_main_#t~malloc2.base_2|, ULTIMATE.start_main_#t~malloc2.offset=|v_ULTIMATE.start_main_#t~malloc2.offset_2|, ULTIMATE.start_main_#t~malloc3.base=|v_ULTIMATE.start_main_#t~malloc3.base_2|, #valid=|v_#valid_3|, #length=|v_#length_1|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~arr~0.offset, ULTIMATE.start_main_~arr~0.base, ULTIMATE.start_main_#t~malloc2.base, ULTIMATE.start_main_#t~malloc2.offset, ULTIMATE.start_main_#t~malloc3.base, #valid, #length, ULTIMATE.start_main_#t~malloc3.offset, ULTIMATE.start_main_~arr2~0.base, ULTIMATE.start_main_~arr2~0.offset] 204#L12 [117] L12-->L13-3: Formula: (and (= v_ULTIMATE.start_main_~i~0_4 0) (< v_ULTIMATE.start_main_~arr~0.base_4 0) (> 0 v_ULTIMATE.start_main_~arr2~0.offset_4)) InVars {ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_4, ULTIMATE.start_main_~arr2~0.offset=v_ULTIMATE.start_main_~arr2~0.offset_4} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_4, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_4, ULTIMATE.start_main_~arr2~0.offset=v_ULTIMATE.start_main_~arr2~0.offset_4} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 195#L13-3 150.94/117.00 [2019-03-28 12:39:15,973 INFO L796 eck$LassoCheckResult]: Loop: 195#L13-3 [94] L13-3-->L14: Formula: (< v_ULTIMATE.start_main_~i~0_6 v_ULTIMATE.start_main_~length~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_6, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_6, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_9} AuxVars[] AssignedVars[] 197#L14 [1530] L14-->L13-3: Formula: (let ((.cse0 (* 4 v_ULTIMATE.start_main_~i~0_17))) (let ((.cse1 (+ .cse0 v_ULTIMATE.start_main_~arr~0.offset_11))) (and (<= (+ .cse0 v_ULTIMATE.start_main_~arr~0.offset_11 4) (select |v_#length_11| v_ULTIMATE.start_main_~arr~0.base_13)) (= (store |v_#memory_int_9| v_ULTIMATE.start_main_~arr~0.base_13 (store (select |v_#memory_int_9| v_ULTIMATE.start_main_~arr~0.base_13) .cse1 |v_ULTIMATE.start_main_#t~nondet5_8|)) |v_#memory_int_8|) (= (+ v_ULTIMATE.start_main_~i~0_17 1) v_ULTIMATE.start_main_~i~0_16) (<= 0 .cse1) (= 1 (select |v_#valid_21| v_ULTIMATE.start_main_~arr~0.base_13))))) InVars {ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_11, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_13, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_8|, #valid=|v_#valid_21|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_17, #length=|v_#length_11|} OutVars{ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_11, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_13, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_7|, #valid=|v_#valid_21|, #memory_int=|v_#memory_int_8|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_16, #length=|v_#length_11|, ULTIMATE.start_main_#t~post4=|v_ULTIMATE.start_main_#t~post4_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5, #memory_int, ULTIMATE.start_main_~i~0, ULTIMATE.start_main_#t~post4] 195#L13-3 150.94/117.00 [2019-03-28 12:39:15,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 150.94/117.00 [2019-03-28 12:39:15,974 INFO L82 PathProgramCache]: Analyzing trace with hash 1717472214, now seen corresponding path program 1 times 150.94/117.00 [2019-03-28 12:39:15,974 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 150.94/117.00 [2019-03-28 12:39:15,974 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 150.94/117.00 [2019-03-28 12:39:15,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 150.94/117.00 [2019-03-28 12:39:15,975 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 150.94/117.00 [2019-03-28 12:39:15,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 150.94/117.00 [2019-03-28 12:39:15,977 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic 150.94/117.00 [2019-03-28 12:39:15,977 INFO L258 seRefinementStrategy]: Advancing trace checker 150.94/117.00 [2019-03-28 12:39:15,977 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 150.94/117.00 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 150.94/117.00 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) 150.94/117.00 Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true 150.94/117.00 [2019-03-28 12:39:15,991 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 150.94/117.00 [2019-03-28 12:39:16,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 150.94/117.00 [2019-03-28 12:39:16,002 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 3 conjunts are in the unsatisfiable core 150.94/117.00 [2019-03-28 12:39:16,003 INFO L279 TraceCheckSpWp]: Computing forward predicates... 150.94/117.00 [2019-03-28 12:39:16,007 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 150.94/117.00 [2019-03-28 12:39:16,034 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 150.94/117.00 [2019-03-28 12:39:16,035 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 150.94/117.00 [2019-03-28 12:39:16,035 INFO L799 eck$LassoCheckResult]: stem already infeasible 150.94/117.00 [2019-03-28 12:39:16,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 150.94/117.00 [2019-03-28 12:39:16,035 INFO L82 PathProgramCache]: Analyzing trace with hash 5405, now seen corresponding path program 5 times 150.94/117.00 [2019-03-28 12:39:16,035 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 150.94/117.00 [2019-03-28 12:39:16,036 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 150.94/117.00 [2019-03-28 12:39:16,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 150.94/117.00 [2019-03-28 12:39:16,036 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 150.94/117.00 [2019-03-28 12:39:16,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 150.94/117.00 [2019-03-28 12:39:16,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 150.94/117.00 [2019-03-28 12:39:16,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 150.94/117.00 [2019-03-28 12:39:16,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 150.94/117.00 [2019-03-28 12:39:16,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 150.94/117.00 [2019-03-28 12:39:16,077 INFO L87 Difference]: Start difference. First operand 12 states and 36 transitions. cyclomatic complexity: 26 Second operand 3 states. 150.94/117.00 [2019-03-28 12:39:16,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 150.94/117.00 [2019-03-28 12:39:16,119 INFO L93 Difference]: Finished difference Result 12 states and 33 transitions. 150.94/117.00 [2019-03-28 12:39:16,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 150.94/117.00 [2019-03-28 12:39:16,120 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 33 transitions. 150.94/117.00 [2019-03-28 12:39:16,120 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 150.94/117.00 [2019-03-28 12:39:16,121 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 12 states and 33 transitions. 150.94/117.00 [2019-03-28 12:39:16,121 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 150.94/117.00 [2019-03-28 12:39:16,121 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 150.94/117.00 [2019-03-28 12:39:16,121 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 33 transitions. 150.94/117.00 [2019-03-28 12:39:16,121 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 150.94/117.00 [2019-03-28 12:39:16,122 INFO L706 BuchiCegarLoop]: Abstraction has 12 states and 33 transitions. 150.94/117.00 [2019-03-28 12:39:16,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 33 transitions. 150.94/117.00 [2019-03-28 12:39:16,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. 150.94/117.00 [2019-03-28 12:39:16,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. 150.94/117.00 [2019-03-28 12:39:16,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 33 transitions. 150.94/117.00 [2019-03-28 12:39:16,123 INFO L729 BuchiCegarLoop]: Abstraction has 12 states and 33 transitions. 150.94/117.00 [2019-03-28 12:39:16,123 INFO L609 BuchiCegarLoop]: Abstraction has 12 states and 33 transitions. 150.94/117.00 [2019-03-28 12:39:16,123 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ 150.94/117.00 [2019-03-28 12:39:16,123 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 33 transitions. 150.94/117.00 [2019-03-28 12:39:16,124 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 150.94/117.00 [2019-03-28 12:39:16,124 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 150.94/117.00 [2019-03-28 12:39:16,124 INFO L119 BuchiIsEmpty]: Starting construction of run 150.94/117.00 [2019-03-28 12:39:16,124 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] 150.94/117.00 [2019-03-28 12:39:16,124 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] 150.94/117.00 [2019-03-28 12:39:16,125 INFO L794 eck$LassoCheckResult]: Stem: 245#ULTIMATE.startENTRY [1526] ULTIMATE.startENTRY-->L7: Formula: (and (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|) (= |v_#valid_18| (store |v_#valid_19| 0 0))) InVars {#valid=|v_#valid_19|} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_6|, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_4|, ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_9, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_4|, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13, ULTIMATE.start_main_~fac~0=v_ULTIMATE.start_main_~fac~0_9, ULTIMATE.start_main_#t~malloc3.offset=|v_ULTIMATE.start_main_#t~malloc3.offset_7|, ULTIMATE.start_main_#t~post6=|v_ULTIMATE.start_main_#t~post6_4|, ULTIMATE.start_main_~arr2~0.base=v_ULTIMATE.start_main_~arr2~0.base_8, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~post4=|v_ULTIMATE.start_main_#t~post4_4|, ULTIMATE.start_main_~arr2~0.offset=v_ULTIMATE.start_main_~arr2~0.offset_7, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_5|, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_11, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_11, ULTIMATE.start_main_#t~malloc2.base=|v_ULTIMATE.start_main_#t~malloc2.base_7|, ULTIMATE.start_main_#t~malloc2.offset=|v_ULTIMATE.start_main_#t~malloc2.offset_7|, ULTIMATE.start_main_#t~malloc3.base=|v_ULTIMATE.start_main_#t~malloc3.base_7|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_5|, #valid=|v_#valid_18|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_~arr~0.offset, ULTIMATE.start_main_#t~nondet5, #NULL.offset, ULTIMATE.start_main_~i~0, ULTIMATE.start_main_~fac~0, ULTIMATE.start_main_#t~malloc3.offset, ULTIMATE.start_main_#t~post6, ULTIMATE.start_main_~arr2~0.base, #NULL.base, ULTIMATE.start_main_#t~post4, ULTIMATE.start_main_~arr2~0.offset, ULTIMATE.start_main_#t~mem7, ULTIMATE.start_main_~arr~0.base, ULTIMATE.start_main_~j~0, ULTIMATE.start_main_#t~malloc2.base, ULTIMATE.start_main_#t~malloc2.offset, ULTIMATE.start_main_#t~malloc3.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_~length~0] 246#L7 [97] L7-->L7-2: Formula: (>= v_ULTIMATE.start_main_~length~0_6 1) InVars {ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_6} OutVars{ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_6} AuxVars[] AssignedVars[] 243#L7-2 [64] L7-2-->L9: Formula: (= v_ULTIMATE.start_main_~fac~0_2 |v_ULTIMATE.start_main_#t~nondet1_3|) InVars {ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_3|} OutVars{ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_2|, ULTIMATE.start_main_~fac~0=v_ULTIMATE.start_main_~fac~0_2} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_~fac~0] 244#L9 [68] L9-->L9-2: Formula: (and (= v_ULTIMATE.start_main_~fac~0_3 1) (< v_ULTIMATE.start_main_~fac~0_4 1)) InVars {ULTIMATE.start_main_~fac~0=v_ULTIMATE.start_main_~fac~0_4} OutVars{ULTIMATE.start_main_~fac~0=v_ULTIMATE.start_main_~fac~0_3} AuxVars[] AssignedVars[ULTIMATE.start_main_~fac~0] 250#L9-2 [111] L9-2-->L12: Formula: (let ((.cse0 (store |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc2.base_2| 1))) (and (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc3.base_2|) 0) (= 0 |v_ULTIMATE.start_main_#t~malloc2.offset_2|) (> |v_ULTIMATE.start_main_#t~malloc3.base_2| 0) (= v_ULTIMATE.start_main_~arr~0.offset_2 |v_ULTIMATE.start_main_#t~malloc2.offset_2|) (= v_ULTIMATE.start_main_~arr2~0.base_2 |v_ULTIMATE.start_main_#t~malloc3.base_2|) (= |v_#length_1| (store (store |v_#length_3| |v_ULTIMATE.start_main_#t~malloc2.base_2| (* 4 v_ULTIMATE.start_main_~length~0_7)) |v_ULTIMATE.start_main_#t~malloc3.base_2| (* 4 (* v_ULTIMATE.start_main_~fac~0_6 v_ULTIMATE.start_main_~length~0_7)))) (= 0 |v_ULTIMATE.start_main_#t~malloc3.offset_2|) (> 0 |v_ULTIMATE.start_main_#t~malloc2.base_2|) (< |v_ULTIMATE.start_main_#t~malloc2.base_2| |v_#StackHeapBarrier_1|) (= (store .cse0 |v_ULTIMATE.start_main_#t~malloc3.base_2| 1) |v_#valid_3|) (= v_ULTIMATE.start_main_~arr~0.base_2 |v_ULTIMATE.start_main_#t~malloc2.base_2|) (= v_ULTIMATE.start_main_~arr2~0.offset_2 |v_ULTIMATE.start_main_#t~malloc3.offset_2|) (= (select |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc2.base_2|) 0) (< |v_ULTIMATE.start_main_#t~malloc3.base_2| |v_#StackHeapBarrier_1|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, ULTIMATE.start_main_~fac~0=v_ULTIMATE.start_main_~fac~0_6, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_7, #valid=|v_#valid_5|} OutVars{ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_2, ULTIMATE.start_main_~fac~0=v_ULTIMATE.start_main_~fac~0_6, ULTIMATE.start_main_#t~malloc3.offset=|v_ULTIMATE.start_main_#t~malloc3.offset_2|, ULTIMATE.start_main_~arr2~0.base=v_ULTIMATE.start_main_~arr2~0.base_2, ULTIMATE.start_main_~arr2~0.offset=v_ULTIMATE.start_main_~arr2~0.offset_2, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_2, ULTIMATE.start_main_#t~malloc2.base=|v_ULTIMATE.start_main_#t~malloc2.base_2|, ULTIMATE.start_main_#t~malloc2.offset=|v_ULTIMATE.start_main_#t~malloc2.offset_2|, ULTIMATE.start_main_#t~malloc3.base=|v_ULTIMATE.start_main_#t~malloc3.base_2|, #valid=|v_#valid_3|, #length=|v_#length_1|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~arr~0.offset, ULTIMATE.start_main_~arr~0.base, ULTIMATE.start_main_#t~malloc2.base, ULTIMATE.start_main_#t~malloc2.offset, ULTIMATE.start_main_#t~malloc3.base, #valid, #length, ULTIMATE.start_main_#t~malloc3.offset, ULTIMATE.start_main_~arr2~0.base, ULTIMATE.start_main_~arr2~0.offset] 249#L12 [130] L12-->L13-3: Formula: (and (= v_ULTIMATE.start_main_~i~0_4 0) (< v_ULTIMATE.start_main_~arr~0.base_4 0) (< v_ULTIMATE.start_main_~arr2~0.base_4 0)) InVars {ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_4, ULTIMATE.start_main_~arr2~0.base=v_ULTIMATE.start_main_~arr2~0.base_4} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_4, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_4, ULTIMATE.start_main_~arr2~0.base=v_ULTIMATE.start_main_~arr2~0.base_4} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 240#L13-3 150.94/117.00 [2019-03-28 12:39:16,125 INFO L796 eck$LassoCheckResult]: Loop: 240#L13-3 [94] L13-3-->L14: Formula: (< v_ULTIMATE.start_main_~i~0_6 v_ULTIMATE.start_main_~length~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_6, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_6, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_9} AuxVars[] AssignedVars[] 242#L14 [1530] L14-->L13-3: Formula: (let ((.cse0 (* 4 v_ULTIMATE.start_main_~i~0_17))) (let ((.cse1 (+ .cse0 v_ULTIMATE.start_main_~arr~0.offset_11))) (and (<= (+ .cse0 v_ULTIMATE.start_main_~arr~0.offset_11 4) (select |v_#length_11| v_ULTIMATE.start_main_~arr~0.base_13)) (= (store |v_#memory_int_9| v_ULTIMATE.start_main_~arr~0.base_13 (store (select |v_#memory_int_9| v_ULTIMATE.start_main_~arr~0.base_13) .cse1 |v_ULTIMATE.start_main_#t~nondet5_8|)) |v_#memory_int_8|) (= (+ v_ULTIMATE.start_main_~i~0_17 1) v_ULTIMATE.start_main_~i~0_16) (<= 0 .cse1) (= 1 (select |v_#valid_21| v_ULTIMATE.start_main_~arr~0.base_13))))) InVars {ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_11, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_13, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_8|, #valid=|v_#valid_21|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_17, #length=|v_#length_11|} OutVars{ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_11, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_13, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_7|, #valid=|v_#valid_21|, #memory_int=|v_#memory_int_8|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_16, #length=|v_#length_11|, ULTIMATE.start_main_#t~post4=|v_ULTIMATE.start_main_#t~post4_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5, #memory_int, ULTIMATE.start_main_~i~0, ULTIMATE.start_main_#t~post4] 240#L13-3 150.94/117.00 [2019-03-28 12:39:16,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 150.94/117.00 [2019-03-28 12:39:16,125 INFO L82 PathProgramCache]: Analyzing trace with hash 1717472227, now seen corresponding path program 1 times 150.94/117.00 [2019-03-28 12:39:16,126 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 150.94/117.00 [2019-03-28 12:39:16,126 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 150.94/117.00 [2019-03-28 12:39:16,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 150.94/117.00 [2019-03-28 12:39:16,127 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 150.94/117.00 [2019-03-28 12:39:16,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 150.94/117.00 [2019-03-28 12:39:16,129 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic 150.94/117.00 [2019-03-28 12:39:16,129 INFO L258 seRefinementStrategy]: Advancing trace checker 150.94/117.00 [2019-03-28 12:39:16,129 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 150.94/117.00 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 150.94/117.00 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) 150.94/117.00 Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true 150.94/117.00 [2019-03-28 12:39:16,140 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 150.94/117.00 [2019-03-28 12:39:16,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 150.94/117.00 [2019-03-28 12:39:16,152 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 3 conjunts are in the unsatisfiable core 150.94/117.00 [2019-03-28 12:39:16,152 INFO L279 TraceCheckSpWp]: Computing forward predicates... 150.94/117.00 [2019-03-28 12:39:16,156 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 150.94/117.00 [2019-03-28 12:39:16,183 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 150.94/117.00 [2019-03-28 12:39:16,183 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 150.94/117.00 [2019-03-28 12:39:16,183 INFO L799 eck$LassoCheckResult]: stem already infeasible 150.94/117.00 [2019-03-28 12:39:16,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 150.94/117.00 [2019-03-28 12:39:16,184 INFO L82 PathProgramCache]: Analyzing trace with hash 5405, now seen corresponding path program 6 times 150.94/117.00 [2019-03-28 12:39:16,184 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 150.94/117.00 [2019-03-28 12:39:16,184 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 150.94/117.00 [2019-03-28 12:39:16,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 150.94/117.00 [2019-03-28 12:39:16,185 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 150.94/117.00 [2019-03-28 12:39:16,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 150.94/117.00 [2019-03-28 12:39:16,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 150.94/117.00 [2019-03-28 12:39:16,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 150.94/117.00 [2019-03-28 12:39:16,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 150.94/117.00 [2019-03-28 12:39:16,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 150.94/117.00 [2019-03-28 12:39:16,226 INFO L87 Difference]: Start difference. First operand 12 states and 33 transitions. cyclomatic complexity: 23 Second operand 3 states. 150.94/117.00 [2019-03-28 12:39:16,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 150.94/117.00 [2019-03-28 12:39:16,296 INFO L93 Difference]: Finished difference Result 19 states and 53 transitions. 150.94/117.00 [2019-03-28 12:39:16,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 150.94/117.00 [2019-03-28 12:39:16,297 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 53 transitions. 150.94/117.00 [2019-03-28 12:39:16,297 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 10 150.94/117.00 [2019-03-28 12:39:16,298 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 19 states and 53 transitions. 150.94/117.00 [2019-03-28 12:39:16,298 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 150.94/117.00 [2019-03-28 12:39:16,298 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 150.94/117.00 [2019-03-28 12:39:16,298 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 53 transitions. 150.94/117.00 [2019-03-28 12:39:16,299 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 150.94/117.00 [2019-03-28 12:39:16,299 INFO L706 BuchiCegarLoop]: Abstraction has 19 states and 53 transitions. 150.94/117.00 [2019-03-28 12:39:16,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 53 transitions. 150.94/117.00 [2019-03-28 12:39:16,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 14. 150.94/117.00 [2019-03-28 12:39:16,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. 150.94/117.00 [2019-03-28 12:39:16,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 36 transitions. 150.94/117.00 [2019-03-28 12:39:16,300 INFO L729 BuchiCegarLoop]: Abstraction has 14 states and 36 transitions. 150.94/117.00 [2019-03-28 12:39:16,300 INFO L609 BuchiCegarLoop]: Abstraction has 14 states and 36 transitions. 150.94/117.00 [2019-03-28 12:39:16,301 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ 150.94/117.00 [2019-03-28 12:39:16,301 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 36 transitions. 150.94/117.00 [2019-03-28 12:39:16,301 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 150.94/117.00 [2019-03-28 12:39:16,301 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 150.94/117.00 [2019-03-28 12:39:16,301 INFO L119 BuchiIsEmpty]: Starting construction of run 150.94/117.00 [2019-03-28 12:39:16,302 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] 150.94/117.00 [2019-03-28 12:39:16,302 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] 150.94/117.00 [2019-03-28 12:39:16,302 INFO L794 eck$LassoCheckResult]: Stem: 298#ULTIMATE.startENTRY [1526] ULTIMATE.startENTRY-->L7: Formula: (and (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|) (= |v_#valid_18| (store |v_#valid_19| 0 0))) InVars {#valid=|v_#valid_19|} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_6|, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_4|, ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_9, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_4|, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13, ULTIMATE.start_main_~fac~0=v_ULTIMATE.start_main_~fac~0_9, ULTIMATE.start_main_#t~malloc3.offset=|v_ULTIMATE.start_main_#t~malloc3.offset_7|, ULTIMATE.start_main_#t~post6=|v_ULTIMATE.start_main_#t~post6_4|, ULTIMATE.start_main_~arr2~0.base=v_ULTIMATE.start_main_~arr2~0.base_8, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~post4=|v_ULTIMATE.start_main_#t~post4_4|, ULTIMATE.start_main_~arr2~0.offset=v_ULTIMATE.start_main_~arr2~0.offset_7, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_5|, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_11, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_11, ULTIMATE.start_main_#t~malloc2.base=|v_ULTIMATE.start_main_#t~malloc2.base_7|, ULTIMATE.start_main_#t~malloc2.offset=|v_ULTIMATE.start_main_#t~malloc2.offset_7|, ULTIMATE.start_main_#t~malloc3.base=|v_ULTIMATE.start_main_#t~malloc3.base_7|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_5|, #valid=|v_#valid_18|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_~arr~0.offset, ULTIMATE.start_main_#t~nondet5, #NULL.offset, ULTIMATE.start_main_~i~0, ULTIMATE.start_main_~fac~0, ULTIMATE.start_main_#t~malloc3.offset, ULTIMATE.start_main_#t~post6, ULTIMATE.start_main_~arr2~0.base, #NULL.base, ULTIMATE.start_main_#t~post4, ULTIMATE.start_main_~arr2~0.offset, ULTIMATE.start_main_#t~mem7, ULTIMATE.start_main_~arr~0.base, ULTIMATE.start_main_~j~0, ULTIMATE.start_main_#t~malloc2.base, ULTIMATE.start_main_#t~malloc2.offset, ULTIMATE.start_main_#t~malloc3.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_~length~0] 299#L7 [97] L7-->L7-2: Formula: (>= v_ULTIMATE.start_main_~length~0_6 1) InVars {ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_6} OutVars{ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_6} AuxVars[] AssignedVars[] 295#L7-2 [64] L7-2-->L9: Formula: (= v_ULTIMATE.start_main_~fac~0_2 |v_ULTIMATE.start_main_#t~nondet1_3|) InVars {ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_3|} OutVars{ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_2|, ULTIMATE.start_main_~fac~0=v_ULTIMATE.start_main_~fac~0_2} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_~fac~0] 296#L9 [68] L9-->L9-2: Formula: (and (= v_ULTIMATE.start_main_~fac~0_3 1) (< v_ULTIMATE.start_main_~fac~0_4 1)) InVars {ULTIMATE.start_main_~fac~0=v_ULTIMATE.start_main_~fac~0_4} OutVars{ULTIMATE.start_main_~fac~0=v_ULTIMATE.start_main_~fac~0_3} AuxVars[] AssignedVars[ULTIMATE.start_main_~fac~0] 302#L9-2 [112] L9-2-->L12: Formula: (let ((.cse0 (store |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc2.base_2| 1))) (and (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc3.base_2|) 0) (= 0 |v_ULTIMATE.start_main_#t~malloc2.offset_2|) (= v_ULTIMATE.start_main_~arr~0.offset_2 |v_ULTIMATE.start_main_#t~malloc2.offset_2|) (= v_ULTIMATE.start_main_~arr2~0.base_2 |v_ULTIMATE.start_main_#t~malloc3.base_2|) (< |v_ULTIMATE.start_main_#t~malloc3.base_2| 0) (= |v_#length_1| (store (store |v_#length_3| |v_ULTIMATE.start_main_#t~malloc2.base_2| (* 4 v_ULTIMATE.start_main_~length~0_7)) |v_ULTIMATE.start_main_#t~malloc3.base_2| (* 4 (* v_ULTIMATE.start_main_~fac~0_6 v_ULTIMATE.start_main_~length~0_7)))) (= 0 |v_ULTIMATE.start_main_#t~malloc3.offset_2|) (> 0 |v_ULTIMATE.start_main_#t~malloc2.base_2|) (< |v_ULTIMATE.start_main_#t~malloc2.base_2| |v_#StackHeapBarrier_1|) (= (store .cse0 |v_ULTIMATE.start_main_#t~malloc3.base_2| 1) |v_#valid_3|) (= v_ULTIMATE.start_main_~arr~0.base_2 |v_ULTIMATE.start_main_#t~malloc2.base_2|) (= v_ULTIMATE.start_main_~arr2~0.offset_2 |v_ULTIMATE.start_main_#t~malloc3.offset_2|) (= (select |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc2.base_2|) 0) (< |v_ULTIMATE.start_main_#t~malloc3.base_2| |v_#StackHeapBarrier_1|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, ULTIMATE.start_main_~fac~0=v_ULTIMATE.start_main_~fac~0_6, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_7, #valid=|v_#valid_5|} OutVars{ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_2, ULTIMATE.start_main_~fac~0=v_ULTIMATE.start_main_~fac~0_6, ULTIMATE.start_main_#t~malloc3.offset=|v_ULTIMATE.start_main_#t~malloc3.offset_2|, ULTIMATE.start_main_~arr2~0.base=v_ULTIMATE.start_main_~arr2~0.base_2, ULTIMATE.start_main_~arr2~0.offset=v_ULTIMATE.start_main_~arr2~0.offset_2, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_2, ULTIMATE.start_main_#t~malloc2.base=|v_ULTIMATE.start_main_#t~malloc2.base_2|, ULTIMATE.start_main_#t~malloc2.offset=|v_ULTIMATE.start_main_#t~malloc2.offset_2|, ULTIMATE.start_main_#t~malloc3.base=|v_ULTIMATE.start_main_#t~malloc3.base_2|, #valid=|v_#valid_3|, #length=|v_#length_1|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~arr~0.offset, ULTIMATE.start_main_~arr~0.base, ULTIMATE.start_main_#t~malloc2.base, ULTIMATE.start_main_#t~malloc2.offset, ULTIMATE.start_main_#t~malloc3.base, #valid, #length, ULTIMATE.start_main_#t~malloc3.offset, ULTIMATE.start_main_~arr2~0.base, ULTIMATE.start_main_~arr2~0.offset] 303#L12 [130] L12-->L13-3: Formula: (and (= v_ULTIMATE.start_main_~i~0_4 0) (< v_ULTIMATE.start_main_~arr~0.base_4 0) (< v_ULTIMATE.start_main_~arr2~0.base_4 0)) InVars {ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_4, ULTIMATE.start_main_~arr2~0.base=v_ULTIMATE.start_main_~arr2~0.base_4} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_4, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_4, ULTIMATE.start_main_~arr2~0.base=v_ULTIMATE.start_main_~arr2~0.base_4} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 292#L13-3 150.94/117.00 [2019-03-28 12:39:16,303 INFO L796 eck$LassoCheckResult]: Loop: 292#L13-3 [94] L13-3-->L14: Formula: (< v_ULTIMATE.start_main_~i~0_6 v_ULTIMATE.start_main_~length~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_6, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_6, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_9} AuxVars[] AssignedVars[] 294#L14 [1530] L14-->L13-3: Formula: (let ((.cse0 (* 4 v_ULTIMATE.start_main_~i~0_17))) (let ((.cse1 (+ .cse0 v_ULTIMATE.start_main_~arr~0.offset_11))) (and (<= (+ .cse0 v_ULTIMATE.start_main_~arr~0.offset_11 4) (select |v_#length_11| v_ULTIMATE.start_main_~arr~0.base_13)) (= (store |v_#memory_int_9| v_ULTIMATE.start_main_~arr~0.base_13 (store (select |v_#memory_int_9| v_ULTIMATE.start_main_~arr~0.base_13) .cse1 |v_ULTIMATE.start_main_#t~nondet5_8|)) |v_#memory_int_8|) (= (+ v_ULTIMATE.start_main_~i~0_17 1) v_ULTIMATE.start_main_~i~0_16) (<= 0 .cse1) (= 1 (select |v_#valid_21| v_ULTIMATE.start_main_~arr~0.base_13))))) InVars {ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_11, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_13, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_8|, #valid=|v_#valid_21|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_17, #length=|v_#length_11|} OutVars{ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_11, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_13, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_7|, #valid=|v_#valid_21|, #memory_int=|v_#memory_int_8|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_16, #length=|v_#length_11|, ULTIMATE.start_main_#t~post4=|v_ULTIMATE.start_main_#t~post4_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5, #memory_int, ULTIMATE.start_main_~i~0, ULTIMATE.start_main_#t~post4] 292#L13-3 150.94/117.00 [2019-03-28 12:39:16,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 150.94/117.00 [2019-03-28 12:39:16,303 INFO L82 PathProgramCache]: Analyzing trace with hash 1717472258, now seen corresponding path program 1 times 150.94/117.00 [2019-03-28 12:39:16,303 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 150.94/117.00 [2019-03-28 12:39:16,303 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 150.94/117.00 [2019-03-28 12:39:16,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 150.94/117.00 [2019-03-28 12:39:16,304 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 150.94/117.00 [2019-03-28 12:39:16,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 150.94/117.00 [2019-03-28 12:39:16,306 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic 150.94/117.00 [2019-03-28 12:39:16,307 INFO L258 seRefinementStrategy]: Advancing trace checker 150.94/117.00 [2019-03-28 12:39:16,307 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 150.94/117.00 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 150.94/117.00 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) 150.94/117.00 Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true 150.94/117.00 [2019-03-28 12:39:16,318 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 150.94/117.00 [2019-03-28 12:39:16,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 150.94/117.00 [2019-03-28 12:39:16,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 150.94/117.00 [2019-03-28 12:39:16,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 150.94/117.00 [2019-03-28 12:39:16,377 INFO L82 PathProgramCache]: Analyzing trace with hash 5405, now seen corresponding path program 7 times 150.94/117.00 [2019-03-28 12:39:16,377 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 150.94/117.00 [2019-03-28 12:39:16,377 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 150.94/117.00 [2019-03-28 12:39:16,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 150.94/117.00 [2019-03-28 12:39:16,378 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 150.94/117.00 [2019-03-28 12:39:16,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 150.94/117.00 [2019-03-28 12:39:16,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 150.94/117.00 [2019-03-28 12:39:16,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 150.94/117.00 [2019-03-28 12:39:16,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 150.94/117.00 [2019-03-28 12:39:16,385 INFO L82 PathProgramCache]: Analyzing trace with hash 1223402718, now seen corresponding path program 1 times 150.94/117.00 [2019-03-28 12:39:16,385 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 150.94/117.00 [2019-03-28 12:39:16,385 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 150.94/117.00 [2019-03-28 12:39:16,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 150.94/117.00 [2019-03-28 12:39:16,386 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 150.94/117.00 [2019-03-28 12:39:16,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 150.94/117.00 [2019-03-28 12:39:16,388 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic 150.94/117.00 [2019-03-28 12:39:16,388 INFO L258 seRefinementStrategy]: Advancing trace checker 150.94/117.00 [2019-03-28 12:39:16,389 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 150.94/117.00 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 150.94/117.00 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) 150.94/117.00 [2019-03-28 12:39:16,406 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 150.94/117.00 [2019-03-28 12:39:16,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 150.94/117.00 Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true 150.94/117.00 [2019-03-28 12:39:16,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 150.94/117.00 [2019-03-28 12:39:16,709 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 57 150.94/117.00 [2019-03-28 12:39:16,785 INFO L216 LassoAnalysis]: Preferences: 150.94/117.00 [2019-03-28 12:39:16,786 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 150.94/117.00 [2019-03-28 12:39:16,786 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 150.94/117.00 [2019-03-28 12:39:16,786 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 150.94/117.00 [2019-03-28 12:39:16,787 INFO L127 ssoRankerPreferences]: Use exernal solver: false 150.94/117.00 [2019-03-28 12:39:16,787 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 150.94/117.00 [2019-03-28 12:39:16,787 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 150.94/117.00 [2019-03-28 12:39:16,787 INFO L130 ssoRankerPreferences]: Path of dumped script: 150.94/117.00 [2019-03-28 12:39:16,787 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration7_Lasso 150.94/117.00 [2019-03-28 12:39:16,787 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 150.94/117.00 [2019-03-28 12:39:16,788 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 150.94/117.00 [2019-03-28 12:39:16,804 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 150.94/117.00 [2019-03-28 12:39:16,809 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 150.94/117.00 [2019-03-28 12:39:16,811 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 150.94/117.00 [2019-03-28 12:39:16,813 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 150.94/117.00 [2019-03-28 12:39:16,815 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 150.94/117.00 [2019-03-28 12:39:16,821 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 150.94/117.00 [2019-03-28 12:39:16,824 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 150.94/117.00 [2019-03-28 12:39:16,826 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 150.94/117.00 [2019-03-28 12:39:16,829 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 150.94/117.00 [2019-03-28 12:39:16,980 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 150.94/117.00 [2019-03-28 12:39:16,983 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 150.94/117.00 [2019-03-28 12:39:17,258 INFO L300 LassoAnalysis]: Preprocessing complete. 150.94/117.00 [2019-03-28 12:39:17,265 INFO L497 LassoAnalysis]: Using template 'affine'. 150.94/117.00 [2019-03-28 12:39:17,267 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 150.94/117.00 Termination analysis: LINEAR_WITH_GUESSES 150.94/117.00 Number of strict supporting invariants: 0 150.94/117.00 Number of non-strict supporting invariants: 1 150.94/117.00 Consider only non-deceasing supporting invariants: true 150.94/117.00 Simplify termination arguments: true 150.94/117.00 Simplify supporting invariants: trueOverapproximate stem: false 150.94/117.00 [2019-03-28 12:39:17,269 INFO L339 nArgumentSynthesizer]: Template has degree 0. 150.94/117.00 [2019-03-28 12:39:17,269 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 150.94/117.00 [2019-03-28 12:39:17,270 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 150.94/117.00 [2019-03-28 12:39:17,270 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 150.94/117.00 [2019-03-28 12:39:17,270 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 150.94/117.00 [2019-03-28 12:39:17,272 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 150.94/117.00 [2019-03-28 12:39:17,272 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 150.94/117.00 [2019-03-28 12:39:17,275 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 150.94/117.00 [2019-03-28 12:39:17,276 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 150.94/117.00 Termination analysis: LINEAR_WITH_GUESSES 150.94/117.00 Number of strict supporting invariants: 0 150.94/117.00 Number of non-strict supporting invariants: 1 150.94/117.00 Consider only non-deceasing supporting invariants: true 150.94/117.00 Simplify termination arguments: true 150.94/117.00 Simplify supporting invariants: trueOverapproximate stem: false 150.94/117.00 [2019-03-28 12:39:17,276 INFO L339 nArgumentSynthesizer]: Template has degree 0. 150.94/117.00 [2019-03-28 12:39:17,276 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 150.94/117.00 [2019-03-28 12:39:17,276 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 150.94/117.00 [2019-03-28 12:39:17,277 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 150.94/117.00 [2019-03-28 12:39:17,277 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 150.94/117.00 [2019-03-28 12:39:17,277 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 150.94/117.00 [2019-03-28 12:39:17,277 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 150.94/117.00 [2019-03-28 12:39:17,278 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 150.94/117.00 [2019-03-28 12:39:17,278 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 150.94/117.00 Termination analysis: LINEAR_WITH_GUESSES 150.94/117.00 Number of strict supporting invariants: 0 150.94/117.00 Number of non-strict supporting invariants: 1 150.94/117.00 Consider only non-deceasing supporting invariants: true 150.94/117.00 Simplify termination arguments: true 150.94/117.00 Simplify supporting invariants: trueOverapproximate stem: false 150.94/117.00 [2019-03-28 12:39:17,279 INFO L339 nArgumentSynthesizer]: Template has degree 0. 150.94/117.00 [2019-03-28 12:39:17,279 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 150.94/117.00 [2019-03-28 12:39:17,279 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 150.94/117.00 [2019-03-28 12:39:17,279 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 150.94/117.00 [2019-03-28 12:39:17,279 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 150.94/117.00 [2019-03-28 12:39:17,280 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 150.94/117.00 [2019-03-28 12:39:17,280 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 150.94/117.00 [2019-03-28 12:39:17,281 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 150.94/117.00 [2019-03-28 12:39:17,281 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 150.94/117.00 Termination analysis: LINEAR_WITH_GUESSES 150.94/117.00 Number of strict supporting invariants: 0 150.94/117.00 Number of non-strict supporting invariants: 1 150.94/117.00 Consider only non-deceasing supporting invariants: true 150.94/117.00 Simplify termination arguments: true 150.94/117.00 Simplify supporting invariants: trueOverapproximate stem: false 150.94/117.00 [2019-03-28 12:39:17,282 INFO L339 nArgumentSynthesizer]: Template has degree 0. 150.94/117.00 [2019-03-28 12:39:17,282 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 150.94/117.00 [2019-03-28 12:39:17,282 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 150.94/117.00 [2019-03-28 12:39:17,282 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 150.94/117.00 [2019-03-28 12:39:17,282 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 150.94/117.00 [2019-03-28 12:39:17,283 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 150.94/117.00 [2019-03-28 12:39:17,283 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 150.94/117.00 [2019-03-28 12:39:17,283 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 150.94/117.00 [2019-03-28 12:39:17,284 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 150.94/117.00 Termination analysis: LINEAR_WITH_GUESSES 150.94/117.00 Number of strict supporting invariants: 0 150.94/117.00 Number of non-strict supporting invariants: 1 150.94/117.00 Consider only non-deceasing supporting invariants: true 150.94/117.00 Simplify termination arguments: true 150.94/117.00 Simplify supporting invariants: trueOverapproximate stem: false 150.94/117.00 [2019-03-28 12:39:17,284 INFO L339 nArgumentSynthesizer]: Template has degree 0. 150.94/117.00 [2019-03-28 12:39:17,284 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 150.94/117.00 [2019-03-28 12:39:17,284 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 150.94/117.00 [2019-03-28 12:39:17,285 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 150.94/117.00 [2019-03-28 12:39:17,287 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 150.94/117.00 [2019-03-28 12:39:17,287 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 150.94/117.00 [2019-03-28 12:39:17,291 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 150.94/117.00 [2019-03-28 12:39:17,292 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 150.94/117.00 Termination analysis: LINEAR_WITH_GUESSES 150.94/117.00 Number of strict supporting invariants: 0 150.94/117.00 Number of non-strict supporting invariants: 1 150.94/117.00 Consider only non-deceasing supporting invariants: true 150.94/117.00 Simplify termination arguments: true 150.94/117.00 Simplify supporting invariants: trueOverapproximate stem: false 150.94/117.00 [2019-03-28 12:39:17,292 INFO L339 nArgumentSynthesizer]: Template has degree 0. 150.94/117.00 [2019-03-28 12:39:17,292 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 150.94/117.00 [2019-03-28 12:39:17,293 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 150.94/117.00 [2019-03-28 12:39:17,293 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 150.94/117.00 [2019-03-28 12:39:17,294 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 150.94/117.00 [2019-03-28 12:39:17,294 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 150.94/117.00 [2019-03-28 12:39:17,297 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 150.94/117.00 [2019-03-28 12:39:17,297 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 150.94/117.00 Termination analysis: LINEAR_WITH_GUESSES 150.94/117.00 Number of strict supporting invariants: 0 150.94/117.00 Number of non-strict supporting invariants: 1 150.94/117.00 Consider only non-deceasing supporting invariants: true 150.94/117.00 Simplify termination arguments: true 150.94/117.00 Simplify supporting invariants: trueOverapproximate stem: false 150.94/117.00 [2019-03-28 12:39:17,298 INFO L339 nArgumentSynthesizer]: Template has degree 0. 150.94/117.00 [2019-03-28 12:39:17,298 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 150.94/117.00 [2019-03-28 12:39:17,298 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 150.94/117.00 [2019-03-28 12:39:17,298 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 150.94/117.00 [2019-03-28 12:39:17,299 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 150.94/117.00 [2019-03-28 12:39:17,299 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 150.94/117.00 [2019-03-28 12:39:17,299 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 150.94/117.00 [2019-03-28 12:39:17,300 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 150.94/117.00 [2019-03-28 12:39:17,300 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 150.94/117.00 Termination analysis: LINEAR_WITH_GUESSES 150.94/117.00 Number of strict supporting invariants: 0 150.94/117.00 Number of non-strict supporting invariants: 1 150.94/117.00 Consider only non-deceasing supporting invariants: true 150.94/117.00 Simplify termination arguments: true 150.94/117.00 Simplify supporting invariants: trueOverapproximate stem: false 150.94/117.00 [2019-03-28 12:39:17,301 INFO L339 nArgumentSynthesizer]: Template has degree 0. 150.94/117.00 [2019-03-28 12:39:17,301 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 150.94/117.00 [2019-03-28 12:39:17,301 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 150.94/117.00 [2019-03-28 12:39:17,301 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 150.94/117.00 [2019-03-28 12:39:17,302 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 150.94/117.00 [2019-03-28 12:39:17,302 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 150.94/117.00 [2019-03-28 12:39:17,302 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 150.94/117.00 [2019-03-28 12:39:17,303 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 150.94/117.00 [2019-03-28 12:39:17,303 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 150.94/117.00 Termination analysis: LINEAR_WITH_GUESSES 150.94/117.00 Number of strict supporting invariants: 0 150.94/117.00 Number of non-strict supporting invariants: 1 150.94/117.00 Consider only non-deceasing supporting invariants: true 150.94/117.00 Simplify termination arguments: true 150.94/117.00 Simplify supporting invariants: trueOverapproximate stem: false 150.94/117.00 [2019-03-28 12:39:17,304 INFO L339 nArgumentSynthesizer]: Template has degree 0. 150.94/117.00 [2019-03-28 12:39:17,304 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 150.94/117.00 [2019-03-28 12:39:17,304 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 150.94/117.00 [2019-03-28 12:39:17,304 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 150.94/117.00 [2019-03-28 12:39:17,310 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 150.94/117.00 [2019-03-28 12:39:17,310 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 150.94/117.00 [2019-03-28 12:39:17,352 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 150.94/117.00 [2019-03-28 12:39:17,387 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. 150.94/117.00 [2019-03-28 12:39:17,387 INFO L444 ModelExtractionUtils]: 21 out of 28 variables were initially zero. Simplification set additionally 3 variables to zero. 150.94/117.00 [2019-03-28 12:39:17,390 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 150.94/117.00 [2019-03-28 12:39:17,392 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. 150.94/117.00 [2019-03-28 12:39:17,392 INFO L518 LassoAnalysis]: Proved termination. 150.94/117.00 [2019-03-28 12:39:17,393 INFO L520 LassoAnalysis]: Termination argument consisting of: 150.94/117.00 Ranking function f(ULTIMATE.start_main_~arr~0.offset, ULTIMATE.start_main_~i~0, v_rep(select #length ULTIMATE.start_main_~arr~0.base)_1) = -1*ULTIMATE.start_main_~arr~0.offset - 4*ULTIMATE.start_main_~i~0 + 1*v_rep(select #length ULTIMATE.start_main_~arr~0.base)_1 150.94/117.00 Supporting invariants [] 150.94/117.00 [2019-03-28 12:39:17,409 INFO L297 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed 150.94/117.00 [2019-03-28 12:39:17,412 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 150.94/117.00 [2019-03-28 12:39:17,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 150.94/117.00 [2019-03-28 12:39:17,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 150.94/117.00 [2019-03-28 12:39:17,442 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 2 conjunts are in the unsatisfiable core 150.94/117.00 [2019-03-28 12:39:17,443 INFO L279 TraceCheckSpWp]: Computing forward predicates... 150.94/117.00 [2019-03-28 12:39:17,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 150.94/117.00 [2019-03-28 12:39:17,450 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core 150.94/117.00 [2019-03-28 12:39:17,451 INFO L279 TraceCheckSpWp]: Computing forward predicates... 150.94/117.00 [2019-03-28 12:39:17,451 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 150.94/117.00 [2019-03-28 12:39:17,454 INFO L98 LoopCannibalizer]: 1 predicates before loop cannibalization 1 predicates after loop cannibalization 150.94/117.00 [2019-03-28 12:39:17,458 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates 150.94/117.00 [2019-03-28 12:39:17,459 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 14 states and 36 transitions. cyclomatic complexity: 24 Second operand 3 states. 150.94/117.00 [2019-03-28 12:39:17,566 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 14 states and 36 transitions. cyclomatic complexity: 24. Second operand 3 states. Result 25 states and 74 transitions. Complement of second has 4 states. 150.94/117.00 [2019-03-28 12:39:17,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states 150.94/117.00 [2019-03-28 12:39:17,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. 150.94/117.00 [2019-03-28 12:39:17,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 49 transitions. 150.94/117.00 [2019-03-28 12:39:17,569 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 49 transitions. Stem has 6 letters. Loop has 2 letters. 150.94/117.00 [2019-03-28 12:39:17,569 INFO L116 BuchiAccepts]: Finished buchiAccepts. 150.94/117.00 [2019-03-28 12:39:17,570 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 49 transitions. Stem has 8 letters. Loop has 2 letters. 150.94/117.00 [2019-03-28 12:39:17,570 INFO L116 BuchiAccepts]: Finished buchiAccepts. 150.94/117.00 [2019-03-28 12:39:17,570 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 49 transitions. Stem has 6 letters. Loop has 4 letters. 150.94/117.00 [2019-03-28 12:39:17,570 INFO L116 BuchiAccepts]: Finished buchiAccepts. 150.94/117.00 [2019-03-28 12:39:17,697 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 74 transitions. 150.94/117.00 [2019-03-28 12:39:17,698 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 150.94/117.00 [2019-03-28 12:39:17,699 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 21 states and 56 transitions. 150.94/117.00 [2019-03-28 12:39:17,699 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 150.94/117.00 [2019-03-28 12:39:17,699 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 150.94/117.00 [2019-03-28 12:39:17,700 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 56 transitions. 150.94/117.00 [2019-03-28 12:39:17,700 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 150.94/117.00 [2019-03-28 12:39:17,700 INFO L706 BuchiCegarLoop]: Abstraction has 21 states and 56 transitions. 150.94/117.00 [2019-03-28 12:39:17,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 56 transitions. 150.94/117.00 [2019-03-28 12:39:17,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 17. 150.94/117.00 [2019-03-28 12:39:17,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. 150.94/117.00 [2019-03-28 12:39:17,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 41 transitions. 150.94/117.00 [2019-03-28 12:39:17,702 INFO L729 BuchiCegarLoop]: Abstraction has 17 states and 41 transitions. 150.94/117.00 [2019-03-28 12:39:17,702 INFO L609 BuchiCegarLoop]: Abstraction has 17 states and 41 transitions. 150.94/117.00 [2019-03-28 12:39:17,702 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ 150.94/117.00 [2019-03-28 12:39:17,702 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 41 transitions. 150.94/117.00 [2019-03-28 12:39:17,702 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 150.94/117.00 [2019-03-28 12:39:17,702 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 150.94/117.00 [2019-03-28 12:39:17,703 INFO L119 BuchiIsEmpty]: Starting construction of run 150.94/117.00 [2019-03-28 12:39:17,703 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] 150.94/117.00 [2019-03-28 12:39:17,703 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] 150.94/117.00 [2019-03-28 12:39:17,703 INFO L794 eck$LassoCheckResult]: Stem: 405#ULTIMATE.startENTRY [1526] ULTIMATE.startENTRY-->L7: Formula: (and (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|) (= |v_#valid_18| (store |v_#valid_19| 0 0))) InVars {#valid=|v_#valid_19|} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_6|, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_4|, ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_9, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_4|, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13, ULTIMATE.start_main_~fac~0=v_ULTIMATE.start_main_~fac~0_9, ULTIMATE.start_main_#t~malloc3.offset=|v_ULTIMATE.start_main_#t~malloc3.offset_7|, ULTIMATE.start_main_#t~post6=|v_ULTIMATE.start_main_#t~post6_4|, ULTIMATE.start_main_~arr2~0.base=v_ULTIMATE.start_main_~arr2~0.base_8, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~post4=|v_ULTIMATE.start_main_#t~post4_4|, ULTIMATE.start_main_~arr2~0.offset=v_ULTIMATE.start_main_~arr2~0.offset_7, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_5|, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_11, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_11, ULTIMATE.start_main_#t~malloc2.base=|v_ULTIMATE.start_main_#t~malloc2.base_7|, ULTIMATE.start_main_#t~malloc2.offset=|v_ULTIMATE.start_main_#t~malloc2.offset_7|, ULTIMATE.start_main_#t~malloc3.base=|v_ULTIMATE.start_main_#t~malloc3.base_7|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_5|, #valid=|v_#valid_18|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_~arr~0.offset, ULTIMATE.start_main_#t~nondet5, #NULL.offset, ULTIMATE.start_main_~i~0, ULTIMATE.start_main_~fac~0, ULTIMATE.start_main_#t~malloc3.offset, ULTIMATE.start_main_#t~post6, ULTIMATE.start_main_~arr2~0.base, #NULL.base, ULTIMATE.start_main_#t~post4, ULTIMATE.start_main_~arr2~0.offset, ULTIMATE.start_main_#t~mem7, ULTIMATE.start_main_~arr~0.base, ULTIMATE.start_main_~j~0, ULTIMATE.start_main_#t~malloc2.base, ULTIMATE.start_main_#t~malloc2.offset, ULTIMATE.start_main_#t~malloc3.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_~length~0] 406#L7 [97] L7-->L7-2: Formula: (>= v_ULTIMATE.start_main_~length~0_6 1) InVars {ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_6} OutVars{ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_6} AuxVars[] AssignedVars[] 402#L7-2 [64] L7-2-->L9: Formula: (= v_ULTIMATE.start_main_~fac~0_2 |v_ULTIMATE.start_main_#t~nondet1_3|) InVars {ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_3|} OutVars{ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_2|, ULTIMATE.start_main_~fac~0=v_ULTIMATE.start_main_~fac~0_2} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_~fac~0] 403#L9 [68] L9-->L9-2: Formula: (and (= v_ULTIMATE.start_main_~fac~0_3 1) (< v_ULTIMATE.start_main_~fac~0_4 1)) InVars {ULTIMATE.start_main_~fac~0=v_ULTIMATE.start_main_~fac~0_4} OutVars{ULTIMATE.start_main_~fac~0=v_ULTIMATE.start_main_~fac~0_3} AuxVars[] AssignedVars[ULTIMATE.start_main_~fac~0] 410#L9-2 [112] L9-2-->L12: Formula: (let ((.cse0 (store |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc2.base_2| 1))) (and (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc3.base_2|) 0) (= 0 |v_ULTIMATE.start_main_#t~malloc2.offset_2|) (= v_ULTIMATE.start_main_~arr~0.offset_2 |v_ULTIMATE.start_main_#t~malloc2.offset_2|) (= v_ULTIMATE.start_main_~arr2~0.base_2 |v_ULTIMATE.start_main_#t~malloc3.base_2|) (< |v_ULTIMATE.start_main_#t~malloc3.base_2| 0) (= |v_#length_1| (store (store |v_#length_3| |v_ULTIMATE.start_main_#t~malloc2.base_2| (* 4 v_ULTIMATE.start_main_~length~0_7)) |v_ULTIMATE.start_main_#t~malloc3.base_2| (* 4 (* v_ULTIMATE.start_main_~fac~0_6 v_ULTIMATE.start_main_~length~0_7)))) (= 0 |v_ULTIMATE.start_main_#t~malloc3.offset_2|) (> 0 |v_ULTIMATE.start_main_#t~malloc2.base_2|) (< |v_ULTIMATE.start_main_#t~malloc2.base_2| |v_#StackHeapBarrier_1|) (= (store .cse0 |v_ULTIMATE.start_main_#t~malloc3.base_2| 1) |v_#valid_3|) (= v_ULTIMATE.start_main_~arr~0.base_2 |v_ULTIMATE.start_main_#t~malloc2.base_2|) (= v_ULTIMATE.start_main_~arr2~0.offset_2 |v_ULTIMATE.start_main_#t~malloc3.offset_2|) (= (select |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc2.base_2|) 0) (< |v_ULTIMATE.start_main_#t~malloc3.base_2| |v_#StackHeapBarrier_1|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, ULTIMATE.start_main_~fac~0=v_ULTIMATE.start_main_~fac~0_6, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_7, #valid=|v_#valid_5|} OutVars{ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_2, ULTIMATE.start_main_~fac~0=v_ULTIMATE.start_main_~fac~0_6, ULTIMATE.start_main_#t~malloc3.offset=|v_ULTIMATE.start_main_#t~malloc3.offset_2|, ULTIMATE.start_main_~arr2~0.base=v_ULTIMATE.start_main_~arr2~0.base_2, ULTIMATE.start_main_~arr2~0.offset=v_ULTIMATE.start_main_~arr2~0.offset_2, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_2, ULTIMATE.start_main_#t~malloc2.base=|v_ULTIMATE.start_main_#t~malloc2.base_2|, ULTIMATE.start_main_#t~malloc2.offset=|v_ULTIMATE.start_main_#t~malloc2.offset_2|, ULTIMATE.start_main_#t~malloc3.base=|v_ULTIMATE.start_main_#t~malloc3.base_2|, #valid=|v_#valid_3|, #length=|v_#length_1|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~arr~0.offset, ULTIMATE.start_main_~arr~0.base, ULTIMATE.start_main_#t~malloc2.base, ULTIMATE.start_main_#t~malloc2.offset, ULTIMATE.start_main_#t~malloc3.base, #valid, #length, ULTIMATE.start_main_#t~malloc3.offset, ULTIMATE.start_main_~arr2~0.base, ULTIMATE.start_main_~arr2~0.offset] 411#L12 [129] L12-->L13-3: Formula: (and (= v_ULTIMATE.start_main_~i~0_4 0) (> v_ULTIMATE.start_main_~arr2~0.base_4 0) (< v_ULTIMATE.start_main_~arr~0.base_4 0)) InVars {ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_4, ULTIMATE.start_main_~arr2~0.base=v_ULTIMATE.start_main_~arr2~0.base_4} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_4, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_4, ULTIMATE.start_main_~arr2~0.base=v_ULTIMATE.start_main_~arr2~0.base_4} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 409#L13-3 150.94/117.00 [2019-03-28 12:39:17,704 INFO L796 eck$LassoCheckResult]: Loop: 409#L13-3 [94] L13-3-->L14: Formula: (< v_ULTIMATE.start_main_~i~0_6 v_ULTIMATE.start_main_~length~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_6, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_6, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_9} AuxVars[] AssignedVars[] 414#L14 [1530] L14-->L13-3: Formula: (let ((.cse0 (* 4 v_ULTIMATE.start_main_~i~0_17))) (let ((.cse1 (+ .cse0 v_ULTIMATE.start_main_~arr~0.offset_11))) (and (<= (+ .cse0 v_ULTIMATE.start_main_~arr~0.offset_11 4) (select |v_#length_11| v_ULTIMATE.start_main_~arr~0.base_13)) (= (store |v_#memory_int_9| v_ULTIMATE.start_main_~arr~0.base_13 (store (select |v_#memory_int_9| v_ULTIMATE.start_main_~arr~0.base_13) .cse1 |v_ULTIMATE.start_main_#t~nondet5_8|)) |v_#memory_int_8|) (= (+ v_ULTIMATE.start_main_~i~0_17 1) v_ULTIMATE.start_main_~i~0_16) (<= 0 .cse1) (= 1 (select |v_#valid_21| v_ULTIMATE.start_main_~arr~0.base_13))))) InVars {ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_11, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_13, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_8|, #valid=|v_#valid_21|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_17, #length=|v_#length_11|} OutVars{ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_11, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_13, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_7|, #valid=|v_#valid_21|, #memory_int=|v_#memory_int_8|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_16, #length=|v_#length_11|, ULTIMATE.start_main_#t~post4=|v_ULTIMATE.start_main_#t~post4_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5, #memory_int, ULTIMATE.start_main_~i~0, ULTIMATE.start_main_#t~post4] 409#L13-3 150.94/117.00 [2019-03-28 12:39:17,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 150.94/117.00 [2019-03-28 12:39:17,704 INFO L82 PathProgramCache]: Analyzing trace with hash 1717472257, now seen corresponding path program 1 times 150.94/117.00 [2019-03-28 12:39:17,704 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 150.94/117.00 [2019-03-28 12:39:17,704 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 150.94/117.00 [2019-03-28 12:39:17,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 150.94/117.00 [2019-03-28 12:39:17,705 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 150.94/117.00 [2019-03-28 12:39:17,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 150.94/117.00 [2019-03-28 12:39:17,708 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic 150.94/117.00 [2019-03-28 12:39:17,708 INFO L258 seRefinementStrategy]: Advancing trace checker 150.94/117.00 [2019-03-28 12:39:17,708 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 150.94/117.00 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 150.94/117.00 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) 150.94/117.00 Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true 150.94/117.00 [2019-03-28 12:39:17,721 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 150.94/117.00 [2019-03-28 12:39:17,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 150.94/117.00 [2019-03-28 12:39:17,732 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 3 conjunts are in the unsatisfiable core 150.94/117.00 [2019-03-28 12:39:17,733 INFO L279 TraceCheckSpWp]: Computing forward predicates... 150.94/117.00 [2019-03-28 12:39:17,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 150.94/117.00 [2019-03-28 12:39:17,764 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 150.94/117.00 [2019-03-28 12:39:17,765 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 150.94/117.00 [2019-03-28 12:39:17,765 INFO L799 eck$LassoCheckResult]: stem already infeasible 150.94/117.00 [2019-03-28 12:39:17,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 150.94/117.00 [2019-03-28 12:39:17,765 INFO L82 PathProgramCache]: Analyzing trace with hash 5405, now seen corresponding path program 8 times 150.94/117.00 [2019-03-28 12:39:17,765 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 150.94/117.00 [2019-03-28 12:39:17,765 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 150.94/117.00 [2019-03-28 12:39:17,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 150.94/117.00 [2019-03-28 12:39:17,766 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 150.94/117.00 [2019-03-28 12:39:17,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 150.94/117.00 [2019-03-28 12:39:17,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 150.94/117.00 [2019-03-28 12:39:17,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 150.94/117.00 [2019-03-28 12:39:17,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 150.94/117.00 [2019-03-28 12:39:17,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 150.94/117.00 [2019-03-28 12:39:17,802 INFO L87 Difference]: Start difference. First operand 17 states and 41 transitions. cyclomatic complexity: 27 Second operand 3 states. 150.94/117.00 [2019-03-28 12:39:17,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 150.94/117.00 [2019-03-28 12:39:17,859 INFO L93 Difference]: Finished difference Result 22 states and 55 transitions. 150.94/117.00 [2019-03-28 12:39:17,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 150.94/117.00 [2019-03-28 12:39:17,961 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 55 transitions. 150.94/117.00 [2019-03-28 12:39:17,962 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 10 150.94/117.00 [2019-03-28 12:39:17,962 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 22 states and 55 transitions. 150.94/117.00 [2019-03-28 12:39:17,962 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 150.94/117.00 [2019-03-28 12:39:17,962 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 150.94/117.00 [2019-03-28 12:39:17,963 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 55 transitions. 150.94/117.00 [2019-03-28 12:39:17,963 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 150.94/117.00 [2019-03-28 12:39:17,963 INFO L706 BuchiCegarLoop]: Abstraction has 22 states and 55 transitions. 150.94/117.00 [2019-03-28 12:39:17,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 55 transitions. 150.94/117.00 [2019-03-28 12:39:17,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 17. 150.94/117.00 [2019-03-28 12:39:17,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. 150.94/117.00 [2019-03-28 12:39:17,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 38 transitions. 150.94/117.00 [2019-03-28 12:39:17,965 INFO L729 BuchiCegarLoop]: Abstraction has 17 states and 38 transitions. 150.94/117.00 [2019-03-28 12:39:17,965 INFO L609 BuchiCegarLoop]: Abstraction has 17 states and 38 transitions. 150.94/117.00 [2019-03-28 12:39:17,965 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ 150.94/117.00 [2019-03-28 12:39:17,965 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 38 transitions. 150.94/117.00 [2019-03-28 12:39:17,966 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 150.94/117.00 [2019-03-28 12:39:17,966 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 150.94/117.00 [2019-03-28 12:39:17,966 INFO L119 BuchiIsEmpty]: Starting construction of run 150.94/117.00 [2019-03-28 12:39:17,966 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] 150.94/117.00 [2019-03-28 12:39:17,966 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] 150.94/117.00 [2019-03-28 12:39:17,967 INFO L794 eck$LassoCheckResult]: Stem: 466#ULTIMATE.startENTRY [1526] ULTIMATE.startENTRY-->L7: Formula: (and (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|) (= |v_#valid_18| (store |v_#valid_19| 0 0))) InVars {#valid=|v_#valid_19|} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_6|, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_4|, ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_9, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_4|, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13, ULTIMATE.start_main_~fac~0=v_ULTIMATE.start_main_~fac~0_9, ULTIMATE.start_main_#t~malloc3.offset=|v_ULTIMATE.start_main_#t~malloc3.offset_7|, ULTIMATE.start_main_#t~post6=|v_ULTIMATE.start_main_#t~post6_4|, ULTIMATE.start_main_~arr2~0.base=v_ULTIMATE.start_main_~arr2~0.base_8, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~post4=|v_ULTIMATE.start_main_#t~post4_4|, ULTIMATE.start_main_~arr2~0.offset=v_ULTIMATE.start_main_~arr2~0.offset_7, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_5|, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_11, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_11, ULTIMATE.start_main_#t~malloc2.base=|v_ULTIMATE.start_main_#t~malloc2.base_7|, ULTIMATE.start_main_#t~malloc2.offset=|v_ULTIMATE.start_main_#t~malloc2.offset_7|, ULTIMATE.start_main_#t~malloc3.base=|v_ULTIMATE.start_main_#t~malloc3.base_7|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_5|, #valid=|v_#valid_18|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_~arr~0.offset, ULTIMATE.start_main_#t~nondet5, #NULL.offset, ULTIMATE.start_main_~i~0, ULTIMATE.start_main_~fac~0, ULTIMATE.start_main_#t~malloc3.offset, ULTIMATE.start_main_#t~post6, ULTIMATE.start_main_~arr2~0.base, #NULL.base, ULTIMATE.start_main_#t~post4, ULTIMATE.start_main_~arr2~0.offset, ULTIMATE.start_main_#t~mem7, ULTIMATE.start_main_~arr~0.base, ULTIMATE.start_main_~j~0, ULTIMATE.start_main_#t~malloc2.base, ULTIMATE.start_main_#t~malloc2.offset, ULTIMATE.start_main_#t~malloc3.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_~length~0] 467#L7 [97] L7-->L7-2: Formula: (>= v_ULTIMATE.start_main_~length~0_6 1) InVars {ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_6} OutVars{ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_6} AuxVars[] AssignedVars[] 463#L7-2 [64] L7-2-->L9: Formula: (= v_ULTIMATE.start_main_~fac~0_2 |v_ULTIMATE.start_main_#t~nondet1_3|) InVars {ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_3|} OutVars{ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_2|, ULTIMATE.start_main_~fac~0=v_ULTIMATE.start_main_~fac~0_2} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_~fac~0] 464#L9 [68] L9-->L9-2: Formula: (and (= v_ULTIMATE.start_main_~fac~0_3 1) (< v_ULTIMATE.start_main_~fac~0_4 1)) InVars {ULTIMATE.start_main_~fac~0=v_ULTIMATE.start_main_~fac~0_4} OutVars{ULTIMATE.start_main_~fac~0=v_ULTIMATE.start_main_~fac~0_3} AuxVars[] AssignedVars[ULTIMATE.start_main_~fac~0] 470#L9-2 [113] L9-2-->L12: Formula: (let ((.cse0 (store |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc2.base_2| 1))) (and (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc3.base_2|) 0) (< 0 |v_ULTIMATE.start_main_#t~malloc2.base_2|) (= 0 |v_ULTIMATE.start_main_#t~malloc2.offset_2|) (> |v_ULTIMATE.start_main_#t~malloc3.base_2| 0) (= v_ULTIMATE.start_main_~arr~0.offset_2 |v_ULTIMATE.start_main_#t~malloc2.offset_2|) (= v_ULTIMATE.start_main_~arr2~0.base_2 |v_ULTIMATE.start_main_#t~malloc3.base_2|) (= |v_#length_1| (store (store |v_#length_3| |v_ULTIMATE.start_main_#t~malloc2.base_2| (* 4 v_ULTIMATE.start_main_~length~0_7)) |v_ULTIMATE.start_main_#t~malloc3.base_2| (* 4 (* v_ULTIMATE.start_main_~fac~0_6 v_ULTIMATE.start_main_~length~0_7)))) (= 0 |v_ULTIMATE.start_main_#t~malloc3.offset_2|) (< |v_ULTIMATE.start_main_#t~malloc2.base_2| |v_#StackHeapBarrier_1|) (= (store .cse0 |v_ULTIMATE.start_main_#t~malloc3.base_2| 1) |v_#valid_3|) (= v_ULTIMATE.start_main_~arr~0.base_2 |v_ULTIMATE.start_main_#t~malloc2.base_2|) (= v_ULTIMATE.start_main_~arr2~0.offset_2 |v_ULTIMATE.start_main_#t~malloc3.offset_2|) (= (select |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc2.base_2|) 0) (< |v_ULTIMATE.start_main_#t~malloc3.base_2| |v_#StackHeapBarrier_1|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, ULTIMATE.start_main_~fac~0=v_ULTIMATE.start_main_~fac~0_6, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_7, #valid=|v_#valid_5|} OutVars{ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_2, ULTIMATE.start_main_~fac~0=v_ULTIMATE.start_main_~fac~0_6, ULTIMATE.start_main_#t~malloc3.offset=|v_ULTIMATE.start_main_#t~malloc3.offset_2|, ULTIMATE.start_main_~arr2~0.base=v_ULTIMATE.start_main_~arr2~0.base_2, ULTIMATE.start_main_~arr2~0.offset=v_ULTIMATE.start_main_~arr2~0.offset_2, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_2, ULTIMATE.start_main_#t~malloc2.base=|v_ULTIMATE.start_main_#t~malloc2.base_2|, ULTIMATE.start_main_#t~malloc2.offset=|v_ULTIMATE.start_main_#t~malloc2.offset_2|, ULTIMATE.start_main_#t~malloc3.base=|v_ULTIMATE.start_main_#t~malloc3.base_2|, #valid=|v_#valid_3|, #length=|v_#length_1|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~arr~0.offset, ULTIMATE.start_main_~arr~0.base, ULTIMATE.start_main_#t~malloc2.base, ULTIMATE.start_main_#t~malloc2.offset, ULTIMATE.start_main_#t~malloc3.base, #valid, #length, ULTIMATE.start_main_#t~malloc3.offset, ULTIMATE.start_main_~arr2~0.base, ULTIMATE.start_main_~arr2~0.offset] 472#L12 [122] L12-->L13-3: Formula: (and (= v_ULTIMATE.start_main_~i~0_4 0) (> v_ULTIMATE.start_main_~arr2~0.base_4 0) (> v_ULTIMATE.start_main_~arr~0.base_4 0)) InVars {ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_4, ULTIMATE.start_main_~arr2~0.base=v_ULTIMATE.start_main_~arr2~0.base_4} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_4, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_4, ULTIMATE.start_main_~arr2~0.base=v_ULTIMATE.start_main_~arr2~0.base_4} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 458#L13-3 150.94/117.00 [2019-03-28 12:39:17,967 INFO L796 eck$LassoCheckResult]: Loop: 458#L13-3 [94] L13-3-->L14: Formula: (< v_ULTIMATE.start_main_~i~0_6 v_ULTIMATE.start_main_~length~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_6, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_6, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_9} AuxVars[] AssignedVars[] 460#L14 [1530] L14-->L13-3: Formula: (let ((.cse0 (* 4 v_ULTIMATE.start_main_~i~0_17))) (let ((.cse1 (+ .cse0 v_ULTIMATE.start_main_~arr~0.offset_11))) (and (<= (+ .cse0 v_ULTIMATE.start_main_~arr~0.offset_11 4) (select |v_#length_11| v_ULTIMATE.start_main_~arr~0.base_13)) (= (store |v_#memory_int_9| v_ULTIMATE.start_main_~arr~0.base_13 (store (select |v_#memory_int_9| v_ULTIMATE.start_main_~arr~0.base_13) .cse1 |v_ULTIMATE.start_main_#t~nondet5_8|)) |v_#memory_int_8|) (= (+ v_ULTIMATE.start_main_~i~0_17 1) v_ULTIMATE.start_main_~i~0_16) (<= 0 .cse1) (= 1 (select |v_#valid_21| v_ULTIMATE.start_main_~arr~0.base_13))))) InVars {ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_11, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_13, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_8|, #valid=|v_#valid_21|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_17, #length=|v_#length_11|} OutVars{ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_11, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_13, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_7|, #valid=|v_#valid_21|, #memory_int=|v_#memory_int_8|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_16, #length=|v_#length_11|, ULTIMATE.start_main_#t~post4=|v_ULTIMATE.start_main_#t~post4_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5, #memory_int, ULTIMATE.start_main_~i~0, ULTIMATE.start_main_#t~post4] 458#L13-3 150.94/117.00 [2019-03-28 12:39:17,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 150.94/117.00 [2019-03-28 12:39:17,967 INFO L82 PathProgramCache]: Analyzing trace with hash 1717472281, now seen corresponding path program 1 times 150.94/117.00 [2019-03-28 12:39:17,967 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 150.94/117.00 [2019-03-28 12:39:17,968 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 150.94/117.00 [2019-03-28 12:39:17,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 150.94/117.00 [2019-03-28 12:39:17,968 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 150.94/117.00 [2019-03-28 12:39:17,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 150.94/117.00 [2019-03-28 12:39:17,970 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic 150.94/117.00 [2019-03-28 12:39:17,971 INFO L258 seRefinementStrategy]: Advancing trace checker 150.94/117.00 [2019-03-28 12:39:17,971 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 150.94/117.00 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 150.94/117.00 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) 150.94/117.00 Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true 150.94/117.00 [2019-03-28 12:39:17,984 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 150.94/117.00 [2019-03-28 12:39:17,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 150.94/117.00 [2019-03-28 12:39:18,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 150.94/117.00 [2019-03-28 12:39:18,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 150.94/117.00 [2019-03-28 12:39:18,034 INFO L82 PathProgramCache]: Analyzing trace with hash 5405, now seen corresponding path program 9 times 150.94/117.00 [2019-03-28 12:39:18,034 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 150.94/117.00 [2019-03-28 12:39:18,034 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 150.94/117.00 [2019-03-28 12:39:18,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 150.94/117.00 [2019-03-28 12:39:18,035 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 150.94/117.00 [2019-03-28 12:39:18,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 150.94/117.00 [2019-03-28 12:39:18,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 150.94/117.00 [2019-03-28 12:39:18,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 150.94/117.00 [2019-03-28 12:39:18,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 150.94/117.00 [2019-03-28 12:39:18,041 INFO L82 PathProgramCache]: Analyzing trace with hash 1223424821, now seen corresponding path program 1 times 150.94/117.00 [2019-03-28 12:39:18,042 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 150.94/117.00 [2019-03-28 12:39:18,042 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 150.94/117.00 [2019-03-28 12:39:18,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 150.94/117.00 [2019-03-28 12:39:18,043 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 150.94/117.00 [2019-03-28 12:39:18,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 150.94/117.00 [2019-03-28 12:39:18,044 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic 150.94/117.00 [2019-03-28 12:39:18,045 INFO L258 seRefinementStrategy]: Advancing trace checker 150.94/117.00 [2019-03-28 12:39:18,045 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 150.94/117.00 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 150.94/117.00 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) 150.94/117.00 Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true 150.94/117.00 [2019-03-28 12:39:18,058 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 150.94/117.00 [2019-03-28 12:39:18,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 150.94/117.00 [2019-03-28 12:39:18,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 150.94/117.00 [2019-03-28 12:39:18,265 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 57 150.94/117.00 [2019-03-28 12:39:18,322 INFO L216 LassoAnalysis]: Preferences: 150.94/117.00 [2019-03-28 12:39:18,322 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 150.94/117.00 [2019-03-28 12:39:18,322 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 150.94/117.00 [2019-03-28 12:39:18,322 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 150.94/117.00 [2019-03-28 12:39:18,322 INFO L127 ssoRankerPreferences]: Use exernal solver: false 150.94/117.00 [2019-03-28 12:39:18,323 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 150.94/117.00 [2019-03-28 12:39:18,323 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 150.94/117.00 [2019-03-28 12:39:18,323 INFO L130 ssoRankerPreferences]: Path of dumped script: 150.94/117.00 [2019-03-28 12:39:18,323 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration9_Lasso 150.94/117.00 [2019-03-28 12:39:18,323 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 150.94/117.00 [2019-03-28 12:39:18,323 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 150.94/117.00 [2019-03-28 12:39:18,325 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 150.94/117.00 [2019-03-28 12:39:18,331 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 150.94/117.00 [2019-03-28 12:39:18,336 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 150.94/117.00 [2019-03-28 12:39:18,339 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 150.94/117.00 [2019-03-28 12:39:18,341 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 150.94/117.00 [2019-03-28 12:39:18,343 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 150.94/117.00 [2019-03-28 12:39:18,345 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 150.94/117.00 [2019-03-28 12:39:18,350 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 150.94/117.00 [2019-03-28 12:39:18,483 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 150.94/117.00 [2019-03-28 12:39:18,487 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 150.94/117.00 [2019-03-28 12:39:18,489 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 150.94/117.00 [2019-03-28 12:39:18,734 INFO L300 LassoAnalysis]: Preprocessing complete. 150.94/117.00 [2019-03-28 12:39:18,734 INFO L497 LassoAnalysis]: Using template 'affine'. 150.94/117.00 [2019-03-28 12:39:18,734 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 150.94/117.00 Termination analysis: LINEAR_WITH_GUESSES 150.94/117.00 Number of strict supporting invariants: 0 150.94/117.00 Number of non-strict supporting invariants: 1 150.94/117.00 Consider only non-deceasing supporting invariants: true 150.94/117.00 Simplify termination arguments: true 150.94/117.00 Simplify supporting invariants: trueOverapproximate stem: false 150.94/117.00 [2019-03-28 12:39:18,735 INFO L339 nArgumentSynthesizer]: Template has degree 0. 150.94/117.00 [2019-03-28 12:39:18,735 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 150.94/117.00 [2019-03-28 12:39:18,735 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 150.94/117.00 [2019-03-28 12:39:18,736 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 150.94/117.00 [2019-03-28 12:39:18,737 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 150.94/117.00 [2019-03-28 12:39:18,737 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 150.94/117.00 [2019-03-28 12:39:18,739 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 150.94/117.00 [2019-03-28 12:39:18,740 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 150.94/117.00 Termination analysis: LINEAR_WITH_GUESSES 150.94/117.00 Number of strict supporting invariants: 0 150.94/117.00 Number of non-strict supporting invariants: 1 150.94/117.00 Consider only non-deceasing supporting invariants: true 150.94/117.00 Simplify termination arguments: true 150.94/117.00 Simplify supporting invariants: trueOverapproximate stem: false 150.94/117.00 [2019-03-28 12:39:18,740 INFO L339 nArgumentSynthesizer]: Template has degree 0. 150.94/117.00 [2019-03-28 12:39:18,740 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 150.94/117.00 [2019-03-28 12:39:18,740 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 150.94/117.00 [2019-03-28 12:39:18,740 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 150.94/117.00 [2019-03-28 12:39:18,742 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 150.94/117.00 [2019-03-28 12:39:18,742 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 150.94/117.00 [2019-03-28 12:39:18,744 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 150.94/117.00 [2019-03-28 12:39:18,745 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 150.94/117.00 Termination analysis: LINEAR_WITH_GUESSES 150.94/117.00 Number of strict supporting invariants: 0 150.94/117.00 Number of non-strict supporting invariants: 1 150.94/117.00 Consider only non-deceasing supporting invariants: true 150.94/117.00 Simplify termination arguments: true 150.94/117.00 Simplify supporting invariants: trueOverapproximate stem: false 150.94/117.00 [2019-03-28 12:39:18,745 INFO L339 nArgumentSynthesizer]: Template has degree 0. 150.94/117.00 [2019-03-28 12:39:18,745 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 150.94/117.00 [2019-03-28 12:39:18,745 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 150.94/117.00 [2019-03-28 12:39:18,746 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 150.94/117.00 [2019-03-28 12:39:18,746 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 150.94/117.00 [2019-03-28 12:39:18,746 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 150.94/117.00 [2019-03-28 12:39:18,746 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 150.94/117.00 [2019-03-28 12:39:18,747 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 150.94/117.00 [2019-03-28 12:39:18,747 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 150.94/117.00 Termination analysis: LINEAR_WITH_GUESSES 150.94/117.00 Number of strict supporting invariants: 0 150.94/117.00 Number of non-strict supporting invariants: 1 150.94/117.00 Consider only non-deceasing supporting invariants: true 150.94/117.00 Simplify termination arguments: true 150.94/117.00 Simplify supporting invariants: trueOverapproximate stem: false 150.94/117.00 [2019-03-28 12:39:18,747 INFO L339 nArgumentSynthesizer]: Template has degree 0. 150.94/117.00 [2019-03-28 12:39:18,748 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 150.94/117.00 [2019-03-28 12:39:18,748 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 150.94/117.00 [2019-03-28 12:39:18,748 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 150.94/117.00 [2019-03-28 12:39:18,748 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 150.94/117.00 [2019-03-28 12:39:18,748 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 150.94/117.00 [2019-03-28 12:39:18,749 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 150.94/117.00 [2019-03-28 12:39:18,749 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 150.94/117.00 [2019-03-28 12:39:18,749 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 150.94/117.00 Termination analysis: LINEAR_WITH_GUESSES 150.94/117.00 Number of strict supporting invariants: 0 150.94/117.00 Number of non-strict supporting invariants: 1 150.94/117.00 Consider only non-deceasing supporting invariants: true 150.94/117.00 Simplify termination arguments: true 150.94/117.00 Simplify supporting invariants: trueOverapproximate stem: false 150.94/117.00 [2019-03-28 12:39:18,750 INFO L339 nArgumentSynthesizer]: Template has degree 0. 150.94/117.00 [2019-03-28 12:39:18,750 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 150.94/117.00 [2019-03-28 12:39:18,750 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 150.94/117.00 [2019-03-28 12:39:18,750 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 150.94/117.00 [2019-03-28 12:39:18,750 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 150.94/117.00 [2019-03-28 12:39:18,750 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 150.94/117.00 [2019-03-28 12:39:18,751 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 150.94/117.00 [2019-03-28 12:39:18,751 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 150.94/117.00 [2019-03-28 12:39:18,751 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 150.94/117.00 Termination analysis: LINEAR_WITH_GUESSES 150.94/117.00 Number of strict supporting invariants: 0 150.94/117.00 Number of non-strict supporting invariants: 1 150.94/117.00 Consider only non-deceasing supporting invariants: true 150.94/117.00 Simplify termination arguments: true 150.94/117.00 Simplify supporting invariants: trueOverapproximate stem: false 150.94/117.00 [2019-03-28 12:39:18,752 INFO L339 nArgumentSynthesizer]: Template has degree 0. 150.94/117.00 [2019-03-28 12:39:18,752 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 150.94/117.00 [2019-03-28 12:39:18,752 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 150.94/117.00 [2019-03-28 12:39:18,752 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 150.94/117.00 [2019-03-28 12:39:18,752 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 150.94/117.00 [2019-03-28 12:39:18,753 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 150.94/117.00 [2019-03-28 12:39:18,753 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 150.94/117.00 [2019-03-28 12:39:18,753 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 150.94/117.00 [2019-03-28 12:39:18,753 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 150.94/117.00 Termination analysis: LINEAR_WITH_GUESSES 150.94/117.00 Number of strict supporting invariants: 0 150.94/117.00 Number of non-strict supporting invariants: 1 150.94/117.00 Consider only non-deceasing supporting invariants: true 150.94/117.00 Simplify termination arguments: true 150.94/117.00 Simplify supporting invariants: trueOverapproximate stem: false 150.94/117.00 [2019-03-28 12:39:18,754 INFO L339 nArgumentSynthesizer]: Template has degree 0. 150.94/117.00 [2019-03-28 12:39:18,754 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 150.94/117.00 [2019-03-28 12:39:18,754 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 150.94/117.00 [2019-03-28 12:39:18,754 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 150.94/117.00 [2019-03-28 12:39:18,755 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 150.94/117.00 [2019-03-28 12:39:18,755 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 150.94/117.00 [2019-03-28 12:39:18,755 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 150.94/117.00 [2019-03-28 12:39:18,755 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 150.94/117.00 [2019-03-28 12:39:18,756 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 150.94/117.00 Termination analysis: LINEAR_WITH_GUESSES 150.94/117.00 Number of strict supporting invariants: 0 150.94/117.00 Number of non-strict supporting invariants: 1 150.94/117.00 Consider only non-deceasing supporting invariants: true 150.94/117.00 Simplify termination arguments: true 150.94/117.00 Simplify supporting invariants: trueOverapproximate stem: false 150.94/117.00 [2019-03-28 12:39:18,756 INFO L339 nArgumentSynthesizer]: Template has degree 0. 150.94/117.00 [2019-03-28 12:39:18,756 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 150.94/117.00 [2019-03-28 12:39:18,756 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 150.94/117.00 [2019-03-28 12:39:18,757 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 150.94/117.00 [2019-03-28 12:39:18,758 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 150.94/117.00 [2019-03-28 12:39:18,759 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 150.94/117.00 [2019-03-28 12:39:18,767 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 150.94/117.00 [2019-03-28 12:39:18,767 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 150.94/117.00 Termination analysis: LINEAR_WITH_GUESSES 150.94/117.00 Number of strict supporting invariants: 0 150.94/117.00 Number of non-strict supporting invariants: 1 150.94/117.00 Consider only non-deceasing supporting invariants: true 150.94/117.00 Simplify termination arguments: true 150.94/117.00 Simplify supporting invariants: trueOverapproximate stem: false 150.94/117.00 [2019-03-28 12:39:18,768 INFO L339 nArgumentSynthesizer]: Template has degree 0. 150.94/117.00 [2019-03-28 12:39:18,768 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 150.94/117.00 [2019-03-28 12:39:18,768 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 150.94/117.00 [2019-03-28 12:39:18,768 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 150.94/117.00 [2019-03-28 12:39:18,769 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 150.94/117.00 [2019-03-28 12:39:18,770 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 150.94/117.00 [2019-03-28 12:39:18,772 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 150.94/117.00 [2019-03-28 12:39:18,773 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 150.94/117.00 Termination analysis: LINEAR_WITH_GUESSES 150.94/117.00 Number of strict supporting invariants: 0 150.94/117.00 Number of non-strict supporting invariants: 1 150.94/117.00 Consider only non-deceasing supporting invariants: true 150.94/117.00 Simplify termination arguments: true 150.94/117.00 Simplify supporting invariants: trueOverapproximate stem: false 150.94/117.00 [2019-03-28 12:39:18,773 INFO L339 nArgumentSynthesizer]: Template has degree 0. 150.94/117.00 [2019-03-28 12:39:18,773 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 150.94/117.00 [2019-03-28 12:39:18,773 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 150.94/117.00 [2019-03-28 12:39:18,773 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 150.94/117.00 [2019-03-28 12:39:18,774 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 150.94/117.00 [2019-03-28 12:39:18,774 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 150.94/117.00 [2019-03-28 12:39:18,774 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 150.94/117.00 [2019-03-28 12:39:18,775 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 150.94/117.00 [2019-03-28 12:39:18,775 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 150.94/117.00 Termination analysis: LINEAR_WITH_GUESSES 150.94/117.00 Number of strict supporting invariants: 0 150.94/117.00 Number of non-strict supporting invariants: 1 150.94/117.00 Consider only non-deceasing supporting invariants: true 150.94/117.00 Simplify termination arguments: true 150.94/117.00 Simplify supporting invariants: trueOverapproximate stem: false 150.94/117.00 [2019-03-28 12:39:18,775 INFO L339 nArgumentSynthesizer]: Template has degree 0. 150.94/117.00 [2019-03-28 12:39:18,775 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 150.94/117.00 [2019-03-28 12:39:18,776 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 150.94/117.00 [2019-03-28 12:39:18,776 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 150.94/117.00 [2019-03-28 12:39:18,777 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 150.94/117.00 [2019-03-28 12:39:18,777 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 150.94/117.00 [2019-03-28 12:39:18,779 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 150.94/117.00 [2019-03-28 12:39:18,779 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 150.94/117.00 Termination analysis: LINEAR_WITH_GUESSES 150.94/117.00 Number of strict supporting invariants: 0 150.94/117.00 Number of non-strict supporting invariants: 1 150.94/117.00 Consider only non-deceasing supporting invariants: true 150.94/117.00 Simplify termination arguments: true 150.94/117.00 Simplify supporting invariants: trueOverapproximate stem: false 150.94/117.00 [2019-03-28 12:39:18,779 INFO L339 nArgumentSynthesizer]: Template has degree 0. 150.94/117.00 [2019-03-28 12:39:18,780 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 150.94/117.00 [2019-03-28 12:39:18,780 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 150.94/117.00 [2019-03-28 12:39:18,780 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 150.94/117.00 [2019-03-28 12:39:18,782 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 150.94/117.00 [2019-03-28 12:39:18,783 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 150.94/117.00 [2019-03-28 12:39:18,811 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 150.94/117.00 [2019-03-28 12:39:18,828 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. 150.94/117.00 [2019-03-28 12:39:18,829 INFO L444 ModelExtractionUtils]: 20 out of 28 variables were initially zero. Simplification set additionally 4 variables to zero. 150.94/117.00 [2019-03-28 12:39:18,829 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 150.94/117.00 [2019-03-28 12:39:18,830 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. 150.94/117.00 [2019-03-28 12:39:18,831 INFO L518 LassoAnalysis]: Proved termination. 150.94/117.00 [2019-03-28 12:39:18,831 INFO L520 LassoAnalysis]: Termination argument consisting of: 150.94/117.00 Ranking function f(ULTIMATE.start_main_~arr~0.offset, v_rep(select #length ULTIMATE.start_main_#t~malloc2.base)_2, ULTIMATE.start_main_~i~0) = -1*ULTIMATE.start_main_~arr~0.offset + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc2.base)_2 - 4*ULTIMATE.start_main_~i~0 150.94/117.00 Supporting invariants [] 150.94/117.00 [2019-03-28 12:39:18,847 INFO L297 tatePredicateManager]: 5 out of 6 supporting invariants were superfluous and have been removed 150.94/117.00 [2019-03-28 12:39:18,849 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 150.94/117.00 [2019-03-28 12:39:18,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 150.94/117.00 [2019-03-28 12:39:18,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 150.94/117.00 [2019-03-28 12:39:18,887 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 4 conjunts are in the unsatisfiable core 150.94/117.00 [2019-03-28 12:39:18,888 INFO L279 TraceCheckSpWp]: Computing forward predicates... 150.94/117.00 [2019-03-28 12:39:18,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 150.94/117.00 [2019-03-28 12:39:18,894 WARN L254 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 6 conjunts are in the unsatisfiable core 150.94/117.00 [2019-03-28 12:39:18,895 INFO L279 TraceCheckSpWp]: Computing forward predicates... 150.94/117.00 [2019-03-28 12:39:18,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 150.94/117.00 [2019-03-28 12:39:18,908 INFO L98 LoopCannibalizer]: 2 predicates before loop cannibalization 2 predicates after loop cannibalization 150.94/117.00 [2019-03-28 12:39:18,908 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates 150.94/117.00 [2019-03-28 12:39:18,908 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 17 states and 38 transitions. cyclomatic complexity: 24 Second operand 4 states. 150.94/117.00 [2019-03-28 12:39:19,023 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 17 states and 38 transitions. cyclomatic complexity: 24. Second operand 4 states. Result 28 states and 76 transitions. Complement of second has 5 states. 150.94/117.00 [2019-03-28 12:39:19,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states 150.94/117.00 [2019-03-28 12:39:19,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. 150.94/117.00 [2019-03-28 12:39:19,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 49 transitions. 150.94/117.00 [2019-03-28 12:39:19,024 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 49 transitions. Stem has 6 letters. Loop has 2 letters. 150.94/117.00 [2019-03-28 12:39:19,025 INFO L116 BuchiAccepts]: Finished buchiAccepts. 150.94/117.00 [2019-03-28 12:39:19,025 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 49 transitions. Stem has 8 letters. Loop has 2 letters. 150.94/117.00 [2019-03-28 12:39:19,025 INFO L116 BuchiAccepts]: Finished buchiAccepts. 150.94/117.00 [2019-03-28 12:39:19,025 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 49 transitions. Stem has 6 letters. Loop has 4 letters. 150.94/117.00 [2019-03-28 12:39:19,025 INFO L116 BuchiAccepts]: Finished buchiAccepts. 150.94/117.00 [2019-03-28 12:39:19,150 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 76 transitions. 150.94/117.00 [2019-03-28 12:39:19,151 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 150.94/117.00 [2019-03-28 12:39:19,151 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 24 states and 58 transitions. 150.94/117.00 [2019-03-28 12:39:19,151 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 150.94/117.00 [2019-03-28 12:39:19,152 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 150.94/117.00 [2019-03-28 12:39:19,152 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 58 transitions. 150.94/117.00 [2019-03-28 12:39:19,152 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 150.94/117.00 [2019-03-28 12:39:19,152 INFO L706 BuchiCegarLoop]: Abstraction has 24 states and 58 transitions. 150.94/117.00 [2019-03-28 12:39:19,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 58 transitions. 150.94/117.00 [2019-03-28 12:39:19,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 17. 150.94/117.00 [2019-03-28 12:39:19,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. 150.94/117.00 [2019-03-28 12:39:19,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 38 transitions. 150.94/117.00 [2019-03-28 12:39:19,154 INFO L729 BuchiCegarLoop]: Abstraction has 17 states and 38 transitions. 150.94/117.00 [2019-03-28 12:39:19,154 INFO L609 BuchiCegarLoop]: Abstraction has 17 states and 38 transitions. 150.94/117.00 [2019-03-28 12:39:19,154 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ 150.94/117.00 [2019-03-28 12:39:19,154 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 38 transitions. 150.94/117.00 [2019-03-28 12:39:19,155 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 150.94/117.00 [2019-03-28 12:39:19,155 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 150.94/117.00 [2019-03-28 12:39:19,155 INFO L119 BuchiIsEmpty]: Starting construction of run 150.94/117.00 [2019-03-28 12:39:19,155 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] 150.94/117.00 [2019-03-28 12:39:19,155 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] 150.94/117.00 [2019-03-28 12:39:19,156 INFO L794 eck$LassoCheckResult]: Stem: 585#ULTIMATE.startENTRY [1526] ULTIMATE.startENTRY-->L7: Formula: (and (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|) (= |v_#valid_18| (store |v_#valid_19| 0 0))) InVars {#valid=|v_#valid_19|} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_6|, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_4|, ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_9, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_4|, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13, ULTIMATE.start_main_~fac~0=v_ULTIMATE.start_main_~fac~0_9, ULTIMATE.start_main_#t~malloc3.offset=|v_ULTIMATE.start_main_#t~malloc3.offset_7|, ULTIMATE.start_main_#t~post6=|v_ULTIMATE.start_main_#t~post6_4|, ULTIMATE.start_main_~arr2~0.base=v_ULTIMATE.start_main_~arr2~0.base_8, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~post4=|v_ULTIMATE.start_main_#t~post4_4|, ULTIMATE.start_main_~arr2~0.offset=v_ULTIMATE.start_main_~arr2~0.offset_7, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_5|, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_11, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_11, ULTIMATE.start_main_#t~malloc2.base=|v_ULTIMATE.start_main_#t~malloc2.base_7|, ULTIMATE.start_main_#t~malloc2.offset=|v_ULTIMATE.start_main_#t~malloc2.offset_7|, ULTIMATE.start_main_#t~malloc3.base=|v_ULTIMATE.start_main_#t~malloc3.base_7|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_5|, #valid=|v_#valid_18|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_~arr~0.offset, ULTIMATE.start_main_#t~nondet5, #NULL.offset, ULTIMATE.start_main_~i~0, ULTIMATE.start_main_~fac~0, ULTIMATE.start_main_#t~malloc3.offset, ULTIMATE.start_main_#t~post6, ULTIMATE.start_main_~arr2~0.base, #NULL.base, ULTIMATE.start_main_#t~post4, ULTIMATE.start_main_~arr2~0.offset, ULTIMATE.start_main_#t~mem7, ULTIMATE.start_main_~arr~0.base, ULTIMATE.start_main_~j~0, ULTIMATE.start_main_#t~malloc2.base, ULTIMATE.start_main_#t~malloc2.offset, ULTIMATE.start_main_#t~malloc3.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_~length~0] 586#L7 [97] L7-->L7-2: Formula: (>= v_ULTIMATE.start_main_~length~0_6 1) InVars {ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_6} OutVars{ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_6} AuxVars[] AssignedVars[] 582#L7-2 [64] L7-2-->L9: Formula: (= v_ULTIMATE.start_main_~fac~0_2 |v_ULTIMATE.start_main_#t~nondet1_3|) InVars {ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_3|} OutVars{ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_2|, ULTIMATE.start_main_~fac~0=v_ULTIMATE.start_main_~fac~0_2} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_~fac~0] 583#L9 [68] L9-->L9-2: Formula: (and (= v_ULTIMATE.start_main_~fac~0_3 1) (< v_ULTIMATE.start_main_~fac~0_4 1)) InVars {ULTIMATE.start_main_~fac~0=v_ULTIMATE.start_main_~fac~0_4} OutVars{ULTIMATE.start_main_~fac~0=v_ULTIMATE.start_main_~fac~0_3} AuxVars[] AssignedVars[ULTIMATE.start_main_~fac~0] 589#L9-2 [113] L9-2-->L12: Formula: (let ((.cse0 (store |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc2.base_2| 1))) (and (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc3.base_2|) 0) (< 0 |v_ULTIMATE.start_main_#t~malloc2.base_2|) (= 0 |v_ULTIMATE.start_main_#t~malloc2.offset_2|) (> |v_ULTIMATE.start_main_#t~malloc3.base_2| 0) (= v_ULTIMATE.start_main_~arr~0.offset_2 |v_ULTIMATE.start_main_#t~malloc2.offset_2|) (= v_ULTIMATE.start_main_~arr2~0.base_2 |v_ULTIMATE.start_main_#t~malloc3.base_2|) (= |v_#length_1| (store (store |v_#length_3| |v_ULTIMATE.start_main_#t~malloc2.base_2| (* 4 v_ULTIMATE.start_main_~length~0_7)) |v_ULTIMATE.start_main_#t~malloc3.base_2| (* 4 (* v_ULTIMATE.start_main_~fac~0_6 v_ULTIMATE.start_main_~length~0_7)))) (= 0 |v_ULTIMATE.start_main_#t~malloc3.offset_2|) (< |v_ULTIMATE.start_main_#t~malloc2.base_2| |v_#StackHeapBarrier_1|) (= (store .cse0 |v_ULTIMATE.start_main_#t~malloc3.base_2| 1) |v_#valid_3|) (= v_ULTIMATE.start_main_~arr~0.base_2 |v_ULTIMATE.start_main_#t~malloc2.base_2|) (= v_ULTIMATE.start_main_~arr2~0.offset_2 |v_ULTIMATE.start_main_#t~malloc3.offset_2|) (= (select |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc2.base_2|) 0) (< |v_ULTIMATE.start_main_#t~malloc3.base_2| |v_#StackHeapBarrier_1|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, ULTIMATE.start_main_~fac~0=v_ULTIMATE.start_main_~fac~0_6, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_7, #valid=|v_#valid_5|} OutVars{ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_2, ULTIMATE.start_main_~fac~0=v_ULTIMATE.start_main_~fac~0_6, ULTIMATE.start_main_#t~malloc3.offset=|v_ULTIMATE.start_main_#t~malloc3.offset_2|, ULTIMATE.start_main_~arr2~0.base=v_ULTIMATE.start_main_~arr2~0.base_2, ULTIMATE.start_main_~arr2~0.offset=v_ULTIMATE.start_main_~arr2~0.offset_2, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_2, ULTIMATE.start_main_#t~malloc2.base=|v_ULTIMATE.start_main_#t~malloc2.base_2|, ULTIMATE.start_main_#t~malloc2.offset=|v_ULTIMATE.start_main_#t~malloc2.offset_2|, ULTIMATE.start_main_#t~malloc3.base=|v_ULTIMATE.start_main_#t~malloc3.base_2|, #valid=|v_#valid_3|, #length=|v_#length_1|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~arr~0.offset, ULTIMATE.start_main_~arr~0.base, ULTIMATE.start_main_#t~malloc2.base, ULTIMATE.start_main_#t~malloc2.offset, ULTIMATE.start_main_#t~malloc3.base, #valid, #length, ULTIMATE.start_main_#t~malloc3.offset, ULTIMATE.start_main_~arr2~0.base, ULTIMATE.start_main_~arr2~0.offset] 590#L12 [129] L12-->L13-3: Formula: (and (= v_ULTIMATE.start_main_~i~0_4 0) (> v_ULTIMATE.start_main_~arr2~0.base_4 0) (< v_ULTIMATE.start_main_~arr~0.base_4 0)) InVars {ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_4, ULTIMATE.start_main_~arr2~0.base=v_ULTIMATE.start_main_~arr2~0.base_4} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_4, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_4, ULTIMATE.start_main_~arr2~0.base=v_ULTIMATE.start_main_~arr2~0.base_4} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 594#L13-3 150.94/117.00 [2019-03-28 12:39:19,156 INFO L796 eck$LassoCheckResult]: Loop: 594#L13-3 [94] L13-3-->L14: Formula: (< v_ULTIMATE.start_main_~i~0_6 v_ULTIMATE.start_main_~length~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_6, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_6, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_9} AuxVars[] AssignedVars[] 593#L14 [1530] L14-->L13-3: Formula: (let ((.cse0 (* 4 v_ULTIMATE.start_main_~i~0_17))) (let ((.cse1 (+ .cse0 v_ULTIMATE.start_main_~arr~0.offset_11))) (and (<= (+ .cse0 v_ULTIMATE.start_main_~arr~0.offset_11 4) (select |v_#length_11| v_ULTIMATE.start_main_~arr~0.base_13)) (= (store |v_#memory_int_9| v_ULTIMATE.start_main_~arr~0.base_13 (store (select |v_#memory_int_9| v_ULTIMATE.start_main_~arr~0.base_13) .cse1 |v_ULTIMATE.start_main_#t~nondet5_8|)) |v_#memory_int_8|) (= (+ v_ULTIMATE.start_main_~i~0_17 1) v_ULTIMATE.start_main_~i~0_16) (<= 0 .cse1) (= 1 (select |v_#valid_21| v_ULTIMATE.start_main_~arr~0.base_13))))) InVars {ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_11, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_13, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_8|, #valid=|v_#valid_21|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_17, #length=|v_#length_11|} OutVars{ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_11, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_13, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_7|, #valid=|v_#valid_21|, #memory_int=|v_#memory_int_8|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_16, #length=|v_#length_11|, ULTIMATE.start_main_#t~post4=|v_ULTIMATE.start_main_#t~post4_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5, #memory_int, ULTIMATE.start_main_~i~0, ULTIMATE.start_main_#t~post4] 594#L13-3 150.94/117.00 [2019-03-28 12:39:19,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 150.94/117.00 [2019-03-28 12:39:19,157 INFO L82 PathProgramCache]: Analyzing trace with hash 1717472288, now seen corresponding path program 1 times 150.94/117.00 [2019-03-28 12:39:19,157 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 150.94/117.00 [2019-03-28 12:39:19,157 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 150.94/117.00 [2019-03-28 12:39:19,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 150.94/117.00 [2019-03-28 12:39:19,158 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 150.94/117.00 [2019-03-28 12:39:19,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 150.94/117.00 [2019-03-28 12:39:19,160 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic 150.94/117.00 [2019-03-28 12:39:19,160 INFO L258 seRefinementStrategy]: Advancing trace checker 150.94/117.00 [2019-03-28 12:39:19,160 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 150.94/117.00 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 150.94/117.00 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) 150.94/117.00 Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true 150.94/117.00 [2019-03-28 12:39:19,171 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 150.94/117.00 [2019-03-28 12:39:19,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 150.94/117.00 [2019-03-28 12:39:19,182 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 3 conjunts are in the unsatisfiable core 150.94/117.00 [2019-03-28 12:39:19,183 INFO L279 TraceCheckSpWp]: Computing forward predicates... 150.94/117.00 [2019-03-28 12:39:19,187 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 150.94/117.00 [2019-03-28 12:39:19,214 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 150.94/117.00 [2019-03-28 12:39:19,215 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 150.94/117.00 [2019-03-28 12:39:19,215 INFO L799 eck$LassoCheckResult]: stem already infeasible 150.94/117.00 [2019-03-28 12:39:19,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 150.94/117.00 [2019-03-28 12:39:19,215 INFO L82 PathProgramCache]: Analyzing trace with hash 5405, now seen corresponding path program 10 times 150.94/117.00 [2019-03-28 12:39:19,215 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 150.94/117.00 [2019-03-28 12:39:19,215 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 150.94/117.00 [2019-03-28 12:39:19,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 150.94/117.00 [2019-03-28 12:39:19,216 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 150.94/117.00 [2019-03-28 12:39:19,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 150.94/117.00 [2019-03-28 12:39:19,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 150.94/117.00 [2019-03-28 12:39:19,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 150.94/117.00 [2019-03-28 12:39:19,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 150.94/117.00 [2019-03-28 12:39:19,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 150.94/117.00 [2019-03-28 12:39:19,257 INFO L87 Difference]: Start difference. First operand 17 states and 38 transitions. cyclomatic complexity: 24 Second operand 3 states. 150.94/117.00 [2019-03-28 12:39:19,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 150.94/117.00 [2019-03-28 12:39:19,341 INFO L93 Difference]: Finished difference Result 25 states and 58 transitions. 150.94/117.00 [2019-03-28 12:39:19,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 150.94/117.00 [2019-03-28 12:39:19,437 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 58 transitions. 150.94/117.00 [2019-03-28 12:39:19,438 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 10 150.94/117.00 [2019-03-28 12:39:19,439 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 25 states and 58 transitions. 150.94/117.00 [2019-03-28 12:39:19,439 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 150.94/117.00 [2019-03-28 12:39:19,439 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 150.94/117.00 [2019-03-28 12:39:19,439 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 58 transitions. 150.94/117.00 [2019-03-28 12:39:19,439 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 150.94/117.00 [2019-03-28 12:39:19,439 INFO L706 BuchiCegarLoop]: Abstraction has 25 states and 58 transitions. 150.94/117.00 [2019-03-28 12:39:19,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 58 transitions. 150.94/117.00 [2019-03-28 12:39:19,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 17. 150.94/117.00 [2019-03-28 12:39:19,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. 150.94/117.00 [2019-03-28 12:39:19,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 36 transitions. 150.94/117.00 [2019-03-28 12:39:19,441 INFO L729 BuchiCegarLoop]: Abstraction has 17 states and 36 transitions. 150.94/117.00 [2019-03-28 12:39:19,441 INFO L609 BuchiCegarLoop]: Abstraction has 17 states and 36 transitions. 150.94/117.00 [2019-03-28 12:39:19,441 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ 150.94/117.00 [2019-03-28 12:39:19,441 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 36 transitions. 150.94/117.00 [2019-03-28 12:39:19,442 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 150.94/117.00 [2019-03-28 12:39:19,442 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 150.94/117.00 [2019-03-28 12:39:19,442 INFO L119 BuchiIsEmpty]: Starting construction of run 150.94/117.00 [2019-03-28 12:39:19,442 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] 150.94/117.00 [2019-03-28 12:39:19,442 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] 150.94/117.00 [2019-03-28 12:39:19,443 INFO L794 eck$LassoCheckResult]: Stem: 648#ULTIMATE.startENTRY [1526] ULTIMATE.startENTRY-->L7: Formula: (and (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|) (= |v_#valid_18| (store |v_#valid_19| 0 0))) InVars {#valid=|v_#valid_19|} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_6|, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_4|, ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_9, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_4|, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13, ULTIMATE.start_main_~fac~0=v_ULTIMATE.start_main_~fac~0_9, ULTIMATE.start_main_#t~malloc3.offset=|v_ULTIMATE.start_main_#t~malloc3.offset_7|, ULTIMATE.start_main_#t~post6=|v_ULTIMATE.start_main_#t~post6_4|, ULTIMATE.start_main_~arr2~0.base=v_ULTIMATE.start_main_~arr2~0.base_8, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~post4=|v_ULTIMATE.start_main_#t~post4_4|, ULTIMATE.start_main_~arr2~0.offset=v_ULTIMATE.start_main_~arr2~0.offset_7, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_5|, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_11, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_11, ULTIMATE.start_main_#t~malloc2.base=|v_ULTIMATE.start_main_#t~malloc2.base_7|, ULTIMATE.start_main_#t~malloc2.offset=|v_ULTIMATE.start_main_#t~malloc2.offset_7|, ULTIMATE.start_main_#t~malloc3.base=|v_ULTIMATE.start_main_#t~malloc3.base_7|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_5|, #valid=|v_#valid_18|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_~arr~0.offset, ULTIMATE.start_main_#t~nondet5, #NULL.offset, ULTIMATE.start_main_~i~0, ULTIMATE.start_main_~fac~0, ULTIMATE.start_main_#t~malloc3.offset, ULTIMATE.start_main_#t~post6, ULTIMATE.start_main_~arr2~0.base, #NULL.base, ULTIMATE.start_main_#t~post4, ULTIMATE.start_main_~arr2~0.offset, ULTIMATE.start_main_#t~mem7, ULTIMATE.start_main_~arr~0.base, ULTIMATE.start_main_~j~0, ULTIMATE.start_main_#t~malloc2.base, ULTIMATE.start_main_#t~malloc2.offset, ULTIMATE.start_main_#t~malloc3.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_~length~0] 649#L7 [97] L7-->L7-2: Formula: (>= v_ULTIMATE.start_main_~length~0_6 1) InVars {ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_6} OutVars{ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_6} AuxVars[] AssignedVars[] 645#L7-2 [64] L7-2-->L9: Formula: (= v_ULTIMATE.start_main_~fac~0_2 |v_ULTIMATE.start_main_#t~nondet1_3|) InVars {ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_3|} OutVars{ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_2|, ULTIMATE.start_main_~fac~0=v_ULTIMATE.start_main_~fac~0_2} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_~fac~0] 646#L9 [68] L9-->L9-2: Formula: (and (= v_ULTIMATE.start_main_~fac~0_3 1) (< v_ULTIMATE.start_main_~fac~0_4 1)) InVars {ULTIMATE.start_main_~fac~0=v_ULTIMATE.start_main_~fac~0_4} OutVars{ULTIMATE.start_main_~fac~0=v_ULTIMATE.start_main_~fac~0_3} AuxVars[] AssignedVars[ULTIMATE.start_main_~fac~0] 652#L9-2 [110] L9-2-->L12: Formula: (let ((.cse0 (store |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc2.base_2| 1))) (and (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc3.base_2|) 0) (< 0 |v_ULTIMATE.start_main_#t~malloc2.base_2|) (= 0 |v_ULTIMATE.start_main_#t~malloc2.offset_2|) (= v_ULTIMATE.start_main_~arr~0.offset_2 |v_ULTIMATE.start_main_#t~malloc2.offset_2|) (= v_ULTIMATE.start_main_~arr2~0.base_2 |v_ULTIMATE.start_main_#t~malloc3.base_2|) (< |v_ULTIMATE.start_main_#t~malloc3.base_2| 0) (= |v_#length_1| (store (store |v_#length_3| |v_ULTIMATE.start_main_#t~malloc2.base_2| (* 4 v_ULTIMATE.start_main_~length~0_7)) |v_ULTIMATE.start_main_#t~malloc3.base_2| (* 4 (* v_ULTIMATE.start_main_~fac~0_6 v_ULTIMATE.start_main_~length~0_7)))) (= 0 |v_ULTIMATE.start_main_#t~malloc3.offset_2|) (< |v_ULTIMATE.start_main_#t~malloc2.base_2| |v_#StackHeapBarrier_1|) (= (store .cse0 |v_ULTIMATE.start_main_#t~malloc3.base_2| 1) |v_#valid_3|) (= v_ULTIMATE.start_main_~arr~0.base_2 |v_ULTIMATE.start_main_#t~malloc2.base_2|) (= v_ULTIMATE.start_main_~arr2~0.offset_2 |v_ULTIMATE.start_main_#t~malloc3.offset_2|) (= (select |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc2.base_2|) 0) (< |v_ULTIMATE.start_main_#t~malloc3.base_2| |v_#StackHeapBarrier_1|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, ULTIMATE.start_main_~fac~0=v_ULTIMATE.start_main_~fac~0_6, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_7, #valid=|v_#valid_5|} OutVars{ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_2, ULTIMATE.start_main_~fac~0=v_ULTIMATE.start_main_~fac~0_6, ULTIMATE.start_main_#t~malloc3.offset=|v_ULTIMATE.start_main_#t~malloc3.offset_2|, ULTIMATE.start_main_~arr2~0.base=v_ULTIMATE.start_main_~arr2~0.base_2, ULTIMATE.start_main_~arr2~0.offset=v_ULTIMATE.start_main_~arr2~0.offset_2, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_2, ULTIMATE.start_main_#t~malloc2.base=|v_ULTIMATE.start_main_#t~malloc2.base_2|, ULTIMATE.start_main_#t~malloc2.offset=|v_ULTIMATE.start_main_#t~malloc2.offset_2|, ULTIMATE.start_main_#t~malloc3.base=|v_ULTIMATE.start_main_#t~malloc3.base_2|, #valid=|v_#valid_3|, #length=|v_#length_1|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~arr~0.offset, ULTIMATE.start_main_~arr~0.base, ULTIMATE.start_main_#t~malloc2.base, ULTIMATE.start_main_#t~malloc2.offset, ULTIMATE.start_main_#t~malloc3.base, #valid, #length, ULTIMATE.start_main_#t~malloc3.offset, ULTIMATE.start_main_~arr2~0.base, ULTIMATE.start_main_~arr2~0.offset] 654#L12 [131] L12-->L13-3: Formula: (and (= v_ULTIMATE.start_main_~i~0_4 0) (< v_ULTIMATE.start_main_~arr2~0.base_4 0) (> v_ULTIMATE.start_main_~arr~0.base_4 0)) InVars {ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_4, ULTIMATE.start_main_~arr2~0.base=v_ULTIMATE.start_main_~arr2~0.base_4} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_4, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_4, ULTIMATE.start_main_~arr2~0.base=v_ULTIMATE.start_main_~arr2~0.base_4} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 657#L13-3 150.94/117.00 [2019-03-28 12:39:19,443 INFO L796 eck$LassoCheckResult]: Loop: 657#L13-3 [94] L13-3-->L14: Formula: (< v_ULTIMATE.start_main_~i~0_6 v_ULTIMATE.start_main_~length~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_6, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_6, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_9} AuxVars[] AssignedVars[] 656#L14 [1530] L14-->L13-3: Formula: (let ((.cse0 (* 4 v_ULTIMATE.start_main_~i~0_17))) (let ((.cse1 (+ .cse0 v_ULTIMATE.start_main_~arr~0.offset_11))) (and (<= (+ .cse0 v_ULTIMATE.start_main_~arr~0.offset_11 4) (select |v_#length_11| v_ULTIMATE.start_main_~arr~0.base_13)) (= (store |v_#memory_int_9| v_ULTIMATE.start_main_~arr~0.base_13 (store (select |v_#memory_int_9| v_ULTIMATE.start_main_~arr~0.base_13) .cse1 |v_ULTIMATE.start_main_#t~nondet5_8|)) |v_#memory_int_8|) (= (+ v_ULTIMATE.start_main_~i~0_17 1) v_ULTIMATE.start_main_~i~0_16) (<= 0 .cse1) (= 1 (select |v_#valid_21| v_ULTIMATE.start_main_~arr~0.base_13))))) InVars {ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_11, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_13, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_8|, #valid=|v_#valid_21|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_17, #length=|v_#length_11|} OutVars{ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_11, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_13, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_7|, #valid=|v_#valid_21|, #memory_int=|v_#memory_int_8|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_16, #length=|v_#length_11|, ULTIMATE.start_main_#t~post4=|v_ULTIMATE.start_main_#t~post4_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5, #memory_int, ULTIMATE.start_main_~i~0, ULTIMATE.start_main_#t~post4] 657#L13-3 150.94/117.00 [2019-03-28 12:39:19,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 150.94/117.00 [2019-03-28 12:39:19,444 INFO L82 PathProgramCache]: Analyzing trace with hash 1717472197, now seen corresponding path program 1 times 150.94/117.00 [2019-03-28 12:39:19,444 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 150.94/117.00 [2019-03-28 12:39:19,444 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 150.94/117.00 [2019-03-28 12:39:19,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 150.94/117.00 [2019-03-28 12:39:19,445 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 150.94/117.00 [2019-03-28 12:39:19,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 150.94/117.00 [2019-03-28 12:39:19,447 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic 150.94/117.00 [2019-03-28 12:39:19,447 INFO L258 seRefinementStrategy]: Advancing trace checker 150.94/117.00 [2019-03-28 12:39:19,447 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 150.94/117.00 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 150.94/117.00 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) 150.94/117.00 Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true 150.94/117.00 [2019-03-28 12:39:19,458 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 150.94/117.00 [2019-03-28 12:39:19,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 150.94/117.00 [2019-03-28 12:39:19,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 150.94/117.00 [2019-03-28 12:39:19,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 150.94/117.00 [2019-03-28 12:39:19,505 INFO L82 PathProgramCache]: Analyzing trace with hash 5405, now seen corresponding path program 11 times 150.94/117.00 [2019-03-28 12:39:19,506 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 150.94/117.00 [2019-03-28 12:39:19,506 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 150.94/117.00 [2019-03-28 12:39:19,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 150.94/117.00 [2019-03-28 12:39:19,507 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 150.94/117.00 [2019-03-28 12:39:19,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 150.94/117.00 [2019-03-28 12:39:19,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 150.94/117.00 [2019-03-28 12:39:19,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 150.94/117.00 [2019-03-28 12:39:19,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 150.94/117.00 [2019-03-28 12:39:19,512 INFO L82 PathProgramCache]: Analyzing trace with hash 1223344097, now seen corresponding path program 1 times 150.94/117.00 [2019-03-28 12:39:19,512 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 150.94/117.00 [2019-03-28 12:39:19,513 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 150.94/117.00 [2019-03-28 12:39:19,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 150.94/117.00 [2019-03-28 12:39:19,513 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 150.94/117.00 [2019-03-28 12:39:19,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 150.94/117.00 [2019-03-28 12:39:19,515 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic 150.94/117.00 [2019-03-28 12:39:19,516 INFO L258 seRefinementStrategy]: Advancing trace checker 150.94/117.00 [2019-03-28 12:39:19,516 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 150.94/117.00 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 150.94/117.00 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) 150.94/117.00 Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true 150.94/117.00 [2019-03-28 12:39:19,527 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 150.94/117.00 [2019-03-28 12:39:19,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 150.94/117.00 [2019-03-28 12:39:19,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 150.94/117.00 [2019-03-28 12:39:19,725 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 56 150.94/117.00 [2019-03-28 12:39:19,773 INFO L216 LassoAnalysis]: Preferences: 150.94/117.00 [2019-03-28 12:39:19,773 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 150.94/117.00 [2019-03-28 12:39:19,774 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 150.94/117.00 [2019-03-28 12:39:19,774 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 150.94/117.00 [2019-03-28 12:39:19,774 INFO L127 ssoRankerPreferences]: Use exernal solver: false 150.94/117.00 [2019-03-28 12:39:19,774 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 150.94/117.00 [2019-03-28 12:39:19,774 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 150.94/117.00 [2019-03-28 12:39:19,774 INFO L130 ssoRankerPreferences]: Path of dumped script: 150.94/117.00 [2019-03-28 12:39:19,774 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration11_Lasso 150.94/117.00 [2019-03-28 12:39:19,774 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 150.94/117.00 [2019-03-28 12:39:19,775 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 150.94/117.00 [2019-03-28 12:39:19,777 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 150.94/117.00 [2019-03-28 12:39:19,779 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 150.94/117.00 [2019-03-28 12:39:19,781 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 150.94/117.00 [2019-03-28 12:39:19,783 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 150.94/117.00 [2019-03-28 12:39:19,784 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 150.94/117.00 [2019-03-28 12:39:19,787 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 150.94/117.00 [2019-03-28 12:39:19,788 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 150.94/117.00 [2019-03-28 12:39:19,790 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 150.94/117.00 [2019-03-28 12:39:19,898 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 150.94/117.00 [2019-03-28 12:39:19,900 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 150.94/117.00 [2019-03-28 12:39:19,901 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 150.94/117.00 [2019-03-28 12:39:20,102 INFO L300 LassoAnalysis]: Preprocessing complete. 150.94/117.00 [2019-03-28 12:39:20,102 INFO L497 LassoAnalysis]: Using template 'affine'. 150.94/117.00 [2019-03-28 12:39:20,103 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 150.94/117.00 Termination analysis: LINEAR_WITH_GUESSES 150.94/117.00 Number of strict supporting invariants: 0 150.94/117.00 Number of non-strict supporting invariants: 1 150.94/117.00 Consider only non-deceasing supporting invariants: true 150.94/117.00 Simplify termination arguments: true 150.94/117.00 Simplify supporting invariants: trueOverapproximate stem: false 150.94/117.00 [2019-03-28 12:39:20,103 INFO L339 nArgumentSynthesizer]: Template has degree 0. 150.94/117.00 [2019-03-28 12:39:20,103 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 150.94/117.00 [2019-03-28 12:39:20,104 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 150.94/117.00 [2019-03-28 12:39:20,104 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 150.94/117.00 [2019-03-28 12:39:20,104 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 150.94/117.00 [2019-03-28 12:39:20,104 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 150.94/117.00 [2019-03-28 12:39:20,104 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 150.94/117.00 [2019-03-28 12:39:20,105 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 150.94/117.00 [2019-03-28 12:39:20,105 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 150.94/117.00 Termination analysis: LINEAR_WITH_GUESSES 150.94/117.00 Number of strict supporting invariants: 0 150.94/117.00 Number of non-strict supporting invariants: 1 150.94/117.00 Consider only non-deceasing supporting invariants: true 150.94/117.00 Simplify termination arguments: true 150.94/117.00 Simplify supporting invariants: trueOverapproximate stem: false 150.94/117.00 [2019-03-28 12:39:20,106 INFO L339 nArgumentSynthesizer]: Template has degree 0. 150.94/117.00 [2019-03-28 12:39:20,106 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 150.94/117.00 [2019-03-28 12:39:20,106 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 150.94/117.00 [2019-03-28 12:39:20,106 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 150.94/117.00 [2019-03-28 12:39:20,106 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 150.94/117.00 [2019-03-28 12:39:20,107 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 150.94/117.00 [2019-03-28 12:39:20,107 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 150.94/117.00 [2019-03-28 12:39:20,107 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 150.94/117.00 [2019-03-28 12:39:20,107 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 150.94/117.00 Termination analysis: LINEAR_WITH_GUESSES 150.94/117.00 Number of strict supporting invariants: 0 150.94/117.00 Number of non-strict supporting invariants: 1 150.94/117.00 Consider only non-deceasing supporting invariants: true 150.94/117.00 Simplify termination arguments: true 150.94/117.00 Simplify supporting invariants: trueOverapproximate stem: false 150.94/117.00 [2019-03-28 12:39:20,108 INFO L339 nArgumentSynthesizer]: Template has degree 0. 150.94/117.00 [2019-03-28 12:39:20,108 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 150.94/117.00 [2019-03-28 12:39:20,108 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 150.94/117.00 [2019-03-28 12:39:20,108 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 150.94/117.00 [2019-03-28 12:39:20,108 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 150.94/117.00 [2019-03-28 12:39:20,109 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 150.94/117.00 [2019-03-28 12:39:20,109 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 150.94/117.00 [2019-03-28 12:39:20,109 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 150.94/117.00 [2019-03-28 12:39:20,109 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 150.94/117.00 Termination analysis: LINEAR_WITH_GUESSES 150.94/117.00 Number of strict supporting invariants: 0 150.94/117.00 Number of non-strict supporting invariants: 1 150.94/117.00 Consider only non-deceasing supporting invariants: true 150.94/117.00 Simplify termination arguments: true 150.94/117.00 Simplify supporting invariants: trueOverapproximate stem: false 150.94/117.00 [2019-03-28 12:39:20,110 INFO L339 nArgumentSynthesizer]: Template has degree 0. 150.94/117.00 [2019-03-28 12:39:20,110 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 150.94/117.00 [2019-03-28 12:39:20,110 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 150.94/117.00 [2019-03-28 12:39:20,110 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 150.94/117.00 [2019-03-28 12:39:20,110 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 150.94/117.00 [2019-03-28 12:39:20,111 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 150.94/117.00 [2019-03-28 12:39:20,111 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 150.94/117.00 [2019-03-28 12:39:20,111 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 150.94/117.00 [2019-03-28 12:39:20,111 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 150.94/117.00 Termination analysis: LINEAR_WITH_GUESSES 150.94/117.00 Number of strict supporting invariants: 0 150.94/117.00 Number of non-strict supporting invariants: 1 150.94/117.00 Consider only non-deceasing supporting invariants: true 150.94/117.00 Simplify termination arguments: true 150.94/117.00 Simplify supporting invariants: trueOverapproximate stem: false 150.94/117.00 [2019-03-28 12:39:20,112 INFO L339 nArgumentSynthesizer]: Template has degree 0. 150.94/117.00 [2019-03-28 12:39:20,112 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 150.94/117.00 [2019-03-28 12:39:20,112 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 150.94/117.00 [2019-03-28 12:39:20,112 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 150.94/117.00 [2019-03-28 12:39:20,113 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 150.94/117.00 [2019-03-28 12:39:20,113 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 150.94/117.00 [2019-03-28 12:39:20,115 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 150.94/117.00 [2019-03-28 12:39:20,115 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 150.94/117.00 Termination analysis: LINEAR_WITH_GUESSES 150.94/117.00 Number of strict supporting invariants: 0 150.94/117.00 Number of non-strict supporting invariants: 1 150.94/117.00 Consider only non-deceasing supporting invariants: true 150.94/117.00 Simplify termination arguments: true 150.94/117.00 Simplify supporting invariants: trueOverapproximate stem: false 150.94/117.00 [2019-03-28 12:39:20,115 INFO L339 nArgumentSynthesizer]: Template has degree 0. 150.94/117.00 [2019-03-28 12:39:20,116 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 150.94/117.00 [2019-03-28 12:39:20,116 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 150.94/117.00 [2019-03-28 12:39:20,116 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 150.94/117.00 [2019-03-28 12:39:20,116 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 150.94/117.00 [2019-03-28 12:39:20,116 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 150.94/117.00 [2019-03-28 12:39:20,116 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 150.94/117.00 [2019-03-28 12:39:20,117 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 150.94/117.00 [2019-03-28 12:39:20,117 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 150.94/117.00 Termination analysis: LINEAR_WITH_GUESSES 150.94/117.00 Number of strict supporting invariants: 0 150.94/117.00 Number of non-strict supporting invariants: 1 150.94/117.00 Consider only non-deceasing supporting invariants: true 150.94/117.00 Simplify termination arguments: true 150.94/117.00 Simplify supporting invariants: trueOverapproximate stem: false 150.94/117.00 [2019-03-28 12:39:20,118 INFO L339 nArgumentSynthesizer]: Template has degree 0. 150.94/117.00 [2019-03-28 12:39:20,118 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 150.94/117.00 [2019-03-28 12:39:20,118 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 150.94/117.00 [2019-03-28 12:39:20,118 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 150.94/117.00 [2019-03-28 12:39:20,119 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 150.94/117.00 [2019-03-28 12:39:20,119 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 150.94/117.00 [2019-03-28 12:39:20,120 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 150.94/117.00 [2019-03-28 12:39:20,121 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 150.94/117.00 Termination analysis: LINEAR_WITH_GUESSES 150.94/117.00 Number of strict supporting invariants: 0 150.94/117.00 Number of non-strict supporting invariants: 1 150.94/117.00 Consider only non-deceasing supporting invariants: true 150.94/117.00 Simplify termination arguments: true 150.94/117.00 Simplify supporting invariants: trueOverapproximate stem: false 150.94/117.00 [2019-03-28 12:39:20,121 INFO L339 nArgumentSynthesizer]: Template has degree 0. 150.94/117.00 [2019-03-28 12:39:20,121 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 150.94/117.00 [2019-03-28 12:39:20,121 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 150.94/117.00 [2019-03-28 12:39:20,122 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 150.94/117.00 [2019-03-28 12:39:20,124 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 150.94/117.00 [2019-03-28 12:39:20,124 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 150.94/117.00 [2019-03-28 12:39:20,139 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 150.94/117.00 [2019-03-28 12:39:20,155 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. 150.94/117.00 [2019-03-28 12:39:20,155 INFO L444 ModelExtractionUtils]: 21 out of 28 variables were initially zero. Simplification set additionally 3 variables to zero. 150.94/117.00 [2019-03-28 12:39:20,156 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 150.94/117.00 [2019-03-28 12:39:20,157 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. 150.94/117.00 [2019-03-28 12:39:20,157 INFO L518 LassoAnalysis]: Proved termination. 150.94/117.00 [2019-03-28 12:39:20,157 INFO L520 LassoAnalysis]: Termination argument consisting of: 150.94/117.00 Ranking function f(ULTIMATE.start_main_~arr~0.offset, v_rep(select #length ULTIMATE.start_main_~arr~0.base)_3, ULTIMATE.start_main_~i~0) = -1*ULTIMATE.start_main_~arr~0.offset + 1*v_rep(select #length ULTIMATE.start_main_~arr~0.base)_3 - 4*ULTIMATE.start_main_~i~0 150.94/117.00 Supporting invariants [] 150.94/117.00 [2019-03-28 12:39:20,170 INFO L297 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed 150.94/117.00 [2019-03-28 12:39:20,171 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 150.94/117.00 [2019-03-28 12:39:20,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 150.94/117.00 [2019-03-28 12:39:20,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 150.94/117.00 [2019-03-28 12:39:20,197 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 2 conjunts are in the unsatisfiable core 150.94/117.00 [2019-03-28 12:39:20,198 INFO L279 TraceCheckSpWp]: Computing forward predicates... 150.94/117.00 [2019-03-28 12:39:20,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 150.94/117.00 [2019-03-28 12:39:20,204 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core 150.94/117.00 [2019-03-28 12:39:20,204 INFO L279 TraceCheckSpWp]: Computing forward predicates... 150.94/117.00 [2019-03-28 12:39:20,204 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 150.94/117.00 [2019-03-28 12:39:20,205 INFO L98 LoopCannibalizer]: 1 predicates before loop cannibalization 1 predicates after loop cannibalization 150.94/117.00 [2019-03-28 12:39:20,205 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates 150.94/117.00 [2019-03-28 12:39:20,205 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 17 states and 36 transitions. cyclomatic complexity: 22 Second operand 3 states. 150.94/117.00 [2019-03-28 12:39:20,293 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 17 states and 36 transitions. cyclomatic complexity: 22. Second operand 3 states. Result 28 states and 74 transitions. Complement of second has 4 states. 150.94/117.00 [2019-03-28 12:39:20,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states 150.94/117.00 [2019-03-28 12:39:20,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. 150.94/117.00 [2019-03-28 12:39:20,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 49 transitions. 150.94/117.00 [2019-03-28 12:39:20,294 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 49 transitions. Stem has 6 letters. Loop has 2 letters. 150.94/117.00 [2019-03-28 12:39:20,294 INFO L116 BuchiAccepts]: Finished buchiAccepts. 150.94/117.00 [2019-03-28 12:39:20,295 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 49 transitions. Stem has 8 letters. Loop has 2 letters. 150.94/117.00 [2019-03-28 12:39:20,295 INFO L116 BuchiAccepts]: Finished buchiAccepts. 150.94/117.00 [2019-03-28 12:39:20,295 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 49 transitions. Stem has 6 letters. Loop has 4 letters. 150.94/117.00 [2019-03-28 12:39:20,295 INFO L116 BuchiAccepts]: Finished buchiAccepts. 150.94/117.00 [2019-03-28 12:39:20,420 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 74 transitions. 150.94/117.00 [2019-03-28 12:39:20,421 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 150.94/117.00 [2019-03-28 12:39:20,421 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 24 states and 56 transitions. 150.94/117.00 [2019-03-28 12:39:20,422 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 150.94/117.00 [2019-03-28 12:39:20,422 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 150.94/117.00 [2019-03-28 12:39:20,422 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 56 transitions. 150.94/117.00 [2019-03-28 12:39:20,422 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 150.94/117.00 [2019-03-28 12:39:20,422 INFO L706 BuchiCegarLoop]: Abstraction has 24 states and 56 transitions. 150.94/117.00 [2019-03-28 12:39:20,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 56 transitions. 150.94/117.00 [2019-03-28 12:39:20,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 17. 150.94/117.00 [2019-03-28 12:39:20,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. 150.94/117.00 [2019-03-28 12:39:20,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 36 transitions. 150.94/117.00 [2019-03-28 12:39:20,424 INFO L729 BuchiCegarLoop]: Abstraction has 17 states and 36 transitions. 150.94/117.00 [2019-03-28 12:39:20,424 INFO L609 BuchiCegarLoop]: Abstraction has 17 states and 36 transitions. 150.94/117.00 [2019-03-28 12:39:20,424 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ 150.94/117.00 [2019-03-28 12:39:20,424 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 36 transitions. 150.94/117.00 [2019-03-28 12:39:20,425 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 150.94/117.00 [2019-03-28 12:39:20,425 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 150.94/117.00 [2019-03-28 12:39:20,425 INFO L119 BuchiIsEmpty]: Starting construction of run 150.94/117.00 [2019-03-28 12:39:20,425 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] 150.94/117.00 [2019-03-28 12:39:20,425 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] 150.94/117.00 [2019-03-28 12:39:20,426 INFO L794 eck$LassoCheckResult]: Stem: 760#ULTIMATE.startENTRY [1526] ULTIMATE.startENTRY-->L7: Formula: (and (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|) (= |v_#valid_18| (store |v_#valid_19| 0 0))) InVars {#valid=|v_#valid_19|} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_6|, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_4|, ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_9, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_4|, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13, ULTIMATE.start_main_~fac~0=v_ULTIMATE.start_main_~fac~0_9, ULTIMATE.start_main_#t~malloc3.offset=|v_ULTIMATE.start_main_#t~malloc3.offset_7|, ULTIMATE.start_main_#t~post6=|v_ULTIMATE.start_main_#t~post6_4|, ULTIMATE.start_main_~arr2~0.base=v_ULTIMATE.start_main_~arr2~0.base_8, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~post4=|v_ULTIMATE.start_main_#t~post4_4|, ULTIMATE.start_main_~arr2~0.offset=v_ULTIMATE.start_main_~arr2~0.offset_7, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_5|, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_11, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_11, ULTIMATE.start_main_#t~malloc2.base=|v_ULTIMATE.start_main_#t~malloc2.base_7|, ULTIMATE.start_main_#t~malloc2.offset=|v_ULTIMATE.start_main_#t~malloc2.offset_7|, ULTIMATE.start_main_#t~malloc3.base=|v_ULTIMATE.start_main_#t~malloc3.base_7|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_5|, #valid=|v_#valid_18|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_~arr~0.offset, ULTIMATE.start_main_#t~nondet5, #NULL.offset, ULTIMATE.start_main_~i~0, ULTIMATE.start_main_~fac~0, ULTIMATE.start_main_#t~malloc3.offset, ULTIMATE.start_main_#t~post6, ULTIMATE.start_main_~arr2~0.base, #NULL.base, ULTIMATE.start_main_#t~post4, ULTIMATE.start_main_~arr2~0.offset, ULTIMATE.start_main_#t~mem7, ULTIMATE.start_main_~arr~0.base, ULTIMATE.start_main_~j~0, ULTIMATE.start_main_#t~malloc2.base, ULTIMATE.start_main_#t~malloc2.offset, ULTIMATE.start_main_#t~malloc3.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_~length~0] 761#L7 [97] L7-->L7-2: Formula: (>= v_ULTIMATE.start_main_~length~0_6 1) InVars {ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_6} OutVars{ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_6} AuxVars[] AssignedVars[] 757#L7-2 [64] L7-2-->L9: Formula: (= v_ULTIMATE.start_main_~fac~0_2 |v_ULTIMATE.start_main_#t~nondet1_3|) InVars {ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_3|} OutVars{ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_2|, ULTIMATE.start_main_~fac~0=v_ULTIMATE.start_main_~fac~0_2} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_~fac~0] 758#L9 [68] L9-->L9-2: Formula: (and (= v_ULTIMATE.start_main_~fac~0_3 1) (< v_ULTIMATE.start_main_~fac~0_4 1)) InVars {ULTIMATE.start_main_~fac~0=v_ULTIMATE.start_main_~fac~0_4} OutVars{ULTIMATE.start_main_~fac~0=v_ULTIMATE.start_main_~fac~0_3} AuxVars[] AssignedVars[ULTIMATE.start_main_~fac~0] 764#L9-2 [111] L9-2-->L12: Formula: (let ((.cse0 (store |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc2.base_2| 1))) (and (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc3.base_2|) 0) (= 0 |v_ULTIMATE.start_main_#t~malloc2.offset_2|) (> |v_ULTIMATE.start_main_#t~malloc3.base_2| 0) (= v_ULTIMATE.start_main_~arr~0.offset_2 |v_ULTIMATE.start_main_#t~malloc2.offset_2|) (= v_ULTIMATE.start_main_~arr2~0.base_2 |v_ULTIMATE.start_main_#t~malloc3.base_2|) (= |v_#length_1| (store (store |v_#length_3| |v_ULTIMATE.start_main_#t~malloc2.base_2| (* 4 v_ULTIMATE.start_main_~length~0_7)) |v_ULTIMATE.start_main_#t~malloc3.base_2| (* 4 (* v_ULTIMATE.start_main_~fac~0_6 v_ULTIMATE.start_main_~length~0_7)))) (= 0 |v_ULTIMATE.start_main_#t~malloc3.offset_2|) (> 0 |v_ULTIMATE.start_main_#t~malloc2.base_2|) (< |v_ULTIMATE.start_main_#t~malloc2.base_2| |v_#StackHeapBarrier_1|) (= (store .cse0 |v_ULTIMATE.start_main_#t~malloc3.base_2| 1) |v_#valid_3|) (= v_ULTIMATE.start_main_~arr~0.base_2 |v_ULTIMATE.start_main_#t~malloc2.base_2|) (= v_ULTIMATE.start_main_~arr2~0.offset_2 |v_ULTIMATE.start_main_#t~malloc3.offset_2|) (= (select |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc2.base_2|) 0) (< |v_ULTIMATE.start_main_#t~malloc3.base_2| |v_#StackHeapBarrier_1|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, ULTIMATE.start_main_~fac~0=v_ULTIMATE.start_main_~fac~0_6, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_7, #valid=|v_#valid_5|} OutVars{ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_2, ULTIMATE.start_main_~fac~0=v_ULTIMATE.start_main_~fac~0_6, ULTIMATE.start_main_#t~malloc3.offset=|v_ULTIMATE.start_main_#t~malloc3.offset_2|, ULTIMATE.start_main_~arr2~0.base=v_ULTIMATE.start_main_~arr2~0.base_2, ULTIMATE.start_main_~arr2~0.offset=v_ULTIMATE.start_main_~arr2~0.offset_2, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_2, ULTIMATE.start_main_#t~malloc2.base=|v_ULTIMATE.start_main_#t~malloc2.base_2|, ULTIMATE.start_main_#t~malloc2.offset=|v_ULTIMATE.start_main_#t~malloc2.offset_2|, ULTIMATE.start_main_#t~malloc3.base=|v_ULTIMATE.start_main_#t~malloc3.base_2|, #valid=|v_#valid_3|, #length=|v_#length_1|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~arr~0.offset, ULTIMATE.start_main_~arr~0.base, ULTIMATE.start_main_#t~malloc2.base, ULTIMATE.start_main_#t~malloc2.offset, ULTIMATE.start_main_#t~malloc3.base, #valid, #length, ULTIMATE.start_main_#t~malloc3.offset, ULTIMATE.start_main_~arr2~0.base, ULTIMATE.start_main_~arr2~0.offset] 767#L12 [129] L12-->L13-3: Formula: (and (= v_ULTIMATE.start_main_~i~0_4 0) (> v_ULTIMATE.start_main_~arr2~0.base_4 0) (< v_ULTIMATE.start_main_~arr~0.base_4 0)) InVars {ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_4, ULTIMATE.start_main_~arr2~0.base=v_ULTIMATE.start_main_~arr2~0.base_4} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_4, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_4, ULTIMATE.start_main_~arr2~0.base=v_ULTIMATE.start_main_~arr2~0.base_4} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 769#L13-3 150.94/117.00 [2019-03-28 12:39:20,426 INFO L796 eck$LassoCheckResult]: Loop: 769#L13-3 [94] L13-3-->L14: Formula: (< v_ULTIMATE.start_main_~i~0_6 v_ULTIMATE.start_main_~length~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_6, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_6, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_9} AuxVars[] AssignedVars[] 768#L14 [1530] L14-->L13-3: Formula: (let ((.cse0 (* 4 v_ULTIMATE.start_main_~i~0_17))) (let ((.cse1 (+ .cse0 v_ULTIMATE.start_main_~arr~0.offset_11))) (and (<= (+ .cse0 v_ULTIMATE.start_main_~arr~0.offset_11 4) (select |v_#length_11| v_ULTIMATE.start_main_~arr~0.base_13)) (= (store |v_#memory_int_9| v_ULTIMATE.start_main_~arr~0.base_13 (store (select |v_#memory_int_9| v_ULTIMATE.start_main_~arr~0.base_13) .cse1 |v_ULTIMATE.start_main_#t~nondet5_8|)) |v_#memory_int_8|) (= (+ v_ULTIMATE.start_main_~i~0_17 1) v_ULTIMATE.start_main_~i~0_16) (<= 0 .cse1) (= 1 (select |v_#valid_21| v_ULTIMATE.start_main_~arr~0.base_13))))) InVars {ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_11, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_13, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_8|, #valid=|v_#valid_21|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_17, #length=|v_#length_11|} OutVars{ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_11, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_13, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_7|, #valid=|v_#valid_21|, #memory_int=|v_#memory_int_8|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_16, #length=|v_#length_11|, ULTIMATE.start_main_#t~post4=|v_ULTIMATE.start_main_#t~post4_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5, #memory_int, ULTIMATE.start_main_~i~0, ULTIMATE.start_main_#t~post4] 769#L13-3 150.94/117.00 [2019-03-28 12:39:20,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 150.94/117.00 [2019-03-28 12:39:20,426 INFO L82 PathProgramCache]: Analyzing trace with hash 1717472226, now seen corresponding path program 1 times 150.94/117.00 [2019-03-28 12:39:20,426 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 150.94/117.00 [2019-03-28 12:39:20,427 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 150.94/117.00 [2019-03-28 12:39:20,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 150.94/117.00 [2019-03-28 12:39:20,427 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 150.94/117.00 [2019-03-28 12:39:20,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 150.94/117.00 [2019-03-28 12:39:20,429 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic 150.94/117.00 [2019-03-28 12:39:20,429 INFO L258 seRefinementStrategy]: Advancing trace checker 150.94/117.00 [2019-03-28 12:39:20,430 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 150.94/117.00 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 150.94/117.00 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) 150.94/117.00 Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true 150.94/117.00 [2019-03-28 12:39:20,441 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 150.94/117.00 [2019-03-28 12:39:20,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 150.94/117.00 [2019-03-28 12:39:20,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 150.94/117.00 [2019-03-28 12:39:20,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 150.94/117.00 [2019-03-28 12:39:20,536 INFO L82 PathProgramCache]: Analyzing trace with hash 5405, now seen corresponding path program 12 times 150.94/117.00 [2019-03-28 12:39:20,536 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 150.94/117.00 [2019-03-28 12:39:20,537 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 150.94/117.00 [2019-03-28 12:39:20,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 150.94/117.00 [2019-03-28 12:39:20,537 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 150.94/117.00 [2019-03-28 12:39:20,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 150.94/117.00 [2019-03-28 12:39:20,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 150.94/117.00 [2019-03-28 12:39:20,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 150.94/117.00 [2019-03-28 12:39:20,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 150.94/117.00 [2019-03-28 12:39:20,543 INFO L82 PathProgramCache]: Analyzing trace with hash 1223371966, now seen corresponding path program 1 times 150.94/117.00 [2019-03-28 12:39:20,543 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 150.94/117.00 [2019-03-28 12:39:20,543 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 150.94/117.00 [2019-03-28 12:39:20,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 150.94/117.00 [2019-03-28 12:39:20,544 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 150.94/117.00 [2019-03-28 12:39:20,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 150.94/117.00 [2019-03-28 12:39:20,546 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic 150.94/117.00 [2019-03-28 12:39:20,546 INFO L258 seRefinementStrategy]: Advancing trace checker 150.94/117.00 [2019-03-28 12:39:20,546 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 150.94/117.00 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 150.94/117.00 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) 150.94/117.00 Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true 150.94/117.00 [2019-03-28 12:39:20,559 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 150.94/117.00 [2019-03-28 12:39:20,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 150.94/117.00 [2019-03-28 12:39:20,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 150.94/117.00 [2019-03-28 12:39:20,761 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 56 150.94/117.00 [2019-03-28 12:39:20,813 INFO L216 LassoAnalysis]: Preferences: 150.94/117.00 [2019-03-28 12:39:20,814 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 150.94/117.00 [2019-03-28 12:39:20,814 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 150.94/117.00 [2019-03-28 12:39:20,814 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 150.94/117.00 [2019-03-28 12:39:20,814 INFO L127 ssoRankerPreferences]: Use exernal solver: false 150.94/117.00 [2019-03-28 12:39:20,814 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 150.94/117.00 [2019-03-28 12:39:20,814 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 150.94/117.00 [2019-03-28 12:39:20,815 INFO L130 ssoRankerPreferences]: Path of dumped script: 150.94/117.00 [2019-03-28 12:39:20,815 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration12_Lasso 150.94/117.00 [2019-03-28 12:39:20,815 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 150.94/117.00 [2019-03-28 12:39:20,815 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 150.94/117.00 [2019-03-28 12:39:20,817 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 150.94/117.00 [2019-03-28 12:39:20,819 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 150.94/117.00 [2019-03-28 12:39:20,825 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 150.94/117.00 [2019-03-28 12:39:20,827 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 150.94/117.00 [2019-03-28 12:39:20,829 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 150.94/117.00 [2019-03-28 12:39:20,836 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 150.94/117.00 [2019-03-28 12:39:20,838 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 150.94/117.00 [2019-03-28 12:39:20,841 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 150.94/117.00 [2019-03-28 12:39:20,844 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 150.94/117.00 [2019-03-28 12:39:20,978 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 150.94/117.00 [2019-03-28 12:39:20,980 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 150.94/117.00 [2019-03-28 12:39:21,179 INFO L300 LassoAnalysis]: Preprocessing complete. 150.94/117.00 [2019-03-28 12:39:21,179 INFO L497 LassoAnalysis]: Using template 'affine'. 150.94/117.00 [2019-03-28 12:39:21,180 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 150.94/117.00 Termination analysis: LINEAR_WITH_GUESSES 150.94/117.00 Number of strict supporting invariants: 0 150.94/117.00 Number of non-strict supporting invariants: 1 150.94/117.00 Consider only non-deceasing supporting invariants: true 150.94/117.00 Simplify termination arguments: true 150.94/117.00 Simplify supporting invariants: trueOverapproximate stem: false 150.94/117.00 [2019-03-28 12:39:21,180 INFO L339 nArgumentSynthesizer]: Template has degree 0. 150.94/117.00 [2019-03-28 12:39:21,180 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 150.94/117.00 [2019-03-28 12:39:21,180 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 150.94/117.00 [2019-03-28 12:39:21,181 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 150.94/117.00 [2019-03-28 12:39:21,181 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 150.94/117.00 [2019-03-28 12:39:21,181 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 150.94/117.00 [2019-03-28 12:39:21,181 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 150.94/117.00 [2019-03-28 12:39:21,182 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 150.94/117.00 [2019-03-28 12:39:21,182 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 150.94/117.00 Termination analysis: LINEAR_WITH_GUESSES 150.94/117.00 Number of strict supporting invariants: 0 150.94/117.00 Number of non-strict supporting invariants: 1 150.94/117.00 Consider only non-deceasing supporting invariants: true 150.94/117.00 Simplify termination arguments: true 150.94/117.00 Simplify supporting invariants: trueOverapproximate stem: false 150.94/117.00 [2019-03-28 12:39:21,182 INFO L339 nArgumentSynthesizer]: Template has degree 0. 150.94/117.00 [2019-03-28 12:39:21,182 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 150.94/117.00 [2019-03-28 12:39:21,183 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 150.94/117.00 [2019-03-28 12:39:21,183 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 150.94/117.00 [2019-03-28 12:39:21,184 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 150.94/117.00 [2019-03-28 12:39:21,184 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 150.94/117.00 [2019-03-28 12:39:21,185 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 150.94/117.00 [2019-03-28 12:39:21,186 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 150.94/117.00 Termination analysis: LINEAR_WITH_GUESSES 150.94/117.00 Number of strict supporting invariants: 0 150.94/117.00 Number of non-strict supporting invariants: 1 150.94/117.00 Consider only non-deceasing supporting invariants: true 150.94/117.00 Simplify termination arguments: true 150.94/117.00 Simplify supporting invariants: trueOverapproximate stem: false 150.94/117.00 [2019-03-28 12:39:21,186 INFO L339 nArgumentSynthesizer]: Template has degree 0. 150.94/117.00 [2019-03-28 12:39:21,186 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 150.94/117.00 [2019-03-28 12:39:21,186 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 150.94/117.00 [2019-03-28 12:39:21,186 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 150.94/117.00 [2019-03-28 12:39:21,187 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 150.94/117.00 [2019-03-28 12:39:21,187 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 150.94/117.00 [2019-03-28 12:39:21,187 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 150.94/117.00 [2019-03-28 12:39:21,187 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 150.94/117.00 [2019-03-28 12:39:21,188 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 150.94/117.00 Termination analysis: LINEAR_WITH_GUESSES 150.94/117.00 Number of strict supporting invariants: 0 150.94/117.00 Number of non-strict supporting invariants: 1 150.94/117.00 Consider only non-deceasing supporting invariants: true 150.94/117.00 Simplify termination arguments: true 150.94/117.00 Simplify supporting invariants: trueOverapproximate stem: false 150.94/117.00 [2019-03-28 12:39:21,188 INFO L339 nArgumentSynthesizer]: Template has degree 0. 150.94/117.00 [2019-03-28 12:39:21,188 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 150.94/117.00 [2019-03-28 12:39:21,188 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 150.94/117.00 [2019-03-28 12:39:21,188 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 150.94/117.00 [2019-03-28 12:39:21,189 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 150.94/117.00 [2019-03-28 12:39:21,189 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 150.94/117.00 [2019-03-28 12:39:21,189 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 150.94/117.00 [2019-03-28 12:39:21,189 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 150.94/117.00 [2019-03-28 12:39:21,190 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 150.94/117.00 Termination analysis: LINEAR_WITH_GUESSES 150.94/117.00 Number of strict supporting invariants: 0 150.94/117.00 Number of non-strict supporting invariants: 1 150.94/117.00 Consider only non-deceasing supporting invariants: true 150.94/117.00 Simplify termination arguments: true 150.94/117.00 Simplify supporting invariants: trueOverapproximate stem: false 150.94/117.00 [2019-03-28 12:39:21,190 INFO L339 nArgumentSynthesizer]: Template has degree 0. 150.94/117.00 [2019-03-28 12:39:21,190 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 150.94/117.00 [2019-03-28 12:39:21,190 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 150.94/117.00 [2019-03-28 12:39:21,190 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 150.94/117.00 [2019-03-28 12:39:21,190 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 150.94/117.00 [2019-03-28 12:39:21,191 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 150.94/117.00 [2019-03-28 12:39:21,191 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 150.94/117.00 [2019-03-28 12:39:21,191 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 150.94/117.00 [2019-03-28 12:39:21,191 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 150.94/117.00 Termination analysis: LINEAR_WITH_GUESSES 150.94/117.00 Number of strict supporting invariants: 0 150.94/117.00 Number of non-strict supporting invariants: 1 150.94/117.00 Consider only non-deceasing supporting invariants: true 150.94/117.00 Simplify termination arguments: true 150.94/117.00 Simplify supporting invariants: trueOverapproximate stem: false 150.94/117.00 [2019-03-28 12:39:21,192 INFO L339 nArgumentSynthesizer]: Template has degree 0. 150.94/117.00 [2019-03-28 12:39:21,192 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 150.94/117.00 [2019-03-28 12:39:21,192 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 150.94/117.00 [2019-03-28 12:39:21,192 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 150.94/117.00 [2019-03-28 12:39:21,192 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 150.94/117.00 [2019-03-28 12:39:21,193 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 150.94/117.00 [2019-03-28 12:39:21,193 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 150.94/117.00 [2019-03-28 12:39:21,193 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 150.94/117.00 [2019-03-28 12:39:21,193 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 150.94/117.00 Termination analysis: LINEAR_WITH_GUESSES 150.94/117.00 Number of strict supporting invariants: 0 150.94/117.00 Number of non-strict supporting invariants: 1 150.94/117.00 Consider only non-deceasing supporting invariants: true 150.94/117.00 Simplify termination arguments: true 150.94/117.00 Simplify supporting invariants: trueOverapproximate stem: false 150.94/117.00 [2019-03-28 12:39:21,194 INFO L339 nArgumentSynthesizer]: Template has degree 0. 150.94/117.00 [2019-03-28 12:39:21,194 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 150.94/117.00 [2019-03-28 12:39:21,194 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 150.94/117.00 [2019-03-28 12:39:21,194 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 150.94/117.00 [2019-03-28 12:39:21,195 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 150.94/117.00 [2019-03-28 12:39:21,195 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 150.94/117.00 [2019-03-28 12:39:21,196 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 150.94/117.00 [2019-03-28 12:39:21,197 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 150.94/117.01 Termination analysis: LINEAR_WITH_GUESSES 150.94/117.01 Number of strict supporting invariants: 0 150.94/117.01 Number of non-strict supporting invariants: 1 150.94/117.01 Consider only non-deceasing supporting invariants: true 150.94/117.01 Simplify termination arguments: true 150.94/117.01 Simplify supporting invariants: trueOverapproximate stem: false 150.94/117.01 [2019-03-28 12:39:21,197 INFO L339 nArgumentSynthesizer]: Template has degree 0. 150.94/117.01 [2019-03-28 12:39:21,197 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 150.94/117.01 [2019-03-28 12:39:21,197 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 150.94/117.01 [2019-03-28 12:39:21,197 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 150.94/117.01 [2019-03-28 12:39:21,198 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 150.94/117.01 [2019-03-28 12:39:21,198 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 150.94/117.01 [2019-03-28 12:39:21,199 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 150.94/117.01 [2019-03-28 12:39:21,200 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 150.94/117.01 Termination analysis: LINEAR_WITH_GUESSES 150.94/117.01 Number of strict supporting invariants: 0 150.94/117.01 Number of non-strict supporting invariants: 1 150.94/117.01 Consider only non-deceasing supporting invariants: true 150.94/117.01 Simplify termination arguments: true 150.94/117.01 Simplify supporting invariants: trueOverapproximate stem: false 150.94/117.01 [2019-03-28 12:39:21,200 INFO L339 nArgumentSynthesizer]: Template has degree 0. 150.94/117.01 [2019-03-28 12:39:21,200 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 150.94/117.01 [2019-03-28 12:39:21,200 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 150.94/117.01 [2019-03-28 12:39:21,201 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 150.94/117.01 [2019-03-28 12:39:21,202 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 150.94/117.01 [2019-03-28 12:39:21,202 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 150.94/117.01 [2019-03-28 12:39:21,204 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 150.94/117.01 [2019-03-28 12:39:21,205 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 150.94/117.01 Termination analysis: LINEAR_WITH_GUESSES 150.94/117.01 Number of strict supporting invariants: 0 150.94/117.01 Number of non-strict supporting invariants: 1 150.94/117.01 Consider only non-deceasing supporting invariants: true 150.94/117.01 Simplify termination arguments: true 150.94/117.01 Simplify supporting invariants: trueOverapproximate stem: false 150.94/117.01 [2019-03-28 12:39:21,205 INFO L339 nArgumentSynthesizer]: Template has degree 0. 150.94/117.01 [2019-03-28 12:39:21,205 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 150.94/117.01 [2019-03-28 12:39:21,205 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 150.94/117.01 [2019-03-28 12:39:21,205 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 150.94/117.01 [2019-03-28 12:39:21,206 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 150.94/117.01 [2019-03-28 12:39:21,207 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 150.94/117.01 [2019-03-28 12:39:21,208 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 150.94/117.01 [2019-03-28 12:39:21,209 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 150.94/117.01 Termination analysis: LINEAR_WITH_GUESSES 150.94/117.01 Number of strict supporting invariants: 0 150.94/117.01 Number of non-strict supporting invariants: 1 150.94/117.01 Consider only non-deceasing supporting invariants: true 150.94/117.01 Simplify termination arguments: true 150.94/117.01 Simplify supporting invariants: trueOverapproximate stem: false 150.94/117.01 [2019-03-28 12:39:21,209 INFO L339 nArgumentSynthesizer]: Template has degree 0. 150.94/117.01 [2019-03-28 12:39:21,209 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 150.94/117.01 [2019-03-28 12:39:21,209 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 150.94/117.01 [2019-03-28 12:39:21,209 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 150.94/117.01 [2019-03-28 12:39:21,210 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 150.94/117.01 [2019-03-28 12:39:21,210 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 150.94/117.01 [2019-03-28 12:39:21,210 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 150.94/117.01 [2019-03-28 12:39:21,211 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 150.94/117.01 [2019-03-28 12:39:21,211 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 150.94/117.01 Termination analysis: LINEAR_WITH_GUESSES 150.94/117.01 Number of strict supporting invariants: 0 150.94/117.01 Number of non-strict supporting invariants: 1 150.94/117.01 Consider only non-deceasing supporting invariants: true 150.94/117.01 Simplify termination arguments: true 150.94/117.01 Simplify supporting invariants: trueOverapproximate stem: false 150.94/117.01 [2019-03-28 12:39:21,211 INFO L339 nArgumentSynthesizer]: Template has degree 0. 150.94/117.01 [2019-03-28 12:39:21,212 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 150.94/117.01 [2019-03-28 12:39:21,212 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 150.94/117.01 [2019-03-28 12:39:21,212 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 150.94/117.01 [2019-03-28 12:39:21,212 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 150.94/117.01 [2019-03-28 12:39:21,212 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 150.94/117.01 [2019-03-28 12:39:21,213 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 150.94/117.01 [2019-03-28 12:39:21,213 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 150.94/117.01 [2019-03-28 12:39:21,213 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 150.94/117.01 Termination analysis: LINEAR_WITH_GUESSES 150.94/117.01 Number of strict supporting invariants: 0 150.94/117.01 Number of non-strict supporting invariants: 1 150.94/117.01 Consider only non-deceasing supporting invariants: true 150.94/117.01 Simplify termination arguments: true 150.94/117.01 Simplify supporting invariants: trueOverapproximate stem: false 150.94/117.01 [2019-03-28 12:39:21,214 INFO L339 nArgumentSynthesizer]: Template has degree 0. 150.94/117.01 [2019-03-28 12:39:21,214 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 150.94/117.01 [2019-03-28 12:39:21,214 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 150.94/117.01 [2019-03-28 12:39:21,214 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 150.94/117.01 [2019-03-28 12:39:21,215 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 150.94/117.01 [2019-03-28 12:39:21,215 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 150.94/117.01 [2019-03-28 12:39:21,219 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 150.94/117.01 [2019-03-28 12:39:21,219 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 150.94/117.01 Termination analysis: LINEAR_WITH_GUESSES 150.94/117.01 Number of strict supporting invariants: 0 150.94/117.01 Number of non-strict supporting invariants: 1 150.94/117.01 Consider only non-deceasing supporting invariants: true 150.94/117.01 Simplify termination arguments: true 150.94/117.01 Simplify supporting invariants: trueOverapproximate stem: false 150.94/117.01 [2019-03-28 12:39:21,220 INFO L339 nArgumentSynthesizer]: Template has degree 0. 150.94/117.01 [2019-03-28 12:39:21,220 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 150.94/117.01 [2019-03-28 12:39:21,220 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 150.94/117.01 [2019-03-28 12:39:21,220 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 150.94/117.01 [2019-03-28 12:39:21,221 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 150.94/117.01 [2019-03-28 12:39:21,221 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 150.94/117.01 [2019-03-28 12:39:21,224 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 150.94/117.01 [2019-03-28 12:39:21,225 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 150.94/117.01 Termination analysis: LINEAR_WITH_GUESSES 150.94/117.01 Number of strict supporting invariants: 0 150.94/117.01 Number of non-strict supporting invariants: 1 150.94/117.01 Consider only non-deceasing supporting invariants: true 150.94/117.01 Simplify termination arguments: true 150.94/117.01 Simplify supporting invariants: trueOverapproximate stem: false 150.94/117.01 [2019-03-28 12:39:21,225 INFO L339 nArgumentSynthesizer]: Template has degree 0. 150.94/117.01 [2019-03-28 12:39:21,225 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 150.94/117.01 [2019-03-28 12:39:21,225 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 150.94/117.01 [2019-03-28 12:39:21,225 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 150.94/117.01 [2019-03-28 12:39:21,226 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 150.94/117.01 [2019-03-28 12:39:21,226 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 150.94/117.01 [2019-03-28 12:39:21,227 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 150.94/117.01 [2019-03-28 12:39:21,228 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 150.94/117.01 Termination analysis: LINEAR_WITH_GUESSES 150.94/117.01 Number of strict supporting invariants: 0 150.94/117.01 Number of non-strict supporting invariants: 1 150.94/117.01 Consider only non-deceasing supporting invariants: true 150.94/117.01 Simplify termination arguments: true 150.94/117.01 Simplify supporting invariants: trueOverapproximate stem: false 150.94/117.01 [2019-03-28 12:39:21,228 INFO L339 nArgumentSynthesizer]: Template has degree 0. 150.94/117.01 [2019-03-28 12:39:21,228 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 150.94/117.01 [2019-03-28 12:39:21,228 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 150.94/117.01 [2019-03-28 12:39:21,228 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 150.94/117.01 [2019-03-28 12:39:21,230 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 150.94/117.01 [2019-03-28 12:39:21,230 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 150.94/117.01 [2019-03-28 12:39:21,240 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 150.94/117.01 [2019-03-28 12:39:21,253 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. 150.94/117.01 [2019-03-28 12:39:21,254 INFO L444 ModelExtractionUtils]: 22 out of 28 variables were initially zero. Simplification set additionally 3 variables to zero. 150.94/117.01 [2019-03-28 12:39:21,254 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 150.94/117.01 [2019-03-28 12:39:21,255 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. 150.94/117.01 [2019-03-28 12:39:21,255 INFO L518 LassoAnalysis]: Proved termination. 150.94/117.01 [2019-03-28 12:39:21,255 INFO L520 LassoAnalysis]: Termination argument consisting of: 150.94/117.01 Ranking function f(ULTIMATE.start_main_~i~0, ULTIMATE.start_main_~length~0) = -1*ULTIMATE.start_main_~i~0 + 1*ULTIMATE.start_main_~length~0 150.94/117.01 Supporting invariants [] 150.94/117.01 [2019-03-28 12:39:21,272 INFO L297 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed 150.94/117.01 [2019-03-28 12:39:21,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 150.94/117.01 [2019-03-28 12:39:21,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 150.94/117.01 [2019-03-28 12:39:21,297 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 2 conjunts are in the unsatisfiable core 150.94/117.01 [2019-03-28 12:39:21,298 INFO L279 TraceCheckSpWp]: Computing forward predicates... 150.94/117.01 [2019-03-28 12:39:21,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 150.94/117.01 [2019-03-28 12:39:21,308 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core 150.94/117.01 [2019-03-28 12:39:21,309 INFO L279 TraceCheckSpWp]: Computing forward predicates... 150.94/117.01 [2019-03-28 12:39:21,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 150.94/117.01 [2019-03-28 12:39:21,334 INFO L98 LoopCannibalizer]: 2 predicates before loop cannibalization 2 predicates after loop cannibalization 150.94/117.01 [2019-03-28 12:39:21,334 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates 150.94/117.01 [2019-03-28 12:39:21,335 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 17 states and 36 transitions. cyclomatic complexity: 22 Second operand 3 states. 150.94/117.01 [2019-03-28 12:39:21,477 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 17 states and 36 transitions. cyclomatic complexity: 22. Second operand 3 states. Result 35 states and 109 transitions. Complement of second has 7 states. 150.94/117.01 [2019-03-28 12:39:21,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states 150.94/117.01 [2019-03-28 12:39:21,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. 150.94/117.01 [2019-03-28 12:39:21,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 77 transitions. 150.94/117.01 [2019-03-28 12:39:21,480 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 77 transitions. Stem has 6 letters. Loop has 2 letters. 150.94/117.01 [2019-03-28 12:39:21,480 INFO L116 BuchiAccepts]: Finished buchiAccepts. 150.94/117.01 [2019-03-28 12:39:21,480 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 77 transitions. Stem has 8 letters. Loop has 2 letters. 150.94/117.01 [2019-03-28 12:39:21,480 INFO L116 BuchiAccepts]: Finished buchiAccepts. 150.94/117.01 [2019-03-28 12:39:21,481 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 77 transitions. Stem has 6 letters. Loop has 4 letters. 150.94/117.01 [2019-03-28 12:39:21,481 INFO L116 BuchiAccepts]: Finished buchiAccepts. 150.94/117.01 [2019-03-28 12:39:21,575 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 109 transitions. 150.94/117.01 [2019-03-28 12:39:21,576 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 150.94/117.01 [2019-03-28 12:39:21,576 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 25 states and 63 transitions. 150.94/117.01 [2019-03-28 12:39:21,577 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 150.94/117.01 [2019-03-28 12:39:21,577 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 150.94/117.01 [2019-03-28 12:39:21,577 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 63 transitions. 150.94/117.01 [2019-03-28 12:39:21,577 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 150.94/117.01 [2019-03-28 12:39:21,577 INFO L706 BuchiCegarLoop]: Abstraction has 25 states and 63 transitions. 150.94/117.01 [2019-03-28 12:39:21,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 63 transitions. 150.94/117.01 [2019-03-28 12:39:21,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. 150.94/117.01 [2019-03-28 12:39:21,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. 150.94/117.01 [2019-03-28 12:39:21,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 62 transitions. 150.94/117.01 [2019-03-28 12:39:21,579 INFO L729 BuchiCegarLoop]: Abstraction has 24 states and 62 transitions. 150.94/117.01 [2019-03-28 12:39:21,579 INFO L609 BuchiCegarLoop]: Abstraction has 24 states and 62 transitions. 150.94/117.01 [2019-03-28 12:39:21,579 INFO L442 BuchiCegarLoop]: ======== Iteration 13============ 150.94/117.01 [2019-03-28 12:39:21,579 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 62 transitions. 150.94/117.01 [2019-03-28 12:39:21,580 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 150.94/117.01 [2019-03-28 12:39:21,580 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 150.94/117.01 [2019-03-28 12:39:21,580 INFO L119 BuchiIsEmpty]: Starting construction of run 150.94/117.01 [2019-03-28 12:39:21,580 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] 150.94/117.01 [2019-03-28 12:39:21,581 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] 150.94/117.01 [2019-03-28 12:39:21,581 INFO L794 eck$LassoCheckResult]: Stem: 884#ULTIMATE.startENTRY [1526] ULTIMATE.startENTRY-->L7: Formula: (and (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|) (= |v_#valid_18| (store |v_#valid_19| 0 0))) InVars {#valid=|v_#valid_19|} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_6|, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_4|, ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_9, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_4|, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13, ULTIMATE.start_main_~fac~0=v_ULTIMATE.start_main_~fac~0_9, ULTIMATE.start_main_#t~malloc3.offset=|v_ULTIMATE.start_main_#t~malloc3.offset_7|, ULTIMATE.start_main_#t~post6=|v_ULTIMATE.start_main_#t~post6_4|, ULTIMATE.start_main_~arr2~0.base=v_ULTIMATE.start_main_~arr2~0.base_8, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~post4=|v_ULTIMATE.start_main_#t~post4_4|, ULTIMATE.start_main_~arr2~0.offset=v_ULTIMATE.start_main_~arr2~0.offset_7, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_5|, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_11, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_11, ULTIMATE.start_main_#t~malloc2.base=|v_ULTIMATE.start_main_#t~malloc2.base_7|, ULTIMATE.start_main_#t~malloc2.offset=|v_ULTIMATE.start_main_#t~malloc2.offset_7|, ULTIMATE.start_main_#t~malloc3.base=|v_ULTIMATE.start_main_#t~malloc3.base_7|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_5|, #valid=|v_#valid_18|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_~arr~0.offset, ULTIMATE.start_main_#t~nondet5, #NULL.offset, ULTIMATE.start_main_~i~0, ULTIMATE.start_main_~fac~0, ULTIMATE.start_main_#t~malloc3.offset, ULTIMATE.start_main_#t~post6, ULTIMATE.start_main_~arr2~0.base, #NULL.base, ULTIMATE.start_main_#t~post4, ULTIMATE.start_main_~arr2~0.offset, ULTIMATE.start_main_#t~mem7, ULTIMATE.start_main_~arr~0.base, ULTIMATE.start_main_~j~0, ULTIMATE.start_main_#t~malloc2.base, ULTIMATE.start_main_#t~malloc2.offset, ULTIMATE.start_main_#t~malloc3.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_~length~0] 885#L7 [97] L7-->L7-2: Formula: (>= v_ULTIMATE.start_main_~length~0_6 1) InVars {ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_6} OutVars{ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_6} AuxVars[] AssignedVars[] 882#L7-2 [64] L7-2-->L9: Formula: (= v_ULTIMATE.start_main_~fac~0_2 |v_ULTIMATE.start_main_#t~nondet1_3|) InVars {ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_3|} OutVars{ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_2|, ULTIMATE.start_main_~fac~0=v_ULTIMATE.start_main_~fac~0_2} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_~fac~0] 883#L9 [68] L9-->L9-2: Formula: (and (= v_ULTIMATE.start_main_~fac~0_3 1) (< v_ULTIMATE.start_main_~fac~0_4 1)) InVars {ULTIMATE.start_main_~fac~0=v_ULTIMATE.start_main_~fac~0_4} OutVars{ULTIMATE.start_main_~fac~0=v_ULTIMATE.start_main_~fac~0_3} AuxVars[] AssignedVars[ULTIMATE.start_main_~fac~0] 891#L9-2 [112] L9-2-->L12: Formula: (let ((.cse0 (store |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc2.base_2| 1))) (and (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc3.base_2|) 0) (= 0 |v_ULTIMATE.start_main_#t~malloc2.offset_2|) (= v_ULTIMATE.start_main_~arr~0.offset_2 |v_ULTIMATE.start_main_#t~malloc2.offset_2|) (= v_ULTIMATE.start_main_~arr2~0.base_2 |v_ULTIMATE.start_main_#t~malloc3.base_2|) (< |v_ULTIMATE.start_main_#t~malloc3.base_2| 0) (= |v_#length_1| (store (store |v_#length_3| |v_ULTIMATE.start_main_#t~malloc2.base_2| (* 4 v_ULTIMATE.start_main_~length~0_7)) |v_ULTIMATE.start_main_#t~malloc3.base_2| (* 4 (* v_ULTIMATE.start_main_~fac~0_6 v_ULTIMATE.start_main_~length~0_7)))) (= 0 |v_ULTIMATE.start_main_#t~malloc3.offset_2|) (> 0 |v_ULTIMATE.start_main_#t~malloc2.base_2|) (< |v_ULTIMATE.start_main_#t~malloc2.base_2| |v_#StackHeapBarrier_1|) (= (store .cse0 |v_ULTIMATE.start_main_#t~malloc3.base_2| 1) |v_#valid_3|) (= v_ULTIMATE.start_main_~arr~0.base_2 |v_ULTIMATE.start_main_#t~malloc2.base_2|) (= v_ULTIMATE.start_main_~arr2~0.offset_2 |v_ULTIMATE.start_main_#t~malloc3.offset_2|) (= (select |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc2.base_2|) 0) (< |v_ULTIMATE.start_main_#t~malloc3.base_2| |v_#StackHeapBarrier_1|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, ULTIMATE.start_main_~fac~0=v_ULTIMATE.start_main_~fac~0_6, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_7, #valid=|v_#valid_5|} OutVars{ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_2, ULTIMATE.start_main_~fac~0=v_ULTIMATE.start_main_~fac~0_6, ULTIMATE.start_main_#t~malloc3.offset=|v_ULTIMATE.start_main_#t~malloc3.offset_2|, ULTIMATE.start_main_~arr2~0.base=v_ULTIMATE.start_main_~arr2~0.base_2, ULTIMATE.start_main_~arr2~0.offset=v_ULTIMATE.start_main_~arr2~0.offset_2, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_2, ULTIMATE.start_main_#t~malloc2.base=|v_ULTIMATE.start_main_#t~malloc2.base_2|, ULTIMATE.start_main_#t~malloc2.offset=|v_ULTIMATE.start_main_#t~malloc2.offset_2|, ULTIMATE.start_main_#t~malloc3.base=|v_ULTIMATE.start_main_#t~malloc3.base_2|, #valid=|v_#valid_3|, #length=|v_#length_1|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~arr~0.offset, ULTIMATE.start_main_~arr~0.base, ULTIMATE.start_main_#t~malloc2.base, ULTIMATE.start_main_#t~malloc2.offset, ULTIMATE.start_main_#t~malloc3.base, #valid, #length, ULTIMATE.start_main_#t~malloc3.offset, ULTIMATE.start_main_~arr2~0.base, ULTIMATE.start_main_~arr2~0.offset] 892#L12 [130] L12-->L13-3: Formula: (and (= v_ULTIMATE.start_main_~i~0_4 0) (< v_ULTIMATE.start_main_~arr~0.base_4 0) (< v_ULTIMATE.start_main_~arr2~0.base_4 0)) InVars {ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_4, ULTIMATE.start_main_~arr2~0.base=v_ULTIMATE.start_main_~arr2~0.base_4} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_4, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_4, ULTIMATE.start_main_~arr2~0.base=v_ULTIMATE.start_main_~arr2~0.base_4} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 890#L13-3 [1528] L13-3-->L16-3: Formula: (and (= 0 v_ULTIMATE.start_main_~j~0_12) (<= v_ULTIMATE.start_main_~length~0_15 v_ULTIMATE.start_main_~i~0_14)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_15} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_12, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_15} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 901#L16-3 150.94/117.01 [2019-03-28 12:39:21,581 INFO L796 eck$LassoCheckResult]: Loop: 901#L16-3 [77] L16-3-->L17: Formula: (< v_ULTIMATE.start_main_~j~0_6 (* v_ULTIMATE.start_main_~length~0_11 v_ULTIMATE.start_main_~fac~0_8)) InVars {ULTIMATE.start_main_~fac~0=v_ULTIMATE.start_main_~fac~0_8, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_6, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_11} OutVars{ULTIMATE.start_main_~fac~0=v_ULTIMATE.start_main_~fac~0_8, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_6, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_11} AuxVars[] AssignedVars[] 898#L17 [1201] L17-->L17-1: Formula: (let ((.cse1 (* 4 (mod v_ULTIMATE.start_main_~i~0_11 v_ULTIMATE.start_main_~length~0_12)))) (let ((.cse0 (+ v_ULTIMATE.start_main_~arr~0.offset_7 .cse1))) (and (>= v_ULTIMATE.start_main_~i~0_11 0) (< v_ULTIMATE.start_main_~length~0_12 0) (<= 0 .cse0) (<= (+ v_ULTIMATE.start_main_~arr~0.offset_7 .cse1 4) (select |v_#length_6| v_ULTIMATE.start_main_~arr~0.base_8)) (= 1 (select |v_#valid_11| v_ULTIMATE.start_main_~arr~0.base_8)) (= (select (select |v_#memory_int_3| v_ULTIMATE.start_main_~arr~0.base_8) .cse0) |v_ULTIMATE.start_main_#t~mem7_2|)))) InVars {ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_7, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_8, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_3|, #length=|v_#length_6|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_12} OutVars{ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_7, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_2|, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_8, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_3|, #length=|v_#length_6|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem7] 899#L17-1 [1533] L17-1-->L16-3: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_main_~j~0_16))) (let ((.cse0 (+ v_ULTIMATE.start_main_~arr2~0.offset_9 .cse1))) (and (= 1 (select |v_#valid_25| v_ULTIMATE.start_main_~arr2~0.base_10)) (<= 0 .cse0) (= (store |v_#memory_int_13| v_ULTIMATE.start_main_~arr2~0.base_10 (store (select |v_#memory_int_13| v_ULTIMATE.start_main_~arr2~0.base_10) .cse0 |v_ULTIMATE.start_main_#t~mem7_9|)) |v_#memory_int_12|) (= (+ v_ULTIMATE.start_main_~j~0_16 1) v_ULTIMATE.start_main_~j~0_15) (<= (+ v_ULTIMATE.start_main_~arr2~0.offset_9 .cse1 4) (select |v_#length_13| v_ULTIMATE.start_main_~arr2~0.base_10))))) InVars {ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_9|, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_16, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_13|, #length=|v_#length_13|, ULTIMATE.start_main_~arr2~0.base=v_ULTIMATE.start_main_~arr2~0.base_10, ULTIMATE.start_main_~arr2~0.offset=v_ULTIMATE.start_main_~arr2~0.offset_9} OutVars{ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_8|, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_15, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_12|, #length=|v_#length_13|, ULTIMATE.start_main_#t~post6=|v_ULTIMATE.start_main_#t~post6_5|, ULTIMATE.start_main_~arr2~0.base=v_ULTIMATE.start_main_~arr2~0.base_10, ULTIMATE.start_main_~arr2~0.offset=v_ULTIMATE.start_main_~arr2~0.offset_9} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem7, ULTIMATE.start_main_~j~0, #memory_int, ULTIMATE.start_main_#t~post6] 901#L16-3 150.94/117.01 [2019-03-28 12:39:21,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 150.94/117.01 [2019-03-28 12:39:21,582 INFO L82 PathProgramCache]: Analyzing trace with hash 1702033974, now seen corresponding path program 1 times 150.94/117.01 [2019-03-28 12:39:21,582 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 150.94/117.01 [2019-03-28 12:39:21,582 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 150.94/117.01 [2019-03-28 12:39:21,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 150.94/117.01 [2019-03-28 12:39:21,583 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 150.94/117.01 [2019-03-28 12:39:21,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 150.94/117.01 [2019-03-28 12:39:21,584 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic 150.94/117.01 [2019-03-28 12:39:21,585 INFO L258 seRefinementStrategy]: Advancing trace checker 150.94/117.01 [2019-03-28 12:39:21,585 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 150.94/117.01 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 150.94/117.01 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) 150.94/117.01 Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true 150.94/117.01 [2019-03-28 12:39:21,596 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 150.94/117.01 [2019-03-28 12:39:21,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 150.94/117.01 [2019-03-28 12:39:21,607 INFO L256 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 3 conjunts are in the unsatisfiable core 150.94/117.01 [2019-03-28 12:39:21,608 INFO L279 TraceCheckSpWp]: Computing forward predicates... 150.94/117.01 [2019-03-28 12:39:21,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 150.94/117.01 [2019-03-28 12:39:21,646 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 150.94/117.01 [2019-03-28 12:39:21,646 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 150.94/117.01 [2019-03-28 12:39:21,647 INFO L799 eck$LassoCheckResult]: stem already infeasible 150.94/117.01 [2019-03-28 12:39:21,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 150.94/117.01 [2019-03-28 12:39:21,647 INFO L82 PathProgramCache]: Analyzing trace with hash 142552, now seen corresponding path program 1 times 150.94/117.01 [2019-03-28 12:39:21,647 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 150.94/117.01 [2019-03-28 12:39:21,647 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 150.94/117.01 [2019-03-28 12:39:21,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 150.94/117.01 [2019-03-28 12:39:21,648 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 150.94/117.01 [2019-03-28 12:39:21,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 150.94/117.01 [2019-03-28 12:39:21,649 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic 150.94/117.01 [2019-03-28 12:39:21,649 INFO L258 seRefinementStrategy]: Advancing trace checker 150.94/117.01 [2019-03-28 12:39:21,649 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 150.94/117.01 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 150.94/117.01 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) 150.94/117.01 Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true 150.94/117.01 [2019-03-28 12:39:21,661 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 150.94/117.01 [2019-03-28 12:39:21,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 150.94/117.01 [2019-03-28 12:39:21,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 150.94/117.01 [2019-03-28 12:39:21,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. 150.94/117.01 [2019-03-28 12:39:21,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 150.94/117.01 [2019-03-28 12:39:21,784 INFO L87 Difference]: Start difference. First operand 24 states and 62 transitions. cyclomatic complexity: 43 Second operand 4 states. 150.94/117.01 [2019-03-28 12:39:21,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 150.94/117.01 [2019-03-28 12:39:21,859 INFO L93 Difference]: Finished difference Result 29 states and 60 transitions. 150.94/117.01 [2019-03-28 12:39:21,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 150.94/117.01 [2019-03-28 12:39:21,990 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 60 transitions. 150.94/117.01 [2019-03-28 12:39:21,991 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 12 150.94/117.01 [2019-03-28 12:39:21,992 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 29 states and 60 transitions. 150.94/117.01 [2019-03-28 12:39:21,992 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 150.94/117.01 [2019-03-28 12:39:21,992 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 150.94/117.01 [2019-03-28 12:39:21,992 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 60 transitions. 150.94/117.01 [2019-03-28 12:39:21,992 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 150.94/117.01 [2019-03-28 12:39:21,992 INFO L706 BuchiCegarLoop]: Abstraction has 29 states and 60 transitions. 150.94/117.01 [2019-03-28 12:39:21,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 60 transitions. 150.94/117.01 [2019-03-28 12:39:21,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 15. 150.94/117.01 [2019-03-28 12:39:21,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. 150.94/117.01 [2019-03-28 12:39:21,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 27 transitions. 150.94/117.01 [2019-03-28 12:39:21,994 INFO L729 BuchiCegarLoop]: Abstraction has 15 states and 27 transitions. 150.94/117.01 [2019-03-28 12:39:21,994 INFO L609 BuchiCegarLoop]: Abstraction has 15 states and 27 transitions. 150.94/117.01 [2019-03-28 12:39:21,994 INFO L442 BuchiCegarLoop]: ======== Iteration 14============ 150.94/117.01 [2019-03-28 12:39:21,994 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 27 transitions. 150.94/117.01 [2019-03-28 12:39:21,995 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 150.94/117.01 [2019-03-28 12:39:21,995 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 150.94/117.01 [2019-03-28 12:39:21,995 INFO L119 BuchiIsEmpty]: Starting construction of run 150.94/117.01 [2019-03-28 12:39:21,995 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] 150.94/117.01 [2019-03-28 12:39:21,995 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] 150.94/117.01 [2019-03-28 12:39:21,996 INFO L794 eck$LassoCheckResult]: Stem: 962#ULTIMATE.startENTRY [1526] ULTIMATE.startENTRY-->L7: Formula: (and (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|) (= |v_#valid_18| (store |v_#valid_19| 0 0))) InVars {#valid=|v_#valid_19|} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_6|, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_4|, ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_9, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_4|, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13, ULTIMATE.start_main_~fac~0=v_ULTIMATE.start_main_~fac~0_9, ULTIMATE.start_main_#t~malloc3.offset=|v_ULTIMATE.start_main_#t~malloc3.offset_7|, ULTIMATE.start_main_#t~post6=|v_ULTIMATE.start_main_#t~post6_4|, ULTIMATE.start_main_~arr2~0.base=v_ULTIMATE.start_main_~arr2~0.base_8, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~post4=|v_ULTIMATE.start_main_#t~post4_4|, ULTIMATE.start_main_~arr2~0.offset=v_ULTIMATE.start_main_~arr2~0.offset_7, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_5|, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_11, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_11, ULTIMATE.start_main_#t~malloc2.base=|v_ULTIMATE.start_main_#t~malloc2.base_7|, ULTIMATE.start_main_#t~malloc2.offset=|v_ULTIMATE.start_main_#t~malloc2.offset_7|, ULTIMATE.start_main_#t~malloc3.base=|v_ULTIMATE.start_main_#t~malloc3.base_7|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_5|, #valid=|v_#valid_18|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_~arr~0.offset, ULTIMATE.start_main_#t~nondet5, #NULL.offset, ULTIMATE.start_main_~i~0, ULTIMATE.start_main_~fac~0, ULTIMATE.start_main_#t~malloc3.offset, ULTIMATE.start_main_#t~post6, ULTIMATE.start_main_~arr2~0.base, #NULL.base, ULTIMATE.start_main_#t~post4, ULTIMATE.start_main_~arr2~0.offset, ULTIMATE.start_main_#t~mem7, ULTIMATE.start_main_~arr~0.base, ULTIMATE.start_main_~j~0, ULTIMATE.start_main_#t~malloc2.base, ULTIMATE.start_main_#t~malloc2.offset, ULTIMATE.start_main_#t~malloc3.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_~length~0] 963#L7 [97] L7-->L7-2: Formula: (>= v_ULTIMATE.start_main_~length~0_6 1) InVars {ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_6} OutVars{ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_6} AuxVars[] AssignedVars[] 960#L7-2 [64] L7-2-->L9: Formula: (= v_ULTIMATE.start_main_~fac~0_2 |v_ULTIMATE.start_main_#t~nondet1_3|) InVars {ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_3|} OutVars{ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_2|, ULTIMATE.start_main_~fac~0=v_ULTIMATE.start_main_~fac~0_2} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_~fac~0] 961#L9 [68] L9-->L9-2: Formula: (and (= v_ULTIMATE.start_main_~fac~0_3 1) (< v_ULTIMATE.start_main_~fac~0_4 1)) InVars {ULTIMATE.start_main_~fac~0=v_ULTIMATE.start_main_~fac~0_4} OutVars{ULTIMATE.start_main_~fac~0=v_ULTIMATE.start_main_~fac~0_3} AuxVars[] AssignedVars[ULTIMATE.start_main_~fac~0] 967#L9-2 [112] L9-2-->L12: Formula: (let ((.cse0 (store |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc2.base_2| 1))) (and (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc3.base_2|) 0) (= 0 |v_ULTIMATE.start_main_#t~malloc2.offset_2|) (= v_ULTIMATE.start_main_~arr~0.offset_2 |v_ULTIMATE.start_main_#t~malloc2.offset_2|) (= v_ULTIMATE.start_main_~arr2~0.base_2 |v_ULTIMATE.start_main_#t~malloc3.base_2|) (< |v_ULTIMATE.start_main_#t~malloc3.base_2| 0) (= |v_#length_1| (store (store |v_#length_3| |v_ULTIMATE.start_main_#t~malloc2.base_2| (* 4 v_ULTIMATE.start_main_~length~0_7)) |v_ULTIMATE.start_main_#t~malloc3.base_2| (* 4 (* v_ULTIMATE.start_main_~fac~0_6 v_ULTIMATE.start_main_~length~0_7)))) (= 0 |v_ULTIMATE.start_main_#t~malloc3.offset_2|) (> 0 |v_ULTIMATE.start_main_#t~malloc2.base_2|) (< |v_ULTIMATE.start_main_#t~malloc2.base_2| |v_#StackHeapBarrier_1|) (= (store .cse0 |v_ULTIMATE.start_main_#t~malloc3.base_2| 1) |v_#valid_3|) (= v_ULTIMATE.start_main_~arr~0.base_2 |v_ULTIMATE.start_main_#t~malloc2.base_2|) (= v_ULTIMATE.start_main_~arr2~0.offset_2 |v_ULTIMATE.start_main_#t~malloc3.offset_2|) (= (select |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc2.base_2|) 0) (< |v_ULTIMATE.start_main_#t~malloc3.base_2| |v_#StackHeapBarrier_1|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, ULTIMATE.start_main_~fac~0=v_ULTIMATE.start_main_~fac~0_6, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_7, #valid=|v_#valid_5|} OutVars{ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_2, ULTIMATE.start_main_~fac~0=v_ULTIMATE.start_main_~fac~0_6, ULTIMATE.start_main_#t~malloc3.offset=|v_ULTIMATE.start_main_#t~malloc3.offset_2|, ULTIMATE.start_main_~arr2~0.base=v_ULTIMATE.start_main_~arr2~0.base_2, ULTIMATE.start_main_~arr2~0.offset=v_ULTIMATE.start_main_~arr2~0.offset_2, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_2, ULTIMATE.start_main_#t~malloc2.base=|v_ULTIMATE.start_main_#t~malloc2.base_2|, ULTIMATE.start_main_#t~malloc2.offset=|v_ULTIMATE.start_main_#t~malloc2.offset_2|, ULTIMATE.start_main_#t~malloc3.base=|v_ULTIMATE.start_main_#t~malloc3.base_2|, #valid=|v_#valid_3|, #length=|v_#length_1|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~arr~0.offset, ULTIMATE.start_main_~arr~0.base, ULTIMATE.start_main_#t~malloc2.base, ULTIMATE.start_main_#t~malloc2.offset, ULTIMATE.start_main_#t~malloc3.base, #valid, #length, ULTIMATE.start_main_#t~malloc3.offset, ULTIMATE.start_main_~arr2~0.base, ULTIMATE.start_main_~arr2~0.offset] 968#L12 [130] L12-->L13-3: Formula: (and (= v_ULTIMATE.start_main_~i~0_4 0) (< v_ULTIMATE.start_main_~arr~0.base_4 0) (< v_ULTIMATE.start_main_~arr2~0.base_4 0)) InVars {ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_4, ULTIMATE.start_main_~arr2~0.base=v_ULTIMATE.start_main_~arr2~0.base_4} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_4, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_4, ULTIMATE.start_main_~arr2~0.base=v_ULTIMATE.start_main_~arr2~0.base_4} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 956#L13-3 [94] L13-3-->L14: Formula: (< v_ULTIMATE.start_main_~i~0_6 v_ULTIMATE.start_main_~length~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_6, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_6, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_9} AuxVars[] AssignedVars[] 957#L14 [1530] L14-->L13-3: Formula: (let ((.cse0 (* 4 v_ULTIMATE.start_main_~i~0_17))) (let ((.cse1 (+ .cse0 v_ULTIMATE.start_main_~arr~0.offset_11))) (and (<= (+ .cse0 v_ULTIMATE.start_main_~arr~0.offset_11 4) (select |v_#length_11| v_ULTIMATE.start_main_~arr~0.base_13)) (= (store |v_#memory_int_9| v_ULTIMATE.start_main_~arr~0.base_13 (store (select |v_#memory_int_9| v_ULTIMATE.start_main_~arr~0.base_13) .cse1 |v_ULTIMATE.start_main_#t~nondet5_8|)) |v_#memory_int_8|) (= (+ v_ULTIMATE.start_main_~i~0_17 1) v_ULTIMATE.start_main_~i~0_16) (<= 0 .cse1) (= 1 (select |v_#valid_21| v_ULTIMATE.start_main_~arr~0.base_13))))) InVars {ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_11, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_13, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_8|, #valid=|v_#valid_21|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_17, #length=|v_#length_11|} OutVars{ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_11, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_13, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_7|, #valid=|v_#valid_21|, #memory_int=|v_#memory_int_8|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_16, #length=|v_#length_11|, ULTIMATE.start_main_#t~post4=|v_ULTIMATE.start_main_#t~post4_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5, #memory_int, ULTIMATE.start_main_~i~0, ULTIMATE.start_main_#t~post4] 958#L13-3 [1528] L13-3-->L16-3: Formula: (and (= 0 v_ULTIMATE.start_main_~j~0_12) (<= v_ULTIMATE.start_main_~length~0_15 v_ULTIMATE.start_main_~i~0_14)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_15} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_12, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_15} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 959#L16-3 150.94/117.01 [2019-03-28 12:39:21,996 INFO L796 eck$LassoCheckResult]: Loop: 959#L16-3 [77] L16-3-->L17: Formula: (< v_ULTIMATE.start_main_~j~0_6 (* v_ULTIMATE.start_main_~length~0_11 v_ULTIMATE.start_main_~fac~0_8)) InVars {ULTIMATE.start_main_~fac~0=v_ULTIMATE.start_main_~fac~0_8, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_6, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_11} OutVars{ULTIMATE.start_main_~fac~0=v_ULTIMATE.start_main_~fac~0_8, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_6, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_11} AuxVars[] AssignedVars[] 965#L17 [820] L17-->L17-1: Formula: (let ((.cse2 (mod v_ULTIMATE.start_main_~i~0_11 v_ULTIMATE.start_main_~length~0_12))) (let ((.cse1 (* 4 .cse2))) (let ((.cse0 (+ v_ULTIMATE.start_main_~arr~0.offset_7 .cse1))) (and (>= v_ULTIMATE.start_main_~i~0_11 0) (<= 0 .cse0) (<= (+ v_ULTIMATE.start_main_~arr~0.offset_7 .cse1 4) (select |v_#length_6| v_ULTIMATE.start_main_~arr~0.base_8)) (>= v_ULTIMATE.start_main_~length~0_12 0) (= .cse2 0) (= (select (select |v_#memory_int_3| v_ULTIMATE.start_main_~arr~0.base_8) .cse0) |v_ULTIMATE.start_main_#t~mem7_2|) (= 1 (select |v_#valid_11| v_ULTIMATE.start_main_~arr~0.base_8)))))) InVars {ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_7, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_8, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_3|, #length=|v_#length_6|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_12} OutVars{ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_7, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_2|, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_8, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_3|, #length=|v_#length_6|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem7] 964#L17-1 [1533] L17-1-->L16-3: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_main_~j~0_16))) (let ((.cse0 (+ v_ULTIMATE.start_main_~arr2~0.offset_9 .cse1))) (and (= 1 (select |v_#valid_25| v_ULTIMATE.start_main_~arr2~0.base_10)) (<= 0 .cse0) (= (store |v_#memory_int_13| v_ULTIMATE.start_main_~arr2~0.base_10 (store (select |v_#memory_int_13| v_ULTIMATE.start_main_~arr2~0.base_10) .cse0 |v_ULTIMATE.start_main_#t~mem7_9|)) |v_#memory_int_12|) (= (+ v_ULTIMATE.start_main_~j~0_16 1) v_ULTIMATE.start_main_~j~0_15) (<= (+ v_ULTIMATE.start_main_~arr2~0.offset_9 .cse1 4) (select |v_#length_13| v_ULTIMATE.start_main_~arr2~0.base_10))))) InVars {ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_9|, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_16, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_13|, #length=|v_#length_13|, ULTIMATE.start_main_~arr2~0.base=v_ULTIMATE.start_main_~arr2~0.base_10, ULTIMATE.start_main_~arr2~0.offset=v_ULTIMATE.start_main_~arr2~0.offset_9} OutVars{ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_8|, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_15, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_12|, #length=|v_#length_13|, ULTIMATE.start_main_#t~post6=|v_ULTIMATE.start_main_#t~post6_5|, ULTIMATE.start_main_~arr2~0.base=v_ULTIMATE.start_main_~arr2~0.base_10, ULTIMATE.start_main_~arr2~0.offset=v_ULTIMATE.start_main_~arr2~0.offset_9} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem7, ULTIMATE.start_main_~j~0, #memory_int, ULTIMATE.start_main_#t~post6] 959#L16-3 150.94/117.01 [2019-03-28 12:39:21,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 150.94/117.01 [2019-03-28 12:39:21,997 INFO L82 PathProgramCache]: Analyzing trace with hash -729219878, now seen corresponding path program 1 times 150.94/117.01 [2019-03-28 12:39:21,997 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 150.94/117.01 [2019-03-28 12:39:21,997 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 150.94/117.01 [2019-03-28 12:39:21,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 150.94/117.01 [2019-03-28 12:39:21,998 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 150.94/117.01 [2019-03-28 12:39:21,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 150.94/117.01 [2019-03-28 12:39:22,000 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic 150.94/117.01 [2019-03-28 12:39:22,000 INFO L258 seRefinementStrategy]: Advancing trace checker 150.94/117.01 [2019-03-28 12:39:22,000 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 150.94/117.01 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 150.94/117.01 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) 150.94/117.01 Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true 150.94/117.01 [2019-03-28 12:39:22,012 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 150.94/117.01 [2019-03-28 12:39:22,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 150.94/117.01 [2019-03-28 12:39:22,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 150.94/117.01 [2019-03-28 12:39:22,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 150.94/117.01 [2019-03-28 12:39:22,073 INFO L82 PathProgramCache]: Analyzing trace with hash 130741, now seen corresponding path program 1 times 150.94/117.01 [2019-03-28 12:39:22,073 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 150.94/117.01 [2019-03-28 12:39:22,074 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 150.94/117.01 [2019-03-28 12:39:22,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 150.94/117.01 [2019-03-28 12:39:22,074 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 150.94/117.01 [2019-03-28 12:39:22,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 150.94/117.01 [2019-03-28 12:39:22,075 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic 150.94/117.01 [2019-03-28 12:39:22,076 INFO L258 seRefinementStrategy]: Advancing trace checker 150.94/117.01 [2019-03-28 12:39:22,076 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 150.94/117.01 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 150.94/117.01 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) 150.94/117.01 Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true 150.94/117.01 [2019-03-28 12:39:22,087 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 150.94/117.01 [2019-03-28 12:39:22,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 150.94/117.01 [2019-03-28 12:39:22,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 150.94/117.01 [2019-03-28 12:39:22,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 150.94/117.01 [2019-03-28 12:39:22,128 INFO L82 PathProgramCache]: Analyzing trace with hash -244701380, now seen corresponding path program 1 times 150.94/117.01 [2019-03-28 12:39:22,128 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 150.94/117.01 [2019-03-28 12:39:22,128 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 150.94/117.01 [2019-03-28 12:39:22,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 150.94/117.01 [2019-03-28 12:39:22,129 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 150.94/117.01 [2019-03-28 12:39:22,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 150.94/117.01 [2019-03-28 12:39:22,131 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic 150.94/117.01 [2019-03-28 12:39:22,131 INFO L258 seRefinementStrategy]: Advancing trace checker 150.94/117.01 [2019-03-28 12:39:22,132 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 150.94/117.01 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 150.94/117.01 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) 150.94/117.01 Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true 150.94/117.01 [2019-03-28 12:39:22,143 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 150.94/117.01 [2019-03-28 12:39:22,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 150.94/117.01 [2019-03-28 12:39:22,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 150.94/117.01 [2019-03-28 12:39:22,437 WARN L188 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 72 150.94/117.01 [2019-03-28 12:39:22,501 INFO L216 LassoAnalysis]: Preferences: 150.94/117.01 [2019-03-28 12:39:22,502 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 150.94/117.01 [2019-03-28 12:39:22,502 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 150.94/117.01 [2019-03-28 12:39:22,502 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 150.94/117.01 [2019-03-28 12:39:22,502 INFO L127 ssoRankerPreferences]: Use exernal solver: false 150.94/117.01 [2019-03-28 12:39:22,502 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 150.94/117.01 [2019-03-28 12:39:22,502 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 150.94/117.01 [2019-03-28 12:39:22,502 INFO L130 ssoRankerPreferences]: Path of dumped script: 150.94/117.01 [2019-03-28 12:39:22,502 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration14_Lasso 150.94/117.01 [2019-03-28 12:39:22,503 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 150.94/117.01 [2019-03-28 12:39:22,503 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 150.94/117.01 [2019-03-28 12:39:22,505 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 150.94/117.01 [2019-03-28 12:39:22,507 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 150.94/117.01 [2019-03-28 12:39:22,510 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 150.94/117.01 [2019-03-28 12:39:22,512 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 150.94/117.01 [2019-03-28 12:39:22,772 WARN L188 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 63 150.94/117.01 [2019-03-28 12:39:22,897 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 56 150.94/117.01 [2019-03-28 12:39:22,898 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 150.94/117.01 [2019-03-28 12:39:22,900 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 150.94/117.01 [2019-03-28 12:39:22,903 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 150.94/117.01 [2019-03-28 12:39:22,906 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 150.94/117.01 [2019-03-28 12:39:22,908 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 150.94/117.01 [2019-03-28 12:39:22,909 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 150.94/117.01 [2019-03-28 12:39:23,057 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 52 150.94/117.01 [2019-03-28 12:39:23,173 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 45 150.94/117.01 [2019-03-28 12:39:23,410 INFO L300 LassoAnalysis]: Preprocessing complete. 150.94/117.01 [2019-03-28 12:39:23,411 INFO L497 LassoAnalysis]: Using template 'affine'. 150.94/117.01 [2019-03-28 12:39:23,411 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 150.94/117.01 Termination analysis: LINEAR_WITH_GUESSES 150.94/117.01 Number of strict supporting invariants: 0 150.94/117.01 Number of non-strict supporting invariants: 1 150.94/117.01 Consider only non-deceasing supporting invariants: true 150.94/117.01 Simplify termination arguments: true 150.94/117.01 Simplify supporting invariants: trueOverapproximate stem: false 150.94/117.01 [2019-03-28 12:39:23,412 INFO L339 nArgumentSynthesizer]: Template has degree 0. 150.94/117.01 [2019-03-28 12:39:23,412 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 150.94/117.01 [2019-03-28 12:39:23,412 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 150.94/117.01 [2019-03-28 12:39:23,412 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 150.94/117.01 [2019-03-28 12:39:23,412 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 150.94/117.01 [2019-03-28 12:39:23,413 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 150.94/117.01 [2019-03-28 12:39:23,413 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 150.94/117.01 [2019-03-28 12:39:23,413 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 150.94/117.01 [2019-03-28 12:39:23,414 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 150.94/117.01 Termination analysis: LINEAR_WITH_GUESSES 150.94/117.01 Number of strict supporting invariants: 0 150.94/117.01 Number of non-strict supporting invariants: 1 150.94/117.01 Consider only non-deceasing supporting invariants: true 150.94/117.01 Simplify termination arguments: true 150.94/117.01 Simplify supporting invariants: trueOverapproximate stem: false 150.94/117.01 [2019-03-28 12:39:23,414 INFO L339 nArgumentSynthesizer]: Template has degree 0. 150.94/117.01 [2019-03-28 12:39:23,414 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 150.94/117.01 [2019-03-28 12:39:23,414 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 150.94/117.01 [2019-03-28 12:39:23,414 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 150.94/117.01 [2019-03-28 12:39:23,414 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 150.94/117.01 [2019-03-28 12:39:23,415 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 150.94/117.01 [2019-03-28 12:39:23,415 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 150.94/117.01 [2019-03-28 12:39:23,415 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 150.94/117.01 [2019-03-28 12:39:23,415 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 150.94/117.01 Termination analysis: LINEAR_WITH_GUESSES 150.94/117.01 Number of strict supporting invariants: 0 150.94/117.01 Number of non-strict supporting invariants: 1 150.94/117.01 Consider only non-deceasing supporting invariants: true 150.94/117.01 Simplify termination arguments: true 150.94/117.01 Simplify supporting invariants: trueOverapproximate stem: false 150.94/117.01 [2019-03-28 12:39:23,416 INFO L339 nArgumentSynthesizer]: Template has degree 0. 150.94/117.01 [2019-03-28 12:39:23,416 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 150.94/117.01 [2019-03-28 12:39:23,416 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 150.94/117.01 [2019-03-28 12:39:23,416 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 150.94/117.01 [2019-03-28 12:39:23,416 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 150.94/117.01 [2019-03-28 12:39:23,417 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 150.94/117.01 [2019-03-28 12:39:23,417 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 150.94/117.01 [2019-03-28 12:39:23,417 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 150.94/117.01 [2019-03-28 12:39:23,417 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 150.94/117.01 Termination analysis: LINEAR_WITH_GUESSES 150.94/117.01 Number of strict supporting invariants: 0 150.94/117.01 Number of non-strict supporting invariants: 1 150.94/117.01 Consider only non-deceasing supporting invariants: true 150.94/117.01 Simplify termination arguments: true 150.94/117.01 Simplify supporting invariants: trueOverapproximate stem: false 150.94/117.01 [2019-03-28 12:39:23,418 INFO L339 nArgumentSynthesizer]: Template has degree 0. 150.94/117.01 [2019-03-28 12:39:23,418 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 150.94/117.01 [2019-03-28 12:39:23,418 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 150.94/117.01 [2019-03-28 12:39:23,418 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 150.94/117.01 [2019-03-28 12:39:23,421 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 150.94/117.01 [2019-03-28 12:39:23,421 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 150.94/117.01 [2019-03-28 12:39:23,443 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 150.94/117.01 [2019-03-28 12:39:23,461 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. 150.94/117.01 [2019-03-28 12:39:23,462 INFO L444 ModelExtractionUtils]: 30 out of 37 variables were initially zero. Simplification set additionally 3 variables to zero. 150.94/117.01 [2019-03-28 12:39:23,462 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 150.94/117.01 [2019-03-28 12:39:23,463 INFO L440 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. 150.94/117.01 [2019-03-28 12:39:23,463 INFO L518 LassoAnalysis]: Proved termination. 150.94/117.01 [2019-03-28 12:39:23,463 INFO L520 LassoAnalysis]: Termination argument consisting of: 150.94/117.01 Ranking function f(v_rep(select #length ULTIMATE.start_main_~arr2~0.base)_1, ULTIMATE.start_main_~j~0) = 1*v_rep(select #length ULTIMATE.start_main_~arr2~0.base)_1 - 4*ULTIMATE.start_main_~j~0 150.94/117.01 Supporting invariants [1*ULTIMATE.start_main_~arr2~0.offset >= 0] 150.94/117.01 [2019-03-28 12:39:23,496 INFO L297 tatePredicateManager]: 11 out of 12 supporting invariants were superfluous and have been removed 150.94/117.01 [2019-03-28 12:39:23,498 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 150.94/117.01 [2019-03-28 12:39:23,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 150.94/117.01 [2019-03-28 12:39:23,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 150.94/117.01 [2019-03-28 12:39:23,537 INFO L256 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 4 conjunts are in the unsatisfiable core 150.94/117.01 [2019-03-28 12:39:23,538 INFO L279 TraceCheckSpWp]: Computing forward predicates... 150.94/117.01 [2019-03-28 12:39:23,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 150.94/117.01 [2019-03-28 12:39:23,553 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 5 conjunts are in the unsatisfiable core 150.94/117.01 [2019-03-28 12:39:23,553 INFO L279 TraceCheckSpWp]: Computing forward predicates... 150.94/117.01 [2019-03-28 12:39:23,554 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 150.94/117.01 [2019-03-28 12:39:23,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 150.94/117.01 [2019-03-28 12:39:23,574 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 5 conjunts are in the unsatisfiable core 150.94/117.01 [2019-03-28 12:39:23,574 INFO L279 TraceCheckSpWp]: Computing forward predicates... 150.94/117.01 [2019-03-28 12:39:23,629 INFO L98 LoopCannibalizer]: 2 predicates before loop cannibalization 3 predicates after loop cannibalization 150.94/117.01 [2019-03-28 12:39:23,629 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates 150.94/117.01 [2019-03-28 12:39:23,630 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 15 states and 27 transitions. cyclomatic complexity: 14 Second operand 4 states. 150.94/117.01 [2019-03-28 12:39:23,737 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 15 states and 27 transitions. cyclomatic complexity: 14. Second operand 4 states. Result 18 states and 37 transitions. Complement of second has 5 states. 150.94/117.01 [2019-03-28 12:39:23,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states 150.94/117.01 [2019-03-28 12:39:23,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. 150.94/117.01 [2019-03-28 12:39:23,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 36 transitions. 150.94/117.01 [2019-03-28 12:39:23,739 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 36 transitions. Stem has 9 letters. Loop has 3 letters. 150.94/117.01 [2019-03-28 12:39:23,739 INFO L116 BuchiAccepts]: Finished buchiAccepts. 150.94/117.01 [2019-03-28 12:39:23,739 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 36 transitions. Stem has 12 letters. Loop has 3 letters. 150.94/117.01 [2019-03-28 12:39:23,739 INFO L116 BuchiAccepts]: Finished buchiAccepts. 150.94/117.01 [2019-03-28 12:39:23,739 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 36 transitions. Stem has 9 letters. Loop has 6 letters. 150.94/117.01 [2019-03-28 12:39:23,739 INFO L116 BuchiAccepts]: Finished buchiAccepts. 150.94/117.01 [2019-03-28 12:39:23,832 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 37 transitions. 150.94/117.01 [2019-03-28 12:39:23,833 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 150.94/117.01 [2019-03-28 12:39:23,833 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 0 states and 0 transitions. 150.94/117.01 [2019-03-28 12:39:23,834 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 150.94/117.01 [2019-03-28 12:39:23,834 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 150.94/117.01 [2019-03-28 12:39:23,834 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. 150.94/117.01 [2019-03-28 12:39:23,834 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 150.94/117.01 [2019-03-28 12:39:23,834 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 150.94/117.01 [2019-03-28 12:39:23,834 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 150.94/117.01 [2019-03-28 12:39:23,834 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 150.94/117.01 [2019-03-28 12:39:23,834 INFO L442 BuchiCegarLoop]: ======== Iteration 15============ 150.94/117.01 [2019-03-28 12:39:23,835 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. 150.94/117.01 [2019-03-28 12:39:23,835 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 150.94/117.01 [2019-03-28 12:39:23,835 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true 150.94/117.01 [2019-03-28 12:39:23,841 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:39:23 BasicIcfg 150.94/117.01 [2019-03-28 12:39:23,841 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- 150.94/117.01 [2019-03-28 12:39:23,841 INFO L168 Benchmark]: Toolchain (without parser) took 112570.34 ms. Allocated memory was 649.6 MB in the beginning and 1.1 GB in the end (delta: 402.7 MB). Free memory was 558.5 MB in the beginning and 407.7 MB in the end (delta: 150.8 MB). Peak memory consumption was 553.4 MB. Max. memory is 50.3 GB. 150.94/117.01 [2019-03-28 12:39:23,842 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 649.6 MB. Free memory is still 580.0 MB. There was no memory consumed. Max. memory is 50.3 GB. 150.94/117.01 [2019-03-28 12:39:23,842 INFO L168 Benchmark]: CACSL2BoogieTranslator took 299.83 ms. Allocated memory was 649.6 MB in the beginning and 686.3 MB in the end (delta: 36.7 MB). Free memory was 558.5 MB in the beginning and 652.5 MB in the end (delta: -94.0 MB). Peak memory consumption was 30.0 MB. Max. memory is 50.3 GB. 150.94/117.01 [2019-03-28 12:39:23,843 INFO L168 Benchmark]: Boogie Procedure Inliner took 40.03 ms. Allocated memory is still 686.3 MB. Free memory was 652.5 MB in the beginning and 649.4 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 50.3 GB. 150.94/117.01 [2019-03-28 12:39:23,843 INFO L168 Benchmark]: Boogie Preprocessor took 25.51 ms. Allocated memory is still 686.3 MB. Free memory was 649.4 MB in the beginning and 648.1 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. 150.94/117.01 [2019-03-28 12:39:23,844 INFO L168 Benchmark]: RCFGBuilder took 297.42 ms. Allocated memory is still 686.3 MB. Free memory was 648.1 MB in the beginning and 626.0 MB in the end (delta: 22.1 MB). Peak memory consumption was 22.1 MB. Max. memory is 50.3 GB. 150.94/117.01 [2019-03-28 12:39:23,844 INFO L168 Benchmark]: BlockEncodingV2 took 76466.28 ms. Allocated memory is still 686.3 MB. Free memory was 626.0 MB in the beginning and 409.9 MB in the end (delta: 216.1 MB). Peak memory consumption was 216.1 MB. Max. memory is 50.3 GB. 150.94/117.01 [2019-03-28 12:39:23,845 INFO L168 Benchmark]: TraceAbstraction took 25394.38 ms. Allocated memory was 686.3 MB in the beginning and 845.2 MB in the end (delta: 158.9 MB). Free memory was 409.9 MB in the beginning and 588.4 MB in the end (delta: -178.5 MB). There was no memory consumed. Max. memory is 50.3 GB. 150.94/117.01 [2019-03-28 12:39:23,845 INFO L168 Benchmark]: BuchiAutomizer took 10041.25 ms. Allocated memory was 845.2 MB in the beginning and 1.1 GB in the end (delta: 207.1 MB). Free memory was 588.4 MB in the beginning and 407.7 MB in the end (delta: 180.7 MB). Peak memory consumption was 387.8 MB. Max. memory is 50.3 GB. 150.94/117.01 [2019-03-28 12:39:23,848 INFO L337 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### 150.94/117.01 --- Results --- 150.94/117.01 * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: 150.94/117.01 - StatisticsResult: Initial Icfg 150.94/117.01 27 locations, 33 edges 150.94/117.01 - StatisticsResult: Encoded RCFG 150.94/117.01 17 locations, 1425 edges 150.94/117.01 * Results from de.uni_freiburg.informatik.ultimate.core: 150.94/117.01 - StatisticsResult: Toolchain Benchmarks 150.94/117.01 Benchmark results are: 150.94/117.01 * CDTParser took 0.19 ms. Allocated memory is still 649.6 MB. Free memory is still 580.0 MB. There was no memory consumed. Max. memory is 50.3 GB. 150.94/117.01 * CACSL2BoogieTranslator took 299.83 ms. Allocated memory was 649.6 MB in the beginning and 686.3 MB in the end (delta: 36.7 MB). Free memory was 558.5 MB in the beginning and 652.5 MB in the end (delta: -94.0 MB). Peak memory consumption was 30.0 MB. Max. memory is 50.3 GB. 150.94/117.01 * Boogie Procedure Inliner took 40.03 ms. Allocated memory is still 686.3 MB. Free memory was 652.5 MB in the beginning and 649.4 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 50.3 GB. 150.94/117.01 * Boogie Preprocessor took 25.51 ms. Allocated memory is still 686.3 MB. Free memory was 649.4 MB in the beginning and 648.1 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. 150.94/117.01 * RCFGBuilder took 297.42 ms. Allocated memory is still 686.3 MB. Free memory was 648.1 MB in the beginning and 626.0 MB in the end (delta: 22.1 MB). Peak memory consumption was 22.1 MB. Max. memory is 50.3 GB. 150.94/117.01 * BlockEncodingV2 took 76466.28 ms. Allocated memory is still 686.3 MB. Free memory was 626.0 MB in the beginning and 409.9 MB in the end (delta: 216.1 MB). Peak memory consumption was 216.1 MB. Max. memory is 50.3 GB. 150.94/117.01 * TraceAbstraction took 25394.38 ms. Allocated memory was 686.3 MB in the beginning and 845.2 MB in the end (delta: 158.9 MB). Free memory was 409.9 MB in the beginning and 588.4 MB in the end (delta: -178.5 MB). There was no memory consumed. Max. memory is 50.3 GB. 150.94/117.01 * BuchiAutomizer took 10041.25 ms. Allocated memory was 845.2 MB in the beginning and 1.1 GB in the end (delta: 207.1 MB). Free memory was 588.4 MB in the beginning and 407.7 MB in the end (delta: 180.7 MB). Peak memory consumption was 387.8 MB. Max. memory is 50.3 GB. 150.94/117.01 * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: 150.94/117.01 - GenericResult: Unfinished Backtranslation 150.94/117.01 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_20,QUANTIFIED] 150.94/117.01 - GenericResult: Unfinished Backtranslation 150.94/117.01 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_20,QUANTIFIED] 150.94/117.01 - GenericResult: Unfinished Backtranslation 150.94/117.01 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_#t~malloc3.base,QUANTIFIED] 150.94/117.01 - GenericResult: Unfinished Backtranslation 150.94/117.01 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_#t~malloc3.base,QUANTIFIED] 150.94/117.01 - GenericResult: Unfinished Backtranslation 150.94/117.01 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] 150.94/117.01 - GenericResult: Unfinished Backtranslation 150.94/117.01 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] 150.94/117.01 - GenericResult: Unfinished Backtranslation 150.94/117.01 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~fac~0,QUANTIFIED] 150.94/117.01 - GenericResult: Unfinished Backtranslation 150.94/117.01 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] 150.94/117.01 - GenericResult: Unfinished Backtranslation 150.94/117.01 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_#t~malloc3.base,QUANTIFIED] 150.94/117.01 - GenericResult: Unfinished Backtranslation 150.94/117.01 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_#t~malloc3.base,QUANTIFIED] 150.94/117.01 - GenericResult: Unfinished Backtranslation 150.94/117.01 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_20,QUANTIFIED] 150.94/117.01 - GenericResult: Unfinished Backtranslation 150.94/117.01 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_20,QUANTIFIED] 150.94/117.01 - GenericResult: Unfinished Backtranslation 150.94/117.01 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_#t~malloc3.base,QUANTIFIED] 150.94/117.01 - GenericResult: Unfinished Backtranslation 150.94/117.01 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_#t~malloc3.base,QUANTIFIED] 150.94/117.01 - GenericResult: Unfinished Backtranslation 150.94/117.01 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] 150.94/117.01 - GenericResult: Unfinished Backtranslation 150.94/117.01 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] 150.94/117.01 - GenericResult: Unfinished Backtranslation 150.94/117.01 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~fac~0,QUANTIFIED] 150.94/117.01 - GenericResult: Unfinished Backtranslation 150.94/117.01 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] 150.94/117.01 - GenericResult: Unfinished Backtranslation 150.94/117.01 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_#t~malloc3.base,QUANTIFIED] 150.94/117.01 - GenericResult: Unfinished Backtranslation 150.94/117.01 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_#t~malloc3.base,QUANTIFIED] 150.94/117.01 - GenericResult: Unfinished Backtranslation 150.94/117.01 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_20,QUANTIFIED] 150.94/117.01 - GenericResult: Unfinished Backtranslation 150.94/117.01 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_20,QUANTIFIED] 150.94/117.01 - GenericResult: Unfinished Backtranslation 150.94/117.01 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_#t~malloc3.base,QUANTIFIED] 150.94/117.01 - GenericResult: Unfinished Backtranslation 150.94/117.01 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_#t~malloc3.base,QUANTIFIED] 150.94/117.01 - GenericResult: Unfinished Backtranslation 150.94/117.01 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] 150.94/117.01 - GenericResult: Unfinished Backtranslation 150.94/117.01 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] 150.94/117.01 - GenericResult: Unfinished Backtranslation 150.94/117.01 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~fac~0,QUANTIFIED] 150.94/117.01 - GenericResult: Unfinished Backtranslation 150.94/117.01 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] 150.94/117.01 - GenericResult: Unfinished Backtranslation 150.94/117.01 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_#t~malloc3.base,QUANTIFIED] 150.94/117.01 - GenericResult: Unfinished Backtranslation 150.94/117.01 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_#t~malloc3.base,QUANTIFIED] 150.94/117.01 - GenericResult: Unfinished Backtranslation 150.94/117.01 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_20,QUANTIFIED] 150.94/117.01 - GenericResult: Unfinished Backtranslation 150.94/117.01 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_20,QUANTIFIED] 150.94/117.01 - GenericResult: Unfinished Backtranslation 150.94/117.01 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_#t~malloc3.base,QUANTIFIED] 150.94/117.01 - GenericResult: Unfinished Backtranslation 150.94/117.01 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_#t~malloc3.base,QUANTIFIED] 150.94/117.01 - GenericResult: Unfinished Backtranslation 150.94/117.01 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] 150.94/117.01 - GenericResult: Unfinished Backtranslation 150.94/117.01 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] 150.94/117.01 - GenericResult: Unfinished Backtranslation 150.94/117.01 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~fac~0,QUANTIFIED] 150.94/117.01 - GenericResult: Unfinished Backtranslation 150.94/117.01 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] 150.94/117.01 - GenericResult: Unfinished Backtranslation 150.94/117.01 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_#t~malloc3.base,QUANTIFIED] 150.94/117.01 - GenericResult: Unfinished Backtranslation 150.94/117.01 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_#t~malloc3.base,QUANTIFIED] 150.94/117.01 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: 150.94/117.01 - GenericResult: Unfinished Backtranslation 150.94/117.01 unknown boogie variable #length 150.94/117.01 - GenericResult: Unfinished Backtranslation 150.94/117.01 unknown boogie variable #length 150.94/117.01 - GenericResult: Unfinished Backtranslation 150.94/117.01 unknown boogie variable #length 150.94/117.01 - GenericResult: Unfinished Backtranslation 150.94/117.01 unknown boogie variable #length 150.94/117.01 - GenericResult: Unfinished Backtranslation 150.94/117.01 unknown boogie variable #length 150.94/117.01 - GenericResult: Unfinished Backtranslation 150.94/117.01 unknown boogie variable #length 150.94/117.01 - GenericResult: Unfinished Backtranslation 150.94/117.01 unknown boogie variable #length 150.94/117.01 - GenericResult: Unfinished Backtranslation 150.94/117.01 unknown boogie variable #length 150.94/117.01 - GenericResult: Unfinished Backtranslation 150.94/117.01 unknown boogie variable #length 150.94/117.01 - GenericResult: Unfinished Backtranslation 150.94/117.01 unknown boogie variable #length 150.94/117.01 - GenericResult: Unfinished Backtranslation 150.94/117.01 unknown boogie variable #length 150.94/117.01 - GenericResult: Unfinished Backtranslation 150.94/117.01 unknown boogie variable #length 150.94/117.01 - GenericResult: Unfinished Backtranslation 150.94/117.01 unknown boogie variable #length 150.94/117.01 - GenericResult: Unfinished Backtranslation 150.94/117.01 unknown boogie variable #length 150.94/117.01 - GenericResult: Unfinished Backtranslation 150.94/117.01 unknown boogie variable #length 150.94/117.01 - GenericResult: Unfinished Backtranslation 150.94/117.01 unknown boogie variable #length 150.94/117.01 - GenericResult: Unfinished Backtranslation 150.94/117.01 unknown boogie variable #length 150.94/117.01 - GenericResult: Unfinished Backtranslation 150.94/117.01 unknown boogie variable #length 150.94/117.01 - GenericResult: Unfinished Backtranslation 150.94/117.01 unknown boogie variable #length 150.94/117.01 - GenericResult: Unfinished Backtranslation 150.94/117.01 unknown boogie variable #length 150.94/117.01 - GenericResult: Unfinished Backtranslation 150.94/117.01 unknown boogie variable #length 150.94/117.01 - GenericResult: Unfinished Backtranslation 150.94/117.01 unknown boogie variable #length 150.94/117.01 - GenericResult: Unfinished Backtranslation 150.94/117.01 unknown boogie variable #length 150.94/117.01 - GenericResult: Unfinished Backtranslation 150.94/117.01 unknown boogie variable #length 150.94/117.01 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: 150.94/117.01 - PositiveResult [Line: 14]: pointer dereference always succeeds 150.94/117.01 For all program executions holds that pointer dereference always succeeds at this location 150.94/117.01 - PositiveResult [Line: 14]: pointer dereference always succeeds 150.94/117.01 For all program executions holds that pointer dereference always succeeds at this location 150.94/117.01 - PositiveResult [Line: 17]: pointer dereference always succeeds 150.94/117.01 For all program executions holds that pointer dereference always succeeds at this location 150.94/117.01 - PositiveResult [Line: 17]: pointer dereference always succeeds 150.94/117.01 For all program executions holds that pointer dereference always succeeds at this location 150.94/117.01 - PositiveResult [Line: 17]: pointer dereference always succeeds 150.94/117.01 For all program executions holds that pointer dereference always succeeds at this location 150.94/117.01 - PositiveResult [Line: 17]: pointer dereference always succeeds 150.94/117.01 For all program executions holds that pointer dereference always succeeds at this location 150.94/117.01 - AllSpecificationsHoldResult: All specifications hold 150.94/117.01 6 specifications checked. All of them hold 150.94/117.01 - InvariantResult [Line: 13]: Loop Invariant 150.94/117.01 [2019-03-28 12:39:23,857 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_20,QUANTIFIED] 150.94/117.01 [2019-03-28 12:39:23,857 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_20,QUANTIFIED] 150.94/117.01 [2019-03-28 12:39:23,857 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_#t~malloc3.base,QUANTIFIED] 150.94/117.01 [2019-03-28 12:39:23,857 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_#t~malloc3.base,QUANTIFIED] 150.94/117.01 [2019-03-28 12:39:23,858 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] 150.94/117.01 [2019-03-28 12:39:23,858 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] 150.94/117.01 [2019-03-28 12:39:23,858 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~fac~0,QUANTIFIED] 150.94/117.01 [2019-03-28 12:39:23,858 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] 150.94/117.01 [2019-03-28 12:39:23,859 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_#t~malloc3.base,QUANTIFIED] 150.94/117.01 [2019-03-28 12:39:23,859 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_#t~malloc3.base,QUANTIFIED] 150.94/117.01 [2019-03-28 12:39:23,859 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 150.94/117.01 [2019-03-28 12:39:23,860 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 150.94/117.01 [2019-03-28 12:39:23,860 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 150.94/117.01 [2019-03-28 12:39:23,860 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 150.94/117.01 [2019-03-28 12:39:23,860 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 150.94/117.01 [2019-03-28 12:39:23,861 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_20,QUANTIFIED] 150.94/117.01 [2019-03-28 12:39:23,861 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_20,QUANTIFIED] 150.94/117.01 [2019-03-28 12:39:23,861 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_#t~malloc3.base,QUANTIFIED] 150.94/117.01 [2019-03-28 12:39:23,862 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_#t~malloc3.base,QUANTIFIED] 150.94/117.01 [2019-03-28 12:39:23,862 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] 150.94/117.01 [2019-03-28 12:39:23,862 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] 150.94/117.01 [2019-03-28 12:39:23,862 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~fac~0,QUANTIFIED] 150.94/117.01 [2019-03-28 12:39:23,863 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] 150.94/117.01 [2019-03-28 12:39:23,863 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_#t~malloc3.base,QUANTIFIED] 150.94/117.01 [2019-03-28 12:39:23,863 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_#t~malloc3.base,QUANTIFIED] 150.94/117.01 [2019-03-28 12:39:23,864 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 150.94/117.01 [2019-03-28 12:39:23,864 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 150.94/117.01 [2019-03-28 12:39:23,864 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 150.94/117.01 [2019-03-28 12:39:23,864 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 150.94/117.01 [2019-03-28 12:39:23,865 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 150.94/117.01 Derived loop invariant: ((((((((((4 * length == unknown-#length-unknown[arr] && (\exists v_ULTIMATE.start_main_~i~0_20 : int :: i <= v_ULTIMATE.start_main_~i~0_20 + 1 && 4 * v_ULTIMATE.start_main_~i~0_20 + arr + 4 <= unknown-#length-unknown[arr])) && (\exists ULTIMATE.start_main_#t~malloc3.base : int :: !(arr == ULTIMATE.start_main_#t~malloc3.base) && 1 == \valid[ULTIMATE.start_main_#t~malloc3.base])) && 1 == \valid[arr2]) && 4 * (fac * length) == unknown-#length-unknown[arr2]) && \valid[arr] == 1) && arr2 <= 0) && arr <= 0) && 0 <= arr) && 0 <= arr2) && (\exists ULTIMATE.start_main_#t~malloc3.base : int, ULTIMATE.start_main_~fac~0 : int, ULTIMATE.start_main_~length~0 : int :: ((1 <= ULTIMATE.start_main_~length~0 && 4 * ULTIMATE.start_main_~length~0 == unknown-#length-unknown[arr]) && 4 * (ULTIMATE.start_main_~fac~0 * ULTIMATE.start_main_~length~0) == unknown-#length-unknown[ULTIMATE.start_main_#t~malloc3.base]) && !(arr == ULTIMATE.start_main_#t~malloc3.base))) && 0 <= i 150.94/117.01 - InvariantResult [Line: 16]: Loop Invariant 150.94/117.01 [2019-03-28 12:39:23,865 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_20,QUANTIFIED] 150.94/117.01 [2019-03-28 12:39:23,865 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_20,QUANTIFIED] 150.94/117.01 [2019-03-28 12:39:23,866 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_#t~malloc3.base,QUANTIFIED] 150.94/117.01 [2019-03-28 12:39:23,866 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_#t~malloc3.base,QUANTIFIED] 150.94/117.01 [2019-03-28 12:39:23,866 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] 150.94/117.01 [2019-03-28 12:39:23,866 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] 150.94/117.01 [2019-03-28 12:39:23,867 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~fac~0,QUANTIFIED] 150.94/117.01 [2019-03-28 12:39:23,867 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] 150.94/117.01 [2019-03-28 12:39:23,867 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_#t~malloc3.base,QUANTIFIED] 150.94/117.01 [2019-03-28 12:39:23,867 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_#t~malloc3.base,QUANTIFIED] 150.94/117.01 [2019-03-28 12:39:23,868 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 150.94/117.01 [2019-03-28 12:39:23,868 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 150.94/117.01 [2019-03-28 12:39:23,868 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 150.94/117.01 [2019-03-28 12:39:23,868 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 150.94/117.01 [2019-03-28 12:39:23,869 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 150.94/117.01 [2019-03-28 12:39:23,869 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_20,QUANTIFIED] 150.94/117.01 [2019-03-28 12:39:23,869 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_20,QUANTIFIED] 150.94/117.01 [2019-03-28 12:39:23,870 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_#t~malloc3.base,QUANTIFIED] 150.94/117.01 [2019-03-28 12:39:23,870 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_#t~malloc3.base,QUANTIFIED] 150.94/117.01 [2019-03-28 12:39:23,870 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] 150.94/117.01 [2019-03-28 12:39:23,870 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] 150.94/117.01 [2019-03-28 12:39:23,870 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~fac~0,QUANTIFIED] 150.94/117.01 [2019-03-28 12:39:23,871 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] 150.94/117.01 [2019-03-28 12:39:23,871 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_#t~malloc3.base,QUANTIFIED] 150.94/117.01 [2019-03-28 12:39:23,871 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_#t~malloc3.base,QUANTIFIED] 150.94/117.01 [2019-03-28 12:39:23,871 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 150.94/117.01 [2019-03-28 12:39:23,872 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 150.94/117.01 [2019-03-28 12:39:23,872 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 150.94/117.01 [2019-03-28 12:39:23,872 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 150.94/117.01 [2019-03-28 12:39:23,872 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 150.94/117.01 Derived loop invariant: ((((((((((4 * length == unknown-#length-unknown[arr] && length <= i) && (\exists v_ULTIMATE.start_main_~i~0_20 : int :: i <= v_ULTIMATE.start_main_~i~0_20 + 1 && 4 * v_ULTIMATE.start_main_~i~0_20 + arr + 4 <= unknown-#length-unknown[arr])) && (\exists ULTIMATE.start_main_#t~malloc3.base : int :: !(arr == ULTIMATE.start_main_#t~malloc3.base) && 1 == \valid[ULTIMATE.start_main_#t~malloc3.base])) && 1 == \valid[arr2]) && 4 * (fac * length) == unknown-#length-unknown[arr2]) && \valid[arr] == 1) && arr2 <= 0) && 0 <= arr) && 0 <= j) && 0 <= arr2) && (\exists ULTIMATE.start_main_#t~malloc3.base : int, ULTIMATE.start_main_~fac~0 : int, ULTIMATE.start_main_~length~0 : int :: ((1 <= ULTIMATE.start_main_~length~0 && 4 * ULTIMATE.start_main_~length~0 == unknown-#length-unknown[arr]) && 4 * (ULTIMATE.start_main_~fac~0 * ULTIMATE.start_main_~length~0) == unknown-#length-unknown[ULTIMATE.start_main_#t~malloc3.base]) && !(arr == ULTIMATE.start_main_#t~malloc3.base)) 150.94/117.01 - StatisticsResult: Ultimate Automizer benchmark data 150.94/117.01 CFG has 1 procedures, 17 locations, 6 error locations. SAFE Result, 25.2s OverallTime, 17 OverallIterations, 2 TraceHistogramMax, 21.6s AutomataDifference, 0.0s DeadEndRemovalTime, 1.6s HoareAnnotationTime, HoareTripleCheckerStatistics: 101 SDtfs, 675 SDslu, 278 SDs, 0 SdLazy, 1134 SolverSat, 2836 SolverUnsat, 4 SolverUnknown, 0 SolverNotchecked, 20.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 154 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=31occurred in iteration=11, 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.1s AutomataMinimizationTime, 17 MinimizatonAttempts, 51 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 2 LocationsWithAnnotation, 2 PreInvPairs, 7 NumberOfFragments, 190 HoareAnnotationTreeSize, 2 FomulaSimplifications, 1597 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 2 FomulaSimplificationsInter, 142 FormulaSimplificationTreeSizeReductionInter, 1.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 164 NumberOfCodeBlocks, 164 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 147 ConstructedInterpolants, 22 QuantifiedInterpolants, 8597 SizeOfPredicates, 40 NumberOfNonLiveVariables, 820 ConjunctsInSsa, 91 ConjunctsInUnsatCore, 17 InterpolantComputations, 15 PerfectInterpolantSequences, 9/11 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available 150.94/117.01 - StatisticsResult: Constructed decomposition of program 150.94/117.01 Your program was decomposed into 14 terminating modules (9 trivial, 0 deterministic, 5 nondeterministic). One nondeterministic module has affine ranking function -1 * arr + -4 * i + unknown-#length-unknown[arr] and consists of 3 locations. One nondeterministic module has affine ranking function -1 * arr + unknown-#length-unknown[alloca(length*sizeof(int))] + -4 * i and consists of 4 locations. One nondeterministic module has affine ranking function -1 * arr + unknown-#length-unknown[arr] + -4 * i and consists of 3 locations. One nondeterministic module has affine ranking function -1 * i + length and consists of 5 locations. One nondeterministic module has affine ranking function unknown-#length-unknown[arr2] + -4 * j and consists of 4 locations. 9 modules have a trivial ranking function, the largest among these consists of 4 locations. 150.94/117.01 - StatisticsResult: Timing statistics 150.94/117.01 BüchiAutomizer plugin needed 10.0s and 15 iterations. TraceHistogramMax:1. Analysis of lassos took 6.1s. Construction of modules took 1.9s. Büchi inclusion checks took 1.8s. Highest rank in rank-based complementation 3. Minimization of det autom 14. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 13 MinimizatonAttempts, 56 StatesRemovedByMinimization, 9 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 24 states and ocurred in iteration 12. Nontrivial modules had stage [5, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 123 SDtfs, 529 SDslu, 100 SDs, 0 SdLazy, 689 SolverSat, 1413 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.9s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU9 SILI0 SILT0 lasso5 LassoPreprocessingBenchmarks: Lassos: inital150 mio100 ax100 hnf100 lsp92 ukn80 mio100 lsp61 div111 bol100 ite100 ukn100 eq172 hnf91 smp94 dnf99 smp100 tf100 neg100 sie101 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 7ms VariablesStem: 2 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s 150.94/117.01 - TerminationAnalysisResult: Termination proven 150.94/117.01 Buchi Automizer proved that your program is terminating 150.94/117.01 RESULT: Ultimate proved your program to be correct! 150.94/117.01 !SESSION 2019-03-28 12:37:27.873 ----------------------------------------------- 150.94/117.01 eclipse.buildId=unknown 150.94/117.01 java.version=1.8.0_181 150.94/117.01 java.vendor=Oracle Corporation 150.94/117.01 BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US 150.94/117.01 Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox/benchmark/theBenchmark.c 150.94/117.01 Command-line arguments: -os linux -ws gtk -arch x86_64 -consoleLog -data @user.home/.ultimate -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -data /export/starexec/sandbox/tmp -i /export/starexec/sandbox/benchmark/theBenchmark.c 150.94/117.01 150.94/117.01 !ENTRY org.eclipse.core.resources 2 10035 2019-03-28 12:39:24.098 150.94/117.01 !MESSAGE The workspace will exit with unsaved changes in this session. 150.94/117.01 Received shutdown request... 150.94/117.01 Ultimate: 150.94/117.01 GTK+ Version Check 150.94/117.01 EOF