YES Ultimate: Cannot open display: This is Ultimate 0.1.24-8dc7c08-m [2020-06-22 04:51:53,169 INFO L170 SettingsManager]: Resetting all preferences to default values... [2020-06-22 04:51:53,171 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2020-06-22 04:51:53,182 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-06-22 04:51:53,182 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-06-22 04:51:53,183 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-06-22 04:51:53,185 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-06-22 04:51:53,186 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2020-06-22 04:51:53,188 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-06-22 04:51:53,188 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-06-22 04:51:53,189 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-06-22 04:51:53,189 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-06-22 04:51:53,190 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-06-22 04:51:53,191 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-06-22 04:51:53,192 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-06-22 04:51:53,193 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-06-22 04:51:53,194 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-06-22 04:51:53,195 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-06-22 04:51:53,197 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2020-06-22 04:51:53,199 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-06-22 04:51:53,200 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-06-22 04:51:53,201 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-06-22 04:51:53,203 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-06-22 04:51:53,203 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-06-22 04:51:53,203 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-06-22 04:51:53,204 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-06-22 04:51:53,204 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-06-22 04:51:53,205 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-06-22 04:51:53,205 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-06-22 04:51:53,206 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-06-22 04:51:53,207 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-06-22 04:51:53,207 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2020-06-22 04:51:53,208 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-06-22 04:51:53,208 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2020-06-22 04:51:53,209 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-06-22 04:51:53,209 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-06-22 04:51:53,209 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2020-06-22 04:51:53,210 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2020-06-22 04:51:53,211 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2020-06-22 04:51:53,211 INFO L98 SettingsManager]: Beginning loading settings from /export/starexec/sandbox/solver/bin/./../termcomp2017.epf [2020-06-22 04:51:53,225 INFO L110 SettingsManager]: Loading preferences was successful [2020-06-22 04:51:53,225 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2020-06-22 04:51:53,226 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-06-22 04:51:53,227 INFO L133 SettingsManager]: * Rewrite not-equals=true [2020-06-22 04:51:53,227 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2020-06-22 04:51:53,227 INFO L133 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE [2020-06-22 04:51:53,227 INFO L133 SettingsManager]: * Use SBE=true [2020-06-22 04:51:53,227 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-06-22 04:51:53,227 INFO L133 SettingsManager]: * Use old map elimination=false [2020-06-22 04:51:53,228 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2020-06-22 04:51:53,228 INFO L133 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION [2020-06-22 04:51:53,228 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2020-06-22 04:51:53,228 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-06-22 04:51:53,228 INFO L133 SettingsManager]: * Construct termination proof for TermComp=true [2020-06-22 04:51:53,229 INFO L133 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 04:51:53,229 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-06-22 04:51:53,229 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-06-22 04:51:53,229 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2020-06-22 04:51:53,229 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2020-06-22 04:51:53,230 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-06-22 04:51:53,230 INFO L133 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE [2020-06-22 04:51:53,230 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-06-22 04:51:53,230 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-06-22 04:51:53,230 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-06-22 04:51:53,230 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-06-22 04:51:53,231 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-06-22 04:51:53,231 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-06-22 04:51:53,231 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2020-06-22 04:51:53,231 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-06-22 04:51:53,256 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-06-22 04:51:53,269 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-06-22 04:51:53,273 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-06-22 04:51:53,274 INFO L271 PluginConnector]: Initializing CDTParser... [2020-06-22 04:51:53,275 INFO L276 PluginConnector]: CDTParser initialized [2020-06-22 04:51:53,275 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox/benchmark/theBenchmark.c [2020-06-22 04:51:53,343 INFO L221 CDTParser]: Created temporary CDT project at /export/starexec/sandbox/tmp/4b257277035a4ad79c3844c441d27d7e/FLAGa8fb67762 [2020-06-22 04:51:53,674 INFO L307 CDTParser]: Found 1 translation units. [2020-06-22 04:51:53,674 INFO L161 CDTParser]: Scanning /export/starexec/sandbox/benchmark/theBenchmark.c [2020-06-22 04:51:53,681 INFO L355 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox/tmp/4b257277035a4ad79c3844c441d27d7e/FLAGa8fb67762 [2020-06-22 04:51:54,098 INFO L363 CDTParser]: Successfully deleted /export/starexec/sandbox/tmp/4b257277035a4ad79c3844c441d27d7e [2020-06-22 04:51:54,109 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-06-22 04:51:54,111 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. [2020-06-22 04:51:54,112 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-06-22 04:51:54,112 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-06-22 04:51:54,116 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2020-06-22 04:51:54,117 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.06 04:51:54" (1/1) ... [2020-06-22 04:51:54,120 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3aa5e080 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 04:51:54, skipping insertion in model container [2020-06-22 04:51:54,120 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.06 04:51:54" (1/1) ... [2020-06-22 04:51:54,128 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-06-22 04:51:54,146 INFO L176 MainTranslator]: Built tables and reachable declarations [2020-06-22 04:51:54,307 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-06-22 04:51:54,312 INFO L191 MainTranslator]: Completed pre-run [2020-06-22 04:51:54,393 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-06-22 04:51:54,407 INFO L195 MainTranslator]: Completed translation [2020-06-22 04:51:54,408 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 04:51:54 WrapperNode [2020-06-22 04:51:54,408 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-06-22 04:51:54,409 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-06-22 04:51:54,409 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-06-22 04:51:54,409 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2020-06-22 04:51:54,418 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 04:51:54" (1/1) ... [2020-06-22 04:51:54,423 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 04:51:54" (1/1) ... [2020-06-22 04:51:54,443 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-06-22 04:51:54,443 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-06-22 04:51:54,443 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-06-22 04:51:54,444 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2020-06-22 04:51:54,453 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 04:51:54" (1/1) ... [2020-06-22 04:51:54,453 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 04:51:54" (1/1) ... [2020-06-22 04:51:54,453 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 04:51:54" (1/1) ... [2020-06-22 04:51:54,454 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 04:51:54" (1/1) ... [2020-06-22 04:51:54,456 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 04:51:54" (1/1) ... [2020-06-22 04:51:54,461 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 04:51:54" (1/1) ... [2020-06-22 04:51:54,461 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 04:51:54" (1/1) ... [2020-06-22 04:51:54,462 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-06-22 04:51:54,463 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-06-22 04:51:54,463 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-06-22 04:51:54,463 INFO L276 PluginConnector]: RCFGBuilder initialized [2020-06-22 04:51:54,464 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 04:51:54" (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 04:51:54,531 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-06-22 04:51:54,531 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-06-22 04:51:54,662 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-06-22 04:51:54,663 INFO L286 CfgBuilder]: Removed 5 assue(true) statements. [2020-06-22 04:51:54,664 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 04:51:54 BoogieIcfgContainer [2020-06-22 04:51:54,664 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-06-22 04:51:54,665 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- [2020-06-22 04:51:54,665 INFO L271 PluginConnector]: Initializing BlockEncodingV2... [2020-06-22 04:51:54,667 INFO L276 PluginConnector]: BlockEncodingV2 initialized [2020-06-22 04:51:54,668 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 04:51:54" (1/1) ... [2020-06-22 04:51:54,682 INFO L313 BlockEncoder]: Initial Icfg 8 locations, 11 edges [2020-06-22 04:51:54,683 INFO L258 BlockEncoder]: Using Remove infeasible edges [2020-06-22 04:51:54,684 INFO L263 BlockEncoder]: Using Maximize final states [2020-06-22 04:51:54,685 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false [2020-06-22 04:51:54,685 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE [2020-06-22 04:51:54,687 INFO L296 BlockEncoder]: Using Remove sink states [2020-06-22 04:51:54,688 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true [2020-06-22 04:51:54,688 INFO L179 BlockEncoder]: Using Rewrite not-equals [2020-06-22 04:51:54,705 INFO L185 BlockEncoder]: Using Use SBE [2020-06-22 04:51:54,729 INFO L200 BlockEncoder]: SBE split 3 edges [2020-06-22 04:51:54,735 INFO L70 emoveInfeasibleEdges]: Removed 1 edges and 0 locations because of local infeasibility [2020-06-22 04:51:54,737 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-06-22 04:51:54,748 INFO L100 BaseMinimizeStates]: Removed 6 edges and 3 locations by large block encoding [2020-06-22 04:51:54,750 INFO L70 RemoveSinkStates]: Removed 1 edges and 1 locations by removing sink states [2020-06-22 04:51:54,751 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-06-22 04:51:54,751 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-06-22 04:51:54,751 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding [2020-06-22 04:51:54,752 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states [2020-06-22 04:51:54,752 INFO L313 BlockEncoder]: Encoded RCFG 4 locations, 24 edges [2020-06-22 04:51:54,753 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 04:51:54 BasicIcfg [2020-06-22 04:51:54,754 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- [2020-06-22 04:51:54,754 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-06-22 04:51:54,755 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-06-22 04:51:54,758 INFO L276 PluginConnector]: TraceAbstraction initialized [2020-06-22 04:51:54,758 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.06 04:51:54" (1/4) ... [2020-06-22 04:51:54,759 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58d58a4f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 04:51:54, skipping insertion in model container [2020-06-22 04:51:54,759 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 04:51:54" (2/4) ... [2020-06-22 04:51:54,759 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58d58a4f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 04:51:54, skipping insertion in model container [2020-06-22 04:51:54,759 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 04:51:54" (3/4) ... [2020-06-22 04:51:54,760 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58d58a4f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 04:51:54, skipping insertion in model container [2020-06-22 04:51:54,760 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 04:51:54" (4/4) ... [2020-06-22 04:51:54,762 INFO L112 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-06-22 04:51:54,772 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2020-06-22 04:51:54,779 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 0 error locations. [2020-06-22 04:51:54,797 INFO L257 AbstractCegarLoop]: Starting to check reachability of 0 error locations. [2020-06-22 04:51:54,825 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2020-06-22 04:51:54,826 INFO L382 AbstractCegarLoop]: Interprodecural is true [2020-06-22 04:51:54,826 INFO L383 AbstractCegarLoop]: Hoare is true [2020-06-22 04:51:54,826 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2020-06-22 04:51:54,826 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-06-22 04:51:54,827 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-06-22 04:51:54,827 INFO L387 AbstractCegarLoop]: Difference is false [2020-06-22 04:51:54,827 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-06-22 04:51:54,827 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-06-22 04:51:54,841 INFO L276 IsEmpty]: Start isEmpty. Operand 4 states. [2020-06-22 04:51:54,847 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-06-22 04:51:54,850 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-06-22 04:51:54,898 INFO L448 ceAbstractionStarter]: For program point L18-2(lines 17 26) no Hoare annotation was computed. [2020-06-22 04:51:54,899 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-06-22 04:51:54,899 INFO L451 ceAbstractionStarter]: At program point L23-1(lines 17 26) the Hoare annotation is: true [2020-06-22 04:51:54,899 INFO L448 ceAbstractionStarter]: For program point L18(lines 18 22) no Hoare annotation was computed. [2020-06-22 04:51:54,907 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 04:51:54 BasicIcfg [2020-06-22 04:51:54,907 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-06-22 04:51:54,908 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-06-22 04:51:54,908 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-06-22 04:51:54,911 INFO L276 PluginConnector]: BuchiAutomizer initialized [2020-06-22 04:51:54,912 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 04:51:54,912 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.06 04:51:54" (1/5) ... [2020-06-22 04:51:54,913 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@789b65ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.06 04:51:54, skipping insertion in model container [2020-06-22 04:51:54,913 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 04:51:54,913 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 04:51:54" (2/5) ... [2020-06-22 04:51:54,914 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@789b65ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.06 04:51:54, skipping insertion in model container [2020-06-22 04:51:54,914 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 04:51:54,914 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 04:51:54" (3/5) ... [2020-06-22 04:51:54,914 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@789b65ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 04:51:54, skipping insertion in model container [2020-06-22 04:51:54,914 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 04:51:54,915 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 04:51:54" (4/5) ... [2020-06-22 04:51:54,915 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@789b65ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 04:51:54, skipping insertion in model container [2020-06-22 04:51:54,915 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 04:51:54,915 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 04:51:54" (5/5) ... [2020-06-22 04:51:54,917 INFO L375 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-06-22 04:51:54,943 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2020-06-22 04:51:54,943 INFO L374 BuchiCegarLoop]: Interprodecural is true [2020-06-22 04:51:54,944 INFO L375 BuchiCegarLoop]: Hoare is true [2020-06-22 04:51:54,944 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-06-22 04:51:54,944 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-06-22 04:51:54,944 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-06-22 04:51:54,944 INFO L379 BuchiCegarLoop]: Difference is false [2020-06-22 04:51:54,944 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-06-22 04:51:54,944 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-06-22 04:51:54,948 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4 states. [2020-06-22 04:51:54,967 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-06-22 04:51:54,968 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 04:51:54,968 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 04:51:54,975 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] [2020-06-22 04:51:54,975 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-06-22 04:51:54,975 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2020-06-22 04:51:54,975 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4 states. [2020-06-22 04:51:54,976 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-06-22 04:51:54,977 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 04:51:54,977 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 04:51:54,977 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] [2020-06-22 04:51:54,977 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-06-22 04:51:54,982 INFO L794 eck$LassoCheckResult]: Stem: 3#ULTIMATE.startENTRYtrue [31] ULTIMATE.startENTRY-->L23-1: Formula: (and (= v_ULTIMATE.start_main_~x~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|) (= v_ULTIMATE.start_main_~debug~0_1 0)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_#t~post1=|v_ULTIMATE.start_main_#t~post1_1|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_main_~debug~0=v_ULTIMATE.start_main_~debug~0_1} AuxVars[|v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~debug~0, ULTIMATE.start_main_#t~post1, ULTIMATE.start_main_~x~0] 5#L23-1true [2020-06-22 04:51:54,983 INFO L796 eck$LassoCheckResult]: Loop: 5#L23-1true [37] L23-1-->L18: Formula: (< v_ULTIMATE.start_main_~x~0_6 255) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_6} OutVars{ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_6} AuxVars[] AssignedVars[] 6#L18true [45] L18-->L18-2: Formula: (let ((.cse0 (mod v_ULTIMATE.start_main_~x~0_8 2))) (and (= v_ULTIMATE.start_main_~x~0_8 (+ v_ULTIMATE.start_main_~x~0_7 1)) (< v_ULTIMATE.start_main_~x~0_8 0) (> (+ .cse0 (- 2)) 0) (> 0 .cse0))) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8} OutVars{ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7, ULTIMATE.start_main_#t~post1=|v_ULTIMATE.start_main_#t~post1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post1, ULTIMATE.start_main_~x~0] 4#L18-2true [64] L18-2-->L23-1: Formula: (and (= v_ULTIMATE.start_main_~x~0_4 0) (< 0 v_ULTIMATE.start_main_~debug~0_4)) InVars {ULTIMATE.start_main_~debug~0=v_ULTIMATE.start_main_~debug~0_4} OutVars{ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_4, ULTIMATE.start_main_~debug~0=v_ULTIMATE.start_main_~debug~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0] 5#L23-1true [2020-06-22 04:51:54,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 04:51:54,989 INFO L82 PathProgramCache]: Analyzing trace with hash 62, now seen corresponding path program 1 times [2020-06-22 04:51:54,991 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 04:51:54,992 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 04:51:55,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:51:55,012 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 04:51:55,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:51:55,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:51:55,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:51:55,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 04:51:55,062 INFO L82 PathProgramCache]: Analyzing trace with hash 66807, now seen corresponding path program 1 times [2020-06-22 04:51:55,062 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 04:51:55,062 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 04:51:55,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:51:55,064 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 04:51:55,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:51:55,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:51:55,100 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 04:51:55,102 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 04:51:55,102 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 04:51:55,107 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-06-22 04:51:55,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-06-22 04:51:55,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-06-22 04:51:55,124 INFO L87 Difference]: Start difference. First operand 4 states. Second operand 2 states. [2020-06-22 04:51:55,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 04:51:55,171 INFO L93 Difference]: Finished difference Result 4 states and 9 transitions. [2020-06-22 04:51:55,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-06-22 04:51:55,175 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 4 states and 9 transitions. [2020-06-22 04:51:55,176 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-06-22 04:51:55,180 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 4 states to 4 states and 9 transitions. [2020-06-22 04:51:55,181 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4 [2020-06-22 04:51:55,181 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4 [2020-06-22 04:51:55,182 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 9 transitions. [2020-06-22 04:51:55,183 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 04:51:55,183 INFO L706 BuchiCegarLoop]: Abstraction has 4 states and 9 transitions. [2020-06-22 04:51:55,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4 states and 9 transitions. [2020-06-22 04:51:55,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4 to 4. [2020-06-22 04:51:55,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-06-22 04:51:55,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 9 transitions. [2020-06-22 04:51:55,212 INFO L729 BuchiCegarLoop]: Abstraction has 4 states and 9 transitions. [2020-06-22 04:51:55,212 INFO L609 BuchiCegarLoop]: Abstraction has 4 states and 9 transitions. [2020-06-22 04:51:55,212 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2020-06-22 04:51:55,213 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4 states and 9 transitions. [2020-06-22 04:51:55,213 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-06-22 04:51:55,213 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 04:51:55,213 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 04:51:55,214 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] [2020-06-22 04:51:55,214 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-06-22 04:51:55,214 INFO L794 eck$LassoCheckResult]: Stem: 16#ULTIMATE.startENTRY [31] ULTIMATE.startENTRY-->L23-1: Formula: (and (= v_ULTIMATE.start_main_~x~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|) (= v_ULTIMATE.start_main_~debug~0_1 0)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_#t~post1=|v_ULTIMATE.start_main_#t~post1_1|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_main_~debug~0=v_ULTIMATE.start_main_~debug~0_1} AuxVars[|v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~debug~0, ULTIMATE.start_main_#t~post1, ULTIMATE.start_main_~x~0] 17#L23-1 [2020-06-22 04:51:55,215 INFO L796 eck$LassoCheckResult]: Loop: 17#L23-1 [37] L23-1-->L18: Formula: (< v_ULTIMATE.start_main_~x~0_6 255) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_6} OutVars{ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_6} AuxVars[] AssignedVars[] 19#L18 [54] L18-->L18-2: Formula: (let ((.cse0 (mod v_ULTIMATE.start_main_~x~0_8 2))) (and (< (+ .cse0 (- 2)) 0) (< 0 .cse0) (= v_ULTIMATE.start_main_~x~0_8 (+ v_ULTIMATE.start_main_~x~0_7 1)) (< v_ULTIMATE.start_main_~x~0_8 0))) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8} OutVars{ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7, ULTIMATE.start_main_#t~post1=|v_ULTIMATE.start_main_#t~post1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post1, ULTIMATE.start_main_~x~0] 18#L18-2 [64] L18-2-->L23-1: Formula: (and (= v_ULTIMATE.start_main_~x~0_4 0) (< 0 v_ULTIMATE.start_main_~debug~0_4)) InVars {ULTIMATE.start_main_~debug~0=v_ULTIMATE.start_main_~debug~0_4} OutVars{ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_4, ULTIMATE.start_main_~debug~0=v_ULTIMATE.start_main_~debug~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0] 17#L23-1 [2020-06-22 04:51:55,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 04:51:55,215 INFO L82 PathProgramCache]: Analyzing trace with hash 62, now seen corresponding path program 2 times [2020-06-22 04:51:55,215 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 04:51:55,215 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 04:51:55,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:51:55,217 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 04:51:55,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:51:55,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:51:55,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:51:55,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 04:51:55,221 INFO L82 PathProgramCache]: Analyzing trace with hash 67086, now seen corresponding path program 1 times [2020-06-22 04:51:55,221 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 04:51:55,221 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 04:51:55,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:51:55,222 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 04:51:55,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:51:55,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:51:55,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:51:55,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 04:51:55,233 INFO L82 PathProgramCache]: Analyzing trace with hash 1884337, now seen corresponding path program 1 times [2020-06-22 04:51:55,233 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 04:51:55,233 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 04:51:55,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:51:55,234 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 04:51:55,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:51:55,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:51:55,254 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 04:51:55,255 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 04:51:55,255 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-06-22 04:51:55,330 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 04:51:55,331 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 04:51:55,331 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 04:51:55,332 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 04:51:55,332 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2020-06-22 04:51:55,332 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 04:51:55,332 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 04:51:55,332 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 04:51:55,332 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration2_Loop [2020-06-22 04:51:55,332 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 04:51:55,333 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 04:51:55,350 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 04:51:55,365 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 04:51:55,368 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 04:51:55,469 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 04:51:55,470 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 04:51:55,478 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 04:51:55,478 INFO L163 nArgumentSynthesizer]: Using integer mode. 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 04:51:55,516 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-06-22 04:51:55,517 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 04:51:55,559 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-06-22 04:51:55,561 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 04:51:55,562 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 04:51:55,562 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 04:51:55,562 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 04:51:55,562 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 04:51:55,562 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 04:51:55,562 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 04:51:55,562 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 04:51:55,563 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration2_Loop [2020-06-22 04:51:55,563 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 04:51:55,563 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 04:51:55,564 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 04:51:55,573 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 04:51:55,576 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 04:51:55,635 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 04:51:55,640 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 04:51:55,642 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 04:51:55,644 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 04:51:55,644 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 04:51:55,644 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 04:51:55,645 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 04:51:55,645 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 04:51:55,647 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 04:51:55,647 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 04:51:55,656 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 04:51:55,663 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-06-22 04:51:55,663 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2020-06-22 04:51:55,665 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 04:51:55,666 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-06-22 04:51:55,666 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 04:51:55,667 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0) = -1*ULTIMATE.start_main_~x~0 Supporting invariants [] [2020-06-22 04:51:55,668 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-06-22 04:51:55,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 04:51:55,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:51:55,703 INFO L256 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 2 conjunts are in the unsatisfiable core [2020-06-22 04:51:55,704 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 04:51:55,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:51:55,717 INFO L256 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 04:51:55,718 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 04:51:55,733 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 04:51:55,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:51:55,741 INFO L256 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 2 conjunts are in the unsatisfiable core [2020-06-22 04:51:55,742 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 04:51:55,751 INFO L98 LoopCannibalizer]: 2 predicates before loop cannibalization 3 predicates after loop cannibalization [2020-06-22 04:51:55,754 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 3 loop predicates [2020-06-22 04:51:55,755 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 4 states and 9 transitions. cyclomatic complexity: 6 Second operand 4 states. [2020-06-22 04:51:55,941 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 4 states and 9 transitions. cyclomatic complexity: 6. Second operand 4 states. Result 38 states and 94 transitions. Complement of second has 12 states. [2020-06-22 04:51:55,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 1 stem states 4 non-accepting loop states 2 accepting loop states [2020-06-22 04:51:55,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-06-22 04:51:55,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 54 transitions. [2020-06-22 04:51:55,946 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 54 transitions. Stem has 1 letters. Loop has 3 letters. [2020-06-22 04:51:55,946 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 04:51:55,947 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 54 transitions. Stem has 4 letters. Loop has 3 letters. [2020-06-22 04:51:55,947 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 04:51:55,947 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 54 transitions. Stem has 1 letters. Loop has 6 letters. [2020-06-22 04:51:55,948 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 04:51:55,953 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 94 transitions. [2020-06-22 04:51:55,956 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 15 [2020-06-22 04:51:55,958 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 29 states and 63 transitions. [2020-06-22 04:51:55,958 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2020-06-22 04:51:55,958 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2020-06-22 04:51:55,958 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 63 transitions. [2020-06-22 04:51:55,959 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 04:51:55,959 INFO L706 BuchiCegarLoop]: Abstraction has 29 states and 63 transitions. [2020-06-22 04:51:55,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 63 transitions. [2020-06-22 04:51:55,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 20. [2020-06-22 04:51:55,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-06-22 04:51:55,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 43 transitions. [2020-06-22 04:51:55,963 INFO L729 BuchiCegarLoop]: Abstraction has 20 states and 43 transitions. [2020-06-22 04:51:55,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 04:51:55,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 04:51:55,963 INFO L87 Difference]: Start difference. First operand 20 states and 43 transitions. Second operand 3 states. [2020-06-22 04:51:55,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 04:51:55,977 INFO L93 Difference]: Finished difference Result 20 states and 39 transitions. [2020-06-22 04:51:55,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 04:51:55,981 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 39 transitions. [2020-06-22 04:51:55,983 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 12 [2020-06-22 04:51:55,984 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 20 states and 39 transitions. [2020-06-22 04:51:55,984 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2020-06-22 04:51:55,984 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2020-06-22 04:51:55,984 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 39 transitions. [2020-06-22 04:51:55,984 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 04:51:55,985 INFO L706 BuchiCegarLoop]: Abstraction has 20 states and 39 transitions. [2020-06-22 04:51:55,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 39 transitions. [2020-06-22 04:51:55,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2020-06-22 04:51:55,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-06-22 04:51:55,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 39 transitions. [2020-06-22 04:51:55,988 INFO L729 BuchiCegarLoop]: Abstraction has 20 states and 39 transitions. [2020-06-22 04:51:55,988 INFO L609 BuchiCegarLoop]: Abstraction has 20 states and 39 transitions. [2020-06-22 04:51:55,988 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2020-06-22 04:51:55,988 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 39 transitions. [2020-06-22 04:51:55,989 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 12 [2020-06-22 04:51:55,989 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 04:51:55,989 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 04:51:55,990 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-06-22 04:51:55,990 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-06-22 04:51:55,990 INFO L794 eck$LassoCheckResult]: Stem: 154#ULTIMATE.startENTRY [31] ULTIMATE.startENTRY-->L23-1: Formula: (and (= v_ULTIMATE.start_main_~x~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|) (= v_ULTIMATE.start_main_~debug~0_1 0)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_#t~post1=|v_ULTIMATE.start_main_#t~post1_1|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_main_~debug~0=v_ULTIMATE.start_main_~debug~0_1} AuxVars[|v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~debug~0, ULTIMATE.start_main_#t~post1, ULTIMATE.start_main_~x~0] 155#L23-1 [37] L23-1-->L18: Formula: (< v_ULTIMATE.start_main_~x~0_6 255) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_6} OutVars{ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_6} AuxVars[] AssignedVars[] 168#L18 [2020-06-22 04:51:55,990 INFO L796 eck$LassoCheckResult]: Loop: 168#L18 [61] L18-->L18-2: Formula: (and (= v_ULTIMATE.start_main_~x~0_9 (+ v_ULTIMATE.start_main_~x~0_10 2)) (= 0 (mod v_ULTIMATE.start_main_~x~0_10 2))) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_10} OutVars{ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_9} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0] 171#L18-2 [33] L18-2-->L23-1: Formula: (= 0 v_ULTIMATE.start_main_~debug~0_5) InVars {ULTIMATE.start_main_~debug~0=v_ULTIMATE.start_main_~debug~0_5} OutVars{ULTIMATE.start_main_~debug~0=v_ULTIMATE.start_main_~debug~0_5} AuxVars[] AssignedVars[] 173#L23-1 [37] L23-1-->L18: Formula: (< v_ULTIMATE.start_main_~x~0_6 255) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_6} OutVars{ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_6} AuxVars[] AssignedVars[] 168#L18 [2020-06-22 04:51:55,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 04:51:55,991 INFO L82 PathProgramCache]: Analyzing trace with hash 1959, now seen corresponding path program 1 times [2020-06-22 04:51:55,991 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 04:51:55,991 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 04:51:55,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:51:55,992 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 04:51:55,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:51:55,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:51:55,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:51:55,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 04:51:55,998 INFO L82 PathProgramCache]: Analyzing trace with hash 89472, now seen corresponding path program 1 times [2020-06-22 04:51:55,998 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 04:51:55,998 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 04:51:55,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:51:55,999 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 04:51:55,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:51:56,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:51:56,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:51:56,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 04:51:56,006 INFO L82 PathProgramCache]: Analyzing trace with hash 58420250, now seen corresponding path program 1 times [2020-06-22 04:51:56,006 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 04:51:56,006 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 04:51:56,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:51:56,007 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 04:51:56,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:51:56,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:51:56,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:51:56,040 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 04:51:56,041 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 04:51:56,041 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 04:51:56,041 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 04:51:56,041 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2020-06-22 04:51:56,041 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 04:51:56,041 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 04:51:56,041 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 04:51:56,041 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration3_Loop [2020-06-22 04:51:56,042 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 04:51:56,042 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 04:51:56,043 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 04:51:56,054 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 04:51:56,123 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 04:51:56,123 INFO L412 LassoAnalysis]: Checking for nontermination... 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 04:51:56,131 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 04:51:56,132 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 04:51:56,163 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-06-22 04:51:56,163 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 04:51:59,622 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-06-22 04:51:59,625 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 04:51:59,626 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 04:51:59,626 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 04:51:59,626 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 04:51:59,626 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 04:51:59,626 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 04:51:59,626 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 04:51:59,626 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 04:51:59,626 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration3_Loop [2020-06-22 04:51:59,627 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 04:51:59,627 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 04:51:59,628 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 04:51:59,636 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 04:51:59,692 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 04:51:59,693 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 04:51:59,693 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 04:51:59,694 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 04:51:59,694 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 04:51:59,694 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 04:51:59,695 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 04:51:59,695 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 04:51:59,696 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 04:51:59,696 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 04:51:59,703 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 04:51:59,708 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-06-22 04:51:59,708 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2020-06-22 04:51:59,709 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 04:51:59,709 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-06-22 04:51:59,709 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 04:51:59,709 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0) = -1*ULTIMATE.start_main_~x~0 + 253 Supporting invariants [] [2020-06-22 04:51:59,710 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-06-22 04:51:59,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 04:51:59,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:51:59,730 INFO L256 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 2 conjunts are in the unsatisfiable core [2020-06-22 04:51:59,730 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 04:51:59,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:51:59,736 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 04:51:59,736 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 04:51:59,744 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 04:51:59,745 INFO L98 LoopCannibalizer]: 2 predicates before loop cannibalization 2 predicates after loop cannibalization [2020-06-22 04:51:59,745 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 04:51:59,745 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 20 states and 39 transitions. cyclomatic complexity: 25 Second operand 3 states. [2020-06-22 04:51:59,790 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 20 states and 39 transitions. cyclomatic complexity: 25. Second operand 3 states. Result 45 states and 82 transitions. Complement of second has 4 states. [2020-06-22 04:51:59,791 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 04:51:59,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-06-22 04:51:59,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 12 transitions. [2020-06-22 04:51:59,792 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 2 letters. Loop has 3 letters. [2020-06-22 04:51:59,793 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 04:51:59,793 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 5 letters. Loop has 3 letters. [2020-06-22 04:51:59,793 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 04:51:59,793 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 2 letters. Loop has 6 letters. [2020-06-22 04:51:59,794 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 04:51:59,796 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 82 transitions. [2020-06-22 04:51:59,798 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 20 [2020-06-22 04:51:59,799 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 37 states and 73 transitions. [2020-06-22 04:51:59,799 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2020-06-22 04:51:59,800 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2020-06-22 04:51:59,800 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 73 transitions. [2020-06-22 04:51:59,800 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 04:51:59,800 INFO L706 BuchiCegarLoop]: Abstraction has 37 states and 73 transitions. [2020-06-22 04:51:59,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 73 transitions. [2020-06-22 04:51:59,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 33. [2020-06-22 04:51:59,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2020-06-22 04:51:59,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 68 transitions. [2020-06-22 04:51:59,804 INFO L729 BuchiCegarLoop]: Abstraction has 33 states and 68 transitions. [2020-06-22 04:51:59,804 INFO L609 BuchiCegarLoop]: Abstraction has 33 states and 68 transitions. [2020-06-22 04:51:59,804 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2020-06-22 04:51:59,804 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 68 transitions. [2020-06-22 04:51:59,806 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 20 [2020-06-22 04:51:59,806 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 04:51:59,806 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 04:51:59,806 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2020-06-22 04:51:59,806 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-06-22 04:51:59,807 INFO L794 eck$LassoCheckResult]: Stem: 254#ULTIMATE.startENTRY [31] ULTIMATE.startENTRY-->L23-1: Formula: (and (= v_ULTIMATE.start_main_~x~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|) (= v_ULTIMATE.start_main_~debug~0_1 0)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_#t~post1=|v_ULTIMATE.start_main_#t~post1_1|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_main_~debug~0=v_ULTIMATE.start_main_~debug~0_1} AuxVars[|v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~debug~0, ULTIMATE.start_main_#t~post1, ULTIMATE.start_main_~x~0] 255#L23-1 [37] L23-1-->L18: Formula: (< v_ULTIMATE.start_main_~x~0_6 255) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_6} OutVars{ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_6} AuxVars[] AssignedVars[] 277#L18 [54] L18-->L18-2: Formula: (let ((.cse0 (mod v_ULTIMATE.start_main_~x~0_8 2))) (and (< (+ .cse0 (- 2)) 0) (< 0 .cse0) (= v_ULTIMATE.start_main_~x~0_8 (+ v_ULTIMATE.start_main_~x~0_7 1)) (< v_ULTIMATE.start_main_~x~0_8 0))) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8} OutVars{ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7, ULTIMATE.start_main_#t~post1=|v_ULTIMATE.start_main_#t~post1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post1, ULTIMATE.start_main_~x~0] 263#L18-2 [2020-06-22 04:51:59,807 INFO L796 eck$LassoCheckResult]: Loop: 263#L18-2 [33] L18-2-->L23-1: Formula: (= 0 v_ULTIMATE.start_main_~debug~0_5) InVars {ULTIMATE.start_main_~debug~0=v_ULTIMATE.start_main_~debug~0_5} OutVars{ULTIMATE.start_main_~debug~0=v_ULTIMATE.start_main_~debug~0_5} AuxVars[] AssignedVars[] 268#L23-1 [37] L23-1-->L18: Formula: (< v_ULTIMATE.start_main_~x~0_6 255) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_6} OutVars{ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_6} AuxVars[] AssignedVars[] 262#L18 [54] L18-->L18-2: Formula: (let ((.cse0 (mod v_ULTIMATE.start_main_~x~0_8 2))) (and (< (+ .cse0 (- 2)) 0) (< 0 .cse0) (= v_ULTIMATE.start_main_~x~0_8 (+ v_ULTIMATE.start_main_~x~0_7 1)) (< v_ULTIMATE.start_main_~x~0_8 0))) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8} OutVars{ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7, ULTIMATE.start_main_#t~post1=|v_ULTIMATE.start_main_#t~post1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post1, ULTIMATE.start_main_~x~0] 263#L18-2 [2020-06-22 04:51:59,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 04:51:59,807 INFO L82 PathProgramCache]: Analyzing trace with hash 60783, now seen corresponding path program 1 times [2020-06-22 04:51:59,807 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 04:51:59,807 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 04:51:59,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:51:59,808 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 04:51:59,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:51:59,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:51:59,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:51:59,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 04:51:59,817 INFO L82 PathProgramCache]: Analyzing trace with hash 62705, now seen corresponding path program 1 times [2020-06-22 04:51:59,817 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 04:51:59,817 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 04:51:59,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:51:59,818 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 04:51:59,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:51:59,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:51:59,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:51:59,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 04:51:59,824 INFO L82 PathProgramCache]: Analyzing trace with hash 1810819267, now seen corresponding path program 1 times [2020-06-22 04:51:59,824 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 04:51:59,824 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 04:51:59,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:51:59,825 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 04:51:59,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:51:59,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:51:59,856 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 04:51:59,856 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 04:51:59,856 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 04:51:59,881 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 04:51:59,881 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 04:51:59,881 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 04:51:59,882 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 04:51:59,882 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2020-06-22 04:51:59,882 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 04:51:59,882 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 04:51:59,882 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 04:51:59,882 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration4_Loop [2020-06-22 04:51:59,882 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 04:51:59,882 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 04:51:59,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 04:51:59,891 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 04:51:59,893 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 04:51:59,956 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 04:51:59,956 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 04:51:59,961 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 04:51:59,961 INFO L163 nArgumentSynthesizer]: Using integer mode. 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 04:51:59,991 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-06-22 04:51:59,991 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 04:52:00,038 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-06-22 04:52:00,040 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 04:52:00,040 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 04:52:00,041 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 04:52:00,041 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 04:52:00,041 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 04:52:00,041 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 04:52:00,041 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 04:52:00,041 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 04:52:00,041 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration4_Loop [2020-06-22 04:52:00,042 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 04:52:00,042 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 04:52:00,043 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 04:52:00,050 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 04:52:00,054 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 04:52:00,109 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 04:52:00,110 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 04:52:00,110 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 04:52:00,111 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 04:52:00,111 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 04:52:00,111 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 04:52:00,111 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 04:52:00,111 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 04:52:00,112 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 04:52:00,112 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 04:52:00,119 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 04:52:00,119 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 04:52:00,120 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 04:52:00,120 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 04:52:00,120 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 04:52:00,120 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 04:52:00,120 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 04:52:00,121 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 04:52:00,121 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 04:52:00,122 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 04:52:00,123 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 04:52:00,123 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 04:52:00,124 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 04:52:00,124 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 04:52:00,124 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 04:52:00,124 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 04:52:00,125 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 04:52:00,125 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 04:52:00,126 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 04:52:00,126 INFO L497 LassoAnalysis]: Using template '2-nested'. [2020-06-22 04:52:00,126 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 04:52:00,126 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 04:52:00,127 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 04:52:00,127 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 04:52:00,127 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 04:52:00,127 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2020-06-22 04:52:00,128 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2020-06-22 04:52:00,128 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 04:52:00,136 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 04:52:00,136 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 04:52:00,137 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 04:52:00,137 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 04:52:00,137 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 04:52:00,137 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 04:52:00,138 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2020-06-22 04:52:00,138 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2020-06-22 04:52:00,138 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 04:52:00,139 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 04:52:00,140 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 04:52:00,140 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 04:52:00,140 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 04:52:00,140 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 04:52:00,140 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 04:52:00,141 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2020-06-22 04:52:00,141 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2020-06-22 04:52:00,141 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 04:52:00,142 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 04:52:00,142 INFO L497 LassoAnalysis]: Using template '3-nested'. [2020-06-22 04:52:00,143 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 04:52:00,143 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 04:52:00,144 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 04:52:00,144 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 04:52:00,144 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 04:52:00,144 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 04:52:00,146 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2020-06-22 04:52:00,146 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 04:52:00,154 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 04:52:00,155 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 04:52:00,155 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 04:52:00,155 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 04:52:00,155 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 04:52:00,156 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 04:52:00,156 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 04:52:00,157 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2020-06-22 04:52:00,157 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 04:52:00,158 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 04:52:00,158 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 04:52:00,160 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 04:52:00,160 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 04:52:00,160 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 04:52:00,161 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 04:52:00,161 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 04:52:00,161 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2020-06-22 04:52:00,162 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 04:52:00,163 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 04:52:00,163 INFO L497 LassoAnalysis]: Using template '4-nested'. [2020-06-22 04:52:00,163 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 04:52:00,163 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 04:52:00,164 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 04:52:00,164 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 04:52:00,164 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 04:52:00,164 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2020-06-22 04:52:00,166 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2020-06-22 04:52:00,166 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 04:52:00,176 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 04:52:00,176 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 04:52:00,177 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 04:52:00,177 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 04:52:00,177 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 04:52:00,178 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 04:52:00,178 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2020-06-22 04:52:00,178 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2020-06-22 04:52:00,179 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 04:52:00,180 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 04:52:00,180 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 04:52:00,181 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 04:52:00,181 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 04:52:00,181 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 04:52:00,181 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 04:52:00,181 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2020-06-22 04:52:00,182 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2020-06-22 04:52:00,182 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 04:52:00,183 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 04:52:00,183 INFO L497 LassoAnalysis]: Using template '2-phase'. [2020-06-22 04:52:00,184 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 04:52:00,184 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 04:52:00,185 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2020-06-22 04:52:00,185 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 04:52:00,185 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 04:52:00,185 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 04:52:00,185 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2020-06-22 04:52:00,187 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2020-06-22 04:52:00,187 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 04:52:00,213 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 04:52:00,214 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 04:52:00,215 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 04:52:00,215 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2020-06-22 04:52:00,215 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 04:52:00,215 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 04:52:00,216 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 04:52:00,216 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2020-06-22 04:52:00,217 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2020-06-22 04:52:00,217 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 04:52:00,220 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 04:52:00,220 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 04:52:00,221 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 04:52:00,222 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2020-06-22 04:52:00,222 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 04:52:00,222 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 04:52:00,222 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 04:52:00,222 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2020-06-22 04:52:00,223 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2020-06-22 04:52:00,223 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 04:52:00,224 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 04:52:00,224 INFO L497 LassoAnalysis]: Using template '3-phase'. [2020-06-22 04:52:00,225 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 04:52:00,225 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 04:52:00,225 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2020-06-22 04:52:00,226 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 04:52:00,226 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 04:52:00,226 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 04:52:00,226 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 04:52:00,249 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2020-06-22 04:52:00,249 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 04:52:00,284 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 04:52:00,285 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 04:52:00,285 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 04:52:00,286 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2020-06-22 04:52:00,286 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 04:52:00,286 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 04:52:00,286 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 04:52:00,286 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 04:52:00,288 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2020-06-22 04:52:00,288 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 04:52:00,290 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 04:52:00,290 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 04:52:00,291 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 04:52:00,291 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2020-06-22 04:52:00,291 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 04:52:00,291 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 04:52:00,291 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 04:52:00,292 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 04:52:00,293 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2020-06-22 04:52:00,293 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 04:52:00,295 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 04:52:00,295 INFO L497 LassoAnalysis]: Using template '4-phase'. [2020-06-22 04:52:00,296 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 04:52:00,296 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 04:52:00,297 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2020-06-22 04:52:00,297 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 04:52:00,297 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 04:52:00,297 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 04:52:00,297 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2020-06-22 04:52:00,300 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2020-06-22 04:52:00,301 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 04:52:00,345 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 04:52:00,346 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 04:52:00,347 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 04:52:00,347 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2020-06-22 04:52:00,347 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 04:52:00,347 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 04:52:00,347 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 04:52:00,347 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2020-06-22 04:52:00,349 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2020-06-22 04:52:00,349 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 04:52:00,351 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 04:52:00,351 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 04:52:00,352 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 04:52:00,352 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2020-06-22 04:52:00,352 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 04:52:00,352 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 04:52:00,353 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 04:52:00,353 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2020-06-22 04:52:00,354 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2020-06-22 04:52:00,355 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 04:52:00,356 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 04:52:00,356 INFO L497 LassoAnalysis]: Using template '2-lex'. [2020-06-22 04:52:00,356 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 04:52:00,357 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 04:52:00,357 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2020-06-22 04:52:00,357 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 04:52:00,357 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 04:52:00,357 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 04:52:00,357 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 04:52:00,358 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2020-06-22 04:52:00,359 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 04:52:00,368 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 04:52:00,368 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 04:52:00,369 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 04:52:00,369 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2020-06-22 04:52:00,369 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 04:52:00,369 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 04:52:00,369 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 04:52:00,370 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 04:52:00,370 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2020-06-22 04:52:00,370 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 04:52:00,373 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 04:52:00,373 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 04:52:00,374 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 04:52:00,374 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2020-06-22 04:52:00,374 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 04:52:00,374 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 04:52:00,374 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 04:52:00,375 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2020-06-22 04:52:00,375 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2020-06-22 04:52:00,375 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 04:52:00,378 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 04:52:00,378 INFO L497 LassoAnalysis]: Using template '3-lex'. [2020-06-22 04:52:00,378 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 04:52:00,379 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 04:52:00,379 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2020-06-22 04:52:00,379 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 04:52:00,379 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 04:52:00,380 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 04:52:00,380 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2020-06-22 04:52:00,381 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 04:52:00,382 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 04:52:00,402 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 04:52:00,403 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 04:52:00,403 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 04:52:00,404 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2020-06-22 04:52:00,404 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 04:52:00,404 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 04:52:00,404 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 04:52:00,404 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2020-06-22 04:52:00,405 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 04:52:00,405 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 04:52:00,409 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 04:52:00,410 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 04:52:00,410 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2020-06-22 04:52:00,410 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2020-06-22 04:52:00,410 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 04:52:00,411 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 04:52:00,411 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 04:52:00,411 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2020-06-22 04:52:00,412 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 04:52:00,412 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 04:52:00,416 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 04:52:00,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 04:52:00,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 04:52:00,417 INFO L87 Difference]: Start difference. First operand 33 states and 68 transitions. cyclomatic complexity: 41 Second operand 3 states. [2020-06-22 04:52:00,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 04:52:00,450 INFO L93 Difference]: Finished difference Result 34 states and 49 transitions. [2020-06-22 04:52:00,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 04:52:00,453 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 49 transitions. [2020-06-22 04:52:00,454 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2020-06-22 04:52:00,454 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 25 states and 38 transitions. [2020-06-22 04:52:00,455 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2020-06-22 04:52:00,455 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2020-06-22 04:52:00,455 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 38 transitions. [2020-06-22 04:52:00,455 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 04:52:00,455 INFO L706 BuchiCegarLoop]: Abstraction has 25 states and 38 transitions. [2020-06-22 04:52:00,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 38 transitions. [2020-06-22 04:52:00,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 12. [2020-06-22 04:52:00,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-06-22 04:52:00,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 20 transitions. [2020-06-22 04:52:00,457 INFO L729 BuchiCegarLoop]: Abstraction has 12 states and 20 transitions. [2020-06-22 04:52:00,457 INFO L609 BuchiCegarLoop]: Abstraction has 12 states and 20 transitions. [2020-06-22 04:52:00,457 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2020-06-22 04:52:00,457 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 20 transitions. [2020-06-22 04:52:00,458 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2020-06-22 04:52:00,458 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 04:52:00,458 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 04:52:00,458 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2020-06-22 04:52:00,458 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-06-22 04:52:00,459 INFO L794 eck$LassoCheckResult]: Stem: 333#ULTIMATE.startENTRY [31] ULTIMATE.startENTRY-->L23-1: Formula: (and (= v_ULTIMATE.start_main_~x~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|) (= v_ULTIMATE.start_main_~debug~0_1 0)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_#t~post1=|v_ULTIMATE.start_main_#t~post1_1|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_main_~debug~0=v_ULTIMATE.start_main_~debug~0_1} AuxVars[|v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~debug~0, ULTIMATE.start_main_#t~post1, ULTIMATE.start_main_~x~0] 334#L23-1 [37] L23-1-->L18: Formula: (< v_ULTIMATE.start_main_~x~0_6 255) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_6} OutVars{ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_6} AuxVars[] AssignedVars[] 340#L18 [61] L18-->L18-2: Formula: (and (= v_ULTIMATE.start_main_~x~0_9 (+ v_ULTIMATE.start_main_~x~0_10 2)) (= 0 (mod v_ULTIMATE.start_main_~x~0_10 2))) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_10} OutVars{ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_9} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0] 329#L18-2 [2020-06-22 04:52:00,459 INFO L796 eck$LassoCheckResult]: Loop: 329#L18-2 [65] L18-2-->L23-1: Formula: (and (> 0 v_ULTIMATE.start_main_~debug~0_4) (= v_ULTIMATE.start_main_~x~0_4 0)) InVars {ULTIMATE.start_main_~debug~0=v_ULTIMATE.start_main_~debug~0_4} OutVars{ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_4, ULTIMATE.start_main_~debug~0=v_ULTIMATE.start_main_~debug~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0] 330#L23-1 [37] L23-1-->L18: Formula: (< v_ULTIMATE.start_main_~x~0_6 255) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_6} OutVars{ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_6} AuxVars[] AssignedVars[] 335#L18 [61] L18-->L18-2: Formula: (and (= v_ULTIMATE.start_main_~x~0_9 (+ v_ULTIMATE.start_main_~x~0_10 2)) (= 0 (mod v_ULTIMATE.start_main_~x~0_10 2))) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_10} OutVars{ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_9} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0] 329#L18-2 [2020-06-22 04:52:00,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 04:52:00,459 INFO L82 PathProgramCache]: Analyzing trace with hash 60790, now seen corresponding path program 1 times [2020-06-22 04:52:00,459 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 04:52:00,460 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 04:52:00,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:52:00,461 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 04:52:00,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:52:00,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:52:00,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:52:00,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 04:52:00,466 INFO L82 PathProgramCache]: Analyzing trace with hash 93464, now seen corresponding path program 1 times [2020-06-22 04:52:00,466 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 04:52:00,466 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 04:52:00,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:52:00,467 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 04:52:00,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:52:00,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:52:00,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:52:00,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 04:52:00,471 INFO L82 PathProgramCache]: Analyzing trace with hash 1811058563, now seen corresponding path program 1 times [2020-06-22 04:52:00,471 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 04:52:00,471 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 04:52:00,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:52:00,472 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 04:52:00,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:52:00,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:52:00,483 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 04:52:00,484 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 04:52:00,484 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 04:52:00,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 04:52:00,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 04:52:00,513 INFO L87 Difference]: Start difference. First operand 12 states and 20 transitions. cyclomatic complexity: 9 Second operand 3 states. [2020-06-22 04:52:00,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 04:52:00,550 INFO L93 Difference]: Finished difference Result 12 states and 17 transitions. [2020-06-22 04:52:00,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 04:52:00,552 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 17 transitions. [2020-06-22 04:52:00,553 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-06-22 04:52:00,553 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 0 states and 0 transitions. [2020-06-22 04:52:00,553 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-06-22 04:52:00,553 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-06-22 04:52:00,553 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-06-22 04:52:00,553 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 04:52:00,553 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 04:52:00,554 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 04:52:00,554 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 04:52:00,554 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2020-06-22 04:52:00,554 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-06-22 04:52:00,554 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-06-22 04:52:00,554 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-06-22 04:52:00,560 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 04:52:00 BasicIcfg [2020-06-22 04:52:00,561 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-06-22 04:52:00,561 INFO L168 Benchmark]: Toolchain (without parser) took 6451.32 ms. Allocated memory was 649.6 MB in the beginning and 749.7 MB in the end (delta: 100.1 MB). Free memory was 558.1 MB in the beginning and 647.5 MB in the end (delta: -89.3 MB). Peak memory consumption was 10.8 MB. Max. memory is 50.3 GB. [2020-06-22 04:52:00,563 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 649.6 MB. Free memory is still 580.3 MB. There was no memory consumed. Max. memory is 50.3 GB. [2020-06-22 04:52:00,563 INFO L168 Benchmark]: CACSL2BoogieTranslator took 296.60 ms. Allocated memory was 649.6 MB in the beginning and 679.5 MB in the end (delta: 29.9 MB). Free memory was 558.1 MB in the beginning and 645.4 MB in the end (delta: -87.3 MB). Peak memory consumption was 28.8 MB. Max. memory is 50.3 GB. [2020-06-22 04:52:00,565 INFO L168 Benchmark]: Boogie Procedure Inliner took 34.18 ms. Allocated memory is still 679.5 MB. Free memory was 645.4 MB in the beginning and 644.3 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 50.3 GB. [2020-06-22 04:52:00,566 INFO L168 Benchmark]: Boogie Preprocessor took 19.21 ms. Allocated memory is still 679.5 MB. Free memory was 644.3 MB in the beginning and 641.5 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 50.3 GB. [2020-06-22 04:52:00,567 INFO L168 Benchmark]: RCFGBuilder took 201.61 ms. Allocated memory is still 679.5 MB. Free memory was 641.5 MB in the beginning and 627.7 MB in the end (delta: 13.8 MB). Peak memory consumption was 13.8 MB. Max. memory is 50.3 GB. [2020-06-22 04:52:00,567 INFO L168 Benchmark]: BlockEncodingV2 took 88.91 ms. Allocated memory is still 679.5 MB. Free memory was 627.7 MB in the beginning and 622.3 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 50.3 GB. [2020-06-22 04:52:00,568 INFO L168 Benchmark]: TraceAbstraction took 153.04 ms. Allocated memory is still 679.5 MB. Free memory was 621.2 MB in the beginning and 612.5 MB in the end (delta: 8.7 MB). Peak memory consumption was 8.7 MB. Max. memory is 50.3 GB. [2020-06-22 04:52:00,568 INFO L168 Benchmark]: BuchiAutomizer took 5652.68 ms. Allocated memory was 679.5 MB in the beginning and 749.7 MB in the end (delta: 70.3 MB). Free memory was 612.5 MB in the beginning and 647.5 MB in the end (delta: -35.0 MB). Peak memory consumption was 35.3 MB. Max. memory is 50.3 GB. [2020-06-22 04:52:00,573 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 4 locations, 24 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 649.6 MB. Free memory is still 580.3 MB. There was no memory consumed. Max. memory is 50.3 GB. * CACSL2BoogieTranslator took 296.60 ms. Allocated memory was 649.6 MB in the beginning and 679.5 MB in the end (delta: 29.9 MB). Free memory was 558.1 MB in the beginning and 645.4 MB in the end (delta: -87.3 MB). Peak memory consumption was 28.8 MB. Max. memory is 50.3 GB. * Boogie Procedure Inliner took 34.18 ms. Allocated memory is still 679.5 MB. Free memory was 645.4 MB in the beginning and 644.3 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 50.3 GB. * Boogie Preprocessor took 19.21 ms. Allocated memory is still 679.5 MB. Free memory was 644.3 MB in the beginning and 641.5 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 50.3 GB. * RCFGBuilder took 201.61 ms. Allocated memory is still 679.5 MB. Free memory was 641.5 MB in the beginning and 627.7 MB in the end (delta: 13.8 MB). Peak memory consumption was 13.8 MB. Max. memory is 50.3 GB. * BlockEncodingV2 took 88.91 ms. Allocated memory is still 679.5 MB. Free memory was 627.7 MB in the beginning and 622.3 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 50.3 GB. * TraceAbstraction took 153.04 ms. Allocated memory is still 679.5 MB. Free memory was 621.2 MB in the beginning and 612.5 MB in the end (delta: 8.7 MB). Peak memory consumption was 8.7 MB. Max. memory is 50.3 GB. * BuchiAutomizer took 5652.68 ms. Allocated memory was 679.5 MB in the beginning and 749.7 MB in the end (delta: 70.3 MB). Free memory was 612.5 MB in the beginning and 647.5 MB in the end (delta: -35.0 MB). Peak memory consumption was 35.3 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: 17]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 4 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=4occurred 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 6 terminating modules (4 trivial, 0 deterministic, 2 nondeterministic). One nondeterministic module has affine ranking function -1 * x and consists of 8 locations. One nondeterministic module has affine ranking function -1 * x + 253 and consists of 3 locations. 4 modules have a trivial ranking function, the largest among these consists of 3 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 5.6s and 6 iterations. TraceHistogramMax:1. Analysis of lassos took 4.9s. Construction of modules took 0.2s. Büchi inclusion checks took 0.3s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 4. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 26 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 33 states and ocurred in iteration 3. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 22 SDtfs, 37 SDslu, 18 SDs, 0 SdLazy, 136 SolverSat, 42 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT1 conc2 concLT1 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital17 mio100 ax100 hnf100 lsp82 ukn100 mio100 lsp100 div373 bol100 ite100 ukn100 eq142 hnf48 smp91 dnf100 smp100 tf105 neg100 sie109 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 3 Time: 23ms VariablesStem: 0 VariablesLoop: 4 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 3 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 3.6s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! !SESSION 2020-06-22 04:51:50.865 ----------------------------------------------- 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 04:52:00.811 !MESSAGE The workspace will exit with unsaved changes in this session. Received shutdown request... Ultimate: GTK+ Version Check