YES Ultimate: Cannot open display: This is Ultimate 0.1.24-8dc7c08-m [2020-06-22 06:36:23,319 INFO L170 SettingsManager]: Resetting all preferences to default values... [2020-06-22 06:36:23,322 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2020-06-22 06:36:23,333 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-06-22 06:36:23,333 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-06-22 06:36:23,334 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-06-22 06:36:23,335 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-06-22 06:36:23,337 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2020-06-22 06:36:23,338 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-06-22 06:36:23,339 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-06-22 06:36:23,340 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-06-22 06:36:23,340 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-06-22 06:36:23,341 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-06-22 06:36:23,341 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-06-22 06:36:23,342 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-06-22 06:36:23,343 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-06-22 06:36:23,344 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-06-22 06:36:23,346 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-06-22 06:36:23,348 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2020-06-22 06:36:23,349 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-06-22 06:36:23,350 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-06-22 06:36:23,351 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-06-22 06:36:23,353 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-06-22 06:36:23,353 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-06-22 06:36:23,353 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-06-22 06:36:23,354 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-06-22 06:36:23,354 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-06-22 06:36:23,355 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-06-22 06:36:23,356 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-06-22 06:36:23,356 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-06-22 06:36:23,357 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-06-22 06:36:23,358 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2020-06-22 06:36:23,358 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-06-22 06:36:23,359 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2020-06-22 06:36:23,359 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-06-22 06:36:23,359 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-06-22 06:36:23,360 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2020-06-22 06:36:23,361 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2020-06-22 06:36:23,361 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2020-06-22 06:36:23,361 INFO L98 SettingsManager]: Beginning loading settings from /export/starexec/sandbox2/solver/bin/./../termcomp2017.epf [2020-06-22 06:36:23,376 INFO L110 SettingsManager]: Loading preferences was successful [2020-06-22 06:36:23,376 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2020-06-22 06:36:23,377 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-06-22 06:36:23,377 INFO L133 SettingsManager]: * Rewrite not-equals=true [2020-06-22 06:36:23,377 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2020-06-22 06:36:23,378 INFO L133 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE [2020-06-22 06:36:23,378 INFO L133 SettingsManager]: * Use SBE=true [2020-06-22 06:36:23,378 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-06-22 06:36:23,378 INFO L133 SettingsManager]: * Use old map elimination=false [2020-06-22 06:36:23,378 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2020-06-22 06:36:23,379 INFO L133 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION [2020-06-22 06:36:23,379 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2020-06-22 06:36:23,379 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-06-22 06:36:23,379 INFO L133 SettingsManager]: * Construct termination proof for TermComp=true [2020-06-22 06:36:23,379 INFO L133 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 06:36:23,379 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-06-22 06:36:23,380 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-06-22 06:36:23,380 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2020-06-22 06:36:23,380 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2020-06-22 06:36:23,380 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-06-22 06:36:23,380 INFO L133 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE [2020-06-22 06:36:23,380 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-06-22 06:36:23,381 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-06-22 06:36:23,381 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-06-22 06:36:23,381 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-06-22 06:36:23,381 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-06-22 06:36:23,381 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-06-22 06:36:23,382 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2020-06-22 06:36:23,382 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-06-22 06:36:23,407 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-06-22 06:36:23,420 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-06-22 06:36:23,424 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-06-22 06:36:23,425 INFO L271 PluginConnector]: Initializing CDTParser... [2020-06-22 06:36:23,425 INFO L276 PluginConnector]: CDTParser initialized [2020-06-22 06:36:23,426 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox2/benchmark/theBenchmark.c [2020-06-22 06:36:23,490 INFO L221 CDTParser]: Created temporary CDT project at /export/starexec/sandbox2/tmp/1ba570a0a24f402bb0bc653992fe1019/FLAG5f240513a [2020-06-22 06:36:23,818 INFO L307 CDTParser]: Found 1 translation units. [2020-06-22 06:36:23,818 INFO L161 CDTParser]: Scanning /export/starexec/sandbox2/benchmark/theBenchmark.c [2020-06-22 06:36:23,825 INFO L355 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox2/tmp/1ba570a0a24f402bb0bc653992fe1019/FLAG5f240513a [2020-06-22 06:36:24,227 INFO L363 CDTParser]: Successfully deleted /export/starexec/sandbox2/tmp/1ba570a0a24f402bb0bc653992fe1019 [2020-06-22 06:36:24,239 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-06-22 06:36:24,240 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. [2020-06-22 06:36:24,241 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-06-22 06:36:24,241 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-06-22 06:36:24,245 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2020-06-22 06:36:24,246 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.06 06:36:24" (1/1) ... [2020-06-22 06:36:24,251 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@443f1abe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 06:36:24, skipping insertion in model container [2020-06-22 06:36:24,251 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.06 06:36:24" (1/1) ... [2020-06-22 06:36:24,259 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-06-22 06:36:24,276 INFO L176 MainTranslator]: Built tables and reachable declarations [2020-06-22 06:36:24,437 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-06-22 06:36:24,442 INFO L191 MainTranslator]: Completed pre-run [2020-06-22 06:36:24,513 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-06-22 06:36:24,528 INFO L195 MainTranslator]: Completed translation [2020-06-22 06:36:24,529 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 06:36:24 WrapperNode [2020-06-22 06:36:24,529 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-06-22 06:36:24,530 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-06-22 06:36:24,530 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-06-22 06:36:24,530 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2020-06-22 06:36:24,540 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 06:36:24" (1/1) ... [2020-06-22 06:36:24,546 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 06:36:24" (1/1) ... [2020-06-22 06:36:24,566 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-06-22 06:36:24,567 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-06-22 06:36:24,567 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-06-22 06:36:24,567 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2020-06-22 06:36:24,576 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 06:36:24" (1/1) ... [2020-06-22 06:36:24,577 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 06:36:24" (1/1) ... [2020-06-22 06:36:24,577 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 06:36:24" (1/1) ... [2020-06-22 06:36:24,577 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 06:36:24" (1/1) ... [2020-06-22 06:36:24,579 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 06:36:24" (1/1) ... [2020-06-22 06:36:24,584 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 06:36:24" (1/1) ... [2020-06-22 06:36:24,585 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 06:36:24" (1/1) ... [2020-06-22 06:36:24,586 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-06-22 06:36:24,587 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-06-22 06:36:24,587 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-06-22 06:36:24,587 INFO L276 PluginConnector]: RCFGBuilder initialized [2020-06-22 06:36:24,588 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 06:36:24" (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 06:36:24,654 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-06-22 06:36:24,654 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-06-22 06:36:24,781 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-06-22 06:36:24,782 INFO L286 CfgBuilder]: Removed 6 assue(true) statements. [2020-06-22 06:36:24,783 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 06:36:24 BoogieIcfgContainer [2020-06-22 06:36:24,783 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-06-22 06:36:24,784 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- [2020-06-22 06:36:24,784 INFO L271 PluginConnector]: Initializing BlockEncodingV2... [2020-06-22 06:36:24,786 INFO L276 PluginConnector]: BlockEncodingV2 initialized [2020-06-22 06:36:24,787 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 06:36:24" (1/1) ... [2020-06-22 06:36:24,800 INFO L313 BlockEncoder]: Initial Icfg 9 locations, 12 edges [2020-06-22 06:36:24,802 INFO L258 BlockEncoder]: Using Remove infeasible edges [2020-06-22 06:36:24,803 INFO L263 BlockEncoder]: Using Maximize final states [2020-06-22 06:36:24,804 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false [2020-06-22 06:36:24,804 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE [2020-06-22 06:36:24,806 INFO L296 BlockEncoder]: Using Remove sink states [2020-06-22 06:36:24,807 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true [2020-06-22 06:36:24,807 INFO L179 BlockEncoder]: Using Rewrite not-equals [2020-06-22 06:36:24,821 INFO L185 BlockEncoder]: Using Use SBE [2020-06-22 06:36:24,829 INFO L200 BlockEncoder]: SBE split 0 edges [2020-06-22 06:36:24,834 INFO L70 emoveInfeasibleEdges]: Removed 2 edges and 0 locations because of local infeasibility [2020-06-22 06:36:24,836 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-06-22 06:36:24,853 INFO L100 BaseMinimizeStates]: Removed 10 edges and 5 locations by large block encoding [2020-06-22 06:36:24,855 INFO L70 RemoveSinkStates]: Removed 1 edges and 1 locations by removing sink states [2020-06-22 06:36:24,857 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-06-22 06:36:24,857 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-06-22 06:36:24,857 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding [2020-06-22 06:36:24,857 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states [2020-06-22 06:36:24,858 INFO L313 BlockEncoder]: Encoded RCFG 3 locations, 4 edges [2020-06-22 06:36:24,858 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 06:36:24 BasicIcfg [2020-06-22 06:36:24,858 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- [2020-06-22 06:36:24,859 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-06-22 06:36:24,859 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-06-22 06:36:24,862 INFO L276 PluginConnector]: TraceAbstraction initialized [2020-06-22 06:36:24,863 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.06 06:36:24" (1/4) ... [2020-06-22 06:36:24,863 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d00cfda and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 06:36:24, skipping insertion in model container [2020-06-22 06:36:24,864 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 06:36:24" (2/4) ... [2020-06-22 06:36:24,864 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d00cfda and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 06:36:24, skipping insertion in model container [2020-06-22 06:36:24,864 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 06:36:24" (3/4) ... [2020-06-22 06:36:24,864 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d00cfda and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 06:36:24, skipping insertion in model container [2020-06-22 06:36:24,865 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 06:36:24" (4/4) ... [2020-06-22 06:36:24,866 INFO L112 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-06-22 06:36:24,876 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2020-06-22 06:36:24,884 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 0 error locations. [2020-06-22 06:36:24,901 INFO L257 AbstractCegarLoop]: Starting to check reachability of 0 error locations. [2020-06-22 06:36:24,929 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2020-06-22 06:36:24,930 INFO L382 AbstractCegarLoop]: Interprodecural is true [2020-06-22 06:36:24,930 INFO L383 AbstractCegarLoop]: Hoare is true [2020-06-22 06:36:24,930 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2020-06-22 06:36:24,930 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-06-22 06:36:24,930 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-06-22 06:36:24,931 INFO L387 AbstractCegarLoop]: Difference is false [2020-06-22 06:36:24,931 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-06-22 06:36:24,931 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-06-22 06:36:24,946 INFO L276 IsEmpty]: Start isEmpty. Operand 3 states. [2020-06-22 06:36:24,951 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-06-22 06:36:24,954 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 3 states. [2020-06-22 06:36:25,005 INFO L451 ceAbstractionStarter]: At program point L4-3(lines 4 8) the Hoare annotation is: true [2020-06-22 06:36:25,005 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-06-22 06:36:25,005 INFO L451 ceAbstractionStarter]: At program point L5-3(lines 5 8) the Hoare annotation is: true [2020-06-22 06:36:25,013 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 06:36:25 BasicIcfg [2020-06-22 06:36:25,014 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-06-22 06:36:25,014 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-06-22 06:36:25,015 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-06-22 06:36:25,018 INFO L276 PluginConnector]: BuchiAutomizer initialized [2020-06-22 06:36:25,019 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 06:36:25,019 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.06 06:36:24" (1/5) ... [2020-06-22 06:36:25,020 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@63aa3370 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.06 06:36:25, skipping insertion in model container [2020-06-22 06:36:25,020 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 06:36:25,020 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 06:36:24" (2/5) ... [2020-06-22 06:36:25,020 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@63aa3370 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.06 06:36:25, skipping insertion in model container [2020-06-22 06:36:25,021 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 06:36:25,021 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 06:36:24" (3/5) ... [2020-06-22 06:36:25,021 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@63aa3370 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 06:36:25, skipping insertion in model container [2020-06-22 06:36:25,022 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 06:36:25,022 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 06:36:24" (4/5) ... [2020-06-22 06:36:25,022 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@63aa3370 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 06:36:25, skipping insertion in model container [2020-06-22 06:36:25,022 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 06:36:25,022 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 06:36:25" (5/5) ... [2020-06-22 06:36:25,024 INFO L375 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-06-22 06:36:25,051 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2020-06-22 06:36:25,051 INFO L374 BuchiCegarLoop]: Interprodecural is true [2020-06-22 06:36:25,052 INFO L375 BuchiCegarLoop]: Hoare is true [2020-06-22 06:36:25,052 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-06-22 06:36:25,052 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-06-22 06:36:25,052 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-06-22 06:36:25,052 INFO L379 BuchiCegarLoop]: Difference is false [2020-06-22 06:36:25,052 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-06-22 06:36:25,053 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-06-22 06:36:25,056 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. [2020-06-22 06:36:25,072 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-06-22 06:36:25,073 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 06:36:25,073 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 06:36:25,078 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] [2020-06-22 06:36:25,079 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-06-22 06:36:25,079 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2020-06-22 06:36:25,079 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. [2020-06-22 06:36:25,079 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-06-22 06:36:25,080 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 06:36:25,080 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 06:36:25,080 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] [2020-06-22 06:36:25,080 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-06-22 06:36:25,085 INFO L794 eck$LassoCheckResult]: Stem: 3#ULTIMATE.startENTRYtrue [31] ULTIMATE.startENTRY-->L4-3: Formula: (and (= v_ULTIMATE.start_main_~c~0_1 0) (= v_ULTIMATE.start_main_~i~0_1 0)) InVars {} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_1, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_1, ULTIMATE.start_main_#t~post0=|v_ULTIMATE.start_main_#t~post0_1|, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~i~0, ULTIMATE.start_main_#t~post0] 4#L4-3true [2020-06-22 06:36:25,086 INFO L796 eck$LassoCheckResult]: Loop: 4#L4-3true [35] L4-3-->L5-3: Formula: (and (< v_ULTIMATE.start_main_~i~0_9 10) (= v_ULTIMATE.start_main_~j~0_8 3)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 5#L5-3true [47] L5-3-->L4-3: Formula: (and (<= 12 v_ULTIMATE.start_main_~j~0_13) (= (+ v_ULTIMATE.start_main_~i~0_12 1) v_ULTIMATE.start_main_~i~0_11)) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_13, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_13, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11, ULTIMATE.start_main_#t~post0=|v_ULTIMATE.start_main_#t~post0_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0, ULTIMATE.start_main_#t~post0] 4#L4-3true [2020-06-22 06:36:25,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 06:36:25,092 INFO L82 PathProgramCache]: Analyzing trace with hash 62, now seen corresponding path program 1 times [2020-06-22 06:36:25,094 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 06:36:25,095 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 06:36:25,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 06:36:25,115 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 06:36:25,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 06:36:25,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 06:36:25,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 06:36:25,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 06:36:25,159 INFO L82 PathProgramCache]: Analyzing trace with hash 2093, now seen corresponding path program 1 times [2020-06-22 06:36:25,159 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 06:36:25,160 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 06:36:25,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 06:36:25,161 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 06:36:25,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 06:36:25,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 06:36:25,207 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 06:36:25,209 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 06:36:25,209 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-06-22 06:36:25,214 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-06-22 06:36:25,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 06:36:25,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 06:36:25,233 INFO L87 Difference]: Start difference. First operand 3 states. Second operand 3 states. [2020-06-22 06:36:25,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 06:36:25,251 INFO L93 Difference]: Finished difference Result 4 states and 5 transitions. [2020-06-22 06:36:25,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 06:36:25,255 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 4 states and 5 transitions. [2020-06-22 06:36:25,255 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-06-22 06:36:25,259 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 4 states to 4 states and 5 transitions. [2020-06-22 06:36:25,260 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4 [2020-06-22 06:36:25,260 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4 [2020-06-22 06:36:25,261 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 5 transitions. [2020-06-22 06:36:25,261 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 06:36:25,261 INFO L706 BuchiCegarLoop]: Abstraction has 4 states and 5 transitions. [2020-06-22 06:36:25,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4 states and 5 transitions. [2020-06-22 06:36:25,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4 to 4. [2020-06-22 06:36:25,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-06-22 06:36:25,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 5 transitions. [2020-06-22 06:36:25,289 INFO L729 BuchiCegarLoop]: Abstraction has 4 states and 5 transitions. [2020-06-22 06:36:25,289 INFO L609 BuchiCegarLoop]: Abstraction has 4 states and 5 transitions. [2020-06-22 06:36:25,289 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2020-06-22 06:36:25,290 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4 states and 5 transitions. [2020-06-22 06:36:25,290 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-06-22 06:36:25,290 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 06:36:25,290 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 06:36:25,291 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] [2020-06-22 06:36:25,291 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-06-22 06:36:25,291 INFO L794 eck$LassoCheckResult]: Stem: 16#ULTIMATE.startENTRY [31] ULTIMATE.startENTRY-->L4-3: Formula: (and (= v_ULTIMATE.start_main_~c~0_1 0) (= v_ULTIMATE.start_main_~i~0_1 0)) InVars {} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_1, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_1, ULTIMATE.start_main_#t~post0=|v_ULTIMATE.start_main_#t~post0_1|, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~i~0, ULTIMATE.start_main_#t~post0] 17#L4-3 [2020-06-22 06:36:25,292 INFO L796 eck$LassoCheckResult]: Loop: 17#L4-3 [35] L4-3-->L5-3: Formula: (and (< v_ULTIMATE.start_main_~i~0_9 10) (= v_ULTIMATE.start_main_~j~0_8 3)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 18#L5-3 [46] L5-3-->L5-3: Formula: (and (= (+ v_ULTIMATE.start_main_~j~0_12 1) v_ULTIMATE.start_main_~j~0_10) (= (+ v_ULTIMATE.start_main_~c~0_9 1) v_ULTIMATE.start_main_~c~0_8) (< v_ULTIMATE.start_main_~j~0_12 12)) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_12, ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_9} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_10, ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0, ULTIMATE.start_main_~c~0] 19#L5-3 [47] L5-3-->L4-3: Formula: (and (<= 12 v_ULTIMATE.start_main_~j~0_13) (= (+ v_ULTIMATE.start_main_~i~0_12 1) v_ULTIMATE.start_main_~i~0_11)) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_13, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_13, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11, ULTIMATE.start_main_#t~post0=|v_ULTIMATE.start_main_#t~post0_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0, ULTIMATE.start_main_#t~post0] 17#L4-3 [2020-06-22 06:36:25,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 06:36:25,292 INFO L82 PathProgramCache]: Analyzing trace with hash 62, now seen corresponding path program 2 times [2020-06-22 06:36:25,292 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 06:36:25,292 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 06:36:25,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 06:36:25,293 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 06:36:25,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 06:36:25,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 06:36:25,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 06:36:25,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 06:36:25,298 INFO L82 PathProgramCache]: Analyzing trace with hash 64899, now seen corresponding path program 1 times [2020-06-22 06:36:25,298 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 06:36:25,298 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 06:36:25,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 06:36:25,299 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 06:36:25,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 06:36:25,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 06:36:25,326 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 06:36:25,327 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 06:36:25,327 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 06:36:25,343 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 06:36:25,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 06:36:25,355 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 3 conjunts are in the unsatisfiable core [2020-06-22 06:36:25,356 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 06:36:25,371 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 06:36:25,397 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-06-22 06:36:25,398 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2] total 2 [2020-06-22 06:36:25,398 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-06-22 06:36:25,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-06-22 06:36:25,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-06-22 06:36:25,399 INFO L87 Difference]: Start difference. First operand 4 states and 5 transitions. cyclomatic complexity: 2 Second operand 4 states. [2020-06-22 06:36:25,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 06:36:25,422 INFO L93 Difference]: Finished difference Result 5 states and 6 transitions. [2020-06-22 06:36:25,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-06-22 06:36:25,423 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 5 states and 6 transitions. [2020-06-22 06:36:25,424 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-06-22 06:36:25,424 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 5 states to 5 states and 6 transitions. [2020-06-22 06:36:25,424 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2020-06-22 06:36:25,424 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2020-06-22 06:36:25,424 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 6 transitions. [2020-06-22 06:36:25,425 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 06:36:25,425 INFO L706 BuchiCegarLoop]: Abstraction has 5 states and 6 transitions. [2020-06-22 06:36:25,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states and 6 transitions. [2020-06-22 06:36:25,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2020-06-22 06:36:25,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-06-22 06:36:25,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 6 transitions. [2020-06-22 06:36:25,426 INFO L729 BuchiCegarLoop]: Abstraction has 5 states and 6 transitions. [2020-06-22 06:36:25,426 INFO L609 BuchiCegarLoop]: Abstraction has 5 states and 6 transitions. [2020-06-22 06:36:25,426 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2020-06-22 06:36:25,427 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5 states and 6 transitions. [2020-06-22 06:36:25,427 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-06-22 06:36:25,427 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 06:36:25,427 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 06:36:25,427 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] [2020-06-22 06:36:25,428 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1] [2020-06-22 06:36:25,428 INFO L794 eck$LassoCheckResult]: Stem: 38#ULTIMATE.startENTRY [31] ULTIMATE.startENTRY-->L4-3: Formula: (and (= v_ULTIMATE.start_main_~c~0_1 0) (= v_ULTIMATE.start_main_~i~0_1 0)) InVars {} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_1, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_1, ULTIMATE.start_main_#t~post0=|v_ULTIMATE.start_main_#t~post0_1|, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~i~0, ULTIMATE.start_main_#t~post0] 39#L4-3 [2020-06-22 06:36:25,428 INFO L796 eck$LassoCheckResult]: Loop: 39#L4-3 [35] L4-3-->L5-3: Formula: (and (< v_ULTIMATE.start_main_~i~0_9 10) (= v_ULTIMATE.start_main_~j~0_8 3)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 40#L5-3 [46] L5-3-->L5-3: Formula: (and (= (+ v_ULTIMATE.start_main_~j~0_12 1) v_ULTIMATE.start_main_~j~0_10) (= (+ v_ULTIMATE.start_main_~c~0_9 1) v_ULTIMATE.start_main_~c~0_8) (< v_ULTIMATE.start_main_~j~0_12 12)) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_12, ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_9} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_10, ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0, ULTIMATE.start_main_~c~0] 41#L5-3 [46] L5-3-->L5-3: Formula: (and (= (+ v_ULTIMATE.start_main_~j~0_12 1) v_ULTIMATE.start_main_~j~0_10) (= (+ v_ULTIMATE.start_main_~c~0_9 1) v_ULTIMATE.start_main_~c~0_8) (< v_ULTIMATE.start_main_~j~0_12 12)) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_12, ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_9} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_10, ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0, ULTIMATE.start_main_~c~0] 42#L5-3 [47] L5-3-->L4-3: Formula: (and (<= 12 v_ULTIMATE.start_main_~j~0_13) (= (+ v_ULTIMATE.start_main_~i~0_12 1) v_ULTIMATE.start_main_~i~0_11)) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_13, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_13, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11, ULTIMATE.start_main_#t~post0=|v_ULTIMATE.start_main_#t~post0_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0, ULTIMATE.start_main_#t~post0] 39#L4-3 [2020-06-22 06:36:25,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 06:36:25,429 INFO L82 PathProgramCache]: Analyzing trace with hash 62, now seen corresponding path program 3 times [2020-06-22 06:36:25,429 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 06:36:25,429 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 06:36:25,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 06:36:25,430 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 06:36:25,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 06:36:25,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 06:36:25,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 06:36:25,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 06:36:25,435 INFO L82 PathProgramCache]: Analyzing trace with hash 2011885, now seen corresponding path program 2 times [2020-06-22 06:36:25,435 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 06:36:25,435 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 06:36:25,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 06:36:25,436 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 06:36:25,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 06:36:25,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 06:36:25,466 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 06:36:25,466 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 06:36:25,466 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 06:36:25,479 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2020-06-22 06:36:25,487 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-06-22 06:36:25,488 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-06-22 06:36:25,488 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 06:36:25,489 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 06:36:25,492 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 06:36:25,518 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-06-22 06:36:25,518 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 3 [2020-06-22 06:36:25,519 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-06-22 06:36:25,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-06-22 06:36:25,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-06-22 06:36:25,520 INFO L87 Difference]: Start difference. First operand 5 states and 6 transitions. cyclomatic complexity: 2 Second operand 5 states. [2020-06-22 06:36:25,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 06:36:25,549 INFO L93 Difference]: Finished difference Result 6 states and 7 transitions. [2020-06-22 06:36:25,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-06-22 06:36:25,550 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 6 states and 7 transitions. [2020-06-22 06:36:25,551 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-06-22 06:36:25,551 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 6 states to 6 states and 7 transitions. [2020-06-22 06:36:25,551 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2020-06-22 06:36:25,552 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2020-06-22 06:36:25,552 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 7 transitions. [2020-06-22 06:36:25,552 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 06:36:25,552 INFO L706 BuchiCegarLoop]: Abstraction has 6 states and 7 transitions. [2020-06-22 06:36:25,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states and 7 transitions. [2020-06-22 06:36:25,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2020-06-22 06:36:25,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-06-22 06:36:25,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 7 transitions. [2020-06-22 06:36:25,554 INFO L729 BuchiCegarLoop]: Abstraction has 6 states and 7 transitions. [2020-06-22 06:36:25,554 INFO L609 BuchiCegarLoop]: Abstraction has 6 states and 7 transitions. [2020-06-22 06:36:25,554 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2020-06-22 06:36:25,554 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6 states and 7 transitions. [2020-06-22 06:36:25,554 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-06-22 06:36:25,555 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 06:36:25,555 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 06:36:25,555 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] [2020-06-22 06:36:25,555 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [3, 1, 1] [2020-06-22 06:36:25,555 INFO L794 eck$LassoCheckResult]: Stem: 66#ULTIMATE.startENTRY [31] ULTIMATE.startENTRY-->L4-3: Formula: (and (= v_ULTIMATE.start_main_~c~0_1 0) (= v_ULTIMATE.start_main_~i~0_1 0)) InVars {} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_1, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_1, ULTIMATE.start_main_#t~post0=|v_ULTIMATE.start_main_#t~post0_1|, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~i~0, ULTIMATE.start_main_#t~post0] 67#L4-3 [2020-06-22 06:36:25,556 INFO L796 eck$LassoCheckResult]: Loop: 67#L4-3 [35] L4-3-->L5-3: Formula: (and (< v_ULTIMATE.start_main_~i~0_9 10) (= v_ULTIMATE.start_main_~j~0_8 3)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 68#L5-3 [46] L5-3-->L5-3: Formula: (and (= (+ v_ULTIMATE.start_main_~j~0_12 1) v_ULTIMATE.start_main_~j~0_10) (= (+ v_ULTIMATE.start_main_~c~0_9 1) v_ULTIMATE.start_main_~c~0_8) (< v_ULTIMATE.start_main_~j~0_12 12)) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_12, ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_9} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_10, ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0, ULTIMATE.start_main_~c~0] 69#L5-3 [46] L5-3-->L5-3: Formula: (and (= (+ v_ULTIMATE.start_main_~j~0_12 1) v_ULTIMATE.start_main_~j~0_10) (= (+ v_ULTIMATE.start_main_~c~0_9 1) v_ULTIMATE.start_main_~c~0_8) (< v_ULTIMATE.start_main_~j~0_12 12)) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_12, ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_9} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_10, ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0, ULTIMATE.start_main_~c~0] 71#L5-3 [46] L5-3-->L5-3: Formula: (and (= (+ v_ULTIMATE.start_main_~j~0_12 1) v_ULTIMATE.start_main_~j~0_10) (= (+ v_ULTIMATE.start_main_~c~0_9 1) v_ULTIMATE.start_main_~c~0_8) (< v_ULTIMATE.start_main_~j~0_12 12)) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_12, ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_9} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_10, ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0, ULTIMATE.start_main_~c~0] 70#L5-3 [47] L5-3-->L4-3: Formula: (and (<= 12 v_ULTIMATE.start_main_~j~0_13) (= (+ v_ULTIMATE.start_main_~i~0_12 1) v_ULTIMATE.start_main_~i~0_11)) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_13, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_13, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11, ULTIMATE.start_main_#t~post0=|v_ULTIMATE.start_main_#t~post0_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0, ULTIMATE.start_main_#t~post0] 67#L4-3 [2020-06-22 06:36:25,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 06:36:25,556 INFO L82 PathProgramCache]: Analyzing trace with hash 62, now seen corresponding path program 4 times [2020-06-22 06:36:25,557 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 06:36:25,557 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 06:36:25,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 06:36:25,558 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 06:36:25,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 06:36:25,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 06:36:25,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 06:36:25,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 06:36:25,562 INFO L82 PathProgramCache]: Analyzing trace with hash 62368451, now seen corresponding path program 3 times [2020-06-22 06:36:25,562 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 06:36:25,563 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 06:36:25,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 06:36:25,563 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 06:36:25,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 06:36:25,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 06:36:25,621 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 06:36:25,622 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 06:36:25,622 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 06:36:25,636 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2020-06-22 06:36:25,653 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2020-06-22 06:36:25,653 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-06-22 06:36:25,654 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 5 conjunts are in the unsatisfiable core [2020-06-22 06:36:25,655 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 06:36:25,659 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 06:36:25,685 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-06-22 06:36:25,685 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2020-06-22 06:36:25,686 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-06-22 06:36:25,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-06-22 06:36:25,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2020-06-22 06:36:25,687 INFO L87 Difference]: Start difference. First operand 6 states and 7 transitions. cyclomatic complexity: 2 Second operand 6 states. [2020-06-22 06:36:25,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 06:36:25,703 INFO L93 Difference]: Finished difference Result 7 states and 8 transitions. [2020-06-22 06:36:25,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-06-22 06:36:25,704 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 7 states and 8 transitions. [2020-06-22 06:36:25,704 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2020-06-22 06:36:25,705 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 7 states to 7 states and 8 transitions. [2020-06-22 06:36:25,705 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2020-06-22 06:36:25,705 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2020-06-22 06:36:25,705 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 8 transitions. [2020-06-22 06:36:25,705 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 06:36:25,705 INFO L706 BuchiCegarLoop]: Abstraction has 7 states and 8 transitions. [2020-06-22 06:36:25,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states and 8 transitions. [2020-06-22 06:36:25,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2020-06-22 06:36:25,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-06-22 06:36:25,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 8 transitions. [2020-06-22 06:36:25,707 INFO L729 BuchiCegarLoop]: Abstraction has 7 states and 8 transitions. [2020-06-22 06:36:25,707 INFO L609 BuchiCegarLoop]: Abstraction has 7 states and 8 transitions. [2020-06-22 06:36:25,707 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2020-06-22 06:36:25,707 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 8 transitions. [2020-06-22 06:36:25,708 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2020-06-22 06:36:25,708 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 06:36:25,708 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 06:36:25,708 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] [2020-06-22 06:36:25,708 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [4, 1, 1] [2020-06-22 06:36:25,709 INFO L794 eck$LassoCheckResult]: Stem: 100#ULTIMATE.startENTRY [31] ULTIMATE.startENTRY-->L4-3: Formula: (and (= v_ULTIMATE.start_main_~c~0_1 0) (= v_ULTIMATE.start_main_~i~0_1 0)) InVars {} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_1, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_1, ULTIMATE.start_main_#t~post0=|v_ULTIMATE.start_main_#t~post0_1|, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~i~0, ULTIMATE.start_main_#t~post0] 101#L4-3 [2020-06-22 06:36:25,709 INFO L796 eck$LassoCheckResult]: Loop: 101#L4-3 [35] L4-3-->L5-3: Formula: (and (< v_ULTIMATE.start_main_~i~0_9 10) (= v_ULTIMATE.start_main_~j~0_8 3)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 102#L5-3 [46] L5-3-->L5-3: Formula: (and (= (+ v_ULTIMATE.start_main_~j~0_12 1) v_ULTIMATE.start_main_~j~0_10) (= (+ v_ULTIMATE.start_main_~c~0_9 1) v_ULTIMATE.start_main_~c~0_8) (< v_ULTIMATE.start_main_~j~0_12 12)) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_12, ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_9} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_10, ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0, ULTIMATE.start_main_~c~0] 103#L5-3 [46] L5-3-->L5-3: Formula: (and (= (+ v_ULTIMATE.start_main_~j~0_12 1) v_ULTIMATE.start_main_~j~0_10) (= (+ v_ULTIMATE.start_main_~c~0_9 1) v_ULTIMATE.start_main_~c~0_8) (< v_ULTIMATE.start_main_~j~0_12 12)) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_12, ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_9} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_10, ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0, ULTIMATE.start_main_~c~0] 106#L5-3 [46] L5-3-->L5-3: Formula: (and (= (+ v_ULTIMATE.start_main_~j~0_12 1) v_ULTIMATE.start_main_~j~0_10) (= (+ v_ULTIMATE.start_main_~c~0_9 1) v_ULTIMATE.start_main_~c~0_8) (< v_ULTIMATE.start_main_~j~0_12 12)) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_12, ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_9} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_10, ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0, ULTIMATE.start_main_~c~0] 105#L5-3 [46] L5-3-->L5-3: Formula: (and (= (+ v_ULTIMATE.start_main_~j~0_12 1) v_ULTIMATE.start_main_~j~0_10) (= (+ v_ULTIMATE.start_main_~c~0_9 1) v_ULTIMATE.start_main_~c~0_8) (< v_ULTIMATE.start_main_~j~0_12 12)) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_12, ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_9} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_10, ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0, ULTIMATE.start_main_~c~0] 104#L5-3 [47] L5-3-->L4-3: Formula: (and (<= 12 v_ULTIMATE.start_main_~j~0_13) (= (+ v_ULTIMATE.start_main_~i~0_12 1) v_ULTIMATE.start_main_~i~0_11)) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_13, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_13, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11, ULTIMATE.start_main_#t~post0=|v_ULTIMATE.start_main_#t~post0_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0, ULTIMATE.start_main_#t~post0] 101#L4-3 [2020-06-22 06:36:25,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 06:36:25,710 INFO L82 PathProgramCache]: Analyzing trace with hash 62, now seen corresponding path program 5 times [2020-06-22 06:36:25,710 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 06:36:25,710 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 06:36:25,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 06:36:25,711 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 06:36:25,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 06:36:25,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 06:36:25,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 06:36:25,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 06:36:25,715 INFO L82 PathProgramCache]: Analyzing trace with hash 1933421997, now seen corresponding path program 4 times [2020-06-22 06:36:25,715 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 06:36:25,715 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 06:36:25,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 06:36:25,716 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 06:36:25,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 06:36:25,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 06:36:25,764 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 06:36:25,765 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 06:36:25,765 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 06:36:25,781 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2020-06-22 06:36:25,795 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-06-22 06:36:25,795 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-06-22 06:36:25,796 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 6 conjunts are in the unsatisfiable core [2020-06-22 06:36:25,797 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 06:36:25,802 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 06:36:25,828 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-06-22 06:36:25,828 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2020-06-22 06:36:25,828 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-06-22 06:36:25,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-06-22 06:36:25,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2020-06-22 06:36:25,829 INFO L87 Difference]: Start difference. First operand 7 states and 8 transitions. cyclomatic complexity: 2 Second operand 7 states. [2020-06-22 06:36:25,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 06:36:25,850 INFO L93 Difference]: Finished difference Result 8 states and 9 transitions. [2020-06-22 06:36:25,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-06-22 06:36:25,850 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 8 states and 9 transitions. [2020-06-22 06:36:25,851 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2020-06-22 06:36:25,852 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 8 states to 8 states and 9 transitions. [2020-06-22 06:36:25,852 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2020-06-22 06:36:25,852 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2020-06-22 06:36:25,852 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 9 transitions. [2020-06-22 06:36:25,852 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 06:36:25,852 INFO L706 BuchiCegarLoop]: Abstraction has 8 states and 9 transitions. [2020-06-22 06:36:25,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states and 9 transitions. [2020-06-22 06:36:25,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2020-06-22 06:36:25,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-06-22 06:36:25,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 9 transitions. [2020-06-22 06:36:25,854 INFO L729 BuchiCegarLoop]: Abstraction has 8 states and 9 transitions. [2020-06-22 06:36:25,854 INFO L609 BuchiCegarLoop]: Abstraction has 8 states and 9 transitions. [2020-06-22 06:36:25,854 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2020-06-22 06:36:25,854 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 9 transitions. [2020-06-22 06:36:25,855 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2020-06-22 06:36:25,855 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 06:36:25,855 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 06:36:25,855 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] [2020-06-22 06:36:25,855 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [5, 1, 1] [2020-06-22 06:36:25,856 INFO L794 eck$LassoCheckResult]: Stem: 140#ULTIMATE.startENTRY [31] ULTIMATE.startENTRY-->L4-3: Formula: (and (= v_ULTIMATE.start_main_~c~0_1 0) (= v_ULTIMATE.start_main_~i~0_1 0)) InVars {} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_1, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_1, ULTIMATE.start_main_#t~post0=|v_ULTIMATE.start_main_#t~post0_1|, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~i~0, ULTIMATE.start_main_#t~post0] 141#L4-3 [2020-06-22 06:36:25,856 INFO L796 eck$LassoCheckResult]: Loop: 141#L4-3 [35] L4-3-->L5-3: Formula: (and (< v_ULTIMATE.start_main_~i~0_9 10) (= v_ULTIMATE.start_main_~j~0_8 3)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 142#L5-3 [46] L5-3-->L5-3: Formula: (and (= (+ v_ULTIMATE.start_main_~j~0_12 1) v_ULTIMATE.start_main_~j~0_10) (= (+ v_ULTIMATE.start_main_~c~0_9 1) v_ULTIMATE.start_main_~c~0_8) (< v_ULTIMATE.start_main_~j~0_12 12)) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_12, ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_9} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_10, ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0, ULTIMATE.start_main_~c~0] 143#L5-3 [46] L5-3-->L5-3: Formula: (and (= (+ v_ULTIMATE.start_main_~j~0_12 1) v_ULTIMATE.start_main_~j~0_10) (= (+ v_ULTIMATE.start_main_~c~0_9 1) v_ULTIMATE.start_main_~c~0_8) (< v_ULTIMATE.start_main_~j~0_12 12)) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_12, ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_9} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_10, ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0, ULTIMATE.start_main_~c~0] 147#L5-3 [46] L5-3-->L5-3: Formula: (and (= (+ v_ULTIMATE.start_main_~j~0_12 1) v_ULTIMATE.start_main_~j~0_10) (= (+ v_ULTIMATE.start_main_~c~0_9 1) v_ULTIMATE.start_main_~c~0_8) (< v_ULTIMATE.start_main_~j~0_12 12)) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_12, ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_9} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_10, ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0, ULTIMATE.start_main_~c~0] 146#L5-3 [46] L5-3-->L5-3: Formula: (and (= (+ v_ULTIMATE.start_main_~j~0_12 1) v_ULTIMATE.start_main_~j~0_10) (= (+ v_ULTIMATE.start_main_~c~0_9 1) v_ULTIMATE.start_main_~c~0_8) (< v_ULTIMATE.start_main_~j~0_12 12)) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_12, ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_9} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_10, ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0, ULTIMATE.start_main_~c~0] 145#L5-3 [46] L5-3-->L5-3: Formula: (and (= (+ v_ULTIMATE.start_main_~j~0_12 1) v_ULTIMATE.start_main_~j~0_10) (= (+ v_ULTIMATE.start_main_~c~0_9 1) v_ULTIMATE.start_main_~c~0_8) (< v_ULTIMATE.start_main_~j~0_12 12)) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_12, ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_9} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_10, ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0, ULTIMATE.start_main_~c~0] 144#L5-3 [47] L5-3-->L4-3: Formula: (and (<= 12 v_ULTIMATE.start_main_~j~0_13) (= (+ v_ULTIMATE.start_main_~i~0_12 1) v_ULTIMATE.start_main_~i~0_11)) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_13, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_13, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11, ULTIMATE.start_main_#t~post0=|v_ULTIMATE.start_main_#t~post0_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0, ULTIMATE.start_main_#t~post0] 141#L4-3 [2020-06-22 06:36:25,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 06:36:25,856 INFO L82 PathProgramCache]: Analyzing trace with hash 62, now seen corresponding path program 6 times [2020-06-22 06:36:25,857 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 06:36:25,857 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 06:36:25,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 06:36:25,858 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 06:36:25,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 06:36:25,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 06:36:25,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 06:36:25,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 06:36:25,861 INFO L82 PathProgramCache]: Analyzing trace with hash -193460221, now seen corresponding path program 5 times [2020-06-22 06:36:25,862 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 06:36:25,862 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 06:36:25,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 06:36:25,862 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 06:36:25,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 06:36:25,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 06:36:25,918 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 06:36:25,918 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 06:36:25,918 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 06:36:25,931 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2020-06-22 06:36:25,942 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2020-06-22 06:36:25,942 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-06-22 06:36:25,943 INFO L256 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 7 conjunts are in the unsatisfiable core [2020-06-22 06:36:25,944 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 06:36:25,949 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 06:36:25,976 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-06-22 06:36:25,976 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2020-06-22 06:36:25,977 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-06-22 06:36:25,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-06-22 06:36:25,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2020-06-22 06:36:25,978 INFO L87 Difference]: Start difference. First operand 8 states and 9 transitions. cyclomatic complexity: 2 Second operand 8 states. [2020-06-22 06:36:25,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 06:36:25,999 INFO L93 Difference]: Finished difference Result 9 states and 10 transitions. [2020-06-22 06:36:25,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-06-22 06:36:25,999 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 9 states and 10 transitions. [2020-06-22 06:36:26,000 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2020-06-22 06:36:26,001 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 9 states to 9 states and 10 transitions. [2020-06-22 06:36:26,001 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2020-06-22 06:36:26,001 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2020-06-22 06:36:26,001 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 10 transitions. [2020-06-22 06:36:26,001 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 06:36:26,001 INFO L706 BuchiCegarLoop]: Abstraction has 9 states and 10 transitions. [2020-06-22 06:36:26,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 10 transitions. [2020-06-22 06:36:26,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2020-06-22 06:36:26,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-06-22 06:36:26,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2020-06-22 06:36:26,003 INFO L729 BuchiCegarLoop]: Abstraction has 9 states and 10 transitions. [2020-06-22 06:36:26,003 INFO L609 BuchiCegarLoop]: Abstraction has 9 states and 10 transitions. [2020-06-22 06:36:26,003 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2020-06-22 06:36:26,003 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 10 transitions. [2020-06-22 06:36:26,004 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2020-06-22 06:36:26,004 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 06:36:26,004 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 06:36:26,004 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] [2020-06-22 06:36:26,004 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [6, 1, 1] [2020-06-22 06:36:26,005 INFO L794 eck$LassoCheckResult]: Stem: 186#ULTIMATE.startENTRY [31] ULTIMATE.startENTRY-->L4-3: Formula: (and (= v_ULTIMATE.start_main_~c~0_1 0) (= v_ULTIMATE.start_main_~i~0_1 0)) InVars {} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_1, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_1, ULTIMATE.start_main_#t~post0=|v_ULTIMATE.start_main_#t~post0_1|, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~i~0, ULTIMATE.start_main_#t~post0] 187#L4-3 [2020-06-22 06:36:26,005 INFO L796 eck$LassoCheckResult]: Loop: 187#L4-3 [35] L4-3-->L5-3: Formula: (and (< v_ULTIMATE.start_main_~i~0_9 10) (= v_ULTIMATE.start_main_~j~0_8 3)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 188#L5-3 [46] L5-3-->L5-3: Formula: (and (= (+ v_ULTIMATE.start_main_~j~0_12 1) v_ULTIMATE.start_main_~j~0_10) (= (+ v_ULTIMATE.start_main_~c~0_9 1) v_ULTIMATE.start_main_~c~0_8) (< v_ULTIMATE.start_main_~j~0_12 12)) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_12, ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_9} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_10, ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0, ULTIMATE.start_main_~c~0] 189#L5-3 [46] L5-3-->L5-3: Formula: (and (= (+ v_ULTIMATE.start_main_~j~0_12 1) v_ULTIMATE.start_main_~j~0_10) (= (+ v_ULTIMATE.start_main_~c~0_9 1) v_ULTIMATE.start_main_~c~0_8) (< v_ULTIMATE.start_main_~j~0_12 12)) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_12, ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_9} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_10, ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0, ULTIMATE.start_main_~c~0] 194#L5-3 [46] L5-3-->L5-3: Formula: (and (= (+ v_ULTIMATE.start_main_~j~0_12 1) v_ULTIMATE.start_main_~j~0_10) (= (+ v_ULTIMATE.start_main_~c~0_9 1) v_ULTIMATE.start_main_~c~0_8) (< v_ULTIMATE.start_main_~j~0_12 12)) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_12, ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_9} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_10, ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0, ULTIMATE.start_main_~c~0] 193#L5-3 [46] L5-3-->L5-3: Formula: (and (= (+ v_ULTIMATE.start_main_~j~0_12 1) v_ULTIMATE.start_main_~j~0_10) (= (+ v_ULTIMATE.start_main_~c~0_9 1) v_ULTIMATE.start_main_~c~0_8) (< v_ULTIMATE.start_main_~j~0_12 12)) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_12, ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_9} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_10, ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0, ULTIMATE.start_main_~c~0] 192#L5-3 [46] L5-3-->L5-3: Formula: (and (= (+ v_ULTIMATE.start_main_~j~0_12 1) v_ULTIMATE.start_main_~j~0_10) (= (+ v_ULTIMATE.start_main_~c~0_9 1) v_ULTIMATE.start_main_~c~0_8) (< v_ULTIMATE.start_main_~j~0_12 12)) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_12, ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_9} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_10, ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0, ULTIMATE.start_main_~c~0] 191#L5-3 [46] L5-3-->L5-3: Formula: (and (= (+ v_ULTIMATE.start_main_~j~0_12 1) v_ULTIMATE.start_main_~j~0_10) (= (+ v_ULTIMATE.start_main_~c~0_9 1) v_ULTIMATE.start_main_~c~0_8) (< v_ULTIMATE.start_main_~j~0_12 12)) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_12, ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_9} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_10, ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0, ULTIMATE.start_main_~c~0] 190#L5-3 [47] L5-3-->L4-3: Formula: (and (<= 12 v_ULTIMATE.start_main_~j~0_13) (= (+ v_ULTIMATE.start_main_~i~0_12 1) v_ULTIMATE.start_main_~i~0_11)) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_13, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_13, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11, ULTIMATE.start_main_#t~post0=|v_ULTIMATE.start_main_#t~post0_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0, ULTIMATE.start_main_#t~post0] 187#L4-3 [2020-06-22 06:36:26,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 06:36:26,006 INFO L82 PathProgramCache]: Analyzing trace with hash 62, now seen corresponding path program 7 times [2020-06-22 06:36:26,006 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 06:36:26,006 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 06:36:26,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 06:36:26,007 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 06:36:26,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 06:36:26,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 06:36:26,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 06:36:26,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 06:36:26,010 INFO L82 PathProgramCache]: Analyzing trace with hash -1702299539, now seen corresponding path program 6 times [2020-06-22 06:36:26,010 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 06:36:26,010 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 06:36:26,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 06:36:26,011 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 06:36:26,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 06:36:26,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 06:36:26,089 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 06:36:26,090 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 06:36:26,090 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 06:36:26,103 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2020-06-22 06:36:26,115 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2020-06-22 06:36:26,115 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-06-22 06:36:26,116 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 06:36:26,117 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 06:36:26,123 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 06:36:26,149 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-06-22 06:36:26,149 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2020-06-22 06:36:26,149 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-06-22 06:36:26,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-06-22 06:36:26,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2020-06-22 06:36:26,159 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. cyclomatic complexity: 2 Second operand 9 states. [2020-06-22 06:36:26,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 06:36:26,203 INFO L93 Difference]: Finished difference Result 10 states and 11 transitions. [2020-06-22 06:36:26,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-06-22 06:36:26,204 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 10 states and 11 transitions. [2020-06-22 06:36:26,204 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2020-06-22 06:36:26,205 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 10 states to 10 states and 11 transitions. [2020-06-22 06:36:26,205 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2020-06-22 06:36:26,205 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2020-06-22 06:36:26,205 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 11 transitions. [2020-06-22 06:36:26,206 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 06:36:26,206 INFO L706 BuchiCegarLoop]: Abstraction has 10 states and 11 transitions. [2020-06-22 06:36:26,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 11 transitions. [2020-06-22 06:36:26,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2020-06-22 06:36:26,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-06-22 06:36:26,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 11 transitions. [2020-06-22 06:36:26,207 INFO L729 BuchiCegarLoop]: Abstraction has 10 states and 11 transitions. [2020-06-22 06:36:26,207 INFO L609 BuchiCegarLoop]: Abstraction has 10 states and 11 transitions. [2020-06-22 06:36:26,208 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2020-06-22 06:36:26,208 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 11 transitions. [2020-06-22 06:36:26,208 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2020-06-22 06:36:26,208 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 06:36:26,208 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 06:36:26,209 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] [2020-06-22 06:36:26,209 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [7, 1, 1] [2020-06-22 06:36:26,209 INFO L794 eck$LassoCheckResult]: Stem: 238#ULTIMATE.startENTRY [31] ULTIMATE.startENTRY-->L4-3: Formula: (and (= v_ULTIMATE.start_main_~c~0_1 0) (= v_ULTIMATE.start_main_~i~0_1 0)) InVars {} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_1, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_1, ULTIMATE.start_main_#t~post0=|v_ULTIMATE.start_main_#t~post0_1|, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~i~0, ULTIMATE.start_main_#t~post0] 239#L4-3 [2020-06-22 06:36:26,210 INFO L796 eck$LassoCheckResult]: Loop: 239#L4-3 [35] L4-3-->L5-3: Formula: (and (< v_ULTIMATE.start_main_~i~0_9 10) (= v_ULTIMATE.start_main_~j~0_8 3)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 240#L5-3 [46] L5-3-->L5-3: Formula: (and (= (+ v_ULTIMATE.start_main_~j~0_12 1) v_ULTIMATE.start_main_~j~0_10) (= (+ v_ULTIMATE.start_main_~c~0_9 1) v_ULTIMATE.start_main_~c~0_8) (< v_ULTIMATE.start_main_~j~0_12 12)) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_12, ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_9} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_10, ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0, ULTIMATE.start_main_~c~0] 241#L5-3 [46] L5-3-->L5-3: Formula: (and (= (+ v_ULTIMATE.start_main_~j~0_12 1) v_ULTIMATE.start_main_~j~0_10) (= (+ v_ULTIMATE.start_main_~c~0_9 1) v_ULTIMATE.start_main_~c~0_8) (< v_ULTIMATE.start_main_~j~0_12 12)) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_12, ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_9} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_10, ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0, ULTIMATE.start_main_~c~0] 247#L5-3 [46] L5-3-->L5-3: Formula: (and (= (+ v_ULTIMATE.start_main_~j~0_12 1) v_ULTIMATE.start_main_~j~0_10) (= (+ v_ULTIMATE.start_main_~c~0_9 1) v_ULTIMATE.start_main_~c~0_8) (< v_ULTIMATE.start_main_~j~0_12 12)) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_12, ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_9} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_10, ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0, ULTIMATE.start_main_~c~0] 246#L5-3 [46] L5-3-->L5-3: Formula: (and (= (+ v_ULTIMATE.start_main_~j~0_12 1) v_ULTIMATE.start_main_~j~0_10) (= (+ v_ULTIMATE.start_main_~c~0_9 1) v_ULTIMATE.start_main_~c~0_8) (< v_ULTIMATE.start_main_~j~0_12 12)) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_12, ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_9} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_10, ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0, ULTIMATE.start_main_~c~0] 245#L5-3 [46] L5-3-->L5-3: Formula: (and (= (+ v_ULTIMATE.start_main_~j~0_12 1) v_ULTIMATE.start_main_~j~0_10) (= (+ v_ULTIMATE.start_main_~c~0_9 1) v_ULTIMATE.start_main_~c~0_8) (< v_ULTIMATE.start_main_~j~0_12 12)) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_12, ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_9} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_10, ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0, ULTIMATE.start_main_~c~0] 244#L5-3 [46] L5-3-->L5-3: Formula: (and (= (+ v_ULTIMATE.start_main_~j~0_12 1) v_ULTIMATE.start_main_~j~0_10) (= (+ v_ULTIMATE.start_main_~c~0_9 1) v_ULTIMATE.start_main_~c~0_8) (< v_ULTIMATE.start_main_~j~0_12 12)) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_12, ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_9} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_10, ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0, ULTIMATE.start_main_~c~0] 243#L5-3 [46] L5-3-->L5-3: Formula: (and (= (+ v_ULTIMATE.start_main_~j~0_12 1) v_ULTIMATE.start_main_~j~0_10) (= (+ v_ULTIMATE.start_main_~c~0_9 1) v_ULTIMATE.start_main_~c~0_8) (< v_ULTIMATE.start_main_~j~0_12 12)) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_12, ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_9} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_10, ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0, ULTIMATE.start_main_~c~0] 242#L5-3 [47] L5-3-->L4-3: Formula: (and (<= 12 v_ULTIMATE.start_main_~j~0_13) (= (+ v_ULTIMATE.start_main_~i~0_12 1) v_ULTIMATE.start_main_~i~0_11)) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_13, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_13, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11, ULTIMATE.start_main_#t~post0=|v_ULTIMATE.start_main_#t~post0_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0, ULTIMATE.start_main_#t~post0] 239#L4-3 [2020-06-22 06:36:26,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 06:36:26,210 INFO L82 PathProgramCache]: Analyzing trace with hash 62, now seen corresponding path program 8 times [2020-06-22 06:36:26,210 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 06:36:26,210 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 06:36:26,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 06:36:26,211 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 06:36:26,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 06:36:26,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 06:36:26,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 06:36:26,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 06:36:26,215 INFO L82 PathProgramCache]: Analyzing trace with hash -1231678141, now seen corresponding path program 7 times [2020-06-22 06:36:26,215 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 06:36:26,215 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 06:36:26,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 06:36:26,216 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 06:36:26,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 06:36:26,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 06:36:26,291 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 06:36:26,291 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 06:36:26,291 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 06:36:26,304 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 06:36:26,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 06:36:26,316 INFO L256 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 9 conjunts are in the unsatisfiable core [2020-06-22 06:36:26,317 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 06:36:26,323 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 06:36:26,352 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-06-22 06:36:26,352 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2020-06-22 06:36:26,352 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-06-22 06:36:26,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-06-22 06:36:26,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2020-06-22 06:36:26,353 INFO L87 Difference]: Start difference. First operand 10 states and 11 transitions. cyclomatic complexity: 2 Second operand 10 states. [2020-06-22 06:36:26,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 06:36:26,375 INFO L93 Difference]: Finished difference Result 11 states and 12 transitions. [2020-06-22 06:36:26,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-06-22 06:36:26,376 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 12 transitions. [2020-06-22 06:36:26,376 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2020-06-22 06:36:26,377 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 11 states and 12 transitions. [2020-06-22 06:36:26,377 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2020-06-22 06:36:26,377 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2020-06-22 06:36:26,377 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 12 transitions. [2020-06-22 06:36:26,377 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 06:36:26,377 INFO L706 BuchiCegarLoop]: Abstraction has 11 states and 12 transitions. [2020-06-22 06:36:26,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 12 transitions. [2020-06-22 06:36:26,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2020-06-22 06:36:26,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-06-22 06:36:26,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2020-06-22 06:36:26,379 INFO L729 BuchiCegarLoop]: Abstraction has 11 states and 12 transitions. [2020-06-22 06:36:26,379 INFO L609 BuchiCegarLoop]: Abstraction has 11 states and 12 transitions. [2020-06-22 06:36:26,379 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2020-06-22 06:36:26,379 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 12 transitions. [2020-06-22 06:36:26,380 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2020-06-22 06:36:26,380 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 06:36:26,380 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 06:36:26,380 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] [2020-06-22 06:36:26,380 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [8, 1, 1] [2020-06-22 06:36:26,381 INFO L794 eck$LassoCheckResult]: Stem: 296#ULTIMATE.startENTRY [31] ULTIMATE.startENTRY-->L4-3: Formula: (and (= v_ULTIMATE.start_main_~c~0_1 0) (= v_ULTIMATE.start_main_~i~0_1 0)) InVars {} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_1, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_1, ULTIMATE.start_main_#t~post0=|v_ULTIMATE.start_main_#t~post0_1|, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~i~0, ULTIMATE.start_main_#t~post0] 297#L4-3 [2020-06-22 06:36:26,381 INFO L796 eck$LassoCheckResult]: Loop: 297#L4-3 [35] L4-3-->L5-3: Formula: (and (< v_ULTIMATE.start_main_~i~0_9 10) (= v_ULTIMATE.start_main_~j~0_8 3)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 298#L5-3 [46] L5-3-->L5-3: Formula: (and (= (+ v_ULTIMATE.start_main_~j~0_12 1) v_ULTIMATE.start_main_~j~0_10) (= (+ v_ULTIMATE.start_main_~c~0_9 1) v_ULTIMATE.start_main_~c~0_8) (< v_ULTIMATE.start_main_~j~0_12 12)) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_12, ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_9} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_10, ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0, ULTIMATE.start_main_~c~0] 299#L5-3 [46] L5-3-->L5-3: Formula: (and (= (+ v_ULTIMATE.start_main_~j~0_12 1) v_ULTIMATE.start_main_~j~0_10) (= (+ v_ULTIMATE.start_main_~c~0_9 1) v_ULTIMATE.start_main_~c~0_8) (< v_ULTIMATE.start_main_~j~0_12 12)) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_12, ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_9} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_10, ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0, ULTIMATE.start_main_~c~0] 306#L5-3 [46] L5-3-->L5-3: Formula: (and (= (+ v_ULTIMATE.start_main_~j~0_12 1) v_ULTIMATE.start_main_~j~0_10) (= (+ v_ULTIMATE.start_main_~c~0_9 1) v_ULTIMATE.start_main_~c~0_8) (< v_ULTIMATE.start_main_~j~0_12 12)) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_12, ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_9} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_10, ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0, ULTIMATE.start_main_~c~0] 305#L5-3 [46] L5-3-->L5-3: Formula: (and (= (+ v_ULTIMATE.start_main_~j~0_12 1) v_ULTIMATE.start_main_~j~0_10) (= (+ v_ULTIMATE.start_main_~c~0_9 1) v_ULTIMATE.start_main_~c~0_8) (< v_ULTIMATE.start_main_~j~0_12 12)) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_12, ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_9} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_10, ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0, ULTIMATE.start_main_~c~0] 304#L5-3 [46] L5-3-->L5-3: Formula: (and (= (+ v_ULTIMATE.start_main_~j~0_12 1) v_ULTIMATE.start_main_~j~0_10) (= (+ v_ULTIMATE.start_main_~c~0_9 1) v_ULTIMATE.start_main_~c~0_8) (< v_ULTIMATE.start_main_~j~0_12 12)) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_12, ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_9} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_10, ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0, ULTIMATE.start_main_~c~0] 303#L5-3 [46] L5-3-->L5-3: Formula: (and (= (+ v_ULTIMATE.start_main_~j~0_12 1) v_ULTIMATE.start_main_~j~0_10) (= (+ v_ULTIMATE.start_main_~c~0_9 1) v_ULTIMATE.start_main_~c~0_8) (< v_ULTIMATE.start_main_~j~0_12 12)) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_12, ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_9} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_10, ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0, ULTIMATE.start_main_~c~0] 302#L5-3 [46] L5-3-->L5-3: Formula: (and (= (+ v_ULTIMATE.start_main_~j~0_12 1) v_ULTIMATE.start_main_~j~0_10) (= (+ v_ULTIMATE.start_main_~c~0_9 1) v_ULTIMATE.start_main_~c~0_8) (< v_ULTIMATE.start_main_~j~0_12 12)) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_12, ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_9} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_10, ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0, ULTIMATE.start_main_~c~0] 301#L5-3 [46] L5-3-->L5-3: Formula: (and (= (+ v_ULTIMATE.start_main_~j~0_12 1) v_ULTIMATE.start_main_~j~0_10) (= (+ v_ULTIMATE.start_main_~c~0_9 1) v_ULTIMATE.start_main_~c~0_8) (< v_ULTIMATE.start_main_~j~0_12 12)) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_12, ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_9} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_10, ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0, ULTIMATE.start_main_~c~0] 300#L5-3 [47] L5-3-->L4-3: Formula: (and (<= 12 v_ULTIMATE.start_main_~j~0_13) (= (+ v_ULTIMATE.start_main_~i~0_12 1) v_ULTIMATE.start_main_~i~0_11)) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_13, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_13, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11, ULTIMATE.start_main_#t~post0=|v_ULTIMATE.start_main_#t~post0_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0, ULTIMATE.start_main_#t~post0] 297#L4-3 [2020-06-22 06:36:26,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 06:36:26,382 INFO L82 PathProgramCache]: Analyzing trace with hash 62, now seen corresponding path program 9 times [2020-06-22 06:36:26,382 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 06:36:26,382 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 06:36:26,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 06:36:26,383 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 06:36:26,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 06:36:26,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 06:36:26,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 06:36:26,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 06:36:26,387 INFO L82 PathProgramCache]: Analyzing trace with hash 472683309, now seen corresponding path program 8 times [2020-06-22 06:36:26,387 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 06:36:26,387 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 06:36:26,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 06:36:26,388 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 06:36:26,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 06:36:26,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 06:36:26,482 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 06:36:26,482 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 06:36:26,482 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 06:36:26,495 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2020-06-22 06:36:26,513 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-06-22 06:36:26,513 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-06-22 06:36:26,514 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 10 conjunts are in the unsatisfiable core [2020-06-22 06:36:26,515 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 06:36:26,524 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 06:36:26,552 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-06-22 06:36:26,552 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2020-06-22 06:36:26,552 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-06-22 06:36:26,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-06-22 06:36:26,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2020-06-22 06:36:26,553 INFO L87 Difference]: Start difference. First operand 11 states and 12 transitions. cyclomatic complexity: 2 Second operand 11 states. [2020-06-22 06:36:26,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 06:36:26,600 INFO L93 Difference]: Finished difference Result 12 states and 13 transitions. [2020-06-22 06:36:26,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-06-22 06:36:26,601 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 13 transitions. [2020-06-22 06:36:26,602 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2020-06-22 06:36:26,602 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 12 states and 13 transitions. [2020-06-22 06:36:26,602 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2020-06-22 06:36:26,603 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2020-06-22 06:36:26,603 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 13 transitions. [2020-06-22 06:36:26,603 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 06:36:26,603 INFO L706 BuchiCegarLoop]: Abstraction has 12 states and 13 transitions. [2020-06-22 06:36:26,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 13 transitions. [2020-06-22 06:36:26,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2020-06-22 06:36:26,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-06-22 06:36:26,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 13 transitions. [2020-06-22 06:36:26,605 INFO L729 BuchiCegarLoop]: Abstraction has 12 states and 13 transitions. [2020-06-22 06:36:26,605 INFO L609 BuchiCegarLoop]: Abstraction has 12 states and 13 transitions. [2020-06-22 06:36:26,605 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2020-06-22 06:36:26,605 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 13 transitions. [2020-06-22 06:36:26,606 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2020-06-22 06:36:26,606 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 06:36:26,606 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 06:36:26,606 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] [2020-06-22 06:36:26,606 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [9, 1, 1] [2020-06-22 06:36:26,607 INFO L794 eck$LassoCheckResult]: Stem: 360#ULTIMATE.startENTRY [31] ULTIMATE.startENTRY-->L4-3: Formula: (and (= v_ULTIMATE.start_main_~c~0_1 0) (= v_ULTIMATE.start_main_~i~0_1 0)) InVars {} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_1, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_1, ULTIMATE.start_main_#t~post0=|v_ULTIMATE.start_main_#t~post0_1|, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~i~0, ULTIMATE.start_main_#t~post0] 361#L4-3 [2020-06-22 06:36:26,607 INFO L796 eck$LassoCheckResult]: Loop: 361#L4-3 [35] L4-3-->L5-3: Formula: (and (< v_ULTIMATE.start_main_~i~0_9 10) (= v_ULTIMATE.start_main_~j~0_8 3)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 362#L5-3 [46] L5-3-->L5-3: Formula: (and (= (+ v_ULTIMATE.start_main_~j~0_12 1) v_ULTIMATE.start_main_~j~0_10) (= (+ v_ULTIMATE.start_main_~c~0_9 1) v_ULTIMATE.start_main_~c~0_8) (< v_ULTIMATE.start_main_~j~0_12 12)) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_12, ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_9} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_10, ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0, ULTIMATE.start_main_~c~0] 363#L5-3 [46] L5-3-->L5-3: Formula: (and (= (+ v_ULTIMATE.start_main_~j~0_12 1) v_ULTIMATE.start_main_~j~0_10) (= (+ v_ULTIMATE.start_main_~c~0_9 1) v_ULTIMATE.start_main_~c~0_8) (< v_ULTIMATE.start_main_~j~0_12 12)) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_12, ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_9} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_10, ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0, ULTIMATE.start_main_~c~0] 371#L5-3 [46] L5-3-->L5-3: Formula: (and (= (+ v_ULTIMATE.start_main_~j~0_12 1) v_ULTIMATE.start_main_~j~0_10) (= (+ v_ULTIMATE.start_main_~c~0_9 1) v_ULTIMATE.start_main_~c~0_8) (< v_ULTIMATE.start_main_~j~0_12 12)) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_12, ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_9} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_10, ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0, ULTIMATE.start_main_~c~0] 370#L5-3 [46] L5-3-->L5-3: Formula: (and (= (+ v_ULTIMATE.start_main_~j~0_12 1) v_ULTIMATE.start_main_~j~0_10) (= (+ v_ULTIMATE.start_main_~c~0_9 1) v_ULTIMATE.start_main_~c~0_8) (< v_ULTIMATE.start_main_~j~0_12 12)) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_12, ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_9} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_10, ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0, ULTIMATE.start_main_~c~0] 369#L5-3 [46] L5-3-->L5-3: Formula: (and (= (+ v_ULTIMATE.start_main_~j~0_12 1) v_ULTIMATE.start_main_~j~0_10) (= (+ v_ULTIMATE.start_main_~c~0_9 1) v_ULTIMATE.start_main_~c~0_8) (< v_ULTIMATE.start_main_~j~0_12 12)) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_12, ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_9} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_10, ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0, ULTIMATE.start_main_~c~0] 368#L5-3 [46] L5-3-->L5-3: Formula: (and (= (+ v_ULTIMATE.start_main_~j~0_12 1) v_ULTIMATE.start_main_~j~0_10) (= (+ v_ULTIMATE.start_main_~c~0_9 1) v_ULTIMATE.start_main_~c~0_8) (< v_ULTIMATE.start_main_~j~0_12 12)) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_12, ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_9} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_10, ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0, ULTIMATE.start_main_~c~0] 367#L5-3 [46] L5-3-->L5-3: Formula: (and (= (+ v_ULTIMATE.start_main_~j~0_12 1) v_ULTIMATE.start_main_~j~0_10) (= (+ v_ULTIMATE.start_main_~c~0_9 1) v_ULTIMATE.start_main_~c~0_8) (< v_ULTIMATE.start_main_~j~0_12 12)) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_12, ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_9} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_10, ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0, ULTIMATE.start_main_~c~0] 366#L5-3 [46] L5-3-->L5-3: Formula: (and (= (+ v_ULTIMATE.start_main_~j~0_12 1) v_ULTIMATE.start_main_~j~0_10) (= (+ v_ULTIMATE.start_main_~c~0_9 1) v_ULTIMATE.start_main_~c~0_8) (< v_ULTIMATE.start_main_~j~0_12 12)) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_12, ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_9} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_10, ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0, ULTIMATE.start_main_~c~0] 365#L5-3 [46] L5-3-->L5-3: Formula: (and (= (+ v_ULTIMATE.start_main_~j~0_12 1) v_ULTIMATE.start_main_~j~0_10) (= (+ v_ULTIMATE.start_main_~c~0_9 1) v_ULTIMATE.start_main_~c~0_8) (< v_ULTIMATE.start_main_~j~0_12 12)) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_12, ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_9} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_10, ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0, ULTIMATE.start_main_~c~0] 364#L5-3 [47] L5-3-->L4-3: Formula: (and (<= 12 v_ULTIMATE.start_main_~j~0_13) (= (+ v_ULTIMATE.start_main_~i~0_12 1) v_ULTIMATE.start_main_~i~0_11)) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_13, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_13, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11, ULTIMATE.start_main_#t~post0=|v_ULTIMATE.start_main_#t~post0_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0, ULTIMATE.start_main_#t~post0] 361#L4-3 [2020-06-22 06:36:26,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 06:36:26,608 INFO L82 PathProgramCache]: Analyzing trace with hash 62, now seen corresponding path program 10 times [2020-06-22 06:36:26,608 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 06:36:26,608 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 06:36:26,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 06:36:26,609 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 06:36:26,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 06:36:26,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 06:36:26,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 06:36:26,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 06:36:26,612 INFO L82 PathProgramCache]: Analyzing trace with hash 1768280707, now seen corresponding path program 9 times [2020-06-22 06:36:26,612 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 06:36:26,612 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 06:36:26,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 06:36:26,613 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 06:36:26,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 06:36:26,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 06:36:26,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 06:36:26,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 06:36:26,634 INFO L82 PathProgramCache]: Analyzing trace with hash 1052391974, now seen corresponding path program 1 times [2020-06-22 06:36:26,634 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 06:36:26,634 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 06:36:26,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 06:36:26,635 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 06:36:26,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 06:36:26,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 06:36:26,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 06:36:26,839 WARN L188 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 67 [2020-06-22 06:36:26,866 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 06:36:26,867 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 06:36:26,867 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 06:36:26,867 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 06:36:26,867 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2020-06-22 06:36:26,868 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 06:36:26,868 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 06:36:26,868 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 06:36:26,868 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration10_Loop [2020-06-22 06:36:26,868 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 06:36:26,868 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 06:36:26,883 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 06:36:26,894 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 06:36:26,896 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 06:36:26,899 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 06:36:26,948 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 06:36:26,948 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 06:36:26,955 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 06:36:26,955 INFO L163 nArgumentSynthesizer]: Using integer mode. 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 06:36:26,988 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-06-22 06:36:26,989 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 06:36:27,019 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-06-22 06:36:27,021 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 06:36:27,021 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 06:36:27,021 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 06:36:27,022 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 06:36:27,022 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 06:36:27,022 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 06:36:27,022 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 06:36:27,022 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 06:36:27,022 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration10_Loop [2020-06-22 06:36:27,022 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 06:36:27,022 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 06:36:27,024 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 06:36:27,030 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 06:36:27,033 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 06:36:27,037 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 06:36:27,080 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 06:36:27,087 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 06:36:27,089 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 06:36:27,090 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 06:36:27,091 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 06:36:27,091 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 06:36:27,091 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 06:36:27,092 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 06:36:27,094 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 06:36:27,094 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 06:36:27,098 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 06:36:27,102 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-06-22 06:36:27,103 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2020-06-22 06:36:27,105 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 06:36:27,105 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-06-22 06:36:27,106 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 06:36:27,106 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 06:36:27,107 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-06-22 06:36:27,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 06:36:27,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 06:36:27,137 INFO L256 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 2 conjunts are in the unsatisfiable core [2020-06-22 06:36:27,137 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 06:36:27,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 06:36:27,155 INFO L256 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 06:36:27,156 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 06:36:27,169 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 06:36:27,213 INFO L98 LoopCannibalizer]: 2 predicates before loop cannibalization 2 predicates after loop cannibalization [2020-06-22 06:36:27,216 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 06:36:27,217 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 12 states and 13 transitions. cyclomatic complexity: 2 Second operand 3 states. [2020-06-22 06:36:27,250 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 06:36:27,251 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 06:36:27,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-06-22 06:36:27,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 9 transitions. [2020-06-22 06:36:27,253 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 1 letters. Loop has 11 letters. [2020-06-22 06:36:27,255 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 06:36:27,255 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 12 letters. Loop has 11 letters. [2020-06-22 06:36:27,256 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 06:36:27,256 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 1 letters. Loop has 22 letters. [2020-06-22 06:36:27,257 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 06:36:27,261 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 26 transitions. [2020-06-22 06:36:27,262 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-06-22 06:36:27,262 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 23 states and 26 transitions. [2020-06-22 06:36:27,263 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2020-06-22 06:36:27,263 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2020-06-22 06:36:27,263 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 26 transitions. [2020-06-22 06:36:27,263 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 06:36:27,263 INFO L706 BuchiCegarLoop]: Abstraction has 23 states and 26 transitions. [2020-06-22 06:36:27,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 26 transitions. [2020-06-22 06:36:27,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 14. [2020-06-22 06:36:27,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-06-22 06:36:27,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 17 transitions. [2020-06-22 06:36:27,265 INFO L729 BuchiCegarLoop]: Abstraction has 14 states and 17 transitions. [2020-06-22 06:36:27,265 INFO L609 BuchiCegarLoop]: Abstraction has 14 states and 17 transitions. [2020-06-22 06:36:27,265 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2020-06-22 06:36:27,265 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 17 transitions. [2020-06-22 06:36:27,266 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-06-22 06:36:27,266 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 06:36:27,266 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 06:36:27,266 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-06-22 06:36:27,266 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1] [2020-06-22 06:36:27,267 INFO L794 eck$LassoCheckResult]: Stem: 457#ULTIMATE.startENTRY [31] ULTIMATE.startENTRY-->L4-3: Formula: (and (= v_ULTIMATE.start_main_~c~0_1 0) (= v_ULTIMATE.start_main_~i~0_1 0)) InVars {} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_1, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_1, ULTIMATE.start_main_#t~post0=|v_ULTIMATE.start_main_#t~post0_1|, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~i~0, ULTIMATE.start_main_#t~post0] 458#L4-3 [35] L4-3-->L5-3: Formula: (and (< v_ULTIMATE.start_main_~i~0_9 10) (= v_ULTIMATE.start_main_~j~0_8 3)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 460#L5-3 [2020-06-22 06:36:27,267 INFO L796 eck$LassoCheckResult]: Loop: 460#L5-3 [46] L5-3-->L5-3: Formula: (and (= (+ v_ULTIMATE.start_main_~j~0_12 1) v_ULTIMATE.start_main_~j~0_10) (= (+ v_ULTIMATE.start_main_~c~0_9 1) v_ULTIMATE.start_main_~c~0_8) (< v_ULTIMATE.start_main_~j~0_12 12)) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_12, ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_9} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_10, ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0, ULTIMATE.start_main_~c~0] 460#L5-3 [2020-06-22 06:36:27,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 06:36:27,267 INFO L82 PathProgramCache]: Analyzing trace with hash 1957, now seen corresponding path program 1 times [2020-06-22 06:36:27,267 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 06:36:27,267 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 06:36:27,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 06:36:27,269 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 06:36:27,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 06:36:27,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 06:36:27,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 06:36:27,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 06:36:27,273 INFO L82 PathProgramCache]: Analyzing trace with hash 77, now seen corresponding path program 1 times [2020-06-22 06:36:27,273 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 06:36:27,273 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 06:36:27,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 06:36:27,273 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 06:36:27,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 06:36:27,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 06:36:27,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 06:36:27,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 06:36:27,277 INFO L82 PathProgramCache]: Analyzing trace with hash 60713, now seen corresponding path program 1 times [2020-06-22 06:36:27,277 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 06:36:27,277 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 06:36:27,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 06:36:27,278 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 06:36:27,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 06:36:27,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 06:36:27,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 06:36:27,295 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 06:36:27,296 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 06:36:27,296 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 06:36:27,296 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 06:36:27,296 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2020-06-22 06:36:27,296 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 06:36:27,296 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 06:36:27,296 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 06:36:27,296 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration11_Loop [2020-06-22 06:36:27,297 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 06:36:27,297 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 06:36:27,298 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 06:36:27,301 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 06:36:27,327 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 06:36:27,327 INFO L412 LassoAnalysis]: Checking for nontermination... 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 06:36:27,332 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 06:36:27,332 INFO L163 nArgumentSynthesizer]: Using integer mode. 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 06:36:27,365 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-06-22 06:36:27,365 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 06:36:27,399 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 06:36:27,400 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 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 06:36:27,428 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 06:36:27,429 INFO L163 nArgumentSynthesizer]: Using integer mode. 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 06:36:27,460 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-06-22 06:36:27,460 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 06:36:27,491 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-06-22 06:36:27,492 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 06:36:27,493 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 06:36:27,493 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 06:36:27,493 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 06:36:27,493 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 06:36:27,493 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 06:36:27,493 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 06:36:27,493 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 06:36:27,493 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration11_Loop [2020-06-22 06:36:27,493 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 06:36:27,494 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 06:36:27,495 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 06:36:27,498 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 06:36:27,536 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 06:36:27,536 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 06:36:27,537 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 06:36:27,538 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 06:36:27,538 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 06:36:27,538 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 06:36:27,538 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 06:36:27,538 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 06:36:27,539 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 06:36:27,539 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 06:36:27,541 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 06:36:27,542 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 06:36:27,542 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 06:36:27,542 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 06:36:27,542 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 06:36:27,543 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 06:36:27,543 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 06:36:27,543 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 06:36:27,544 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 06:36:27,546 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 06:36:27,548 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-06-22 06:36:27,548 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2020-06-22 06:36:27,548 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 06:36:27,548 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-06-22 06:36:27,548 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 06:36:27,549 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 06:36:27,549 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-06-22 06:36:27,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 06:36:27,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 06:36:27,571 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 2 conjunts are in the unsatisfiable core [2020-06-22 06:36:27,571 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 06:36:27,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 06:36:27,574 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 06:36:27,575 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 06:36:27,575 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 06:36:27,575 INFO L98 LoopCannibalizer]: 1 predicates before loop cannibalization 1 predicates after loop cannibalization [2020-06-22 06:36:27,575 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 06:36:27,576 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 14 states and 17 transitions. cyclomatic complexity: 5 Second operand 2 states. [2020-06-22 06:36:27,585 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 06:36:27,586 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 06:36:27,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-06-22 06:36:27,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2020-06-22 06:36:27,587 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 2 letters. Loop has 1 letters. [2020-06-22 06:36:27,587 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 06:36:27,587 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 3 letters. Loop has 1 letters. [2020-06-22 06:36:27,587 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 06:36:27,587 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 2 letters. Loop has 2 letters. [2020-06-22 06:36:27,587 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 06:36:27,588 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 19 transitions. [2020-06-22 06:36:27,589 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-06-22 06:36:27,589 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 0 states and 0 transitions. [2020-06-22 06:36:27,589 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-06-22 06:36:27,589 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-06-22 06:36:27,590 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-06-22 06:36:27,590 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 06:36:27,590 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 06:36:27,590 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 06:36:27,590 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 06:36:27,590 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2020-06-22 06:36:27,590 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-06-22 06:36:27,590 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-06-22 06:36:27,590 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-06-22 06:36:27,596 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 06:36:27 BasicIcfg [2020-06-22 06:36:27,596 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-06-22 06:36:27,597 INFO L168 Benchmark]: Toolchain (without parser) took 3357.53 ms. Allocated memory was 514.9 MB in the beginning and 598.2 MB in the end (delta: 83.4 MB). Free memory was 437.7 MB in the beginning and 551.8 MB in the end (delta: -114.0 MB). There was no memory consumed. Max. memory is 50.3 GB. [2020-06-22 06:36:27,598 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 514.9 MB. Free memory is still 456.9 MB. There was no memory consumed. Max. memory is 50.3 GB. [2020-06-22 06:36:27,598 INFO L168 Benchmark]: CACSL2BoogieTranslator took 288.18 ms. Allocated memory was 514.9 MB in the beginning and 564.1 MB in the end (delta: 49.3 MB). Free memory was 437.1 MB in the beginning and 535.5 MB in the end (delta: -98.5 MB). Peak memory consumption was 29.3 MB. Max. memory is 50.3 GB. [2020-06-22 06:36:27,599 INFO L168 Benchmark]: Boogie Procedure Inliner took 36.65 ms. Allocated memory is still 564.1 MB. Free memory was 535.5 MB in the beginning and 533.9 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 50.3 GB. [2020-06-22 06:36:27,600 INFO L168 Benchmark]: Boogie Preprocessor took 19.41 ms. Allocated memory is still 564.1 MB. Free memory was 533.9 MB in the beginning and 532.5 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 50.3 GB. [2020-06-22 06:36:27,600 INFO L168 Benchmark]: RCFGBuilder took 196.67 ms. Allocated memory is still 564.1 MB. Free memory was 532.5 MB in the beginning and 521.6 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 50.3 GB. [2020-06-22 06:36:27,601 INFO L168 Benchmark]: BlockEncodingV2 took 74.68 ms. Allocated memory is still 564.1 MB. Free memory was 521.6 MB in the beginning and 516.6 MB in the end (delta: 5.0 MB). Peak memory consumption was 5.0 MB. Max. memory is 50.3 GB. [2020-06-22 06:36:27,601 INFO L168 Benchmark]: TraceAbstraction took 154.81 ms. Allocated memory is still 564.1 MB. Free memory was 516.6 MB in the beginning and 507.4 MB in the end (delta: 9.2 MB). Peak memory consumption was 9.2 MB. Max. memory is 50.3 GB. [2020-06-22 06:36:27,602 INFO L168 Benchmark]: BuchiAutomizer took 2582.05 ms. Allocated memory was 564.1 MB in the beginning and 598.2 MB in the end (delta: 34.1 MB). Free memory was 507.4 MB in the beginning and 551.8 MB in the end (delta: -44.4 MB). There was no memory consumed. Max. memory is 50.3 GB. [2020-06-22 06:36:27,607 INFO L337 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 9 locations, 12 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 514.9 MB. Free memory is still 456.9 MB. There was no memory consumed. Max. memory is 50.3 GB. * CACSL2BoogieTranslator took 288.18 ms. Allocated memory was 514.9 MB in the beginning and 564.1 MB in the end (delta: 49.3 MB). Free memory was 437.1 MB in the beginning and 535.5 MB in the end (delta: -98.5 MB). Peak memory consumption was 29.3 MB. Max. memory is 50.3 GB. * Boogie Procedure Inliner took 36.65 ms. Allocated memory is still 564.1 MB. Free memory was 535.5 MB in the beginning and 533.9 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 50.3 GB. * Boogie Preprocessor took 19.41 ms. Allocated memory is still 564.1 MB. Free memory was 533.9 MB in the beginning and 532.5 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 50.3 GB. * RCFGBuilder took 196.67 ms. Allocated memory is still 564.1 MB. Free memory was 532.5 MB in the beginning and 521.6 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 50.3 GB. * BlockEncodingV2 took 74.68 ms. Allocated memory is still 564.1 MB. Free memory was 521.6 MB in the beginning and 516.6 MB in the end (delta: 5.0 MB). Peak memory consumption was 5.0 MB. Max. memory is 50.3 GB. * TraceAbstraction took 154.81 ms. Allocated memory is still 564.1 MB. Free memory was 516.6 MB in the beginning and 507.4 MB in the end (delta: 9.2 MB). Peak memory consumption was 9.2 MB. Max. memory is 50.3 GB. * BuchiAutomizer took 2582.05 ms. Allocated memory was 564.1 MB in the beginning and 598.2 MB in the end (delta: 34.1 MB). Free memory was 507.4 MB in the beginning and 551.8 MB in the end (delta: -44.4 MB). There was no memory consumed. 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: 4]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 5]: 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.5s and 12 iterations. TraceHistogramMax:9. Analysis of lassos took 1.9s. Construction of modules took 0.1s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 3. Minimization of det autom 10. Minimization of nondet autom 1. Automata minimization 0.0s AutomataMinimizationTime, 10 MinimizatonAttempts, 9 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 14 states and ocurred in iteration 10. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 45/45 HoareTripleCheckerStatistics: 37 SDtfs, 14 SDslu, 1 SDs, 0 SdLazy, 125 SolverSat, 15 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI9 SFLT2 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital18 mio100 ax100 hnf100 lsp57 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq160 hnf93 smp100 dnf100 smp100 tf113 neg100 sie111 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 17ms VariablesStem: 0 VariablesLoop: 2 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 1 LassoNonterminationAnalysisUnsat: 2 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.2s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! !SESSION 2020-06-22 06:36:21.050 ----------------------------------------------- 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 06:36:27.840 !MESSAGE The workspace will exit with unsaved changes in this session. Received shutdown request... Ultimate: GTK+ Version Check