61.39/42.24 YES 61.39/42.24 61.39/42.24 Ultimate: Cannot open display: 61.39/42.24 This is Ultimate 0.1.24-8dc7c08-m 61.39/42.24 [2019-03-28 12:02:33,653 INFO L170 SettingsManager]: Resetting all preferences to default values... 61.39/42.24 [2019-03-28 12:02:33,656 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values 61.39/42.24 [2019-03-28 12:02:33,667 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... 61.39/42.24 [2019-03-28 12:02:33,667 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values 61.39/42.24 [2019-03-28 12:02:33,668 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values 61.39/42.24 [2019-03-28 12:02:33,669 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values 61.39/42.24 [2019-03-28 12:02:33,671 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values 61.39/42.24 [2019-03-28 12:02:33,673 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values 61.39/42.24 [2019-03-28 12:02:33,673 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values 61.39/42.24 [2019-03-28 12:02:33,674 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... 61.39/42.24 [2019-03-28 12:02:33,675 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values 61.39/42.24 [2019-03-28 12:02:33,675 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values 61.39/42.24 [2019-03-28 12:02:33,676 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values 61.39/42.24 [2019-03-28 12:02:33,677 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values 61.39/42.24 [2019-03-28 12:02:33,678 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values 61.39/42.24 [2019-03-28 12:02:33,679 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values 61.39/42.24 [2019-03-28 12:02:33,681 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values 61.39/42.24 [2019-03-28 12:02:33,683 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values 61.39/42.24 [2019-03-28 12:02:33,684 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values 61.39/42.24 [2019-03-28 12:02:33,685 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values 61.39/42.24 [2019-03-28 12:02:33,687 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values 61.39/42.24 [2019-03-28 12:02:33,689 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... 61.39/42.24 [2019-03-28 12:02:33,689 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... 61.39/42.24 [2019-03-28 12:02:33,689 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values 61.39/42.24 [2019-03-28 12:02:33,690 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values 61.39/42.24 [2019-03-28 12:02:33,690 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values 61.39/42.24 [2019-03-28 12:02:33,691 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... 61.39/42.24 [2019-03-28 12:02:33,691 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values 61.39/42.24 [2019-03-28 12:02:33,692 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values 61.39/42.24 [2019-03-28 12:02:33,693 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values 61.39/42.24 [2019-03-28 12:02:33,693 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values 61.39/42.24 [2019-03-28 12:02:33,694 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... 61.39/42.24 [2019-03-28 12:02:33,695 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values 61.39/42.24 [2019-03-28 12:02:33,695 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... 61.39/42.24 [2019-03-28 12:02:33,695 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... 61.39/42.24 [2019-03-28 12:02:33,696 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values 61.39/42.24 [2019-03-28 12:02:33,697 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values 61.39/42.24 [2019-03-28 12:02:33,697 INFO L181 SettingsManager]: Finished resetting all preferences to default values... 61.39/42.24 [2019-03-28 12:02:33,698 INFO L98 SettingsManager]: Beginning loading settings from /export/starexec/sandbox2/solver/bin/./../termcomp2017.epf 61.39/42.24 [2019-03-28 12:02:33,712 INFO L110 SettingsManager]: Loading preferences was successful 61.39/42.24 [2019-03-28 12:02:33,712 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: 61.39/42.24 [2019-03-28 12:02:33,713 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: 61.39/42.24 [2019-03-28 12:02:33,713 INFO L133 SettingsManager]: * Rewrite not-equals=true 61.39/42.24 [2019-03-28 12:02:33,714 INFO L133 SettingsManager]: * Create parallel compositions if possible=false 61.39/42.24 [2019-03-28 12:02:33,714 INFO L133 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE 61.39/42.24 [2019-03-28 12:02:33,714 INFO L133 SettingsManager]: * Use SBE=true 61.39/42.24 [2019-03-28 12:02:33,714 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: 61.39/42.24 [2019-03-28 12:02:33,714 INFO L133 SettingsManager]: * Use old map elimination=false 61.39/42.24 [2019-03-28 12:02:33,715 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false 61.39/42.24 [2019-03-28 12:02:33,715 INFO L133 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION 61.39/42.24 [2019-03-28 12:02:33,715 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true 61.39/42.24 [2019-03-28 12:02:33,715 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES 61.39/42.24 [2019-03-28 12:02:33,715 INFO L133 SettingsManager]: * Construct termination proof for TermComp=true 61.39/42.24 [2019-03-28 12:02:33,715 INFO L133 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 61.39/42.24 [2019-03-28 12:02:33,716 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: 61.39/42.24 [2019-03-28 12:02:33,716 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false 61.39/42.24 [2019-03-28 12:02:33,716 INFO L133 SettingsManager]: * Check division by zero=IGNORE 61.39/42.24 [2019-03-28 12:02:33,716 INFO L133 SettingsManager]: * Check if freed pointer was valid=false 61.39/42.24 [2019-03-28 12:02:33,716 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false 61.39/42.24 [2019-03-28 12:02:33,716 INFO L133 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE 61.39/42.24 [2019-03-28 12:02:33,717 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: 61.39/42.24 [2019-03-28 12:02:33,717 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements 61.39/42.24 [2019-03-28 12:02:33,717 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump 61.39/42.24 [2019-03-28 12:02:33,717 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 61.39/42.24 [2019-03-28 12:02:33,717 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: 61.39/42.24 [2019-03-28 12:02:33,718 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles 61.39/42.24 [2019-03-28 12:02:33,718 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL 61.39/42.24 [2019-03-28 12:02:33,718 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 61.39/42.24 [2019-03-28 12:02:33,744 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp 61.39/42.24 [2019-03-28 12:02:33,775 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized 61.39/42.24 [2019-03-28 12:02:33,778 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. 61.39/42.24 [2019-03-28 12:02:33,779 INFO L271 PluginConnector]: Initializing CDTParser... 61.39/42.24 [2019-03-28 12:02:33,780 INFO L276 PluginConnector]: CDTParser initialized 61.39/42.24 [2019-03-28 12:02:33,781 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox2/benchmark/theBenchmark.c 61.39/42.24 [2019-03-28 12:02:33,845 INFO L221 CDTParser]: Created temporary CDT project at /export/starexec/sandbox2/tmp/aecac0c63d6e4b4597515bcfa0bb9ad5/FLAG6cbe021ee 61.39/42.24 [2019-03-28 12:02:34,387 INFO L307 CDTParser]: Found 1 translation units. 61.39/42.24 [2019-03-28 12:02:34,388 INFO L161 CDTParser]: Scanning /export/starexec/sandbox2/benchmark/theBenchmark.c 61.39/42.24 [2019-03-28 12:02:34,394 INFO L355 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox2/tmp/aecac0c63d6e4b4597515bcfa0bb9ad5/FLAG6cbe021ee 61.39/42.24 [2019-03-28 12:02:35,580 INFO L363 CDTParser]: Successfully deleted /export/starexec/sandbox2/tmp/aecac0c63d6e4b4597515bcfa0bb9ad5 61.39/42.24 [2019-03-28 12:02:35,592 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### 61.39/42.24 [2019-03-28 12:02:35,593 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. 61.39/42.24 [2019-03-28 12:02:35,594 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- 61.39/42.24 [2019-03-28 12:02:35,595 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... 61.39/42.24 [2019-03-28 12:02:35,598 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized 61.39/42.24 [2019-03-28 12:02:35,599 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 12:02:35" (1/1) ... 61.39/42.24 [2019-03-28 12:02:35,602 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4db7e31e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:02:35, skipping insertion in model container 61.39/42.24 [2019-03-28 12:02:35,602 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 12:02:35" (1/1) ... 61.39/42.24 [2019-03-28 12:02:35,610 INFO L145 MainTranslator]: Starting translation in SV-COMP mode 61.39/42.24 [2019-03-28 12:02:35,627 INFO L176 MainTranslator]: Built tables and reachable declarations 61.39/42.24 [2019-03-28 12:02:35,784 INFO L206 PostProcessor]: Analyzing one entry point: main 61.39/42.24 [2019-03-28 12:02:35,788 INFO L191 MainTranslator]: Completed pre-run 61.39/42.24 [2019-03-28 12:02:35,805 INFO L206 PostProcessor]: Analyzing one entry point: main 61.39/42.24 [2019-03-28 12:02:35,820 INFO L195 MainTranslator]: Completed translation 61.39/42.24 [2019-03-28 12:02:35,820 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:02:35 WrapperNode 61.39/42.24 [2019-03-28 12:02:35,820 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- 61.39/42.24 [2019-03-28 12:02:35,821 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- 61.39/42.24 [2019-03-28 12:02:35,821 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... 61.39/42.24 [2019-03-28 12:02:35,822 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized 61.39/42.24 [2019-03-28 12:02:35,887 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:02:35" (1/1) ... 61.39/42.24 [2019-03-28 12:02:35,893 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:02:35" (1/1) ... 61.39/42.24 [2019-03-28 12:02:35,914 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- 61.39/42.24 [2019-03-28 12:02:35,914 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- 61.39/42.24 [2019-03-28 12:02:35,914 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... 61.39/42.24 [2019-03-28 12:02:35,914 INFO L276 PluginConnector]: Boogie Preprocessor initialized 61.39/42.24 [2019-03-28 12:02:35,924 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:02:35" (1/1) ... 61.39/42.24 [2019-03-28 12:02:35,924 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:02:35" (1/1) ... 61.39/42.24 [2019-03-28 12:02:35,926 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:02:35" (1/1) ... 61.39/42.24 [2019-03-28 12:02:35,926 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:02:35" (1/1) ... 61.39/42.24 [2019-03-28 12:02:35,928 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:02:35" (1/1) ... 61.39/42.24 [2019-03-28 12:02:35,931 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:02:35" (1/1) ... 61.39/42.24 [2019-03-28 12:02:35,931 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:02:35" (1/1) ... 61.39/42.24 [2019-03-28 12:02:35,933 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- 61.39/42.24 [2019-03-28 12:02:35,933 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- 61.39/42.24 [2019-03-28 12:02:35,933 INFO L271 PluginConnector]: Initializing RCFGBuilder... 61.39/42.24 [2019-03-28 12:02:35,934 INFO L276 PluginConnector]: RCFGBuilder initialized 61.39/42.24 [2019-03-28 12:02:35,935 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:02:35" (1/1) ... 61.39/42.24 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 61.39/42.24 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) 61.39/42.24 Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 61.39/42.24 [2019-03-28 12:02:35,997 INFO L130 BoogieDeclarations]: Found specification of procedure p 61.39/42.24 [2019-03-28 12:02:35,997 INFO L138 BoogieDeclarations]: Found implementation of procedure p 61.39/42.24 [2019-03-28 12:02:35,997 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start 61.39/42.24 [2019-03-28 12:02:35,998 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start 61.39/42.24 [2019-03-28 12:02:36,141 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) 61.39/42.24 [2019-03-28 12:02:36,141 INFO L286 CfgBuilder]: Removed 4 assue(true) statements. 61.39/42.24 [2019-03-28 12:02:36,142 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:02:36 BoogieIcfgContainer 61.39/42.24 [2019-03-28 12:02:36,142 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- 61.39/42.24 [2019-03-28 12:02:36,143 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- 61.39/42.24 [2019-03-28 12:02:36,143 INFO L271 PluginConnector]: Initializing BlockEncodingV2... 61.39/42.24 [2019-03-28 12:02:36,145 INFO L276 PluginConnector]: BlockEncodingV2 initialized 61.39/42.24 [2019-03-28 12:02:36,146 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:02:36" (1/1) ... 61.39/42.24 [2019-03-28 12:02:36,164 INFO L313 BlockEncoder]: Initial Icfg 17 locations, 21 edges 61.39/42.24 [2019-03-28 12:02:36,166 INFO L258 BlockEncoder]: Using Remove infeasible edges 61.39/42.24 [2019-03-28 12:02:36,166 INFO L263 BlockEncoder]: Using Maximize final states 61.39/42.24 [2019-03-28 12:02:36,167 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false 61.39/42.24 [2019-03-28 12:02:36,167 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE 61.39/42.24 [2019-03-28 12:02:36,169 INFO L296 BlockEncoder]: Using Remove sink states 61.39/42.24 [2019-03-28 12:02:36,170 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true 61.39/42.24 [2019-03-28 12:02:36,170 INFO L179 BlockEncoder]: Using Rewrite not-equals 61.39/42.24 [2019-03-28 12:02:36,185 INFO L185 BlockEncoder]: Using Use SBE 61.39/42.24 [2019-03-28 12:02:36,201 INFO L200 BlockEncoder]: SBE split 1 edges 61.39/42.24 [2019-03-28 12:02:36,206 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility 61.39/42.24 [2019-03-28 12:02:36,207 INFO L71 MaximizeFinalStates]: 0 new accepting states 61.39/42.24 [2019-03-28 12:02:36,218 INFO L100 BaseMinimizeStates]: Removed 4 edges and 2 locations by large block encoding 61.39/42.24 [2019-03-28 12:02:36,220 INFO L70 RemoveSinkStates]: Removed 6 edges and 3 locations by removing sink states 61.39/42.24 [2019-03-28 12:02:36,222 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility 61.39/42.24 [2019-03-28 12:02:36,222 INFO L71 MaximizeFinalStates]: 0 new accepting states 61.39/42.24 [2019-03-28 12:02:36,228 INFO L100 BaseMinimizeStates]: Removed 2 edges and 1 locations by large block encoding 61.39/42.24 [2019-03-28 12:02:36,229 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states 61.39/42.24 [2019-03-28 12:02:36,229 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility 61.39/42.24 [2019-03-28 12:02:36,229 INFO L71 MaximizeFinalStates]: 0 new accepting states 61.39/42.24 [2019-03-28 12:02:36,229 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding 61.39/42.24 [2019-03-28 12:02:36,230 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states 61.39/42.24 [2019-03-28 12:02:36,230 INFO L313 BlockEncoder]: Encoded RCFG 11 locations, 14 edges 61.39/42.24 [2019-03-28 12:02:36,231 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:02:36 BasicIcfg 61.39/42.24 [2019-03-28 12:02:36,231 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- 61.39/42.24 [2019-03-28 12:02:36,232 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- 61.39/42.24 [2019-03-28 12:02:36,232 INFO L271 PluginConnector]: Initializing TraceAbstraction... 61.39/42.24 [2019-03-28 12:02:36,235 INFO L276 PluginConnector]: TraceAbstraction initialized 61.39/42.24 [2019-03-28 12:02:36,235 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.03 12:02:35" (1/4) ... 61.39/42.24 [2019-03-28 12:02:36,236 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42401458 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 12:02:36, skipping insertion in model container 61.39/42.24 [2019-03-28 12:02:36,236 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:02:35" (2/4) ... 61.39/42.24 [2019-03-28 12:02:36,237 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42401458 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 12:02:36, skipping insertion in model container 61.39/42.24 [2019-03-28 12:02:36,237 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:02:36" (3/4) ... 61.39/42.24 [2019-03-28 12:02:36,237 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42401458 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:02:36, skipping insertion in model container 61.39/42.24 [2019-03-28 12:02:36,237 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:02:36" (4/4) ... 61.39/42.24 [2019-03-28 12:02:36,239 INFO L112 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 61.39/42.24 [2019-03-28 12:02:36,249 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION 61.39/42.24 [2019-03-28 12:02:36,257 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 0 error locations. 61.39/42.24 [2019-03-28 12:02:36,274 INFO L257 AbstractCegarLoop]: Starting to check reachability of 0 error locations. 61.39/42.24 [2019-03-28 12:02:36,303 INFO L133 ementStrategyFactory]: Using default assertion order modulation 61.39/42.24 [2019-03-28 12:02:36,304 INFO L382 AbstractCegarLoop]: Interprodecural is true 61.39/42.24 [2019-03-28 12:02:36,304 INFO L383 AbstractCegarLoop]: Hoare is true 61.39/42.24 [2019-03-28 12:02:36,304 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates 61.39/42.24 [2019-03-28 12:02:36,304 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE 61.39/42.24 [2019-03-28 12:02:36,304 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION 61.39/42.24 [2019-03-28 12:02:36,304 INFO L387 AbstractCegarLoop]: Difference is false 61.39/42.24 [2019-03-28 12:02:36,305 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA 61.39/42.24 [2019-03-28 12:02:36,305 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== 61.39/42.24 [2019-03-28 12:02:36,322 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states. 61.39/42.24 [2019-03-28 12:02:36,328 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. 61.39/42.24 [2019-03-28 12:02:36,334 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 11 states. 61.39/42.24 [2019-03-28 12:02:36,391 INFO L451 ceAbstractionStarter]: At program point L17(line 17) the Hoare annotation is: true 61.39/42.24 [2019-03-28 12:02:36,391 INFO L448 ceAbstractionStarter]: For program point L16(lines 16 20) no Hoare annotation was computed. 61.39/42.24 [2019-03-28 12:02:36,392 INFO L448 ceAbstractionStarter]: For program point L17-1(line 17) no Hoare annotation was computed. 61.39/42.24 [2019-03-28 12:02:36,392 INFO L451 ceAbstractionStarter]: At program point pENTRY(lines 12 22) the Hoare annotation is: true 61.39/42.24 [2019-03-28 12:02:36,392 INFO L451 ceAbstractionStarter]: At program point L14(line 14) the Hoare annotation is: true 61.39/42.24 [2019-03-28 12:02:36,392 INFO L448 ceAbstractionStarter]: For program point L13(lines 13 21) no Hoare annotation was computed. 61.39/42.24 [2019-03-28 12:02:36,392 INFO L448 ceAbstractionStarter]: For program point L14-1(line 14) no Hoare annotation was computed. 61.39/42.24 [2019-03-28 12:02:36,392 INFO L448 ceAbstractionStarter]: For program point pFINAL(lines 12 22) no Hoare annotation was computed. 61.39/42.24 [2019-03-28 12:02:36,393 INFO L448 ceAbstractionStarter]: For program point pEXIT(lines 12 22) no Hoare annotation was computed. 61.39/42.24 [2019-03-28 12:02:36,393 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. 61.39/42.24 [2019-03-28 12:02:36,393 INFO L451 ceAbstractionStarter]: At program point L29(line 29) the Hoare annotation is: true 61.39/42.24 [2019-03-28 12:02:36,396 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:02:36 BasicIcfg 61.39/42.24 [2019-03-28 12:02:36,396 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- 61.39/42.24 [2019-03-28 12:02:36,397 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- 61.39/42.24 [2019-03-28 12:02:36,397 INFO L271 PluginConnector]: Initializing BuchiAutomizer... 61.39/42.24 [2019-03-28 12:02:36,401 INFO L276 PluginConnector]: BuchiAutomizer initialized 61.39/42.24 [2019-03-28 12:02:36,402 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 61.39/42.24 [2019-03-28 12:02:36,402 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.03 12:02:35" (1/5) ... 61.39/42.24 [2019-03-28 12:02:36,403 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@23029113 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.03 12:02:36, skipping insertion in model container 61.39/42.24 [2019-03-28 12:02:36,403 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 61.39/42.24 [2019-03-28 12:02:36,403 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:02:35" (2/5) ... 61.39/42.24 [2019-03-28 12:02:36,403 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@23029113 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.03 12:02:36, skipping insertion in model container 61.39/42.24 [2019-03-28 12:02:36,403 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 61.39/42.24 [2019-03-28 12:02:36,404 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:02:36" (3/5) ... 61.39/42.24 [2019-03-28 12:02:36,404 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@23029113 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:02:36, skipping insertion in model container 61.39/42.24 [2019-03-28 12:02:36,404 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 61.39/42.24 [2019-03-28 12:02:36,404 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:02:36" (4/5) ... 61.39/42.24 [2019-03-28 12:02:36,405 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@23029113 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:02:36, skipping insertion in model container 61.39/42.24 [2019-03-28 12:02:36,405 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 61.39/42.24 [2019-03-28 12:02:36,405 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:02:36" (5/5) ... 61.39/42.24 [2019-03-28 12:02:36,407 INFO L375 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 61.39/42.24 [2019-03-28 12:02:36,435 INFO L133 ementStrategyFactory]: Using default assertion order modulation 61.39/42.24 [2019-03-28 12:02:36,436 INFO L374 BuchiCegarLoop]: Interprodecural is true 61.39/42.24 [2019-03-28 12:02:36,436 INFO L375 BuchiCegarLoop]: Hoare is true 61.39/42.24 [2019-03-28 12:02:36,436 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates 61.39/42.24 [2019-03-28 12:02:36,436 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE 61.39/42.24 [2019-03-28 12:02:36,436 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION 61.39/42.24 [2019-03-28 12:02:36,436 INFO L379 BuchiCegarLoop]: Difference is false 61.39/42.24 [2019-03-28 12:02:36,437 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA 61.39/42.24 [2019-03-28 12:02:36,437 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== 61.39/42.24 [2019-03-28 12:02:36,441 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states. 61.39/42.24 [2019-03-28 12:02:36,462 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 61.39/42.24 [2019-03-28 12:02:36,462 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 61.39/42.24 [2019-03-28 12:02:36,462 INFO L119 BuchiIsEmpty]: Starting construction of run 61.39/42.24 [2019-03-28 12:02:36,469 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] 61.39/42.24 [2019-03-28 12:02:36,470 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] 61.39/42.24 [2019-03-28 12:02:36,470 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ 61.39/42.24 [2019-03-28 12:02:36,470 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states. 61.39/42.24 [2019-03-28 12:02:36,471 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 61.39/42.24 [2019-03-28 12:02:36,471 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 61.39/42.24 [2019-03-28 12:02:36,472 INFO L119 BuchiIsEmpty]: Starting construction of run 61.39/42.24 [2019-03-28 12:02:36,472 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] 61.39/42.24 [2019-03-28 12:02:36,472 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] 61.39/42.24 [2019-03-28 12:02:36,477 INFO L794 eck$LassoCheckResult]: Stem: 4#ULTIMATE.startENTRYtrue [63] ULTIMATE.startENTRY-->L29: Formula: (and (<= 0 v_ULTIMATE.start_main_~n~0_8) (<= 0 v_ULTIMATE.start_main_~m~0_8) (<= 0 v_ULTIMATE.start_main_~r~0_8)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_6|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_6|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_6|, ULTIMATE.start_main_~m~0=v_ULTIMATE.start_main_~m~0_8, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_6|, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_8, ULTIMATE.start_main_~r~0=v_ULTIMATE.start_main_~r~0_8, ULTIMATE.start_main_#t~ret5=|v_ULTIMATE.start_main_#t~ret5_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#res, ULTIMATE.start_main_~m~0, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~n~0, ULTIMATE.start_main_~r~0, ULTIMATE.start_main_#t~ret5] 9#L29true [44] L29-->pENTRY: Formula: (and (= |v_p_#in~rInParam_3| v_ULTIMATE.start_main_~r~0_7) (= |v_p_#in~mInParam_3| v_ULTIMATE.start_main_~m~0_7) (= |v_p_#in~nInParam_3| v_ULTIMATE.start_main_~n~0_7)) InVars {ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7, ULTIMATE.start_main_~r~0=v_ULTIMATE.start_main_~r~0_7, ULTIMATE.start_main_~m~0=v_ULTIMATE.start_main_~m~0_7} OutVars{p_#in~m=|v_p_#in~mInParam_3|, p_#in~n=|v_p_#in~nInParam_3|, p_#in~r=|v_p_#in~rInParam_3|} AuxVars[] AssignedVars[p_#in~m, p_#in~n, p_#in~r]< 10#pENTRYtrue 61.39/42.24 [2019-03-28 12:02:36,478 INFO L796 eck$LassoCheckResult]: Loop: 10#pENTRYtrue [43] pENTRY-->L13: Formula: (and (= v_p_~n_1 |v_p_#in~n_1|) (= v_p_~r_1 |v_p_#in~r_1|) (= v_p_~m_1 |v_p_#in~m_1|)) InVars {p_#in~m=|v_p_#in~m_1|, p_#in~n=|v_p_#in~n_1|, p_#in~r=|v_p_#in~r_1|} OutVars{p_~n=v_p_~n_1, p_#in~m=|v_p_#in~m_1|, p_#in~n=|v_p_#in~n_1|, p_~m=v_p_~m_1, p_~r=v_p_~r_1, p_#in~r=|v_p_#in~r_1|} AuxVars[] AssignedVars[p_~n, p_~m, p_~r] 11#L13true [45] L13-->L14: Formula: (< 0 v_p_~r_2) InVars {p_~r=v_p_~r_2} OutVars{p_~r=v_p_~r_2} AuxVars[] AssignedVars[] 8#L14true [42] L14-->pENTRY: Formula: (and (= |v_p_#in~rInParam_1| v_p_~n_6) (= |v_p_#in~mInParam_1| v_p_~m_5) (= |v_p_#in~nInParam_1| (+ v_p_~r_6 (- 1)))) InVars {p_~n=v_p_~n_6, p_~m=v_p_~m_5, p_~r=v_p_~r_6} OutVars{p_#in~m=|v_p_#in~mInParam_1|, p_#in~n=|v_p_#in~nInParam_1|, p_#in~r=|v_p_#in~rInParam_1|} AuxVars[] AssignedVars[p_#in~m, p_#in~n, p_#in~r]< 10#pENTRYtrue 61.39/42.24 [2019-03-28 12:02:36,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 61.39/42.24 [2019-03-28 12:02:36,484 INFO L82 PathProgramCache]: Analyzing trace with hash 2958, now seen corresponding path program 1 times 61.39/42.24 [2019-03-28 12:02:36,486 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 61.39/42.24 [2019-03-28 12:02:36,486 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 61.39/42.24 [2019-03-28 12:02:36,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 61.39/42.24 [2019-03-28 12:02:36,507 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 61.39/42.24 [2019-03-28 12:02:36,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 61.39/42.24 [2019-03-28 12:02:36,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 61.39/42.24 [2019-03-28 12:02:36,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 61.39/42.24 [2019-03-28 12:02:36,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 61.39/42.24 [2019-03-28 12:02:36,564 INFO L82 PathProgramCache]: Analyzing trace with hash 72551, now seen corresponding path program 1 times 61.39/42.24 [2019-03-28 12:02:36,564 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 61.39/42.24 [2019-03-28 12:02:36,565 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 61.39/42.24 [2019-03-28 12:02:36,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 61.39/42.24 [2019-03-28 12:02:36,566 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 61.39/42.24 [2019-03-28 12:02:36,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 61.39/42.24 [2019-03-28 12:02:36,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 61.39/42.24 [2019-03-28 12:02:36,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 61.39/42.24 [2019-03-28 12:02:36,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 61.39/42.24 [2019-03-28 12:02:36,580 INFO L82 PathProgramCache]: Analyzing trace with hash 88164538, now seen corresponding path program 1 times 61.39/42.24 [2019-03-28 12:02:36,580 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 61.39/42.24 [2019-03-28 12:02:36,580 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 61.39/42.24 [2019-03-28 12:02:36,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 61.39/42.24 [2019-03-28 12:02:36,581 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 61.39/42.24 [2019-03-28 12:02:36,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 61.39/42.24 [2019-03-28 12:02:36,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 61.39/42.24 [2019-03-28 12:02:36,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 61.39/42.24 [2019-03-28 12:02:36,702 INFO L216 LassoAnalysis]: Preferences: 61.39/42.24 [2019-03-28 12:02:36,703 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 61.39/42.24 [2019-03-28 12:02:36,703 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 61.39/42.24 [2019-03-28 12:02:36,703 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 61.39/42.24 [2019-03-28 12:02:36,703 INFO L127 ssoRankerPreferences]: Use exernal solver: true 61.39/42.24 [2019-03-28 12:02:36,703 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 61.39/42.24 [2019-03-28 12:02:36,704 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 61.39/42.24 [2019-03-28 12:02:36,704 INFO L130 ssoRankerPreferences]: Path of dumped script: 61.39/42.24 [2019-03-28 12:02:36,704 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Loop 61.39/42.24 [2019-03-28 12:02:36,704 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 61.39/42.24 [2019-03-28 12:02:36,704 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 61.39/42.24 [2019-03-28 12:02:36,723 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 61.39/42.24 [2019-03-28 12:02:36,732 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 61.39/42.24 [2019-03-28 12:02:36,736 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 61.39/42.24 [2019-03-28 12:02:36,742 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 61.39/42.24 [2019-03-28 12:02:36,747 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 61.39/42.24 [2019-03-28 12:02:36,750 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 61.39/42.24 [2019-03-28 12:02:36,753 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 61.39/42.24 [2019-03-28 12:02:36,765 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 61.39/42.24 [2019-03-28 12:02:36,844 INFO L300 LassoAnalysis]: Preprocessing complete. 61.39/42.24 [2019-03-28 12:02:36,845 INFO L412 LassoAnalysis]: Checking for nontermination... 61.39/42.24 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 61.39/42.24 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 61.39/42.24 Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 61.39/42.24 [2019-03-28 12:02:36,852 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 61.39/42.24 [2019-03-28 12:02:36,852 INFO L163 nArgumentSynthesizer]: Using integer mode. 61.39/42.24 [2019-03-28 12:02:36,862 INFO L445 LassoAnalysis]: Proved nontermination for one component. 61.39/42.24 [2019-03-28 12:02:36,862 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {p_#res=0} Honda state: {p_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 61.39/42.24 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 61.39/42.24 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 61.39/42.24 Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 61.39/42.24 [2019-03-28 12:02:36,893 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 61.39/42.24 [2019-03-28 12:02:36,893 INFO L163 nArgumentSynthesizer]: Using integer mode. 61.39/42.24 [2019-03-28 12:02:36,897 INFO L445 LassoAnalysis]: Proved nontermination for one component. 61.39/42.24 [2019-03-28 12:02:36,897 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {p_#t~ret0=0} Honda state: {p_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 61.39/42.24 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 61.39/42.24 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 61.39/42.24 Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 61.39/42.24 [2019-03-28 12:02:36,925 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 61.39/42.24 [2019-03-28 12:02:36,926 INFO L163 nArgumentSynthesizer]: Using integer mode. 61.39/42.24 [2019-03-28 12:02:36,930 INFO L445 LassoAnalysis]: Proved nontermination for one component. 61.39/42.24 [2019-03-28 12:02:36,930 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {p_#t~ret1=0} Honda state: {p_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 61.39/42.24 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 61.39/42.24 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 61.39/42.24 Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 61.39/42.24 [2019-03-28 12:02:36,958 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 61.39/42.24 [2019-03-28 12:02:36,958 INFO L163 nArgumentSynthesizer]: Using integer mode. 61.39/42.24 [2019-03-28 12:02:36,962 INFO L445 LassoAnalysis]: Proved nontermination for one component. 61.39/42.24 [2019-03-28 12:02:36,962 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {p_#in~m=0} Honda state: {p_#in~m=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 61.39/42.24 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 61.39/42.24 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 61.39/42.24 Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 61.39/42.24 [2019-03-28 12:02:36,990 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 61.39/42.24 [2019-03-28 12:02:36,990 INFO L163 nArgumentSynthesizer]: Using integer mode. 61.39/42.24 [2019-03-28 12:02:36,994 INFO L445 LassoAnalysis]: Proved nontermination for one component. 61.39/42.24 [2019-03-28 12:02:36,994 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {p_~n=0} Honda state: {p_~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 61.39/42.24 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 61.39/42.24 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 61.39/42.24 Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 61.39/42.24 [2019-03-28 12:02:37,021 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 61.39/42.24 [2019-03-28 12:02:37,021 INFO L163 nArgumentSynthesizer]: Using integer mode. 61.39/42.24 [2019-03-28 12:02:37,025 INFO L445 LassoAnalysis]: Proved nontermination for one component. 61.39/42.24 [2019-03-28 12:02:37,025 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {p_~m=0} Honda state: {p_~m=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 61.39/42.24 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 61.39/42.24 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 61.39/42.24 Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 61.39/42.24 [2019-03-28 12:02:37,051 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 61.39/42.24 [2019-03-28 12:02:37,051 INFO L163 nArgumentSynthesizer]: Using integer mode. 61.39/42.24 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 61.39/42.24 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 61.39/42.24 Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 61.39/42.24 [2019-03-28 12:02:37,086 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 61.39/42.24 [2019-03-28 12:02:37,086 INFO L163 nArgumentSynthesizer]: Using integer mode. 61.39/42.24 [2019-03-28 12:02:37,210 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. 61.39/42.24 [2019-03-28 12:02:37,213 INFO L216 LassoAnalysis]: Preferences: 61.39/42.24 [2019-03-28 12:02:37,213 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 61.39/42.24 [2019-03-28 12:02:37,213 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 61.39/42.24 [2019-03-28 12:02:37,213 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 61.39/42.24 [2019-03-28 12:02:37,213 INFO L127 ssoRankerPreferences]: Use exernal solver: false 61.39/42.24 [2019-03-28 12:02:37,213 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 61.39/42.24 [2019-03-28 12:02:37,214 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 61.39/42.24 [2019-03-28 12:02:37,214 INFO L130 ssoRankerPreferences]: Path of dumped script: 61.39/42.24 [2019-03-28 12:02:37,214 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Loop 61.39/42.24 [2019-03-28 12:02:37,214 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 61.39/42.24 [2019-03-28 12:02:37,214 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 61.39/42.24 [2019-03-28 12:02:37,216 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 61.39/42.24 [2019-03-28 12:02:37,219 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 61.39/42.24 [2019-03-28 12:02:37,221 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 61.39/42.24 [2019-03-28 12:02:37,224 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 61.39/42.24 [2019-03-28 12:02:37,226 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 61.39/42.24 [2019-03-28 12:02:37,229 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 61.39/42.24 [2019-03-28 12:02:37,231 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 61.39/42.24 [2019-03-28 12:02:37,241 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 61.39/42.24 [2019-03-28 12:02:37,299 INFO L300 LassoAnalysis]: Preprocessing complete. 61.39/42.24 [2019-03-28 12:02:37,304 INFO L497 LassoAnalysis]: Using template 'affine'. 61.39/42.24 [2019-03-28 12:02:37,306 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 61.39/42.24 Termination analysis: LINEAR_WITH_GUESSES 61.39/42.24 Number of strict supporting invariants: 0 61.39/42.24 Number of non-strict supporting invariants: 1 61.39/42.24 Consider only non-deceasing supporting invariants: true 61.39/42.24 Simplify termination arguments: true 61.39/42.24 Simplify supporting invariants: trueOverapproximate stem: false 61.39/42.24 [2019-03-28 12:02:37,308 INFO L339 nArgumentSynthesizer]: Template has degree 0. 61.39/42.24 [2019-03-28 12:02:37,308 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 61.39/42.24 [2019-03-28 12:02:37,309 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 61.39/42.24 [2019-03-28 12:02:37,309 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 61.39/42.24 [2019-03-28 12:02:37,309 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 61.39/42.24 [2019-03-28 12:02:37,311 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 61.39/42.24 [2019-03-28 12:02:37,311 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 61.39/42.24 [2019-03-28 12:02:37,316 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 61.39/42.24 [2019-03-28 12:02:37,316 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 61.39/42.24 Termination analysis: LINEAR_WITH_GUESSES 61.39/42.24 Number of strict supporting invariants: 0 61.39/42.24 Number of non-strict supporting invariants: 1 61.39/42.24 Consider only non-deceasing supporting invariants: true 61.39/42.24 Simplify termination arguments: true 61.39/42.24 Simplify supporting invariants: trueOverapproximate stem: false 61.39/42.24 [2019-03-28 12:02:37,317 INFO L339 nArgumentSynthesizer]: Template has degree 0. 61.39/42.24 [2019-03-28 12:02:37,317 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 61.39/42.24 [2019-03-28 12:02:37,317 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 61.39/42.24 [2019-03-28 12:02:37,318 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 61.39/42.24 [2019-03-28 12:02:37,318 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 61.39/42.24 [2019-03-28 12:02:37,318 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 61.39/42.24 [2019-03-28 12:02:37,319 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 61.39/42.24 [2019-03-28 12:02:37,320 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 61.39/42.24 [2019-03-28 12:02:37,321 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 61.39/42.24 Termination analysis: LINEAR_WITH_GUESSES 61.39/42.24 Number of strict supporting invariants: 0 61.39/42.24 Number of non-strict supporting invariants: 1 61.39/42.24 Consider only non-deceasing supporting invariants: true 61.39/42.24 Simplify termination arguments: true 61.39/42.24 Simplify supporting invariants: trueOverapproximate stem: false 61.39/42.24 [2019-03-28 12:02:37,321 INFO L339 nArgumentSynthesizer]: Template has degree 0. 61.39/42.24 [2019-03-28 12:02:37,321 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 61.39/42.24 [2019-03-28 12:02:37,321 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 61.39/42.24 [2019-03-28 12:02:37,322 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 61.39/42.24 [2019-03-28 12:02:37,322 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 61.39/42.24 [2019-03-28 12:02:37,322 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 61.39/42.24 [2019-03-28 12:02:37,323 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 61.39/42.24 [2019-03-28 12:02:37,324 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 61.39/42.24 [2019-03-28 12:02:37,324 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 61.39/42.24 Termination analysis: LINEAR_WITH_GUESSES 61.39/42.24 Number of strict supporting invariants: 0 61.39/42.24 Number of non-strict supporting invariants: 1 61.39/42.24 Consider only non-deceasing supporting invariants: true 61.39/42.24 Simplify termination arguments: true 61.39/42.24 Simplify supporting invariants: trueOverapproximate stem: false 61.39/42.24 [2019-03-28 12:02:37,325 INFO L339 nArgumentSynthesizer]: Template has degree 0. 61.39/42.24 [2019-03-28 12:02:37,325 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 61.39/42.24 [2019-03-28 12:02:37,325 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 61.39/42.24 [2019-03-28 12:02:37,326 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 61.39/42.24 [2019-03-28 12:02:37,326 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 61.39/42.24 [2019-03-28 12:02:37,326 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 61.39/42.24 [2019-03-28 12:02:37,327 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 61.39/42.24 [2019-03-28 12:02:37,328 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 61.39/42.24 [2019-03-28 12:02:37,328 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 61.39/42.24 Termination analysis: LINEAR_WITH_GUESSES 61.39/42.24 Number of strict supporting invariants: 0 61.39/42.24 Number of non-strict supporting invariants: 1 61.39/42.24 Consider only non-deceasing supporting invariants: true 61.39/42.24 Simplify termination arguments: true 61.39/42.24 Simplify supporting invariants: trueOverapproximate stem: false 61.39/42.24 [2019-03-28 12:02:37,329 INFO L339 nArgumentSynthesizer]: Template has degree 0. 61.39/42.24 [2019-03-28 12:02:37,329 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 61.39/42.24 [2019-03-28 12:02:37,329 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 61.39/42.24 [2019-03-28 12:02:37,329 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 61.39/42.24 [2019-03-28 12:02:37,330 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 61.39/42.24 [2019-03-28 12:02:37,330 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 61.39/42.24 [2019-03-28 12:02:37,330 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 61.39/42.24 [2019-03-28 12:02:37,332 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 61.39/42.24 [2019-03-28 12:02:37,333 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 61.39/42.24 Termination analysis: LINEAR_WITH_GUESSES 61.39/42.24 Number of strict supporting invariants: 0 61.39/42.24 Number of non-strict supporting invariants: 1 61.39/42.24 Consider only non-deceasing supporting invariants: true 61.39/42.24 Simplify termination arguments: true 61.39/42.24 Simplify supporting invariants: trueOverapproximate stem: false 61.39/42.24 [2019-03-28 12:02:37,333 INFO L339 nArgumentSynthesizer]: Template has degree 0. 61.39/42.24 [2019-03-28 12:02:37,334 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 61.39/42.24 [2019-03-28 12:02:37,334 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 61.39/42.24 [2019-03-28 12:02:37,334 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 61.39/42.24 [2019-03-28 12:02:37,334 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 61.39/42.24 [2019-03-28 12:02:37,335 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 61.39/42.24 [2019-03-28 12:02:37,335 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 61.39/42.24 [2019-03-28 12:02:37,336 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 61.39/42.24 [2019-03-28 12:02:37,337 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 61.39/42.24 Termination analysis: LINEAR_WITH_GUESSES 61.39/42.24 Number of strict supporting invariants: 0 61.39/42.24 Number of non-strict supporting invariants: 1 61.39/42.24 Consider only non-deceasing supporting invariants: true 61.39/42.24 Simplify termination arguments: true 61.39/42.24 Simplify supporting invariants: trueOverapproximate stem: false 61.39/42.24 [2019-03-28 12:02:37,337 INFO L339 nArgumentSynthesizer]: Template has degree 0. 61.39/42.24 [2019-03-28 12:02:37,338 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 61.39/42.24 [2019-03-28 12:02:37,338 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 61.39/42.24 [2019-03-28 12:02:37,338 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 61.39/42.24 [2019-03-28 12:02:37,338 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 61.39/42.24 [2019-03-28 12:02:37,339 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 61.39/42.24 [2019-03-28 12:02:37,339 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 61.39/42.24 [2019-03-28 12:02:37,348 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 61.39/42.24 [2019-03-28 12:02:37,348 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 61.39/42.24 Termination analysis: LINEAR_WITH_GUESSES 61.39/42.24 Number of strict supporting invariants: 0 61.39/42.24 Number of non-strict supporting invariants: 1 61.39/42.24 Consider only non-deceasing supporting invariants: true 61.39/42.24 Simplify termination arguments: true 61.39/42.24 Simplify supporting invariants: trueOverapproximate stem: false 61.39/42.24 [2019-03-28 12:02:37,349 INFO L339 nArgumentSynthesizer]: Template has degree 0. 61.39/42.24 [2019-03-28 12:02:37,349 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 61.39/42.24 [2019-03-28 12:02:37,349 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 61.39/42.24 [2019-03-28 12:02:37,350 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 61.39/42.24 [2019-03-28 12:02:37,350 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 61.39/42.24 [2019-03-28 12:02:37,350 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 61.39/42.24 [2019-03-28 12:02:37,351 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 61.39/42.24 [2019-03-28 12:02:37,352 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 61.39/42.24 [2019-03-28 12:02:37,352 INFO L497 LassoAnalysis]: Using template '2-nested'. 61.39/42.24 [2019-03-28 12:02:37,353 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 61.39/42.24 Termination analysis: LINEAR_WITH_GUESSES 61.39/42.24 Number of strict supporting invariants: 0 61.39/42.24 Number of non-strict supporting invariants: 1 61.39/42.24 Consider only non-deceasing supporting invariants: true 61.39/42.24 Simplify termination arguments: true 61.39/42.24 Simplify supporting invariants: trueOverapproximate stem: false 61.39/42.24 [2019-03-28 12:02:37,353 INFO L339 nArgumentSynthesizer]: Template has degree 0. 61.39/42.24 [2019-03-28 12:02:37,354 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 61.39/42.24 [2019-03-28 12:02:37,354 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 61.39/42.24 [2019-03-28 12:02:37,354 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 61.39/42.24 [2019-03-28 12:02:37,354 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. 61.39/42.24 [2019-03-28 12:02:37,355 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. 61.39/42.24 [2019-03-28 12:02:37,355 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 61.39/42.24 [2019-03-28 12:02:37,356 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 61.39/42.24 [2019-03-28 12:02:37,357 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 61.39/42.24 Termination analysis: LINEAR_WITH_GUESSES 61.39/42.24 Number of strict supporting invariants: 0 61.39/42.24 Number of non-strict supporting invariants: 1 61.39/42.24 Consider only non-deceasing supporting invariants: true 61.39/42.24 Simplify termination arguments: true 61.39/42.24 Simplify supporting invariants: trueOverapproximate stem: false 61.39/42.24 [2019-03-28 12:02:37,358 INFO L339 nArgumentSynthesizer]: Template has degree 0. 61.39/42.24 [2019-03-28 12:02:37,358 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 61.39/42.24 [2019-03-28 12:02:37,358 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 61.39/42.24 [2019-03-28 12:02:37,358 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 61.39/42.24 [2019-03-28 12:02:37,358 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. 61.39/42.24 [2019-03-28 12:02:37,359 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. 61.39/42.24 [2019-03-28 12:02:37,359 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 61.39/42.24 [2019-03-28 12:02:37,361 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 61.39/42.24 [2019-03-28 12:02:37,361 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 61.39/42.24 Termination analysis: LINEAR_WITH_GUESSES 61.39/42.24 Number of strict supporting invariants: 0 61.39/42.24 Number of non-strict supporting invariants: 1 61.39/42.24 Consider only non-deceasing supporting invariants: true 61.39/42.24 Simplify termination arguments: true 61.39/42.24 Simplify supporting invariants: trueOverapproximate stem: false 61.39/42.24 [2019-03-28 12:02:37,362 INFO L339 nArgumentSynthesizer]: Template has degree 0. 61.39/42.24 [2019-03-28 12:02:37,362 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 61.39/42.24 [2019-03-28 12:02:37,362 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 61.39/42.24 [2019-03-28 12:02:37,362 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 61.39/42.24 [2019-03-28 12:02:37,362 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. 61.39/42.24 [2019-03-28 12:02:37,363 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. 61.39/42.24 [2019-03-28 12:02:37,363 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 61.39/42.24 [2019-03-28 12:02:37,365 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 61.39/42.24 [2019-03-28 12:02:37,366 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 61.39/42.24 Termination analysis: LINEAR_WITH_GUESSES 61.39/42.24 Number of strict supporting invariants: 0 61.39/42.24 Number of non-strict supporting invariants: 1 61.39/42.24 Consider only non-deceasing supporting invariants: true 61.39/42.24 Simplify termination arguments: true 61.39/42.24 Simplify supporting invariants: trueOverapproximate stem: false 61.39/42.24 [2019-03-28 12:02:37,366 INFO L339 nArgumentSynthesizer]: Template has degree 0. 61.39/42.24 [2019-03-28 12:02:37,367 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 61.39/42.24 [2019-03-28 12:02:37,367 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 61.39/42.24 [2019-03-28 12:02:37,367 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 61.39/42.24 [2019-03-28 12:02:37,367 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. 61.39/42.24 [2019-03-28 12:02:37,368 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. 61.39/42.24 [2019-03-28 12:02:37,368 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 61.39/42.24 [2019-03-28 12:02:37,370 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 61.39/42.24 [2019-03-28 12:02:37,371 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 61.39/42.24 Termination analysis: LINEAR_WITH_GUESSES 61.39/42.24 Number of strict supporting invariants: 0 61.39/42.24 Number of non-strict supporting invariants: 1 61.39/42.24 Consider only non-deceasing supporting invariants: true 61.39/42.24 Simplify termination arguments: true 61.39/42.24 Simplify supporting invariants: trueOverapproximate stem: false 61.39/42.24 [2019-03-28 12:02:37,371 INFO L339 nArgumentSynthesizer]: Template has degree 0. 61.39/42.24 [2019-03-28 12:02:37,371 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 61.39/42.24 [2019-03-28 12:02:37,372 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 61.39/42.24 [2019-03-28 12:02:37,372 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 61.39/42.24 [2019-03-28 12:02:37,372 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. 61.39/42.24 [2019-03-28 12:02:37,373 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. 61.39/42.24 [2019-03-28 12:02:37,373 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 61.39/42.24 [2019-03-28 12:02:37,375 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 61.39/42.24 [2019-03-28 12:02:37,375 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 61.39/42.24 Termination analysis: LINEAR_WITH_GUESSES 61.39/42.24 Number of strict supporting invariants: 0 61.39/42.24 Number of non-strict supporting invariants: 1 61.39/42.24 Consider only non-deceasing supporting invariants: true 61.39/42.24 Simplify termination arguments: true 61.39/42.24 Simplify supporting invariants: trueOverapproximate stem: false 61.39/42.24 [2019-03-28 12:02:37,376 INFO L339 nArgumentSynthesizer]: Template has degree 0. 61.39/42.24 [2019-03-28 12:02:37,376 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 61.39/42.24 [2019-03-28 12:02:37,376 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 61.39/42.24 [2019-03-28 12:02:37,376 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 61.39/42.24 [2019-03-28 12:02:37,376 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. 61.39/42.24 [2019-03-28 12:02:37,377 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. 61.39/42.24 [2019-03-28 12:02:37,377 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 61.39/42.24 [2019-03-28 12:02:37,378 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 61.39/42.24 [2019-03-28 12:02:37,379 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 61.39/42.24 Termination analysis: LINEAR_WITH_GUESSES 61.39/42.24 Number of strict supporting invariants: 0 61.39/42.24 Number of non-strict supporting invariants: 1 61.39/42.24 Consider only non-deceasing supporting invariants: true 61.39/42.24 Simplify termination arguments: true 61.39/42.24 Simplify supporting invariants: trueOverapproximate stem: false 61.39/42.24 [2019-03-28 12:02:37,379 INFO L339 nArgumentSynthesizer]: Template has degree 0. 61.39/42.24 [2019-03-28 12:02:37,380 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 61.39/42.24 [2019-03-28 12:02:37,380 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 61.39/42.24 [2019-03-28 12:02:37,380 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 61.39/42.24 [2019-03-28 12:02:37,380 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. 61.39/42.24 [2019-03-28 12:02:37,381 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. 61.39/42.24 [2019-03-28 12:02:37,381 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 61.39/42.24 [2019-03-28 12:02:37,393 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 61.39/42.24 [2019-03-28 12:02:37,406 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. 61.39/42.24 [2019-03-28 12:02:37,407 INFO L444 ModelExtractionUtils]: 1 out of 7 variables were initially zero. Simplification set additionally 2 variables to zero. 61.39/42.24 [2019-03-28 12:02:37,409 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 61.39/42.24 [2019-03-28 12:02:37,409 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 61.39/42.24 [2019-03-28 12:02:37,410 INFO L518 LassoAnalysis]: Proved termination. 61.39/42.24 [2019-03-28 12:02:37,410 INFO L520 LassoAnalysis]: Termination argument consisting of: 61.39/42.24 Ranking function 2-nested ranking function: 61.39/42.24 f0 = 1*p_#in~n + 1*p_#in~r 61.39/42.24 f1 = 1*p_#in~r 61.39/42.24 Supporting invariants [] 61.39/42.24 [2019-03-28 12:02:37,412 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed 61.39/42.24 [2019-03-28 12:02:37,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 61.39/42.24 [2019-03-28 12:02:37,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 61.39/42.24 [2019-03-28 12:02:37,479 INFO L256 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 4 conjunts are in the unsatisfiable core 61.39/42.24 [2019-03-28 12:02:37,481 INFO L279 TraceCheckSpWp]: Computing forward predicates... 61.39/42.24 [2019-03-28 12:02:37,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 61.39/42.24 [2019-03-28 12:02:37,507 INFO L256 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 12 conjunts are in the unsatisfiable core 61.39/42.24 [2019-03-28 12:02:37,508 INFO L279 TraceCheckSpWp]: Computing forward predicates... 61.39/42.24 [2019-03-28 12:02:37,594 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 61.39/42.24 [2019-03-28 12:02:37,872 INFO L98 LoopCannibalizer]: 12 predicates before loop cannibalization 12 predicates after loop cannibalization 61.39/42.24 [2019-03-28 12:02:37,878 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 12 loop predicates 61.39/42.24 [2019-03-28 12:02:37,879 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 11 states. Second operand 4 states. 61.39/42.24 [2019-03-28 12:02:38,339 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 11 states.. Second operand 4 states. Result 118 states and 158 transitions. Complement of second has 31 states. 61.39/42.24 [2019-03-28 12:02:38,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states 61.39/42.24 [2019-03-28 12:02:38,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. 61.39/42.24 [2019-03-28 12:02:38,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 43 transitions. 61.39/42.24 [2019-03-28 12:02:38,346 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 43 transitions. Stem has 2 letters. Loop has 3 letters. 61.39/42.24 [2019-03-28 12:02:38,348 INFO L116 BuchiAccepts]: Finished buchiAccepts. 61.39/42.24 [2019-03-28 12:02:38,348 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 43 transitions. Stem has 5 letters. Loop has 3 letters. 61.39/42.24 [2019-03-28 12:02:38,349 INFO L116 BuchiAccepts]: Finished buchiAccepts. 61.39/42.24 [2019-03-28 12:02:38,349 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 43 transitions. Stem has 2 letters. Loop has 6 letters. 61.39/42.24 [2019-03-28 12:02:38,349 INFO L116 BuchiAccepts]: Finished buchiAccepts. 61.39/42.24 [2019-03-28 12:02:38,357 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 118 states and 158 transitions. 61.39/42.24 [2019-03-28 12:02:38,367 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 61.39/42.24 [2019-03-28 12:02:38,373 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 118 states to 29 states and 34 transitions. 61.39/42.24 [2019-03-28 12:02:38,374 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 61.39/42.24 [2019-03-28 12:02:38,375 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 61.39/42.24 [2019-03-28 12:02:38,375 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 34 transitions. 61.39/42.24 [2019-03-28 12:02:38,375 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 61.39/42.24 [2019-03-28 12:02:38,376 INFO L706 BuchiCegarLoop]: Abstraction has 29 states and 34 transitions. 61.39/42.24 [2019-03-28 12:02:38,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 34 transitions. 61.39/42.24 [2019-03-28 12:02:38,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 12. 61.39/42.24 [2019-03-28 12:02:38,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. 61.39/42.24 [2019-03-28 12:02:38,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 15 transitions. 61.39/42.24 [2019-03-28 12:02:38,407 INFO L729 BuchiCegarLoop]: Abstraction has 12 states and 15 transitions. 61.39/42.24 [2019-03-28 12:02:38,407 INFO L609 BuchiCegarLoop]: Abstraction has 12 states and 15 transitions. 61.39/42.24 [2019-03-28 12:02:38,407 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ 61.39/42.24 [2019-03-28 12:02:38,408 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 15 transitions. 61.39/42.24 [2019-03-28 12:02:38,408 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 61.39/42.24 [2019-03-28 12:02:38,408 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 61.39/42.24 [2019-03-28 12:02:38,409 INFO L119 BuchiIsEmpty]: Starting construction of run 61.39/42.24 [2019-03-28 12:02:38,409 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] 61.39/42.24 [2019-03-28 12:02:38,409 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] 61.39/42.24 [2019-03-28 12:02:38,410 INFO L794 eck$LassoCheckResult]: Stem: 222#ULTIMATE.startENTRY [63] ULTIMATE.startENTRY-->L29: Formula: (and (<= 0 v_ULTIMATE.start_main_~n~0_8) (<= 0 v_ULTIMATE.start_main_~m~0_8) (<= 0 v_ULTIMATE.start_main_~r~0_8)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_6|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_6|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_6|, ULTIMATE.start_main_~m~0=v_ULTIMATE.start_main_~m~0_8, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_6|, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_8, ULTIMATE.start_main_~r~0=v_ULTIMATE.start_main_~r~0_8, ULTIMATE.start_main_#t~ret5=|v_ULTIMATE.start_main_#t~ret5_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#res, ULTIMATE.start_main_~m~0, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~n~0, ULTIMATE.start_main_~r~0, ULTIMATE.start_main_#t~ret5] 217#L29 [44] L29-->pENTRY: Formula: (and (= |v_p_#in~rInParam_3| v_ULTIMATE.start_main_~r~0_7) (= |v_p_#in~mInParam_3| v_ULTIMATE.start_main_~m~0_7) (= |v_p_#in~nInParam_3| v_ULTIMATE.start_main_~n~0_7)) InVars {ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7, ULTIMATE.start_main_~r~0=v_ULTIMATE.start_main_~r~0_7, ULTIMATE.start_main_~m~0=v_ULTIMATE.start_main_~m~0_7} OutVars{p_#in~m=|v_p_#in~mInParam_3|, p_#in~n=|v_p_#in~nInParam_3|, p_#in~r=|v_p_#in~rInParam_3|} AuxVars[] AssignedVars[p_#in~m, p_#in~n, p_#in~r]< 227#pENTRY [43] pENTRY-->L13: Formula: (and (= v_p_~n_1 |v_p_#in~n_1|) (= v_p_~r_1 |v_p_#in~r_1|) (= v_p_~m_1 |v_p_#in~m_1|)) InVars {p_#in~m=|v_p_#in~m_1|, p_#in~n=|v_p_#in~n_1|, p_#in~r=|v_p_#in~r_1|} OutVars{p_~n=v_p_~n_1, p_#in~m=|v_p_#in~m_1|, p_#in~n=|v_p_#in~n_1|, p_~m=v_p_~m_1, p_~r=v_p_~r_1, p_#in~r=|v_p_#in~r_1|} AuxVars[] AssignedVars[p_~n, p_~m, p_~r] 226#L13 [56] L13-->L16: Formula: (>= 0 v_p_~r_4) InVars {p_~r=v_p_~r_4} OutVars{p_~r=v_p_~r_4} AuxVars[] AssignedVars[] 221#L16 61.39/42.24 [2019-03-28 12:02:38,410 INFO L796 eck$LassoCheckResult]: Loop: 221#L16 [36] L16-->L17: Formula: (< 0 v_p_~n_3) InVars {p_~n=v_p_~n_3} OutVars{p_~n=v_p_~n_3} AuxVars[] AssignedVars[] 216#L17 [34] L17-->pENTRY: Formula: (and (= |v_p_#in~rInParam_2| v_p_~m_6) (= |v_p_#in~nInParam_2| (+ v_p_~n_7 (- 1))) (= |v_p_#in~mInParam_2| v_p_~r_7)) InVars {p_~n=v_p_~n_7, p_~m=v_p_~m_6, p_~r=v_p_~r_7} OutVars{p_#in~m=|v_p_#in~mInParam_2|, p_#in~n=|v_p_#in~nInParam_2|, p_#in~r=|v_p_#in~rInParam_2|} AuxVars[] AssignedVars[p_#in~m, p_#in~n, p_#in~r]< 218#pENTRY [43] pENTRY-->L13: Formula: (and (= v_p_~n_1 |v_p_#in~n_1|) (= v_p_~r_1 |v_p_#in~r_1|) (= v_p_~m_1 |v_p_#in~m_1|)) InVars {p_#in~m=|v_p_#in~m_1|, p_#in~n=|v_p_#in~n_1|, p_#in~r=|v_p_#in~r_1|} OutVars{p_~n=v_p_~n_1, p_#in~m=|v_p_#in~m_1|, p_#in~n=|v_p_#in~n_1|, p_~m=v_p_~m_1, p_~r=v_p_~r_1, p_#in~r=|v_p_#in~r_1|} AuxVars[] AssignedVars[p_~n, p_~m, p_~r] 224#L13 [56] L13-->L16: Formula: (>= 0 v_p_~r_4) InVars {p_~r=v_p_~r_4} OutVars{p_~r=v_p_~r_4} AuxVars[] AssignedVars[] 221#L16 61.39/42.24 [2019-03-28 12:02:38,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 61.39/42.24 [2019-03-28 12:02:38,411 INFO L82 PathProgramCache]: Analyzing trace with hash 2844027, now seen corresponding path program 1 times 61.39/42.24 [2019-03-28 12:02:38,411 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 61.39/42.24 [2019-03-28 12:02:38,411 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 61.39/42.24 [2019-03-28 12:02:38,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 61.39/42.24 [2019-03-28 12:02:38,412 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 61.39/42.24 [2019-03-28 12:02:38,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 61.39/42.24 [2019-03-28 12:02:38,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 61.39/42.24 [2019-03-28 12:02:38,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 61.39/42.24 [2019-03-28 12:02:38,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 61.39/42.24 [2019-03-28 12:02:38,421 INFO L82 PathProgramCache]: Analyzing trace with hash 2030060, now seen corresponding path program 1 times 61.39/42.24 [2019-03-28 12:02:38,421 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 61.39/42.24 [2019-03-28 12:02:38,421 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 61.39/42.24 [2019-03-28 12:02:38,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 61.39/42.24 [2019-03-28 12:02:38,422 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 61.39/42.24 [2019-03-28 12:02:38,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 61.39/42.24 [2019-03-28 12:02:38,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 61.39/42.24 [2019-03-28 12:02:38,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 61.39/42.24 [2019-03-28 12:02:38,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 61.39/42.24 [2019-03-28 12:02:38,431 INFO L82 PathProgramCache]: Analyzing trace with hash -2000219546, now seen corresponding path program 1 times 61.39/42.25 [2019-03-28 12:02:38,431 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 61.39/42.25 [2019-03-28 12:02:38,431 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 61.39/42.25 [2019-03-28 12:02:38,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 61.39/42.25 [2019-03-28 12:02:38,432 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 61.39/42.25 [2019-03-28 12:02:38,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 61.39/42.25 [2019-03-28 12:02:38,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 61.39/42.25 [2019-03-28 12:02:38,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 61.39/42.25 [2019-03-28 12:02:38,529 INFO L216 LassoAnalysis]: Preferences: 61.39/42.25 [2019-03-28 12:02:38,529 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 61.39/42.25 [2019-03-28 12:02:38,530 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 61.39/42.25 [2019-03-28 12:02:38,530 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 61.39/42.25 [2019-03-28 12:02:38,530 INFO L127 ssoRankerPreferences]: Use exernal solver: true 61.39/42.25 [2019-03-28 12:02:38,530 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 61.39/42.25 [2019-03-28 12:02:38,530 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 61.39/42.25 [2019-03-28 12:02:38,530 INFO L130 ssoRankerPreferences]: Path of dumped script: 61.39/42.25 [2019-03-28 12:02:38,530 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration2_Loop 61.39/42.25 [2019-03-28 12:02:38,530 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 61.39/42.25 [2019-03-28 12:02:38,531 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 61.39/42.25 [2019-03-28 12:02:38,532 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 61.39/42.25 [2019-03-28 12:02:38,535 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 61.39/42.25 [2019-03-28 12:02:38,538 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 61.39/42.25 [2019-03-28 12:02:38,540 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 61.39/42.25 [2019-03-28 12:02:38,546 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 61.39/42.25 [2019-03-28 12:02:38,607 INFO L300 LassoAnalysis]: Preprocessing complete. 61.39/42.25 [2019-03-28 12:02:38,608 INFO L412 LassoAnalysis]: Checking for nontermination... 61.39/42.25 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 61.39/42.25 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 61.39/42.25 Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 61.39/42.25 [2019-03-28 12:02:38,611 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 61.39/42.25 [2019-03-28 12:02:38,611 INFO L163 nArgumentSynthesizer]: Using integer mode. 61.39/42.25 [2019-03-28 12:02:38,615 INFO L445 LassoAnalysis]: Proved nontermination for one component. 61.39/42.25 [2019-03-28 12:02:38,615 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {p_#res=0} Honda state: {p_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 61.39/42.25 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 61.39/42.25 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 61.39/42.25 Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 61.39/42.25 [2019-03-28 12:02:38,642 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 61.39/42.25 [2019-03-28 12:02:38,642 INFO L163 nArgumentSynthesizer]: Using integer mode. 61.39/42.25 [2019-03-28 12:02:38,645 INFO L445 LassoAnalysis]: Proved nontermination for one component. 61.39/42.25 [2019-03-28 12:02:38,645 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {p_#t~ret0=0} Honda state: {p_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 61.39/42.25 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 61.39/42.25 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 61.39/42.25 Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 61.39/42.25 [2019-03-28 12:02:38,672 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 61.39/42.25 [2019-03-28 12:02:38,672 INFO L163 nArgumentSynthesizer]: Using integer mode. 61.39/42.25 [2019-03-28 12:02:38,675 INFO L445 LassoAnalysis]: Proved nontermination for one component. 61.39/42.25 [2019-03-28 12:02:38,675 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {p_#t~ret1=0} Honda state: {p_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 61.39/42.25 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 61.39/42.25 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 61.39/42.25 Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 61.39/42.25 [2019-03-28 12:02:38,702 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 61.39/42.25 [2019-03-28 12:02:38,702 INFO L163 nArgumentSynthesizer]: Using integer mode. 61.39/42.25 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 61.39/42.25 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 61.39/42.25 Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 61.39/42.25 [2019-03-28 12:02:38,735 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 61.39/42.25 [2019-03-28 12:02:38,735 INFO L163 nArgumentSynthesizer]: Using integer mode. 61.39/42.25 [2019-03-28 12:02:39,269 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. 61.39/42.25 [2019-03-28 12:02:39,271 INFO L216 LassoAnalysis]: Preferences: 61.39/42.25 [2019-03-28 12:02:39,283 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 61.39/42.25 [2019-03-28 12:02:39,283 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 61.39/42.25 [2019-03-28 12:02:39,283 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 61.39/42.25 [2019-03-28 12:02:39,284 INFO L127 ssoRankerPreferences]: Use exernal solver: false 61.39/42.25 [2019-03-28 12:02:39,284 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 61.39/42.25 [2019-03-28 12:02:39,284 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 61.39/42.25 [2019-03-28 12:02:39,284 INFO L130 ssoRankerPreferences]: Path of dumped script: 61.39/42.25 [2019-03-28 12:02:39,284 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration2_Loop 61.39/42.25 [2019-03-28 12:02:39,284 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 61.39/42.25 [2019-03-28 12:02:39,284 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 61.39/42.25 [2019-03-28 12:02:39,286 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 61.39/42.25 [2019-03-28 12:02:39,288 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 61.39/42.25 [2019-03-28 12:02:39,290 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 61.39/42.25 [2019-03-28 12:02:39,296 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 61.39/42.25 [2019-03-28 12:02:39,298 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 61.39/42.25 [2019-03-28 12:02:39,357 INFO L300 LassoAnalysis]: Preprocessing complete. 61.39/42.25 [2019-03-28 12:02:39,357 INFO L497 LassoAnalysis]: Using template 'affine'. 61.39/42.25 [2019-03-28 12:02:39,357 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 61.39/42.25 Termination analysis: LINEAR_WITH_GUESSES 61.39/42.25 Number of strict supporting invariants: 0 61.39/42.25 Number of non-strict supporting invariants: 1 61.39/42.25 Consider only non-deceasing supporting invariants: true 61.39/42.25 Simplify termination arguments: true 61.39/42.25 Simplify supporting invariants: trueOverapproximate stem: false 61.39/42.25 [2019-03-28 12:02:39,358 INFO L339 nArgumentSynthesizer]: Template has degree 0. 61.39/42.25 [2019-03-28 12:02:39,358 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 61.39/42.25 [2019-03-28 12:02:39,359 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 61.39/42.25 [2019-03-28 12:02:39,359 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 61.39/42.25 [2019-03-28 12:02:39,359 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 61.39/42.25 [2019-03-28 12:02:39,359 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 61.39/42.25 [2019-03-28 12:02:39,360 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 61.39/42.25 [2019-03-28 12:02:39,361 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 61.39/42.25 [2019-03-28 12:02:39,361 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 61.39/42.25 Termination analysis: LINEAR_WITH_GUESSES 61.39/42.25 Number of strict supporting invariants: 0 61.39/42.25 Number of non-strict supporting invariants: 1 61.39/42.25 Consider only non-deceasing supporting invariants: true 61.39/42.25 Simplify termination arguments: true 61.39/42.25 Simplify supporting invariants: trueOverapproximate stem: false 61.39/42.25 [2019-03-28 12:02:39,362 INFO L339 nArgumentSynthesizer]: Template has degree 0. 61.39/42.25 [2019-03-28 12:02:39,362 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 61.39/42.25 [2019-03-28 12:02:39,362 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 61.39/42.25 [2019-03-28 12:02:39,362 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 61.39/42.25 [2019-03-28 12:02:39,362 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 61.39/42.25 [2019-03-28 12:02:39,363 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 61.39/42.25 [2019-03-28 12:02:39,363 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 61.39/42.25 [2019-03-28 12:02:39,364 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 61.39/42.25 [2019-03-28 12:02:39,364 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 61.39/42.25 Termination analysis: LINEAR_WITH_GUESSES 61.39/42.25 Number of strict supporting invariants: 0 61.39/42.25 Number of non-strict supporting invariants: 1 61.39/42.25 Consider only non-deceasing supporting invariants: true 61.39/42.25 Simplify termination arguments: true 61.39/42.25 Simplify supporting invariants: trueOverapproximate stem: false 61.39/42.25 [2019-03-28 12:02:39,365 INFO L339 nArgumentSynthesizer]: Template has degree 0. 61.39/42.25 [2019-03-28 12:02:39,365 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 61.39/42.25 [2019-03-28 12:02:39,365 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 61.39/42.25 [2019-03-28 12:02:39,365 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 61.39/42.25 [2019-03-28 12:02:39,365 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 61.39/42.25 [2019-03-28 12:02:39,366 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 61.39/42.25 [2019-03-28 12:02:39,366 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 61.39/42.25 [2019-03-28 12:02:39,371 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 61.39/42.25 [2019-03-28 12:02:39,373 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 61.39/42.25 [2019-03-28 12:02:39,373 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. 61.39/42.25 [2019-03-28 12:02:39,374 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 61.39/42.25 [2019-03-28 12:02:39,374 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 61.39/42.25 [2019-03-28 12:02:39,374 INFO L518 LassoAnalysis]: Proved termination. 61.39/42.25 [2019-03-28 12:02:39,374 INFO L520 LassoAnalysis]: Termination argument consisting of: 61.39/42.25 Ranking function f(p_~n) = 1*p_~n 61.39/42.25 Supporting invariants [] 61.39/42.25 [2019-03-28 12:02:39,375 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed 61.39/42.25 [2019-03-28 12:02:39,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 61.39/42.25 [2019-03-28 12:02:39,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 61.39/42.25 [2019-03-28 12:02:39,399 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 4 conjunts are in the unsatisfiable core 61.39/42.25 [2019-03-28 12:02:39,399 INFO L279 TraceCheckSpWp]: Computing forward predicates... 61.39/42.25 [2019-03-28 12:02:39,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 61.39/42.25 [2019-03-28 12:02:39,413 INFO L256 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 7 conjunts are in the unsatisfiable core 61.39/42.25 [2019-03-28 12:02:39,414 INFO L279 TraceCheckSpWp]: Computing forward predicates... 61.39/42.25 [2019-03-28 12:02:39,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 61.39/42.25 [2019-03-28 12:02:39,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 61.39/42.25 [2019-03-28 12:02:39,486 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 61.39/42.25 [2019-03-28 12:02:39,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 61.39/42.25 [2019-03-28 12:02:39,494 INFO L256 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 7 conjunts are in the unsatisfiable core 61.39/42.25 [2019-03-28 12:02:39,495 INFO L279 TraceCheckSpWp]: Computing forward predicates... 61.39/42.25 [2019-03-28 12:02:39,503 INFO L98 LoopCannibalizer]: 5 predicates before loop cannibalization 5 predicates after loop cannibalization 61.39/42.25 [2019-03-28 12:02:39,503 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 61.39/42.25 [2019-03-28 12:02:39,503 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 12 states and 15 transitions. cyclomatic complexity: 5 Second operand 5 states. 61.39/42.25 [2019-03-28 12:02:39,534 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 12 states and 15 transitions. cyclomatic complexity: 5. Second operand 5 states. Result 44 states and 57 transitions. Complement of second has 36 states. 61.39/42.25 [2019-03-28 12:02:39,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states 61.39/42.25 [2019-03-28 12:02:39,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. 61.39/42.25 [2019-03-28 12:02:39,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 15 transitions. 61.39/42.25 [2019-03-28 12:02:39,536 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 15 transitions. Stem has 4 letters. Loop has 4 letters. 61.39/42.25 [2019-03-28 12:02:39,537 INFO L116 BuchiAccepts]: Finished buchiAccepts. 61.39/42.25 [2019-03-28 12:02:39,537 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 15 transitions. Stem has 8 letters. Loop has 4 letters. 61.39/42.25 [2019-03-28 12:02:39,538 INFO L116 BuchiAccepts]: Finished buchiAccepts. 61.39/42.25 [2019-03-28 12:02:39,538 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 15 transitions. Stem has 4 letters. Loop has 8 letters. 61.39/42.25 [2019-03-28 12:02:39,539 INFO L116 BuchiAccepts]: Finished buchiAccepts. 61.39/42.25 [2019-03-28 12:02:39,540 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 57 transitions. 61.39/42.25 [2019-03-28 12:02:39,543 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 61.39/42.25 [2019-03-28 12:02:39,544 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 22 states and 27 transitions. 61.39/42.25 [2019-03-28 12:02:39,544 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 61.39/42.25 [2019-03-28 12:02:39,544 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 61.39/42.25 [2019-03-28 12:02:39,544 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 27 transitions. 61.39/42.25 [2019-03-28 12:02:39,544 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 61.39/42.25 [2019-03-28 12:02:39,544 INFO L706 BuchiCegarLoop]: Abstraction has 22 states and 27 transitions. 61.39/42.25 [2019-03-28 12:02:39,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 27 transitions. 61.39/42.25 [2019-03-28 12:02:39,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 15. 61.39/42.25 [2019-03-28 12:02:39,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. 61.39/42.25 [2019-03-28 12:02:39,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 19 transitions. 61.39/42.25 [2019-03-28 12:02:39,547 INFO L729 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. 61.39/42.25 [2019-03-28 12:02:39,547 INFO L609 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. 61.39/42.25 [2019-03-28 12:02:39,547 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ 61.39/42.25 [2019-03-28 12:02:39,547 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 19 transitions. 61.39/42.25 [2019-03-28 12:02:39,548 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 61.39/42.25 [2019-03-28 12:02:39,548 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 61.39/42.25 [2019-03-28 12:02:39,548 INFO L119 BuchiIsEmpty]: Starting construction of run 61.39/42.25 [2019-03-28 12:02:39,548 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] 61.39/42.25 [2019-03-28 12:02:39,548 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1] 61.39/42.25 [2019-03-28 12:02:39,549 INFO L794 eck$LassoCheckResult]: Stem: 372#ULTIMATE.startENTRY [63] ULTIMATE.startENTRY-->L29: Formula: (and (<= 0 v_ULTIMATE.start_main_~n~0_8) (<= 0 v_ULTIMATE.start_main_~m~0_8) (<= 0 v_ULTIMATE.start_main_~r~0_8)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_6|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_6|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_6|, ULTIMATE.start_main_~m~0=v_ULTIMATE.start_main_~m~0_8, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_6|, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_8, ULTIMATE.start_main_~r~0=v_ULTIMATE.start_main_~r~0_8, ULTIMATE.start_main_#t~ret5=|v_ULTIMATE.start_main_#t~ret5_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#res, ULTIMATE.start_main_~m~0, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~n~0, ULTIMATE.start_main_~r~0, ULTIMATE.start_main_#t~ret5] 366#L29 [44] L29-->pENTRY: Formula: (and (= |v_p_#in~rInParam_3| v_ULTIMATE.start_main_~r~0_7) (= |v_p_#in~mInParam_3| v_ULTIMATE.start_main_~m~0_7) (= |v_p_#in~nInParam_3| v_ULTIMATE.start_main_~n~0_7)) InVars {ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7, ULTIMATE.start_main_~r~0=v_ULTIMATE.start_main_~r~0_7, ULTIMATE.start_main_~m~0=v_ULTIMATE.start_main_~m~0_7} OutVars{p_#in~m=|v_p_#in~mInParam_3|, p_#in~n=|v_p_#in~nInParam_3|, p_#in~r=|v_p_#in~rInParam_3|} AuxVars[] AssignedVars[p_#in~m, p_#in~n, p_#in~r]< 377#pENTRY [43] pENTRY-->L13: Formula: (and (= v_p_~n_1 |v_p_#in~n_1|) (= v_p_~r_1 |v_p_#in~r_1|) (= v_p_~m_1 |v_p_#in~m_1|)) InVars {p_#in~m=|v_p_#in~m_1|, p_#in~n=|v_p_#in~n_1|, p_#in~r=|v_p_#in~r_1|} OutVars{p_~n=v_p_~n_1, p_#in~m=|v_p_#in~m_1|, p_#in~n=|v_p_#in~n_1|, p_~m=v_p_~m_1, p_~r=v_p_~r_1, p_#in~r=|v_p_#in~r_1|} AuxVars[] AssignedVars[p_~n, p_~m, p_~r] 378#L13 [56] L13-->L16: Formula: (>= 0 v_p_~r_4) InVars {p_~r=v_p_~r_4} OutVars{p_~r=v_p_~r_4} AuxVars[] AssignedVars[] 370#L16 61.39/42.25 [2019-03-28 12:02:39,549 INFO L796 eck$LassoCheckResult]: Loop: 370#L16 [36] L16-->L17: Formula: (< 0 v_p_~n_3) InVars {p_~n=v_p_~n_3} OutVars{p_~n=v_p_~n_3} AuxVars[] AssignedVars[] 365#L17 [34] L17-->pENTRY: Formula: (and (= |v_p_#in~rInParam_2| v_p_~m_6) (= |v_p_#in~nInParam_2| (+ v_p_~n_7 (- 1))) (= |v_p_#in~mInParam_2| v_p_~r_7)) InVars {p_~n=v_p_~n_7, p_~m=v_p_~m_6, p_~r=v_p_~r_7} OutVars{p_#in~m=|v_p_#in~mInParam_2|, p_#in~n=|v_p_#in~nInParam_2|, p_#in~r=|v_p_#in~rInParam_2|} AuxVars[] AssignedVars[p_#in~m, p_#in~n, p_#in~r]< 369#pENTRY [43] pENTRY-->L13: Formula: (and (= v_p_~n_1 |v_p_#in~n_1|) (= v_p_~r_1 |v_p_#in~r_1|) (= v_p_~m_1 |v_p_#in~m_1|)) InVars {p_#in~m=|v_p_#in~m_1|, p_#in~n=|v_p_#in~n_1|, p_#in~r=|v_p_#in~r_1|} OutVars{p_~n=v_p_~n_1, p_#in~m=|v_p_#in~m_1|, p_#in~n=|v_p_#in~n_1|, p_~m=v_p_~m_1, p_~r=v_p_~r_1, p_#in~r=|v_p_#in~r_1|} AuxVars[] AssignedVars[p_~n, p_~m, p_~r] 376#L13 [45] L13-->L14: Formula: (< 0 v_p_~r_2) InVars {p_~r=v_p_~r_2} OutVars{p_~r=v_p_~r_2} AuxVars[] AssignedVars[] 367#L14 [42] L14-->pENTRY: Formula: (and (= |v_p_#in~rInParam_1| v_p_~n_6) (= |v_p_#in~mInParam_1| v_p_~m_5) (= |v_p_#in~nInParam_1| (+ v_p_~r_6 (- 1)))) InVars {p_~n=v_p_~n_6, p_~m=v_p_~m_5, p_~r=v_p_~r_6} OutVars{p_#in~m=|v_p_#in~mInParam_1|, p_#in~n=|v_p_#in~nInParam_1|, p_#in~r=|v_p_#in~rInParam_1|} AuxVars[] AssignedVars[p_#in~m, p_#in~n, p_#in~r]< 373#pENTRY [43] pENTRY-->L13: Formula: (and (= v_p_~n_1 |v_p_#in~n_1|) (= v_p_~r_1 |v_p_#in~r_1|) (= v_p_~m_1 |v_p_#in~m_1|)) InVars {p_#in~m=|v_p_#in~m_1|, p_#in~n=|v_p_#in~n_1|, p_#in~r=|v_p_#in~r_1|} OutVars{p_~n=v_p_~n_1, p_#in~m=|v_p_#in~m_1|, p_#in~n=|v_p_#in~n_1|, p_~m=v_p_~m_1, p_~r=v_p_~r_1, p_#in~r=|v_p_#in~r_1|} AuxVars[] AssignedVars[p_~n, p_~m, p_~r] 375#L13 [56] L13-->L16: Formula: (>= 0 v_p_~r_4) InVars {p_~r=v_p_~r_4} OutVars{p_~r=v_p_~r_4} AuxVars[] AssignedVars[] 370#L16 61.39/42.25 [2019-03-28 12:02:39,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 61.39/42.25 [2019-03-28 12:02:39,549 INFO L82 PathProgramCache]: Analyzing trace with hash 2844027, now seen corresponding path program 2 times 61.39/42.25 [2019-03-28 12:02:39,549 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 61.39/42.25 [2019-03-28 12:02:39,550 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 61.39/42.25 [2019-03-28 12:02:39,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 61.39/42.25 [2019-03-28 12:02:39,551 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 61.39/42.25 [2019-03-28 12:02:39,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 61.39/42.25 [2019-03-28 12:02:39,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 61.39/42.25 [2019-03-28 12:02:39,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 61.39/42.25 [2019-03-28 12:02:39,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 61.39/42.25 [2019-03-28 12:02:39,558 INFO L82 PathProgramCache]: Analyzing trace with hash 347689366, now seen corresponding path program 1 times 61.39/42.25 [2019-03-28 12:02:39,558 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 61.39/42.25 [2019-03-28 12:02:39,558 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 61.39/42.25 [2019-03-28 12:02:39,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 61.39/42.25 [2019-03-28 12:02:39,559 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 61.39/42.25 [2019-03-28 12:02:39,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 61.39/42.25 [2019-03-28 12:02:39,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 61.39/42.25 [2019-03-28 12:02:39,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 61.39/42.25 [2019-03-28 12:02:39,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 61.39/42.25 [2019-03-28 12:02:39,569 INFO L82 PathProgramCache]: Analyzing trace with hash -164516132, now seen corresponding path program 1 times 61.39/42.25 [2019-03-28 12:02:39,569 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 61.39/42.25 [2019-03-28 12:02:39,569 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 61.39/42.25 [2019-03-28 12:02:39,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 61.39/42.25 [2019-03-28 12:02:39,570 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 61.39/42.25 [2019-03-28 12:02:39,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 61.39/42.25 [2019-03-28 12:02:39,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 61.39/42.25 [2019-03-28 12:02:39,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 61.39/42.25 [2019-03-28 12:02:39,726 INFO L216 LassoAnalysis]: Preferences: 61.39/42.25 [2019-03-28 12:02:39,726 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 61.39/42.25 [2019-03-28 12:02:39,726 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 61.39/42.25 [2019-03-28 12:02:39,726 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 61.39/42.25 [2019-03-28 12:02:39,727 INFO L127 ssoRankerPreferences]: Use exernal solver: true 61.39/42.25 [2019-03-28 12:02:39,727 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 61.39/42.25 [2019-03-28 12:02:39,727 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 61.39/42.25 [2019-03-28 12:02:39,727 INFO L130 ssoRankerPreferences]: Path of dumped script: 61.39/42.25 [2019-03-28 12:02:39,727 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration3_Loop 61.39/42.25 [2019-03-28 12:02:39,727 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 61.39/42.25 [2019-03-28 12:02:39,727 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 61.39/42.25 [2019-03-28 12:02:39,729 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 61.39/42.25 [2019-03-28 12:02:39,731 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 61.39/42.25 [2019-03-28 12:02:39,747 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 61.39/42.25 [2019-03-28 12:02:39,749 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 61.39/42.25 [2019-03-28 12:02:39,826 INFO L300 LassoAnalysis]: Preprocessing complete. 61.39/42.25 [2019-03-28 12:02:39,826 INFO L412 LassoAnalysis]: Checking for nontermination... 61.39/42.25 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 61.39/42.25 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 61.39/42.25 Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 61.39/42.25 [2019-03-28 12:02:39,829 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 61.39/42.25 [2019-03-28 12:02:39,829 INFO L163 nArgumentSynthesizer]: Using integer mode. 61.39/42.25 [2019-03-28 12:02:39,832 INFO L445 LassoAnalysis]: Proved nontermination for one component. 61.39/42.25 [2019-03-28 12:02:39,832 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {p_#t~ret1=0} Honda state: {p_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 61.39/42.25 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 61.39/42.25 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 61.39/42.25 Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 61.39/42.25 [2019-03-28 12:02:39,858 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 61.39/42.25 [2019-03-28 12:02:39,859 INFO L163 nArgumentSynthesizer]: Using integer mode. 61.39/42.25 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 61.39/42.25 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 61.39/42.25 Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 61.39/42.25 [2019-03-28 12:02:39,893 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 61.39/42.25 [2019-03-28 12:02:39,894 INFO L163 nArgumentSynthesizer]: Using integer mode. 61.39/42.25 [2019-03-28 12:02:46,140 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. 61.39/42.25 [2019-03-28 12:02:46,144 INFO L216 LassoAnalysis]: Preferences: 61.39/42.25 [2019-03-28 12:02:46,144 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 61.39/42.25 [2019-03-28 12:02:46,144 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 61.39/42.25 [2019-03-28 12:02:46,144 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 61.39/42.25 [2019-03-28 12:02:46,145 INFO L127 ssoRankerPreferences]: Use exernal solver: false 61.39/42.25 [2019-03-28 12:02:46,145 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 61.39/42.25 [2019-03-28 12:02:46,145 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 61.39/42.25 [2019-03-28 12:02:46,145 INFO L130 ssoRankerPreferences]: Path of dumped script: 61.39/42.25 [2019-03-28 12:02:46,145 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration3_Loop 61.39/42.25 [2019-03-28 12:02:46,145 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 61.39/42.25 [2019-03-28 12:02:46,145 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 61.39/42.25 [2019-03-28 12:02:46,147 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 61.39/42.25 [2019-03-28 12:02:46,167 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 61.39/42.25 [2019-03-28 12:02:46,169 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 61.39/42.25 [2019-03-28 12:02:46,171 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 61.39/42.25 [2019-03-28 12:02:46,252 INFO L300 LassoAnalysis]: Preprocessing complete. 61.39/42.25 [2019-03-28 12:02:46,252 INFO L497 LassoAnalysis]: Using template 'affine'. 61.39/42.25 [2019-03-28 12:02:46,252 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 61.39/42.25 Termination analysis: LINEAR_WITH_GUESSES 61.39/42.25 Number of strict supporting invariants: 0 61.39/42.25 Number of non-strict supporting invariants: 1 61.39/42.25 Consider only non-deceasing supporting invariants: true 61.39/42.25 Simplify termination arguments: true 61.39/42.25 Simplify supporting invariants: trueOverapproximate stem: false 61.39/42.25 [2019-03-28 12:02:46,253 INFO L339 nArgumentSynthesizer]: Template has degree 0. 61.39/42.25 [2019-03-28 12:02:46,253 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 61.39/42.25 [2019-03-28 12:02:46,254 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 61.39/42.25 [2019-03-28 12:02:46,254 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 61.39/42.25 [2019-03-28 12:02:46,254 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 61.39/42.25 [2019-03-28 12:02:46,255 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 61.39/42.25 [2019-03-28 12:02:46,255 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 61.39/42.25 [2019-03-28 12:02:46,263 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 61.39/42.25 [2019-03-28 12:02:46,264 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 61.39/42.25 Termination analysis: LINEAR_WITH_GUESSES 61.39/42.25 Number of strict supporting invariants: 0 61.39/42.25 Number of non-strict supporting invariants: 1 61.39/42.25 Consider only non-deceasing supporting invariants: true 61.39/42.25 Simplify termination arguments: true 61.39/42.25 Simplify supporting invariants: trueOverapproximate stem: false 61.39/42.25 [2019-03-28 12:02:46,264 INFO L339 nArgumentSynthesizer]: Template has degree 0. 61.39/42.25 [2019-03-28 12:02:46,264 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 61.39/42.25 [2019-03-28 12:02:46,265 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 61.39/42.25 [2019-03-28 12:02:46,265 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 61.39/42.25 [2019-03-28 12:02:46,265 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 61.39/42.25 [2019-03-28 12:02:46,265 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 61.39/42.25 [2019-03-28 12:02:46,265 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 61.39/42.25 [2019-03-28 12:02:46,266 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 61.39/42.25 [2019-03-28 12:02:46,266 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 61.39/42.25 Termination analysis: LINEAR_WITH_GUESSES 61.39/42.25 Number of strict supporting invariants: 0 61.39/42.25 Number of non-strict supporting invariants: 1 61.39/42.25 Consider only non-deceasing supporting invariants: true 61.39/42.25 Simplify termination arguments: true 61.39/42.25 Simplify supporting invariants: trueOverapproximate stem: false 61.39/42.25 [2019-03-28 12:02:46,267 INFO L339 nArgumentSynthesizer]: Template has degree 0. 61.39/42.25 [2019-03-28 12:02:46,267 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 61.39/42.25 [2019-03-28 12:02:46,267 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 61.39/42.25 [2019-03-28 12:02:46,267 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 61.39/42.25 [2019-03-28 12:02:46,267 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 61.39/42.25 [2019-03-28 12:02:46,268 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 61.39/42.25 [2019-03-28 12:02:46,268 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 61.39/42.25 [2019-03-28 12:02:46,269 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 61.39/42.25 [2019-03-28 12:02:46,269 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 61.39/42.25 Termination analysis: LINEAR_WITH_GUESSES 61.39/42.25 Number of strict supporting invariants: 0 61.39/42.25 Number of non-strict supporting invariants: 1 61.39/42.25 Consider only non-deceasing supporting invariants: true 61.39/42.25 Simplify termination arguments: true 61.39/42.25 Simplify supporting invariants: trueOverapproximate stem: false 61.39/42.25 [2019-03-28 12:02:46,269 INFO L339 nArgumentSynthesizer]: Template has degree 0. 61.39/42.25 [2019-03-28 12:02:46,270 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 61.39/42.25 [2019-03-28 12:02:46,270 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 61.39/42.25 [2019-03-28 12:02:46,270 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 61.39/42.25 [2019-03-28 12:02:46,270 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 61.39/42.25 [2019-03-28 12:02:46,270 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 61.39/42.25 [2019-03-28 12:02:46,271 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 61.39/42.25 [2019-03-28 12:02:46,271 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 61.39/42.25 [2019-03-28 12:02:46,271 INFO L497 LassoAnalysis]: Using template '2-nested'. 61.39/42.25 [2019-03-28 12:02:46,272 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 61.39/42.25 Termination analysis: LINEAR_WITH_GUESSES 61.39/42.25 Number of strict supporting invariants: 0 61.39/42.25 Number of non-strict supporting invariants: 1 61.39/42.25 Consider only non-deceasing supporting invariants: true 61.39/42.25 Simplify termination arguments: true 61.39/42.25 Simplify supporting invariants: trueOverapproximate stem: false 61.39/42.25 [2019-03-28 12:02:46,272 INFO L339 nArgumentSynthesizer]: Template has degree 0. 61.39/42.25 [2019-03-28 12:02:46,272 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 61.39/42.25 [2019-03-28 12:02:46,273 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 61.39/42.25 [2019-03-28 12:02:46,273 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 61.39/42.25 [2019-03-28 12:02:46,273 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. 61.39/42.25 [2019-03-28 12:02:46,274 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. 61.39/42.25 [2019-03-28 12:02:46,275 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 61.39/42.25 [2019-03-28 12:02:46,289 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 61.39/42.25 [2019-03-28 12:02:46,312 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. 61.39/42.25 [2019-03-28 12:02:46,312 INFO L444 ModelExtractionUtils]: 7 out of 15 variables were initially zero. Simplification set additionally 4 variables to zero. 61.39/42.25 [2019-03-28 12:02:46,313 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 61.39/42.25 [2019-03-28 12:02:46,313 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 61.39/42.25 [2019-03-28 12:02:46,313 INFO L518 LassoAnalysis]: Proved termination. 61.39/42.25 [2019-03-28 12:02:46,313 INFO L520 LassoAnalysis]: Termination argument consisting of: 61.39/42.25 Ranking function 2-nested ranking function: 61.39/42.25 f0 = 1*p_~m + 1*p_~r 61.39/42.25 f1 = 1*p_~m 61.39/42.25 Supporting invariants [] 61.39/42.25 [2019-03-28 12:02:46,314 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed 61.39/42.25 [2019-03-28 12:02:46,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 61.39/42.25 [2019-03-28 12:02:46,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 61.39/42.25 [2019-03-28 12:02:46,347 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 4 conjunts are in the unsatisfiable core 61.39/42.25 [2019-03-28 12:02:46,348 INFO L279 TraceCheckSpWp]: Computing forward predicates... 61.39/42.25 [2019-03-28 12:02:46,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 61.39/42.25 [2019-03-28 12:02:46,367 INFO L256 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 19 conjunts are in the unsatisfiable core 61.39/42.25 [2019-03-28 12:02:46,368 INFO L279 TraceCheckSpWp]: Computing forward predicates... 61.39/42.25 [2019-03-28 12:02:46,511 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 61.39/42.25 [2019-03-28 12:02:47,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 61.39/42.25 [2019-03-28 12:02:47,114 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 61.39/42.25 [2019-03-28 12:02:47,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 61.39/42.25 [2019-03-28 12:02:47,136 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 61.39/42.25 [2019-03-28 12:02:47,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 61.39/42.25 [2019-03-28 12:02:47,155 INFO L256 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 22 conjunts are in the unsatisfiable core 61.39/42.25 [2019-03-28 12:02:47,157 INFO L279 TraceCheckSpWp]: Computing forward predicates... 61.39/42.25 [2019-03-28 12:02:48,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 61.39/42.25 [2019-03-28 12:02:48,565 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 61.39/42.25 [2019-03-28 12:02:48,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 61.39/42.25 [2019-03-28 12:02:48,579 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 61.39/42.25 [2019-03-28 12:02:48,579 INFO L98 LoopCannibalizer]: 25 predicates before loop cannibalization 54 predicates after loop cannibalization 61.39/42.25 [2019-03-28 12:02:48,580 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 54 loop predicates 61.39/42.25 [2019-03-28 12:02:48,580 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 15 states and 19 transitions. cyclomatic complexity: 6 Second operand 7 states. 61.39/42.25 [2019-03-28 12:02:49,155 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 28 61.39/42.25 [2019-03-28 12:02:49,555 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 29 61.39/42.25 [2019-03-28 12:02:50,042 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 28 61.39/42.25 [2019-03-28 12:02:50,848 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 28 61.39/42.25 [2019-03-28 12:02:51,586 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 28 61.39/42.25 [2019-03-28 12:02:51,826 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 35 61.39/42.25 [2019-03-28 12:02:52,257 WARN L188 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 40 61.39/42.25 [2019-03-28 12:02:52,655 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 25 61.39/42.25 [2019-03-28 12:02:52,957 WARN L188 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 41 61.39/42.25 [2019-03-28 12:02:53,433 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 34 61.39/42.25 [2019-03-28 12:02:53,662 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 29 61.39/42.25 [2019-03-28 12:02:53,914 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 34 61.39/42.25 [2019-03-28 12:02:54,136 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 30 61.39/42.25 [2019-03-28 12:02:55,237 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 33 61.39/42.25 [2019-03-28 12:02:55,457 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 30 61.39/42.25 [2019-03-28 12:02:55,745 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 33 61.39/42.25 [2019-03-28 12:02:55,995 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 36 61.39/42.25 [2019-03-28 12:02:56,412 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 24 61.39/42.25 [2019-03-28 12:02:56,721 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 24 61.39/42.25 [2019-03-28 12:02:56,971 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 29 61.39/42.25 [2019-03-28 12:02:57,692 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 15 states and 19 transitions. cyclomatic complexity: 6. Second operand 7 states. Result 5242 states and 7057 transitions. Complement of second has 4392 states. 61.39/42.25 [2019-03-28 12:02:57,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 43 states 1 stem states 39 non-accepting loop states 3 accepting loop states 61.39/42.25 [2019-03-28 12:02:57,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. 61.39/42.25 [2019-03-28 12:02:57,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 75 transitions. 61.39/42.25 [2019-03-28 12:02:57,694 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 75 transitions. Stem has 4 letters. Loop has 7 letters. 61.39/42.25 [2019-03-28 12:02:57,695 INFO L116 BuchiAccepts]: Finished buchiAccepts. 61.39/42.25 [2019-03-28 12:02:57,695 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 75 transitions. Stem has 11 letters. Loop has 7 letters. 61.39/42.25 [2019-03-28 12:02:57,696 INFO L116 BuchiAccepts]: Finished buchiAccepts. 61.39/42.25 [2019-03-28 12:02:57,696 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 75 transitions. Stem has 4 letters. Loop has 14 letters. 61.39/42.25 [2019-03-28 12:02:57,696 INFO L116 BuchiAccepts]: Finished buchiAccepts. 61.39/42.25 [2019-03-28 12:02:57,700 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 5242 states and 7057 transitions. 61.39/42.25 [2019-03-28 12:02:57,778 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 96 61.39/42.25 [2019-03-28 12:02:57,789 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 5242 states to 643 states and 792 transitions. 61.39/42.25 [2019-03-28 12:02:57,789 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 61 61.39/42.25 [2019-03-28 12:02:57,791 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 98 61.39/42.25 [2019-03-28 12:02:57,791 INFO L73 IsDeterministic]: Start isDeterministic. Operand 643 states and 792 transitions. 61.39/42.25 [2019-03-28 12:02:57,792 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 61.39/42.25 [2019-03-28 12:02:57,792 INFO L706 BuchiCegarLoop]: Abstraction has 643 states and 792 transitions. 61.39/42.25 [2019-03-28 12:02:57,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 643 states and 792 transitions. 61.39/42.25 [2019-03-28 12:02:57,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 643 to 89. 61.39/42.25 [2019-03-28 12:02:57,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. 61.39/42.25 [2019-03-28 12:02:57,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 116 transitions. 61.39/42.25 [2019-03-28 12:02:57,808 INFO L729 BuchiCegarLoop]: Abstraction has 89 states and 116 transitions. 61.39/42.25 [2019-03-28 12:02:57,808 INFO L609 BuchiCegarLoop]: Abstraction has 89 states and 116 transitions. 61.39/42.25 [2019-03-28 12:02:57,808 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ 61.39/42.25 [2019-03-28 12:02:57,808 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 89 states and 116 transitions. 61.39/42.25 [2019-03-28 12:02:57,809 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 27 61.39/42.25 [2019-03-28 12:02:57,809 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 61.39/42.25 [2019-03-28 12:02:57,809 INFO L119 BuchiIsEmpty]: Starting construction of run 61.39/42.25 [2019-03-28 12:02:57,810 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1] 61.39/42.25 [2019-03-28 12:02:57,810 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] 61.39/42.25 [2019-03-28 12:02:57,810 INFO L794 eck$LassoCheckResult]: Stem: 10252#ULTIMATE.startENTRY [63] ULTIMATE.startENTRY-->L29: Formula: (and (<= 0 v_ULTIMATE.start_main_~n~0_8) (<= 0 v_ULTIMATE.start_main_~m~0_8) (<= 0 v_ULTIMATE.start_main_~r~0_8)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_6|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_6|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_6|, ULTIMATE.start_main_~m~0=v_ULTIMATE.start_main_~m~0_8, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_6|, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_8, ULTIMATE.start_main_~r~0=v_ULTIMATE.start_main_~r~0_8, ULTIMATE.start_main_#t~ret5=|v_ULTIMATE.start_main_#t~ret5_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#res, ULTIMATE.start_main_~m~0, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~n~0, ULTIMATE.start_main_~r~0, ULTIMATE.start_main_#t~ret5] 10248#L29 [44] L29-->pENTRY: Formula: (and (= |v_p_#in~rInParam_3| v_ULTIMATE.start_main_~r~0_7) (= |v_p_#in~mInParam_3| v_ULTIMATE.start_main_~m~0_7) (= |v_p_#in~nInParam_3| v_ULTIMATE.start_main_~n~0_7)) InVars {ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7, ULTIMATE.start_main_~r~0=v_ULTIMATE.start_main_~r~0_7, ULTIMATE.start_main_~m~0=v_ULTIMATE.start_main_~m~0_7} OutVars{p_#in~m=|v_p_#in~mInParam_3|, p_#in~n=|v_p_#in~nInParam_3|, p_#in~r=|v_p_#in~rInParam_3|} AuxVars[] AssignedVars[p_#in~m, p_#in~n, p_#in~r]< 10263#pENTRY [43] pENTRY-->L13: Formula: (and (= v_p_~n_1 |v_p_#in~n_1|) (= v_p_~r_1 |v_p_#in~r_1|) (= v_p_~m_1 |v_p_#in~m_1|)) InVars {p_#in~m=|v_p_#in~m_1|, p_#in~n=|v_p_#in~n_1|, p_#in~r=|v_p_#in~r_1|} OutVars{p_~n=v_p_~n_1, p_#in~m=|v_p_#in~m_1|, p_#in~n=|v_p_#in~n_1|, p_~m=v_p_~m_1, p_~r=v_p_~r_1, p_#in~r=|v_p_#in~r_1|} AuxVars[] AssignedVars[p_~n, p_~m, p_~r] 10265#L13 [56] L13-->L16: Formula: (>= 0 v_p_~r_4) InVars {p_~r=v_p_~r_4} OutVars{p_~r=v_p_~r_4} AuxVars[] AssignedVars[] 10247#L16 [36] L16-->L17: Formula: (< 0 v_p_~n_3) InVars {p_~n=v_p_~n_3} OutVars{p_~n=v_p_~n_3} AuxVars[] AssignedVars[] 10250#L17 [34] L17-->pENTRY: Formula: (and (= |v_p_#in~rInParam_2| v_p_~m_6) (= |v_p_#in~nInParam_2| (+ v_p_~n_7 (- 1))) (= |v_p_#in~mInParam_2| v_p_~r_7)) InVars {p_~n=v_p_~n_7, p_~m=v_p_~m_6, p_~r=v_p_~r_7} OutVars{p_#in~m=|v_p_#in~mInParam_2|, p_#in~n=|v_p_#in~nInParam_2|, p_#in~r=|v_p_#in~rInParam_2|} AuxVars[] AssignedVars[p_#in~m, p_#in~n, p_#in~r]< 10286#pENTRY [43] pENTRY-->L13: Formula: (and (= v_p_~n_1 |v_p_#in~n_1|) (= v_p_~r_1 |v_p_#in~r_1|) (= v_p_~m_1 |v_p_#in~m_1|)) InVars {p_#in~m=|v_p_#in~m_1|, p_#in~n=|v_p_#in~n_1|, p_#in~r=|v_p_#in~r_1|} OutVars{p_~n=v_p_~n_1, p_#in~m=|v_p_#in~m_1|, p_#in~n=|v_p_#in~n_1|, p_~m=v_p_~m_1, p_~r=v_p_~r_1, p_#in~r=|v_p_#in~r_1|} AuxVars[] AssignedVars[p_~n, p_~m, p_~r] 10287#L13 [45] L13-->L14: Formula: (< 0 v_p_~r_2) InVars {p_~r=v_p_~r_2} OutVars{p_~r=v_p_~r_2} AuxVars[] AssignedVars[] 10258#L14 61.39/42.25 [2019-03-28 12:02:57,811 INFO L796 eck$LassoCheckResult]: Loop: 10258#L14 [42] L14-->pENTRY: Formula: (and (= |v_p_#in~rInParam_1| v_p_~n_6) (= |v_p_#in~mInParam_1| v_p_~m_5) (= |v_p_#in~nInParam_1| (+ v_p_~r_6 (- 1)))) InVars {p_~n=v_p_~n_6, p_~m=v_p_~m_5, p_~r=v_p_~r_6} OutVars{p_#in~m=|v_p_#in~mInParam_1|, p_#in~n=|v_p_#in~nInParam_1|, p_#in~r=|v_p_#in~rInParam_1|} AuxVars[] AssignedVars[p_#in~m, p_#in~n, p_#in~r]< 10237#pENTRY [43] pENTRY-->L13: Formula: (and (= v_p_~n_1 |v_p_#in~n_1|) (= v_p_~r_1 |v_p_#in~r_1|) (= v_p_~m_1 |v_p_#in~m_1|)) InVars {p_#in~m=|v_p_#in~m_1|, p_#in~n=|v_p_#in~n_1|, p_#in~r=|v_p_#in~r_1|} OutVars{p_~n=v_p_~n_1, p_#in~m=|v_p_#in~m_1|, p_#in~n=|v_p_#in~n_1|, p_~m=v_p_~m_1, p_~r=v_p_~r_1, p_#in~r=|v_p_#in~r_1|} AuxVars[] AssignedVars[p_~n, p_~m, p_~r] 10259#L13 [45] L13-->L14: Formula: (< 0 v_p_~r_2) InVars {p_~r=v_p_~r_2} OutVars{p_~r=v_p_~r_2} AuxVars[] AssignedVars[] 10258#L14 61.39/42.25 [2019-03-28 12:02:57,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 61.39/42.25 [2019-03-28 12:02:57,811 INFO L82 PathProgramCache]: Analyzing trace with hash -2000219557, now seen corresponding path program 1 times 61.39/42.25 [2019-03-28 12:02:57,811 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 61.39/42.25 [2019-03-28 12:02:57,811 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 61.39/42.25 [2019-03-28 12:02:57,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 61.39/42.25 [2019-03-28 12:02:57,813 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 61.39/42.25 [2019-03-28 12:02:57,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 61.39/42.25 [2019-03-28 12:02:57,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 61.39/42.25 [2019-03-28 12:02:57,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 61.39/42.25 [2019-03-28 12:02:57,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 61.39/42.25 [2019-03-28 12:02:57,824 INFO L82 PathProgramCache]: Analyzing trace with hash 71531, now seen corresponding path program 2 times 61.39/42.25 [2019-03-28 12:02:57,824 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 61.39/42.25 [2019-03-28 12:02:57,824 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 61.39/42.25 [2019-03-28 12:02:57,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 61.39/42.25 [2019-03-28 12:02:57,825 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 61.39/42.25 [2019-03-28 12:02:57,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 61.39/42.25 [2019-03-28 12:02:57,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 61.39/42.25 [2019-03-28 12:02:57,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 61.39/42.25 [2019-03-28 12:02:57,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 61.39/42.25 [2019-03-28 12:02:57,830 INFO L82 PathProgramCache]: Analyzing trace with hash -164516143, now seen corresponding path program 2 times 61.39/42.25 [2019-03-28 12:02:57,830 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 61.39/42.25 [2019-03-28 12:02:57,830 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 61.39/42.25 [2019-03-28 12:02:57,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 61.39/42.25 [2019-03-28 12:02:57,831 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 61.39/42.25 [2019-03-28 12:02:57,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 61.39/42.25 [2019-03-28 12:02:57,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 61.39/42.25 [2019-03-28 12:02:57,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 61.39/42.25 [2019-03-28 12:02:57,921 INFO L216 LassoAnalysis]: Preferences: 61.39/42.25 [2019-03-28 12:02:57,921 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 61.39/42.25 [2019-03-28 12:02:57,921 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 61.39/42.25 [2019-03-28 12:02:57,921 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 61.39/42.25 [2019-03-28 12:02:57,921 INFO L127 ssoRankerPreferences]: Use exernal solver: true 61.39/42.25 [2019-03-28 12:02:57,922 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 61.39/42.25 [2019-03-28 12:02:57,922 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 61.39/42.25 [2019-03-28 12:02:57,922 INFO L130 ssoRankerPreferences]: Path of dumped script: 61.39/42.25 [2019-03-28 12:02:57,922 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration4_Loop 61.39/42.25 [2019-03-28 12:02:57,922 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 61.39/42.25 [2019-03-28 12:02:57,922 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 61.39/42.25 [2019-03-28 12:02:57,923 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 61.39/42.25 [2019-03-28 12:02:57,925 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 61.39/42.25 [2019-03-28 12:02:57,930 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 61.39/42.25 [2019-03-28 12:02:57,939 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 61.39/42.25 [2019-03-28 12:02:57,941 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 61.39/42.25 [2019-03-28 12:02:57,989 INFO L300 LassoAnalysis]: Preprocessing complete. 61.39/42.25 [2019-03-28 12:02:57,989 INFO L412 LassoAnalysis]: Checking for nontermination... 61.39/42.25 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 61.39/42.25 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 61.39/42.25 Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 61.39/42.25 [2019-03-28 12:02:57,992 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 61.39/42.25 [2019-03-28 12:02:57,992 INFO L163 nArgumentSynthesizer]: Using integer mode. 61.39/42.25 [2019-03-28 12:02:57,995 INFO L445 LassoAnalysis]: Proved nontermination for one component. 61.39/42.25 [2019-03-28 12:02:57,995 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {p_#t~ret0=0} Honda state: {p_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 61.39/42.25 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 61.39/42.25 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 61.39/42.25 Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 61.39/42.25 [2019-03-28 12:02:58,022 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 61.39/42.25 [2019-03-28 12:02:58,022 INFO L163 nArgumentSynthesizer]: Using integer mode. 61.39/42.25 [2019-03-28 12:02:58,028 INFO L445 LassoAnalysis]: Proved nontermination for one component. 61.39/42.25 [2019-03-28 12:02:58,028 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {p_#in~m=1, p_~m=1} Honda state: {p_#in~m=1, p_~m=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] 61.39/42.25 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 61.39/42.25 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 61.39/42.25 Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 61.39/42.25 [2019-03-28 12:02:58,054 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 61.39/42.25 [2019-03-28 12:02:58,054 INFO L163 nArgumentSynthesizer]: Using integer mode. 61.39/42.25 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 61.39/42.25 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 61.39/42.25 Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 61.39/42.25 [2019-03-28 12:02:58,088 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 61.39/42.25 [2019-03-28 12:02:58,089 INFO L163 nArgumentSynthesizer]: Using integer mode. 61.39/42.25 [2019-03-28 12:03:10,125 INFO L450 LassoAnalysis]: Proving nontermination failed: SMT Solver returned 'unknown'. 61.39/42.25 [2019-03-28 12:03:10,129 INFO L216 LassoAnalysis]: Preferences: 61.39/42.25 [2019-03-28 12:03:10,130 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 61.39/42.25 [2019-03-28 12:03:10,130 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 61.39/42.25 [2019-03-28 12:03:10,130 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 61.39/42.25 [2019-03-28 12:03:10,130 INFO L127 ssoRankerPreferences]: Use exernal solver: false 61.39/42.25 [2019-03-28 12:03:10,130 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 61.39/42.25 [2019-03-28 12:03:10,130 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 61.39/42.25 [2019-03-28 12:03:10,130 INFO L130 ssoRankerPreferences]: Path of dumped script: 61.39/42.25 [2019-03-28 12:03:10,131 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration4_Loop 61.39/42.25 [2019-03-28 12:03:10,131 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 61.39/42.25 [2019-03-28 12:03:10,131 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 61.39/42.25 [2019-03-28 12:03:10,132 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 61.39/42.25 [2019-03-28 12:03:10,134 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 61.39/42.25 [2019-03-28 12:03:10,138 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 61.39/42.25 [2019-03-28 12:03:10,146 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 61.39/42.25 [2019-03-28 12:03:10,148 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 61.39/42.25 [2019-03-28 12:03:10,193 INFO L300 LassoAnalysis]: Preprocessing complete. 61.39/42.25 [2019-03-28 12:03:10,194 INFO L497 LassoAnalysis]: Using template 'affine'. 61.39/42.25 [2019-03-28 12:03:10,194 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 61.39/42.25 Termination analysis: LINEAR_WITH_GUESSES 61.39/42.25 Number of strict supporting invariants: 0 61.39/42.25 Number of non-strict supporting invariants: 1 61.39/42.25 Consider only non-deceasing supporting invariants: true 61.39/42.25 Simplify termination arguments: true 61.39/42.25 Simplify supporting invariants: trueOverapproximate stem: false 61.39/42.25 [2019-03-28 12:03:10,195 INFO L339 nArgumentSynthesizer]: Template has degree 0. 61.39/42.25 [2019-03-28 12:03:10,195 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 61.39/42.25 [2019-03-28 12:03:10,195 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 61.39/42.25 [2019-03-28 12:03:10,195 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 61.39/42.25 [2019-03-28 12:03:10,195 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 61.39/42.25 [2019-03-28 12:03:10,196 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 61.39/42.25 [2019-03-28 12:03:10,196 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 61.39/42.25 [2019-03-28 12:03:10,197 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 61.39/42.25 [2019-03-28 12:03:10,197 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 61.39/42.25 Termination analysis: LINEAR_WITH_GUESSES 61.39/42.25 Number of strict supporting invariants: 0 61.39/42.25 Number of non-strict supporting invariants: 1 61.39/42.25 Consider only non-deceasing supporting invariants: true 61.39/42.25 Simplify termination arguments: true 61.39/42.25 Simplify supporting invariants: trueOverapproximate stem: false 61.39/42.25 [2019-03-28 12:03:10,197 INFO L339 nArgumentSynthesizer]: Template has degree 0. 61.39/42.25 [2019-03-28 12:03:10,198 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 61.39/42.25 [2019-03-28 12:03:10,198 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 61.39/42.25 [2019-03-28 12:03:10,198 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 61.39/42.25 [2019-03-28 12:03:10,198 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 61.39/42.25 [2019-03-28 12:03:10,198 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 61.39/42.25 [2019-03-28 12:03:10,199 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 61.39/42.25 [2019-03-28 12:03:10,200 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 61.39/42.25 [2019-03-28 12:03:10,200 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 61.39/42.25 Termination analysis: LINEAR_WITH_GUESSES 61.39/42.25 Number of strict supporting invariants: 0 61.39/42.25 Number of non-strict supporting invariants: 1 61.39/42.25 Consider only non-deceasing supporting invariants: true 61.39/42.25 Simplify termination arguments: true 61.39/42.25 Simplify supporting invariants: trueOverapproximate stem: false 61.39/42.25 [2019-03-28 12:03:10,200 INFO L339 nArgumentSynthesizer]: Template has degree 0. 61.39/42.25 [2019-03-28 12:03:10,201 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 61.39/42.25 [2019-03-28 12:03:10,201 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 61.39/42.25 [2019-03-28 12:03:10,201 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 61.39/42.25 [2019-03-28 12:03:10,201 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 61.39/42.25 [2019-03-28 12:03:10,202 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 61.39/42.25 [2019-03-28 12:03:10,202 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 61.39/42.25 [2019-03-28 12:03:10,206 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 61.39/42.25 [2019-03-28 12:03:10,206 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 61.39/42.25 Termination analysis: LINEAR_WITH_GUESSES 61.39/42.25 Number of strict supporting invariants: 0 61.39/42.25 Number of non-strict supporting invariants: 1 61.39/42.25 Consider only non-deceasing supporting invariants: true 61.39/42.25 Simplify termination arguments: true 61.39/42.25 Simplify supporting invariants: trueOverapproximate stem: false 61.39/42.25 [2019-03-28 12:03:10,207 INFO L339 nArgumentSynthesizer]: Template has degree 0. 61.39/42.25 [2019-03-28 12:03:10,207 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 61.39/42.25 [2019-03-28 12:03:10,207 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 61.39/42.25 [2019-03-28 12:03:10,207 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 61.39/42.25 [2019-03-28 12:03:10,207 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 61.39/42.25 [2019-03-28 12:03:10,208 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 61.39/42.25 [2019-03-28 12:03:10,208 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 61.39/42.25 [2019-03-28 12:03:10,209 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 61.39/42.25 [2019-03-28 12:03:10,209 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 61.39/42.25 Termination analysis: LINEAR_WITH_GUESSES 61.39/42.25 Number of strict supporting invariants: 0 61.39/42.25 Number of non-strict supporting invariants: 1 61.39/42.25 Consider only non-deceasing supporting invariants: true 61.39/42.25 Simplify termination arguments: true 61.39/42.25 Simplify supporting invariants: trueOverapproximate stem: false 61.39/42.25 [2019-03-28 12:03:10,209 INFO L339 nArgumentSynthesizer]: Template has degree 0. 61.39/42.25 [2019-03-28 12:03:10,209 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 61.39/42.25 [2019-03-28 12:03:10,210 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 61.39/42.25 [2019-03-28 12:03:10,210 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 61.39/42.25 [2019-03-28 12:03:10,210 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 61.39/42.25 [2019-03-28 12:03:10,210 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 61.39/42.25 [2019-03-28 12:03:10,210 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 61.39/42.25 [2019-03-28 12:03:10,211 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 61.39/42.25 [2019-03-28 12:03:10,211 INFO L497 LassoAnalysis]: Using template '2-nested'. 61.39/42.25 [2019-03-28 12:03:10,211 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 61.39/42.25 Termination analysis: LINEAR_WITH_GUESSES 61.39/42.25 Number of strict supporting invariants: 0 61.39/42.25 Number of non-strict supporting invariants: 1 61.39/42.25 Consider only non-deceasing supporting invariants: true 61.39/42.25 Simplify termination arguments: true 61.39/42.25 Simplify supporting invariants: trueOverapproximate stem: false 61.39/42.25 [2019-03-28 12:03:10,212 INFO L339 nArgumentSynthesizer]: Template has degree 0. 61.39/42.25 [2019-03-28 12:03:10,212 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 61.39/42.25 [2019-03-28 12:03:10,212 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 61.39/42.25 [2019-03-28 12:03:10,212 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 61.39/42.25 [2019-03-28 12:03:10,212 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. 61.39/42.25 [2019-03-28 12:03:10,213 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. 61.39/42.25 [2019-03-28 12:03:10,213 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 61.39/42.25 [2019-03-28 12:03:10,214 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 61.39/42.25 [2019-03-28 12:03:10,214 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 61.39/42.25 Termination analysis: LINEAR_WITH_GUESSES 61.39/42.25 Number of strict supporting invariants: 0 61.39/42.25 Number of non-strict supporting invariants: 1 61.39/42.25 Consider only non-deceasing supporting invariants: true 61.39/42.25 Simplify termination arguments: true 61.39/42.25 Simplify supporting invariants: trueOverapproximate stem: false 61.39/42.25 [2019-03-28 12:03:10,214 INFO L339 nArgumentSynthesizer]: Template has degree 0. 61.39/42.25 [2019-03-28 12:03:10,214 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 61.39/42.25 [2019-03-28 12:03:10,215 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 61.39/42.25 [2019-03-28 12:03:10,215 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 61.39/42.25 [2019-03-28 12:03:10,215 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. 61.39/42.25 [2019-03-28 12:03:10,215 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. 61.39/42.25 [2019-03-28 12:03:10,215 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 61.39/42.25 [2019-03-28 12:03:10,217 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 61.39/42.25 [2019-03-28 12:03:10,217 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 61.39/42.25 Termination analysis: LINEAR_WITH_GUESSES 61.39/42.25 Number of strict supporting invariants: 0 61.39/42.25 Number of non-strict supporting invariants: 1 61.39/42.25 Consider only non-deceasing supporting invariants: true 61.39/42.25 Simplify termination arguments: true 61.39/42.25 Simplify supporting invariants: trueOverapproximate stem: false 61.39/42.25 [2019-03-28 12:03:10,217 INFO L339 nArgumentSynthesizer]: Template has degree 0. 61.39/42.25 [2019-03-28 12:03:10,217 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 61.39/42.25 [2019-03-28 12:03:10,218 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 61.39/42.25 [2019-03-28 12:03:10,218 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 61.39/42.25 [2019-03-28 12:03:10,218 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. 61.39/42.25 [2019-03-28 12:03:10,219 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. 61.39/42.25 [2019-03-28 12:03:10,219 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 61.39/42.25 [2019-03-28 12:03:10,226 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 61.39/42.25 [2019-03-28 12:03:10,231 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. 61.39/42.25 [2019-03-28 12:03:10,231 INFO L444 ModelExtractionUtils]: 5 out of 11 variables were initially zero. Simplification set additionally 2 variables to zero. 61.39/42.25 [2019-03-28 12:03:10,231 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 61.39/42.25 [2019-03-28 12:03:10,231 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 61.39/42.25 [2019-03-28 12:03:10,232 INFO L518 LassoAnalysis]: Proved termination. 61.39/42.25 [2019-03-28 12:03:10,232 INFO L520 LassoAnalysis]: Termination argument consisting of: 61.39/42.25 Ranking function 2-nested ranking function: 61.39/42.25 f0 = 1*p_~r + 1*p_~n 61.39/42.25 f1 = 1*p_~n 61.39/42.25 Supporting invariants [] 61.39/42.25 [2019-03-28 12:03:10,232 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed 61.39/42.25 [2019-03-28 12:03:10,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 61.39/42.25 [2019-03-28 12:03:10,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 61.39/42.25 [2019-03-28 12:03:10,268 INFO L256 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 6 conjunts are in the unsatisfiable core 61.39/42.25 [2019-03-28 12:03:10,269 INFO L279 TraceCheckSpWp]: Computing forward predicates... 61.39/42.25 [2019-03-28 12:03:10,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 61.39/42.25 [2019-03-28 12:03:10,282 INFO L256 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 12 conjunts are in the unsatisfiable core 61.39/42.25 [2019-03-28 12:03:10,282 INFO L279 TraceCheckSpWp]: Computing forward predicates... 61.39/42.25 [2019-03-28 12:03:10,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 61.39/42.25 [2019-03-28 12:03:10,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 61.39/42.25 [2019-03-28 12:03:10,621 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 61.39/42.25 [2019-03-28 12:03:10,621 INFO L98 LoopCannibalizer]: 18 predicates before loop cannibalization 18 predicates after loop cannibalization 61.39/42.25 [2019-03-28 12:03:10,622 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 18 loop predicates 61.39/42.25 [2019-03-28 12:03:10,622 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 89 states and 116 transitions. cyclomatic complexity: 33 Second operand 4 states. 61.39/42.25 [2019-03-28 12:03:10,781 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 28 61.39/42.25 [2019-03-28 12:03:10,908 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 89 states and 116 transitions. cyclomatic complexity: 33. Second operand 4 states. Result 1858 states and 2659 transitions. Complement of second has 93 states. 61.39/42.25 [2019-03-28 12:03:10,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states 61.39/42.25 [2019-03-28 12:03:10,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. 61.39/42.25 [2019-03-28 12:03:10,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 21 transitions. 61.39/42.25 [2019-03-28 12:03:10,910 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 8 letters. Loop has 3 letters. 61.39/42.25 [2019-03-28 12:03:10,911 INFO L116 BuchiAccepts]: Finished buchiAccepts. 61.39/42.25 [2019-03-28 12:03:10,911 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 11 letters. Loop has 3 letters. 61.39/42.25 [2019-03-28 12:03:10,911 INFO L116 BuchiAccepts]: Finished buchiAccepts. 61.39/42.25 [2019-03-28 12:03:10,911 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 8 letters. Loop has 6 letters. 61.39/42.25 [2019-03-28 12:03:10,912 INFO L116 BuchiAccepts]: Finished buchiAccepts. 61.39/42.25 [2019-03-28 12:03:10,913 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1858 states and 2659 transitions. 61.39/42.25 [2019-03-28 12:03:10,933 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 36 61.39/42.25 [2019-03-28 12:03:10,937 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1858 states to 298 states and 378 transitions. 61.39/42.25 [2019-03-28 12:03:10,937 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 61.39/42.25 [2019-03-28 12:03:10,937 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 61.39/42.25 [2019-03-28 12:03:10,937 INFO L73 IsDeterministic]: Start isDeterministic. Operand 298 states and 378 transitions. 61.39/42.25 [2019-03-28 12:03:10,938 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 61.39/42.25 [2019-03-28 12:03:10,938 INFO L706 BuchiCegarLoop]: Abstraction has 298 states and 378 transitions. 61.39/42.25 [2019-03-28 12:03:10,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states and 378 transitions. 61.39/42.25 [2019-03-28 12:03:10,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 81. 61.39/42.25 [2019-03-28 12:03:10,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. 61.39/42.25 [2019-03-28 12:03:10,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 106 transitions. 61.39/42.25 [2019-03-28 12:03:10,944 INFO L729 BuchiCegarLoop]: Abstraction has 81 states and 106 transitions. 61.39/42.25 [2019-03-28 12:03:10,944 INFO L609 BuchiCegarLoop]: Abstraction has 81 states and 106 transitions. 61.39/42.25 [2019-03-28 12:03:10,944 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ 61.39/42.25 [2019-03-28 12:03:10,944 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 81 states and 106 transitions. 61.39/42.25 [2019-03-28 12:03:10,945 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 61.39/42.25 [2019-03-28 12:03:10,945 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 61.39/42.25 [2019-03-28 12:03:10,945 INFO L119 BuchiIsEmpty]: Starting construction of run 61.39/42.25 [2019-03-28 12:03:10,946 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 1, 1, 1] 61.39/42.25 [2019-03-28 12:03:10,946 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [3, 2, 2, 2, 1, 1] 61.39/42.25 [2019-03-28 12:03:10,946 INFO L794 eck$LassoCheckResult]: Stem: 12363#ULTIMATE.startENTRY [63] ULTIMATE.startENTRY-->L29: Formula: (and (<= 0 v_ULTIMATE.start_main_~n~0_8) (<= 0 v_ULTIMATE.start_main_~m~0_8) (<= 0 v_ULTIMATE.start_main_~r~0_8)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_6|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_6|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_6|, ULTIMATE.start_main_~m~0=v_ULTIMATE.start_main_~m~0_8, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_6|, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_8, ULTIMATE.start_main_~r~0=v_ULTIMATE.start_main_~r~0_8, ULTIMATE.start_main_#t~ret5=|v_ULTIMATE.start_main_#t~ret5_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#res, ULTIMATE.start_main_~m~0, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~n~0, ULTIMATE.start_main_~r~0, ULTIMATE.start_main_#t~ret5] 12356#L29 [44] L29-->pENTRY: Formula: (and (= |v_p_#in~rInParam_3| v_ULTIMATE.start_main_~r~0_7) (= |v_p_#in~mInParam_3| v_ULTIMATE.start_main_~m~0_7) (= |v_p_#in~nInParam_3| v_ULTIMATE.start_main_~n~0_7)) InVars {ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7, ULTIMATE.start_main_~r~0=v_ULTIMATE.start_main_~r~0_7, ULTIMATE.start_main_~m~0=v_ULTIMATE.start_main_~m~0_7} OutVars{p_#in~m=|v_p_#in~mInParam_3|, p_#in~n=|v_p_#in~nInParam_3|, p_#in~r=|v_p_#in~rInParam_3|} AuxVars[] AssignedVars[p_#in~m, p_#in~n, p_#in~r]< 12368#pENTRY [43] pENTRY-->L13: Formula: (and (= v_p_~n_1 |v_p_#in~n_1|) (= v_p_~r_1 |v_p_#in~r_1|) (= v_p_~m_1 |v_p_#in~m_1|)) InVars {p_#in~m=|v_p_#in~m_1|, p_#in~n=|v_p_#in~n_1|, p_#in~r=|v_p_#in~r_1|} OutVars{p_~n=v_p_~n_1, p_#in~m=|v_p_#in~m_1|, p_#in~n=|v_p_#in~n_1|, p_~m=v_p_~m_1, p_~r=v_p_~r_1, p_#in~r=|v_p_#in~r_1|} AuxVars[] AssignedVars[p_~n, p_~m, p_~r] 12372#L13 [56] L13-->L16: Formula: (>= 0 v_p_~r_4) InVars {p_~r=v_p_~r_4} OutVars{p_~r=v_p_~r_4} AuxVars[] AssignedVars[] 12352#L16 [36] L16-->L17: Formula: (< 0 v_p_~n_3) InVars {p_~n=v_p_~n_3} OutVars{p_~n=v_p_~n_3} AuxVars[] AssignedVars[] 12355#L17 [34] L17-->pENTRY: Formula: (and (= |v_p_#in~rInParam_2| v_p_~m_6) (= |v_p_#in~nInParam_2| (+ v_p_~n_7 (- 1))) (= |v_p_#in~mInParam_2| v_p_~r_7)) InVars {p_~n=v_p_~n_7, p_~m=v_p_~m_6, p_~r=v_p_~r_7} OutVars{p_#in~m=|v_p_#in~mInParam_2|, p_#in~n=|v_p_#in~nInParam_2|, p_#in~r=|v_p_#in~rInParam_2|} AuxVars[] AssignedVars[p_#in~m, p_#in~n, p_#in~r]< 12402#pENTRY [43] pENTRY-->L13: Formula: (and (= v_p_~n_1 |v_p_#in~n_1|) (= v_p_~r_1 |v_p_#in~r_1|) (= v_p_~m_1 |v_p_#in~m_1|)) InVars {p_#in~m=|v_p_#in~m_1|, p_#in~n=|v_p_#in~n_1|, p_#in~r=|v_p_#in~r_1|} OutVars{p_~n=v_p_~n_1, p_#in~m=|v_p_#in~m_1|, p_#in~n=|v_p_#in~n_1|, p_~m=v_p_~m_1, p_~r=v_p_~r_1, p_#in~r=|v_p_#in~r_1|} AuxVars[] AssignedVars[p_~n, p_~m, p_~r] 12399#L13 [56] L13-->L16: Formula: (>= 0 v_p_~r_4) InVars {p_~r=v_p_~r_4} OutVars{p_~r=v_p_~r_4} AuxVars[] AssignedVars[] 12384#L16 [36] L16-->L17: Formula: (< 0 v_p_~n_3) InVars {p_~n=v_p_~n_3} OutVars{p_~n=v_p_~n_3} AuxVars[] AssignedVars[] 12360#L17 [34] L17-->pENTRY: Formula: (and (= |v_p_#in~rInParam_2| v_p_~m_6) (= |v_p_#in~nInParam_2| (+ v_p_~n_7 (- 1))) (= |v_p_#in~mInParam_2| v_p_~r_7)) InVars {p_~n=v_p_~n_7, p_~m=v_p_~m_6, p_~r=v_p_~r_7} OutVars{p_#in~m=|v_p_#in~mInParam_2|, p_#in~n=|v_p_#in~nInParam_2|, p_#in~r=|v_p_#in~rInParam_2|} AuxVars[] AssignedVars[p_#in~m, p_#in~n, p_#in~r]< 12371#pENTRY [43] pENTRY-->L13: Formula: (and (= v_p_~n_1 |v_p_#in~n_1|) (= v_p_~r_1 |v_p_#in~r_1|) (= v_p_~m_1 |v_p_#in~m_1|)) InVars {p_#in~m=|v_p_#in~m_1|, p_#in~n=|v_p_#in~n_1|, p_#in~r=|v_p_#in~r_1|} OutVars{p_~n=v_p_~n_1, p_#in~m=|v_p_#in~m_1|, p_#in~n=|v_p_#in~n_1|, p_~m=v_p_~m_1, p_~r=v_p_~r_1, p_#in~r=|v_p_#in~r_1|} AuxVars[] AssignedVars[p_~n, p_~m, p_~r] 12370#L13 [45] L13-->L14: Formula: (< 0 v_p_~r_2) InVars {p_~r=v_p_~r_2} OutVars{p_~r=v_p_~r_2} AuxVars[] AssignedVars[] 12359#L14 61.39/42.25 [2019-03-28 12:03:10,947 INFO L796 eck$LassoCheckResult]: Loop: 12359#L14 [42] L14-->pENTRY: Formula: (and (= |v_p_#in~rInParam_1| v_p_~n_6) (= |v_p_#in~mInParam_1| v_p_~m_5) (= |v_p_#in~nInParam_1| (+ v_p_~r_6 (- 1)))) InVars {p_~n=v_p_~n_6, p_~m=v_p_~m_5, p_~r=v_p_~r_6} OutVars{p_#in~m=|v_p_#in~mInParam_1|, p_#in~n=|v_p_#in~nInParam_1|, p_#in~r=|v_p_#in~rInParam_1|} AuxVars[] AssignedVars[p_#in~m, p_#in~n, p_#in~r]< 12365#pENTRY [43] pENTRY-->L13: Formula: (and (= v_p_~n_1 |v_p_#in~n_1|) (= v_p_~r_1 |v_p_#in~r_1|) (= v_p_~m_1 |v_p_#in~m_1|)) InVars {p_#in~m=|v_p_#in~m_1|, p_#in~n=|v_p_#in~n_1|, p_#in~r=|v_p_#in~r_1|} OutVars{p_~n=v_p_~n_1, p_#in~m=|v_p_#in~m_1|, p_#in~n=|v_p_#in~n_1|, p_~m=v_p_~m_1, p_~r=v_p_~r_1, p_#in~r=|v_p_#in~r_1|} AuxVars[] AssignedVars[p_~n, p_~m, p_~r] 12414#L13 [56] L13-->L16: Formula: (>= 0 v_p_~r_4) InVars {p_~r=v_p_~r_4} OutVars{p_~r=v_p_~r_4} AuxVars[] AssignedVars[] 12357#L16 [36] L16-->L17: Formula: (< 0 v_p_~n_3) InVars {p_~n=v_p_~n_3} OutVars{p_~n=v_p_~n_3} AuxVars[] AssignedVars[] 12355#L17 [34] L17-->pENTRY: Formula: (and (= |v_p_#in~rInParam_2| v_p_~m_6) (= |v_p_#in~nInParam_2| (+ v_p_~n_7 (- 1))) (= |v_p_#in~mInParam_2| v_p_~r_7)) InVars {p_~n=v_p_~n_7, p_~m=v_p_~m_6, p_~r=v_p_~r_7} OutVars{p_#in~m=|v_p_#in~mInParam_2|, p_#in~n=|v_p_#in~nInParam_2|, p_#in~r=|v_p_#in~rInParam_2|} AuxVars[] AssignedVars[p_#in~m, p_#in~n, p_#in~r]< 12402#pENTRY [43] pENTRY-->L13: Formula: (and (= v_p_~n_1 |v_p_#in~n_1|) (= v_p_~r_1 |v_p_#in~r_1|) (= v_p_~m_1 |v_p_#in~m_1|)) InVars {p_#in~m=|v_p_#in~m_1|, p_#in~n=|v_p_#in~n_1|, p_#in~r=|v_p_#in~r_1|} OutVars{p_~n=v_p_~n_1, p_#in~m=|v_p_#in~m_1|, p_#in~n=|v_p_#in~n_1|, p_~m=v_p_~m_1, p_~r=v_p_~r_1, p_#in~r=|v_p_#in~r_1|} AuxVars[] AssignedVars[p_~n, p_~m, p_~r] 12399#L13 [56] L13-->L16: Formula: (>= 0 v_p_~r_4) InVars {p_~r=v_p_~r_4} OutVars{p_~r=v_p_~r_4} AuxVars[] AssignedVars[] 12384#L16 [36] L16-->L17: Formula: (< 0 v_p_~n_3) InVars {p_~n=v_p_~n_3} OutVars{p_~n=v_p_~n_3} AuxVars[] AssignedVars[] 12360#L17 [34] L17-->pENTRY: Formula: (and (= |v_p_#in~rInParam_2| v_p_~m_6) (= |v_p_#in~nInParam_2| (+ v_p_~n_7 (- 1))) (= |v_p_#in~mInParam_2| v_p_~r_7)) InVars {p_~n=v_p_~n_7, p_~m=v_p_~m_6, p_~r=v_p_~r_7} OutVars{p_#in~m=|v_p_#in~mInParam_2|, p_#in~n=|v_p_#in~nInParam_2|, p_#in~r=|v_p_#in~rInParam_2|} AuxVars[] AssignedVars[p_#in~m, p_#in~n, p_#in~r]< 12371#pENTRY [43] pENTRY-->L13: Formula: (and (= v_p_~n_1 |v_p_#in~n_1|) (= v_p_~r_1 |v_p_#in~r_1|) (= v_p_~m_1 |v_p_#in~m_1|)) InVars {p_#in~m=|v_p_#in~m_1|, p_#in~n=|v_p_#in~n_1|, p_#in~r=|v_p_#in~r_1|} OutVars{p_~n=v_p_~n_1, p_#in~m=|v_p_#in~m_1|, p_#in~n=|v_p_#in~n_1|, p_~m=v_p_~m_1, p_~r=v_p_~r_1, p_#in~r=|v_p_#in~r_1|} AuxVars[] AssignedVars[p_~n, p_~m, p_~r] 12370#L13 [45] L13-->L14: Formula: (< 0 v_p_~r_2) InVars {p_~r=v_p_~r_2} OutVars{p_~r=v_p_~r_2} AuxVars[] AssignedVars[] 12359#L14 61.39/42.25 [2019-03-28 12:03:10,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 61.39/42.25 [2019-03-28 12:03:10,947 INFO L82 PathProgramCache]: Analyzing trace with hash -795061818, now seen corresponding path program 2 times 61.39/42.25 [2019-03-28 12:03:10,947 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 61.39/42.25 [2019-03-28 12:03:10,947 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 61.39/42.25 [2019-03-28 12:03:10,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 61.39/42.25 [2019-03-28 12:03:10,948 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 61.39/42.25 [2019-03-28 12:03:10,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 61.39/42.25 [2019-03-28 12:03:10,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 61.39/42.25 [2019-03-28 12:03:11,003 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 61.39/42.25 [2019-03-28 12:03:11,006 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 61.39/42.25 [2019-03-28 12:03:11,006 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 61.39/42.25 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 61.39/42.25 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 61.39/42.25 Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 61.39/42.25 [2019-03-28 12:03:11,018 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 61.39/42.25 [2019-03-28 12:03:11,031 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) 61.39/42.25 [2019-03-28 12:03:11,032 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat 61.39/42.25 [2019-03-28 12:03:11,032 INFO L256 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 6 conjunts are in the unsatisfiable core 61.39/42.25 [2019-03-28 12:03:11,033 INFO L279 TraceCheckSpWp]: Computing forward predicates... 61.39/42.25 [2019-03-28 12:03:11,037 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 61.39/42.25 [2019-03-28 12:03:11,063 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 61.39/42.25 [2019-03-28 12:03:11,064 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 61.39/42.25 [2019-03-28 12:03:11,067 INFO L799 eck$LassoCheckResult]: stem already infeasible 61.39/42.25 [2019-03-28 12:03:11,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 61.39/42.25 [2019-03-28 12:03:11,067 INFO L82 PathProgramCache]: Analyzing trace with hash -615917375, now seen corresponding path program 2 times 61.39/42.25 [2019-03-28 12:03:11,067 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 61.39/42.25 [2019-03-28 12:03:11,067 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 61.39/42.25 [2019-03-28 12:03:11,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 61.39/42.25 [2019-03-28 12:03:11,068 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 61.39/42.25 [2019-03-28 12:03:11,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 61.39/42.25 [2019-03-28 12:03:11,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 61.39/42.25 [2019-03-28 12:03:11,113 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 61.39/42.25 [2019-03-28 12:03:11,114 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 61.39/42.25 [2019-03-28 12:03:11,114 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 61.39/42.25 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 61.39/42.25 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 61.39/42.25 Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 61.39/42.25 [2019-03-28 12:03:11,127 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 61.39/42.25 [2019-03-28 12:03:11,138 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) 61.39/42.25 [2019-03-28 12:03:11,139 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat 61.39/42.25 [2019-03-28 12:03:11,139 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 6 conjunts are in the unsatisfiable core 61.39/42.25 [2019-03-28 12:03:11,140 INFO L279 TraceCheckSpWp]: Computing forward predicates... 61.39/42.25 [2019-03-28 12:03:11,143 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 61.39/42.25 [2019-03-28 12:03:11,170 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 61.39/42.25 [2019-03-28 12:03:11,170 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 61.39/42.25 [2019-03-28 12:03:11,170 INFO L811 eck$LassoCheckResult]: loop already infeasible 61.39/42.25 [2019-03-28 12:03:11,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. 61.39/42.25 [2019-03-28 12:03:11,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 61.39/42.25 [2019-03-28 12:03:11,175 INFO L87 Difference]: Start difference. First operand 81 states and 106 transitions. cyclomatic complexity: 29 Second operand 6 states. 61.39/42.25 [2019-03-28 12:03:11,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 61.39/42.25 [2019-03-28 12:03:11,258 INFO L93 Difference]: Finished difference Result 55 states and 63 transitions. 61.39/42.25 [2019-03-28 12:03:11,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 61.39/42.25 [2019-03-28 12:03:11,260 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 55 states and 63 transitions. 61.39/42.25 [2019-03-28 12:03:11,261 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 61.39/42.25 [2019-03-28 12:03:11,261 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 55 states to 0 states and 0 transitions. 61.39/42.25 [2019-03-28 12:03:11,262 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 61.39/42.25 [2019-03-28 12:03:11,262 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 61.39/42.25 [2019-03-28 12:03:11,262 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. 61.39/42.25 [2019-03-28 12:03:11,262 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 61.39/42.25 [2019-03-28 12:03:11,262 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 61.39/42.25 [2019-03-28 12:03:11,262 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 61.39/42.25 [2019-03-28 12:03:11,262 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 61.39/42.25 [2019-03-28 12:03:11,262 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ 61.39/42.25 [2019-03-28 12:03:11,262 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. 61.39/42.25 [2019-03-28 12:03:11,263 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 61.39/42.25 [2019-03-28 12:03:11,263 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true 61.39/42.25 [2019-03-28 12:03:11,270 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:03:11 BasicIcfg 61.39/42.25 [2019-03-28 12:03:11,270 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- 61.39/42.25 [2019-03-28 12:03:11,271 INFO L168 Benchmark]: Toolchain (without parser) took 35678.42 ms. Allocated memory was 649.6 MB in the beginning and 1.1 GB in the end (delta: 442.5 MB). Free memory was 559.6 MB in the beginning and 856.8 MB in the end (delta: -297.2 MB). Peak memory consumption was 145.3 MB. Max. memory is 50.3 GB. 61.39/42.25 [2019-03-28 12:03:11,272 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 649.6 MB. Free memory is still 579.0 MB. There was no memory consumed. Max. memory is 50.3 GB. 61.39/42.25 [2019-03-28 12:03:11,272 INFO L168 Benchmark]: CACSL2BoogieTranslator took 226.38 ms. Allocated memory is still 649.6 MB. Free memory was 559.6 MB in the beginning and 548.8 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 50.3 GB. 61.39/42.25 [2019-03-28 12:03:11,272 INFO L168 Benchmark]: Boogie Procedure Inliner took 92.62 ms. Allocated memory was 649.6 MB in the beginning and 694.7 MB in the end (delta: 45.1 MB). Free memory was 548.8 MB in the beginning and 661.5 MB in the end (delta: -112.7 MB). Peak memory consumption was 20.2 MB. Max. memory is 50.3 GB. 61.39/42.25 [2019-03-28 12:03:11,273 INFO L168 Benchmark]: Boogie Preprocessor took 18.91 ms. Allocated memory is still 694.7 MB. Free memory was 661.5 MB in the beginning and 660.4 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 50.3 GB. 61.39/42.25 [2019-03-28 12:03:11,274 INFO L168 Benchmark]: RCFGBuilder took 209.31 ms. Allocated memory is still 694.7 MB. Free memory was 660.4 MB in the beginning and 644.1 MB in the end (delta: 16.3 MB). Peak memory consumption was 16.3 MB. Max. memory is 50.3 GB. 61.39/42.25 [2019-03-28 12:03:11,274 INFO L168 Benchmark]: BlockEncodingV2 took 87.89 ms. Allocated memory is still 694.7 MB. Free memory was 644.1 MB in the beginning and 638.7 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 50.3 GB. 61.39/42.25 [2019-03-28 12:03:11,275 INFO L168 Benchmark]: TraceAbstraction took 164.96 ms. Allocated memory is still 694.7 MB. Free memory was 637.6 MB in the beginning and 627.8 MB in the end (delta: 9.9 MB). Peak memory consumption was 9.9 MB. Max. memory is 50.3 GB. 61.39/42.25 [2019-03-28 12:03:11,275 INFO L168 Benchmark]: BuchiAutomizer took 34873.05 ms. Allocated memory was 694.7 MB in the beginning and 1.1 GB in the end (delta: 397.4 MB). Free memory was 627.8 MB in the beginning and 856.8 MB in the end (delta: -229.0 MB). Peak memory consumption was 168.4 MB. Max. memory is 50.3 GB. 61.39/42.25 [2019-03-28 12:03:11,281 INFO L337 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### 61.39/42.25 --- Results --- 61.39/42.25 * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: 61.39/42.25 - StatisticsResult: Initial Icfg 61.39/42.25 17 locations, 21 edges 61.39/42.25 - StatisticsResult: Encoded RCFG 61.39/42.25 11 locations, 14 edges 61.39/42.25 * Results from de.uni_freiburg.informatik.ultimate.core: 61.39/42.25 - StatisticsResult: Toolchain Benchmarks 61.39/42.25 Benchmark results are: 61.39/42.25 * CDTParser took 0.18 ms. Allocated memory is still 649.6 MB. Free memory is still 579.0 MB. There was no memory consumed. Max. memory is 50.3 GB. 61.39/42.25 * CACSL2BoogieTranslator took 226.38 ms. Allocated memory is still 649.6 MB. Free memory was 559.6 MB in the beginning and 548.8 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 50.3 GB. 61.39/42.25 * Boogie Procedure Inliner took 92.62 ms. Allocated memory was 649.6 MB in the beginning and 694.7 MB in the end (delta: 45.1 MB). Free memory was 548.8 MB in the beginning and 661.5 MB in the end (delta: -112.7 MB). Peak memory consumption was 20.2 MB. Max. memory is 50.3 GB. 61.39/42.25 * Boogie Preprocessor took 18.91 ms. Allocated memory is still 694.7 MB. Free memory was 661.5 MB in the beginning and 660.4 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 50.3 GB. 61.39/42.25 * RCFGBuilder took 209.31 ms. Allocated memory is still 694.7 MB. Free memory was 660.4 MB in the beginning and 644.1 MB in the end (delta: 16.3 MB). Peak memory consumption was 16.3 MB. Max. memory is 50.3 GB. 61.39/42.25 * BlockEncodingV2 took 87.89 ms. Allocated memory is still 694.7 MB. Free memory was 644.1 MB in the beginning and 638.7 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 50.3 GB. 61.39/42.25 * TraceAbstraction took 164.96 ms. Allocated memory is still 694.7 MB. Free memory was 637.6 MB in the beginning and 627.8 MB in the end (delta: 9.9 MB). Peak memory consumption was 9.9 MB. Max. memory is 50.3 GB. 61.39/42.25 * BuchiAutomizer took 34873.05 ms. Allocated memory was 694.7 MB in the beginning and 1.1 GB in the end (delta: 397.4 MB). Free memory was 627.8 MB in the beginning and 856.8 MB in the end (delta: -229.0 MB). Peak memory consumption was 168.4 MB. Max. memory is 50.3 GB. 61.39/42.25 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: 61.39/42.25 - AllSpecificationsHoldResult: All specifications hold 61.39/42.25 We were not able to verify any specifiation because the program does not contain any specification. 61.39/42.25 - StatisticsResult: Ultimate Automizer benchmark data 61.39/42.25 CFG has 2 procedures, 11 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=11occurred 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 61.39/42.25 - StatisticsResult: Constructed decomposition of program 61.39/42.25 Your program was decomposed into 5 terminating modules (1 trivial, 0 deterministic, 4 nondeterministic). One nondeterministic module has 2-nested ranking function (if \old(n) + \old(r) > 0 then 1 else 0), (if \old(n) + \old(r) > 0 then \old(n) + \old(r) else \old(r)) and consists of 6 locations. One nondeterministic module has affine ranking function n and consists of 5 locations. One nondeterministic module has 2-nested ranking function (if m + r > 0 then 1 else 0), (if m + r > 0 then m + r else m) and consists of 43 locations. One nondeterministic module has 2-nested ranking function (if r + n > 0 then 1 else 0), (if r + n > 0 then r + n else n) and consists of 5 locations. 1 modules have a trivial ranking function, the largest among these consists of 6 locations. 61.39/42.25 - StatisticsResult: Timing statistics 61.39/42.25 BüchiAutomizer plugin needed 34.8s and 6 iterations. TraceHistogramMax:3. Analysis of lassos took 21.3s. Construction of modules took 0.8s. Büchi inclusion checks took 12.4s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 4. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 795 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.1s Buchi closure took 0.0s. Biggest automaton had 89 states and ocurred in iteration 3. Nontrivial modules had stage [4, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/2 HoareTripleCheckerStatistics: 86 SDtfs, 501 SDslu, 292 SDs, 0 SdLazy, 1047 SolverSat, 246 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT4 conc0 concLT0 SILN0 SILU0 SILI1 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital26 mio100 ax100 hnf100 lsp79 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq186 hnf89 smp96 dnf100 smp100 tf106 neg100 sie105 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 4ms VariablesStem: 0 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 3 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 12 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 3 LassoNonterminationAnalysisUnknown: 1 LassoNonterminationAnalysisTime: 19.1s 61.39/42.25 - TerminationAnalysisResult: Termination proven 61.39/42.25 Buchi Automizer proved that your program is terminating 61.39/42.25 RESULT: Ultimate proved your program to be correct! 61.39/42.25 !SESSION 2019-03-28 12:02:30.988 ----------------------------------------------- 61.39/42.25 eclipse.buildId=unknown 61.39/42.25 java.version=1.8.0_181 61.39/42.25 java.vendor=Oracle Corporation 61.39/42.25 BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US 61.39/42.25 Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox2/benchmark/theBenchmark.c 61.39/42.25 Command-line arguments: -os linux -ws gtk -arch x86_64 -consoleLog -data @user.home/.ultimate -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -data /export/starexec/sandbox2/tmp -i /export/starexec/sandbox2/benchmark/theBenchmark.c 61.39/42.25 61.39/42.25 !ENTRY org.eclipse.core.resources 2 10035 2019-03-28 12:03:11.514 61.39/42.25 !MESSAGE The workspace will exit with unsaved changes in this session. 61.39/42.25 Received shutdown request... 61.39/42.25 Ultimate: 61.39/42.25 GTK+ Version Check 61.39/42.25 EOF