YES Ultimate: Cannot open display: This is Ultimate 0.1.24-8dc7c08-m [2020-06-22 02:23:28,178 INFO L170 SettingsManager]: Resetting all preferences to default values... [2020-06-22 02:23:28,180 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2020-06-22 02:23:28,192 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-06-22 02:23:28,192 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-06-22 02:23:28,193 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-06-22 02:23:28,194 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-06-22 02:23:28,196 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2020-06-22 02:23:28,197 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-06-22 02:23:28,198 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-06-22 02:23:28,199 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-06-22 02:23:28,199 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-06-22 02:23:28,200 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-06-22 02:23:28,201 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-06-22 02:23:28,202 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-06-22 02:23:28,203 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-06-22 02:23:28,203 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-06-22 02:23:28,205 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-06-22 02:23:28,207 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2020-06-22 02:23:28,208 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-06-22 02:23:28,209 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-06-22 02:23:28,210 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-06-22 02:23:28,212 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-06-22 02:23:28,212 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-06-22 02:23:28,213 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-06-22 02:23:28,213 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-06-22 02:23:28,214 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-06-22 02:23:28,215 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-06-22 02:23:28,215 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-06-22 02:23:28,216 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-06-22 02:23:28,216 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-06-22 02:23:28,217 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2020-06-22 02:23:28,218 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-06-22 02:23:28,218 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2020-06-22 02:23:28,219 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-06-22 02:23:28,219 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-06-22 02:23:28,219 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2020-06-22 02:23:28,220 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2020-06-22 02:23:28,221 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2020-06-22 02:23:28,221 INFO L98 SettingsManager]: Beginning loading settings from /export/starexec/sandbox2/solver/bin/./../termcomp2017.epf [2020-06-22 02:23:28,235 INFO L110 SettingsManager]: Loading preferences was successful [2020-06-22 02:23:28,236 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2020-06-22 02:23:28,237 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-06-22 02:23:28,237 INFO L133 SettingsManager]: * Rewrite not-equals=true [2020-06-22 02:23:28,237 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2020-06-22 02:23:28,237 INFO L133 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE [2020-06-22 02:23:28,237 INFO L133 SettingsManager]: * Use SBE=true [2020-06-22 02:23:28,237 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-06-22 02:23:28,238 INFO L133 SettingsManager]: * Use old map elimination=false [2020-06-22 02:23:28,238 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2020-06-22 02:23:28,238 INFO L133 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION [2020-06-22 02:23:28,238 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2020-06-22 02:23:28,238 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-06-22 02:23:28,238 INFO L133 SettingsManager]: * Construct termination proof for TermComp=true [2020-06-22 02:23:28,239 INFO L133 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 02:23:28,239 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-06-22 02:23:28,239 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-06-22 02:23:28,239 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2020-06-22 02:23:28,239 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2020-06-22 02:23:28,239 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-06-22 02:23:28,240 INFO L133 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE [2020-06-22 02:23:28,240 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-06-22 02:23:28,240 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-06-22 02:23:28,240 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-06-22 02:23:28,240 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-06-22 02:23:28,240 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-06-22 02:23:28,241 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-06-22 02:23:28,241 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2020-06-22 02:23:28,241 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-06-22 02:23:28,268 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-06-22 02:23:28,281 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-06-22 02:23:28,288 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-06-22 02:23:28,290 INFO L271 PluginConnector]: Initializing CDTParser... [2020-06-22 02:23:28,290 INFO L276 PluginConnector]: CDTParser initialized [2020-06-22 02:23:28,291 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox2/benchmark/theBenchmark.c [2020-06-22 02:23:28,364 INFO L221 CDTParser]: Created temporary CDT project at /export/starexec/sandbox2/tmp/5249b0c61e2f4e0898ef2a64a9240aef/FLAG38ad5036d [2020-06-22 02:23:28,716 INFO L307 CDTParser]: Found 1 translation units. [2020-06-22 02:23:28,717 INFO L161 CDTParser]: Scanning /export/starexec/sandbox2/benchmark/theBenchmark.c [2020-06-22 02:23:28,723 INFO L355 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox2/tmp/5249b0c61e2f4e0898ef2a64a9240aef/FLAG38ad5036d [2020-06-22 02:23:29,111 INFO L363 CDTParser]: Successfully deleted /export/starexec/sandbox2/tmp/5249b0c61e2f4e0898ef2a64a9240aef [2020-06-22 02:23:29,122 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-06-22 02:23:29,124 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. [2020-06-22 02:23:29,125 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-06-22 02:23:29,125 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-06-22 02:23:29,129 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2020-06-22 02:23:29,129 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.06 02:23:29" (1/1) ... [2020-06-22 02:23:29,133 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b490737 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 02:23:29, skipping insertion in model container [2020-06-22 02:23:29,133 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.06 02:23:29" (1/1) ... [2020-06-22 02:23:29,141 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-06-22 02:23:29,157 INFO L176 MainTranslator]: Built tables and reachable declarations [2020-06-22 02:23:29,308 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-06-22 02:23:29,313 INFO L191 MainTranslator]: Completed pre-run [2020-06-22 02:23:29,384 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-06-22 02:23:29,399 INFO L195 MainTranslator]: Completed translation [2020-06-22 02:23:29,399 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 02:23:29 WrapperNode [2020-06-22 02:23:29,399 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-06-22 02:23:29,400 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-06-22 02:23:29,400 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-06-22 02:23:29,401 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2020-06-22 02:23:29,410 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 02:23:29" (1/1) ... [2020-06-22 02:23:29,415 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 02:23:29" (1/1) ... [2020-06-22 02:23:29,434 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-06-22 02:23:29,434 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-06-22 02:23:29,435 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-06-22 02:23:29,435 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2020-06-22 02:23:29,444 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 02:23:29" (1/1) ... [2020-06-22 02:23:29,444 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 02:23:29" (1/1) ... [2020-06-22 02:23:29,445 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 02:23:29" (1/1) ... [2020-06-22 02:23:29,445 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 02:23:29" (1/1) ... [2020-06-22 02:23:29,447 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 02:23:29" (1/1) ... [2020-06-22 02:23:29,451 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 02:23:29" (1/1) ... [2020-06-22 02:23:29,452 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 02:23:29" (1/1) ... [2020-06-22 02:23:29,453 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-06-22 02:23:29,454 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-06-22 02:23:29,454 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-06-22 02:23:29,454 INFO L276 PluginConnector]: RCFGBuilder initialized [2020-06-22 02:23:29,455 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 02:23:29" (1/1) ... No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-06-22 02:23:29,520 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-06-22 02:23:29,520 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-06-22 02:23:29,645 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-06-22 02:23:29,646 INFO L286 CfgBuilder]: Removed 6 assue(true) statements. [2020-06-22 02:23:29,647 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 02:23:29 BoogieIcfgContainer [2020-06-22 02:23:29,647 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-06-22 02:23:29,647 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- [2020-06-22 02:23:29,648 INFO L271 PluginConnector]: Initializing BlockEncodingV2... [2020-06-22 02:23:29,650 INFO L276 PluginConnector]: BlockEncodingV2 initialized [2020-06-22 02:23:29,650 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 02:23:29" (1/1) ... [2020-06-22 02:23:29,664 INFO L313 BlockEncoder]: Initial Icfg 8 locations, 11 edges [2020-06-22 02:23:29,665 INFO L258 BlockEncoder]: Using Remove infeasible edges [2020-06-22 02:23:29,666 INFO L263 BlockEncoder]: Using Maximize final states [2020-06-22 02:23:29,667 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false [2020-06-22 02:23:29,667 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE [2020-06-22 02:23:29,669 INFO L296 BlockEncoder]: Using Remove sink states [2020-06-22 02:23:29,670 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true [2020-06-22 02:23:29,670 INFO L179 BlockEncoder]: Using Rewrite not-equals [2020-06-22 02:23:29,684 INFO L185 BlockEncoder]: Using Use SBE [2020-06-22 02:23:29,691 INFO L200 BlockEncoder]: SBE split 0 edges [2020-06-22 02:23:29,696 INFO L70 emoveInfeasibleEdges]: Removed 2 edges and 0 locations because of local infeasibility [2020-06-22 02:23:29,698 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-06-22 02:23:29,712 INFO L100 BaseMinimizeStates]: Removed 8 edges and 4 locations by large block encoding [2020-06-22 02:23:29,714 INFO L70 RemoveSinkStates]: Removed 1 edges and 1 locations by removing sink states [2020-06-22 02:23:29,715 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-06-22 02:23:29,715 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-06-22 02:23:29,716 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding [2020-06-22 02:23:29,716 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states [2020-06-22 02:23:29,716 INFO L313 BlockEncoder]: Encoded RCFG 3 locations, 4 edges [2020-06-22 02:23:29,717 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 02:23:29 BasicIcfg [2020-06-22 02:23:29,717 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- [2020-06-22 02:23:29,718 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-06-22 02:23:29,718 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-06-22 02:23:29,721 INFO L276 PluginConnector]: TraceAbstraction initialized [2020-06-22 02:23:29,721 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.06 02:23:29" (1/4) ... [2020-06-22 02:23:29,722 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bca3fc6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 02:23:29, skipping insertion in model container [2020-06-22 02:23:29,722 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 02:23:29" (2/4) ... [2020-06-22 02:23:29,722 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bca3fc6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 02:23:29, skipping insertion in model container [2020-06-22 02:23:29,723 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 02:23:29" (3/4) ... [2020-06-22 02:23:29,723 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bca3fc6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 02:23:29, skipping insertion in model container [2020-06-22 02:23:29,723 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 02:23:29" (4/4) ... [2020-06-22 02:23:29,725 INFO L112 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-06-22 02:23:29,734 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2020-06-22 02:23:29,742 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 0 error locations. [2020-06-22 02:23:29,759 INFO L257 AbstractCegarLoop]: Starting to check reachability of 0 error locations. [2020-06-22 02:23:29,787 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2020-06-22 02:23:29,788 INFO L382 AbstractCegarLoop]: Interprodecural is true [2020-06-22 02:23:29,788 INFO L383 AbstractCegarLoop]: Hoare is true [2020-06-22 02:23:29,788 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2020-06-22 02:23:29,788 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-06-22 02:23:29,788 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-06-22 02:23:29,789 INFO L387 AbstractCegarLoop]: Difference is false [2020-06-22 02:23:29,789 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-06-22 02:23:29,789 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-06-22 02:23:29,803 INFO L276 IsEmpty]: Start isEmpty. Operand 3 states. [2020-06-22 02:23:29,809 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-06-22 02:23:29,812 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 3 states. [2020-06-22 02:23:29,862 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-06-22 02:23:29,862 INFO L451 ceAbstractionStarter]: At program point L12-2(lines 12 16) the Hoare annotation is: true [2020-06-22 02:23:29,862 INFO L451 ceAbstractionStarter]: At program point L10-2(lines 10 18) the Hoare annotation is: true [2020-06-22 02:23:29,870 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 02:23:29 BasicIcfg [2020-06-22 02:23:29,871 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-06-22 02:23:29,871 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-06-22 02:23:29,871 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-06-22 02:23:29,875 INFO L276 PluginConnector]: BuchiAutomizer initialized [2020-06-22 02:23:29,876 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 02:23:29,876 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.06 02:23:29" (1/5) ... [2020-06-22 02:23:29,876 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@198c00b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.06 02:23:29, skipping insertion in model container [2020-06-22 02:23:29,877 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 02:23:29,877 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 02:23:29" (2/5) ... [2020-06-22 02:23:29,877 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@198c00b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.06 02:23:29, skipping insertion in model container [2020-06-22 02:23:29,877 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 02:23:29,877 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 02:23:29" (3/5) ... [2020-06-22 02:23:29,878 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@198c00b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 02:23:29, skipping insertion in model container [2020-06-22 02:23:29,878 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 02:23:29,878 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 02:23:29" (4/5) ... [2020-06-22 02:23:29,879 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@198c00b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 02:23:29, skipping insertion in model container [2020-06-22 02:23:29,879 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 02:23:29,879 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 02:23:29" (5/5) ... [2020-06-22 02:23:29,881 INFO L375 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-06-22 02:23:29,909 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2020-06-22 02:23:29,909 INFO L374 BuchiCegarLoop]: Interprodecural is true [2020-06-22 02:23:29,909 INFO L375 BuchiCegarLoop]: Hoare is true [2020-06-22 02:23:29,909 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-06-22 02:23:29,909 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-06-22 02:23:29,909 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-06-22 02:23:29,910 INFO L379 BuchiCegarLoop]: Difference is false [2020-06-22 02:23:29,910 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-06-22 02:23:29,910 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-06-22 02:23:29,913 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. [2020-06-22 02:23:29,930 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-06-22 02:23:29,930 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 02:23:29,930 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 02:23:29,936 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] [2020-06-22 02:23:29,936 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-06-22 02:23:29,936 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2020-06-22 02:23:29,936 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. [2020-06-22 02:23:29,937 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-06-22 02:23:29,937 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 02:23:29,937 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 02:23:29,937 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] [2020-06-22 02:23:29,938 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-06-22 02:23:29,943 INFO L794 eck$LassoCheckResult]: Stem: 4#ULTIMATE.startENTRYtrue [34] ULTIMATE.startENTRY-->L10-2: 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_~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] 5#L10-2true [2020-06-22 02:23:29,943 INFO L796 eck$LassoCheckResult]: Loop: 5#L10-2true [38] L10-2-->L12-2: 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] 3#L12-2true [45] L12-2-->L10-2: Formula: (and (<= 12 v_ULTIMATE.start_main_~j~0_9) (= (+ 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_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 5#L10-2true [2020-06-22 02:23:29,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 02:23:29,949 INFO L82 PathProgramCache]: Analyzing trace with hash 65, now seen corresponding path program 1 times [2020-06-22 02:23:29,951 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 02:23:29,952 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 02:23:29,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:23:29,980 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 02:23:29,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:23:29,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 02:23:30,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 02:23:30,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 02:23:30,020 INFO L82 PathProgramCache]: Analyzing trace with hash 2184, now seen corresponding path program 1 times [2020-06-22 02:23:30,020 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 02:23:30,020 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 02:23:30,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:23:30,022 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 02:23:30,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:23:30,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 02:23:30,069 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 02:23:30,071 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 02:23:30,072 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-06-22 02:23:30,077 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-06-22 02:23:30,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 02:23:30,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 02:23:30,093 INFO L87 Difference]: Start difference. First operand 3 states. Second operand 3 states. [2020-06-22 02:23:30,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 02:23:30,111 INFO L93 Difference]: Finished difference Result 4 states and 5 transitions. [2020-06-22 02:23:30,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 02:23:30,115 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 4 states and 5 transitions. [2020-06-22 02:23:30,115 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-06-22 02:23:30,119 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 4 states to 4 states and 5 transitions. [2020-06-22 02:23:30,120 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4 [2020-06-22 02:23:30,120 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4 [2020-06-22 02:23:30,121 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 5 transitions. [2020-06-22 02:23:30,121 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 02:23:30,121 INFO L706 BuchiCegarLoop]: Abstraction has 4 states and 5 transitions. [2020-06-22 02:23:30,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4 states and 5 transitions. [2020-06-22 02:23:30,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4 to 4. [2020-06-22 02:23:30,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-06-22 02:23:30,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 5 transitions. [2020-06-22 02:23:30,151 INFO L729 BuchiCegarLoop]: Abstraction has 4 states and 5 transitions. [2020-06-22 02:23:30,151 INFO L609 BuchiCegarLoop]: Abstraction has 4 states and 5 transitions. [2020-06-22 02:23:30,151 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2020-06-22 02:23:30,151 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4 states and 5 transitions. [2020-06-22 02:23:30,152 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-06-22 02:23:30,152 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 02:23:30,152 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 02:23:30,152 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] [2020-06-22 02:23:30,152 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-06-22 02:23:30,153 INFO L794 eck$LassoCheckResult]: Stem: 18#ULTIMATE.startENTRY [34] ULTIMATE.startENTRY-->L10-2: 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_~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] 19#L10-2 [2020-06-22 02:23:30,153 INFO L796 eck$LassoCheckResult]: Loop: 19#L10-2 [38] L10-2-->L12-2: 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] 16#L12-2 [33] L12-2-->L12-2: Formula: (and (= v_ULTIMATE.start_main_~c~0_6 (+ v_ULTIMATE.start_main_~c~0_7 1)) (< v_ULTIMATE.start_main_~j~0_7 12) (= (+ v_ULTIMATE.start_main_~j~0_7 1) v_ULTIMATE.start_main_~j~0_5)) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_6, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_5} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0, ULTIMATE.start_main_~c~0] 17#L12-2 [45] L12-2-->L10-2: Formula: (and (<= 12 v_ULTIMATE.start_main_~j~0_9) (= (+ 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_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 19#L10-2 [2020-06-22 02:23:30,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 02:23:30,154 INFO L82 PathProgramCache]: Analyzing trace with hash 65, now seen corresponding path program 2 times [2020-06-22 02:23:30,154 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 02:23:30,154 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 02:23:30,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:23:30,156 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 02:23:30,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:23:30,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 02:23:30,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 02:23:30,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 02:23:30,160 INFO L82 PathProgramCache]: Analyzing trace with hash 67377, now seen corresponding path program 1 times [2020-06-22 02:23:30,160 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 02:23:30,160 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 02:23:30,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:23:30,162 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 02:23:30,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:23:30,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 02:23:30,186 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 02:23:30,186 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 02:23:30,187 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2020-06-22 02:23:30,201 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 02:23:30,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 02:23:30,216 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 3 conjunts are in the unsatisfiable core [2020-06-22 02:23:30,217 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 02:23:30,231 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 02:23:30,258 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-06-22 02:23:30,259 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2] total 2 [2020-06-22 02:23:30,259 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-06-22 02:23:30,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-06-22 02:23:30,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-06-22 02:23:30,260 INFO L87 Difference]: Start difference. First operand 4 states and 5 transitions. cyclomatic complexity: 2 Second operand 4 states. [2020-06-22 02:23:30,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 02:23:30,281 INFO L93 Difference]: Finished difference Result 5 states and 6 transitions. [2020-06-22 02:23:30,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-06-22 02:23:30,282 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 5 states and 6 transitions. [2020-06-22 02:23:30,283 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-06-22 02:23:30,283 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 5 states to 5 states and 6 transitions. [2020-06-22 02:23:30,283 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2020-06-22 02:23:30,283 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2020-06-22 02:23:30,283 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 6 transitions. [2020-06-22 02:23:30,284 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 02:23:30,284 INFO L706 BuchiCegarLoop]: Abstraction has 5 states and 6 transitions. [2020-06-22 02:23:30,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states and 6 transitions. [2020-06-22 02:23:30,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2020-06-22 02:23:30,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-06-22 02:23:30,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 6 transitions. [2020-06-22 02:23:30,285 INFO L729 BuchiCegarLoop]: Abstraction has 5 states and 6 transitions. [2020-06-22 02:23:30,285 INFO L609 BuchiCegarLoop]: Abstraction has 5 states and 6 transitions. [2020-06-22 02:23:30,285 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2020-06-22 02:23:30,285 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5 states and 6 transitions. [2020-06-22 02:23:30,286 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-06-22 02:23:30,286 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 02:23:30,286 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 02:23:30,286 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] [2020-06-22 02:23:30,286 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1] [2020-06-22 02:23:30,287 INFO L794 eck$LassoCheckResult]: Stem: 40#ULTIMATE.startENTRY [34] ULTIMATE.startENTRY-->L10-2: 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_~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] 41#L10-2 [2020-06-22 02:23:30,287 INFO L796 eck$LassoCheckResult]: Loop: 41#L10-2 [38] L10-2-->L12-2: 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] 38#L12-2 [33] L12-2-->L12-2: Formula: (and (= v_ULTIMATE.start_main_~c~0_6 (+ v_ULTIMATE.start_main_~c~0_7 1)) (< v_ULTIMATE.start_main_~j~0_7 12) (= (+ v_ULTIMATE.start_main_~j~0_7 1) v_ULTIMATE.start_main_~j~0_5)) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_6, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_5} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0, ULTIMATE.start_main_~c~0] 39#L12-2 [33] L12-2-->L12-2: Formula: (and (= v_ULTIMATE.start_main_~c~0_6 (+ v_ULTIMATE.start_main_~c~0_7 1)) (< v_ULTIMATE.start_main_~j~0_7 12) (= (+ v_ULTIMATE.start_main_~j~0_7 1) v_ULTIMATE.start_main_~j~0_5)) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_6, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_5} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0, ULTIMATE.start_main_~c~0] 42#L12-2 [45] L12-2-->L10-2: Formula: (and (<= 12 v_ULTIMATE.start_main_~j~0_9) (= (+ 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_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 41#L10-2 [2020-06-22 02:23:30,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 02:23:30,288 INFO L82 PathProgramCache]: Analyzing trace with hash 65, now seen corresponding path program 3 times [2020-06-22 02:23:30,288 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 02:23:30,288 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 02:23:30,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:23:30,289 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 02:23:30,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:23:30,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 02:23:30,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 02:23:30,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 02:23:30,294 INFO L82 PathProgramCache]: Analyzing trace with hash 2088360, now seen corresponding path program 2 times [2020-06-22 02:23:30,294 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 02:23:30,294 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 02:23:30,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:23:30,295 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 02:23:30,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:23:30,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 02:23:30,327 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 02:23:30,327 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 02:23:30,327 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2020-06-22 02:23:30,339 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2020-06-22 02:23:30,348 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-06-22 02:23:30,348 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-06-22 02:23:30,348 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 02:23:30,349 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 02:23:30,352 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 02:23:30,378 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-06-22 02:23:30,379 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 3 [2020-06-22 02:23:30,379 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-06-22 02:23:30,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-06-22 02:23:30,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-06-22 02:23:30,380 INFO L87 Difference]: Start difference. First operand 5 states and 6 transitions. cyclomatic complexity: 2 Second operand 5 states. [2020-06-22 02:23:30,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 02:23:30,397 INFO L93 Difference]: Finished difference Result 6 states and 7 transitions. [2020-06-22 02:23:30,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-06-22 02:23:30,398 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 6 states and 7 transitions. [2020-06-22 02:23:30,399 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-06-22 02:23:30,399 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 6 states to 6 states and 7 transitions. [2020-06-22 02:23:30,399 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2020-06-22 02:23:30,400 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2020-06-22 02:23:30,400 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 7 transitions. [2020-06-22 02:23:30,400 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 02:23:30,400 INFO L706 BuchiCegarLoop]: Abstraction has 6 states and 7 transitions. [2020-06-22 02:23:30,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states and 7 transitions. [2020-06-22 02:23:30,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2020-06-22 02:23:30,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-06-22 02:23:30,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 7 transitions. [2020-06-22 02:23:30,401 INFO L729 BuchiCegarLoop]: Abstraction has 6 states and 7 transitions. [2020-06-22 02:23:30,402 INFO L609 BuchiCegarLoop]: Abstraction has 6 states and 7 transitions. [2020-06-22 02:23:30,402 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2020-06-22 02:23:30,402 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6 states and 7 transitions. [2020-06-22 02:23:30,402 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-06-22 02:23:30,402 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 02:23:30,402 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 02:23:30,403 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] [2020-06-22 02:23:30,403 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [3, 1, 1] [2020-06-22 02:23:30,403 INFO L794 eck$LassoCheckResult]: Stem: 68#ULTIMATE.startENTRY [34] ULTIMATE.startENTRY-->L10-2: 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_~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] 69#L10-2 [2020-06-22 02:23:30,404 INFO L796 eck$LassoCheckResult]: Loop: 69#L10-2 [38] L10-2-->L12-2: 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] 66#L12-2 [33] L12-2-->L12-2: Formula: (and (= v_ULTIMATE.start_main_~c~0_6 (+ v_ULTIMATE.start_main_~c~0_7 1)) (< v_ULTIMATE.start_main_~j~0_7 12) (= (+ v_ULTIMATE.start_main_~j~0_7 1) v_ULTIMATE.start_main_~j~0_5)) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_6, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_5} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0, ULTIMATE.start_main_~c~0] 67#L12-2 [33] L12-2-->L12-2: Formula: (and (= v_ULTIMATE.start_main_~c~0_6 (+ v_ULTIMATE.start_main_~c~0_7 1)) (< v_ULTIMATE.start_main_~j~0_7 12) (= (+ v_ULTIMATE.start_main_~j~0_7 1) v_ULTIMATE.start_main_~j~0_5)) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_6, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_5} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0, ULTIMATE.start_main_~c~0] 71#L12-2 [33] L12-2-->L12-2: Formula: (and (= v_ULTIMATE.start_main_~c~0_6 (+ v_ULTIMATE.start_main_~c~0_7 1)) (< v_ULTIMATE.start_main_~j~0_7 12) (= (+ v_ULTIMATE.start_main_~j~0_7 1) v_ULTIMATE.start_main_~j~0_5)) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_6, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_5} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0, ULTIMATE.start_main_~c~0] 70#L12-2 [45] L12-2-->L10-2: Formula: (and (<= 12 v_ULTIMATE.start_main_~j~0_9) (= (+ 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_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 69#L10-2 [2020-06-22 02:23:30,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 02:23:30,404 INFO L82 PathProgramCache]: Analyzing trace with hash 65, now seen corresponding path program 4 times [2020-06-22 02:23:30,404 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 02:23:30,404 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 02:23:30,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:23:30,406 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 02:23:30,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:23:30,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 02:23:30,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 02:23:30,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 02:23:30,410 INFO L82 PathProgramCache]: Analyzing trace with hash 64738833, now seen corresponding path program 3 times [2020-06-22 02:23:30,410 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 02:23:30,410 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 02:23:30,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:23:30,411 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 02:23:30,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:23:30,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 02:23:30,458 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 02:23:30,458 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 02:23:30,459 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2020-06-22 02:23:30,472 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2020-06-22 02:23:30,491 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2020-06-22 02:23:30,491 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-06-22 02:23:30,492 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 5 conjunts are in the unsatisfiable core [2020-06-22 02:23:30,492 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 02:23:30,496 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 02:23:30,522 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-06-22 02:23:30,523 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2020-06-22 02:23:30,523 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-06-22 02:23:30,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-06-22 02:23:30,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2020-06-22 02:23:30,524 INFO L87 Difference]: Start difference. First operand 6 states and 7 transitions. cyclomatic complexity: 2 Second operand 6 states. [2020-06-22 02:23:30,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 02:23:30,536 INFO L93 Difference]: Finished difference Result 7 states and 8 transitions. [2020-06-22 02:23:30,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-06-22 02:23:30,537 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 7 states and 8 transitions. [2020-06-22 02:23:30,538 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2020-06-22 02:23:30,538 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 7 states to 7 states and 8 transitions. [2020-06-22 02:23:30,538 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2020-06-22 02:23:30,538 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2020-06-22 02:23:30,539 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 8 transitions. [2020-06-22 02:23:30,539 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 02:23:30,539 INFO L706 BuchiCegarLoop]: Abstraction has 7 states and 8 transitions. [2020-06-22 02:23:30,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states and 8 transitions. [2020-06-22 02:23:30,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2020-06-22 02:23:30,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-06-22 02:23:30,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 8 transitions. [2020-06-22 02:23:30,540 INFO L729 BuchiCegarLoop]: Abstraction has 7 states and 8 transitions. [2020-06-22 02:23:30,540 INFO L609 BuchiCegarLoop]: Abstraction has 7 states and 8 transitions. [2020-06-22 02:23:30,540 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2020-06-22 02:23:30,541 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 8 transitions. [2020-06-22 02:23:30,541 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2020-06-22 02:23:30,541 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 02:23:30,541 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 02:23:30,542 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] [2020-06-22 02:23:30,542 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [4, 1, 1] [2020-06-22 02:23:30,542 INFO L794 eck$LassoCheckResult]: Stem: 102#ULTIMATE.startENTRY [34] ULTIMATE.startENTRY-->L10-2: 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_~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] 103#L10-2 [2020-06-22 02:23:30,542 INFO L796 eck$LassoCheckResult]: Loop: 103#L10-2 [38] L10-2-->L12-2: 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] 100#L12-2 [33] L12-2-->L12-2: Formula: (and (= v_ULTIMATE.start_main_~c~0_6 (+ v_ULTIMATE.start_main_~c~0_7 1)) (< v_ULTIMATE.start_main_~j~0_7 12) (= (+ v_ULTIMATE.start_main_~j~0_7 1) v_ULTIMATE.start_main_~j~0_5)) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_6, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_5} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0, ULTIMATE.start_main_~c~0] 101#L12-2 [33] L12-2-->L12-2: Formula: (and (= v_ULTIMATE.start_main_~c~0_6 (+ v_ULTIMATE.start_main_~c~0_7 1)) (< v_ULTIMATE.start_main_~j~0_7 12) (= (+ v_ULTIMATE.start_main_~j~0_7 1) v_ULTIMATE.start_main_~j~0_5)) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_6, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_5} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0, ULTIMATE.start_main_~c~0] 106#L12-2 [33] L12-2-->L12-2: Formula: (and (= v_ULTIMATE.start_main_~c~0_6 (+ v_ULTIMATE.start_main_~c~0_7 1)) (< v_ULTIMATE.start_main_~j~0_7 12) (= (+ v_ULTIMATE.start_main_~j~0_7 1) v_ULTIMATE.start_main_~j~0_5)) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_6, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_5} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0, ULTIMATE.start_main_~c~0] 105#L12-2 [33] L12-2-->L12-2: Formula: (and (= v_ULTIMATE.start_main_~c~0_6 (+ v_ULTIMATE.start_main_~c~0_7 1)) (< v_ULTIMATE.start_main_~j~0_7 12) (= (+ v_ULTIMATE.start_main_~j~0_7 1) v_ULTIMATE.start_main_~j~0_5)) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_6, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_5} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0, ULTIMATE.start_main_~c~0] 104#L12-2 [45] L12-2-->L10-2: Formula: (and (<= 12 v_ULTIMATE.start_main_~j~0_9) (= (+ 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_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 103#L10-2 [2020-06-22 02:23:30,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 02:23:30,543 INFO L82 PathProgramCache]: Analyzing trace with hash 65, now seen corresponding path program 5 times [2020-06-22 02:23:30,543 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 02:23:30,543 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 02:23:30,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:23:30,545 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 02:23:30,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:23:30,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 02:23:30,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 02:23:30,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 02:23:30,548 INFO L82 PathProgramCache]: Analyzing trace with hash 2006903496, now seen corresponding path program 4 times [2020-06-22 02:23:30,549 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 02:23:30,549 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 02:23:30,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:23:30,550 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 02:23:30,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:23:30,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 02:23:30,606 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 02:23:30,606 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 02:23:30,606 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2020-06-22 02:23:30,623 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2020-06-22 02:23:30,637 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-06-22 02:23:30,638 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-06-22 02:23:30,638 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 6 conjunts are in the unsatisfiable core [2020-06-22 02:23:30,639 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 02:23:30,644 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 02:23:30,670 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-06-22 02:23:30,671 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2020-06-22 02:23:30,671 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-06-22 02:23:30,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-06-22 02:23:30,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2020-06-22 02:23:30,672 INFO L87 Difference]: Start difference. First operand 7 states and 8 transitions. cyclomatic complexity: 2 Second operand 7 states. [2020-06-22 02:23:30,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 02:23:30,700 INFO L93 Difference]: Finished difference Result 8 states and 9 transitions. [2020-06-22 02:23:30,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-06-22 02:23:30,701 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 8 states and 9 transitions. [2020-06-22 02:23:30,702 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2020-06-22 02:23:30,702 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 8 states to 8 states and 9 transitions. [2020-06-22 02:23:30,702 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2020-06-22 02:23:30,703 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2020-06-22 02:23:30,703 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 9 transitions. [2020-06-22 02:23:30,703 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 02:23:30,703 INFO L706 BuchiCegarLoop]: Abstraction has 8 states and 9 transitions. [2020-06-22 02:23:30,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states and 9 transitions. [2020-06-22 02:23:30,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2020-06-22 02:23:30,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-06-22 02:23:30,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 9 transitions. [2020-06-22 02:23:30,704 INFO L729 BuchiCegarLoop]: Abstraction has 8 states and 9 transitions. [2020-06-22 02:23:30,705 INFO L609 BuchiCegarLoop]: Abstraction has 8 states and 9 transitions. [2020-06-22 02:23:30,705 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2020-06-22 02:23:30,705 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 9 transitions. [2020-06-22 02:23:30,705 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2020-06-22 02:23:30,705 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 02:23:30,705 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 02:23:30,706 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] [2020-06-22 02:23:30,706 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [5, 1, 1] [2020-06-22 02:23:30,706 INFO L794 eck$LassoCheckResult]: Stem: 142#ULTIMATE.startENTRY [34] ULTIMATE.startENTRY-->L10-2: 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_~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] 143#L10-2 [2020-06-22 02:23:30,707 INFO L796 eck$LassoCheckResult]: Loop: 143#L10-2 [38] L10-2-->L12-2: 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] 140#L12-2 [33] L12-2-->L12-2: Formula: (and (= v_ULTIMATE.start_main_~c~0_6 (+ v_ULTIMATE.start_main_~c~0_7 1)) (< v_ULTIMATE.start_main_~j~0_7 12) (= (+ v_ULTIMATE.start_main_~j~0_7 1) v_ULTIMATE.start_main_~j~0_5)) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_6, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_5} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0, ULTIMATE.start_main_~c~0] 141#L12-2 [33] L12-2-->L12-2: Formula: (and (= v_ULTIMATE.start_main_~c~0_6 (+ v_ULTIMATE.start_main_~c~0_7 1)) (< v_ULTIMATE.start_main_~j~0_7 12) (= (+ v_ULTIMATE.start_main_~j~0_7 1) v_ULTIMATE.start_main_~j~0_5)) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_6, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_5} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0, ULTIMATE.start_main_~c~0] 147#L12-2 [33] L12-2-->L12-2: Formula: (and (= v_ULTIMATE.start_main_~c~0_6 (+ v_ULTIMATE.start_main_~c~0_7 1)) (< v_ULTIMATE.start_main_~j~0_7 12) (= (+ v_ULTIMATE.start_main_~j~0_7 1) v_ULTIMATE.start_main_~j~0_5)) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_6, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_5} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0, ULTIMATE.start_main_~c~0] 146#L12-2 [33] L12-2-->L12-2: Formula: (and (= v_ULTIMATE.start_main_~c~0_6 (+ v_ULTIMATE.start_main_~c~0_7 1)) (< v_ULTIMATE.start_main_~j~0_7 12) (= (+ v_ULTIMATE.start_main_~j~0_7 1) v_ULTIMATE.start_main_~j~0_5)) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_6, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_5} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0, ULTIMATE.start_main_~c~0] 145#L12-2 [33] L12-2-->L12-2: Formula: (and (= v_ULTIMATE.start_main_~c~0_6 (+ v_ULTIMATE.start_main_~c~0_7 1)) (< v_ULTIMATE.start_main_~j~0_7 12) (= (+ v_ULTIMATE.start_main_~j~0_7 1) v_ULTIMATE.start_main_~j~0_5)) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_6, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_5} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0, ULTIMATE.start_main_~c~0] 144#L12-2 [45] L12-2-->L10-2: Formula: (and (<= 12 v_ULTIMATE.start_main_~j~0_9) (= (+ 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_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 143#L10-2 [2020-06-22 02:23:30,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 02:23:30,707 INFO L82 PathProgramCache]: Analyzing trace with hash 65, now seen corresponding path program 6 times [2020-06-22 02:23:30,707 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 02:23:30,707 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 02:23:30,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:23:30,709 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 02:23:30,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:23:30,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 02:23:30,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 02:23:30,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 02:23:30,712 INFO L82 PathProgramCache]: Analyzing trace with hash 2084465905, now seen corresponding path program 5 times [2020-06-22 02:23:30,712 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 02:23:30,713 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 02:23:30,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:23:30,714 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 02:23:30,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:23:30,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 02:23:30,771 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 02:23:30,771 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 02:23:30,771 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2020-06-22 02:23:30,783 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2020-06-22 02:23:30,794 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2020-06-22 02:23:30,794 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-06-22 02:23:30,795 INFO L256 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 7 conjunts are in the unsatisfiable core [2020-06-22 02:23:30,795 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 02:23:30,801 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 02:23:30,827 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-06-22 02:23:30,827 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2020-06-22 02:23:30,827 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-06-22 02:23:30,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-06-22 02:23:30,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2020-06-22 02:23:30,828 INFO L87 Difference]: Start difference. First operand 8 states and 9 transitions. cyclomatic complexity: 2 Second operand 8 states. [2020-06-22 02:23:30,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 02:23:30,849 INFO L93 Difference]: Finished difference Result 9 states and 10 transitions. [2020-06-22 02:23:30,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-06-22 02:23:30,849 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 9 states and 10 transitions. [2020-06-22 02:23:30,850 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2020-06-22 02:23:30,850 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 9 states to 9 states and 10 transitions. [2020-06-22 02:23:30,850 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2020-06-22 02:23:30,851 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2020-06-22 02:23:30,851 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 10 transitions. [2020-06-22 02:23:30,851 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 02:23:30,851 INFO L706 BuchiCegarLoop]: Abstraction has 9 states and 10 transitions. [2020-06-22 02:23:30,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 10 transitions. [2020-06-22 02:23:30,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2020-06-22 02:23:30,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-06-22 02:23:30,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2020-06-22 02:23:30,853 INFO L729 BuchiCegarLoop]: Abstraction has 9 states and 10 transitions. [2020-06-22 02:23:30,853 INFO L609 BuchiCegarLoop]: Abstraction has 9 states and 10 transitions. [2020-06-22 02:23:30,853 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2020-06-22 02:23:30,853 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 10 transitions. [2020-06-22 02:23:30,853 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2020-06-22 02:23:30,853 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 02:23:30,854 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 02:23:30,854 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] [2020-06-22 02:23:30,854 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [6, 1, 1] [2020-06-22 02:23:30,854 INFO L794 eck$LassoCheckResult]: Stem: 188#ULTIMATE.startENTRY [34] ULTIMATE.startENTRY-->L10-2: 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_~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] 189#L10-2 [2020-06-22 02:23:30,855 INFO L796 eck$LassoCheckResult]: Loop: 189#L10-2 [38] L10-2-->L12-2: 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] 186#L12-2 [33] L12-2-->L12-2: Formula: (and (= v_ULTIMATE.start_main_~c~0_6 (+ v_ULTIMATE.start_main_~c~0_7 1)) (< v_ULTIMATE.start_main_~j~0_7 12) (= (+ v_ULTIMATE.start_main_~j~0_7 1) v_ULTIMATE.start_main_~j~0_5)) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_6, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_5} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0, ULTIMATE.start_main_~c~0] 187#L12-2 [33] L12-2-->L12-2: Formula: (and (= v_ULTIMATE.start_main_~c~0_6 (+ v_ULTIMATE.start_main_~c~0_7 1)) (< v_ULTIMATE.start_main_~j~0_7 12) (= (+ v_ULTIMATE.start_main_~j~0_7 1) v_ULTIMATE.start_main_~j~0_5)) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_6, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_5} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0, ULTIMATE.start_main_~c~0] 194#L12-2 [33] L12-2-->L12-2: Formula: (and (= v_ULTIMATE.start_main_~c~0_6 (+ v_ULTIMATE.start_main_~c~0_7 1)) (< v_ULTIMATE.start_main_~j~0_7 12) (= (+ v_ULTIMATE.start_main_~j~0_7 1) v_ULTIMATE.start_main_~j~0_5)) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_6, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_5} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0, ULTIMATE.start_main_~c~0] 193#L12-2 [33] L12-2-->L12-2: Formula: (and (= v_ULTIMATE.start_main_~c~0_6 (+ v_ULTIMATE.start_main_~c~0_7 1)) (< v_ULTIMATE.start_main_~j~0_7 12) (= (+ v_ULTIMATE.start_main_~j~0_7 1) v_ULTIMATE.start_main_~j~0_5)) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_6, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_5} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0, ULTIMATE.start_main_~c~0] 192#L12-2 [33] L12-2-->L12-2: Formula: (and (= v_ULTIMATE.start_main_~c~0_6 (+ v_ULTIMATE.start_main_~c~0_7 1)) (< v_ULTIMATE.start_main_~j~0_7 12) (= (+ v_ULTIMATE.start_main_~j~0_7 1) v_ULTIMATE.start_main_~j~0_5)) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_6, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_5} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0, ULTIMATE.start_main_~c~0] 191#L12-2 [33] L12-2-->L12-2: Formula: (and (= v_ULTIMATE.start_main_~c~0_6 (+ v_ULTIMATE.start_main_~c~0_7 1)) (< v_ULTIMATE.start_main_~j~0_7 12) (= (+ v_ULTIMATE.start_main_~j~0_7 1) v_ULTIMATE.start_main_~j~0_5)) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_6, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_5} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0, ULTIMATE.start_main_~c~0] 190#L12-2 [45] L12-2-->L10-2: Formula: (and (<= 12 v_ULTIMATE.start_main_~j~0_9) (= (+ 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_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 189#L10-2 [2020-06-22 02:23:30,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 02:23:30,855 INFO L82 PathProgramCache]: Analyzing trace with hash 65, now seen corresponding path program 7 times [2020-06-22 02:23:30,855 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 02:23:30,855 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 02:23:30,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:23:30,857 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 02:23:30,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:23:30,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 02:23:30,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 02:23:30,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 02:23:30,861 INFO L82 PathProgramCache]: Analyzing trace with hash 193933288, now seen corresponding path program 6 times [2020-06-22 02:23:30,861 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 02:23:30,861 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 02:23:30,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:23:30,862 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 02:23:30,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:23:30,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 02:23:30,941 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 02:23:30,941 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 02:23:30,942 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2020-06-22 02:23:30,953 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2020-06-22 02:23:30,964 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2020-06-22 02:23:30,964 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-06-22 02:23:30,965 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 02:23:30,965 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 02:23:30,971 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 02:23:30,997 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-06-22 02:23:30,998 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2020-06-22 02:23:30,998 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-06-22 02:23:30,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-06-22 02:23:30,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2020-06-22 02:23:30,999 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. cyclomatic complexity: 2 Second operand 9 states. [2020-06-22 02:23:31,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 02:23:31,022 INFO L93 Difference]: Finished difference Result 10 states and 11 transitions. [2020-06-22 02:23:31,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-06-22 02:23:31,023 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 10 states and 11 transitions. [2020-06-22 02:23:31,024 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2020-06-22 02:23:31,024 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 10 states to 10 states and 11 transitions. [2020-06-22 02:23:31,024 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2020-06-22 02:23:31,024 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2020-06-22 02:23:31,025 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 11 transitions. [2020-06-22 02:23:31,025 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 02:23:31,025 INFO L706 BuchiCegarLoop]: Abstraction has 10 states and 11 transitions. [2020-06-22 02:23:31,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 11 transitions. [2020-06-22 02:23:31,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2020-06-22 02:23:31,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-06-22 02:23:31,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 11 transitions. [2020-06-22 02:23:31,027 INFO L729 BuchiCegarLoop]: Abstraction has 10 states and 11 transitions. [2020-06-22 02:23:31,027 INFO L609 BuchiCegarLoop]: Abstraction has 10 states and 11 transitions. [2020-06-22 02:23:31,027 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2020-06-22 02:23:31,027 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 11 transitions. [2020-06-22 02:23:31,028 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2020-06-22 02:23:31,028 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 02:23:31,028 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 02:23:31,028 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] [2020-06-22 02:23:31,028 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [7, 1, 1] [2020-06-22 02:23:31,029 INFO L794 eck$LassoCheckResult]: Stem: 240#ULTIMATE.startENTRY [34] ULTIMATE.startENTRY-->L10-2: 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_~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] 241#L10-2 [2020-06-22 02:23:31,029 INFO L796 eck$LassoCheckResult]: Loop: 241#L10-2 [38] L10-2-->L12-2: 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] 238#L12-2 [33] L12-2-->L12-2: Formula: (and (= v_ULTIMATE.start_main_~c~0_6 (+ v_ULTIMATE.start_main_~c~0_7 1)) (< v_ULTIMATE.start_main_~j~0_7 12) (= (+ v_ULTIMATE.start_main_~j~0_7 1) v_ULTIMATE.start_main_~j~0_5)) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_6, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_5} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0, ULTIMATE.start_main_~c~0] 239#L12-2 [33] L12-2-->L12-2: Formula: (and (= v_ULTIMATE.start_main_~c~0_6 (+ v_ULTIMATE.start_main_~c~0_7 1)) (< v_ULTIMATE.start_main_~j~0_7 12) (= (+ v_ULTIMATE.start_main_~j~0_7 1) v_ULTIMATE.start_main_~j~0_5)) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_6, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_5} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0, ULTIMATE.start_main_~c~0] 247#L12-2 [33] L12-2-->L12-2: Formula: (and (= v_ULTIMATE.start_main_~c~0_6 (+ v_ULTIMATE.start_main_~c~0_7 1)) (< v_ULTIMATE.start_main_~j~0_7 12) (= (+ v_ULTIMATE.start_main_~j~0_7 1) v_ULTIMATE.start_main_~j~0_5)) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_6, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_5} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0, ULTIMATE.start_main_~c~0] 246#L12-2 [33] L12-2-->L12-2: Formula: (and (= v_ULTIMATE.start_main_~c~0_6 (+ v_ULTIMATE.start_main_~c~0_7 1)) (< v_ULTIMATE.start_main_~j~0_7 12) (= (+ v_ULTIMATE.start_main_~j~0_7 1) v_ULTIMATE.start_main_~j~0_5)) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_6, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_5} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0, ULTIMATE.start_main_~c~0] 245#L12-2 [33] L12-2-->L12-2: Formula: (and (= v_ULTIMATE.start_main_~c~0_6 (+ v_ULTIMATE.start_main_~c~0_7 1)) (< v_ULTIMATE.start_main_~j~0_7 12) (= (+ v_ULTIMATE.start_main_~j~0_7 1) v_ULTIMATE.start_main_~j~0_5)) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_6, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_5} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0, ULTIMATE.start_main_~c~0] 244#L12-2 [33] L12-2-->L12-2: Formula: (and (= v_ULTIMATE.start_main_~c~0_6 (+ v_ULTIMATE.start_main_~c~0_7 1)) (< v_ULTIMATE.start_main_~j~0_7 12) (= (+ v_ULTIMATE.start_main_~j~0_7 1) v_ULTIMATE.start_main_~j~0_5)) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_6, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_5} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0, ULTIMATE.start_main_~c~0] 243#L12-2 [33] L12-2-->L12-2: Formula: (and (= v_ULTIMATE.start_main_~c~0_6 (+ v_ULTIMATE.start_main_~c~0_7 1)) (< v_ULTIMATE.start_main_~j~0_7 12) (= (+ v_ULTIMATE.start_main_~j~0_7 1) v_ULTIMATE.start_main_~j~0_5)) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_6, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_5} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0, ULTIMATE.start_main_~c~0] 242#L12-2 [45] L12-2-->L10-2: Formula: (and (<= 12 v_ULTIMATE.start_main_~j~0_9) (= (+ 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_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 241#L10-2 [2020-06-22 02:23:31,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 02:23:31,029 INFO L82 PathProgramCache]: Analyzing trace with hash 65, now seen corresponding path program 8 times [2020-06-22 02:23:31,030 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 02:23:31,030 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 02:23:31,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:23:31,031 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 02:23:31,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:23:31,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 02:23:31,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 02:23:31,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 02:23:31,034 INFO L82 PathProgramCache]: Analyzing trace with hash 1716964305, now seen corresponding path program 7 times [2020-06-22 02:23:31,034 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 02:23:31,035 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 02:23:31,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:23:31,036 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 02:23:31,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:23:31,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 02:23:31,112 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 02:23:31,112 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 02:23:31,113 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2020-06-22 02:23:31,125 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 02:23:31,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 02:23:31,137 INFO L256 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 9 conjunts are in the unsatisfiable core [2020-06-22 02:23:31,138 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 02:23:31,144 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 02:23:31,170 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-06-22 02:23:31,171 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2020-06-22 02:23:31,171 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-06-22 02:23:31,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-06-22 02:23:31,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2020-06-22 02:23:31,172 INFO L87 Difference]: Start difference. First operand 10 states and 11 transitions. cyclomatic complexity: 2 Second operand 10 states. [2020-06-22 02:23:31,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 02:23:31,194 INFO L93 Difference]: Finished difference Result 11 states and 12 transitions. [2020-06-22 02:23:31,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-06-22 02:23:31,195 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 12 transitions. [2020-06-22 02:23:31,195 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2020-06-22 02:23:31,196 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 11 states and 12 transitions. [2020-06-22 02:23:31,196 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2020-06-22 02:23:31,196 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2020-06-22 02:23:31,196 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 12 transitions. [2020-06-22 02:23:31,196 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 02:23:31,197 INFO L706 BuchiCegarLoop]: Abstraction has 11 states and 12 transitions. [2020-06-22 02:23:31,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 12 transitions. [2020-06-22 02:23:31,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2020-06-22 02:23:31,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-06-22 02:23:31,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2020-06-22 02:23:31,198 INFO L729 BuchiCegarLoop]: Abstraction has 11 states and 12 transitions. [2020-06-22 02:23:31,198 INFO L609 BuchiCegarLoop]: Abstraction has 11 states and 12 transitions. [2020-06-22 02:23:31,198 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2020-06-22 02:23:31,198 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 12 transitions. [2020-06-22 02:23:31,199 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2020-06-22 02:23:31,199 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 02:23:31,199 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 02:23:31,199 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] [2020-06-22 02:23:31,199 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [8, 1, 1] [2020-06-22 02:23:31,200 INFO L794 eck$LassoCheckResult]: Stem: 298#ULTIMATE.startENTRY [34] ULTIMATE.startENTRY-->L10-2: 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_~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] 299#L10-2 [2020-06-22 02:23:31,201 INFO L796 eck$LassoCheckResult]: Loop: 299#L10-2 [38] L10-2-->L12-2: 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] 296#L12-2 [33] L12-2-->L12-2: Formula: (and (= v_ULTIMATE.start_main_~c~0_6 (+ v_ULTIMATE.start_main_~c~0_7 1)) (< v_ULTIMATE.start_main_~j~0_7 12) (= (+ v_ULTIMATE.start_main_~j~0_7 1) v_ULTIMATE.start_main_~j~0_5)) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_6, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_5} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0, ULTIMATE.start_main_~c~0] 297#L12-2 [33] L12-2-->L12-2: Formula: (and (= v_ULTIMATE.start_main_~c~0_6 (+ v_ULTIMATE.start_main_~c~0_7 1)) (< v_ULTIMATE.start_main_~j~0_7 12) (= (+ v_ULTIMATE.start_main_~j~0_7 1) v_ULTIMATE.start_main_~j~0_5)) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_6, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_5} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0, ULTIMATE.start_main_~c~0] 306#L12-2 [33] L12-2-->L12-2: Formula: (and (= v_ULTIMATE.start_main_~c~0_6 (+ v_ULTIMATE.start_main_~c~0_7 1)) (< v_ULTIMATE.start_main_~j~0_7 12) (= (+ v_ULTIMATE.start_main_~j~0_7 1) v_ULTIMATE.start_main_~j~0_5)) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_6, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_5} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0, ULTIMATE.start_main_~c~0] 305#L12-2 [33] L12-2-->L12-2: Formula: (and (= v_ULTIMATE.start_main_~c~0_6 (+ v_ULTIMATE.start_main_~c~0_7 1)) (< v_ULTIMATE.start_main_~j~0_7 12) (= (+ v_ULTIMATE.start_main_~j~0_7 1) v_ULTIMATE.start_main_~j~0_5)) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_6, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_5} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0, ULTIMATE.start_main_~c~0] 304#L12-2 [33] L12-2-->L12-2: Formula: (and (= v_ULTIMATE.start_main_~c~0_6 (+ v_ULTIMATE.start_main_~c~0_7 1)) (< v_ULTIMATE.start_main_~j~0_7 12) (= (+ v_ULTIMATE.start_main_~j~0_7 1) v_ULTIMATE.start_main_~j~0_5)) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_6, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_5} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0, ULTIMATE.start_main_~c~0] 303#L12-2 [33] L12-2-->L12-2: Formula: (and (= v_ULTIMATE.start_main_~c~0_6 (+ v_ULTIMATE.start_main_~c~0_7 1)) (< v_ULTIMATE.start_main_~j~0_7 12) (= (+ v_ULTIMATE.start_main_~j~0_7 1) v_ULTIMATE.start_main_~j~0_5)) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_6, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_5} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0, ULTIMATE.start_main_~c~0] 302#L12-2 [33] L12-2-->L12-2: Formula: (and (= v_ULTIMATE.start_main_~c~0_6 (+ v_ULTIMATE.start_main_~c~0_7 1)) (< v_ULTIMATE.start_main_~j~0_7 12) (= (+ v_ULTIMATE.start_main_~j~0_7 1) v_ULTIMATE.start_main_~j~0_5)) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_6, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_5} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0, ULTIMATE.start_main_~c~0] 301#L12-2 [33] L12-2-->L12-2: Formula: (and (= v_ULTIMATE.start_main_~c~0_6 (+ v_ULTIMATE.start_main_~c~0_7 1)) (< v_ULTIMATE.start_main_~j~0_7 12) (= (+ v_ULTIMATE.start_main_~j~0_7 1) v_ULTIMATE.start_main_~j~0_5)) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_6, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_5} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0, ULTIMATE.start_main_~c~0] 300#L12-2 [45] L12-2-->L10-2: Formula: (and (<= 12 v_ULTIMATE.start_main_~j~0_9) (= (+ 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_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 299#L10-2 [2020-06-22 02:23:31,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 02:23:31,201 INFO L82 PathProgramCache]: Analyzing trace with hash 65, now seen corresponding path program 9 times [2020-06-22 02:23:31,201 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 02:23:31,201 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 02:23:31,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:23:31,203 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 02:23:31,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:23:31,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 02:23:31,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 02:23:31,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 02:23:31,206 INFO L82 PathProgramCache]: Analyzing trace with hash 1686285576, now seen corresponding path program 8 times [2020-06-22 02:23:31,206 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 02:23:31,206 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 02:23:31,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:23:31,207 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 02:23:31,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:23:31,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 02:23:31,305 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 02:23:31,305 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 02:23:31,305 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2020-06-22 02:23:31,316 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2020-06-22 02:23:31,327 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-06-22 02:23:31,327 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-06-22 02:23:31,328 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 10 conjunts are in the unsatisfiable core [2020-06-22 02:23:31,329 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 02:23:31,336 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 02:23:31,363 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-06-22 02:23:31,363 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2020-06-22 02:23:31,364 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-06-22 02:23:31,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-06-22 02:23:31,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2020-06-22 02:23:31,364 INFO L87 Difference]: Start difference. First operand 11 states and 12 transitions. cyclomatic complexity: 2 Second operand 11 states. [2020-06-22 02:23:31,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 02:23:31,391 INFO L93 Difference]: Finished difference Result 12 states and 13 transitions. [2020-06-22 02:23:31,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-06-22 02:23:31,392 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 13 transitions. [2020-06-22 02:23:31,393 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2020-06-22 02:23:31,393 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 12 states and 13 transitions. [2020-06-22 02:23:31,393 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2020-06-22 02:23:31,393 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2020-06-22 02:23:31,393 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 13 transitions. [2020-06-22 02:23:31,394 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 02:23:31,394 INFO L706 BuchiCegarLoop]: Abstraction has 12 states and 13 transitions. [2020-06-22 02:23:31,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 13 transitions. [2020-06-22 02:23:31,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2020-06-22 02:23:31,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-06-22 02:23:31,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 13 transitions. [2020-06-22 02:23:31,396 INFO L729 BuchiCegarLoop]: Abstraction has 12 states and 13 transitions. [2020-06-22 02:23:31,396 INFO L609 BuchiCegarLoop]: Abstraction has 12 states and 13 transitions. [2020-06-22 02:23:31,396 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2020-06-22 02:23:31,396 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 13 transitions. [2020-06-22 02:23:31,397 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2020-06-22 02:23:31,397 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 02:23:31,397 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 02:23:31,397 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] [2020-06-22 02:23:31,397 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [9, 1, 1] [2020-06-22 02:23:31,398 INFO L794 eck$LassoCheckResult]: Stem: 362#ULTIMATE.startENTRY [34] ULTIMATE.startENTRY-->L10-2: 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_~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] 363#L10-2 [2020-06-22 02:23:31,398 INFO L796 eck$LassoCheckResult]: Loop: 363#L10-2 [38] L10-2-->L12-2: 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] 360#L12-2 [33] L12-2-->L12-2: Formula: (and (= v_ULTIMATE.start_main_~c~0_6 (+ v_ULTIMATE.start_main_~c~0_7 1)) (< v_ULTIMATE.start_main_~j~0_7 12) (= (+ v_ULTIMATE.start_main_~j~0_7 1) v_ULTIMATE.start_main_~j~0_5)) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_6, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_5} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0, ULTIMATE.start_main_~c~0] 361#L12-2 [33] L12-2-->L12-2: Formula: (and (= v_ULTIMATE.start_main_~c~0_6 (+ v_ULTIMATE.start_main_~c~0_7 1)) (< v_ULTIMATE.start_main_~j~0_7 12) (= (+ v_ULTIMATE.start_main_~j~0_7 1) v_ULTIMATE.start_main_~j~0_5)) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_6, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_5} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0, ULTIMATE.start_main_~c~0] 371#L12-2 [33] L12-2-->L12-2: Formula: (and (= v_ULTIMATE.start_main_~c~0_6 (+ v_ULTIMATE.start_main_~c~0_7 1)) (< v_ULTIMATE.start_main_~j~0_7 12) (= (+ v_ULTIMATE.start_main_~j~0_7 1) v_ULTIMATE.start_main_~j~0_5)) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_6, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_5} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0, ULTIMATE.start_main_~c~0] 370#L12-2 [33] L12-2-->L12-2: Formula: (and (= v_ULTIMATE.start_main_~c~0_6 (+ v_ULTIMATE.start_main_~c~0_7 1)) (< v_ULTIMATE.start_main_~j~0_7 12) (= (+ v_ULTIMATE.start_main_~j~0_7 1) v_ULTIMATE.start_main_~j~0_5)) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_6, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_5} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0, ULTIMATE.start_main_~c~0] 369#L12-2 [33] L12-2-->L12-2: Formula: (and (= v_ULTIMATE.start_main_~c~0_6 (+ v_ULTIMATE.start_main_~c~0_7 1)) (< v_ULTIMATE.start_main_~j~0_7 12) (= (+ v_ULTIMATE.start_main_~j~0_7 1) v_ULTIMATE.start_main_~j~0_5)) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_6, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_5} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0, ULTIMATE.start_main_~c~0] 368#L12-2 [33] L12-2-->L12-2: Formula: (and (= v_ULTIMATE.start_main_~c~0_6 (+ v_ULTIMATE.start_main_~c~0_7 1)) (< v_ULTIMATE.start_main_~j~0_7 12) (= (+ v_ULTIMATE.start_main_~j~0_7 1) v_ULTIMATE.start_main_~j~0_5)) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_6, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_5} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0, ULTIMATE.start_main_~c~0] 367#L12-2 [33] L12-2-->L12-2: Formula: (and (= v_ULTIMATE.start_main_~c~0_6 (+ v_ULTIMATE.start_main_~c~0_7 1)) (< v_ULTIMATE.start_main_~j~0_7 12) (= (+ v_ULTIMATE.start_main_~j~0_7 1) v_ULTIMATE.start_main_~j~0_5)) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_6, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_5} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0, ULTIMATE.start_main_~c~0] 366#L12-2 [33] L12-2-->L12-2: Formula: (and (= v_ULTIMATE.start_main_~c~0_6 (+ v_ULTIMATE.start_main_~c~0_7 1)) (< v_ULTIMATE.start_main_~j~0_7 12) (= (+ v_ULTIMATE.start_main_~j~0_7 1) v_ULTIMATE.start_main_~j~0_5)) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_6, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_5} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0, ULTIMATE.start_main_~c~0] 365#L12-2 [33] L12-2-->L12-2: Formula: (and (= v_ULTIMATE.start_main_~c~0_6 (+ v_ULTIMATE.start_main_~c~0_7 1)) (< v_ULTIMATE.start_main_~j~0_7 12) (= (+ v_ULTIMATE.start_main_~j~0_7 1) v_ULTIMATE.start_main_~j~0_5)) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_6, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_5} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0, ULTIMATE.start_main_~c~0] 364#L12-2 [45] L12-2-->L10-2: Formula: (and (<= 12 v_ULTIMATE.start_main_~j~0_9) (= (+ 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_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 363#L10-2 [2020-06-22 02:23:31,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 02:23:31,399 INFO L82 PathProgramCache]: Analyzing trace with hash 65, now seen corresponding path program 10 times [2020-06-22 02:23:31,399 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 02:23:31,399 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 02:23:31,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:23:31,400 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 02:23:31,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:23:31,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 02:23:31,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 02:23:31,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 02:23:31,404 INFO L82 PathProgramCache]: Analyzing trace with hash 735244977, now seen corresponding path program 9 times [2020-06-22 02:23:31,404 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 02:23:31,404 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 02:23:31,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:23:31,405 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 02:23:31,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:23:31,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 02:23:31,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 02:23:31,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 02:23:31,425 INFO L82 PathProgramCache]: Analyzing trace with hash 406604401, now seen corresponding path program 1 times [2020-06-22 02:23:31,425 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 02:23:31,425 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 02:23:31,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:23:31,426 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 02:23:31,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:23:31,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 02:23:31,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 02:23:31,631 WARN L188 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 67 [2020-06-22 02:23:31,655 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 02:23:31,656 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 02:23:31,656 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 02:23:31,656 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 02:23:31,656 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2020-06-22 02:23:31,656 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 02:23:31,657 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 02:23:31,657 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 02:23:31,657 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration10_Loop [2020-06-22 02:23:31,657 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 02:23:31,657 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 02:23:31,673 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 02:23:31,682 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 02:23:31,685 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 02:23:31,688 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 02:23:31,693 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 02:23:31,765 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 02:23:31,766 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 02:23:31,772 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 02:23:31,772 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 02:23:31,781 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 02:23:31,781 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~j~0=12} Honda state: {ULTIMATE.start_main_~j~0=12} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 02:23:31,821 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 02:23:31,822 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 02:23:31,851 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 02:23:31,851 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_1=1} Honda state: {v_rep~unnamed0~0~true_1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 02:23:31,858 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 02:23:31,858 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 02:23:31,885 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 02:23:31,885 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_1=0} Honda state: {v_rep~unnamed0~0~false_1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 02:23:31,889 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 02:23:31,889 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 02:23:31,919 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-06-22 02:23:31,919 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 02:23:31,949 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-06-22 02:23:31,951 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 02:23:31,951 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 02:23:31,951 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 02:23:31,952 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 02:23:31,952 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 02:23:31,952 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 02:23:31,952 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 02:23:31,952 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 02:23:31,952 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration10_Loop [2020-06-22 02:23:31,952 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 02:23:31,952 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 02:23:31,957 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 02:23:31,963 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 02:23:31,969 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 02:23:31,971 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 02:23:31,974 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 02:23:32,030 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 02:23:32,035 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 02:23:32,037 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 02:23:32,039 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 02:23:32,039 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 02:23:32,040 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 02:23:32,040 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 02:23:32,040 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 02:23:32,042 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 02:23:32,042 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 02:23:32,047 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 02:23:32,047 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 02:23:32,048 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 02:23:32,048 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 02:23:32,048 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 02:23:32,048 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 02:23:32,048 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 02:23:32,049 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 02:23:32,049 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 02:23:32,053 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 02:23:32,056 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-06-22 02:23:32,056 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2020-06-22 02:23:32,058 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 02:23:32,058 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-06-22 02:23:32,058 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 02:23:32,059 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -2*ULTIMATE.start_main_~i~0 + 19 Supporting invariants [] [2020-06-22 02:23:32,060 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-06-22 02:23:32,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 02:23:32,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 02:23:32,105 INFO L256 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 2 conjunts are in the unsatisfiable core [2020-06-22 02:23:32,105 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 02:23:32,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 02:23:32,121 INFO L256 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 02:23:32,122 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 02:23:32,137 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2020-06-22 02:23:32,181 INFO L98 LoopCannibalizer]: 2 predicates before loop cannibalization 2 predicates after loop cannibalization [2020-06-22 02:23:32,183 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 [2020-06-22 02:23:32,184 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 12 states and 13 transitions. cyclomatic complexity: 2 Second operand 3 states. [2020-06-22 02:23:32,216 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. [2020-06-22 02:23:32,216 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 [2020-06-22 02:23:32,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-06-22 02:23:32,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 9 transitions. [2020-06-22 02:23:32,219 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 1 letters. Loop has 11 letters. [2020-06-22 02:23:32,221 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 02:23:32,221 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 12 letters. Loop has 11 letters. [2020-06-22 02:23:32,221 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 02:23:32,221 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 1 letters. Loop has 22 letters. [2020-06-22 02:23:32,222 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 02:23:32,226 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 26 transitions. [2020-06-22 02:23:32,227 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-06-22 02:23:32,228 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 23 states and 26 transitions. [2020-06-22 02:23:32,228 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2020-06-22 02:23:32,228 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2020-06-22 02:23:32,228 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 26 transitions. [2020-06-22 02:23:32,228 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 02:23:32,228 INFO L706 BuchiCegarLoop]: Abstraction has 23 states and 26 transitions. [2020-06-22 02:23:32,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 26 transitions. [2020-06-22 02:23:32,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 14. [2020-06-22 02:23:32,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-06-22 02:23:32,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 17 transitions. [2020-06-22 02:23:32,230 INFO L729 BuchiCegarLoop]: Abstraction has 14 states and 17 transitions. [2020-06-22 02:23:32,230 INFO L609 BuchiCegarLoop]: Abstraction has 14 states and 17 transitions. [2020-06-22 02:23:32,230 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2020-06-22 02:23:32,231 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 17 transitions. [2020-06-22 02:23:32,231 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-06-22 02:23:32,231 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 02:23:32,231 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 02:23:32,231 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-06-22 02:23:32,232 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1] [2020-06-22 02:23:32,232 INFO L794 eck$LassoCheckResult]: Stem: 460#ULTIMATE.startENTRY [34] ULTIMATE.startENTRY-->L10-2: 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_~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] 461#L10-2 [38] L10-2-->L12-2: 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] 457#L12-2 [2020-06-22 02:23:32,232 INFO L796 eck$LassoCheckResult]: Loop: 457#L12-2 [33] L12-2-->L12-2: Formula: (and (= v_ULTIMATE.start_main_~c~0_6 (+ v_ULTIMATE.start_main_~c~0_7 1)) (< v_ULTIMATE.start_main_~j~0_7 12) (= (+ v_ULTIMATE.start_main_~j~0_7 1) v_ULTIMATE.start_main_~j~0_5)) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_6, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_5} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0, ULTIMATE.start_main_~c~0] 457#L12-2 [2020-06-22 02:23:32,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 02:23:32,232 INFO L82 PathProgramCache]: Analyzing trace with hash 2053, now seen corresponding path program 1 times [2020-06-22 02:23:32,232 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 02:23:32,232 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 02:23:32,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:23:32,234 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 02:23:32,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:23:32,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 02:23:32,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 02:23:32,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 02:23:32,237 INFO L82 PathProgramCache]: Analyzing trace with hash 64, now seen corresponding path program 1 times [2020-06-22 02:23:32,237 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 02:23:32,237 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 02:23:32,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:23:32,238 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 02:23:32,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:23:32,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 02:23:32,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 02:23:32,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 02:23:32,242 INFO L82 PathProgramCache]: Analyzing trace with hash 63676, now seen corresponding path program 1 times [2020-06-22 02:23:32,242 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 02:23:32,242 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 02:23:32,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:23:32,243 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 02:23:32,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:23:32,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 02:23:32,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 02:23:32,266 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 02:23:32,266 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 02:23:32,266 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 02:23:32,266 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 02:23:32,266 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2020-06-22 02:23:32,267 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 02:23:32,267 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 02:23:32,267 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 02:23:32,267 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration11_Loop [2020-06-22 02:23:32,267 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 02:23:32,267 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 02:23:32,268 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 02:23:32,271 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 02:23:32,275 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 02:23:32,278 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 02:23:32,339 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 02:23:32,339 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 02:23:32,343 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 02:23:32,343 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 02:23:32,370 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 02:23:32,371 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_3=0} Honda state: {v_rep~unnamed0~0~false_3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 02:23:32,376 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 02:23:32,376 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 02:23:32,403 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 02:23:32,404 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_3=1} Honda state: {v_rep~unnamed0~0~true_3=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 02:23:32,409 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 02:23:32,409 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 02:23:32,444 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-06-22 02:23:32,444 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 02:23:32,477 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 02:23:32,477 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] No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 02:23:32,506 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 02:23:32,506 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 02:23:32,536 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-06-22 02:23:32,536 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 02:23:32,566 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-06-22 02:23:32,568 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 02:23:32,568 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 02:23:32,568 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 02:23:32,568 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 02:23:32,568 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 02:23:32,568 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 02:23:32,568 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 02:23:32,568 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 02:23:32,568 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration11_Loop [2020-06-22 02:23:32,569 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 02:23:32,569 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 02:23:32,570 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 02:23:32,573 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 02:23:32,575 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 02:23:32,578 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 02:23:32,619 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 02:23:32,619 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 02:23:32,620 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 02:23:32,621 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 02:23:32,621 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 02:23:32,621 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 02:23:32,621 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 02:23:32,624 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 02:23:32,624 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 02:23:32,626 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 02:23:32,627 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 02:23:32,627 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 02:23:32,627 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 02:23:32,627 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 02:23:32,628 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 02:23:32,629 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 02:23:32,629 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 02:23:32,633 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 02:23:32,633 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 02:23:32,634 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 02:23:32,634 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 02:23:32,634 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 02:23:32,634 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 02:23:32,634 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 02:23:32,635 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 02:23:32,635 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 02:23:32,636 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 02:23:32,637 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 02:23:32,637 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 02:23:32,637 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 02:23:32,637 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 02:23:32,638 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 02:23:32,638 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 02:23:32,638 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 02:23:32,638 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 02:23:32,641 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 02:23:32,642 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-06-22 02:23:32,642 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2020-06-22 02:23:32,643 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 02:23:32,643 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-06-22 02:23:32,643 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 02:23:32,643 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0) = -2*ULTIMATE.start_main_~j~0 + 23 Supporting invariants [] [2020-06-22 02:23:32,644 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-06-22 02:23:32,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 02:23:32,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 02:23:32,663 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 2 conjunts are in the unsatisfiable core [2020-06-22 02:23:32,663 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 02:23:32,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 02:23:32,667 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 02:23:32,668 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 02:23:32,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 02:23:32,668 INFO L98 LoopCannibalizer]: 1 predicates before loop cannibalization 1 predicates after loop cannibalization [2020-06-22 02:23:32,668 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 [2020-06-22 02:23:32,669 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 14 states and 17 transitions. cyclomatic complexity: 5 Second operand 2 states. [2020-06-22 02:23:32,679 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. [2020-06-22 02:23:32,679 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 [2020-06-22 02:23:32,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-06-22 02:23:32,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2020-06-22 02:23:32,680 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 2 letters. Loop has 1 letters. [2020-06-22 02:23:32,680 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 02:23:32,680 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 3 letters. Loop has 1 letters. [2020-06-22 02:23:32,681 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 02:23:32,681 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 2 letters. Loop has 2 letters. [2020-06-22 02:23:32,681 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 02:23:32,683 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 19 transitions. [2020-06-22 02:23:32,683 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-06-22 02:23:32,684 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 0 states and 0 transitions. [2020-06-22 02:23:32,684 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-06-22 02:23:32,684 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-06-22 02:23:32,684 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-06-22 02:23:32,684 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 02:23:32,684 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 02:23:32,684 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 02:23:32,684 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 02:23:32,684 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2020-06-22 02:23:32,684 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-06-22 02:23:32,685 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-06-22 02:23:32,685 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-06-22 02:23:32,691 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 02:23:32 BasicIcfg [2020-06-22 02:23:32,691 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-06-22 02:23:32,692 INFO L168 Benchmark]: Toolchain (without parser) took 3569.06 ms. Allocated memory was 649.6 MB in the beginning and 755.0 MB in the end (delta: 105.4 MB). Free memory was 558.8 MB in the beginning and 595.5 MB in the end (delta: -36.7 MB). Peak memory consumption was 68.7 MB. Max. memory is 50.3 GB. [2020-06-22 02:23:32,693 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 649.6 MB. Free memory is still 580.4 MB. There was no memory consumed. Max. memory is 50.3 GB. [2020-06-22 02:23:32,693 INFO L168 Benchmark]: CACSL2BoogieTranslator took 275.11 ms. Allocated memory was 649.6 MB in the beginning and 691.0 MB in the end (delta: 41.4 MB). Free memory was 558.8 MB in the beginning and 656.6 MB in the end (delta: -97.8 MB). Peak memory consumption was 28.9 MB. Max. memory is 50.3 GB. [2020-06-22 02:23:32,694 INFO L168 Benchmark]: Boogie Procedure Inliner took 34.00 ms. Allocated memory is still 691.0 MB. Free memory was 656.6 MB in the beginning and 655.5 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 50.3 GB. [2020-06-22 02:23:32,695 INFO L168 Benchmark]: Boogie Preprocessor took 18.87 ms. Allocated memory is still 691.0 MB. Free memory was 655.5 MB in the beginning and 652.7 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 50.3 GB. [2020-06-22 02:23:32,695 INFO L168 Benchmark]: RCFGBuilder took 193.43 ms. Allocated memory is still 691.0 MB. Free memory was 652.7 MB in the beginning and 639.6 MB in the end (delta: 13.1 MB). Peak memory consumption was 13.1 MB. Max. memory is 50.3 GB. [2020-06-22 02:23:32,696 INFO L168 Benchmark]: BlockEncodingV2 took 69.43 ms. Allocated memory is still 691.0 MB. Free memory was 639.6 MB in the beginning and 635.3 MB in the end (delta: 4.3 MB). Peak memory consumption was 4.3 MB. Max. memory is 50.3 GB. [2020-06-22 02:23:32,696 INFO L168 Benchmark]: TraceAbstraction took 153.11 ms. Allocated memory is still 691.0 MB. Free memory was 634.2 MB in the beginning and 625.6 MB in the end (delta: 8.6 MB). Peak memory consumption was 8.6 MB. Max. memory is 50.3 GB. [2020-06-22 02:23:32,697 INFO L168 Benchmark]: BuchiAutomizer took 2819.97 ms. Allocated memory was 691.0 MB in the beginning and 755.0 MB in the end (delta: 64.0 MB). Free memory was 625.6 MB in the beginning and 595.5 MB in the end (delta: 30.1 MB). Peak memory consumption was 94.1 MB. Max. memory is 50.3 GB. [2020-06-22 02:23:32,701 INFO L337 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 8 locations, 11 edges - StatisticsResult: Encoded RCFG 3 locations, 4 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 649.6 MB. Free memory is still 580.4 MB. There was no memory consumed. Max. memory is 50.3 GB. * CACSL2BoogieTranslator took 275.11 ms. Allocated memory was 649.6 MB in the beginning and 691.0 MB in the end (delta: 41.4 MB). Free memory was 558.8 MB in the beginning and 656.6 MB in the end (delta: -97.8 MB). Peak memory consumption was 28.9 MB. Max. memory is 50.3 GB. * Boogie Procedure Inliner took 34.00 ms. Allocated memory is still 691.0 MB. Free memory was 656.6 MB in the beginning and 655.5 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 50.3 GB. * Boogie Preprocessor took 18.87 ms. Allocated memory is still 691.0 MB. Free memory was 655.5 MB in the beginning and 652.7 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 50.3 GB. * RCFGBuilder took 193.43 ms. Allocated memory is still 691.0 MB. Free memory was 652.7 MB in the beginning and 639.6 MB in the end (delta: 13.1 MB). Peak memory consumption was 13.1 MB. Max. memory is 50.3 GB. * BlockEncodingV2 took 69.43 ms. Allocated memory is still 691.0 MB. Free memory was 639.6 MB in the beginning and 635.3 MB in the end (delta: 4.3 MB). Peak memory consumption was 4.3 MB. Max. memory is 50.3 GB. * TraceAbstraction took 153.11 ms. Allocated memory is still 691.0 MB. Free memory was 634.2 MB in the beginning and 625.6 MB in the end (delta: 8.6 MB). Peak memory consumption was 8.6 MB. Max. memory is 50.3 GB. * BuchiAutomizer took 2819.97 ms. Allocated memory was 691.0 MB in the beginning and 755.0 MB in the end (delta: 64.0 MB). Free memory was 625.6 MB in the beginning and 595.5 MB in the end (delta: 30.1 MB). Peak memory consumption was 94.1 MB. Max. memory is 50.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - AllSpecificationsHoldResult: All specifications hold We were not able to verify any specifiation because the program does not contain any specification. - InvariantResult [Line: 12]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 10]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data 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 - StatisticsResult: Constructed decomposition of program 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. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.7s and 12 iterations. TraceHistogramMax:9. Analysis of lassos took 2.2s. 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 ax168 hnf100 lsp33 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq160 hnf93 smp100 dnf100 smp100 tf113 neg100 sie111 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 6ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 5 LassoNonterminationAnalysisSatUnbounded: 1 LassoNonterminationAnalysisUnsat: 2 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.3s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! !SESSION 2020-06-22 02:23:25.899 ----------------------------------------------- eclipse.buildId=unknown java.version=1.8.0_242 java.vendor=Oracle Corporation BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox2/benchmark/theBenchmark.c 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 !ENTRY org.eclipse.core.resources 2 10035 2020-06-22 02:23:32.934 !MESSAGE The workspace will exit with unsaved changes in this session. Received shutdown request... Ultimate: GTK+ Version Check