YES Ultimate: Cannot open display: This is Ultimate 0.1.24-8dc7c08-m [2020-06-22 02:36:38,867 INFO L170 SettingsManager]: Resetting all preferences to default values... [2020-06-22 02:36:38,869 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2020-06-22 02:36:38,881 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-06-22 02:36:38,881 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-06-22 02:36:38,882 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-06-22 02:36:38,883 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-06-22 02:36:38,885 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2020-06-22 02:36:38,886 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-06-22 02:36:38,887 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-06-22 02:36:38,888 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-06-22 02:36:38,888 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-06-22 02:36:38,889 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-06-22 02:36:38,890 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-06-22 02:36:38,891 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-06-22 02:36:38,891 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-06-22 02:36:38,892 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-06-22 02:36:38,894 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-06-22 02:36:38,896 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2020-06-22 02:36:38,897 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-06-22 02:36:38,898 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-06-22 02:36:38,899 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-06-22 02:36:38,901 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-06-22 02:36:38,901 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-06-22 02:36:38,902 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-06-22 02:36:38,902 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-06-22 02:36:38,903 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-06-22 02:36:38,903 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-06-22 02:36:38,904 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-06-22 02:36:38,904 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-06-22 02:36:38,905 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-06-22 02:36:38,906 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2020-06-22 02:36:38,907 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-06-22 02:36:38,907 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2020-06-22 02:36:38,907 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-06-22 02:36:38,908 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-06-22 02:36:38,908 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2020-06-22 02:36:38,909 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2020-06-22 02:36:38,909 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2020-06-22 02:36:38,910 INFO L98 SettingsManager]: Beginning loading settings from /export/starexec/sandbox/solver/bin/./../termcomp2017.epf [2020-06-22 02:36:38,924 INFO L110 SettingsManager]: Loading preferences was successful [2020-06-22 02:36:38,924 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2020-06-22 02:36:38,925 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-06-22 02:36:38,925 INFO L133 SettingsManager]: * Rewrite not-equals=true [2020-06-22 02:36:38,926 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2020-06-22 02:36:38,926 INFO L133 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE [2020-06-22 02:36:38,926 INFO L133 SettingsManager]: * Use SBE=true [2020-06-22 02:36:38,926 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-06-22 02:36:38,926 INFO L133 SettingsManager]: * Use old map elimination=false [2020-06-22 02:36:38,926 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2020-06-22 02:36:38,927 INFO L133 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION [2020-06-22 02:36:38,927 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2020-06-22 02:36:38,927 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-06-22 02:36:38,927 INFO L133 SettingsManager]: * Construct termination proof for TermComp=true [2020-06-22 02:36:38,927 INFO L133 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 02:36:38,927 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-06-22 02:36:38,928 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-06-22 02:36:38,928 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2020-06-22 02:36:38,928 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2020-06-22 02:36:38,928 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-06-22 02:36:38,928 INFO L133 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE [2020-06-22 02:36:38,929 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-06-22 02:36:38,929 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-06-22 02:36:38,929 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-06-22 02:36:38,929 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-06-22 02:36:38,929 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-06-22 02:36:38,929 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-06-22 02:36:38,930 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2020-06-22 02:36:38,930 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-06-22 02:36:38,955 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-06-22 02:36:38,968 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-06-22 02:36:38,972 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-06-22 02:36:38,973 INFO L271 PluginConnector]: Initializing CDTParser... [2020-06-22 02:36:38,973 INFO L276 PluginConnector]: CDTParser initialized [2020-06-22 02:36:38,974 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox/benchmark/theBenchmark.c [2020-06-22 02:36:39,040 INFO L221 CDTParser]: Created temporary CDT project at /export/starexec/sandbox/tmp/60d157374ffd4604a5a283c7cdbd37ec/FLAGd86adbf8f [2020-06-22 02:36:39,391 INFO L307 CDTParser]: Found 1 translation units. [2020-06-22 02:36:39,392 INFO L161 CDTParser]: Scanning /export/starexec/sandbox/benchmark/theBenchmark.c [2020-06-22 02:36:39,399 INFO L355 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox/tmp/60d157374ffd4604a5a283c7cdbd37ec/FLAGd86adbf8f [2020-06-22 02:36:39,790 INFO L363 CDTParser]: Successfully deleted /export/starexec/sandbox/tmp/60d157374ffd4604a5a283c7cdbd37ec [2020-06-22 02:36:39,802 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-06-22 02:36:39,805 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. [2020-06-22 02:36:39,806 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-06-22 02:36:39,806 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-06-22 02:36:39,810 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2020-06-22 02:36:39,811 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.06 02:36:39" (1/1) ... [2020-06-22 02:36:39,814 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5be1ec7a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 02:36:39, skipping insertion in model container [2020-06-22 02:36:39,814 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.06 02:36:39" (1/1) ... [2020-06-22 02:36:39,822 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-06-22 02:36:39,840 INFO L176 MainTranslator]: Built tables and reachable declarations [2020-06-22 02:36:39,994 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-06-22 02:36:39,999 INFO L191 MainTranslator]: Completed pre-run [2020-06-22 02:36:40,068 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-06-22 02:36:40,082 INFO L195 MainTranslator]: Completed translation [2020-06-22 02:36:40,083 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 02:36:40 WrapperNode [2020-06-22 02:36:40,083 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-06-22 02:36:40,084 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-06-22 02:36:40,084 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-06-22 02:36:40,084 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2020-06-22 02:36:40,093 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 02:36:40" (1/1) ... [2020-06-22 02:36:40,099 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 02:36:40" (1/1) ... [2020-06-22 02:36:40,118 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-06-22 02:36:40,118 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-06-22 02:36:40,119 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-06-22 02:36:40,119 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2020-06-22 02:36:40,128 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 02:36:40" (1/1) ... [2020-06-22 02:36:40,128 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 02:36:40" (1/1) ... [2020-06-22 02:36:40,129 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 02:36:40" (1/1) ... [2020-06-22 02:36:40,129 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 02:36:40" (1/1) ... [2020-06-22 02:36:40,131 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 02:36:40" (1/1) ... [2020-06-22 02:36:40,135 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 02:36:40" (1/1) ... [2020-06-22 02:36:40,136 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 02:36:40" (1/1) ... [2020-06-22 02:36:40,137 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-06-22 02:36:40,138 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-06-22 02:36:40,138 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-06-22 02:36:40,138 INFO L276 PluginConnector]: RCFGBuilder initialized [2020-06-22 02:36:40,139 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 02:36:40" (1/1) ... No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-06-22 02:36:40,205 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-06-22 02:36:40,205 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-06-22 02:36:40,333 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-06-22 02:36:40,333 INFO L286 CfgBuilder]: Removed 5 assue(true) statements. [2020-06-22 02:36:40,335 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 02:36:40 BoogieIcfgContainer [2020-06-22 02:36:40,335 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-06-22 02:36:40,335 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- [2020-06-22 02:36:40,335 INFO L271 PluginConnector]: Initializing BlockEncodingV2... [2020-06-22 02:36:40,337 INFO L276 PluginConnector]: BlockEncodingV2 initialized [2020-06-22 02:36:40,338 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 02:36:40" (1/1) ... [2020-06-22 02:36:40,352 INFO L313 BlockEncoder]: Initial Icfg 8 locations, 11 edges [2020-06-22 02:36:40,353 INFO L258 BlockEncoder]: Using Remove infeasible edges [2020-06-22 02:36:40,354 INFO L263 BlockEncoder]: Using Maximize final states [2020-06-22 02:36:40,355 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false [2020-06-22 02:36:40,355 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE [2020-06-22 02:36:40,357 INFO L296 BlockEncoder]: Using Remove sink states [2020-06-22 02:36:40,358 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true [2020-06-22 02:36:40,358 INFO L179 BlockEncoder]: Using Rewrite not-equals [2020-06-22 02:36:40,374 INFO L185 BlockEncoder]: Using Use SBE [2020-06-22 02:36:40,391 INFO L200 BlockEncoder]: SBE split 3 edges [2020-06-22 02:36:40,395 INFO L70 emoveInfeasibleEdges]: Removed 1 edges and 0 locations because of local infeasibility [2020-06-22 02:36:40,397 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-06-22 02:36:40,408 INFO L100 BaseMinimizeStates]: Removed 4 edges and 2 locations by large block encoding [2020-06-22 02:36:40,410 INFO L70 RemoveSinkStates]: Removed 5 edges and 2 locations by removing sink states [2020-06-22 02:36:40,411 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-06-22 02:36:40,411 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-06-22 02:36:40,417 INFO L100 BaseMinimizeStates]: Removed 2 edges and 1 locations by large block encoding [2020-06-22 02:36:40,417 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states [2020-06-22 02:36:40,417 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-06-22 02:36:40,417 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-06-22 02:36:40,418 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding [2020-06-22 02:36:40,418 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states [2020-06-22 02:36:40,418 INFO L313 BlockEncoder]: Encoded RCFG 3 locations, 7 edges [2020-06-22 02:36:40,419 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 02:36:40 BasicIcfg [2020-06-22 02:36:40,419 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- [2020-06-22 02:36:40,420 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-06-22 02:36:40,420 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-06-22 02:36:40,423 INFO L276 PluginConnector]: TraceAbstraction initialized [2020-06-22 02:36:40,423 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.06 02:36:39" (1/4) ... [2020-06-22 02:36:40,424 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4dd09d8d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 02:36:40, skipping insertion in model container [2020-06-22 02:36:40,425 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 02:36:40" (2/4) ... [2020-06-22 02:36:40,425 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4dd09d8d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 02:36:40, skipping insertion in model container [2020-06-22 02:36:40,425 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 02:36:40" (3/4) ... [2020-06-22 02:36:40,426 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4dd09d8d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 02:36:40, skipping insertion in model container [2020-06-22 02:36:40,426 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 02:36:40" (4/4) ... [2020-06-22 02:36:40,427 INFO L112 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-06-22 02:36:40,437 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2020-06-22 02:36:40,445 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 0 error locations. [2020-06-22 02:36:40,462 INFO L257 AbstractCegarLoop]: Starting to check reachability of 0 error locations. [2020-06-22 02:36:40,490 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2020-06-22 02:36:40,490 INFO L382 AbstractCegarLoop]: Interprodecural is true [2020-06-22 02:36:40,490 INFO L383 AbstractCegarLoop]: Hoare is true [2020-06-22 02:36:40,491 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2020-06-22 02:36:40,491 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-06-22 02:36:40,491 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-06-22 02:36:40,491 INFO L387 AbstractCegarLoop]: Difference is false [2020-06-22 02:36:40,491 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-06-22 02:36:40,491 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-06-22 02:36:40,505 INFO L276 IsEmpty]: Start isEmpty. Operand 3 states. [2020-06-22 02:36:40,511 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-06-22 02:36:40,514 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 3 states. [2020-06-22 02:36:40,565 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-06-22 02:36:40,565 INFO L448 ceAbstractionStarter]: For program point L24(lines 24 28) no Hoare annotation was computed. [2020-06-22 02:36:40,565 INFO L451 ceAbstractionStarter]: At program point L24-2(lines 23 29) the Hoare annotation is: true [2020-06-22 02:36:40,575 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 02:36:40 BasicIcfg [2020-06-22 02:36:40,575 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-06-22 02:36:40,576 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-06-22 02:36:40,576 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-06-22 02:36:40,579 INFO L276 PluginConnector]: BuchiAutomizer initialized [2020-06-22 02:36:40,580 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 02:36:40,580 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.06 02:36:39" (1/5) ... [2020-06-22 02:36:40,581 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@56402750 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.06 02:36:40, skipping insertion in model container [2020-06-22 02:36:40,581 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 02:36:40,581 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 02:36:40" (2/5) ... [2020-06-22 02:36:40,581 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@56402750 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.06 02:36:40, skipping insertion in model container [2020-06-22 02:36:40,581 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 02:36:40,582 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 02:36:40" (3/5) ... [2020-06-22 02:36:40,582 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@56402750 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 02:36:40, skipping insertion in model container [2020-06-22 02:36:40,582 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 02:36:40,582 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 02:36:40" (4/5) ... [2020-06-22 02:36:40,583 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@56402750 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 02:36:40, skipping insertion in model container [2020-06-22 02:36:40,583 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 02:36:40,583 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 02:36:40" (5/5) ... [2020-06-22 02:36:40,584 INFO L375 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-06-22 02:36:40,611 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2020-06-22 02:36:40,612 INFO L374 BuchiCegarLoop]: Interprodecural is true [2020-06-22 02:36:40,612 INFO L375 BuchiCegarLoop]: Hoare is true [2020-06-22 02:36:40,612 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-06-22 02:36:40,612 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-06-22 02:36:40,612 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-06-22 02:36:40,612 INFO L379 BuchiCegarLoop]: Difference is false [2020-06-22 02:36:40,612 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-06-22 02:36:40,613 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-06-22 02:36:40,616 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. [2020-06-22 02:36:40,633 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-06-22 02:36:40,633 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 02:36:40,634 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 02:36:40,641 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] [2020-06-22 02:36:40,641 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-06-22 02:36:40,641 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2020-06-22 02:36:40,641 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. [2020-06-22 02:36:40,642 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-06-22 02:36:40,642 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 02:36:40,642 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 02:36:40,642 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] [2020-06-22 02:36:40,643 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-06-22 02:36:40,648 INFO L794 eck$LassoCheckResult]: Stem: 3#ULTIMATE.startENTRYtrue [54] ULTIMATE.startENTRY-->L24-2: Formula: (and (= v_ULTIMATE.start_main_~tmp~0_11 (+ v_ULTIMATE.start_main_~id~0_10 1)) (<= 0 v_ULTIMATE.start_main_~id~0_10) (< v_ULTIMATE.start_main_~id~0_10 v_ULTIMATE.start_main_~maxId~0_10)) InVars {} OutVars{ULTIMATE.start_main_~maxId~0=v_ULTIMATE.start_main_~maxId~0_10, ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_6|, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_6|, ULTIMATE.start_main_~tmp~0=v_ULTIMATE.start_main_~tmp~0_11, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_6|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_6|, ULTIMATE.start_main_~id~0=v_ULTIMATE.start_main_~id~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_~maxId~0, ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_~tmp~0, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#res, ULTIMATE.start_main_~id~0] 4#L24-2true [2020-06-22 02:36:40,648 INFO L796 eck$LassoCheckResult]: Loop: 4#L24-2true [48] L24-2-->L24: Formula: (and (< v_ULTIMATE.start_main_~tmp~0_10 v_ULTIMATE.start_main_~id~0_9) (> 0 |v_ULTIMATE.start_main_#t~nondet2_5|)) InVars {ULTIMATE.start_main_~tmp~0=v_ULTIMATE.start_main_~tmp~0_10, ULTIMATE.start_main_~id~0=v_ULTIMATE.start_main_~id~0_9, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_5|} OutVars{ULTIMATE.start_main_~tmp~0=v_ULTIMATE.start_main_~tmp~0_10, ULTIMATE.start_main_~id~0=v_ULTIMATE.start_main_~id~0_9, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2] 5#L24true [37] L24-->L24-2: Formula: (and (<= v_ULTIMATE.start_main_~tmp~0_2 v_ULTIMATE.start_main_~maxId~0_1) (= v_ULTIMATE.start_main_~tmp~0_1 (+ v_ULTIMATE.start_main_~tmp~0_2 1))) InVars {ULTIMATE.start_main_~maxId~0=v_ULTIMATE.start_main_~maxId~0_1, ULTIMATE.start_main_~tmp~0=v_ULTIMATE.start_main_~tmp~0_2} OutVars{ULTIMATE.start_main_~maxId~0=v_ULTIMATE.start_main_~maxId~0_1, ULTIMATE.start_main_~tmp~0=v_ULTIMATE.start_main_~tmp~0_1} AuxVars[] AssignedVars[ULTIMATE.start_main_~tmp~0] 4#L24-2true [2020-06-22 02:36:40,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 02:36:40,654 INFO L82 PathProgramCache]: Analyzing trace with hash 85, now seen corresponding path program 1 times [2020-06-22 02:36:40,658 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 02:36:40,658 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 02:36:40,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:36:40,686 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 02:36:40,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:36:40,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 02:36:40,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 02:36:40,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 02:36:40,729 INFO L82 PathProgramCache]: Analyzing trace with hash 2486, now seen corresponding path program 1 times [2020-06-22 02:36:40,729 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 02:36:40,730 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 02:36:40,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:36:40,731 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 02:36:40,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:36:40,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 02:36:40,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 02:36:40,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 02:36:40,741 INFO L82 PathProgramCache]: Analyzing trace with hash 83210, now seen corresponding path program 1 times [2020-06-22 02:36:40,741 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 02:36:40,741 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 02:36:40,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:36:40,743 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 02:36:40,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:36:40,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 02:36:40,789 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 02:36:40,791 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 02:36:40,791 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 02:36:40,836 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 02:36:40,837 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 02:36:40,837 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 02:36:40,837 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 02:36:40,838 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2020-06-22 02:36:40,838 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 02:36:40,838 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 02:36:40,838 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 02:36:40,838 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Loop [2020-06-22 02:36:40,838 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 02:36:40,839 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 02:36:40,857 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 02:36:40,866 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 02:36:40,870 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 02:36:40,884 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 02:36:40,958 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 02:36:40,959 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 2 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 2 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 02:36:40,966 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 02:36:40,967 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 02:36:41,000 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 02:36:41,000 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_1=1} Honda state: {v_rep~unnamed0~0~true_1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 3 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 3 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 02:36:41,006 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 02:36:41,006 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 02:36:41,033 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 02:36:41,034 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_1=0} Honda state: {v_rep~unnamed0~0~false_1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 4 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 4 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 02:36:41,038 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 02:36:41,038 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 5 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 5 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 02:36:41,068 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-06-22 02:36:41,069 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 02:36:41,277 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-06-22 02:36:41,280 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 02:36:41,280 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 02:36:41,280 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 02:36:41,280 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 02:36:41,280 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 02:36:41,281 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 02:36:41,281 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 02:36:41,281 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 02:36:41,281 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Loop [2020-06-22 02:36:41,281 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 02:36:41,281 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 02:36:41,283 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 02:36:41,287 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 02:36:41,291 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 02:36:41,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 02:36:41,377 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 02:36:41,382 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 02:36:41,384 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 02:36:41,386 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 02:36:41,386 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 02:36:41,386 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 02:36:41,386 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 02:36:41,391 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 02:36:41,391 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 02:36:41,398 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 02:36:41,398 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 02:36:41,399 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 02:36:41,399 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 02:36:41,400 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 02:36:41,400 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 02:36:41,403 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 02:36:41,404 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 02:36:41,412 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 02:36:41,413 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 02:36:41,413 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 02:36:41,413 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 02:36:41,414 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 02:36:41,414 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 02:36:41,414 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 02:36:41,415 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 02:36:41,415 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 02:36:41,423 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 02:36:41,434 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2020-06-22 02:36:41,435 INFO L444 ModelExtractionUtils]: 1 out of 5 variables were initially zero. Simplification set additionally 1 variables to zero. [2020-06-22 02:36:41,437 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 02:36:41,437 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-06-22 02:36:41,437 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 02:36:41,438 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~id~0, ULTIMATE.start_main_~tmp~0) = 1*ULTIMATE.start_main_~id~0 - 1*ULTIMATE.start_main_~tmp~0 Supporting invariants [] [2020-06-22 02:36:41,439 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-06-22 02:36:41,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 02:36:41,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 02:36:41,478 INFO L256 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 2 conjunts are in the unsatisfiable core [2020-06-22 02:36:41,493 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 02:36:41,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 02:36:41,502 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 02:36:41,503 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 02:36:41,515 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 02:36:41,545 INFO L98 LoopCannibalizer]: 2 predicates before loop cannibalization 2 predicates after loop cannibalization [2020-06-22 02:36:41,550 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2020-06-22 02:36:41,552 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 3 states. Second operand 3 states. [2020-06-22 02:36:41,621 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 3 states.. Second operand 3 states. Result 13 states and 39 transitions. Complement of second has 6 states. [2020-06-22 02:36:41,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-06-22 02:36:41,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-06-22 02:36:41,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2020-06-22 02:36:41,626 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 1 letters. Loop has 2 letters. [2020-06-22 02:36:41,628 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 02:36:41,628 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 3 letters. Loop has 2 letters. [2020-06-22 02:36:41,628 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 02:36:41,629 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 1 letters. Loop has 4 letters. [2020-06-22 02:36:41,629 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 02:36:41,635 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 39 transitions. [2020-06-22 02:36:41,636 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2020-06-22 02:36:41,641 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 13 states and 39 transitions. [2020-06-22 02:36:41,643 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2020-06-22 02:36:41,643 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2020-06-22 02:36:41,644 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 39 transitions. [2020-06-22 02:36:41,644 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 02:36:41,644 INFO L706 BuchiCegarLoop]: Abstraction has 13 states and 39 transitions. [2020-06-22 02:36:41,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 39 transitions. [2020-06-22 02:36:41,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 11. [2020-06-22 02:36:41,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-06-22 02:36:41,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 36 transitions. [2020-06-22 02:36:41,675 INFO L729 BuchiCegarLoop]: Abstraction has 11 states and 36 transitions. [2020-06-22 02:36:41,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 02:36:41,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 02:36:41,678 INFO L87 Difference]: Start difference. First operand 11 states and 36 transitions. Second operand 3 states. [2020-06-22 02:36:41,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 02:36:41,701 INFO L93 Difference]: Finished difference Result 10 states and 22 transitions. [2020-06-22 02:36:41,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 02:36:41,703 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 10 states and 22 transitions. [2020-06-22 02:36:41,704 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2020-06-22 02:36:41,705 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 10 states to 8 states and 17 transitions. [2020-06-22 02:36:41,705 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2020-06-22 02:36:41,705 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2020-06-22 02:36:41,705 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 17 transitions. [2020-06-22 02:36:41,706 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 02:36:41,706 INFO L706 BuchiCegarLoop]: Abstraction has 8 states and 17 transitions. [2020-06-22 02:36:41,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states and 17 transitions. [2020-06-22 02:36:41,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 5. [2020-06-22 02:36:41,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-06-22 02:36:41,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 11 transitions. [2020-06-22 02:36:41,708 INFO L729 BuchiCegarLoop]: Abstraction has 5 states and 11 transitions. [2020-06-22 02:36:41,708 INFO L609 BuchiCegarLoop]: Abstraction has 5 states and 11 transitions. [2020-06-22 02:36:41,708 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2020-06-22 02:36:41,708 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5 states and 11 transitions. [2020-06-22 02:36:41,708 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-06-22 02:36:41,709 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 02:36:41,709 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 02:36:41,709 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] [2020-06-22 02:36:41,709 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-06-22 02:36:41,709 INFO L794 eck$LassoCheckResult]: Stem: 74#ULTIMATE.startENTRY [54] ULTIMATE.startENTRY-->L24-2: Formula: (and (= v_ULTIMATE.start_main_~tmp~0_11 (+ v_ULTIMATE.start_main_~id~0_10 1)) (<= 0 v_ULTIMATE.start_main_~id~0_10) (< v_ULTIMATE.start_main_~id~0_10 v_ULTIMATE.start_main_~maxId~0_10)) InVars {} OutVars{ULTIMATE.start_main_~maxId~0=v_ULTIMATE.start_main_~maxId~0_10, ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_6|, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_6|, ULTIMATE.start_main_~tmp~0=v_ULTIMATE.start_main_~tmp~0_11, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_6|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_6|, ULTIMATE.start_main_~id~0=v_ULTIMATE.start_main_~id~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_~maxId~0, ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_~tmp~0, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#res, ULTIMATE.start_main_~id~0] 75#L24-2 [2020-06-22 02:36:41,710 INFO L796 eck$LassoCheckResult]: Loop: 75#L24-2 [49] L24-2-->L24: Formula: (and (< 0 |v_ULTIMATE.start_main_#t~nondet2_5|) (> v_ULTIMATE.start_main_~tmp~0_10 v_ULTIMATE.start_main_~id~0_9)) InVars {ULTIMATE.start_main_~tmp~0=v_ULTIMATE.start_main_~tmp~0_10, ULTIMATE.start_main_~id~0=v_ULTIMATE.start_main_~id~0_9, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_5|} OutVars{ULTIMATE.start_main_~tmp~0=v_ULTIMATE.start_main_~tmp~0_10, ULTIMATE.start_main_~id~0=v_ULTIMATE.start_main_~id~0_9, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2] 76#L24 [37] L24-->L24-2: Formula: (and (<= v_ULTIMATE.start_main_~tmp~0_2 v_ULTIMATE.start_main_~maxId~0_1) (= v_ULTIMATE.start_main_~tmp~0_1 (+ v_ULTIMATE.start_main_~tmp~0_2 1))) InVars {ULTIMATE.start_main_~maxId~0=v_ULTIMATE.start_main_~maxId~0_1, ULTIMATE.start_main_~tmp~0=v_ULTIMATE.start_main_~tmp~0_2} OutVars{ULTIMATE.start_main_~maxId~0=v_ULTIMATE.start_main_~maxId~0_1, ULTIMATE.start_main_~tmp~0=v_ULTIMATE.start_main_~tmp~0_1} AuxVars[] AssignedVars[ULTIMATE.start_main_~tmp~0] 75#L24-2 [2020-06-22 02:36:41,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 02:36:41,710 INFO L82 PathProgramCache]: Analyzing trace with hash 85, now seen corresponding path program 2 times [2020-06-22 02:36:41,710 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 02:36:41,710 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 02:36:41,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:36:41,712 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 02:36:41,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:36:41,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 02:36:41,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 02:36:41,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 02:36:41,718 INFO L82 PathProgramCache]: Analyzing trace with hash 2517, now seen corresponding path program 1 times [2020-06-22 02:36:41,718 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 02:36:41,718 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 02:36:41,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:36:41,720 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 02:36:41,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:36:41,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 02:36:41,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 02:36:41,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 02:36:41,727 INFO L82 PathProgramCache]: Analyzing trace with hash 83241, now seen corresponding path program 1 times [2020-06-22 02:36:41,727 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 02:36:41,727 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 02:36:41,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:36:41,729 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 02:36:41,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:36:41,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 02:36:41,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 02:36:41,766 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 02:36:41,766 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 02:36:41,767 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 02:36:41,767 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 02:36:41,767 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2020-06-22 02:36:41,767 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 02:36:41,767 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 02:36:41,767 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 02:36:41,767 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration2_Loop [2020-06-22 02:36:41,767 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 02:36:41,768 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 02:36:41,769 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 02:36:41,780 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 02:36:41,790 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 02:36:41,796 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 02:36:41,845 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 02:36:41,845 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 6 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 6 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 02:36:41,852 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 02:36:41,852 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 02:36:41,880 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 02:36:41,880 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_3=0} Honda state: {v_rep~unnamed0~0~false_3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 7 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 7 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 02:36:41,887 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 02:36:41,887 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 8 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 8 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 02:36:41,921 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-06-22 02:36:41,921 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 02:36:42,127 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-06-22 02:36:42,130 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 02:36:42,130 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 02:36:42,131 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 02:36:42,131 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 02:36:42,131 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 02:36:42,131 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 02:36:42,131 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 02:36:42,131 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 02:36:42,131 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration2_Loop [2020-06-22 02:36:42,131 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 02:36:42,132 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 02:36:42,134 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 02:36:42,143 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 02:36:42,147 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 02:36:42,150 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 02:36:42,215 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 02:36:42,215 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 02:36:42,216 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 02:36:42,216 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 02:36:42,217 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 02:36:42,217 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 02:36:42,217 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 02:36:42,217 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 02:36:42,218 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 02:36:42,218 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 02:36:42,224 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 02:36:42,229 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-06-22 02:36:42,229 INFO L444 ModelExtractionUtils]: 1 out of 5 variables were initially zero. Simplification set additionally 0 variables to zero. [2020-06-22 02:36:42,230 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 02:36:42,230 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-06-22 02:36:42,230 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 02:36:42,230 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~maxId~0, ULTIMATE.start_main_~tmp~0) = 2*ULTIMATE.start_main_~maxId~0 - 2*ULTIMATE.start_main_~tmp~0 + 1 Supporting invariants [] [2020-06-22 02:36:42,230 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-06-22 02:36:42,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 02:36:42,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 02:36:42,257 INFO L256 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 2 conjunts are in the unsatisfiable core [2020-06-22 02:36:42,258 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 02:36:42,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 02:36:42,265 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 02:36:42,265 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 02:36:42,266 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 02:36:42,266 INFO L98 LoopCannibalizer]: 1 predicates before loop cannibalization 1 predicates after loop cannibalization [2020-06-22 02:36:42,267 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2020-06-22 02:36:42,267 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 5 states and 11 transitions. cyclomatic complexity: 7 Second operand 3 states. [2020-06-22 02:36:42,287 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 5 states and 11 transitions. cyclomatic complexity: 7. Second operand 3 states. Result 9 states and 21 transitions. Complement of second has 4 states. [2020-06-22 02:36:42,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2020-06-22 02:36:42,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-06-22 02:36:42,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 11 transitions. [2020-06-22 02:36:42,288 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 1 letters. Loop has 2 letters. [2020-06-22 02:36:42,288 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 02:36:42,288 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 3 letters. Loop has 2 letters. [2020-06-22 02:36:42,289 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 02:36:42,289 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 1 letters. Loop has 4 letters. [2020-06-22 02:36:42,289 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 02:36:42,290 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 9 states and 21 transitions. [2020-06-22 02:36:42,291 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-06-22 02:36:42,292 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 9 states to 9 states and 21 transitions. [2020-06-22 02:36:42,292 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2020-06-22 02:36:42,292 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2020-06-22 02:36:42,293 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 21 transitions. [2020-06-22 02:36:42,293 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 02:36:42,293 INFO L706 BuchiCegarLoop]: Abstraction has 9 states and 21 transitions. [2020-06-22 02:36:42,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 21 transitions. [2020-06-22 02:36:42,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2020-06-22 02:36:42,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-06-22 02:36:42,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 21 transitions. [2020-06-22 02:36:42,296 INFO L729 BuchiCegarLoop]: Abstraction has 9 states and 21 transitions. [2020-06-22 02:36:42,296 INFO L609 BuchiCegarLoop]: Abstraction has 9 states and 21 transitions. [2020-06-22 02:36:42,296 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2020-06-22 02:36:42,296 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 21 transitions. [2020-06-22 02:36:42,297 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-06-22 02:36:42,297 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 02:36:42,297 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 02:36:42,297 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2020-06-22 02:36:42,297 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-06-22 02:36:42,298 INFO L794 eck$LassoCheckResult]: Stem: 116#ULTIMATE.startENTRY [54] ULTIMATE.startENTRY-->L24-2: Formula: (and (= v_ULTIMATE.start_main_~tmp~0_11 (+ v_ULTIMATE.start_main_~id~0_10 1)) (<= 0 v_ULTIMATE.start_main_~id~0_10) (< v_ULTIMATE.start_main_~id~0_10 v_ULTIMATE.start_main_~maxId~0_10)) InVars {} OutVars{ULTIMATE.start_main_~maxId~0=v_ULTIMATE.start_main_~maxId~0_10, ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_6|, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_6|, ULTIMATE.start_main_~tmp~0=v_ULTIMATE.start_main_~tmp~0_11, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_6|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_6|, ULTIMATE.start_main_~id~0=v_ULTIMATE.start_main_~id~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_~maxId~0, ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_~tmp~0, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#res, ULTIMATE.start_main_~id~0] 117#L24-2 [51] L24-2-->L24: Formula: (and (> v_ULTIMATE.start_main_~tmp~0_10 v_ULTIMATE.start_main_~id~0_9) (> 0 |v_ULTIMATE.start_main_#t~nondet2_5|)) InVars {ULTIMATE.start_main_~tmp~0=v_ULTIMATE.start_main_~tmp~0_10, ULTIMATE.start_main_~id~0=v_ULTIMATE.start_main_~id~0_9, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_5|} OutVars{ULTIMATE.start_main_~tmp~0=v_ULTIMATE.start_main_~tmp~0_10, ULTIMATE.start_main_~id~0=v_ULTIMATE.start_main_~id~0_9, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2] 122#L24 [43] L24-->L24-2: Formula: (and (> v_ULTIMATE.start_main_~tmp~0_7 v_ULTIMATE.start_main_~maxId~0_7) (= v_ULTIMATE.start_main_~tmp~0_6 0)) InVars {ULTIMATE.start_main_~maxId~0=v_ULTIMATE.start_main_~maxId~0_7, ULTIMATE.start_main_~tmp~0=v_ULTIMATE.start_main_~tmp~0_7} OutVars{ULTIMATE.start_main_~maxId~0=v_ULTIMATE.start_main_~maxId~0_7, ULTIMATE.start_main_~tmp~0=v_ULTIMATE.start_main_~tmp~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_~tmp~0] 123#L24-2 [2020-06-22 02:36:42,298 INFO L796 eck$LassoCheckResult]: Loop: 123#L24-2 [49] L24-2-->L24: Formula: (and (< 0 |v_ULTIMATE.start_main_#t~nondet2_5|) (> v_ULTIMATE.start_main_~tmp~0_10 v_ULTIMATE.start_main_~id~0_9)) InVars {ULTIMATE.start_main_~tmp~0=v_ULTIMATE.start_main_~tmp~0_10, ULTIMATE.start_main_~id~0=v_ULTIMATE.start_main_~id~0_9, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_5|} OutVars{ULTIMATE.start_main_~tmp~0=v_ULTIMATE.start_main_~tmp~0_10, ULTIMATE.start_main_~id~0=v_ULTIMATE.start_main_~id~0_9, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2] 119#L24 [43] L24-->L24-2: Formula: (and (> v_ULTIMATE.start_main_~tmp~0_7 v_ULTIMATE.start_main_~maxId~0_7) (= v_ULTIMATE.start_main_~tmp~0_6 0)) InVars {ULTIMATE.start_main_~maxId~0=v_ULTIMATE.start_main_~maxId~0_7, ULTIMATE.start_main_~tmp~0=v_ULTIMATE.start_main_~tmp~0_7} OutVars{ULTIMATE.start_main_~maxId~0=v_ULTIMATE.start_main_~maxId~0_7, ULTIMATE.start_main_~tmp~0=v_ULTIMATE.start_main_~tmp~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_~tmp~0] 123#L24-2 [2020-06-22 02:36:42,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 02:36:42,298 INFO L82 PathProgramCache]: Analyzing trace with hash 83309, now seen corresponding path program 1 times [2020-06-22 02:36:42,298 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 02:36:42,299 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 02:36:42,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:36:42,300 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 02:36:42,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:36:42,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 02:36:42,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 02:36:42,313 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 02:36:42,314 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-06-22 02:36:42,314 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-06-22 02:36:42,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 02:36:42,314 INFO L82 PathProgramCache]: Analyzing trace with hash 2523, now seen corresponding path program 1 times [2020-06-22 02:36:42,314 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 02:36:42,315 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 02:36:42,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:36:42,316 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 02:36:42,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:36:42,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 02:36:42,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 02:36:42,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 02:36:42,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 02:36:42,341 INFO L87 Difference]: Start difference. First operand 9 states and 21 transitions. cyclomatic complexity: 14 Second operand 3 states. [2020-06-22 02:36:42,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 02:36:42,358 INFO L93 Difference]: Finished difference Result 11 states and 22 transitions. [2020-06-22 02:36:42,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 02:36:42,360 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 22 transitions. [2020-06-22 02:36:42,361 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-06-22 02:36:42,361 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 10 states and 20 transitions. [2020-06-22 02:36:42,362 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2020-06-22 02:36:42,362 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2020-06-22 02:36:42,362 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 20 transitions. [2020-06-22 02:36:42,362 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 02:36:42,362 INFO L706 BuchiCegarLoop]: Abstraction has 10 states and 20 transitions. [2020-06-22 02:36:42,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 20 transitions. [2020-06-22 02:36:42,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2020-06-22 02:36:42,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-06-22 02:36:42,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 19 transitions. [2020-06-22 02:36:42,364 INFO L729 BuchiCegarLoop]: Abstraction has 9 states and 19 transitions. [2020-06-22 02:36:42,364 INFO L609 BuchiCegarLoop]: Abstraction has 9 states and 19 transitions. [2020-06-22 02:36:42,364 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2020-06-22 02:36:42,365 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 19 transitions. [2020-06-22 02:36:42,365 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-06-22 02:36:42,366 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 02:36:42,366 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 02:36:42,366 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1] [2020-06-22 02:36:42,366 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-06-22 02:36:42,367 INFO L794 eck$LassoCheckResult]: Stem: 142#ULTIMATE.startENTRY [54] ULTIMATE.startENTRY-->L24-2: Formula: (and (= v_ULTIMATE.start_main_~tmp~0_11 (+ v_ULTIMATE.start_main_~id~0_10 1)) (<= 0 v_ULTIMATE.start_main_~id~0_10) (< v_ULTIMATE.start_main_~id~0_10 v_ULTIMATE.start_main_~maxId~0_10)) InVars {} OutVars{ULTIMATE.start_main_~maxId~0=v_ULTIMATE.start_main_~maxId~0_10, ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_6|, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_6|, ULTIMATE.start_main_~tmp~0=v_ULTIMATE.start_main_~tmp~0_11, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_6|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_6|, ULTIMATE.start_main_~id~0=v_ULTIMATE.start_main_~id~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_~maxId~0, ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_~tmp~0, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#res, ULTIMATE.start_main_~id~0] 143#L24-2 [51] L24-2-->L24: Formula: (and (> v_ULTIMATE.start_main_~tmp~0_10 v_ULTIMATE.start_main_~id~0_9) (> 0 |v_ULTIMATE.start_main_#t~nondet2_5|)) InVars {ULTIMATE.start_main_~tmp~0=v_ULTIMATE.start_main_~tmp~0_10, ULTIMATE.start_main_~id~0=v_ULTIMATE.start_main_~id~0_9, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_5|} OutVars{ULTIMATE.start_main_~tmp~0=v_ULTIMATE.start_main_~tmp~0_10, ULTIMATE.start_main_~id~0=v_ULTIMATE.start_main_~id~0_9, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2] 147#L24 [37] L24-->L24-2: Formula: (and (<= v_ULTIMATE.start_main_~tmp~0_2 v_ULTIMATE.start_main_~maxId~0_1) (= v_ULTIMATE.start_main_~tmp~0_1 (+ v_ULTIMATE.start_main_~tmp~0_2 1))) InVars {ULTIMATE.start_main_~maxId~0=v_ULTIMATE.start_main_~maxId~0_1, ULTIMATE.start_main_~tmp~0=v_ULTIMATE.start_main_~tmp~0_2} OutVars{ULTIMATE.start_main_~maxId~0=v_ULTIMATE.start_main_~maxId~0_1, ULTIMATE.start_main_~tmp~0=v_ULTIMATE.start_main_~tmp~0_1} AuxVars[] AssignedVars[ULTIMATE.start_main_~tmp~0] 146#L24-2 [51] L24-2-->L24: Formula: (and (> v_ULTIMATE.start_main_~tmp~0_10 v_ULTIMATE.start_main_~id~0_9) (> 0 |v_ULTIMATE.start_main_#t~nondet2_5|)) InVars {ULTIMATE.start_main_~tmp~0=v_ULTIMATE.start_main_~tmp~0_10, ULTIMATE.start_main_~id~0=v_ULTIMATE.start_main_~id~0_9, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_5|} OutVars{ULTIMATE.start_main_~tmp~0=v_ULTIMATE.start_main_~tmp~0_10, ULTIMATE.start_main_~id~0=v_ULTIMATE.start_main_~id~0_9, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2] 148#L24 [43] L24-->L24-2: Formula: (and (> v_ULTIMATE.start_main_~tmp~0_7 v_ULTIMATE.start_main_~maxId~0_7) (= v_ULTIMATE.start_main_~tmp~0_6 0)) InVars {ULTIMATE.start_main_~maxId~0=v_ULTIMATE.start_main_~maxId~0_7, ULTIMATE.start_main_~tmp~0=v_ULTIMATE.start_main_~tmp~0_7} OutVars{ULTIMATE.start_main_~maxId~0=v_ULTIMATE.start_main_~maxId~0_7, ULTIMATE.start_main_~tmp~0=v_ULTIMATE.start_main_~tmp~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_~tmp~0] 149#L24-2 [2020-06-22 02:36:42,367 INFO L796 eck$LassoCheckResult]: Loop: 149#L24-2 [49] L24-2-->L24: Formula: (and (< 0 |v_ULTIMATE.start_main_#t~nondet2_5|) (> v_ULTIMATE.start_main_~tmp~0_10 v_ULTIMATE.start_main_~id~0_9)) InVars {ULTIMATE.start_main_~tmp~0=v_ULTIMATE.start_main_~tmp~0_10, ULTIMATE.start_main_~id~0=v_ULTIMATE.start_main_~id~0_9, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_5|} OutVars{ULTIMATE.start_main_~tmp~0=v_ULTIMATE.start_main_~tmp~0_10, ULTIMATE.start_main_~id~0=v_ULTIMATE.start_main_~id~0_9, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2] 145#L24 [43] L24-->L24-2: Formula: (and (> v_ULTIMATE.start_main_~tmp~0_7 v_ULTIMATE.start_main_~maxId~0_7) (= v_ULTIMATE.start_main_~tmp~0_6 0)) InVars {ULTIMATE.start_main_~maxId~0=v_ULTIMATE.start_main_~maxId~0_7, ULTIMATE.start_main_~tmp~0=v_ULTIMATE.start_main_~tmp~0_7} OutVars{ULTIMATE.start_main_~maxId~0=v_ULTIMATE.start_main_~maxId~0_7, ULTIMATE.start_main_~tmp~0=v_ULTIMATE.start_main_~tmp~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_~tmp~0] 149#L24-2 [2020-06-22 02:36:42,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 02:36:42,367 INFO L82 PathProgramCache]: Analyzing trace with hash 80055807, now seen corresponding path program 1 times [2020-06-22 02:36:42,367 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 02:36:42,368 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 02:36:42,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:36:42,369 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 02:36:42,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:36:42,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 02:36:42,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 02:36:42,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 02:36:42,380 INFO L82 PathProgramCache]: Analyzing trace with hash 2523, now seen corresponding path program 2 times [2020-06-22 02:36:42,381 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 02:36:42,381 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 02:36:42,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:36:42,382 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 02:36:42,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:36:42,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 02:36:42,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 02:36:42,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 02:36:42,387 INFO L82 PathProgramCache]: Analyzing trace with hash -375779239, now seen corresponding path program 1 times [2020-06-22 02:36:42,387 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 02:36:42,388 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 02:36:42,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:36:42,389 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 02:36:42,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:36:42,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 02:36:42,409 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-06-22 02:36:42,410 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 02:36:42,410 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2020-06-22 02:36:42,422 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 02:36:42,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 02:36:42,428 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 3 conjunts are in the unsatisfiable core [2020-06-22 02:36:42,429 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 02:36:42,445 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-06-22 02:36:42,472 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-06-22 02:36:42,472 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2020-06-22 02:36:42,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-06-22 02:36:42,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-06-22 02:36:42,491 INFO L87 Difference]: Start difference. First operand 9 states and 19 transitions. cyclomatic complexity: 12 Second operand 5 states. [2020-06-22 02:36:42,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 02:36:42,528 INFO L93 Difference]: Finished difference Result 11 states and 23 transitions. [2020-06-22 02:36:42,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-06-22 02:36:42,529 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 23 transitions. [2020-06-22 02:36:42,530 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2020-06-22 02:36:42,531 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 11 states and 23 transitions. [2020-06-22 02:36:42,531 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2020-06-22 02:36:42,532 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2020-06-22 02:36:42,532 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 23 transitions. [2020-06-22 02:36:42,532 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 02:36:42,532 INFO L706 BuchiCegarLoop]: Abstraction has 11 states and 23 transitions. [2020-06-22 02:36:42,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 23 transitions. [2020-06-22 02:36:42,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 10. [2020-06-22 02:36:42,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-06-22 02:36:42,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 21 transitions. [2020-06-22 02:36:42,534 INFO L729 BuchiCegarLoop]: Abstraction has 10 states and 21 transitions. [2020-06-22 02:36:42,534 INFO L609 BuchiCegarLoop]: Abstraction has 10 states and 21 transitions. [2020-06-22 02:36:42,534 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2020-06-22 02:36:42,534 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 21 transitions. [2020-06-22 02:36:42,535 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-06-22 02:36:42,535 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 02:36:42,535 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 02:36:42,535 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1] [2020-06-22 02:36:42,536 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-06-22 02:36:42,536 INFO L794 eck$LassoCheckResult]: Stem: 192#ULTIMATE.startENTRY [54] ULTIMATE.startENTRY-->L24-2: Formula: (and (= v_ULTIMATE.start_main_~tmp~0_11 (+ v_ULTIMATE.start_main_~id~0_10 1)) (<= 0 v_ULTIMATE.start_main_~id~0_10) (< v_ULTIMATE.start_main_~id~0_10 v_ULTIMATE.start_main_~maxId~0_10)) InVars {} OutVars{ULTIMATE.start_main_~maxId~0=v_ULTIMATE.start_main_~maxId~0_10, ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_6|, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_6|, ULTIMATE.start_main_~tmp~0=v_ULTIMATE.start_main_~tmp~0_11, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_6|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_6|, ULTIMATE.start_main_~id~0=v_ULTIMATE.start_main_~id~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_~maxId~0, ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_~tmp~0, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#res, ULTIMATE.start_main_~id~0] 193#L24-2 [51] L24-2-->L24: Formula: (and (> v_ULTIMATE.start_main_~tmp~0_10 v_ULTIMATE.start_main_~id~0_9) (> 0 |v_ULTIMATE.start_main_#t~nondet2_5|)) InVars {ULTIMATE.start_main_~tmp~0=v_ULTIMATE.start_main_~tmp~0_10, ULTIMATE.start_main_~id~0=v_ULTIMATE.start_main_~id~0_9, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_5|} OutVars{ULTIMATE.start_main_~tmp~0=v_ULTIMATE.start_main_~tmp~0_10, ULTIMATE.start_main_~id~0=v_ULTIMATE.start_main_~id~0_9, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2] 197#L24 [37] L24-->L24-2: Formula: (and (<= v_ULTIMATE.start_main_~tmp~0_2 v_ULTIMATE.start_main_~maxId~0_1) (= v_ULTIMATE.start_main_~tmp~0_1 (+ v_ULTIMATE.start_main_~tmp~0_2 1))) InVars {ULTIMATE.start_main_~maxId~0=v_ULTIMATE.start_main_~maxId~0_1, ULTIMATE.start_main_~tmp~0=v_ULTIMATE.start_main_~tmp~0_2} OutVars{ULTIMATE.start_main_~maxId~0=v_ULTIMATE.start_main_~maxId~0_1, ULTIMATE.start_main_~tmp~0=v_ULTIMATE.start_main_~tmp~0_1} AuxVars[] AssignedVars[ULTIMATE.start_main_~tmp~0] 196#L24-2 [51] L24-2-->L24: Formula: (and (> v_ULTIMATE.start_main_~tmp~0_10 v_ULTIMATE.start_main_~id~0_9) (> 0 |v_ULTIMATE.start_main_#t~nondet2_5|)) InVars {ULTIMATE.start_main_~tmp~0=v_ULTIMATE.start_main_~tmp~0_10, ULTIMATE.start_main_~id~0=v_ULTIMATE.start_main_~id~0_9, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_5|} OutVars{ULTIMATE.start_main_~tmp~0=v_ULTIMATE.start_main_~tmp~0_10, ULTIMATE.start_main_~id~0=v_ULTIMATE.start_main_~id~0_9, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2] 198#L24 [43] L24-->L24-2: Formula: (and (> v_ULTIMATE.start_main_~tmp~0_7 v_ULTIMATE.start_main_~maxId~0_7) (= v_ULTIMATE.start_main_~tmp~0_6 0)) InVars {ULTIMATE.start_main_~maxId~0=v_ULTIMATE.start_main_~maxId~0_7, ULTIMATE.start_main_~tmp~0=v_ULTIMATE.start_main_~tmp~0_7} OutVars{ULTIMATE.start_main_~maxId~0=v_ULTIMATE.start_main_~maxId~0_7, ULTIMATE.start_main_~tmp~0=v_ULTIMATE.start_main_~tmp~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_~tmp~0] 199#L24-2 [2020-06-22 02:36:42,536 INFO L796 eck$LassoCheckResult]: Loop: 199#L24-2 [48] L24-2-->L24: Formula: (and (< v_ULTIMATE.start_main_~tmp~0_10 v_ULTIMATE.start_main_~id~0_9) (> 0 |v_ULTIMATE.start_main_#t~nondet2_5|)) InVars {ULTIMATE.start_main_~tmp~0=v_ULTIMATE.start_main_~tmp~0_10, ULTIMATE.start_main_~id~0=v_ULTIMATE.start_main_~id~0_9, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_5|} OutVars{ULTIMATE.start_main_~tmp~0=v_ULTIMATE.start_main_~tmp~0_10, ULTIMATE.start_main_~id~0=v_ULTIMATE.start_main_~id~0_9, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2] 200#L24 [43] L24-->L24-2: Formula: (and (> v_ULTIMATE.start_main_~tmp~0_7 v_ULTIMATE.start_main_~maxId~0_7) (= v_ULTIMATE.start_main_~tmp~0_6 0)) InVars {ULTIMATE.start_main_~maxId~0=v_ULTIMATE.start_main_~maxId~0_7, ULTIMATE.start_main_~tmp~0=v_ULTIMATE.start_main_~tmp~0_7} OutVars{ULTIMATE.start_main_~maxId~0=v_ULTIMATE.start_main_~maxId~0_7, ULTIMATE.start_main_~tmp~0=v_ULTIMATE.start_main_~tmp~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_~tmp~0] 199#L24-2 [2020-06-22 02:36:42,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 02:36:42,536 INFO L82 PathProgramCache]: Analyzing trace with hash 80055807, now seen corresponding path program 2 times [2020-06-22 02:36:42,537 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 02:36:42,537 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 02:36:42,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:36:42,538 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 02:36:42,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:36:42,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 02:36:42,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 02:36:42,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 02:36:42,548 INFO L82 PathProgramCache]: Analyzing trace with hash 2492, now seen corresponding path program 1 times [2020-06-22 02:36:42,548 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 02:36:42,548 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 02:36:42,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:36:42,549 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 02:36:42,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:36:42,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 02:36:42,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 02:36:42,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 02:36:42,553 INFO L82 PathProgramCache]: Analyzing trace with hash -375779270, now seen corresponding path program 1 times [2020-06-22 02:36:42,553 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 02:36:42,554 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 02:36:42,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:36:42,555 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 02:36:42,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:36:42,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 02:36:42,579 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-06-22 02:36:42,580 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 02:36:42,580 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2020-06-22 02:36:42,598 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 02:36:42,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 02:36:42,608 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 3 conjunts are in the unsatisfiable core [2020-06-22 02:36:42,608 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 02:36:42,628 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-06-22 02:36:42,654 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-06-22 02:36:42,655 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2] total 4 [2020-06-22 02:36:42,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-06-22 02:36:42,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-06-22 02:36:42,678 INFO L87 Difference]: Start difference. First operand 10 states and 21 transitions. cyclomatic complexity: 13 Second operand 6 states. [2020-06-22 02:36:42,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 02:36:42,755 INFO L93 Difference]: Finished difference Result 11 states and 21 transitions. [2020-06-22 02:36:42,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-06-22 02:36:42,757 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 21 transitions. [2020-06-22 02:36:42,759 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2020-06-22 02:36:42,759 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 11 states and 21 transitions. [2020-06-22 02:36:42,760 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2020-06-22 02:36:42,760 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2020-06-22 02:36:42,760 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 21 transitions. [2020-06-22 02:36:42,760 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 02:36:42,760 INFO L706 BuchiCegarLoop]: Abstraction has 11 states and 21 transitions. [2020-06-22 02:36:42,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 21 transitions. [2020-06-22 02:36:42,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2020-06-22 02:36:42,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-06-22 02:36:42,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 21 transitions. [2020-06-22 02:36:42,762 INFO L729 BuchiCegarLoop]: Abstraction has 11 states and 21 transitions. [2020-06-22 02:36:42,762 INFO L609 BuchiCegarLoop]: Abstraction has 11 states and 21 transitions. [2020-06-22 02:36:42,762 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2020-06-22 02:36:42,763 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 21 transitions. [2020-06-22 02:36:42,763 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2020-06-22 02:36:42,763 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 02:36:42,763 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 02:36:42,764 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1] [2020-06-22 02:36:42,764 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1] [2020-06-22 02:36:42,764 INFO L794 eck$LassoCheckResult]: Stem: 248#ULTIMATE.startENTRY [54] ULTIMATE.startENTRY-->L24-2: Formula: (and (= v_ULTIMATE.start_main_~tmp~0_11 (+ v_ULTIMATE.start_main_~id~0_10 1)) (<= 0 v_ULTIMATE.start_main_~id~0_10) (< v_ULTIMATE.start_main_~id~0_10 v_ULTIMATE.start_main_~maxId~0_10)) InVars {} OutVars{ULTIMATE.start_main_~maxId~0=v_ULTIMATE.start_main_~maxId~0_10, ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_6|, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_6|, ULTIMATE.start_main_~tmp~0=v_ULTIMATE.start_main_~tmp~0_11, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_6|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_6|, ULTIMATE.start_main_~id~0=v_ULTIMATE.start_main_~id~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_~maxId~0, ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_~tmp~0, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#res, ULTIMATE.start_main_~id~0] 249#L24-2 [51] L24-2-->L24: Formula: (and (> v_ULTIMATE.start_main_~tmp~0_10 v_ULTIMATE.start_main_~id~0_9) (> 0 |v_ULTIMATE.start_main_#t~nondet2_5|)) InVars {ULTIMATE.start_main_~tmp~0=v_ULTIMATE.start_main_~tmp~0_10, ULTIMATE.start_main_~id~0=v_ULTIMATE.start_main_~id~0_9, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_5|} OutVars{ULTIMATE.start_main_~tmp~0=v_ULTIMATE.start_main_~tmp~0_10, ULTIMATE.start_main_~id~0=v_ULTIMATE.start_main_~id~0_9, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2] 253#L24 [37] L24-->L24-2: Formula: (and (<= v_ULTIMATE.start_main_~tmp~0_2 v_ULTIMATE.start_main_~maxId~0_1) (= v_ULTIMATE.start_main_~tmp~0_1 (+ v_ULTIMATE.start_main_~tmp~0_2 1))) InVars {ULTIMATE.start_main_~maxId~0=v_ULTIMATE.start_main_~maxId~0_1, ULTIMATE.start_main_~tmp~0=v_ULTIMATE.start_main_~tmp~0_2} OutVars{ULTIMATE.start_main_~maxId~0=v_ULTIMATE.start_main_~maxId~0_1, ULTIMATE.start_main_~tmp~0=v_ULTIMATE.start_main_~tmp~0_1} AuxVars[] AssignedVars[ULTIMATE.start_main_~tmp~0] 252#L24-2 [51] L24-2-->L24: Formula: (and (> v_ULTIMATE.start_main_~tmp~0_10 v_ULTIMATE.start_main_~id~0_9) (> 0 |v_ULTIMATE.start_main_#t~nondet2_5|)) InVars {ULTIMATE.start_main_~tmp~0=v_ULTIMATE.start_main_~tmp~0_10, ULTIMATE.start_main_~id~0=v_ULTIMATE.start_main_~id~0_9, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_5|} OutVars{ULTIMATE.start_main_~tmp~0=v_ULTIMATE.start_main_~tmp~0_10, ULTIMATE.start_main_~id~0=v_ULTIMATE.start_main_~id~0_9, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2] 254#L24 [43] L24-->L24-2: Formula: (and (> v_ULTIMATE.start_main_~tmp~0_7 v_ULTIMATE.start_main_~maxId~0_7) (= v_ULTIMATE.start_main_~tmp~0_6 0)) InVars {ULTIMATE.start_main_~maxId~0=v_ULTIMATE.start_main_~maxId~0_7, ULTIMATE.start_main_~tmp~0=v_ULTIMATE.start_main_~tmp~0_7} OutVars{ULTIMATE.start_main_~maxId~0=v_ULTIMATE.start_main_~maxId~0_7, ULTIMATE.start_main_~tmp~0=v_ULTIMATE.start_main_~tmp~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_~tmp~0] 250#L24-2 [2020-06-22 02:36:42,765 INFO L796 eck$LassoCheckResult]: Loop: 250#L24-2 [48] L24-2-->L24: Formula: (and (< v_ULTIMATE.start_main_~tmp~0_10 v_ULTIMATE.start_main_~id~0_9) (> 0 |v_ULTIMATE.start_main_#t~nondet2_5|)) InVars {ULTIMATE.start_main_~tmp~0=v_ULTIMATE.start_main_~tmp~0_10, ULTIMATE.start_main_~id~0=v_ULTIMATE.start_main_~id~0_9, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_5|} OutVars{ULTIMATE.start_main_~tmp~0=v_ULTIMATE.start_main_~tmp~0_10, ULTIMATE.start_main_~id~0=v_ULTIMATE.start_main_~id~0_9, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2] 251#L24 [37] L24-->L24-2: Formula: (and (<= v_ULTIMATE.start_main_~tmp~0_2 v_ULTIMATE.start_main_~maxId~0_1) (= v_ULTIMATE.start_main_~tmp~0_1 (+ v_ULTIMATE.start_main_~tmp~0_2 1))) InVars {ULTIMATE.start_main_~maxId~0=v_ULTIMATE.start_main_~maxId~0_1, ULTIMATE.start_main_~tmp~0=v_ULTIMATE.start_main_~tmp~0_2} OutVars{ULTIMATE.start_main_~maxId~0=v_ULTIMATE.start_main_~maxId~0_1, ULTIMATE.start_main_~tmp~0=v_ULTIMATE.start_main_~tmp~0_1} AuxVars[] AssignedVars[ULTIMATE.start_main_~tmp~0] 255#L24-2 [49] L24-2-->L24: Formula: (and (< 0 |v_ULTIMATE.start_main_#t~nondet2_5|) (> v_ULTIMATE.start_main_~tmp~0_10 v_ULTIMATE.start_main_~id~0_9)) InVars {ULTIMATE.start_main_~tmp~0=v_ULTIMATE.start_main_~tmp~0_10, ULTIMATE.start_main_~id~0=v_ULTIMATE.start_main_~id~0_9, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_5|} OutVars{ULTIMATE.start_main_~tmp~0=v_ULTIMATE.start_main_~tmp~0_10, ULTIMATE.start_main_~id~0=v_ULTIMATE.start_main_~id~0_9, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2] 258#L24 [37] L24-->L24-2: Formula: (and (<= v_ULTIMATE.start_main_~tmp~0_2 v_ULTIMATE.start_main_~maxId~0_1) (= v_ULTIMATE.start_main_~tmp~0_1 (+ v_ULTIMATE.start_main_~tmp~0_2 1))) InVars {ULTIMATE.start_main_~maxId~0=v_ULTIMATE.start_main_~maxId~0_1, ULTIMATE.start_main_~tmp~0=v_ULTIMATE.start_main_~tmp~0_2} OutVars{ULTIMATE.start_main_~maxId~0=v_ULTIMATE.start_main_~maxId~0_1, ULTIMATE.start_main_~tmp~0=v_ULTIMATE.start_main_~tmp~0_1} AuxVars[] AssignedVars[ULTIMATE.start_main_~tmp~0] 257#L24-2 [49] L24-2-->L24: Formula: (and (< 0 |v_ULTIMATE.start_main_#t~nondet2_5|) (> v_ULTIMATE.start_main_~tmp~0_10 v_ULTIMATE.start_main_~id~0_9)) InVars {ULTIMATE.start_main_~tmp~0=v_ULTIMATE.start_main_~tmp~0_10, ULTIMATE.start_main_~id~0=v_ULTIMATE.start_main_~id~0_9, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_5|} OutVars{ULTIMATE.start_main_~tmp~0=v_ULTIMATE.start_main_~tmp~0_10, ULTIMATE.start_main_~id~0=v_ULTIMATE.start_main_~id~0_9, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2] 256#L24 [43] L24-->L24-2: Formula: (and (> v_ULTIMATE.start_main_~tmp~0_7 v_ULTIMATE.start_main_~maxId~0_7) (= v_ULTIMATE.start_main_~tmp~0_6 0)) InVars {ULTIMATE.start_main_~maxId~0=v_ULTIMATE.start_main_~maxId~0_7, ULTIMATE.start_main_~tmp~0=v_ULTIMATE.start_main_~tmp~0_7} OutVars{ULTIMATE.start_main_~maxId~0=v_ULTIMATE.start_main_~maxId~0_7, ULTIMATE.start_main_~tmp~0=v_ULTIMATE.start_main_~tmp~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_~tmp~0] 250#L24-2 [2020-06-22 02:36:42,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 02:36:42,765 INFO L82 PathProgramCache]: Analyzing trace with hash 80055807, now seen corresponding path program 3 times [2020-06-22 02:36:42,765 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 02:36:42,765 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 02:36:42,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:36:42,767 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 02:36:42,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:36:42,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 02:36:42,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 02:36:42,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 02:36:42,777 INFO L82 PathProgramCache]: Analyzing trace with hash -1997597212, now seen corresponding path program 1 times [2020-06-22 02:36:42,777 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 02:36:42,777 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 02:36:42,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:36:42,778 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 02:36:42,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:36:42,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 02:36:42,808 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-06-22 02:36:42,808 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 02:36:42,808 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-06-22 02:36:42,809 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-06-22 02:36:42,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-06-22 02:36:42,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-06-22 02:36:42,809 INFO L87 Difference]: Start difference. First operand 11 states and 21 transitions. cyclomatic complexity: 12 Second operand 4 states. [2020-06-22 02:36:42,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 02:36:42,842 INFO L93 Difference]: Finished difference Result 8 states and 14 transitions. [2020-06-22 02:36:42,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-06-22 02:36:42,844 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 8 states and 14 transitions. [2020-06-22 02:36:42,844 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-06-22 02:36:42,845 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 8 states to 8 states and 14 transitions. [2020-06-22 02:36:42,845 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2020-06-22 02:36:42,845 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2020-06-22 02:36:42,845 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 14 transitions. [2020-06-22 02:36:42,846 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 02:36:42,846 INFO L706 BuchiCegarLoop]: Abstraction has 8 states and 14 transitions. [2020-06-22 02:36:42,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states and 14 transitions. [2020-06-22 02:36:42,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 7. [2020-06-22 02:36:42,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-06-22 02:36:42,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 12 transitions. [2020-06-22 02:36:42,848 INFO L729 BuchiCegarLoop]: Abstraction has 7 states and 12 transitions. [2020-06-22 02:36:42,848 INFO L609 BuchiCegarLoop]: Abstraction has 7 states and 12 transitions. [2020-06-22 02:36:42,848 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2020-06-22 02:36:42,848 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 12 transitions. [2020-06-22 02:36:42,849 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-06-22 02:36:42,849 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 02:36:42,849 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 02:36:42,849 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1] [2020-06-22 02:36:42,849 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-06-22 02:36:42,850 INFO L794 eck$LassoCheckResult]: Stem: 274#ULTIMATE.startENTRY [54] ULTIMATE.startENTRY-->L24-2: Formula: (and (= v_ULTIMATE.start_main_~tmp~0_11 (+ v_ULTIMATE.start_main_~id~0_10 1)) (<= 0 v_ULTIMATE.start_main_~id~0_10) (< v_ULTIMATE.start_main_~id~0_10 v_ULTIMATE.start_main_~maxId~0_10)) InVars {} OutVars{ULTIMATE.start_main_~maxId~0=v_ULTIMATE.start_main_~maxId~0_10, ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_6|, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_6|, ULTIMATE.start_main_~tmp~0=v_ULTIMATE.start_main_~tmp~0_11, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_6|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_6|, ULTIMATE.start_main_~id~0=v_ULTIMATE.start_main_~id~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_~maxId~0, ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_~tmp~0, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#res, ULTIMATE.start_main_~id~0] 275#L24-2 [51] L24-2-->L24: Formula: (and (> v_ULTIMATE.start_main_~tmp~0_10 v_ULTIMATE.start_main_~id~0_9) (> 0 |v_ULTIMATE.start_main_#t~nondet2_5|)) InVars {ULTIMATE.start_main_~tmp~0=v_ULTIMATE.start_main_~tmp~0_10, ULTIMATE.start_main_~id~0=v_ULTIMATE.start_main_~id~0_9, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_5|} OutVars{ULTIMATE.start_main_~tmp~0=v_ULTIMATE.start_main_~tmp~0_10, ULTIMATE.start_main_~id~0=v_ULTIMATE.start_main_~id~0_9, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2] 279#L24 [37] L24-->L24-2: Formula: (and (<= v_ULTIMATE.start_main_~tmp~0_2 v_ULTIMATE.start_main_~maxId~0_1) (= v_ULTIMATE.start_main_~tmp~0_1 (+ v_ULTIMATE.start_main_~tmp~0_2 1))) InVars {ULTIMATE.start_main_~maxId~0=v_ULTIMATE.start_main_~maxId~0_1, ULTIMATE.start_main_~tmp~0=v_ULTIMATE.start_main_~tmp~0_2} OutVars{ULTIMATE.start_main_~maxId~0=v_ULTIMATE.start_main_~maxId~0_1, ULTIMATE.start_main_~tmp~0=v_ULTIMATE.start_main_~tmp~0_1} AuxVars[] AssignedVars[ULTIMATE.start_main_~tmp~0] 278#L24-2 [51] L24-2-->L24: Formula: (and (> v_ULTIMATE.start_main_~tmp~0_10 v_ULTIMATE.start_main_~id~0_9) (> 0 |v_ULTIMATE.start_main_#t~nondet2_5|)) InVars {ULTIMATE.start_main_~tmp~0=v_ULTIMATE.start_main_~tmp~0_10, ULTIMATE.start_main_~id~0=v_ULTIMATE.start_main_~id~0_9, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_5|} OutVars{ULTIMATE.start_main_~tmp~0=v_ULTIMATE.start_main_~tmp~0_10, ULTIMATE.start_main_~id~0=v_ULTIMATE.start_main_~id~0_9, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2] 280#L24 [43] L24-->L24-2: Formula: (and (> v_ULTIMATE.start_main_~tmp~0_7 v_ULTIMATE.start_main_~maxId~0_7) (= v_ULTIMATE.start_main_~tmp~0_6 0)) InVars {ULTIMATE.start_main_~maxId~0=v_ULTIMATE.start_main_~maxId~0_7, ULTIMATE.start_main_~tmp~0=v_ULTIMATE.start_main_~tmp~0_7} OutVars{ULTIMATE.start_main_~maxId~0=v_ULTIMATE.start_main_~maxId~0_7, ULTIMATE.start_main_~tmp~0=v_ULTIMATE.start_main_~tmp~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_~tmp~0] 276#L24-2 [2020-06-22 02:36:42,850 INFO L796 eck$LassoCheckResult]: Loop: 276#L24-2 [48] L24-2-->L24: Formula: (and (< v_ULTIMATE.start_main_~tmp~0_10 v_ULTIMATE.start_main_~id~0_9) (> 0 |v_ULTIMATE.start_main_#t~nondet2_5|)) InVars {ULTIMATE.start_main_~tmp~0=v_ULTIMATE.start_main_~tmp~0_10, ULTIMATE.start_main_~id~0=v_ULTIMATE.start_main_~id~0_9, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_5|} OutVars{ULTIMATE.start_main_~tmp~0=v_ULTIMATE.start_main_~tmp~0_10, ULTIMATE.start_main_~id~0=v_ULTIMATE.start_main_~id~0_9, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2] 277#L24 [37] L24-->L24-2: Formula: (and (<= v_ULTIMATE.start_main_~tmp~0_2 v_ULTIMATE.start_main_~maxId~0_1) (= v_ULTIMATE.start_main_~tmp~0_1 (+ v_ULTIMATE.start_main_~tmp~0_2 1))) InVars {ULTIMATE.start_main_~maxId~0=v_ULTIMATE.start_main_~maxId~0_1, ULTIMATE.start_main_~tmp~0=v_ULTIMATE.start_main_~tmp~0_2} OutVars{ULTIMATE.start_main_~maxId~0=v_ULTIMATE.start_main_~maxId~0_1, ULTIMATE.start_main_~tmp~0=v_ULTIMATE.start_main_~tmp~0_1} AuxVars[] AssignedVars[ULTIMATE.start_main_~tmp~0] 276#L24-2 [2020-06-22 02:36:42,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 02:36:42,850 INFO L82 PathProgramCache]: Analyzing trace with hash 80055807, now seen corresponding path program 4 times [2020-06-22 02:36:42,850 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 02:36:42,851 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 02:36:42,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:36:42,852 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 02:36:42,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:36:42,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 02:36:42,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 02:36:42,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 02:36:42,861 INFO L82 PathProgramCache]: Analyzing trace with hash 2486, now seen corresponding path program 2 times [2020-06-22 02:36:42,861 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 02:36:42,861 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 02:36:42,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:36:42,863 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 02:36:42,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:36:42,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 02:36:42,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 02:36:42,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 02:36:42,867 INFO L82 PathProgramCache]: Analyzing trace with hash -375779276, now seen corresponding path program 2 times [2020-06-22 02:36:42,867 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 02:36:42,868 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 02:36:42,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:36:42,869 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 02:36:42,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:36:42,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 02:36:42,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 02:36:42,898 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 02:36:42,898 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 02:36:42,898 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 02:36:42,898 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 02:36:42,899 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2020-06-22 02:36:42,899 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 02:36:42,899 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 02:36:42,899 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 02:36:42,899 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration7_Loop [2020-06-22 02:36:42,899 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 02:36:42,899 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 02:36:42,901 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 02:36:42,911 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 02:36:42,915 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 02:36:42,918 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 02:36:42,980 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 02:36:42,980 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 02:36:43,011 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 02:36:43,012 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 02:36:43,043 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-06-22 02:36:43,044 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 02:36:43,253 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-06-22 02:36:43,255 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 02:36:43,255 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 02:36:43,255 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 02:36:43,256 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 02:36:43,256 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 02:36:43,256 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 02:36:43,256 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 02:36:43,256 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 02:36:43,256 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration7_Loop [2020-06-22 02:36:43,256 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 02:36:43,256 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 02:36:43,259 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 02:36:43,268 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 02:36:43,272 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 02:36:43,275 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 02:36:43,320 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 02:36:43,320 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 02:36:43,321 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 02:36:43,321 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 02:36:43,321 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 02:36:43,322 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 02:36:43,322 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 02:36:43,322 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 02:36:43,323 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 02:36:43,323 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 02:36:43,326 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 02:36:43,329 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-06-22 02:36:43,330 INFO L444 ModelExtractionUtils]: 1 out of 5 variables were initially zero. Simplification set additionally 1 variables to zero. [2020-06-22 02:36:43,330 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 02:36:43,330 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-06-22 02:36:43,330 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 02:36:43,330 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~id~0, ULTIMATE.start_main_~tmp~0) = 1*ULTIMATE.start_main_~id~0 - 1*ULTIMATE.start_main_~tmp~0 Supporting invariants [] [2020-06-22 02:36:43,331 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-06-22 02:36:43,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 02:36:43,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 02:36:43,355 INFO L256 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 2 conjunts are in the unsatisfiable core [2020-06-22 02:36:43,355 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 02:36:43,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 02:36:43,360 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 02:36:43,361 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 02:36:43,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 02:36:43,397 INFO L98 LoopCannibalizer]: 2 predicates before loop cannibalization 2 predicates after loop cannibalization [2020-06-22 02:36:43,397 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2020-06-22 02:36:43,397 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 7 states and 12 transitions. cyclomatic complexity: 7 Second operand 3 states. [2020-06-22 02:36:43,417 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 7 states and 12 transitions. cyclomatic complexity: 7. Second operand 3 states. Result 9 states and 18 transitions. Complement of second has 4 states. [2020-06-22 02:36:43,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2020-06-22 02:36:43,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-06-22 02:36:43,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 11 transitions. [2020-06-22 02:36:43,418 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 5 letters. Loop has 2 letters. [2020-06-22 02:36:43,419 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 02:36:43,419 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 7 letters. Loop has 2 letters. [2020-06-22 02:36:43,419 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 02:36:43,419 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 5 letters. Loop has 4 letters. [2020-06-22 02:36:43,420 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 02:36:43,421 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 9 states and 18 transitions. [2020-06-22 02:36:43,421 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-06-22 02:36:43,421 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 9 states to 0 states and 0 transitions. [2020-06-22 02:36:43,422 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-06-22 02:36:43,422 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-06-22 02:36:43,422 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-06-22 02:36:43,422 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 02:36:43,422 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 02:36:43,422 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 02:36:43,422 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 02:36:43,422 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2020-06-22 02:36:43,422 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-06-22 02:36:43,423 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-06-22 02:36:43,423 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-06-22 02:36:43,429 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 02:36:43 BasicIcfg [2020-06-22 02:36:43,429 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-06-22 02:36:43,429 INFO L168 Benchmark]: Toolchain (without parser) took 3627.04 ms. Allocated memory was 649.6 MB in the beginning and 744.5 MB in the end (delta: 94.9 MB). Free memory was 564.2 MB in the beginning and 664.6 MB in the end (delta: -100.4 MB). There was no memory consumed. Max. memory is 50.3 GB. [2020-06-22 02:36:43,431 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 649.6 MB. Free memory is still 586.9 MB. There was no memory consumed. Max. memory is 50.3 GB. [2020-06-22 02:36:43,431 INFO L168 Benchmark]: CACSL2BoogieTranslator took 277.63 ms. Allocated memory was 649.6 MB in the beginning and 662.7 MB in the end (delta: 13.1 MB). Free memory was 564.2 MB in the beginning and 628.8 MB in the end (delta: -64.5 MB). Peak memory consumption was 28.4 MB. Max. memory is 50.3 GB. [2020-06-22 02:36:43,432 INFO L168 Benchmark]: Boogie Procedure Inliner took 34.26 ms. Allocated memory is still 662.7 MB. Free memory was 627.4 MB in the beginning and 626.1 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. [2020-06-22 02:36:43,433 INFO L168 Benchmark]: Boogie Preprocessor took 19.11 ms. Allocated memory is still 662.7 MB. Free memory was 626.1 MB in the beginning and 624.7 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 50.3 GB. [2020-06-22 02:36:43,433 INFO L168 Benchmark]: RCFGBuilder took 197.03 ms. Allocated memory is still 662.7 MB. Free memory was 624.7 MB in the beginning and 611.5 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 50.3 GB. [2020-06-22 02:36:43,434 INFO L168 Benchmark]: BlockEncodingV2 took 83.72 ms. Allocated memory is still 662.7 MB. Free memory was 611.5 MB in the beginning and 606.1 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 50.3 GB. [2020-06-22 02:36:43,434 INFO L168 Benchmark]: TraceAbstraction took 155.30 ms. Allocated memory is still 662.7 MB. Free memory was 606.1 MB in the beginning and 595.5 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 50.3 GB. [2020-06-22 02:36:43,435 INFO L168 Benchmark]: BuchiAutomizer took 2853.35 ms. Allocated memory was 662.7 MB in the beginning and 744.5 MB in the end (delta: 81.8 MB). Free memory was 595.5 MB in the beginning and 664.6 MB in the end (delta: -69.1 MB). Peak memory consumption was 12.7 MB. Max. memory is 50.3 GB. [2020-06-22 02:36:43,439 INFO L337 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 8 locations, 11 edges - StatisticsResult: Encoded RCFG 3 locations, 7 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 649.6 MB. Free memory is still 586.9 MB. There was no memory consumed. Max. memory is 50.3 GB. * CACSL2BoogieTranslator took 277.63 ms. Allocated memory was 649.6 MB in the beginning and 662.7 MB in the end (delta: 13.1 MB). Free memory was 564.2 MB in the beginning and 628.8 MB in the end (delta: -64.5 MB). Peak memory consumption was 28.4 MB. Max. memory is 50.3 GB. * Boogie Procedure Inliner took 34.26 ms. Allocated memory is still 662.7 MB. Free memory was 627.4 MB in the beginning and 626.1 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. * Boogie Preprocessor took 19.11 ms. Allocated memory is still 662.7 MB. Free memory was 626.1 MB in the beginning and 624.7 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 50.3 GB. * RCFGBuilder took 197.03 ms. Allocated memory is still 662.7 MB. Free memory was 624.7 MB in the beginning and 611.5 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 50.3 GB. * BlockEncodingV2 took 83.72 ms. Allocated memory is still 662.7 MB. Free memory was 611.5 MB in the beginning and 606.1 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 50.3 GB. * TraceAbstraction took 155.30 ms. Allocated memory is still 662.7 MB. Free memory was 606.1 MB in the beginning and 595.5 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 50.3 GB. * BuchiAutomizer took 2853.35 ms. Allocated memory was 662.7 MB in the beginning and 744.5 MB in the end (delta: 81.8 MB). Free memory was 595.5 MB in the beginning and 664.6 MB in the end (delta: -69.1 MB). Peak memory consumption was 12.7 MB. Max. memory is 50.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - AllSpecificationsHoldResult: All specifications hold We were not able to verify any specifiation because the program does not contain any specification. - InvariantResult [Line: 23]: 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, 1 LocationsWithAnnotation, 1 PreInvPairs, 1 NumberOfFragments, 1 HoareAnnotationTreeSize, 1 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 1 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - StatisticsResult: Constructed decomposition of program Your program was decomposed into 8 terminating modules (5 trivial, 0 deterministic, 3 nondeterministic). One nondeterministic module has affine ranking function id + -1 * tmp and consists of 4 locations. One nondeterministic module has affine ranking function 2 * maxId + -2 * tmp + 1 and consists of 3 locations. One nondeterministic module has affine ranking function id + -1 * tmp and consists of 3 locations. 5 modules have a trivial ranking function, the largest among these consists of 6 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.8s and 8 iterations. TraceHistogramMax:2. Analysis of lassos took 2.1s. Construction of modules took 0.1s. Büchi inclusion checks took 0.3s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 6. Automata minimization 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 8 StatesRemovedByMinimization, 5 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 11 states and ocurred in iteration 5. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 13 SDtfs, 50 SDslu, 0 SDs, 0 SdLazy, 126 SolverSat, 20 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT2 conc2 concLT1 SILN1 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital16 mio100 ax175 hnf100 lsp46 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq146 hnf94 smp100 dnf100 smp100 tf111 neg100 sie110 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 14ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 3 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 3 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.8s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! !SESSION 2020-06-22 02:36:36.494 ----------------------------------------------- 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/sandbox/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/sandbox/tmp -i /export/starexec/sandbox/benchmark/theBenchmark.c !ENTRY org.eclipse.core.resources 2 10035 2020-06-22 02:36:43.671 !MESSAGE The workspace will exit with unsaved changes in this session. Received shutdown request... Ultimate: GTK+ Version Check