17.42/7.67 YES 17.42/7.67 17.42/7.67 Ultimate: Cannot open display: 17.42/7.67 This is Ultimate 0.1.24-8dc7c08-m 17.42/7.67 [2019-03-28 12:17:32,375 INFO L170 SettingsManager]: Resetting all preferences to default values... 17.42/7.67 [2019-03-28 12:17:32,377 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values 17.42/7.67 [2019-03-28 12:17:32,388 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... 17.42/7.67 [2019-03-28 12:17:32,389 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values 17.42/7.67 [2019-03-28 12:17:32,389 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values 17.42/7.67 [2019-03-28 12:17:32,391 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values 17.42/7.67 [2019-03-28 12:17:32,392 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values 17.42/7.67 [2019-03-28 12:17:32,394 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values 17.42/7.67 [2019-03-28 12:17:32,394 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values 17.42/7.67 [2019-03-28 12:17:32,395 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... 17.42/7.67 [2019-03-28 12:17:32,395 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values 17.42/7.67 [2019-03-28 12:17:32,396 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values 17.42/7.67 [2019-03-28 12:17:32,397 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values 17.42/7.67 [2019-03-28 12:17:32,398 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values 17.42/7.67 [2019-03-28 12:17:32,399 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values 17.42/7.67 [2019-03-28 12:17:32,400 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values 17.42/7.67 [2019-03-28 12:17:32,401 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values 17.42/7.67 [2019-03-28 12:17:32,403 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values 17.42/7.67 [2019-03-28 12:17:32,405 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values 17.42/7.67 [2019-03-28 12:17:32,406 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values 17.42/7.67 [2019-03-28 12:17:32,407 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values 17.42/7.67 [2019-03-28 12:17:32,409 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... 17.42/7.67 [2019-03-28 12:17:32,409 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... 17.42/7.67 [2019-03-28 12:17:32,409 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values 17.42/7.67 [2019-03-28 12:17:32,410 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values 17.42/7.67 [2019-03-28 12:17:32,411 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values 17.42/7.67 [2019-03-28 12:17:32,411 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... 17.42/7.67 [2019-03-28 12:17:32,412 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values 17.42/7.67 [2019-03-28 12:17:32,412 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values 17.42/7.67 [2019-03-28 12:17:32,413 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values 17.42/7.67 [2019-03-28 12:17:32,414 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values 17.42/7.67 [2019-03-28 12:17:32,415 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... 17.42/7.67 [2019-03-28 12:17:32,415 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values 17.42/7.67 [2019-03-28 12:17:32,416 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... 17.42/7.67 [2019-03-28 12:17:32,416 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... 17.42/7.67 [2019-03-28 12:17:32,416 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values 17.42/7.67 [2019-03-28 12:17:32,417 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values 17.42/7.67 [2019-03-28 12:17:32,418 INFO L181 SettingsManager]: Finished resetting all preferences to default values... 17.42/7.67 [2019-03-28 12:17:32,418 INFO L98 SettingsManager]: Beginning loading settings from /export/starexec/sandbox2/solver/bin/./../termcomp2017.epf 17.42/7.67 [2019-03-28 12:17:32,432 INFO L110 SettingsManager]: Loading preferences was successful 17.42/7.67 [2019-03-28 12:17:32,433 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: 17.42/7.67 [2019-03-28 12:17:32,434 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: 17.42/7.67 [2019-03-28 12:17:32,434 INFO L133 SettingsManager]: * Rewrite not-equals=true 17.42/7.67 [2019-03-28 12:17:32,434 INFO L133 SettingsManager]: * Create parallel compositions if possible=false 17.42/7.67 [2019-03-28 12:17:32,434 INFO L133 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE 17.42/7.67 [2019-03-28 12:17:32,434 INFO L133 SettingsManager]: * Use SBE=true 17.42/7.67 [2019-03-28 12:17:32,435 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: 17.42/7.67 [2019-03-28 12:17:32,435 INFO L133 SettingsManager]: * Use old map elimination=false 17.42/7.67 [2019-03-28 12:17:32,435 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false 17.42/7.67 [2019-03-28 12:17:32,435 INFO L133 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION 17.42/7.67 [2019-03-28 12:17:32,435 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true 17.42/7.67 [2019-03-28 12:17:32,435 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES 17.42/7.67 [2019-03-28 12:17:32,436 INFO L133 SettingsManager]: * Construct termination proof for TermComp=true 17.42/7.67 [2019-03-28 12:17:32,436 INFO L133 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 17.42/7.67 [2019-03-28 12:17:32,436 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: 17.42/7.67 [2019-03-28 12:17:32,436 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false 17.42/7.67 [2019-03-28 12:17:32,436 INFO L133 SettingsManager]: * Check division by zero=IGNORE 17.42/7.67 [2019-03-28 12:17:32,437 INFO L133 SettingsManager]: * Check if freed pointer was valid=false 17.42/7.67 [2019-03-28 12:17:32,437 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false 17.42/7.67 [2019-03-28 12:17:32,437 INFO L133 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE 17.42/7.67 [2019-03-28 12:17:32,437 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: 17.42/7.67 [2019-03-28 12:17:32,437 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements 17.42/7.67 [2019-03-28 12:17:32,437 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump 17.42/7.67 [2019-03-28 12:17:32,438 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 17.42/7.67 [2019-03-28 12:17:32,438 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: 17.42/7.67 [2019-03-28 12:17:32,438 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles 17.42/7.67 [2019-03-28 12:17:32,438 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL 17.42/7.67 [2019-03-28 12:17:32,438 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 17.42/7.67 [2019-03-28 12:17:32,465 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp 17.42/7.67 [2019-03-28 12:17:32,478 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized 17.42/7.67 [2019-03-28 12:17:32,481 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. 17.42/7.67 [2019-03-28 12:17:32,483 INFO L271 PluginConnector]: Initializing CDTParser... 17.42/7.67 [2019-03-28 12:17:32,483 INFO L276 PluginConnector]: CDTParser initialized 17.42/7.67 [2019-03-28 12:17:32,484 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox2/benchmark/theBenchmark.c 17.42/7.67 [2019-03-28 12:17:32,543 INFO L221 CDTParser]: Created temporary CDT project at /export/starexec/sandbox2/tmp/b625f95f3ba24b73ab74e9d577bf0e28/FLAGb44aa6f60 17.42/7.67 [2019-03-28 12:17:32,883 INFO L307 CDTParser]: Found 1 translation units. 17.42/7.67 [2019-03-28 12:17:32,884 INFO L161 CDTParser]: Scanning /export/starexec/sandbox2/benchmark/theBenchmark.c 17.42/7.67 [2019-03-28 12:17:32,890 INFO L355 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox2/tmp/b625f95f3ba24b73ab74e9d577bf0e28/FLAGb44aa6f60 17.42/7.67 [2019-03-28 12:17:33,301 INFO L363 CDTParser]: Successfully deleted /export/starexec/sandbox2/tmp/b625f95f3ba24b73ab74e9d577bf0e28 17.42/7.67 [2019-03-28 12:17:33,313 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### 17.42/7.67 [2019-03-28 12:17:33,315 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. 17.42/7.67 [2019-03-28 12:17:33,316 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- 17.42/7.67 [2019-03-28 12:17:33,316 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... 17.42/7.67 [2019-03-28 12:17:33,320 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized 17.42/7.67 [2019-03-28 12:17:33,321 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 12:17:33" (1/1) ... 17.42/7.67 [2019-03-28 12:17:33,324 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@242991db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:17:33, skipping insertion in model container 17.42/7.67 [2019-03-28 12:17:33,324 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 12:17:33" (1/1) ... 17.42/7.67 [2019-03-28 12:17:33,333 INFO L145 MainTranslator]: Starting translation in SV-COMP mode 17.42/7.67 [2019-03-28 12:17:33,350 INFO L176 MainTranslator]: Built tables and reachable declarations 17.42/7.67 [2019-03-28 12:17:33,511 INFO L206 PostProcessor]: Analyzing one entry point: main 17.42/7.67 [2019-03-28 12:17:33,516 INFO L191 MainTranslator]: Completed pre-run 17.42/7.67 [2019-03-28 12:17:33,533 INFO L206 PostProcessor]: Analyzing one entry point: main 17.42/7.67 [2019-03-28 12:17:33,548 INFO L195 MainTranslator]: Completed translation 17.42/7.67 [2019-03-28 12:17:33,549 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:17:33 WrapperNode 17.42/7.67 [2019-03-28 12:17:33,549 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- 17.42/7.67 [2019-03-28 12:17:33,550 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- 17.42/7.67 [2019-03-28 12:17:33,550 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... 17.42/7.67 [2019-03-28 12:17:33,550 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized 17.42/7.67 [2019-03-28 12:17:33,560 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:17:33" (1/1) ... 17.42/7.67 [2019-03-28 12:17:33,621 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:17:33" (1/1) ... 17.42/7.67 [2019-03-28 12:17:33,641 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- 17.42/7.67 [2019-03-28 12:17:33,642 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- 17.42/7.67 [2019-03-28 12:17:33,642 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... 17.42/7.67 [2019-03-28 12:17:33,642 INFO L276 PluginConnector]: Boogie Preprocessor initialized 17.42/7.67 [2019-03-28 12:17:33,652 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:17:33" (1/1) ... 17.42/7.67 [2019-03-28 12:17:33,652 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:17:33" (1/1) ... 17.42/7.67 [2019-03-28 12:17:33,652 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:17:33" (1/1) ... 17.42/7.67 [2019-03-28 12:17:33,653 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:17:33" (1/1) ... 17.42/7.67 [2019-03-28 12:17:33,654 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:17:33" (1/1) ... 17.42/7.67 [2019-03-28 12:17:33,659 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:17:33" (1/1) ... 17.42/7.67 [2019-03-28 12:17:33,660 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:17:33" (1/1) ... 17.42/7.67 [2019-03-28 12:17:33,661 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- 17.42/7.67 [2019-03-28 12:17:33,662 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- 17.42/7.67 [2019-03-28 12:17:33,662 INFO L271 PluginConnector]: Initializing RCFGBuilder... 17.42/7.67 [2019-03-28 12:17:33,662 INFO L276 PluginConnector]: RCFGBuilder initialized 17.42/7.67 [2019-03-28 12:17:33,663 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:17:33" (1/1) ... 17.42/7.67 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 17.42/7.67 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) 17.42/7.67 Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 17.42/7.67 [2019-03-28 12:17:33,724 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start 17.42/7.67 [2019-03-28 12:17:33,724 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start 17.42/7.67 [2019-03-28 12:17:33,853 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) 17.42/7.67 [2019-03-28 12:17:33,853 INFO L286 CfgBuilder]: Removed 6 assue(true) statements. 17.42/7.67 [2019-03-28 12:17:33,854 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:17:33 BoogieIcfgContainer 17.42/7.67 [2019-03-28 12:17:33,855 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- 17.42/7.67 [2019-03-28 12:17:33,855 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- 17.42/7.67 [2019-03-28 12:17:33,855 INFO L271 PluginConnector]: Initializing BlockEncodingV2... 17.42/7.67 [2019-03-28 12:17:33,857 INFO L276 PluginConnector]: BlockEncodingV2 initialized 17.42/7.67 [2019-03-28 12:17:33,858 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:17:33" (1/1) ... 17.42/7.67 [2019-03-28 12:17:33,872 INFO L313 BlockEncoder]: Initial Icfg 9 locations, 12 edges 17.42/7.67 [2019-03-28 12:17:33,874 INFO L258 BlockEncoder]: Using Remove infeasible edges 17.42/7.67 [2019-03-28 12:17:33,874 INFO L263 BlockEncoder]: Using Maximize final states 17.42/7.67 [2019-03-28 12:17:33,875 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false 17.42/7.67 [2019-03-28 12:17:33,875 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE 17.42/7.67 [2019-03-28 12:17:33,877 INFO L296 BlockEncoder]: Using Remove sink states 17.42/7.67 [2019-03-28 12:17:33,878 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true 17.42/7.67 [2019-03-28 12:17:33,878 INFO L179 BlockEncoder]: Using Rewrite not-equals 17.42/7.67 [2019-03-28 12:17:33,893 INFO L185 BlockEncoder]: Using Use SBE 17.42/7.67 [2019-03-28 12:17:33,901 INFO L200 BlockEncoder]: SBE split 0 edges 17.42/7.67 [2019-03-28 12:17:33,906 INFO L70 emoveInfeasibleEdges]: Removed 2 edges and 0 locations because of local infeasibility 17.42/7.67 [2019-03-28 12:17:33,908 INFO L71 MaximizeFinalStates]: 0 new accepting states 17.42/7.67 [2019-03-28 12:17:33,925 INFO L100 BaseMinimizeStates]: Removed 10 edges and 5 locations by large block encoding 17.42/7.67 [2019-03-28 12:17:33,928 INFO L70 RemoveSinkStates]: Removed 1 edges and 1 locations by removing sink states 17.42/7.67 [2019-03-28 12:17:33,929 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility 17.42/7.67 [2019-03-28 12:17:33,929 INFO L71 MaximizeFinalStates]: 0 new accepting states 17.42/7.67 [2019-03-28 12:17:33,930 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding 17.42/7.67 [2019-03-28 12:17:33,930 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states 17.42/7.67 [2019-03-28 12:17:33,930 INFO L313 BlockEncoder]: Encoded RCFG 3 locations, 4 edges 17.42/7.67 [2019-03-28 12:17:33,931 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:17:33 BasicIcfg 17.42/7.67 [2019-03-28 12:17:33,931 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- 17.42/7.67 [2019-03-28 12:17:33,932 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- 17.42/7.67 [2019-03-28 12:17:33,932 INFO L271 PluginConnector]: Initializing TraceAbstraction... 17.42/7.67 [2019-03-28 12:17:33,935 INFO L276 PluginConnector]: TraceAbstraction initialized 17.42/7.67 [2019-03-28 12:17:33,935 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.03 12:17:33" (1/4) ... 17.42/7.67 [2019-03-28 12:17:33,936 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ec7b82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 12:17:33, skipping insertion in model container 17.42/7.67 [2019-03-28 12:17:33,936 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:17:33" (2/4) ... 17.42/7.67 [2019-03-28 12:17:33,937 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ec7b82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 12:17:33, skipping insertion in model container 17.42/7.67 [2019-03-28 12:17:33,937 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:17:33" (3/4) ... 17.42/7.67 [2019-03-28 12:17:33,937 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ec7b82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:17:33, skipping insertion in model container 17.42/7.67 [2019-03-28 12:17:33,937 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:17:33" (4/4) ... 17.42/7.67 [2019-03-28 12:17:33,940 INFO L112 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 17.42/7.67 [2019-03-28 12:17:33,950 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION 17.42/7.67 [2019-03-28 12:17:33,957 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 0 error locations. 17.42/7.67 [2019-03-28 12:17:33,974 INFO L257 AbstractCegarLoop]: Starting to check reachability of 0 error locations. 17.42/7.67 [2019-03-28 12:17:34,006 INFO L133 ementStrategyFactory]: Using default assertion order modulation 17.42/7.67 [2019-03-28 12:17:34,007 INFO L382 AbstractCegarLoop]: Interprodecural is true 17.42/7.67 [2019-03-28 12:17:34,007 INFO L383 AbstractCegarLoop]: Hoare is true 17.42/7.67 [2019-03-28 12:17:34,007 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates 17.42/7.67 [2019-03-28 12:17:34,007 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE 17.42/7.67 [2019-03-28 12:17:34,007 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION 17.42/7.67 [2019-03-28 12:17:34,008 INFO L387 AbstractCegarLoop]: Difference is false 17.42/7.67 [2019-03-28 12:17:34,008 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA 17.42/7.67 [2019-03-28 12:17:34,008 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== 17.42/7.67 [2019-03-28 12:17:34,022 INFO L276 IsEmpty]: Start isEmpty. Operand 3 states. 17.42/7.67 [2019-03-28 12:17:34,028 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. 17.42/7.67 [2019-03-28 12:17:34,031 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 3 states. 17.42/7.67 [2019-03-28 12:17:34,082 INFO L451 ceAbstractionStarter]: At program point L4-3(lines 4 8) the Hoare annotation is: true 17.42/7.67 [2019-03-28 12:17:34,083 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. 17.42/7.67 [2019-03-28 12:17:34,083 INFO L451 ceAbstractionStarter]: At program point L5-3(lines 5 8) the Hoare annotation is: true 17.42/7.67 [2019-03-28 12:17:34,091 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:17:34 BasicIcfg 17.42/7.67 [2019-03-28 12:17:34,092 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- 17.42/7.67 [2019-03-28 12:17:34,092 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- 17.42/7.67 [2019-03-28 12:17:34,093 INFO L271 PluginConnector]: Initializing BuchiAutomizer... 17.42/7.67 [2019-03-28 12:17:34,096 INFO L276 PluginConnector]: BuchiAutomizer initialized 17.42/7.67 [2019-03-28 12:17:34,097 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 17.42/7.67 [2019-03-28 12:17:34,097 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.03 12:17:33" (1/5) ... 17.42/7.67 [2019-03-28 12:17:34,098 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5e745730 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.03 12:17:34, skipping insertion in model container 17.42/7.67 [2019-03-28 12:17:34,098 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 17.42/7.67 [2019-03-28 12:17:34,098 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:17:33" (2/5) ... 17.42/7.67 [2019-03-28 12:17:34,099 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5e745730 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.03 12:17:34, skipping insertion in model container 17.42/7.67 [2019-03-28 12:17:34,099 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 17.42/7.67 [2019-03-28 12:17:34,099 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:17:33" (3/5) ... 17.42/7.67 [2019-03-28 12:17:34,099 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5e745730 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:17:34, skipping insertion in model container 17.42/7.67 [2019-03-28 12:17:34,100 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 17.42/7.67 [2019-03-28 12:17:34,100 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:17:33" (4/5) ... 17.42/7.67 [2019-03-28 12:17:34,100 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5e745730 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:17:34, skipping insertion in model container 17.42/7.67 [2019-03-28 12:17:34,100 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 17.42/7.67 [2019-03-28 12:17:34,100 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:17:34" (5/5) ... 17.42/7.67 [2019-03-28 12:17:34,102 INFO L375 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 17.42/7.67 [2019-03-28 12:17:34,129 INFO L133 ementStrategyFactory]: Using default assertion order modulation 17.42/7.67 [2019-03-28 12:17:34,130 INFO L374 BuchiCegarLoop]: Interprodecural is true 17.42/7.67 [2019-03-28 12:17:34,130 INFO L375 BuchiCegarLoop]: Hoare is true 17.42/7.67 [2019-03-28 12:17:34,130 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates 17.42/7.67 [2019-03-28 12:17:34,130 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE 17.42/7.67 [2019-03-28 12:17:34,130 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION 17.42/7.67 [2019-03-28 12:17:34,131 INFO L379 BuchiCegarLoop]: Difference is false 17.42/7.67 [2019-03-28 12:17:34,131 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA 17.42/7.67 [2019-03-28 12:17:34,131 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== 17.42/7.67 [2019-03-28 12:17:34,134 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. 17.42/7.67 [2019-03-28 12:17:34,151 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 17.42/7.67 [2019-03-28 12:17:34,151 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 17.42/7.67 [2019-03-28 12:17:34,151 INFO L119 BuchiIsEmpty]: Starting construction of run 17.42/7.67 [2019-03-28 12:17:34,157 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] 17.42/7.67 [2019-03-28 12:17:34,157 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] 17.42/7.67 [2019-03-28 12:17:34,157 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ 17.42/7.67 [2019-03-28 12:17:34,157 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. 17.42/7.67 [2019-03-28 12:17:34,158 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 17.42/7.67 [2019-03-28 12:17:34,158 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 17.42/7.67 [2019-03-28 12:17:34,158 INFO L119 BuchiIsEmpty]: Starting construction of run 17.42/7.67 [2019-03-28 12:17:34,158 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] 17.42/7.67 [2019-03-28 12:17:34,158 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] 17.42/7.67 [2019-03-28 12:17:34,164 INFO L794 eck$LassoCheckResult]: Stem: 3#ULTIMATE.startENTRYtrue [31] ULTIMATE.startENTRY-->L4-3: Formula: (and (= v_ULTIMATE.start_main_~c~0_1 0) (= v_ULTIMATE.start_main_~i~0_1 0)) InVars {} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_1, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_1, ULTIMATE.start_main_#t~post0=|v_ULTIMATE.start_main_#t~post0_1|, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~i~0, ULTIMATE.start_main_#t~post0] 4#L4-3true 17.42/7.67 [2019-03-28 12:17:34,164 INFO L796 eck$LassoCheckResult]: Loop: 4#L4-3true [35] L4-3-->L5-3: Formula: (and (< v_ULTIMATE.start_main_~i~0_9 10) (= v_ULTIMATE.start_main_~j~0_8 3)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 5#L5-3true [47] L5-3-->L4-3: Formula: (and (<= 12 v_ULTIMATE.start_main_~j~0_13) (= (+ v_ULTIMATE.start_main_~i~0_12 1) v_ULTIMATE.start_main_~i~0_11)) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_13, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_13, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11, ULTIMATE.start_main_#t~post0=|v_ULTIMATE.start_main_#t~post0_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0, ULTIMATE.start_main_#t~post0] 4#L4-3true 17.42/7.67 [2019-03-28 12:17:34,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 17.42/7.67 [2019-03-28 12:17:34,171 INFO L82 PathProgramCache]: Analyzing trace with hash 62, now seen corresponding path program 1 times 17.42/7.67 [2019-03-28 12:17:34,173 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 17.42/7.67 [2019-03-28 12:17:34,173 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 17.42/7.67 [2019-03-28 12:17:34,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 17.42/7.67 [2019-03-28 12:17:34,194 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 17.42/7.67 [2019-03-28 12:17:34,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 17.42/7.67 [2019-03-28 12:17:34,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 17.42/7.67 [2019-03-28 12:17:34,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 17.42/7.67 [2019-03-28 12:17:34,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 17.42/7.67 [2019-03-28 12:17:34,239 INFO L82 PathProgramCache]: Analyzing trace with hash 2093, now seen corresponding path program 1 times 17.42/7.67 [2019-03-28 12:17:34,239 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 17.42/7.67 [2019-03-28 12:17:34,239 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 17.42/7.67 [2019-03-28 12:17:34,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 17.42/7.67 [2019-03-28 12:17:34,241 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 17.42/7.67 [2019-03-28 12:17:34,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 17.42/7.67 [2019-03-28 12:17:34,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 17.42/7.67 [2019-03-28 12:17:34,286 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 17.42/7.67 [2019-03-28 12:17:34,288 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 17.42/7.67 [2019-03-28 12:17:34,289 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 17.42/7.67 [2019-03-28 12:17:34,294 INFO L811 eck$LassoCheckResult]: loop already infeasible 17.42/7.67 [2019-03-28 12:17:34,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 17.42/7.67 [2019-03-28 12:17:34,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 17.42/7.67 [2019-03-28 12:17:34,312 INFO L87 Difference]: Start difference. First operand 3 states. Second operand 3 states. 17.42/7.67 [2019-03-28 12:17:34,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 17.42/7.67 [2019-03-28 12:17:34,330 INFO L93 Difference]: Finished difference Result 4 states and 5 transitions. 17.42/7.67 [2019-03-28 12:17:34,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 17.42/7.67 [2019-03-28 12:17:34,335 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 4 states and 5 transitions. 17.42/7.67 [2019-03-28 12:17:34,335 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 17.42/7.67 [2019-03-28 12:17:34,339 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 4 states to 4 states and 5 transitions. 17.42/7.67 [2019-03-28 12:17:34,340 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4 17.42/7.67 [2019-03-28 12:17:34,340 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4 17.42/7.67 [2019-03-28 12:17:34,341 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 5 transitions. 17.42/7.67 [2019-03-28 12:17:34,341 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 17.42/7.67 [2019-03-28 12:17:34,342 INFO L706 BuchiCegarLoop]: Abstraction has 4 states and 5 transitions. 17.42/7.67 [2019-03-28 12:17:34,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4 states and 5 transitions. 17.42/7.67 [2019-03-28 12:17:34,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4 to 4. 17.42/7.67 [2019-03-28 12:17:34,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. 17.42/7.67 [2019-03-28 12:17:34,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 5 transitions. 17.42/7.67 [2019-03-28 12:17:34,370 INFO L729 BuchiCegarLoop]: Abstraction has 4 states and 5 transitions. 17.42/7.67 [2019-03-28 12:17:34,370 INFO L609 BuchiCegarLoop]: Abstraction has 4 states and 5 transitions. 17.42/7.67 [2019-03-28 12:17:34,371 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ 17.42/7.67 [2019-03-28 12:17:34,371 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4 states and 5 transitions. 17.42/7.67 [2019-03-28 12:17:34,371 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 17.42/7.67 [2019-03-28 12:17:34,371 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 17.42/7.67 [2019-03-28 12:17:34,371 INFO L119 BuchiIsEmpty]: Starting construction of run 17.42/7.67 [2019-03-28 12:17:34,372 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] 17.42/7.67 [2019-03-28 12:17:34,372 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] 17.42/7.67 [2019-03-28 12:17:34,372 INFO L794 eck$LassoCheckResult]: Stem: 16#ULTIMATE.startENTRY [31] ULTIMATE.startENTRY-->L4-3: Formula: (and (= v_ULTIMATE.start_main_~c~0_1 0) (= v_ULTIMATE.start_main_~i~0_1 0)) InVars {} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_1, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_1, ULTIMATE.start_main_#t~post0=|v_ULTIMATE.start_main_#t~post0_1|, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~i~0, ULTIMATE.start_main_#t~post0] 17#L4-3 17.42/7.67 [2019-03-28 12:17:34,373 INFO L796 eck$LassoCheckResult]: Loop: 17#L4-3 [35] L4-3-->L5-3: Formula: (and (< v_ULTIMATE.start_main_~i~0_9 10) (= v_ULTIMATE.start_main_~j~0_8 3)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 18#L5-3 [46] L5-3-->L5-3: Formula: (and (= (+ v_ULTIMATE.start_main_~j~0_12 1) v_ULTIMATE.start_main_~j~0_10) (= (+ v_ULTIMATE.start_main_~c~0_9 1) v_ULTIMATE.start_main_~c~0_8) (< v_ULTIMATE.start_main_~j~0_12 12)) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_12, ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_9} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_10, ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0, ULTIMATE.start_main_~c~0] 19#L5-3 [47] L5-3-->L4-3: Formula: (and (<= 12 v_ULTIMATE.start_main_~j~0_13) (= (+ v_ULTIMATE.start_main_~i~0_12 1) v_ULTIMATE.start_main_~i~0_11)) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_13, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_13, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11, ULTIMATE.start_main_#t~post0=|v_ULTIMATE.start_main_#t~post0_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0, ULTIMATE.start_main_#t~post0] 17#L4-3 17.42/7.67 [2019-03-28 12:17:34,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 17.42/7.67 [2019-03-28 12:17:34,373 INFO L82 PathProgramCache]: Analyzing trace with hash 62, now seen corresponding path program 2 times 17.42/7.67 [2019-03-28 12:17:34,373 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 17.42/7.67 [2019-03-28 12:17:34,374 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 17.42/7.67 [2019-03-28 12:17:34,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 17.42/7.67 [2019-03-28 12:17:34,375 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 17.42/7.67 [2019-03-28 12:17:34,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 17.42/7.67 [2019-03-28 12:17:34,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 17.42/7.67 [2019-03-28 12:17:34,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 17.42/7.67 [2019-03-28 12:17:34,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 17.42/7.67 [2019-03-28 12:17:34,379 INFO L82 PathProgramCache]: Analyzing trace with hash 64899, now seen corresponding path program 1 times 17.42/7.67 [2019-03-28 12:17:34,379 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 17.42/7.67 [2019-03-28 12:17:34,380 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 17.42/7.67 [2019-03-28 12:17:34,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 17.42/7.67 [2019-03-28 12:17:34,381 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 17.42/7.67 [2019-03-28 12:17:34,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 17.42/7.67 [2019-03-28 12:17:34,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 17.42/7.67 [2019-03-28 12:17:34,404 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 17.42/7.67 [2019-03-28 12:17:34,404 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 17.42/7.67 [2019-03-28 12:17:34,404 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 17.42/7.67 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 17.42/7.67 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 17.42/7.67 Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 17.42/7.67 [2019-03-28 12:17:34,423 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 17.42/7.67 [2019-03-28 12:17:34,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 17.42/7.67 [2019-03-28 12:17:34,435 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 3 conjunts are in the unsatisfiable core 17.42/7.67 [2019-03-28 12:17:34,437 INFO L279 TraceCheckSpWp]: Computing forward predicates... 17.42/7.67 [2019-03-28 12:17:34,451 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 17.42/7.67 [2019-03-28 12:17:34,478 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 17.42/7.67 [2019-03-28 12:17:34,478 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2] total 2 17.42/7.67 [2019-03-28 12:17:34,479 INFO L811 eck$LassoCheckResult]: loop already infeasible 17.42/7.67 [2019-03-28 12:17:34,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. 17.42/7.67 [2019-03-28 12:17:34,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 17.42/7.67 [2019-03-28 12:17:34,480 INFO L87 Difference]: Start difference. First operand 4 states and 5 transitions. cyclomatic complexity: 2 Second operand 4 states. 17.42/7.67 [2019-03-28 12:17:34,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 17.42/7.67 [2019-03-28 12:17:34,503 INFO L93 Difference]: Finished difference Result 5 states and 6 transitions. 17.42/7.67 [2019-03-28 12:17:34,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 17.42/7.67 [2019-03-28 12:17:34,504 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 5 states and 6 transitions. 17.42/7.67 [2019-03-28 12:17:34,505 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 17.42/7.67 [2019-03-28 12:17:34,505 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 5 states to 5 states and 6 transitions. 17.42/7.67 [2019-03-28 12:17:34,505 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 17.42/7.67 [2019-03-28 12:17:34,505 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 17.42/7.67 [2019-03-28 12:17:34,506 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 6 transitions. 17.42/7.67 [2019-03-28 12:17:34,506 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 17.42/7.67 [2019-03-28 12:17:34,506 INFO L706 BuchiCegarLoop]: Abstraction has 5 states and 6 transitions. 17.42/7.67 [2019-03-28 12:17:34,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states and 6 transitions. 17.42/7.67 [2019-03-28 12:17:34,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. 17.42/7.67 [2019-03-28 12:17:34,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. 17.42/7.67 [2019-03-28 12:17:34,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 6 transitions. 17.42/7.67 [2019-03-28 12:17:34,507 INFO L729 BuchiCegarLoop]: Abstraction has 5 states and 6 transitions. 17.42/7.67 [2019-03-28 12:17:34,508 INFO L609 BuchiCegarLoop]: Abstraction has 5 states and 6 transitions. 17.42/7.67 [2019-03-28 12:17:34,508 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ 17.42/7.67 [2019-03-28 12:17:34,508 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5 states and 6 transitions. 17.42/7.67 [2019-03-28 12:17:34,508 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 17.42/7.67 [2019-03-28 12:17:34,508 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 17.42/7.67 [2019-03-28 12:17:34,509 INFO L119 BuchiIsEmpty]: Starting construction of run 17.42/7.67 [2019-03-28 12:17:34,509 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] 17.42/7.67 [2019-03-28 12:17:34,509 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1] 17.42/7.67 [2019-03-28 12:17:34,509 INFO L794 eck$LassoCheckResult]: Stem: 38#ULTIMATE.startENTRY [31] ULTIMATE.startENTRY-->L4-3: Formula: (and (= v_ULTIMATE.start_main_~c~0_1 0) (= v_ULTIMATE.start_main_~i~0_1 0)) InVars {} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_1, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_1, ULTIMATE.start_main_#t~post0=|v_ULTIMATE.start_main_#t~post0_1|, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~i~0, ULTIMATE.start_main_#t~post0] 39#L4-3 17.42/7.67 [2019-03-28 12:17:34,510 INFO L796 eck$LassoCheckResult]: Loop: 39#L4-3 [35] L4-3-->L5-3: Formula: (and (< v_ULTIMATE.start_main_~i~0_9 10) (= v_ULTIMATE.start_main_~j~0_8 3)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 40#L5-3 [46] L5-3-->L5-3: Formula: (and (= (+ v_ULTIMATE.start_main_~j~0_12 1) v_ULTIMATE.start_main_~j~0_10) (= (+ v_ULTIMATE.start_main_~c~0_9 1) v_ULTIMATE.start_main_~c~0_8) (< v_ULTIMATE.start_main_~j~0_12 12)) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_12, ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_9} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_10, ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0, ULTIMATE.start_main_~c~0] 41#L5-3 [46] L5-3-->L5-3: Formula: (and (= (+ v_ULTIMATE.start_main_~j~0_12 1) v_ULTIMATE.start_main_~j~0_10) (= (+ v_ULTIMATE.start_main_~c~0_9 1) v_ULTIMATE.start_main_~c~0_8) (< v_ULTIMATE.start_main_~j~0_12 12)) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_12, ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_9} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_10, ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0, ULTIMATE.start_main_~c~0] 42#L5-3 [47] L5-3-->L4-3: Formula: (and (<= 12 v_ULTIMATE.start_main_~j~0_13) (= (+ v_ULTIMATE.start_main_~i~0_12 1) v_ULTIMATE.start_main_~i~0_11)) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_13, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_13, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11, ULTIMATE.start_main_#t~post0=|v_ULTIMATE.start_main_#t~post0_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0, ULTIMATE.start_main_#t~post0] 39#L4-3 17.42/7.67 [2019-03-28 12:17:34,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 17.42/7.67 [2019-03-28 12:17:34,510 INFO L82 PathProgramCache]: Analyzing trace with hash 62, now seen corresponding path program 3 times 17.42/7.67 [2019-03-28 12:17:34,511 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 17.42/7.67 [2019-03-28 12:17:34,511 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 17.42/7.67 [2019-03-28 12:17:34,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 17.42/7.67 [2019-03-28 12:17:34,512 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 17.42/7.67 [2019-03-28 12:17:34,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 17.42/7.67 [2019-03-28 12:17:34,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 17.42/7.67 [2019-03-28 12:17:34,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 17.42/7.67 [2019-03-28 12:17:34,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 17.42/7.67 [2019-03-28 12:17:34,517 INFO L82 PathProgramCache]: Analyzing trace with hash 2011885, now seen corresponding path program 2 times 17.42/7.67 [2019-03-28 12:17:34,517 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 17.42/7.67 [2019-03-28 12:17:34,517 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 17.42/7.67 [2019-03-28 12:17:34,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 17.42/7.67 [2019-03-28 12:17:34,518 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 17.42/7.67 [2019-03-28 12:17:34,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 17.42/7.67 [2019-03-28 12:17:34,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 17.42/7.67 [2019-03-28 12:17:34,547 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 17.42/7.67 [2019-03-28 12:17:34,548 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 17.42/7.67 [2019-03-28 12:17:34,548 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 17.42/7.67 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 17.42/7.67 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 17.42/7.67 Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 17.42/7.67 [2019-03-28 12:17:34,559 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 17.42/7.67 [2019-03-28 12:17:34,568 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) 17.42/7.67 [2019-03-28 12:17:34,568 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat 17.42/7.67 [2019-03-28 12:17:34,569 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 4 conjunts are in the unsatisfiable core 17.42/7.67 [2019-03-28 12:17:34,569 INFO L279 TraceCheckSpWp]: Computing forward predicates... 17.42/7.67 [2019-03-28 12:17:34,573 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 17.42/7.67 [2019-03-28 12:17:34,598 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 17.42/7.67 [2019-03-28 12:17:34,599 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 3 17.42/7.67 [2019-03-28 12:17:34,599 INFO L811 eck$LassoCheckResult]: loop already infeasible 17.42/7.67 [2019-03-28 12:17:34,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. 17.42/7.67 [2019-03-28 12:17:34,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 17.42/7.67 [2019-03-28 12:17:34,600 INFO L87 Difference]: Start difference. First operand 5 states and 6 transitions. cyclomatic complexity: 2 Second operand 5 states. 17.42/7.67 [2019-03-28 12:17:34,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 17.42/7.67 [2019-03-28 12:17:34,627 INFO L93 Difference]: Finished difference Result 6 states and 7 transitions. 17.42/7.67 [2019-03-28 12:17:34,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 17.42/7.67 [2019-03-28 12:17:34,627 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 6 states and 7 transitions. 17.42/7.67 [2019-03-28 12:17:34,628 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 17.42/7.67 [2019-03-28 12:17:34,629 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 6 states to 6 states and 7 transitions. 17.42/7.67 [2019-03-28 12:17:34,629 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 17.42/7.67 [2019-03-28 12:17:34,629 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 17.42/7.67 [2019-03-28 12:17:34,629 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 7 transitions. 17.42/7.67 [2019-03-28 12:17:34,629 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 17.42/7.67 [2019-03-28 12:17:34,629 INFO L706 BuchiCegarLoop]: Abstraction has 6 states and 7 transitions. 17.42/7.67 [2019-03-28 12:17:34,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states and 7 transitions. 17.42/7.67 [2019-03-28 12:17:34,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. 17.42/7.67 [2019-03-28 12:17:34,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. 17.42/7.67 [2019-03-28 12:17:34,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 7 transitions. 17.42/7.67 [2019-03-28 12:17:34,631 INFO L729 BuchiCegarLoop]: Abstraction has 6 states and 7 transitions. 17.42/7.67 [2019-03-28 12:17:34,631 INFO L609 BuchiCegarLoop]: Abstraction has 6 states and 7 transitions. 17.42/7.67 [2019-03-28 12:17:34,631 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ 17.42/7.67 [2019-03-28 12:17:34,632 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6 states and 7 transitions. 17.42/7.67 [2019-03-28 12:17:34,632 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 17.42/7.67 [2019-03-28 12:17:34,632 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 17.42/7.67 [2019-03-28 12:17:34,632 INFO L119 BuchiIsEmpty]: Starting construction of run 17.42/7.67 [2019-03-28 12:17:34,633 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] 17.42/7.67 [2019-03-28 12:17:34,633 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [3, 1, 1] 17.42/7.67 [2019-03-28 12:17:34,633 INFO L794 eck$LassoCheckResult]: Stem: 66#ULTIMATE.startENTRY [31] ULTIMATE.startENTRY-->L4-3: Formula: (and (= v_ULTIMATE.start_main_~c~0_1 0) (= v_ULTIMATE.start_main_~i~0_1 0)) InVars {} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_1, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_1, ULTIMATE.start_main_#t~post0=|v_ULTIMATE.start_main_#t~post0_1|, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~i~0, ULTIMATE.start_main_#t~post0] 67#L4-3 17.42/7.67 [2019-03-28 12:17:34,634 INFO L796 eck$LassoCheckResult]: Loop: 67#L4-3 [35] L4-3-->L5-3: Formula: (and (< v_ULTIMATE.start_main_~i~0_9 10) (= v_ULTIMATE.start_main_~j~0_8 3)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 68#L5-3 [46] L5-3-->L5-3: Formula: (and (= (+ v_ULTIMATE.start_main_~j~0_12 1) v_ULTIMATE.start_main_~j~0_10) (= (+ v_ULTIMATE.start_main_~c~0_9 1) v_ULTIMATE.start_main_~c~0_8) (< v_ULTIMATE.start_main_~j~0_12 12)) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_12, ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_9} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_10, ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0, ULTIMATE.start_main_~c~0] 69#L5-3 [46] L5-3-->L5-3: Formula: (and (= (+ v_ULTIMATE.start_main_~j~0_12 1) v_ULTIMATE.start_main_~j~0_10) (= (+ v_ULTIMATE.start_main_~c~0_9 1) v_ULTIMATE.start_main_~c~0_8) (< v_ULTIMATE.start_main_~j~0_12 12)) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_12, ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_9} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_10, ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0, ULTIMATE.start_main_~c~0] 71#L5-3 [46] L5-3-->L5-3: Formula: (and (= (+ v_ULTIMATE.start_main_~j~0_12 1) v_ULTIMATE.start_main_~j~0_10) (= (+ v_ULTIMATE.start_main_~c~0_9 1) v_ULTIMATE.start_main_~c~0_8) (< v_ULTIMATE.start_main_~j~0_12 12)) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_12, ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_9} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_10, ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0, ULTIMATE.start_main_~c~0] 70#L5-3 [47] L5-3-->L4-3: Formula: (and (<= 12 v_ULTIMATE.start_main_~j~0_13) (= (+ v_ULTIMATE.start_main_~i~0_12 1) v_ULTIMATE.start_main_~i~0_11)) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_13, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_13, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11, ULTIMATE.start_main_#t~post0=|v_ULTIMATE.start_main_#t~post0_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0, ULTIMATE.start_main_#t~post0] 67#L4-3 17.42/7.67 [2019-03-28 12:17:34,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 17.42/7.67 [2019-03-28 12:17:34,634 INFO L82 PathProgramCache]: Analyzing trace with hash 62, now seen corresponding path program 4 times 17.42/7.67 [2019-03-28 12:17:34,634 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 17.42/7.67 [2019-03-28 12:17:34,634 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 17.42/7.67 [2019-03-28 12:17:34,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 17.42/7.67 [2019-03-28 12:17:34,636 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 17.42/7.67 [2019-03-28 12:17:34,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 17.42/7.67 [2019-03-28 12:17:34,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 17.42/7.67 [2019-03-28 12:17:34,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 17.42/7.67 [2019-03-28 12:17:34,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 17.42/7.67 [2019-03-28 12:17:34,640 INFO L82 PathProgramCache]: Analyzing trace with hash 62368451, now seen corresponding path program 3 times 17.42/7.67 [2019-03-28 12:17:34,640 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 17.42/7.67 [2019-03-28 12:17:34,640 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 17.42/7.67 [2019-03-28 12:17:34,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 17.42/7.67 [2019-03-28 12:17:34,641 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 17.42/7.67 [2019-03-28 12:17:34,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 17.42/7.67 [2019-03-28 12:17:34,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 17.42/7.67 [2019-03-28 12:17:34,700 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 17.42/7.67 [2019-03-28 12:17:34,700 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 17.42/7.67 [2019-03-28 12:17:34,700 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 17.42/7.67 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 17.42/7.67 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 17.42/7.67 Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 17.42/7.67 [2019-03-28 12:17:34,716 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 17.42/7.67 [2019-03-28 12:17:34,732 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) 17.42/7.67 [2019-03-28 12:17:34,732 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat 17.42/7.67 [2019-03-28 12:17:34,733 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 5 conjunts are in the unsatisfiable core 17.42/7.67 [2019-03-28 12:17:34,734 INFO L279 TraceCheckSpWp]: Computing forward predicates... 17.42/7.67 [2019-03-28 12:17:34,738 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 17.42/7.67 [2019-03-28 12:17:34,764 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 17.42/7.67 [2019-03-28 12:17:34,765 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 17.42/7.67 [2019-03-28 12:17:34,765 INFO L811 eck$LassoCheckResult]: loop already infeasible 17.42/7.67 [2019-03-28 12:17:34,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. 17.42/7.67 [2019-03-28 12:17:34,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 17.42/7.67 [2019-03-28 12:17:34,766 INFO L87 Difference]: Start difference. First operand 6 states and 7 transitions. cyclomatic complexity: 2 Second operand 6 states. 17.42/7.67 [2019-03-28 12:17:34,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 17.42/7.67 [2019-03-28 12:17:34,780 INFO L93 Difference]: Finished difference Result 7 states and 8 transitions. 17.42/7.68 [2019-03-28 12:17:34,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 17.42/7.68 [2019-03-28 12:17:34,781 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 7 states and 8 transitions. 17.42/7.68 [2019-03-28 12:17:34,782 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 17.42/7.68 [2019-03-28 12:17:34,782 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 7 states to 7 states and 8 transitions. 17.42/7.68 [2019-03-28 12:17:34,782 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 17.42/7.68 [2019-03-28 12:17:34,782 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 17.42/7.68 [2019-03-28 12:17:34,783 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 8 transitions. 17.42/7.68 [2019-03-28 12:17:34,783 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 17.42/7.68 [2019-03-28 12:17:34,783 INFO L706 BuchiCegarLoop]: Abstraction has 7 states and 8 transitions. 17.42/7.68 [2019-03-28 12:17:34,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states and 8 transitions. 17.42/7.68 [2019-03-28 12:17:34,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. 17.42/7.68 [2019-03-28 12:17:34,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. 17.42/7.68 [2019-03-28 12:17:34,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 8 transitions. 17.42/7.68 [2019-03-28 12:17:34,785 INFO L729 BuchiCegarLoop]: Abstraction has 7 states and 8 transitions. 17.42/7.68 [2019-03-28 12:17:34,785 INFO L609 BuchiCegarLoop]: Abstraction has 7 states and 8 transitions. 17.42/7.68 [2019-03-28 12:17:34,785 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ 17.42/7.68 [2019-03-28 12:17:34,785 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 8 transitions. 17.42/7.68 [2019-03-28 12:17:34,785 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 17.42/7.68 [2019-03-28 12:17:34,786 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 17.42/7.68 [2019-03-28 12:17:34,786 INFO L119 BuchiIsEmpty]: Starting construction of run 17.42/7.68 [2019-03-28 12:17:34,786 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] 17.42/7.68 [2019-03-28 12:17:34,786 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [4, 1, 1] 17.42/7.68 [2019-03-28 12:17:34,786 INFO L794 eck$LassoCheckResult]: Stem: 100#ULTIMATE.startENTRY [31] ULTIMATE.startENTRY-->L4-3: Formula: (and (= v_ULTIMATE.start_main_~c~0_1 0) (= v_ULTIMATE.start_main_~i~0_1 0)) InVars {} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_1, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_1, ULTIMATE.start_main_#t~post0=|v_ULTIMATE.start_main_#t~post0_1|, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~i~0, ULTIMATE.start_main_#t~post0] 101#L4-3 17.42/7.68 [2019-03-28 12:17:34,787 INFO L796 eck$LassoCheckResult]: Loop: 101#L4-3 [35] L4-3-->L5-3: Formula: (and (< v_ULTIMATE.start_main_~i~0_9 10) (= v_ULTIMATE.start_main_~j~0_8 3)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 102#L5-3 [46] L5-3-->L5-3: Formula: (and (= (+ v_ULTIMATE.start_main_~j~0_12 1) v_ULTIMATE.start_main_~j~0_10) (= (+ v_ULTIMATE.start_main_~c~0_9 1) v_ULTIMATE.start_main_~c~0_8) (< v_ULTIMATE.start_main_~j~0_12 12)) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_12, ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_9} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_10, ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0, ULTIMATE.start_main_~c~0] 103#L5-3 [46] L5-3-->L5-3: Formula: (and (= (+ v_ULTIMATE.start_main_~j~0_12 1) v_ULTIMATE.start_main_~j~0_10) (= (+ v_ULTIMATE.start_main_~c~0_9 1) v_ULTIMATE.start_main_~c~0_8) (< v_ULTIMATE.start_main_~j~0_12 12)) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_12, ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_9} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_10, ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0, ULTIMATE.start_main_~c~0] 106#L5-3 [46] L5-3-->L5-3: Formula: (and (= (+ v_ULTIMATE.start_main_~j~0_12 1) v_ULTIMATE.start_main_~j~0_10) (= (+ v_ULTIMATE.start_main_~c~0_9 1) v_ULTIMATE.start_main_~c~0_8) (< v_ULTIMATE.start_main_~j~0_12 12)) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_12, ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_9} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_10, ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0, ULTIMATE.start_main_~c~0] 105#L5-3 [46] L5-3-->L5-3: Formula: (and (= (+ v_ULTIMATE.start_main_~j~0_12 1) v_ULTIMATE.start_main_~j~0_10) (= (+ v_ULTIMATE.start_main_~c~0_9 1) v_ULTIMATE.start_main_~c~0_8) (< v_ULTIMATE.start_main_~j~0_12 12)) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_12, ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_9} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_10, ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0, ULTIMATE.start_main_~c~0] 104#L5-3 [47] L5-3-->L4-3: Formula: (and (<= 12 v_ULTIMATE.start_main_~j~0_13) (= (+ v_ULTIMATE.start_main_~i~0_12 1) v_ULTIMATE.start_main_~i~0_11)) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_13, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_13, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11, ULTIMATE.start_main_#t~post0=|v_ULTIMATE.start_main_#t~post0_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0, ULTIMATE.start_main_#t~post0] 101#L4-3 17.42/7.68 [2019-03-28 12:17:34,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 17.42/7.68 [2019-03-28 12:17:34,788 INFO L82 PathProgramCache]: Analyzing trace with hash 62, now seen corresponding path program 5 times 17.42/7.68 [2019-03-28 12:17:34,788 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 17.42/7.68 [2019-03-28 12:17:34,788 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 17.42/7.68 [2019-03-28 12:17:34,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 17.42/7.68 [2019-03-28 12:17:34,789 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 17.42/7.68 [2019-03-28 12:17:34,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 17.42/7.68 [2019-03-28 12:17:34,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 17.42/7.68 [2019-03-28 12:17:34,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 17.48/7.68 [2019-03-28 12:17:34,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 17.48/7.68 [2019-03-28 12:17:34,793 INFO L82 PathProgramCache]: Analyzing trace with hash 1933421997, now seen corresponding path program 4 times 17.48/7.68 [2019-03-28 12:17:34,793 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 17.48/7.68 [2019-03-28 12:17:34,794 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 17.48/7.68 [2019-03-28 12:17:34,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 17.48/7.68 [2019-03-28 12:17:34,795 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 17.48/7.68 [2019-03-28 12:17:34,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 17.48/7.68 [2019-03-28 12:17:34,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 17.48/7.68 [2019-03-28 12:17:34,850 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 17.48/7.68 [2019-03-28 12:17:34,850 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 17.48/7.68 [2019-03-28 12:17:34,850 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 17.48/7.68 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 17.48/7.68 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 17.48/7.68 Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 17.48/7.68 [2019-03-28 12:17:34,865 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST 17.48/7.68 [2019-03-28 12:17:34,879 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) 17.48/7.68 [2019-03-28 12:17:34,879 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat 17.48/7.68 [2019-03-28 12:17:34,880 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 6 conjunts are in the unsatisfiable core 17.48/7.68 [2019-03-28 12:17:34,881 INFO L279 TraceCheckSpWp]: Computing forward predicates... 17.48/7.68 [2019-03-28 12:17:34,886 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 17.48/7.68 [2019-03-28 12:17:34,912 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 17.48/7.68 [2019-03-28 12:17:34,913 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 17.48/7.68 [2019-03-28 12:17:34,913 INFO L811 eck$LassoCheckResult]: loop already infeasible 17.48/7.68 [2019-03-28 12:17:34,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. 17.48/7.68 [2019-03-28 12:17:34,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 17.48/7.68 [2019-03-28 12:17:34,914 INFO L87 Difference]: Start difference. First operand 7 states and 8 transitions. cyclomatic complexity: 2 Second operand 7 states. 17.48/7.68 [2019-03-28 12:17:34,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 17.48/7.68 [2019-03-28 12:17:34,936 INFO L93 Difference]: Finished difference Result 8 states and 9 transitions. 17.48/7.68 [2019-03-28 12:17:34,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 17.48/7.68 [2019-03-28 12:17:34,937 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 8 states and 9 transitions. 17.48/7.68 [2019-03-28 12:17:34,938 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 17.48/7.68 [2019-03-28 12:17:34,938 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 8 states to 8 states and 9 transitions. 17.48/7.68 [2019-03-28 12:17:34,938 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 17.48/7.68 [2019-03-28 12:17:34,938 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 17.48/7.68 [2019-03-28 12:17:34,938 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 9 transitions. 17.48/7.68 [2019-03-28 12:17:34,939 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 17.48/7.68 [2019-03-28 12:17:34,939 INFO L706 BuchiCegarLoop]: Abstraction has 8 states and 9 transitions. 17.48/7.68 [2019-03-28 12:17:34,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states and 9 transitions. 17.48/7.68 [2019-03-28 12:17:34,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. 17.48/7.68 [2019-03-28 12:17:34,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. 17.48/7.68 [2019-03-28 12:17:34,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 9 transitions. 17.48/7.68 [2019-03-28 12:17:34,940 INFO L729 BuchiCegarLoop]: Abstraction has 8 states and 9 transitions. 17.48/7.68 [2019-03-28 12:17:34,941 INFO L609 BuchiCegarLoop]: Abstraction has 8 states and 9 transitions. 17.48/7.68 [2019-03-28 12:17:34,941 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ 17.48/7.68 [2019-03-28 12:17:34,941 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 9 transitions. 17.48/7.68 [2019-03-28 12:17:34,941 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 17.48/7.68 [2019-03-28 12:17:34,941 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 17.48/7.68 [2019-03-28 12:17:34,942 INFO L119 BuchiIsEmpty]: Starting construction of run 17.48/7.68 [2019-03-28 12:17:34,942 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] 17.48/7.68 [2019-03-28 12:17:34,942 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [5, 1, 1] 17.48/7.68 [2019-03-28 12:17:34,942 INFO L794 eck$LassoCheckResult]: Stem: 140#ULTIMATE.startENTRY [31] ULTIMATE.startENTRY-->L4-3: Formula: (and (= v_ULTIMATE.start_main_~c~0_1 0) (= v_ULTIMATE.start_main_~i~0_1 0)) InVars {} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_1, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_1, ULTIMATE.start_main_#t~post0=|v_ULTIMATE.start_main_#t~post0_1|, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~i~0, ULTIMATE.start_main_#t~post0] 141#L4-3 17.48/7.68 [2019-03-28 12:17:34,943 INFO L796 eck$LassoCheckResult]: Loop: 141#L4-3 [35] L4-3-->L5-3: Formula: (and (< v_ULTIMATE.start_main_~i~0_9 10) (= v_ULTIMATE.start_main_~j~0_8 3)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 142#L5-3 [46] L5-3-->L5-3: Formula: (and (= (+ v_ULTIMATE.start_main_~j~0_12 1) v_ULTIMATE.start_main_~j~0_10) (= (+ v_ULTIMATE.start_main_~c~0_9 1) v_ULTIMATE.start_main_~c~0_8) (< v_ULTIMATE.start_main_~j~0_12 12)) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_12, ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_9} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_10, ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0, ULTIMATE.start_main_~c~0] 143#L5-3 [46] L5-3-->L5-3: Formula: (and (= (+ v_ULTIMATE.start_main_~j~0_12 1) v_ULTIMATE.start_main_~j~0_10) (= (+ v_ULTIMATE.start_main_~c~0_9 1) v_ULTIMATE.start_main_~c~0_8) (< v_ULTIMATE.start_main_~j~0_12 12)) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_12, ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_9} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_10, ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0, ULTIMATE.start_main_~c~0] 147#L5-3 [46] L5-3-->L5-3: Formula: (and (= (+ v_ULTIMATE.start_main_~j~0_12 1) v_ULTIMATE.start_main_~j~0_10) (= (+ v_ULTIMATE.start_main_~c~0_9 1) v_ULTIMATE.start_main_~c~0_8) (< v_ULTIMATE.start_main_~j~0_12 12)) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_12, ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_9} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_10, ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0, ULTIMATE.start_main_~c~0] 146#L5-3 [46] L5-3-->L5-3: Formula: (and (= (+ v_ULTIMATE.start_main_~j~0_12 1) v_ULTIMATE.start_main_~j~0_10) (= (+ v_ULTIMATE.start_main_~c~0_9 1) v_ULTIMATE.start_main_~c~0_8) (< v_ULTIMATE.start_main_~j~0_12 12)) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_12, ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_9} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_10, ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0, ULTIMATE.start_main_~c~0] 145#L5-3 [46] L5-3-->L5-3: Formula: (and (= (+ v_ULTIMATE.start_main_~j~0_12 1) v_ULTIMATE.start_main_~j~0_10) (= (+ v_ULTIMATE.start_main_~c~0_9 1) v_ULTIMATE.start_main_~c~0_8) (< v_ULTIMATE.start_main_~j~0_12 12)) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_12, ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_9} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_10, ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0, ULTIMATE.start_main_~c~0] 144#L5-3 [47] L5-3-->L4-3: Formula: (and (<= 12 v_ULTIMATE.start_main_~j~0_13) (= (+ v_ULTIMATE.start_main_~i~0_12 1) v_ULTIMATE.start_main_~i~0_11)) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_13, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_13, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11, ULTIMATE.start_main_#t~post0=|v_ULTIMATE.start_main_#t~post0_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0, ULTIMATE.start_main_#t~post0] 141#L4-3 17.48/7.68 [2019-03-28 12:17:34,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 17.48/7.68 [2019-03-28 12:17:34,943 INFO L82 PathProgramCache]: Analyzing trace with hash 62, now seen corresponding path program 6 times 17.48/7.68 [2019-03-28 12:17:34,944 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 17.48/7.68 [2019-03-28 12:17:34,944 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 17.48/7.68 [2019-03-28 12:17:34,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 17.48/7.68 [2019-03-28 12:17:34,945 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 17.48/7.68 [2019-03-28 12:17:34,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 17.48/7.68 [2019-03-28 12:17:34,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 17.48/7.68 [2019-03-28 12:17:34,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 17.48/7.68 [2019-03-28 12:17:34,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 17.48/7.68 [2019-03-28 12:17:34,948 INFO L82 PathProgramCache]: Analyzing trace with hash -193460221, now seen corresponding path program 5 times 17.48/7.68 [2019-03-28 12:17:34,949 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 17.48/7.68 [2019-03-28 12:17:34,949 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 17.48/7.68 [2019-03-28 12:17:34,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 17.48/7.68 [2019-03-28 12:17:34,950 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 17.48/7.68 [2019-03-28 12:17:34,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 17.48/7.68 [2019-03-28 12:17:34,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 17.48/7.68 [2019-03-28 12:17:35,014 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 17.48/7.68 [2019-03-28 12:17:35,014 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 17.48/7.68 [2019-03-28 12:17:35,014 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 17.48/7.68 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 17.48/7.68 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 17.48/7.68 Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 17.48/7.68 [2019-03-28 12:17:35,025 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 17.48/7.68 [2019-03-28 12:17:35,037 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) 17.48/7.68 [2019-03-28 12:17:35,037 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat 17.48/7.68 [2019-03-28 12:17:35,038 INFO L256 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 7 conjunts are in the unsatisfiable core 17.48/7.68 [2019-03-28 12:17:35,039 INFO L279 TraceCheckSpWp]: Computing forward predicates... 17.48/7.68 [2019-03-28 12:17:35,044 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 17.48/7.68 [2019-03-28 12:17:35,070 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 17.48/7.68 [2019-03-28 12:17:35,070 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 17.48/7.68 [2019-03-28 12:17:35,071 INFO L811 eck$LassoCheckResult]: loop already infeasible 17.48/7.68 [2019-03-28 12:17:35,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. 17.48/7.68 [2019-03-28 12:17:35,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 17.48/7.68 [2019-03-28 12:17:35,072 INFO L87 Difference]: Start difference. First operand 8 states and 9 transitions. cyclomatic complexity: 2 Second operand 8 states. 17.48/7.68 [2019-03-28 12:17:35,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 17.48/7.68 [2019-03-28 12:17:35,093 INFO L93 Difference]: Finished difference Result 9 states and 10 transitions. 17.48/7.68 [2019-03-28 12:17:35,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 17.48/7.68 [2019-03-28 12:17:35,094 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 9 states and 10 transitions. 17.48/7.68 [2019-03-28 12:17:35,094 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 17.48/7.68 [2019-03-28 12:17:35,095 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 9 states to 9 states and 10 transitions. 17.48/7.68 [2019-03-28 12:17:35,095 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 17.48/7.68 [2019-03-28 12:17:35,095 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 17.48/7.68 [2019-03-28 12:17:35,095 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 10 transitions. 17.48/7.68 [2019-03-28 12:17:35,096 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 17.48/7.68 [2019-03-28 12:17:35,096 INFO L706 BuchiCegarLoop]: Abstraction has 9 states and 10 transitions. 17.48/7.68 [2019-03-28 12:17:35,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 10 transitions. 17.48/7.68 [2019-03-28 12:17:35,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. 17.48/7.68 [2019-03-28 12:17:35,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. 17.48/7.68 [2019-03-28 12:17:35,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. 17.48/7.68 [2019-03-28 12:17:35,097 INFO L729 BuchiCegarLoop]: Abstraction has 9 states and 10 transitions. 17.48/7.68 [2019-03-28 12:17:35,098 INFO L609 BuchiCegarLoop]: Abstraction has 9 states and 10 transitions. 17.48/7.68 [2019-03-28 12:17:35,098 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ 17.48/7.68 [2019-03-28 12:17:35,098 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 10 transitions. 17.48/7.68 [2019-03-28 12:17:35,098 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 17.48/7.68 [2019-03-28 12:17:35,098 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 17.48/7.68 [2019-03-28 12:17:35,099 INFO L119 BuchiIsEmpty]: Starting construction of run 17.48/7.68 [2019-03-28 12:17:35,099 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] 17.48/7.68 [2019-03-28 12:17:35,099 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [6, 1, 1] 17.48/7.68 [2019-03-28 12:17:35,099 INFO L794 eck$LassoCheckResult]: Stem: 186#ULTIMATE.startENTRY [31] ULTIMATE.startENTRY-->L4-3: Formula: (and (= v_ULTIMATE.start_main_~c~0_1 0) (= v_ULTIMATE.start_main_~i~0_1 0)) InVars {} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_1, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_1, ULTIMATE.start_main_#t~post0=|v_ULTIMATE.start_main_#t~post0_1|, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~i~0, ULTIMATE.start_main_#t~post0] 187#L4-3 17.48/7.68 [2019-03-28 12:17:35,100 INFO L796 eck$LassoCheckResult]: Loop: 187#L4-3 [35] L4-3-->L5-3: Formula: (and (< v_ULTIMATE.start_main_~i~0_9 10) (= v_ULTIMATE.start_main_~j~0_8 3)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 188#L5-3 [46] L5-3-->L5-3: Formula: (and (= (+ v_ULTIMATE.start_main_~j~0_12 1) v_ULTIMATE.start_main_~j~0_10) (= (+ v_ULTIMATE.start_main_~c~0_9 1) v_ULTIMATE.start_main_~c~0_8) (< v_ULTIMATE.start_main_~j~0_12 12)) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_12, ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_9} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_10, ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0, ULTIMATE.start_main_~c~0] 189#L5-3 [46] L5-3-->L5-3: Formula: (and (= (+ v_ULTIMATE.start_main_~j~0_12 1) v_ULTIMATE.start_main_~j~0_10) (= (+ v_ULTIMATE.start_main_~c~0_9 1) v_ULTIMATE.start_main_~c~0_8) (< v_ULTIMATE.start_main_~j~0_12 12)) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_12, ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_9} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_10, ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0, ULTIMATE.start_main_~c~0] 194#L5-3 [46] L5-3-->L5-3: Formula: (and (= (+ v_ULTIMATE.start_main_~j~0_12 1) v_ULTIMATE.start_main_~j~0_10) (= (+ v_ULTIMATE.start_main_~c~0_9 1) v_ULTIMATE.start_main_~c~0_8) (< v_ULTIMATE.start_main_~j~0_12 12)) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_12, ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_9} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_10, ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0, ULTIMATE.start_main_~c~0] 193#L5-3 [46] L5-3-->L5-3: Formula: (and (= (+ v_ULTIMATE.start_main_~j~0_12 1) v_ULTIMATE.start_main_~j~0_10) (= (+ v_ULTIMATE.start_main_~c~0_9 1) v_ULTIMATE.start_main_~c~0_8) (< v_ULTIMATE.start_main_~j~0_12 12)) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_12, ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_9} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_10, ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0, ULTIMATE.start_main_~c~0] 192#L5-3 [46] L5-3-->L5-3: Formula: (and (= (+ v_ULTIMATE.start_main_~j~0_12 1) v_ULTIMATE.start_main_~j~0_10) (= (+ v_ULTIMATE.start_main_~c~0_9 1) v_ULTIMATE.start_main_~c~0_8) (< v_ULTIMATE.start_main_~j~0_12 12)) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_12, ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_9} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_10, ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0, ULTIMATE.start_main_~c~0] 191#L5-3 [46] L5-3-->L5-3: Formula: (and (= (+ v_ULTIMATE.start_main_~j~0_12 1) v_ULTIMATE.start_main_~j~0_10) (= (+ v_ULTIMATE.start_main_~c~0_9 1) v_ULTIMATE.start_main_~c~0_8) (< v_ULTIMATE.start_main_~j~0_12 12)) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_12, ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_9} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_10, ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0, ULTIMATE.start_main_~c~0] 190#L5-3 [47] L5-3-->L4-3: Formula: (and (<= 12 v_ULTIMATE.start_main_~j~0_13) (= (+ v_ULTIMATE.start_main_~i~0_12 1) v_ULTIMATE.start_main_~i~0_11)) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_13, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_13, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11, ULTIMATE.start_main_#t~post0=|v_ULTIMATE.start_main_#t~post0_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0, ULTIMATE.start_main_#t~post0] 187#L4-3 17.48/7.68 [2019-03-28 12:17:35,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 17.48/7.68 [2019-03-28 12:17:35,100 INFO L82 PathProgramCache]: Analyzing trace with hash 62, now seen corresponding path program 7 times 17.48/7.68 [2019-03-28 12:17:35,100 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 17.48/7.68 [2019-03-28 12:17:35,101 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 17.48/7.68 [2019-03-28 12:17:35,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 17.48/7.68 [2019-03-28 12:17:35,102 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 17.48/7.68 [2019-03-28 12:17:35,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 17.48/7.68 [2019-03-28 12:17:35,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 17.48/7.68 [2019-03-28 12:17:35,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 17.48/7.68 [2019-03-28 12:17:35,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 17.48/7.68 [2019-03-28 12:17:35,105 INFO L82 PathProgramCache]: Analyzing trace with hash -1702299539, now seen corresponding path program 6 times 17.48/7.68 [2019-03-28 12:17:35,105 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 17.48/7.68 [2019-03-28 12:17:35,105 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 17.48/7.68 [2019-03-28 12:17:35,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 17.48/7.68 [2019-03-28 12:17:35,106 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 17.48/7.68 [2019-03-28 12:17:35,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 17.48/7.68 [2019-03-28 12:17:35,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 17.48/7.68 [2019-03-28 12:17:35,180 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 17.48/7.68 [2019-03-28 12:17:35,181 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 17.48/7.68 [2019-03-28 12:17:35,181 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 17.48/7.68 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 17.48/7.68 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 17.48/7.68 Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 17.48/7.68 [2019-03-28 12:17:35,196 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE 17.48/7.68 [2019-03-28 12:17:35,208 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) 17.48/7.68 [2019-03-28 12:17:35,208 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat 17.48/7.68 [2019-03-28 12:17:35,209 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 8 conjunts are in the unsatisfiable core 17.48/7.68 [2019-03-28 12:17:35,210 INFO L279 TraceCheckSpWp]: Computing forward predicates... 17.48/7.68 [2019-03-28 12:17:35,216 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 17.48/7.68 [2019-03-28 12:17:35,242 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 17.48/7.68 [2019-03-28 12:17:35,242 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 17.48/7.68 [2019-03-28 12:17:35,242 INFO L811 eck$LassoCheckResult]: loop already infeasible 17.48/7.68 [2019-03-28 12:17:35,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. 17.48/7.68 [2019-03-28 12:17:35,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 17.48/7.68 [2019-03-28 12:17:35,243 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. cyclomatic complexity: 2 Second operand 9 states. 17.48/7.68 [2019-03-28 12:17:35,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 17.48/7.68 [2019-03-28 12:17:35,267 INFO L93 Difference]: Finished difference Result 10 states and 11 transitions. 17.48/7.68 [2019-03-28 12:17:35,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 17.48/7.68 [2019-03-28 12:17:35,268 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 10 states and 11 transitions. 17.48/7.68 [2019-03-28 12:17:35,268 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 17.48/7.68 [2019-03-28 12:17:35,269 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 10 states to 10 states and 11 transitions. 17.48/7.68 [2019-03-28 12:17:35,269 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 17.48/7.68 [2019-03-28 12:17:35,269 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 17.48/7.68 [2019-03-28 12:17:35,269 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 11 transitions. 17.48/7.68 [2019-03-28 12:17:35,269 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 17.48/7.68 [2019-03-28 12:17:35,270 INFO L706 BuchiCegarLoop]: Abstraction has 10 states and 11 transitions. 17.48/7.68 [2019-03-28 12:17:35,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 11 transitions. 17.48/7.68 [2019-03-28 12:17:35,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. 17.48/7.68 [2019-03-28 12:17:35,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. 17.48/7.68 [2019-03-28 12:17:35,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 11 transitions. 17.48/7.68 [2019-03-28 12:17:35,271 INFO L729 BuchiCegarLoop]: Abstraction has 10 states and 11 transitions. 17.48/7.68 [2019-03-28 12:17:35,271 INFO L609 BuchiCegarLoop]: Abstraction has 10 states and 11 transitions. 17.48/7.68 [2019-03-28 12:17:35,271 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ 17.48/7.68 [2019-03-28 12:17:35,272 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 11 transitions. 17.48/7.68 [2019-03-28 12:17:35,272 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 17.48/7.68 [2019-03-28 12:17:35,272 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 17.48/7.68 [2019-03-28 12:17:35,272 INFO L119 BuchiIsEmpty]: Starting construction of run 17.48/7.68 [2019-03-28 12:17:35,273 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] 17.48/7.68 [2019-03-28 12:17:35,273 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [7, 1, 1] 17.48/7.68 [2019-03-28 12:17:35,274 INFO L794 eck$LassoCheckResult]: Stem: 238#ULTIMATE.startENTRY [31] ULTIMATE.startENTRY-->L4-3: Formula: (and (= v_ULTIMATE.start_main_~c~0_1 0) (= v_ULTIMATE.start_main_~i~0_1 0)) InVars {} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_1, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_1, ULTIMATE.start_main_#t~post0=|v_ULTIMATE.start_main_#t~post0_1|, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~i~0, ULTIMATE.start_main_#t~post0] 239#L4-3 17.48/7.68 [2019-03-28 12:17:35,274 INFO L796 eck$LassoCheckResult]: Loop: 239#L4-3 [35] L4-3-->L5-3: Formula: (and (< v_ULTIMATE.start_main_~i~0_9 10) (= v_ULTIMATE.start_main_~j~0_8 3)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 240#L5-3 [46] L5-3-->L5-3: Formula: (and (= (+ v_ULTIMATE.start_main_~j~0_12 1) v_ULTIMATE.start_main_~j~0_10) (= (+ v_ULTIMATE.start_main_~c~0_9 1) v_ULTIMATE.start_main_~c~0_8) (< v_ULTIMATE.start_main_~j~0_12 12)) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_12, ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_9} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_10, ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0, ULTIMATE.start_main_~c~0] 241#L5-3 [46] L5-3-->L5-3: Formula: (and (= (+ v_ULTIMATE.start_main_~j~0_12 1) v_ULTIMATE.start_main_~j~0_10) (= (+ v_ULTIMATE.start_main_~c~0_9 1) v_ULTIMATE.start_main_~c~0_8) (< v_ULTIMATE.start_main_~j~0_12 12)) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_12, ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_9} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_10, ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0, ULTIMATE.start_main_~c~0] 247#L5-3 [46] L5-3-->L5-3: Formula: (and (= (+ v_ULTIMATE.start_main_~j~0_12 1) v_ULTIMATE.start_main_~j~0_10) (= (+ v_ULTIMATE.start_main_~c~0_9 1) v_ULTIMATE.start_main_~c~0_8) (< v_ULTIMATE.start_main_~j~0_12 12)) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_12, ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_9} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_10, ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0, ULTIMATE.start_main_~c~0] 246#L5-3 [46] L5-3-->L5-3: Formula: (and (= (+ v_ULTIMATE.start_main_~j~0_12 1) v_ULTIMATE.start_main_~j~0_10) (= (+ v_ULTIMATE.start_main_~c~0_9 1) v_ULTIMATE.start_main_~c~0_8) (< v_ULTIMATE.start_main_~j~0_12 12)) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_12, ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_9} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_10, ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0, ULTIMATE.start_main_~c~0] 245#L5-3 [46] L5-3-->L5-3: Formula: (and (= (+ v_ULTIMATE.start_main_~j~0_12 1) v_ULTIMATE.start_main_~j~0_10) (= (+ v_ULTIMATE.start_main_~c~0_9 1) v_ULTIMATE.start_main_~c~0_8) (< v_ULTIMATE.start_main_~j~0_12 12)) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_12, ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_9} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_10, ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0, ULTIMATE.start_main_~c~0] 244#L5-3 [46] L5-3-->L5-3: Formula: (and (= (+ v_ULTIMATE.start_main_~j~0_12 1) v_ULTIMATE.start_main_~j~0_10) (= (+ v_ULTIMATE.start_main_~c~0_9 1) v_ULTIMATE.start_main_~c~0_8) (< v_ULTIMATE.start_main_~j~0_12 12)) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_12, ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_9} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_10, ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0, ULTIMATE.start_main_~c~0] 243#L5-3 [46] L5-3-->L5-3: Formula: (and (= (+ v_ULTIMATE.start_main_~j~0_12 1) v_ULTIMATE.start_main_~j~0_10) (= (+ v_ULTIMATE.start_main_~c~0_9 1) v_ULTIMATE.start_main_~c~0_8) (< v_ULTIMATE.start_main_~j~0_12 12)) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_12, ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_9} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_10, ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0, ULTIMATE.start_main_~c~0] 242#L5-3 [47] L5-3-->L4-3: Formula: (and (<= 12 v_ULTIMATE.start_main_~j~0_13) (= (+ v_ULTIMATE.start_main_~i~0_12 1) v_ULTIMATE.start_main_~i~0_11)) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_13, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_13, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11, ULTIMATE.start_main_#t~post0=|v_ULTIMATE.start_main_#t~post0_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0, ULTIMATE.start_main_#t~post0] 239#L4-3 17.48/7.68 [2019-03-28 12:17:35,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 17.48/7.68 [2019-03-28 12:17:35,274 INFO L82 PathProgramCache]: Analyzing trace with hash 62, now seen corresponding path program 8 times 17.48/7.68 [2019-03-28 12:17:35,275 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 17.48/7.68 [2019-03-28 12:17:35,275 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 17.48/7.68 [2019-03-28 12:17:35,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 17.48/7.68 [2019-03-28 12:17:35,276 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 17.48/7.68 [2019-03-28 12:17:35,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 17.48/7.68 [2019-03-28 12:17:35,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 17.48/7.68 [2019-03-28 12:17:35,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 17.48/7.68 [2019-03-28 12:17:35,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 17.48/7.68 [2019-03-28 12:17:35,279 INFO L82 PathProgramCache]: Analyzing trace with hash -1231678141, now seen corresponding path program 7 times 17.48/7.68 [2019-03-28 12:17:35,279 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 17.48/7.68 [2019-03-28 12:17:35,279 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 17.48/7.68 [2019-03-28 12:17:35,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 17.48/7.68 [2019-03-28 12:17:35,280 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 17.48/7.68 [2019-03-28 12:17:35,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 17.48/7.68 [2019-03-28 12:17:35,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 17.48/7.68 [2019-03-28 12:17:35,356 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 17.48/7.68 [2019-03-28 12:17:35,357 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 17.48/7.68 [2019-03-28 12:17:35,357 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 17.48/7.68 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 17.48/7.68 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 17.48/7.68 Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 17.48/7.68 [2019-03-28 12:17:35,370 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 17.48/7.68 [2019-03-28 12:17:35,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 17.48/7.68 [2019-03-28 12:17:35,383 INFO L256 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 9 conjunts are in the unsatisfiable core 17.48/7.68 [2019-03-28 12:17:35,384 INFO L279 TraceCheckSpWp]: Computing forward predicates... 17.48/7.68 [2019-03-28 12:17:35,390 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 17.48/7.68 [2019-03-28 12:17:35,417 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 17.48/7.68 [2019-03-28 12:17:35,418 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 17.48/7.68 [2019-03-28 12:17:35,418 INFO L811 eck$LassoCheckResult]: loop already infeasible 17.48/7.68 [2019-03-28 12:17:35,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. 17.48/7.68 [2019-03-28 12:17:35,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 17.48/7.68 [2019-03-28 12:17:35,419 INFO L87 Difference]: Start difference. First operand 10 states and 11 transitions. cyclomatic complexity: 2 Second operand 10 states. 17.48/7.68 [2019-03-28 12:17:35,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 17.48/7.68 [2019-03-28 12:17:35,442 INFO L93 Difference]: Finished difference Result 11 states and 12 transitions. 17.48/7.68 [2019-03-28 12:17:35,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 17.48/7.68 [2019-03-28 12:17:35,442 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 12 transitions. 17.48/7.68 [2019-03-28 12:17:35,443 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 17.48/7.68 [2019-03-28 12:17:35,443 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 11 states and 12 transitions. 17.48/7.68 [2019-03-28 12:17:35,444 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 17.48/7.68 [2019-03-28 12:17:35,444 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 17.48/7.68 [2019-03-28 12:17:35,444 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 12 transitions. 17.48/7.68 [2019-03-28 12:17:35,444 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 17.48/7.68 [2019-03-28 12:17:35,444 INFO L706 BuchiCegarLoop]: Abstraction has 11 states and 12 transitions. 17.48/7.68 [2019-03-28 12:17:35,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 12 transitions. 17.48/7.68 [2019-03-28 12:17:35,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. 17.48/7.68 [2019-03-28 12:17:35,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. 17.48/7.68 [2019-03-28 12:17:35,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. 17.48/7.68 [2019-03-28 12:17:35,446 INFO L729 BuchiCegarLoop]: Abstraction has 11 states and 12 transitions. 17.48/7.68 [2019-03-28 12:17:35,446 INFO L609 BuchiCegarLoop]: Abstraction has 11 states and 12 transitions. 17.48/7.68 [2019-03-28 12:17:35,446 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ 17.48/7.68 [2019-03-28 12:17:35,446 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 12 transitions. 17.48/7.68 [2019-03-28 12:17:35,447 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 17.48/7.68 [2019-03-28 12:17:35,447 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 17.48/7.68 [2019-03-28 12:17:35,447 INFO L119 BuchiIsEmpty]: Starting construction of run 17.48/7.68 [2019-03-28 12:17:35,447 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] 17.48/7.68 [2019-03-28 12:17:35,447 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [8, 1, 1] 17.48/7.68 [2019-03-28 12:17:35,448 INFO L794 eck$LassoCheckResult]: Stem: 296#ULTIMATE.startENTRY [31] ULTIMATE.startENTRY-->L4-3: Formula: (and (= v_ULTIMATE.start_main_~c~0_1 0) (= v_ULTIMATE.start_main_~i~0_1 0)) InVars {} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_1, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_1, ULTIMATE.start_main_#t~post0=|v_ULTIMATE.start_main_#t~post0_1|, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~i~0, ULTIMATE.start_main_#t~post0] 297#L4-3 17.48/7.68 [2019-03-28 12:17:35,448 INFO L796 eck$LassoCheckResult]: Loop: 297#L4-3 [35] L4-3-->L5-3: Formula: (and (< v_ULTIMATE.start_main_~i~0_9 10) (= v_ULTIMATE.start_main_~j~0_8 3)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 298#L5-3 [46] L5-3-->L5-3: Formula: (and (= (+ v_ULTIMATE.start_main_~j~0_12 1) v_ULTIMATE.start_main_~j~0_10) (= (+ v_ULTIMATE.start_main_~c~0_9 1) v_ULTIMATE.start_main_~c~0_8) (< v_ULTIMATE.start_main_~j~0_12 12)) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_12, ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_9} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_10, ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0, ULTIMATE.start_main_~c~0] 299#L5-3 [46] L5-3-->L5-3: Formula: (and (= (+ v_ULTIMATE.start_main_~j~0_12 1) v_ULTIMATE.start_main_~j~0_10) (= (+ v_ULTIMATE.start_main_~c~0_9 1) v_ULTIMATE.start_main_~c~0_8) (< v_ULTIMATE.start_main_~j~0_12 12)) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_12, ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_9} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_10, ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0, ULTIMATE.start_main_~c~0] 306#L5-3 [46] L5-3-->L5-3: Formula: (and (= (+ v_ULTIMATE.start_main_~j~0_12 1) v_ULTIMATE.start_main_~j~0_10) (= (+ v_ULTIMATE.start_main_~c~0_9 1) v_ULTIMATE.start_main_~c~0_8) (< v_ULTIMATE.start_main_~j~0_12 12)) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_12, ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_9} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_10, ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0, ULTIMATE.start_main_~c~0] 305#L5-3 [46] L5-3-->L5-3: Formula: (and (= (+ v_ULTIMATE.start_main_~j~0_12 1) v_ULTIMATE.start_main_~j~0_10) (= (+ v_ULTIMATE.start_main_~c~0_9 1) v_ULTIMATE.start_main_~c~0_8) (< v_ULTIMATE.start_main_~j~0_12 12)) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_12, ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_9} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_10, ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0, ULTIMATE.start_main_~c~0] 304#L5-3 [46] L5-3-->L5-3: Formula: (and (= (+ v_ULTIMATE.start_main_~j~0_12 1) v_ULTIMATE.start_main_~j~0_10) (= (+ v_ULTIMATE.start_main_~c~0_9 1) v_ULTIMATE.start_main_~c~0_8) (< v_ULTIMATE.start_main_~j~0_12 12)) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_12, ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_9} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_10, ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0, ULTIMATE.start_main_~c~0] 303#L5-3 [46] L5-3-->L5-3: Formula: (and (= (+ v_ULTIMATE.start_main_~j~0_12 1) v_ULTIMATE.start_main_~j~0_10) (= (+ v_ULTIMATE.start_main_~c~0_9 1) v_ULTIMATE.start_main_~c~0_8) (< v_ULTIMATE.start_main_~j~0_12 12)) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_12, ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_9} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_10, ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0, ULTIMATE.start_main_~c~0] 302#L5-3 [46] L5-3-->L5-3: Formula: (and (= (+ v_ULTIMATE.start_main_~j~0_12 1) v_ULTIMATE.start_main_~j~0_10) (= (+ v_ULTIMATE.start_main_~c~0_9 1) v_ULTIMATE.start_main_~c~0_8) (< v_ULTIMATE.start_main_~j~0_12 12)) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_12, ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_9} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_10, ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0, ULTIMATE.start_main_~c~0] 301#L5-3 [46] L5-3-->L5-3: Formula: (and (= (+ v_ULTIMATE.start_main_~j~0_12 1) v_ULTIMATE.start_main_~j~0_10) (= (+ v_ULTIMATE.start_main_~c~0_9 1) v_ULTIMATE.start_main_~c~0_8) (< v_ULTIMATE.start_main_~j~0_12 12)) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_12, ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_9} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_10, ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0, ULTIMATE.start_main_~c~0] 300#L5-3 [47] L5-3-->L4-3: Formula: (and (<= 12 v_ULTIMATE.start_main_~j~0_13) (= (+ v_ULTIMATE.start_main_~i~0_12 1) v_ULTIMATE.start_main_~i~0_11)) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_13, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_13, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11, ULTIMATE.start_main_#t~post0=|v_ULTIMATE.start_main_#t~post0_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0, ULTIMATE.start_main_#t~post0] 297#L4-3 17.48/7.68 [2019-03-28 12:17:35,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 17.48/7.68 [2019-03-28 12:17:35,449 INFO L82 PathProgramCache]: Analyzing trace with hash 62, now seen corresponding path program 9 times 17.48/7.68 [2019-03-28 12:17:35,449 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 17.48/7.68 [2019-03-28 12:17:35,449 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 17.48/7.68 [2019-03-28 12:17:35,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 17.48/7.68 [2019-03-28 12:17:35,450 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 17.48/7.68 [2019-03-28 12:17:35,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 17.48/7.68 [2019-03-28 12:17:35,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 17.48/7.68 [2019-03-28 12:17:35,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 17.48/7.68 [2019-03-28 12:17:35,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 17.48/7.68 [2019-03-28 12:17:35,455 INFO L82 PathProgramCache]: Analyzing trace with hash 472683309, now seen corresponding path program 8 times 17.48/7.68 [2019-03-28 12:17:35,456 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 17.48/7.68 [2019-03-28 12:17:35,456 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 17.48/7.68 [2019-03-28 12:17:35,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 17.48/7.68 [2019-03-28 12:17:35,457 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 17.48/7.68 [2019-03-28 12:17:35,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 17.48/7.68 [2019-03-28 12:17:35,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 17.48/7.68 [2019-03-28 12:17:35,550 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 17.48/7.68 [2019-03-28 12:17:35,551 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 17.48/7.68 [2019-03-28 12:17:35,551 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 17.48/7.68 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 17.48/7.68 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 17.48/7.68 Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 17.48/7.68 [2019-03-28 12:17:35,563 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 17.48/7.68 [2019-03-28 12:17:35,577 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) 17.48/7.68 [2019-03-28 12:17:35,578 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat 17.48/7.68 [2019-03-28 12:17:35,578 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 10 conjunts are in the unsatisfiable core 17.48/7.68 [2019-03-28 12:17:35,579 INFO L279 TraceCheckSpWp]: Computing forward predicates... 17.48/7.68 [2019-03-28 12:17:35,587 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 17.48/7.68 [2019-03-28 12:17:35,614 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 17.48/7.68 [2019-03-28 12:17:35,614 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 17.48/7.68 [2019-03-28 12:17:35,615 INFO L811 eck$LassoCheckResult]: loop already infeasible 17.48/7.68 [2019-03-28 12:17:35,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. 17.48/7.68 [2019-03-28 12:17:35,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 17.48/7.68 [2019-03-28 12:17:35,615 INFO L87 Difference]: Start difference. First operand 11 states and 12 transitions. cyclomatic complexity: 2 Second operand 11 states. 17.48/7.68 [2019-03-28 12:17:35,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 17.48/7.68 [2019-03-28 12:17:35,639 INFO L93 Difference]: Finished difference Result 12 states and 13 transitions. 17.48/7.68 [2019-03-28 12:17:35,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 17.48/7.68 [2019-03-28 12:17:35,640 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 13 transitions. 17.48/7.68 [2019-03-28 12:17:35,641 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 17.48/7.68 [2019-03-28 12:17:35,641 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 12 states and 13 transitions. 17.48/7.68 [2019-03-28 12:17:35,642 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 17.48/7.68 [2019-03-28 12:17:35,642 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 17.48/7.68 [2019-03-28 12:17:35,642 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 13 transitions. 17.48/7.68 [2019-03-28 12:17:35,642 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 17.48/7.68 [2019-03-28 12:17:35,642 INFO L706 BuchiCegarLoop]: Abstraction has 12 states and 13 transitions. 17.48/7.68 [2019-03-28 12:17:35,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 13 transitions. 17.48/7.68 [2019-03-28 12:17:35,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. 17.48/7.68 [2019-03-28 12:17:35,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. 17.48/7.68 [2019-03-28 12:17:35,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 13 transitions. 17.48/7.68 [2019-03-28 12:17:35,645 INFO L729 BuchiCegarLoop]: Abstraction has 12 states and 13 transitions. 17.48/7.68 [2019-03-28 12:17:35,645 INFO L609 BuchiCegarLoop]: Abstraction has 12 states and 13 transitions. 17.48/7.68 [2019-03-28 12:17:35,645 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ 17.48/7.68 [2019-03-28 12:17:35,645 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 13 transitions. 17.48/7.68 [2019-03-28 12:17:35,645 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 17.48/7.68 [2019-03-28 12:17:35,646 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 17.48/7.68 [2019-03-28 12:17:35,646 INFO L119 BuchiIsEmpty]: Starting construction of run 17.48/7.68 [2019-03-28 12:17:35,646 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] 17.48/7.68 [2019-03-28 12:17:35,646 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [9, 1, 1] 17.48/7.68 [2019-03-28 12:17:35,647 INFO L794 eck$LassoCheckResult]: Stem: 360#ULTIMATE.startENTRY [31] ULTIMATE.startENTRY-->L4-3: Formula: (and (= v_ULTIMATE.start_main_~c~0_1 0) (= v_ULTIMATE.start_main_~i~0_1 0)) InVars {} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_1, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_1, ULTIMATE.start_main_#t~post0=|v_ULTIMATE.start_main_#t~post0_1|, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~i~0, ULTIMATE.start_main_#t~post0] 361#L4-3 17.48/7.68 [2019-03-28 12:17:35,647 INFO L796 eck$LassoCheckResult]: Loop: 361#L4-3 [35] L4-3-->L5-3: Formula: (and (< v_ULTIMATE.start_main_~i~0_9 10) (= v_ULTIMATE.start_main_~j~0_8 3)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 362#L5-3 [46] L5-3-->L5-3: Formula: (and (= (+ v_ULTIMATE.start_main_~j~0_12 1) v_ULTIMATE.start_main_~j~0_10) (= (+ v_ULTIMATE.start_main_~c~0_9 1) v_ULTIMATE.start_main_~c~0_8) (< v_ULTIMATE.start_main_~j~0_12 12)) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_12, ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_9} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_10, ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0, ULTIMATE.start_main_~c~0] 363#L5-3 [46] L5-3-->L5-3: Formula: (and (= (+ v_ULTIMATE.start_main_~j~0_12 1) v_ULTIMATE.start_main_~j~0_10) (= (+ v_ULTIMATE.start_main_~c~0_9 1) v_ULTIMATE.start_main_~c~0_8) (< v_ULTIMATE.start_main_~j~0_12 12)) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_12, ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_9} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_10, ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0, ULTIMATE.start_main_~c~0] 371#L5-3 [46] L5-3-->L5-3: Formula: (and (= (+ v_ULTIMATE.start_main_~j~0_12 1) v_ULTIMATE.start_main_~j~0_10) (= (+ v_ULTIMATE.start_main_~c~0_9 1) v_ULTIMATE.start_main_~c~0_8) (< v_ULTIMATE.start_main_~j~0_12 12)) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_12, ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_9} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_10, ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0, ULTIMATE.start_main_~c~0] 370#L5-3 [46] L5-3-->L5-3: Formula: (and (= (+ v_ULTIMATE.start_main_~j~0_12 1) v_ULTIMATE.start_main_~j~0_10) (= (+ v_ULTIMATE.start_main_~c~0_9 1) v_ULTIMATE.start_main_~c~0_8) (< v_ULTIMATE.start_main_~j~0_12 12)) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_12, ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_9} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_10, ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0, ULTIMATE.start_main_~c~0] 369#L5-3 [46] L5-3-->L5-3: Formula: (and (= (+ v_ULTIMATE.start_main_~j~0_12 1) v_ULTIMATE.start_main_~j~0_10) (= (+ v_ULTIMATE.start_main_~c~0_9 1) v_ULTIMATE.start_main_~c~0_8) (< v_ULTIMATE.start_main_~j~0_12 12)) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_12, ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_9} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_10, ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0, ULTIMATE.start_main_~c~0] 368#L5-3 [46] L5-3-->L5-3: Formula: (and (= (+ v_ULTIMATE.start_main_~j~0_12 1) v_ULTIMATE.start_main_~j~0_10) (= (+ v_ULTIMATE.start_main_~c~0_9 1) v_ULTIMATE.start_main_~c~0_8) (< v_ULTIMATE.start_main_~j~0_12 12)) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_12, ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_9} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_10, ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0, ULTIMATE.start_main_~c~0] 367#L5-3 [46] L5-3-->L5-3: Formula: (and (= (+ v_ULTIMATE.start_main_~j~0_12 1) v_ULTIMATE.start_main_~j~0_10) (= (+ v_ULTIMATE.start_main_~c~0_9 1) v_ULTIMATE.start_main_~c~0_8) (< v_ULTIMATE.start_main_~j~0_12 12)) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_12, ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_9} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_10, ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0, ULTIMATE.start_main_~c~0] 366#L5-3 [46] L5-3-->L5-3: Formula: (and (= (+ v_ULTIMATE.start_main_~j~0_12 1) v_ULTIMATE.start_main_~j~0_10) (= (+ v_ULTIMATE.start_main_~c~0_9 1) v_ULTIMATE.start_main_~c~0_8) (< v_ULTIMATE.start_main_~j~0_12 12)) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_12, ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_9} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_10, ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0, ULTIMATE.start_main_~c~0] 365#L5-3 [46] L5-3-->L5-3: Formula: (and (= (+ v_ULTIMATE.start_main_~j~0_12 1) v_ULTIMATE.start_main_~j~0_10) (= (+ v_ULTIMATE.start_main_~c~0_9 1) v_ULTIMATE.start_main_~c~0_8) (< v_ULTIMATE.start_main_~j~0_12 12)) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_12, ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_9} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_10, ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0, ULTIMATE.start_main_~c~0] 364#L5-3 [47] L5-3-->L4-3: Formula: (and (<= 12 v_ULTIMATE.start_main_~j~0_13) (= (+ v_ULTIMATE.start_main_~i~0_12 1) v_ULTIMATE.start_main_~i~0_11)) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_13, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_13, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11, ULTIMATE.start_main_#t~post0=|v_ULTIMATE.start_main_#t~post0_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0, ULTIMATE.start_main_#t~post0] 361#L4-3 17.48/7.68 [2019-03-28 12:17:35,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 17.48/7.68 [2019-03-28 12:17:35,648 INFO L82 PathProgramCache]: Analyzing trace with hash 62, now seen corresponding path program 10 times 17.48/7.68 [2019-03-28 12:17:35,648 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 17.48/7.68 [2019-03-28 12:17:35,648 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 17.48/7.68 [2019-03-28 12:17:35,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 17.48/7.68 [2019-03-28 12:17:35,649 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 17.48/7.68 [2019-03-28 12:17:35,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 17.48/7.68 [2019-03-28 12:17:35,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 17.48/7.68 [2019-03-28 12:17:35,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 17.48/7.68 [2019-03-28 12:17:35,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 17.48/7.68 [2019-03-28 12:17:35,653 INFO L82 PathProgramCache]: Analyzing trace with hash 1768280707, now seen corresponding path program 9 times 17.48/7.68 [2019-03-28 12:17:35,653 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 17.48/7.68 [2019-03-28 12:17:35,653 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 17.48/7.68 [2019-03-28 12:17:35,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 17.48/7.68 [2019-03-28 12:17:35,654 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 17.48/7.68 [2019-03-28 12:17:35,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 17.48/7.68 [2019-03-28 12:17:35,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 17.48/7.68 [2019-03-28 12:17:35,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 17.48/7.68 [2019-03-28 12:17:35,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 17.48/7.68 [2019-03-28 12:17:35,675 INFO L82 PathProgramCache]: Analyzing trace with hash 1052391974, now seen corresponding path program 1 times 17.48/7.68 [2019-03-28 12:17:35,675 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 17.48/7.68 [2019-03-28 12:17:35,676 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 17.48/7.68 [2019-03-28 12:17:35,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 17.48/7.68 [2019-03-28 12:17:35,677 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 17.48/7.68 [2019-03-28 12:17:35,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 17.48/7.68 [2019-03-28 12:17:35,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 17.48/7.68 [2019-03-28 12:17:35,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 17.48/7.68 [2019-03-28 12:17:35,886 WARN L188 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 67 17.48/7.68 [2019-03-28 12:17:35,911 INFO L216 LassoAnalysis]: Preferences: 17.48/7.68 [2019-03-28 12:17:35,913 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 17.48/7.68 [2019-03-28 12:17:35,913 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 17.48/7.68 [2019-03-28 12:17:35,913 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 17.48/7.68 [2019-03-28 12:17:35,913 INFO L127 ssoRankerPreferences]: Use exernal solver: true 17.48/7.68 [2019-03-28 12:17:35,913 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 17.48/7.68 [2019-03-28 12:17:35,914 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 17.48/7.68 [2019-03-28 12:17:35,914 INFO L130 ssoRankerPreferences]: Path of dumped script: 17.48/7.68 [2019-03-28 12:17:35,914 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration10_Loop 17.48/7.68 [2019-03-28 12:17:35,914 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 17.48/7.68 [2019-03-28 12:17:35,914 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 17.48/7.68 [2019-03-28 12:17:35,929 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 17.48/7.68 [2019-03-28 12:17:35,940 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 17.48/7.68 [2019-03-28 12:17:35,942 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 17.48/7.68 [2019-03-28 12:17:35,945 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 17.48/7.68 [2019-03-28 12:17:35,992 INFO L300 LassoAnalysis]: Preprocessing complete. 17.48/7.68 [2019-03-28 12:17:35,993 INFO L412 LassoAnalysis]: Checking for nontermination... 17.48/7.68 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 17.48/7.68 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 17.48/7.68 Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 17.48/7.68 [2019-03-28 12:17:35,999 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 17.48/7.68 [2019-03-28 12:17:35,999 INFO L163 nArgumentSynthesizer]: Using integer mode. 17.48/7.68 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 17.48/7.68 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 17.48/7.68 Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 17.48/7.68 [2019-03-28 12:17:36,031 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 17.48/7.68 [2019-03-28 12:17:36,031 INFO L163 nArgumentSynthesizer]: Using integer mode. 17.48/7.68 [2019-03-28 12:17:36,075 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. 17.48/7.68 [2019-03-28 12:17:36,077 INFO L216 LassoAnalysis]: Preferences: 17.48/7.68 [2019-03-28 12:17:36,078 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 17.48/7.68 [2019-03-28 12:17:36,078 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 17.48/7.68 [2019-03-28 12:17:36,078 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 17.48/7.68 [2019-03-28 12:17:36,078 INFO L127 ssoRankerPreferences]: Use exernal solver: false 17.48/7.68 [2019-03-28 12:17:36,078 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 17.48/7.68 [2019-03-28 12:17:36,078 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 17.48/7.68 [2019-03-28 12:17:36,078 INFO L130 ssoRankerPreferences]: Path of dumped script: 17.48/7.68 [2019-03-28 12:17:36,079 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration10_Loop 17.48/7.68 [2019-03-28 12:17:36,079 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 17.48/7.68 [2019-03-28 12:17:36,079 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 17.48/7.68 [2019-03-28 12:17:36,080 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 17.48/7.68 [2019-03-28 12:17:36,087 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 17.48/7.68 [2019-03-28 12:17:36,090 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 17.48/7.68 [2019-03-28 12:17:36,092 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 17.48/7.68 [2019-03-28 12:17:36,132 INFO L300 LassoAnalysis]: Preprocessing complete. 17.48/7.68 [2019-03-28 12:17:36,138 INFO L497 LassoAnalysis]: Using template 'affine'. 17.48/7.68 [2019-03-28 12:17:36,140 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 17.48/7.68 Termination analysis: LINEAR_WITH_GUESSES 17.48/7.68 Number of strict supporting invariants: 0 17.48/7.68 Number of non-strict supporting invariants: 1 17.48/7.68 Consider only non-deceasing supporting invariants: true 17.48/7.68 Simplify termination arguments: true 17.48/7.68 Simplify supporting invariants: trueOverapproximate stem: false 17.48/7.68 [2019-03-28 12:17:36,141 INFO L339 nArgumentSynthesizer]: Template has degree 0. 17.48/7.68 [2019-03-28 12:17:36,142 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 17.48/7.68 [2019-03-28 12:17:36,142 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 17.48/7.68 [2019-03-28 12:17:36,142 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 17.48/7.68 [2019-03-28 12:17:36,142 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 17.48/7.68 [2019-03-28 12:17:36,145 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 17.48/7.68 [2019-03-28 12:17:36,145 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 17.48/7.68 [2019-03-28 12:17:36,149 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 17.48/7.68 [2019-03-28 12:17:36,156 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 17.48/7.68 [2019-03-28 12:17:36,156 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. 17.48/7.68 [2019-03-28 12:17:36,158 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 17.48/7.68 [2019-03-28 12:17:36,158 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 17.48/7.68 [2019-03-28 12:17:36,159 INFO L518 LassoAnalysis]: Proved termination. 17.48/7.68 [2019-03-28 12:17:36,159 INFO L520 LassoAnalysis]: Termination argument consisting of: 17.48/7.68 Ranking function f(ULTIMATE.start_main_~i~0) = -2*ULTIMATE.start_main_~i~0 + 19 17.48/7.68 Supporting invariants [] 17.48/7.68 [2019-03-28 12:17:36,161 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed 17.48/7.68 [2019-03-28 12:17:36,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 17.48/7.68 [2019-03-28 12:17:36,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 17.48/7.68 [2019-03-28 12:17:36,189 INFO L256 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 2 conjunts are in the unsatisfiable core 17.48/7.68 [2019-03-28 12:17:36,189 INFO L279 TraceCheckSpWp]: Computing forward predicates... 17.48/7.68 [2019-03-28 12:17:36,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 17.48/7.68 [2019-03-28 12:17:36,201 INFO L256 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 4 conjunts are in the unsatisfiable core 17.48/7.68 [2019-03-28 12:17:36,201 INFO L279 TraceCheckSpWp]: Computing forward predicates... 17.48/7.68 [2019-03-28 12:17:36,216 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. 17.48/7.68 [2019-03-28 12:17:36,266 INFO L98 LoopCannibalizer]: 2 predicates before loop cannibalization 2 predicates after loop cannibalization 17.48/7.68 [2019-03-28 12:17:36,268 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 17.48/7.68 [2019-03-28 12:17:36,269 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 12 states and 13 transitions. cyclomatic complexity: 2 Second operand 3 states. 17.48/7.68 [2019-03-28 12:17:36,304 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 12 states and 13 transitions. cyclomatic complexity: 2. Second operand 3 states. Result 23 states and 26 transitions. Complement of second has 5 states. 17.48/7.68 [2019-03-28 12:17:36,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 2 accepting loop states 17.48/7.68 [2019-03-28 12:17:36,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. 17.48/7.68 [2019-03-28 12:17:36,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 9 transitions. 17.48/7.68 [2019-03-28 12:17:36,308 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 1 letters. Loop has 11 letters. 17.48/7.68 [2019-03-28 12:17:36,309 INFO L116 BuchiAccepts]: Finished buchiAccepts. 17.48/7.68 [2019-03-28 12:17:36,309 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 12 letters. Loop has 11 letters. 17.48/7.68 [2019-03-28 12:17:36,310 INFO L116 BuchiAccepts]: Finished buchiAccepts. 17.48/7.68 [2019-03-28 12:17:36,310 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 1 letters. Loop has 22 letters. 17.48/7.68 [2019-03-28 12:17:36,311 INFO L116 BuchiAccepts]: Finished buchiAccepts. 17.48/7.68 [2019-03-28 12:17:36,315 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 26 transitions. 17.48/7.68 [2019-03-28 12:17:36,316 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 17.48/7.68 [2019-03-28 12:17:36,317 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 23 states and 26 transitions. 17.48/7.68 [2019-03-28 12:17:36,317 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 17.48/7.68 [2019-03-28 12:17:36,317 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 17.48/7.68 [2019-03-28 12:17:36,318 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 26 transitions. 17.48/7.68 [2019-03-28 12:17:36,318 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 17.48/7.68 [2019-03-28 12:17:36,318 INFO L706 BuchiCegarLoop]: Abstraction has 23 states and 26 transitions. 17.48/7.68 [2019-03-28 12:17:36,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 26 transitions. 17.48/7.68 [2019-03-28 12:17:36,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 14. 17.48/7.68 [2019-03-28 12:17:36,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. 17.48/7.68 [2019-03-28 12:17:36,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 17 transitions. 17.48/7.68 [2019-03-28 12:17:36,320 INFO L729 BuchiCegarLoop]: Abstraction has 14 states and 17 transitions. 17.48/7.68 [2019-03-28 12:17:36,320 INFO L609 BuchiCegarLoop]: Abstraction has 14 states and 17 transitions. 17.48/7.68 [2019-03-28 12:17:36,320 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ 17.48/7.68 [2019-03-28 12:17:36,320 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 17 transitions. 17.48/7.68 [2019-03-28 12:17:36,321 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 17.48/7.68 [2019-03-28 12:17:36,321 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 17.48/7.68 [2019-03-28 12:17:36,321 INFO L119 BuchiIsEmpty]: Starting construction of run 17.48/7.68 [2019-03-28 12:17:36,321 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] 17.48/7.68 [2019-03-28 12:17:36,321 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1] 17.48/7.68 [2019-03-28 12:17:36,322 INFO L794 eck$LassoCheckResult]: Stem: 457#ULTIMATE.startENTRY [31] ULTIMATE.startENTRY-->L4-3: Formula: (and (= v_ULTIMATE.start_main_~c~0_1 0) (= v_ULTIMATE.start_main_~i~0_1 0)) InVars {} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_1, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_1, ULTIMATE.start_main_#t~post0=|v_ULTIMATE.start_main_#t~post0_1|, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~i~0, ULTIMATE.start_main_#t~post0] 458#L4-3 [35] L4-3-->L5-3: Formula: (and (< v_ULTIMATE.start_main_~i~0_9 10) (= v_ULTIMATE.start_main_~j~0_8 3)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 460#L5-3 17.48/7.68 [2019-03-28 12:17:36,322 INFO L796 eck$LassoCheckResult]: Loop: 460#L5-3 [46] L5-3-->L5-3: Formula: (and (= (+ v_ULTIMATE.start_main_~j~0_12 1) v_ULTIMATE.start_main_~j~0_10) (= (+ v_ULTIMATE.start_main_~c~0_9 1) v_ULTIMATE.start_main_~c~0_8) (< v_ULTIMATE.start_main_~j~0_12 12)) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_12, ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_9} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_10, ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0, ULTIMATE.start_main_~c~0] 460#L5-3 17.48/7.68 [2019-03-28 12:17:36,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 17.48/7.68 [2019-03-28 12:17:36,322 INFO L82 PathProgramCache]: Analyzing trace with hash 1957, now seen corresponding path program 1 times 17.48/7.68 [2019-03-28 12:17:36,322 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 17.48/7.68 [2019-03-28 12:17:36,323 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 17.48/7.68 [2019-03-28 12:17:36,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 17.48/7.68 [2019-03-28 12:17:36,324 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 17.48/7.68 [2019-03-28 12:17:36,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 17.48/7.68 [2019-03-28 12:17:36,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 17.48/7.68 [2019-03-28 12:17:36,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 17.48/7.68 [2019-03-28 12:17:36,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 17.48/7.68 [2019-03-28 12:17:36,327 INFO L82 PathProgramCache]: Analyzing trace with hash 77, now seen corresponding path program 1 times 17.48/7.68 [2019-03-28 12:17:36,328 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 17.48/7.68 [2019-03-28 12:17:36,328 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 17.48/7.68 [2019-03-28 12:17:36,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 17.48/7.68 [2019-03-28 12:17:36,329 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 17.48/7.68 [2019-03-28 12:17:36,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 17.48/7.68 [2019-03-28 12:17:36,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 17.48/7.68 [2019-03-28 12:17:36,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 17.48/7.68 [2019-03-28 12:17:36,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 17.48/7.68 [2019-03-28 12:17:36,332 INFO L82 PathProgramCache]: Analyzing trace with hash 60713, now seen corresponding path program 1 times 17.48/7.68 [2019-03-28 12:17:36,332 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 17.48/7.68 [2019-03-28 12:17:36,332 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 17.48/7.68 [2019-03-28 12:17:36,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 17.48/7.68 [2019-03-28 12:17:36,333 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 17.48/7.68 [2019-03-28 12:17:36,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 17.48/7.68 [2019-03-28 12:17:36,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 17.48/7.68 [2019-03-28 12:17:36,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 17.48/7.68 [2019-03-28 12:17:36,353 INFO L216 LassoAnalysis]: Preferences: 17.48/7.68 [2019-03-28 12:17:36,353 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 17.48/7.68 [2019-03-28 12:17:36,353 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 17.48/7.68 [2019-03-28 12:17:36,354 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 17.48/7.68 [2019-03-28 12:17:36,354 INFO L127 ssoRankerPreferences]: Use exernal solver: true 17.48/7.68 [2019-03-28 12:17:36,354 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 17.48/7.68 [2019-03-28 12:17:36,354 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 17.48/7.68 [2019-03-28 12:17:36,354 INFO L130 ssoRankerPreferences]: Path of dumped script: 17.48/7.68 [2019-03-28 12:17:36,354 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration11_Loop 17.48/7.68 [2019-03-28 12:17:36,354 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 17.48/7.68 [2019-03-28 12:17:36,355 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 17.48/7.68 [2019-03-28 12:17:36,355 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 17.48/7.68 [2019-03-28 12:17:36,359 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 17.48/7.68 [2019-03-28 12:17:36,393 INFO L300 LassoAnalysis]: Preprocessing complete. 17.48/7.68 [2019-03-28 12:17:36,394 INFO L412 LassoAnalysis]: Checking for nontermination... 17.48/7.68 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 17.48/7.68 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 17.48/7.68 Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 17.48/7.68 [2019-03-28 12:17:36,397 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 17.48/7.68 [2019-03-28 12:17:36,397 INFO L163 nArgumentSynthesizer]: Using integer mode. 17.48/7.68 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 17.48/7.68 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 17.48/7.68 Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 17.48/7.68 [2019-03-28 12:17:36,428 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 17.48/7.68 [2019-03-28 12:17:36,428 INFO L163 nArgumentSynthesizer]: Using integer mode. 17.48/7.68 [2019-03-28 12:17:36,466 INFO L445 LassoAnalysis]: Proved nontermination for one component. 17.48/7.68 [2019-03-28 12:17:36,466 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~c~0=0} Honda state: {ULTIMATE.start_main_~c~0=0} Generalized eigenvectors: [{ULTIMATE.start_main_~c~0=0}, {ULTIMATE.start_main_~c~0=-1}, {ULTIMATE.start_main_~c~0=2}] Lambdas: [4, 3, 1] Nus: [0, 1] 17.48/7.68 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 17.48/7.68 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 17.48/7.68 Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 17.48/7.68 [2019-03-28 12:17:36,495 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 17.48/7.68 [2019-03-28 12:17:36,495 INFO L163 nArgumentSynthesizer]: Using integer mode. 17.48/7.68 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 17.48/7.68 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 17.48/7.68 Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 17.48/7.68 [2019-03-28 12:17:36,528 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 17.48/7.68 [2019-03-28 12:17:36,528 INFO L163 nArgumentSynthesizer]: Using integer mode. 17.48/7.68 [2019-03-28 12:17:36,559 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. 17.48/7.68 [2019-03-28 12:17:36,566 INFO L216 LassoAnalysis]: Preferences: 17.48/7.68 [2019-03-28 12:17:36,566 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 17.48/7.68 [2019-03-28 12:17:36,566 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 17.48/7.68 [2019-03-28 12:17:36,566 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 17.48/7.68 [2019-03-28 12:17:36,566 INFO L127 ssoRankerPreferences]: Use exernal solver: false 17.48/7.68 [2019-03-28 12:17:36,566 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 17.48/7.68 [2019-03-28 12:17:36,566 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 17.48/7.68 [2019-03-28 12:17:36,567 INFO L130 ssoRankerPreferences]: Path of dumped script: 17.48/7.68 [2019-03-28 12:17:36,567 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration11_Loop 17.48/7.68 [2019-03-28 12:17:36,567 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 17.48/7.68 [2019-03-28 12:17:36,567 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 17.48/7.68 [2019-03-28 12:17:36,568 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 17.48/7.68 [2019-03-28 12:17:36,572 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 17.48/7.68 [2019-03-28 12:17:36,609 INFO L300 LassoAnalysis]: Preprocessing complete. 17.48/7.68 [2019-03-28 12:17:36,609 INFO L497 LassoAnalysis]: Using template 'affine'. 17.48/7.68 [2019-03-28 12:17:36,610 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 17.48/7.68 Termination analysis: LINEAR_WITH_GUESSES 17.48/7.68 Number of strict supporting invariants: 0 17.48/7.68 Number of non-strict supporting invariants: 1 17.48/7.68 Consider only non-deceasing supporting invariants: true 17.48/7.68 Simplify termination arguments: true 17.48/7.68 Simplify supporting invariants: trueOverapproximate stem: false 17.48/7.68 [2019-03-28 12:17:36,611 INFO L339 nArgumentSynthesizer]: Template has degree 0. 17.48/7.68 [2019-03-28 12:17:36,611 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 17.48/7.68 [2019-03-28 12:17:36,611 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 17.48/7.68 [2019-03-28 12:17:36,611 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 17.48/7.68 [2019-03-28 12:17:36,611 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 17.48/7.68 [2019-03-28 12:17:36,612 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 17.48/7.68 [2019-03-28 12:17:36,612 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 17.48/7.68 [2019-03-28 12:17:36,614 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 17.48/7.68 [2019-03-28 12:17:36,614 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 17.48/7.68 Termination analysis: LINEAR_WITH_GUESSES 17.48/7.68 Number of strict supporting invariants: 0 17.48/7.68 Number of non-strict supporting invariants: 1 17.48/7.68 Consider only non-deceasing supporting invariants: true 17.48/7.68 Simplify termination arguments: true 17.48/7.68 Simplify supporting invariants: trueOverapproximate stem: false 17.48/7.68 [2019-03-28 12:17:36,615 INFO L339 nArgumentSynthesizer]: Template has degree 0. 17.48/7.68 [2019-03-28 12:17:36,615 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 17.48/7.68 [2019-03-28 12:17:36,615 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 17.48/7.68 [2019-03-28 12:17:36,615 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 17.48/7.68 [2019-03-28 12:17:36,616 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 17.48/7.68 [2019-03-28 12:17:36,616 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 17.48/7.68 [2019-03-28 12:17:36,616 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 17.48/7.68 [2019-03-28 12:17:36,619 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 17.48/7.68 [2019-03-28 12:17:36,621 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 17.48/7.68 [2019-03-28 12:17:36,621 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. 17.48/7.68 [2019-03-28 12:17:36,622 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 17.48/7.68 [2019-03-28 12:17:36,622 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 17.48/7.68 [2019-03-28 12:17:36,622 INFO L518 LassoAnalysis]: Proved termination. 17.48/7.68 [2019-03-28 12:17:36,622 INFO L520 LassoAnalysis]: Termination argument consisting of: 17.48/7.68 Ranking function f(ULTIMATE.start_main_~j~0) = -2*ULTIMATE.start_main_~j~0 + 23 17.48/7.68 Supporting invariants [] 17.48/7.68 [2019-03-28 12:17:36,623 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed 17.48/7.68 [2019-03-28 12:17:36,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 17.48/7.68 [2019-03-28 12:17:36,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 17.48/7.68 [2019-03-28 12:17:36,654 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 2 conjunts are in the unsatisfiable core 17.48/7.68 [2019-03-28 12:17:36,655 INFO L279 TraceCheckSpWp]: Computing forward predicates... 17.48/7.68 [2019-03-28 12:17:36,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 17.48/7.68 [2019-03-28 12:17:36,658 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjunts are in the unsatisfiable core 17.48/7.68 [2019-03-28 12:17:36,658 INFO L279 TraceCheckSpWp]: Computing forward predicates... 17.48/7.68 [2019-03-28 12:17:36,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 17.48/7.68 [2019-03-28 12:17:36,659 INFO L98 LoopCannibalizer]: 1 predicates before loop cannibalization 1 predicates after loop cannibalization 17.48/7.68 [2019-03-28 12:17:36,659 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 17.48/7.68 [2019-03-28 12:17:36,659 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 14 states and 17 transitions. cyclomatic complexity: 5 Second operand 2 states. 17.48/7.68 [2019-03-28 12:17:36,668 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 14 states and 17 transitions. cyclomatic complexity: 5. Second operand 2 states. Result 16 states and 19 transitions. Complement of second has 4 states. 17.48/7.68 [2019-03-28 12:17:36,668 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 17.48/7.68 [2019-03-28 12:17:36,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. 17.48/7.68 [2019-03-28 12:17:36,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. 17.48/7.68 [2019-03-28 12:17:36,669 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 2 letters. Loop has 1 letters. 17.48/7.68 [2019-03-28 12:17:36,670 INFO L116 BuchiAccepts]: Finished buchiAccepts. 17.48/7.68 [2019-03-28 12:17:36,670 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 3 letters. Loop has 1 letters. 17.48/7.68 [2019-03-28 12:17:36,670 INFO L116 BuchiAccepts]: Finished buchiAccepts. 17.48/7.68 [2019-03-28 12:17:36,670 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 2 letters. Loop has 2 letters. 17.48/7.68 [2019-03-28 12:17:36,670 INFO L116 BuchiAccepts]: Finished buchiAccepts. 17.48/7.68 [2019-03-28 12:17:36,671 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 19 transitions. 17.48/7.68 [2019-03-28 12:17:36,672 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 17.48/7.68 [2019-03-28 12:17:36,672 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 0 states and 0 transitions. 17.48/7.68 [2019-03-28 12:17:36,672 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 17.48/7.68 [2019-03-28 12:17:36,672 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 17.48/7.68 [2019-03-28 12:17:36,673 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. 17.48/7.68 [2019-03-28 12:17:36,673 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 17.48/7.68 [2019-03-28 12:17:36,673 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 17.48/7.68 [2019-03-28 12:17:36,673 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 17.48/7.68 [2019-03-28 12:17:36,673 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 17.48/7.68 [2019-03-28 12:17:36,673 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ 17.48/7.68 [2019-03-28 12:17:36,673 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. 17.48/7.68 [2019-03-28 12:17:36,673 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 17.48/7.68 [2019-03-28 12:17:36,673 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true 17.48/7.68 [2019-03-28 12:17:36,679 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:17:36 BasicIcfg 17.48/7.68 [2019-03-28 12:17:36,680 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- 17.48/7.68 [2019-03-28 12:17:36,680 INFO L168 Benchmark]: Toolchain (without parser) took 3366.88 ms. Allocated memory was 649.6 MB in the beginning and 746.6 MB in the end (delta: 97.0 MB). Free memory was 565.0 MB in the beginning and 623.4 MB in the end (delta: -58.4 MB). Peak memory consumption was 38.6 MB. Max. memory is 50.3 GB. 17.48/7.68 [2019-03-28 12:17:36,681 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 649.6 MB. Free memory is still 585.4 MB. There was no memory consumed. Max. memory is 50.3 GB. 17.48/7.68 [2019-03-28 12:17:36,682 INFO L168 Benchmark]: CACSL2BoogieTranslator took 233.60 ms. Allocated memory is still 649.6 MB. Free memory was 565.0 MB in the beginning and 555.4 MB in the end (delta: 9.6 MB). Peak memory consumption was 9.6 MB. Max. memory is 50.3 GB. 17.48/7.68 [2019-03-28 12:17:36,682 INFO L168 Benchmark]: Boogie Procedure Inliner took 91.52 ms. Allocated memory was 649.6 MB in the beginning and 675.8 MB in the end (delta: 26.2 MB). Free memory was 555.4 MB in the beginning and 643.4 MB in the end (delta: -88.0 MB). Peak memory consumption was 21.7 MB. Max. memory is 50.3 GB. 17.48/7.68 [2019-03-28 12:17:36,683 INFO L168 Benchmark]: Boogie Preprocessor took 20.00 ms. Allocated memory is still 675.8 MB. Free memory was 643.4 MB in the beginning and 640.3 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 50.3 GB. 17.48/7.68 [2019-03-28 12:17:36,683 INFO L168 Benchmark]: RCFGBuilder took 192.79 ms. Allocated memory is still 675.8 MB. Free memory was 640.3 MB in the beginning and 627.4 MB in the end (delta: 12.9 MB). Peak memory consumption was 12.9 MB. Max. memory is 50.3 GB. 17.48/7.68 [2019-03-28 12:17:36,684 INFO L168 Benchmark]: BlockEncodingV2 took 75.81 ms. Allocated memory is still 675.8 MB. Free memory was 627.4 MB in the beginning and 620.9 MB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 50.3 GB. 17.48/7.68 [2019-03-28 12:17:36,684 INFO L168 Benchmark]: TraceAbstraction took 160.23 ms. Allocated memory is still 675.8 MB. Free memory was 619.6 MB in the beginning and 611.5 MB in the end (delta: 8.1 MB). Peak memory consumption was 8.1 MB. Max. memory is 50.3 GB. 17.48/7.68 [2019-03-28 12:17:36,685 INFO L168 Benchmark]: BuchiAutomizer took 2587.22 ms. Allocated memory was 675.8 MB in the beginning and 746.6 MB in the end (delta: 70.8 MB). Free memory was 611.5 MB in the beginning and 623.4 MB in the end (delta: -11.9 MB). Peak memory consumption was 58.9 MB. Max. memory is 50.3 GB. 17.48/7.68 [2019-03-28 12:17:36,689 INFO L337 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### 17.48/7.68 --- Results --- 17.48/7.68 * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: 17.48/7.68 - StatisticsResult: Initial Icfg 17.48/7.68 9 locations, 12 edges 17.48/7.68 - StatisticsResult: Encoded RCFG 17.48/7.68 3 locations, 4 edges 17.48/7.68 * Results from de.uni_freiburg.informatik.ultimate.core: 17.48/7.68 - StatisticsResult: Toolchain Benchmarks 17.48/7.68 Benchmark results are: 17.48/7.68 * CDTParser took 0.18 ms. Allocated memory is still 649.6 MB. Free memory is still 585.4 MB. There was no memory consumed. Max. memory is 50.3 GB. 17.48/7.68 * CACSL2BoogieTranslator took 233.60 ms. Allocated memory is still 649.6 MB. Free memory was 565.0 MB in the beginning and 555.4 MB in the end (delta: 9.6 MB). Peak memory consumption was 9.6 MB. Max. memory is 50.3 GB. 17.48/7.68 * Boogie Procedure Inliner took 91.52 ms. Allocated memory was 649.6 MB in the beginning and 675.8 MB in the end (delta: 26.2 MB). Free memory was 555.4 MB in the beginning and 643.4 MB in the end (delta: -88.0 MB). Peak memory consumption was 21.7 MB. Max. memory is 50.3 GB. 17.48/7.68 * Boogie Preprocessor took 20.00 ms. Allocated memory is still 675.8 MB. Free memory was 643.4 MB in the beginning and 640.3 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 50.3 GB. 17.48/7.68 * RCFGBuilder took 192.79 ms. Allocated memory is still 675.8 MB. Free memory was 640.3 MB in the beginning and 627.4 MB in the end (delta: 12.9 MB). Peak memory consumption was 12.9 MB. Max. memory is 50.3 GB. 17.48/7.68 * BlockEncodingV2 took 75.81 ms. Allocated memory is still 675.8 MB. Free memory was 627.4 MB in the beginning and 620.9 MB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 50.3 GB. 17.48/7.68 * TraceAbstraction took 160.23 ms. Allocated memory is still 675.8 MB. Free memory was 619.6 MB in the beginning and 611.5 MB in the end (delta: 8.1 MB). Peak memory consumption was 8.1 MB. Max. memory is 50.3 GB. 17.48/7.68 * BuchiAutomizer took 2587.22 ms. Allocated memory was 675.8 MB in the beginning and 746.6 MB in the end (delta: 70.8 MB). Free memory was 611.5 MB in the beginning and 623.4 MB in the end (delta: -11.9 MB). Peak memory consumption was 58.9 MB. Max. memory is 50.3 GB. 17.48/7.68 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: 17.48/7.68 - AllSpecificationsHoldResult: All specifications hold 17.48/7.68 We were not able to verify any specifiation because the program does not contain any specification. 17.48/7.68 - InvariantResult [Line: 4]: Loop Invariant 17.48/7.68 Derived loop invariant: 1 17.48/7.68 - InvariantResult [Line: 5]: Loop Invariant 17.48/7.68 Derived loop invariant: 1 17.48/7.68 - StatisticsResult: Ultimate Automizer benchmark data 17.48/7.68 CFG has 1 procedures, 3 locations, 0 error locations. SAFE Result, 0.0s OverallTime, 0 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 2 LocationsWithAnnotation, 2 PreInvPairs, 2 NumberOfFragments, 2 HoareAnnotationTreeSize, 2 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 2 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: No data available, ReuseStatistics: No data available 17.48/7.68 - StatisticsResult: Constructed decomposition of program 17.48/7.68 Your program was decomposed into 11 terminating modules (9 trivial, 0 deterministic, 2 nondeterministic). One nondeterministic module has affine ranking function -2 * i + 19 and consists of 4 locations. One nondeterministic module has affine ranking function -2 * j + 23 and consists of 3 locations. 9 modules have a trivial ranking function, the largest among these consists of 11 locations. 17.48/7.68 - StatisticsResult: Timing statistics 17.48/7.68 BüchiAutomizer plugin needed 2.5s and 12 iterations. TraceHistogramMax:9. Analysis of lassos took 1.9s. Construction of modules took 0.1s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 3. Minimization of det autom 10. Minimization of nondet autom 1. Automata minimization 0.0s AutomataMinimizationTime, 10 MinimizatonAttempts, 9 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 14 states and ocurred in iteration 10. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 45/45 HoareTripleCheckerStatistics: 37 SDtfs, 14 SDslu, 1 SDs, 0 SdLazy, 125 SolverSat, 15 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI9 SFLT2 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital18 mio100 ax100 hnf100 lsp57 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq160 hnf93 smp100 dnf100 smp100 tf113 neg100 sie111 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 20ms VariablesStem: 0 VariablesLoop: 2 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 1 LassoNonterminationAnalysisUnsat: 2 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.2s 17.48/7.68 - TerminationAnalysisResult: Termination proven 17.48/7.68 Buchi Automizer proved that your program is terminating 17.48/7.68 RESULT: Ultimate proved your program to be correct! 17.48/7.68 !SESSION 2019-03-28 12:17:30.031 ----------------------------------------------- 17.48/7.68 eclipse.buildId=unknown 17.48/7.68 java.version=1.8.0_181 17.48/7.68 java.vendor=Oracle Corporation 17.48/7.68 BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US 17.48/7.68 Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox2/benchmark/theBenchmark.c 17.48/7.68 Command-line arguments: -os linux -ws gtk -arch x86_64 -consoleLog -data @user.home/.ultimate -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -data /export/starexec/sandbox2/tmp -i /export/starexec/sandbox2/benchmark/theBenchmark.c 17.48/7.68 17.48/7.68 !ENTRY org.eclipse.core.resources 2 10035 2019-03-28 12:17:36.921 17.48/7.68 !MESSAGE The workspace will exit with unsaved changes in this session. 17.48/7.68 Received shutdown request... 17.48/7.68 Ultimate: 17.48/7.68 GTK+ Version Check 17.48/7.68 EOF