YES Ultimate: Cannot open display: This is Ultimate 0.1.24-8dc7c08-m [2020-06-22 07:02:53,306 INFO L170 SettingsManager]: Resetting all preferences to default values... [2020-06-22 07:02:53,308 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2020-06-22 07:02:53,319 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-06-22 07:02:53,320 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-06-22 07:02:53,321 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-06-22 07:02:53,322 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-06-22 07:02:53,323 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2020-06-22 07:02:53,325 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-06-22 07:02:53,326 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-06-22 07:02:53,327 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-06-22 07:02:53,327 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-06-22 07:02:53,328 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-06-22 07:02:53,329 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-06-22 07:02:53,330 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-06-22 07:02:53,330 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-06-22 07:02:53,331 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-06-22 07:02:53,333 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-06-22 07:02:53,335 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2020-06-22 07:02:53,337 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-06-22 07:02:53,338 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-06-22 07:02:53,339 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-06-22 07:02:53,341 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-06-22 07:02:53,341 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-06-22 07:02:53,342 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-06-22 07:02:53,342 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-06-22 07:02:53,343 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-06-22 07:02:53,344 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-06-22 07:02:53,344 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-06-22 07:02:53,345 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-06-22 07:02:53,345 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-06-22 07:02:53,346 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2020-06-22 07:02:53,347 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-06-22 07:02:53,347 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2020-06-22 07:02:53,348 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-06-22 07:02:53,348 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-06-22 07:02:53,348 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2020-06-22 07:02:53,349 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2020-06-22 07:02:53,350 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2020-06-22 07:02:53,350 INFO L98 SettingsManager]: Beginning loading settings from /export/starexec/sandbox/solver/bin/./../termcomp2017.epf [2020-06-22 07:02:53,364 INFO L110 SettingsManager]: Loading preferences was successful [2020-06-22 07:02:53,365 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2020-06-22 07:02:53,366 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-06-22 07:02:53,366 INFO L133 SettingsManager]: * Rewrite not-equals=true [2020-06-22 07:02:53,366 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2020-06-22 07:02:53,366 INFO L133 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE [2020-06-22 07:02:53,367 INFO L133 SettingsManager]: * Use SBE=true [2020-06-22 07:02:53,367 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-06-22 07:02:53,367 INFO L133 SettingsManager]: * Use old map elimination=false [2020-06-22 07:02:53,367 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2020-06-22 07:02:53,367 INFO L133 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION [2020-06-22 07:02:53,367 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2020-06-22 07:02:53,368 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-06-22 07:02:53,368 INFO L133 SettingsManager]: * Construct termination proof for TermComp=true [2020-06-22 07:02:53,368 INFO L133 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 07:02:53,369 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-06-22 07:02:53,369 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-06-22 07:02:53,370 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2020-06-22 07:02:53,370 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2020-06-22 07:02:53,370 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-06-22 07:02:53,370 INFO L133 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE [2020-06-22 07:02:53,370 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-06-22 07:02:53,370 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-06-22 07:02:53,371 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-06-22 07:02:53,371 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-06-22 07:02:53,371 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-06-22 07:02:53,371 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-06-22 07:02:53,371 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2020-06-22 07:02:53,371 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-06-22 07:02:53,399 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-06-22 07:02:53,413 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-06-22 07:02:53,416 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-06-22 07:02:53,418 INFO L271 PluginConnector]: Initializing CDTParser... [2020-06-22 07:02:53,418 INFO L276 PluginConnector]: CDTParser initialized [2020-06-22 07:02:53,419 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox/benchmark/theBenchmark.c [2020-06-22 07:02:53,482 INFO L221 CDTParser]: Created temporary CDT project at /export/starexec/sandbox/tmp/cbb0929510aa4640a1921fccc45acece/FLAG82d36f0cf [2020-06-22 07:02:53,816 INFO L307 CDTParser]: Found 1 translation units. [2020-06-22 07:02:53,817 INFO L161 CDTParser]: Scanning /export/starexec/sandbox/benchmark/theBenchmark.c [2020-06-22 07:02:53,824 INFO L355 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox/tmp/cbb0929510aa4640a1921fccc45acece/FLAG82d36f0cf [2020-06-22 07:02:54,260 INFO L363 CDTParser]: Successfully deleted /export/starexec/sandbox/tmp/cbb0929510aa4640a1921fccc45acece [2020-06-22 07:02:54,271 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-06-22 07:02:54,273 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. [2020-06-22 07:02:54,274 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-06-22 07:02:54,274 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-06-22 07:02:54,277 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2020-06-22 07:02:54,278 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.06 07:02:54" (1/1) ... [2020-06-22 07:02:54,281 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f70b045 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 07:02:54, skipping insertion in model container [2020-06-22 07:02:54,282 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.06 07:02:54" (1/1) ... [2020-06-22 07:02:54,289 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-06-22 07:02:54,306 INFO L176 MainTranslator]: Built tables and reachable declarations [2020-06-22 07:02:54,462 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-06-22 07:02:54,466 INFO L191 MainTranslator]: Completed pre-run [2020-06-22 07:02:54,551 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-06-22 07:02:54,568 INFO L195 MainTranslator]: Completed translation [2020-06-22 07:02:54,568 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 07:02:54 WrapperNode [2020-06-22 07:02:54,568 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-06-22 07:02:54,569 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-06-22 07:02:54,569 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-06-22 07:02:54,569 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2020-06-22 07:02:54,580 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 07:02:54" (1/1) ... [2020-06-22 07:02:54,585 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 07:02:54" (1/1) ... [2020-06-22 07:02:54,605 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-06-22 07:02:54,606 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-06-22 07:02:54,606 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-06-22 07:02:54,606 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2020-06-22 07:02:54,616 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 07:02:54" (1/1) ... [2020-06-22 07:02:54,616 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 07:02:54" (1/1) ... [2020-06-22 07:02:54,617 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 07:02:54" (1/1) ... [2020-06-22 07:02:54,617 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 07:02:54" (1/1) ... [2020-06-22 07:02:54,619 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 07:02:54" (1/1) ... [2020-06-22 07:02:54,622 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 07:02:54" (1/1) ... [2020-06-22 07:02:54,622 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 07:02:54" (1/1) ... [2020-06-22 07:02:54,624 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-06-22 07:02:54,624 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-06-22 07:02:54,624 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-06-22 07:02:54,624 INFO L276 PluginConnector]: RCFGBuilder initialized [2020-06-22 07:02:54,625 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 07:02: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 07:02:54,696 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-06-22 07:02:54,696 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-06-22 07:02:54,696 INFO L130 BoogieDeclarations]: Found specification of procedure addition [2020-06-22 07:02:54,696 INFO L138 BoogieDeclarations]: Found implementation of procedure addition [2020-06-22 07:02:54,851 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-06-22 07:02:54,852 INFO L286 CfgBuilder]: Removed 4 assue(true) statements. [2020-06-22 07:02:54,853 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 07:02:54 BoogieIcfgContainer [2020-06-22 07:02:54,853 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-06-22 07:02:54,854 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- [2020-06-22 07:02:54,854 INFO L271 PluginConnector]: Initializing BlockEncodingV2... [2020-06-22 07:02:54,856 INFO L276 PluginConnector]: BlockEncodingV2 initialized [2020-06-22 07:02:54,857 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 07:02:54" (1/1) ... [2020-06-22 07:02:54,876 INFO L313 BlockEncoder]: Initial Icfg 18 locations, 24 edges [2020-06-22 07:02:54,878 INFO L258 BlockEncoder]: Using Remove infeasible edges [2020-06-22 07:02:54,879 INFO L263 BlockEncoder]: Using Maximize final states [2020-06-22 07:02:54,879 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false [2020-06-22 07:02:54,880 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE [2020-06-22 07:02:54,881 INFO L296 BlockEncoder]: Using Remove sink states [2020-06-22 07:02:54,882 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true [2020-06-22 07:02:54,882 INFO L179 BlockEncoder]: Using Rewrite not-equals [2020-06-22 07:02:54,899 INFO L185 BlockEncoder]: Using Use SBE [2020-06-22 07:02:54,914 INFO L200 BlockEncoder]: SBE split 1 edges [2020-06-22 07:02:54,919 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-06-22 07:02:54,921 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-06-22 07:02:54,928 INFO L100 BaseMinimizeStates]: Removed 2 edges and 1 locations by large block encoding [2020-06-22 07:02:54,931 INFO L70 RemoveSinkStates]: Removed 5 edges and 3 locations by removing sink states [2020-06-22 07:02:54,932 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-06-22 07:02:54,933 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-06-22 07:02:54,939 INFO L100 BaseMinimizeStates]: Removed 4 edges and 2 locations by large block encoding [2020-06-22 07:02:54,940 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states [2020-06-22 07:02:54,940 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-06-22 07:02:54,941 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-06-22 07:02:54,941 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding [2020-06-22 07:02:54,941 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states [2020-06-22 07:02:54,942 INFO L313 BlockEncoder]: Encoded RCFG 12 locations, 17 edges [2020-06-22 07:02:54,942 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 07:02:54 BasicIcfg [2020-06-22 07:02:54,942 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- [2020-06-22 07:02:54,943 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-06-22 07:02:54,943 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-06-22 07:02:54,947 INFO L276 PluginConnector]: TraceAbstraction initialized [2020-06-22 07:02:54,948 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.06 07:02:54" (1/4) ... [2020-06-22 07:02:54,949 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79e45e1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 07:02:54, skipping insertion in model container [2020-06-22 07:02:54,949 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 07:02:54" (2/4) ... [2020-06-22 07:02:54,949 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79e45e1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 07:02:54, skipping insertion in model container [2020-06-22 07:02:54,949 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 07:02:54" (3/4) ... [2020-06-22 07:02:54,950 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79e45e1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 07:02:54, skipping insertion in model container [2020-06-22 07:02:54,950 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 07:02:54" (4/4) ... [2020-06-22 07:02:54,952 INFO L112 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-06-22 07:02:54,962 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2020-06-22 07:02:54,970 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 0 error locations. [2020-06-22 07:02:54,990 INFO L257 AbstractCegarLoop]: Starting to check reachability of 0 error locations. [2020-06-22 07:02:55,020 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2020-06-22 07:02:55,021 INFO L382 AbstractCegarLoop]: Interprodecural is true [2020-06-22 07:02:55,021 INFO L383 AbstractCegarLoop]: Hoare is true [2020-06-22 07:02:55,021 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2020-06-22 07:02:55,021 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-06-22 07:02:55,022 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-06-22 07:02:55,022 INFO L387 AbstractCegarLoop]: Difference is false [2020-06-22 07:02:55,022 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-06-22 07:02:55,022 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-06-22 07:02:55,040 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states. [2020-06-22 07:02:55,046 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-06-22 07:02:55,052 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 12 states. [2020-06-22 07:02:55,110 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-06-22 07:02:55,111 INFO L451 ceAbstractionStarter]: At program point L35(line 35) the Hoare annotation is: true [2020-06-22 07:02:55,111 INFO L448 ceAbstractionStarter]: For program point L17(lines 17 19) no Hoare annotation was computed. [2020-06-22 07:02:55,111 INFO L448 ceAbstractionStarter]: For program point L18-1(line 18) no Hoare annotation was computed. [2020-06-22 07:02:55,111 INFO L451 ceAbstractionStarter]: At program point additionENTRY(lines 13 23) the Hoare annotation is: true [2020-06-22 07:02:55,111 INFO L448 ceAbstractionStarter]: For program point L14(lines 14 16) no Hoare annotation was computed. [2020-06-22 07:02:55,111 INFO L448 ceAbstractionStarter]: For program point additionEXIT(lines 13 23) no Hoare annotation was computed. [2020-06-22 07:02:55,112 INFO L448 ceAbstractionStarter]: For program point additionFINAL(lines 13 23) no Hoare annotation was computed. [2020-06-22 07:02:55,112 INFO L451 ceAbstractionStarter]: At program point L21(line 21) the Hoare annotation is: true [2020-06-22 07:02:55,112 INFO L448 ceAbstractionStarter]: For program point L20(lines 20 22) no Hoare annotation was computed. [2020-06-22 07:02:55,112 INFO L448 ceAbstractionStarter]: For program point L21-1(line 21) no Hoare annotation was computed. [2020-06-22 07:02:55,112 INFO L451 ceAbstractionStarter]: At program point L18(line 18) the Hoare annotation is: true [2020-06-22 07:02:55,116 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 07:02:55 BasicIcfg [2020-06-22 07:02:55,116 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-06-22 07:02:55,117 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-06-22 07:02:55,117 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-06-22 07:02:55,120 INFO L276 PluginConnector]: BuchiAutomizer initialized [2020-06-22 07:02:55,121 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 07:02:55,121 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.06 07:02:54" (1/5) ... [2020-06-22 07:02:55,122 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4e6760a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.06 07:02:55, skipping insertion in model container [2020-06-22 07:02:55,122 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 07:02:55,122 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 07:02:54" (2/5) ... [2020-06-22 07:02:55,123 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4e6760a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.06 07:02:55, skipping insertion in model container [2020-06-22 07:02:55,123 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 07:02:55,123 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 07:02:54" (3/5) ... [2020-06-22 07:02:55,123 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4e6760a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 07:02:55, skipping insertion in model container [2020-06-22 07:02:55,123 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 07:02:55,124 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 07:02:54" (4/5) ... [2020-06-22 07:02:55,124 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4e6760a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 07:02:55, skipping insertion in model container [2020-06-22 07:02:55,124 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 07:02:55,124 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 07:02:55" (5/5) ... [2020-06-22 07:02:55,126 INFO L375 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-06-22 07:02:55,154 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2020-06-22 07:02:55,154 INFO L374 BuchiCegarLoop]: Interprodecural is true [2020-06-22 07:02:55,154 INFO L375 BuchiCegarLoop]: Hoare is true [2020-06-22 07:02:55,155 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-06-22 07:02:55,155 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-06-22 07:02:55,155 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-06-22 07:02:55,155 INFO L379 BuchiCegarLoop]: Difference is false [2020-06-22 07:02:55,155 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-06-22 07:02:55,155 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-06-22 07:02:55,159 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states. [2020-06-22 07:02:55,181 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2020-06-22 07:02:55,182 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 07:02:55,182 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 07:02:55,189 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-06-22 07:02:55,189 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-06-22 07:02:55,190 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2020-06-22 07:02:55,190 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states. [2020-06-22 07:02:55,191 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2020-06-22 07:02:55,191 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 07:02:55,192 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 07:02:55,192 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-06-22 07:02:55,192 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-06-22 07:02:55,197 INFO L794 eck$LassoCheckResult]: Stem: 7#ULTIMATE.startENTRYtrue [74] ULTIMATE.startENTRY-->L35: Formula: (and (< 0 v_ULTIMATE.start_main_~n~0_9) (< 0 v_ULTIMATE.start_main_~m~0_9)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_8|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_7|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_6|, ULTIMATE.start_main_~m~0=v_ULTIMATE.start_main_~m~0_9, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_9, ULTIMATE.start_main_#t~ret4=|v_ULTIMATE.start_main_#t~ret4_7|, ULTIMATE.start_main_~result~0=v_ULTIMATE.start_main_~result~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~m~0, ULTIMATE.start_main_~n~0, ULTIMATE.start_main_#t~ret4, ULTIMATE.start_main_~result~0] 11#L35true [60] L35-->additionENTRY: Formula: (and (= |v_addition_#in~mInParam_1| v_ULTIMATE.start_main_~m~0_7) (= |v_addition_#in~nInParam_1| v_ULTIMATE.start_main_~n~0_6)) InVars {ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_6, ULTIMATE.start_main_~m~0=v_ULTIMATE.start_main_~m~0_7} OutVars{addition_#in~m=|v_addition_#in~mInParam_1|, addition_#in~n=|v_addition_#in~nInParam_1|} AuxVars[] AssignedVars[addition_#in~m, addition_#in~n]< 3#additionENTRYtrue [2020-06-22 07:02:55,198 INFO L796 eck$LassoCheckResult]: Loop: 3#additionENTRYtrue [52] additionENTRY-->L14: Formula: (and (= v_addition_~m_1 |v_addition_#in~m_1|) (= v_addition_~n_1 |v_addition_#in~n_1|)) InVars {addition_#in~m=|v_addition_#in~m_1|, addition_#in~n=|v_addition_#in~n_1|} OutVars{addition_~n=v_addition_~n_1, addition_#in~m=|v_addition_#in~m_1|, addition_#in~n=|v_addition_#in~n_1|, addition_~m=v_addition_~m_1} AuxVars[] AssignedVars[addition_~n, addition_~m] 8#L14true [70] L14-->L17: Formula: (> 0 v_addition_~n_4) InVars {addition_~n=v_addition_~n_4} OutVars{addition_~n=v_addition_~n_4} AuxVars[] AssignedVars[] 13#L17true [49] L17-->L18: Formula: (< 0 v_addition_~n_5) InVars {addition_~n=v_addition_~n_5} OutVars{addition_~n=v_addition_~n_5} AuxVars[] AssignedVars[] 10#L18true [48] L18-->additionENTRY: Formula: (and (= |v_addition_#in~mInParam_2| (+ v_addition_~m_5 1)) (= |v_addition_#in~nInParam_2| (+ v_addition_~n_10 (- 1)))) InVars {addition_~n=v_addition_~n_10, addition_~m=v_addition_~m_5} OutVars{addition_#in~m=|v_addition_#in~mInParam_2|, addition_#in~n=|v_addition_#in~nInParam_2|} AuxVars[] AssignedVars[addition_#in~m, addition_#in~n]< 3#additionENTRYtrue [2020-06-22 07:02:55,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 07:02:55,204 INFO L82 PathProgramCache]: Analyzing trace with hash 3315, now seen corresponding path program 1 times [2020-06-22 07:02:55,206 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 07:02:55,206 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 07:02:55,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 07:02:55,226 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 07:02:55,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 07:02:55,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 07:02:55,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 07:02:55,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 07:02:55,278 INFO L82 PathProgramCache]: Analyzing trace with hash 2541490, now seen corresponding path program 1 times [2020-06-22 07:02:55,278 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 07:02:55,278 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 07:02:55,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 07:02:55,279 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 07:02:55,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 07:02:55,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 07:02:55,325 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 07:02:55,328 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 07:02:55,328 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-06-22 07:02:55,331 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-06-22 07:02:55,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 07:02:55,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 07:02:55,348 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 3 states. [2020-06-22 07:02:55,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 07:02:55,389 INFO L93 Difference]: Finished difference Result 16 states and 22 transitions. [2020-06-22 07:02:55,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 07:02:55,393 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 22 transitions. [2020-06-22 07:02:55,396 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2020-06-22 07:02:55,400 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 10 states and 12 transitions. [2020-06-22 07:02:55,402 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2020-06-22 07:02:55,402 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2020-06-22 07:02:55,402 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 12 transitions. [2020-06-22 07:02:55,403 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 07:02:55,403 INFO L706 BuchiCegarLoop]: Abstraction has 10 states and 12 transitions. [2020-06-22 07:02:55,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 12 transitions. [2020-06-22 07:02:55,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2020-06-22 07:02:55,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-06-22 07:02:55,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 11 transitions. [2020-06-22 07:02:55,433 INFO L729 BuchiCegarLoop]: Abstraction has 9 states and 11 transitions. [2020-06-22 07:02:55,433 INFO L609 BuchiCegarLoop]: Abstraction has 9 states and 11 transitions. [2020-06-22 07:02:55,433 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2020-06-22 07:02:55,433 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 11 transitions. [2020-06-22 07:02:55,434 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2020-06-22 07:02:55,434 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 07:02:55,434 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 07:02:55,435 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-06-22 07:02:55,435 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-06-22 07:02:55,435 INFO L794 eck$LassoCheckResult]: Stem: 43#ULTIMATE.startENTRY [74] ULTIMATE.startENTRY-->L35: Formula: (and (< 0 v_ULTIMATE.start_main_~n~0_9) (< 0 v_ULTIMATE.start_main_~m~0_9)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_8|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_7|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_6|, ULTIMATE.start_main_~m~0=v_ULTIMATE.start_main_~m~0_9, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_9, ULTIMATE.start_main_#t~ret4=|v_ULTIMATE.start_main_#t~ret4_7|, ULTIMATE.start_main_~result~0=v_ULTIMATE.start_main_~result~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~m~0, ULTIMATE.start_main_~n~0, ULTIMATE.start_main_#t~ret4, ULTIMATE.start_main_~result~0] 39#L35 [60] L35-->additionENTRY: Formula: (and (= |v_addition_#in~mInParam_1| v_ULTIMATE.start_main_~m~0_7) (= |v_addition_#in~nInParam_1| v_ULTIMATE.start_main_~n~0_6)) InVars {ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_6, ULTIMATE.start_main_~m~0=v_ULTIMATE.start_main_~m~0_7} OutVars{addition_#in~m=|v_addition_#in~mInParam_1|, addition_#in~n=|v_addition_#in~nInParam_1|} AuxVars[] AssignedVars[addition_#in~m, addition_#in~n]< 37#additionENTRY [2020-06-22 07:02:55,436 INFO L796 eck$LassoCheckResult]: Loop: 37#additionENTRY [52] additionENTRY-->L14: Formula: (and (= v_addition_~m_1 |v_addition_#in~m_1|) (= v_addition_~n_1 |v_addition_#in~n_1|)) InVars {addition_#in~m=|v_addition_#in~m_1|, addition_#in~n=|v_addition_#in~n_1|} OutVars{addition_~n=v_addition_~n_1, addition_#in~m=|v_addition_#in~m_1|, addition_#in~n=|v_addition_#in~n_1|, addition_~m=v_addition_~m_1} AuxVars[] AssignedVars[addition_~n, addition_~m] 41#L14 [71] L14-->L17: Formula: (< 0 v_addition_~n_4) InVars {addition_~n=v_addition_~n_4} OutVars{addition_~n=v_addition_~n_4} AuxVars[] AssignedVars[] 45#L17 [49] L17-->L18: Formula: (< 0 v_addition_~n_5) InVars {addition_~n=v_addition_~n_5} OutVars{addition_~n=v_addition_~n_5} AuxVars[] AssignedVars[] 40#L18 [48] L18-->additionENTRY: Formula: (and (= |v_addition_#in~mInParam_2| (+ v_addition_~m_5 1)) (= |v_addition_#in~nInParam_2| (+ v_addition_~n_10 (- 1)))) InVars {addition_~n=v_addition_~n_10, addition_~m=v_addition_~m_5} OutVars{addition_#in~m=|v_addition_#in~mInParam_2|, addition_#in~n=|v_addition_#in~nInParam_2|} AuxVars[] AssignedVars[addition_#in~m, addition_#in~n]< 37#additionENTRY [2020-06-22 07:02:55,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 07:02:55,436 INFO L82 PathProgramCache]: Analyzing trace with hash 3315, now seen corresponding path program 2 times [2020-06-22 07:02:55,436 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 07:02:55,436 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 07:02:55,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 07:02:55,438 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 07:02:55,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 07:02:55,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 07:02:55,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 07:02:55,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 07:02:55,445 INFO L82 PathProgramCache]: Analyzing trace with hash 2542451, now seen corresponding path program 1 times [2020-06-22 07:02:55,445 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 07:02:55,445 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 07:02:55,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 07:02:55,446 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 07:02:55,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 07:02:55,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 07:02:55,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 07:02:55,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 07:02:55,454 INFO L82 PathProgramCache]: Analyzing trace with hash -1231876251, now seen corresponding path program 1 times [2020-06-22 07:02:55,454 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 07:02:55,454 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 07:02:55,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 07:02:55,455 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 07:02:55,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 07:02:55,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 07:02:55,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 07:02:55,544 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 07:02:55,546 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 07:02:55,546 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 07:02:55,546 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 07:02:55,546 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2020-06-22 07:02:55,546 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 07:02:55,546 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 07:02:55,546 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 07:02:55,547 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration2_Loop [2020-06-22 07:02:55,547 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 07:02:55,547 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 07:02:55,565 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 07:02:55,572 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 07:02:55,574 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 07:02:55,577 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 07:02:55,581 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 07:02:55,584 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 07:02:55,590 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 07:02:55,650 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 07:02:55,651 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 07:02:55,665 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 07:02:55,665 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 07:02:55,676 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 07:02:55,676 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {addition_~m=0} Honda state: {addition_~m=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 07:02:55,707 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 07:02:55,707 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 07:02:55,711 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 07:02:55,711 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {addition_#t~ret1=0} Honda state: {addition_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 07:02:55,740 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 07:02:55,740 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 07:02:55,744 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 07:02:55,744 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {addition_#t~ret0=0} Honda state: {addition_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 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 07:02:55,773 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 07:02:55,773 INFO L163 nArgumentSynthesizer]: Using integer mode. 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 07:02:55,805 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-06-22 07:02:55,806 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 07:02:55,822 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 07:02:55,823 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {addition_#in~m=0} Honda state: {addition_#in~m=0} Generalized eigenvectors: [{addition_#in~m=5}, {addition_#in~m=4}, {addition_#in~m=-8}] Lambdas: [1, 3, 1] Nus: [0, 1] 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 07:02:55,854 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 07:02:55,854 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 07:02:55,858 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 07:02:55,858 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {addition_#res=0} Honda state: {addition_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 07:02:55,887 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 07:02:55,887 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 9 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 9 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 07:02:55,920 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-06-22 07:02:55,920 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 07:02:55,950 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-06-22 07:02:55,952 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 07:02:55,952 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 07:02:55,952 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 07:02:55,952 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 07:02:55,952 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 07:02:55,953 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 07:02:55,953 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 07:02:55,953 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 07:02:55,953 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration2_Loop [2020-06-22 07:02:55,953 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 07:02:55,953 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 07:02:55,955 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 07:02:55,957 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 07:02:55,959 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 07:02:55,963 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 07:02:55,966 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 07:02:55,968 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 07:02:55,970 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 07:02:56,030 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 07:02:56,036 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 07:02:56,037 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 07:02:56,039 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 07:02:56,039 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 07:02:56,039 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 07:02:56,040 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 07:02:56,040 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 07:02:56,042 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 07:02:56,042 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 07:02:56,044 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 07:02:56,045 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 07:02:56,046 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 07:02:56,046 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 07:02:56,046 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 07:02:56,046 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 07:02:56,046 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 07:02:56,047 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 07:02:56,047 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 07:02:56,048 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 07:02:56,049 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 07:02:56,049 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 07:02:56,049 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 07:02:56,050 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 07:02:56,050 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 07:02:56,050 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 07:02:56,052 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 07:02:56,052 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 07:02:56,053 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 07:02:56,054 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 07:02:56,054 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 07:02:56,054 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 07:02:56,055 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 07:02:56,055 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 07:02:56,055 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 07:02:56,055 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 07:02:56,056 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 07:02:56,060 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 07:02:56,061 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 07:02:56,061 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 07:02:56,062 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 07:02:56,062 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 07:02:56,062 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 07:02:56,062 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 07:02:56,063 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 07:02:56,063 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 07:02:56,064 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 07:02:56,064 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 07:02:56,065 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 07:02:56,065 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 07:02:56,065 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 07:02:56,065 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 07:02:56,065 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 07:02:56,066 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 07:02:56,066 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 07:02:56,067 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 07:02:56,068 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 07:02:56,068 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 07:02:56,068 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 07:02:56,069 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 07:02:56,069 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 07:02:56,069 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 07:02:56,070 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 07:02:56,070 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 07:02:56,075 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 07:02:56,079 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-06-22 07:02:56,079 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2020-06-22 07:02:56,081 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 07:02:56,081 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-06-22 07:02:56,081 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 07:02:56,082 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(addition_#in~n) = 1*addition_#in~n Supporting invariants [] [2020-06-22 07:02:56,083 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-06-22 07:02:56,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 07:02:56,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 07:02:56,123 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 07:02:56,124 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 07:02:56,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 07:02:56,151 INFO L256 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 7 conjunts are in the unsatisfiable core [2020-06-22 07:02:56,152 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 07:02:56,185 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 07:02:56,198 INFO L98 LoopCannibalizer]: 3 predicates before loop cannibalization 3 predicates after loop cannibalization [2020-06-22 07:02:56,201 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 07:02:56,202 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 9 states and 11 transitions. cyclomatic complexity: 3 Second operand 4 states. [2020-06-22 07:02:56,310 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 9 states and 11 transitions. cyclomatic complexity: 3. Second operand 4 states. Result 46 states and 54 transitions. Complement of second has 15 states. [2020-06-22 07:02:56,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-06-22 07:02:56,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-06-22 07:02:56,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 27 transitions. [2020-06-22 07:02:56,315 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 27 transitions. Stem has 2 letters. Loop has 4 letters. [2020-06-22 07:02:56,317 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 07:02:56,317 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 27 transitions. Stem has 6 letters. Loop has 4 letters. [2020-06-22 07:02:56,318 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 07:02:56,318 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 27 transitions. Stem has 2 letters. Loop has 8 letters. [2020-06-22 07:02:56,318 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 07:02:56,325 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 54 transitions. [2020-06-22 07:02:56,328 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2020-06-22 07:02:56,329 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 25 states and 29 transitions. [2020-06-22 07:02:56,329 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2020-06-22 07:02:56,330 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2020-06-22 07:02:56,330 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 29 transitions. [2020-06-22 07:02:56,330 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 07:02:56,330 INFO L706 BuchiCegarLoop]: Abstraction has 25 states and 29 transitions. [2020-06-22 07:02:56,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 29 transitions. [2020-06-22 07:02:56,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 15. [2020-06-22 07:02:56,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-06-22 07:02:56,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 19 transitions. [2020-06-22 07:02:56,333 INFO L729 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2020-06-22 07:02:56,333 INFO L609 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2020-06-22 07:02:56,333 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2020-06-22 07:02:56,333 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 19 transitions. [2020-06-22 07:02:56,334 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2020-06-22 07:02:56,334 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 07:02:56,334 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 07:02:56,335 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-06-22 07:02:56,335 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2020-06-22 07:02:56,335 INFO L794 eck$LassoCheckResult]: Stem: 156#ULTIMATE.startENTRY [74] ULTIMATE.startENTRY-->L35: Formula: (and (< 0 v_ULTIMATE.start_main_~n~0_9) (< 0 v_ULTIMATE.start_main_~m~0_9)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_8|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_7|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_6|, ULTIMATE.start_main_~m~0=v_ULTIMATE.start_main_~m~0_9, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_9, ULTIMATE.start_main_#t~ret4=|v_ULTIMATE.start_main_#t~ret4_7|, ULTIMATE.start_main_~result~0=v_ULTIMATE.start_main_~result~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~m~0, ULTIMATE.start_main_~n~0, ULTIMATE.start_main_#t~ret4, ULTIMATE.start_main_~result~0] 147#L35 [60] L35-->additionENTRY: Formula: (and (= |v_addition_#in~mInParam_1| v_ULTIMATE.start_main_~m~0_7) (= |v_addition_#in~nInParam_1| v_ULTIMATE.start_main_~n~0_6)) InVars {ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_6, ULTIMATE.start_main_~m~0=v_ULTIMATE.start_main_~m~0_7} OutVars{addition_#in~m=|v_addition_#in~mInParam_1|, addition_#in~n=|v_addition_#in~nInParam_1|} AuxVars[] AssignedVars[addition_#in~m, addition_#in~n]< 151#additionENTRY [52] additionENTRY-->L14: Formula: (and (= v_addition_~m_1 |v_addition_#in~m_1|) (= v_addition_~n_1 |v_addition_#in~n_1|)) InVars {addition_#in~m=|v_addition_#in~m_1|, addition_#in~n=|v_addition_#in~n_1|} OutVars{addition_~n=v_addition_~n_1, addition_#in~m=|v_addition_#in~m_1|, addition_#in~n=|v_addition_#in~n_1|, addition_~m=v_addition_~m_1} AuxVars[] AssignedVars[addition_~n, addition_~m] 153#L14 [70] L14-->L17: Formula: (> 0 v_addition_~n_4) InVars {addition_~n=v_addition_~n_4} OutVars{addition_~n=v_addition_~n_4} AuxVars[] AssignedVars[] 157#L17 [2020-06-22 07:02:56,335 INFO L796 eck$LassoCheckResult]: Loop: 157#L17 [68] L17-->L20: Formula: (>= 0 v_addition_~n_7) InVars {addition_~n=v_addition_~n_7} OutVars{addition_~n=v_addition_~n_7} AuxVars[] AssignedVars[] 146#L20 [42] L20-->L21: Formula: (< v_addition_~n_8 0) InVars {addition_~n=v_addition_~n_8} OutVars{addition_~n=v_addition_~n_8} AuxVars[] AssignedVars[] 148#L21 [45] L21-->additionENTRY: Formula: (and (= |v_addition_#in~mInParam_3| (+ v_addition_~m_6 (- 1))) (= |v_addition_#in~nInParam_3| (+ v_addition_~n_11 1))) InVars {addition_~n=v_addition_~n_11, addition_~m=v_addition_~m_6} OutVars{addition_#in~m=|v_addition_#in~mInParam_3|, addition_#in~n=|v_addition_#in~nInParam_3|} AuxVars[] AssignedVars[addition_#in~m, addition_#in~n]< 155#additionENTRY [52] additionENTRY-->L14: Formula: (and (= v_addition_~m_1 |v_addition_#in~m_1|) (= v_addition_~n_1 |v_addition_#in~n_1|)) InVars {addition_#in~m=|v_addition_#in~m_1|, addition_#in~n=|v_addition_#in~n_1|} OutVars{addition_~n=v_addition_~n_1, addition_#in~m=|v_addition_#in~m_1|, addition_#in~n=|v_addition_#in~n_1|, addition_~m=v_addition_~m_1} AuxVars[] AssignedVars[addition_~n, addition_~m] 160#L14 [70] L14-->L17: Formula: (> 0 v_addition_~n_4) InVars {addition_~n=v_addition_~n_4} OutVars{addition_~n=v_addition_~n_4} AuxVars[] AssignedVars[] 157#L17 [2020-06-22 07:02:56,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 07:02:56,336 INFO L82 PathProgramCache]: Analyzing trace with hash 3187397, now seen corresponding path program 1 times [2020-06-22 07:02:56,336 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 07:02:56,336 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 07:02:56,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 07:02:56,338 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 07:02:56,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 07:02:56,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 07:02:56,388 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 07:02:56,388 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 07:02:56,388 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-06-22 07:02:56,389 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-06-22 07:02:56,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 07:02:56,389 INFO L82 PathProgramCache]: Analyzing trace with hash 92724728, now seen corresponding path program 1 times [2020-06-22 07:02:56,389 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 07:02:56,389 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 07:02:56,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 07:02:56,390 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 07:02:56,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 07:02:56,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 07:02:56,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 07:02:56,496 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 07:02:56,497 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 07:02:56,497 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 07:02:56,497 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 07:02:56,497 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2020-06-22 07:02:56,497 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 07:02:56,497 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 07:02:56,497 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 07:02:56,498 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration3_Loop [2020-06-22 07:02:56,498 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 07:02:56,498 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 07:02:56,500 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 07:02:56,503 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 07:02:56,510 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 07:02:56,513 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 07:02:56,515 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 07:02:56,582 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 07:02:56,582 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 07:02:56,591 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 07:02:56,591 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 07:02:56,595 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 07:02:56,595 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {addition_#t~ret1=0} Honda state: {addition_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 07:02:56,629 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 07:02:56,629 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 07:02:56,669 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-06-22 07:02:56,669 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 07:02:56,834 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 07:02:56,834 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {addition_#in~m=-8, addition_~m=-8} Honda state: {addition_#in~m=-8, addition_~m=-8} Generalized eigenvectors: [{addition_#in~m=7, addition_~m=-1}, {addition_#in~m=-8, addition_~m=0}, {addition_#in~m=0, addition_~m=0}] Lambdas: [1, 0, 15] Nus: [1, 0] No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 07:02:56,864 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 07:02:56,864 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 07:02:56,868 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 07:02:56,868 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {addition_#res=0} Honda state: {addition_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 07:02:56,896 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 07:02:56,896 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 07:02:56,900 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 07:02:56,900 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {addition_#t~ret0=0} Honda state: {addition_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 07:02:56,929 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 07:02:56,929 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 07:02:56,966 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-06-22 07:02:56,966 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 07:03:08,374 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-06-22 07:03:08,378 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 07:03:08,379 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 07:03:08,379 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 07:03:08,379 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 07:03:08,379 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 07:03:08,379 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 07:03:08,379 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 07:03:08,379 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 07:03:08,379 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration3_Loop [2020-06-22 07:03:08,379 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 07:03:08,380 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 07:03:08,381 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 07:03:08,384 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 07:03:08,386 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 07:03:08,392 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 07:03:08,396 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 07:03:08,465 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 07:03:08,466 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 07:03:08,467 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 07:03:08,467 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 07:03:08,468 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 07:03:08,468 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 07:03:08,468 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 07:03:08,468 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 07:03:08,469 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 07:03:08,469 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 07:03:08,470 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 07:03:08,470 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 07:03:08,471 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 07:03:08,471 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 07:03:08,471 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 07:03:08,471 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 07:03:08,471 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 07:03:08,472 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 07:03:08,472 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 07:03:08,473 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 07:03:08,473 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 07:03:08,474 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 07:03:08,474 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 07:03:08,474 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 07:03:08,474 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 07:03:08,474 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 07:03:08,475 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 07:03:08,475 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 07:03:08,480 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 07:03:08,481 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 07:03:08,481 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 07:03:08,481 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 07:03:08,482 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 07:03:08,482 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 07:03:08,482 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 07:03:08,482 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 07:03:08,482 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 07:03:08,483 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 07:03:08,484 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 07:03:08,484 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 07:03:08,484 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 07:03:08,485 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 07:03:08,485 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 07:03:08,485 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 07:03:08,485 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 07:03:08,486 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 07:03:08,493 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 07:03:08,497 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-06-22 07:03:08,497 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2020-06-22 07:03:08,497 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 07:03:08,498 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-06-22 07:03:08,498 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 07:03:08,498 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(addition_~n) = -1*addition_~n Supporting invariants [] [2020-06-22 07:03:08,498 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-06-22 07:03:08,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 07:03:08,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 07:03:08,528 INFO L256 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 07:03:08,528 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 07:03:08,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 07:03:08,549 INFO L256 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 7 conjunts are in the unsatisfiable core [2020-06-22 07:03:08,550 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 07:03:08,579 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 07:03:08,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 07:03:08,590 INFO L256 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 7 conjunts are in the unsatisfiable core [2020-06-22 07:03:08,590 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 07:03:08,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 07:03:08,630 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 07:03:08,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 07:03:08,642 INFO L256 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 7 conjunts are in the unsatisfiable core [2020-06-22 07:03:08,643 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 07:03:08,708 INFO L98 LoopCannibalizer]: 3 predicates before loop cannibalization 5 predicates after loop cannibalization [2020-06-22 07:03:08,708 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 5 loop predicates [2020-06-22 07:03:08,708 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 15 states and 19 transitions. cyclomatic complexity: 6 Second operand 5 states. [2020-06-22 07:03:08,774 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 15 states and 19 transitions. cyclomatic complexity: 6. Second operand 5 states. Result 80 states and 100 transitions. Complement of second has 43 states. [2020-06-22 07:03:08,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 3 non-accepting loop states 2 accepting loop states [2020-06-22 07:03:08,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-06-22 07:03:08,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 20 transitions. [2020-06-22 07:03:08,776 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 20 transitions. Stem has 4 letters. Loop has 5 letters. [2020-06-22 07:03:08,776 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 07:03:08,777 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 20 transitions. Stem has 9 letters. Loop has 5 letters. [2020-06-22 07:03:08,777 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 07:03:08,777 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 20 transitions. Stem has 4 letters. Loop has 10 letters. [2020-06-22 07:03:08,778 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 07:03:08,780 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 80 states and 100 transitions. [2020-06-22 07:03:08,784 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 29 [2020-06-22 07:03:08,786 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 80 states to 37 states and 45 transitions. [2020-06-22 07:03:08,786 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2020-06-22 07:03:08,786 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2020-06-22 07:03:08,786 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 45 transitions. [2020-06-22 07:03:08,786 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 07:03:08,786 INFO L706 BuchiCegarLoop]: Abstraction has 37 states and 45 transitions. [2020-06-22 07:03:08,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 45 transitions. [2020-06-22 07:03:08,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 21. [2020-06-22 07:03:08,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-06-22 07:03:08,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 27 transitions. [2020-06-22 07:03:08,789 INFO L729 BuchiCegarLoop]: Abstraction has 21 states and 27 transitions. [2020-06-22 07:03:08,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-06-22 07:03:08,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-06-22 07:03:08,790 INFO L87 Difference]: Start difference. First operand 21 states and 27 transitions. Second operand 5 states. [2020-06-22 07:03:08,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 07:03:08,819 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2020-06-22 07:03:08,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-06-22 07:03:08,821 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 27 transitions. [2020-06-22 07:03:08,822 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2020-06-22 07:03:08,823 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 22 states and 25 transitions. [2020-06-22 07:03:08,823 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2020-06-22 07:03:08,823 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2020-06-22 07:03:08,823 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 25 transitions. [2020-06-22 07:03:08,823 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 07:03:08,823 INFO L706 BuchiCegarLoop]: Abstraction has 22 states and 25 transitions. [2020-06-22 07:03:08,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 25 transitions. [2020-06-22 07:03:08,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 18. [2020-06-22 07:03:08,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-06-22 07:03:08,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions. [2020-06-22 07:03:08,825 INFO L729 BuchiCegarLoop]: Abstraction has 18 states and 21 transitions. [2020-06-22 07:03:08,826 INFO L609 BuchiCegarLoop]: Abstraction has 18 states and 21 transitions. [2020-06-22 07:03:08,826 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2020-06-22 07:03:08,826 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 21 transitions. [2020-06-22 07:03:08,826 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2020-06-22 07:03:08,826 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 07:03:08,827 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 07:03:08,827 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1] [2020-06-22 07:03:08,827 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 07:03:08,828 INFO L794 eck$LassoCheckResult]: Stem: 420#ULTIMATE.startENTRY [74] ULTIMATE.startENTRY-->L35: Formula: (and (< 0 v_ULTIMATE.start_main_~n~0_9) (< 0 v_ULTIMATE.start_main_~m~0_9)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_8|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_7|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_6|, ULTIMATE.start_main_~m~0=v_ULTIMATE.start_main_~m~0_9, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_9, ULTIMATE.start_main_#t~ret4=|v_ULTIMATE.start_main_#t~ret4_7|, ULTIMATE.start_main_~result~0=v_ULTIMATE.start_main_~result~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~m~0, ULTIMATE.start_main_~n~0, ULTIMATE.start_main_#t~ret4, ULTIMATE.start_main_~result~0] 411#L35 [60] L35-->additionENTRY: Formula: (and (= |v_addition_#in~mInParam_1| v_ULTIMATE.start_main_~m~0_7) (= |v_addition_#in~nInParam_1| v_ULTIMATE.start_main_~n~0_6)) InVars {ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_6, ULTIMATE.start_main_~m~0=v_ULTIMATE.start_main_~m~0_7} OutVars{addition_#in~m=|v_addition_#in~mInParam_1|, addition_#in~n=|v_addition_#in~nInParam_1|} AuxVars[] AssignedVars[addition_#in~m, addition_#in~n]< 410#additionENTRY [52] additionENTRY-->L14: Formula: (and (= v_addition_~m_1 |v_addition_#in~m_1|) (= v_addition_~n_1 |v_addition_#in~n_1|)) InVars {addition_#in~m=|v_addition_#in~m_1|, addition_#in~n=|v_addition_#in~n_1|} OutVars{addition_~n=v_addition_~n_1, addition_#in~m=|v_addition_#in~m_1|, addition_#in~n=|v_addition_#in~n_1|, addition_~m=v_addition_~m_1} AuxVars[] AssignedVars[addition_~n, addition_~m] 412#L14 [71] L14-->L17: Formula: (< 0 v_addition_~n_4) InVars {addition_~n=v_addition_~n_4} OutVars{addition_~n=v_addition_~n_4} AuxVars[] AssignedVars[] 422#L17 [49] L17-->L18: Formula: (< 0 v_addition_~n_5) InVars {addition_~n=v_addition_~n_5} OutVars{addition_~n=v_addition_~n_5} AuxVars[] AssignedVars[] 414#L18 [48] L18-->additionENTRY: Formula: (and (= |v_addition_#in~mInParam_2| (+ v_addition_~m_5 1)) (= |v_addition_#in~nInParam_2| (+ v_addition_~n_10 (- 1)))) InVars {addition_~n=v_addition_~n_10, addition_~m=v_addition_~m_5} OutVars{addition_#in~m=|v_addition_#in~mInParam_2|, addition_#in~n=|v_addition_#in~nInParam_2|} AuxVars[] AssignedVars[addition_#in~m, addition_#in~n]< 413#additionENTRY [52] additionENTRY-->L14: Formula: (and (= v_addition_~m_1 |v_addition_#in~m_1|) (= v_addition_~n_1 |v_addition_#in~n_1|)) InVars {addition_#in~m=|v_addition_#in~m_1|, addition_#in~n=|v_addition_#in~n_1|} OutVars{addition_~n=v_addition_~n_1, addition_#in~m=|v_addition_#in~m_1|, addition_#in~n=|v_addition_#in~n_1|, addition_~m=v_addition_~m_1} AuxVars[] AssignedVars[addition_~n, addition_~m] 415#L14 [70] L14-->L17: Formula: (> 0 v_addition_~n_4) InVars {addition_~n=v_addition_~n_4} OutVars{addition_~n=v_addition_~n_4} AuxVars[] AssignedVars[] 421#L17 [2020-06-22 07:03:08,828 INFO L796 eck$LassoCheckResult]: Loop: 421#L17 [68] L17-->L20: Formula: (>= 0 v_addition_~n_7) InVars {addition_~n=v_addition_~n_7} OutVars{addition_~n=v_addition_~n_7} AuxVars[] AssignedVars[] 416#L20 [42] L20-->L21: Formula: (< v_addition_~n_8 0) InVars {addition_~n=v_addition_~n_8} OutVars{addition_~n=v_addition_~n_8} AuxVars[] AssignedVars[] 417#L21 [45] L21-->additionENTRY: Formula: (and (= |v_addition_#in~mInParam_3| (+ v_addition_~m_6 (- 1))) (= |v_addition_#in~nInParam_3| (+ v_addition_~n_11 1))) InVars {addition_~n=v_addition_~n_11, addition_~m=v_addition_~m_6} OutVars{addition_#in~m=|v_addition_#in~mInParam_3|, addition_#in~n=|v_addition_#in~nInParam_3|} AuxVars[] AssignedVars[addition_#in~m, addition_#in~n]< 419#additionENTRY [52] additionENTRY-->L14: Formula: (and (= v_addition_~m_1 |v_addition_#in~m_1|) (= v_addition_~n_1 |v_addition_#in~n_1|)) InVars {addition_#in~m=|v_addition_#in~m_1|, addition_#in~n=|v_addition_#in~n_1|} OutVars{addition_~n=v_addition_~n_1, addition_#in~m=|v_addition_#in~m_1|, addition_#in~n=|v_addition_#in~n_1|, addition_~m=v_addition_~m_1} AuxVars[] AssignedVars[addition_~n, addition_~m] 426#L14 [71] L14-->L17: Formula: (< 0 v_addition_~n_4) InVars {addition_~n=v_addition_~n_4} OutVars{addition_~n=v_addition_~n_4} AuxVars[] AssignedVars[] 424#L17 [49] L17-->L18: Formula: (< 0 v_addition_~n_5) InVars {addition_~n=v_addition_~n_5} OutVars{addition_~n=v_addition_~n_5} AuxVars[] AssignedVars[] 418#L18 [48] L18-->additionENTRY: Formula: (and (= |v_addition_#in~mInParam_2| (+ v_addition_~m_5 1)) (= |v_addition_#in~nInParam_2| (+ v_addition_~n_10 (- 1)))) InVars {addition_~n=v_addition_~n_10, addition_~m=v_addition_~m_5} OutVars{addition_#in~m=|v_addition_#in~mInParam_2|, addition_#in~n=|v_addition_#in~nInParam_2|} AuxVars[] AssignedVars[addition_#in~m, addition_#in~n]< 423#additionENTRY [52] additionENTRY-->L14: Formula: (and (= v_addition_~m_1 |v_addition_#in~m_1|) (= v_addition_~n_1 |v_addition_#in~n_1|)) InVars {addition_#in~m=|v_addition_#in~m_1|, addition_#in~n=|v_addition_#in~n_1|} OutVars{addition_~n=v_addition_~n_1, addition_#in~m=|v_addition_#in~m_1|, addition_#in~n=|v_addition_#in~n_1|, addition_~m=v_addition_~m_1} AuxVars[] AssignedVars[addition_~n, addition_~m] 427#L14 [70] L14-->L17: Formula: (> 0 v_addition_~n_4) InVars {addition_~n=v_addition_~n_4} OutVars{addition_~n=v_addition_~n_4} AuxVars[] AssignedVars[] 421#L17 [2020-06-22 07:03:08,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 07:03:08,828 INFO L82 PathProgramCache]: Analyzing trace with hash 1577898167, now seen corresponding path program 1 times [2020-06-22 07:03:08,828 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 07:03:08,828 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 07:03:08,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 07:03:08,829 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 07:03:08,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 07:03:08,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 07:03:08,853 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 07:03:08,853 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 07:03:08,853 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-06-22 07:03:08,854 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-06-22 07:03:08,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 07:03:08,854 INFO L82 PathProgramCache]: Analyzing trace with hash 178010730, now seen corresponding path program 1 times [2020-06-22 07:03:08,854 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 07:03:08,854 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 07:03:08,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 07:03:08,855 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 07:03:08,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 07:03:08,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 07:03:08,878 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 07:03:08,879 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 07:03:08,879 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-06-22 07:03:08,879 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-06-22 07:03:08,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-06-22 07:03:08,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-06-22 07:03:08,880 INFO L87 Difference]: Start difference. First operand 18 states and 21 transitions. cyclomatic complexity: 5 Second operand 5 states. [2020-06-22 07:03:08,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 07:03:08,902 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2020-06-22 07:03:08,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-06-22 07:03:08,904 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 11 transitions. [2020-06-22 07:03:08,905 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-06-22 07:03:08,905 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 0 states and 0 transitions. [2020-06-22 07:03:08,905 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-06-22 07:03:08,905 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-06-22 07:03:08,905 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-06-22 07:03:08,905 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 07:03:08,905 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 07:03:08,905 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 07:03:08,906 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 07:03:08,906 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2020-06-22 07:03:08,906 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-06-22 07:03:08,906 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-06-22 07:03:08,906 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-06-22 07:03:08,912 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 07:03:08 BasicIcfg [2020-06-22 07:03:08,912 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-06-22 07:03:08,912 INFO L168 Benchmark]: Toolchain (without parser) took 14640.73 ms. Allocated memory was 649.6 MB in the beginning and 747.1 MB in the end (delta: 97.5 MB). Free memory was 565.3 MB in the beginning and 669.4 MB in the end (delta: -104.1 MB). There was no memory consumed. Max. memory is 50.3 GB. [2020-06-22 07:03:08,914 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 649.6 MB. Free memory is still 592.2 MB. There was no memory consumed. Max. memory is 50.3 GB. [2020-06-22 07:03:08,914 INFO L168 Benchmark]: CACSL2BoogieTranslator took 295.19 ms. Allocated memory was 649.6 MB in the beginning and 684.7 MB in the end (delta: 35.1 MB). Free memory was 565.3 MB in the beginning and 651.3 MB in the end (delta: -86.0 MB). Peak memory consumption was 30.0 MB. Max. memory is 50.3 GB. [2020-06-22 07:03:08,915 INFO L168 Benchmark]: Boogie Procedure Inliner took 36.25 ms. Allocated memory is still 684.7 MB. Free memory was 651.3 MB in the beginning and 648.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 50.3 GB. [2020-06-22 07:03:08,915 INFO L168 Benchmark]: Boogie Preprocessor took 18.04 ms. Allocated memory is still 684.7 MB. Free memory is still 648.6 MB. There was no memory consumed. Max. memory is 50.3 GB. [2020-06-22 07:03:08,916 INFO L168 Benchmark]: RCFGBuilder took 229.26 ms. Allocated memory is still 684.7 MB. Free memory was 647.2 MB in the beginning and 631.1 MB in the end (delta: 16.2 MB). Peak memory consumption was 16.2 MB. Max. memory is 50.3 GB. [2020-06-22 07:03:08,916 INFO L168 Benchmark]: BlockEncodingV2 took 88.79 ms. Allocated memory is still 684.7 MB. Free memory was 631.1 MB in the beginning and 624.6 MB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 50.3 GB. [2020-06-22 07:03:08,917 INFO L168 Benchmark]: TraceAbstraction took 172.55 ms. Allocated memory is still 684.7 MB. Free memory was 624.6 MB in the beginning and 613.8 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 50.3 GB. [2020-06-22 07:03:08,917 INFO L168 Benchmark]: BuchiAutomizer took 13795.34 ms. Allocated memory was 684.7 MB in the beginning and 747.1 MB in the end (delta: 62.4 MB). Free memory was 613.8 MB in the beginning and 669.4 MB in the end (delta: -55.5 MB). Peak memory consumption was 6.8 MB. Max. memory is 50.3 GB. [2020-06-22 07:03:08,921 INFO L337 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 18 locations, 24 edges - StatisticsResult: Encoded RCFG 12 locations, 17 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 649.6 MB. Free memory is still 592.2 MB. There was no memory consumed. Max. memory is 50.3 GB. * CACSL2BoogieTranslator took 295.19 ms. Allocated memory was 649.6 MB in the beginning and 684.7 MB in the end (delta: 35.1 MB). Free memory was 565.3 MB in the beginning and 651.3 MB in the end (delta: -86.0 MB). Peak memory consumption was 30.0 MB. Max. memory is 50.3 GB. * Boogie Procedure Inliner took 36.25 ms. Allocated memory is still 684.7 MB. Free memory was 651.3 MB in the beginning and 648.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 50.3 GB. * Boogie Preprocessor took 18.04 ms. Allocated memory is still 684.7 MB. Free memory is still 648.6 MB. There was no memory consumed. Max. memory is 50.3 GB. * RCFGBuilder took 229.26 ms. Allocated memory is still 684.7 MB. Free memory was 647.2 MB in the beginning and 631.1 MB in the end (delta: 16.2 MB). Peak memory consumption was 16.2 MB. Max. memory is 50.3 GB. * BlockEncodingV2 took 88.79 ms. Allocated memory is still 684.7 MB. Free memory was 631.1 MB in the beginning and 624.6 MB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 50.3 GB. * TraceAbstraction took 172.55 ms. Allocated memory is still 684.7 MB. Free memory was 624.6 MB in the beginning and 613.8 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 50.3 GB. * BuchiAutomizer took 13795.34 ms. Allocated memory was 684.7 MB in the beginning and 747.1 MB in the end (delta: 62.4 MB). Free memory was 613.8 MB in the beginning and 669.4 MB in the end (delta: -55.5 MB). Peak memory consumption was 6.8 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. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 12 locations, 0 error locations. SAFE Result, 0.1s 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=12occurred 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, 4 LocationsWithAnnotation, 10 PreInvPairs, 10 NumberOfFragments, 4 HoareAnnotationTreeSize, 10 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 4 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (3 trivial, 0 deterministic, 2 nondeterministic). One nondeterministic module has affine ranking function \old(n) and consists of 5 locations. One nondeterministic module has affine ranking function -1 * n and consists of 6 locations. 3 modules have a trivial ranking function, the largest among these consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 13.7s and 5 iterations. TraceHistogramMax:2. Analysis of lassos took 13.0s. Construction of modules took 0.1s. Büchi inclusion checks took 0.5s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 31 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 18 states and ocurred in iteration 3. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 43 SDtfs, 56 SDslu, 29 SDs, 0 SdLazy, 107 SolverSat, 17 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT1 conc0 concLT0 SILN0 SILU0 SILI1 SILT1 lasso0 LassoPreprocessingBenchmarks: Lassos: inital18 mio100 ax100 hnf100 lsp64 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq168 hnf92 smp100 dnf100 smp100 tf111 neg100 sie110 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 7ms VariablesStem: 0 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 7 LassoNonterminationAnalysisSatUnbounded: 2 LassoNonterminationAnalysisUnsat: 2 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 11.8s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! !SESSION 2020-06-22 07:02:51.001 ----------------------------------------------- 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 07:03:09.152 !MESSAGE The workspace will exit with unsaved changes in this session. Received shutdown request... Ultimate: GTK+ Version Check