71.18/24.01 YES 71.18/24.01 71.18/24.01 Ultimate: Cannot open display: 71.18/24.01 This is Ultimate 0.1.24-8dc7c08-m 71.18/24.01 [2019-03-28 12:17:44,239 INFO L170 SettingsManager]: Resetting all preferences to default values... 71.18/24.01 [2019-03-28 12:17:44,241 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values 71.18/24.01 [2019-03-28 12:17:44,253 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... 71.18/24.01 [2019-03-28 12:17:44,253 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values 71.18/24.01 [2019-03-28 12:17:44,254 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values 71.18/24.01 [2019-03-28 12:17:44,255 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values 71.18/24.01 [2019-03-28 12:17:44,257 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values 71.18/24.01 [2019-03-28 12:17:44,258 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values 71.18/24.01 [2019-03-28 12:17:44,259 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values 71.18/24.01 [2019-03-28 12:17:44,260 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... 71.18/24.01 [2019-03-28 12:17:44,260 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values 71.18/24.01 [2019-03-28 12:17:44,261 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values 71.18/24.01 [2019-03-28 12:17:44,262 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values 71.18/24.01 [2019-03-28 12:17:44,263 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values 71.18/24.01 [2019-03-28 12:17:44,263 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values 71.18/24.01 [2019-03-28 12:17:44,264 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values 71.18/24.01 [2019-03-28 12:17:44,266 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values 71.18/24.01 [2019-03-28 12:17:44,268 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values 71.18/24.01 [2019-03-28 12:17:44,269 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values 71.18/24.01 [2019-03-28 12:17:44,270 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values 71.18/24.01 [2019-03-28 12:17:44,271 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values 71.18/24.01 [2019-03-28 12:17:44,273 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... 71.18/24.01 [2019-03-28 12:17:44,274 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... 71.18/24.01 [2019-03-28 12:17:44,274 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values 71.18/24.01 [2019-03-28 12:17:44,275 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values 71.18/24.01 [2019-03-28 12:17:44,275 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values 71.18/24.01 [2019-03-28 12:17:44,276 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... 71.18/24.01 [2019-03-28 12:17:44,276 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values 71.18/24.01 [2019-03-28 12:17:44,277 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values 71.18/24.01 [2019-03-28 12:17:44,297 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values 71.18/24.01 [2019-03-28 12:17:44,298 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values 71.18/24.01 [2019-03-28 12:17:44,299 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... 71.18/24.01 [2019-03-28 12:17:44,299 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values 71.18/24.01 [2019-03-28 12:17:44,300 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... 71.18/24.01 [2019-03-28 12:17:44,300 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... 71.18/24.01 [2019-03-28 12:17:44,300 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values 71.18/24.01 [2019-03-28 12:17:44,301 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values 71.18/24.01 [2019-03-28 12:17:44,302 INFO L181 SettingsManager]: Finished resetting all preferences to default values... 71.18/24.01 [2019-03-28 12:17:44,302 INFO L98 SettingsManager]: Beginning loading settings from /export/starexec/sandbox/solver/bin/./../termcomp2017.epf 71.18/24.01 [2019-03-28 12:17:44,317 INFO L110 SettingsManager]: Loading preferences was successful 71.18/24.01 [2019-03-28 12:17:44,317 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: 71.18/24.01 [2019-03-28 12:17:44,318 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: 71.18/24.01 [2019-03-28 12:17:44,318 INFO L133 SettingsManager]: * Rewrite not-equals=true 71.18/24.01 [2019-03-28 12:17:44,319 INFO L133 SettingsManager]: * Create parallel compositions if possible=false 71.18/24.01 [2019-03-28 12:17:44,319 INFO L133 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE 71.18/24.01 [2019-03-28 12:17:44,319 INFO L133 SettingsManager]: * Use SBE=true 71.18/24.01 [2019-03-28 12:17:44,319 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: 71.18/24.01 [2019-03-28 12:17:44,319 INFO L133 SettingsManager]: * Use old map elimination=false 71.18/24.01 [2019-03-28 12:17:44,319 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false 71.18/24.01 [2019-03-28 12:17:44,320 INFO L133 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION 71.18/24.01 [2019-03-28 12:17:44,320 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true 71.18/24.01 [2019-03-28 12:17:44,320 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES 71.18/24.01 [2019-03-28 12:17:44,320 INFO L133 SettingsManager]: * Construct termination proof for TermComp=true 71.18/24.01 [2019-03-28 12:17:44,320 INFO L133 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 71.18/24.01 [2019-03-28 12:17:44,320 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: 71.18/24.01 [2019-03-28 12:17:44,321 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false 71.18/24.01 [2019-03-28 12:17:44,321 INFO L133 SettingsManager]: * Check division by zero=IGNORE 71.18/24.01 [2019-03-28 12:17:44,321 INFO L133 SettingsManager]: * Check if freed pointer was valid=false 71.18/24.01 [2019-03-28 12:17:44,321 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false 71.18/24.01 [2019-03-28 12:17:44,321 INFO L133 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE 71.18/24.01 [2019-03-28 12:17:44,322 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: 71.18/24.01 [2019-03-28 12:17:44,322 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements 71.18/24.01 [2019-03-28 12:17:44,322 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump 71.18/24.01 [2019-03-28 12:17:44,322 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 71.18/24.01 [2019-03-28 12:17:44,322 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: 71.18/24.01 [2019-03-28 12:17:44,322 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles 71.18/24.01 [2019-03-28 12:17:44,323 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL 71.18/24.01 [2019-03-28 12:17:44,323 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 71.18/24.01 [2019-03-28 12:17:44,349 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp 71.18/24.01 [2019-03-28 12:17:44,363 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized 71.18/24.01 [2019-03-28 12:17:44,367 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. 71.18/24.01 [2019-03-28 12:17:44,368 INFO L271 PluginConnector]: Initializing CDTParser... 71.18/24.01 [2019-03-28 12:17:44,369 INFO L276 PluginConnector]: CDTParser initialized 71.18/24.01 [2019-03-28 12:17:44,369 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox/benchmark/theBenchmark.c 71.18/24.01 [2019-03-28 12:17:44,434 INFO L221 CDTParser]: Created temporary CDT project at /export/starexec/sandbox/tmp/6bdc6d721a73400ba1489da9180c1d0c/FLAG73e9e2974 71.18/24.01 [2019-03-28 12:17:44,775 INFO L307 CDTParser]: Found 1 translation units. 71.18/24.01 [2019-03-28 12:17:44,776 INFO L161 CDTParser]: Scanning /export/starexec/sandbox/benchmark/theBenchmark.c 71.18/24.01 [2019-03-28 12:17:44,783 INFO L355 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox/tmp/6bdc6d721a73400ba1489da9180c1d0c/FLAG73e9e2974 71.18/24.01 [2019-03-28 12:17:45,173 INFO L363 CDTParser]: Successfully deleted /export/starexec/sandbox/tmp/6bdc6d721a73400ba1489da9180c1d0c 71.18/24.01 [2019-03-28 12:17:45,184 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### 71.18/24.01 [2019-03-28 12:17:45,186 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. 71.18/24.01 [2019-03-28 12:17:45,187 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- 71.18/24.01 [2019-03-28 12:17:45,187 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... 71.18/24.01 [2019-03-28 12:17:45,190 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized 71.18/24.01 [2019-03-28 12:17:45,191 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 12:17:45" (1/1) ... 71.18/24.01 [2019-03-28 12:17:45,195 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a8d5d5b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:17:45, skipping insertion in model container 71.18/24.01 [2019-03-28 12:17:45,195 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 12:17:45" (1/1) ... 71.18/24.01 [2019-03-28 12:17:45,202 INFO L145 MainTranslator]: Starting translation in SV-COMP mode 71.18/24.01 [2019-03-28 12:17:45,221 INFO L176 MainTranslator]: Built tables and reachable declarations 71.18/24.01 [2019-03-28 12:17:45,383 INFO L206 PostProcessor]: Analyzing one entry point: main 71.18/24.01 [2019-03-28 12:17:45,387 INFO L191 MainTranslator]: Completed pre-run 71.18/24.01 [2019-03-28 12:17:45,404 INFO L206 PostProcessor]: Analyzing one entry point: main 71.18/24.01 [2019-03-28 12:17:45,474 INFO L195 MainTranslator]: Completed translation 71.18/24.01 [2019-03-28 12:17:45,475 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:17:45 WrapperNode 71.18/24.01 [2019-03-28 12:17:45,475 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- 71.18/24.01 [2019-03-28 12:17:45,476 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- 71.18/24.01 [2019-03-28 12:17:45,476 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... 71.18/24.01 [2019-03-28 12:17:45,476 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized 71.18/24.01 [2019-03-28 12:17:45,485 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:17:45" (1/1) ... 71.18/24.01 [2019-03-28 12:17:45,491 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:17:45" (1/1) ... 71.18/24.01 [2019-03-28 12:17:45,513 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- 71.18/24.01 [2019-03-28 12:17:45,514 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- 71.18/24.01 [2019-03-28 12:17:45,514 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... 71.18/24.01 [2019-03-28 12:17:45,514 INFO L276 PluginConnector]: Boogie Preprocessor initialized 71.18/24.01 [2019-03-28 12:17:45,524 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:17:45" (1/1) ... 71.18/24.01 [2019-03-28 12:17:45,524 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:17:45" (1/1) ... 71.18/24.01 [2019-03-28 12:17:45,525 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:17:45" (1/1) ... 71.18/24.01 [2019-03-28 12:17:45,525 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:17:45" (1/1) ... 71.18/24.01 [2019-03-28 12:17:45,528 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:17:45" (1/1) ... 71.18/24.01 [2019-03-28 12:17:45,530 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:17:45" (1/1) ... 71.18/24.01 [2019-03-28 12:17:45,531 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:17:45" (1/1) ... 71.18/24.01 [2019-03-28 12:17:45,533 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- 71.18/24.01 [2019-03-28 12:17:45,533 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- 71.18/24.01 [2019-03-28 12:17:45,533 INFO L271 PluginConnector]: Initializing RCFGBuilder... 71.18/24.01 [2019-03-28 12:17:45,533 INFO L276 PluginConnector]: RCFGBuilder initialized 71.18/24.01 [2019-03-28 12:17:45,534 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:17:45" (1/1) ... 71.18/24.01 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 71.18/24.01 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) 71.18/24.01 Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 71.18/24.01 [2019-03-28 12:17:45,594 INFO L130 BoogieDeclarations]: Found specification of procedure loop 71.18/24.01 [2019-03-28 12:17:45,595 INFO L138 BoogieDeclarations]: Found implementation of procedure loop 71.18/24.01 [2019-03-28 12:17:45,595 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start 71.18/24.01 [2019-03-28 12:17:45,595 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start 71.18/24.01 [2019-03-28 12:17:45,756 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) 71.18/24.01 [2019-03-28 12:17:45,756 INFO L286 CfgBuilder]: Removed 12 assue(true) statements. 71.18/24.01 [2019-03-28 12:17:45,757 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:17:45 BoogieIcfgContainer 71.18/24.01 [2019-03-28 12:17:45,758 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- 71.18/24.01 [2019-03-28 12:17:45,758 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- 71.18/24.01 [2019-03-28 12:17:45,758 INFO L271 PluginConnector]: Initializing BlockEncodingV2... 71.18/24.01 [2019-03-28 12:17:45,761 INFO L276 PluginConnector]: BlockEncodingV2 initialized 71.18/24.01 [2019-03-28 12:17:45,761 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:17:45" (1/1) ... 71.18/24.01 [2019-03-28 12:17:45,779 INFO L313 BlockEncoder]: Initial Icfg 19 locations, 24 edges 71.18/24.01 [2019-03-28 12:17:45,781 INFO L258 BlockEncoder]: Using Remove infeasible edges 71.18/24.01 [2019-03-28 12:17:45,782 INFO L263 BlockEncoder]: Using Maximize final states 71.18/24.01 [2019-03-28 12:17:45,782 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false 71.18/24.01 [2019-03-28 12:17:45,783 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE 71.18/24.01 [2019-03-28 12:17:45,784 INFO L296 BlockEncoder]: Using Remove sink states 71.18/24.01 [2019-03-28 12:17:45,785 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true 71.18/24.01 [2019-03-28 12:17:45,786 INFO L179 BlockEncoder]: Using Rewrite not-equals 71.18/24.01 [2019-03-28 12:17:45,802 INFO L185 BlockEncoder]: Using Use SBE 71.18/24.01 [2019-03-28 12:17:45,819 INFO L200 BlockEncoder]: SBE split 1 edges 71.18/24.01 [2019-03-28 12:17:45,823 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility 71.18/24.01 [2019-03-28 12:17:45,825 INFO L71 MaximizeFinalStates]: 0 new accepting states 71.18/24.01 [2019-03-28 12:17:45,833 INFO L100 BaseMinimizeStates]: Removed 4 edges and 2 locations by large block encoding 71.18/24.01 [2019-03-28 12:17:45,835 INFO L70 RemoveSinkStates]: Removed 2 edges and 2 locations by removing sink states 71.18/24.01 [2019-03-28 12:17:45,838 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility 71.18/24.01 [2019-03-28 12:17:45,838 INFO L71 MaximizeFinalStates]: 0 new accepting states 71.18/24.01 [2019-03-28 12:17:45,838 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding 71.18/24.01 [2019-03-28 12:17:45,839 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states 71.18/24.01 [2019-03-28 12:17:45,839 INFO L313 BlockEncoder]: Encoded RCFG 15 locations, 22 edges 71.18/24.01 [2019-03-28 12:17:45,840 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:17:45 BasicIcfg 71.18/24.01 [2019-03-28 12:17:45,840 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- 71.18/24.01 [2019-03-28 12:17:45,841 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- 71.18/24.01 [2019-03-28 12:17:45,841 INFO L271 PluginConnector]: Initializing TraceAbstraction... 71.18/24.01 [2019-03-28 12:17:45,844 INFO L276 PluginConnector]: TraceAbstraction initialized 71.18/24.01 [2019-03-28 12:17:45,845 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.03 12:17:45" (1/4) ... 71.18/24.01 [2019-03-28 12:17:45,845 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42e8c300 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 12:17:45, skipping insertion in model container 71.18/24.01 [2019-03-28 12:17:45,846 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:17:45" (2/4) ... 71.18/24.01 [2019-03-28 12:17:45,846 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42e8c300 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 12:17:45, skipping insertion in model container 71.18/24.01 [2019-03-28 12:17:45,846 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:17:45" (3/4) ... 71.18/24.01 [2019-03-28 12:17:45,847 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42e8c300 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:17:45, skipping insertion in model container 71.18/24.01 [2019-03-28 12:17:45,847 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:17:45" (4/4) ... 71.18/24.01 [2019-03-28 12:17:45,849 INFO L112 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 71.18/24.01 [2019-03-28 12:17:45,859 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION 71.18/24.01 [2019-03-28 12:17:45,867 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 0 error locations. 71.18/24.01 [2019-03-28 12:17:45,888 INFO L257 AbstractCegarLoop]: Starting to check reachability of 0 error locations. 71.18/24.01 [2019-03-28 12:17:45,917 INFO L133 ementStrategyFactory]: Using default assertion order modulation 71.18/24.01 [2019-03-28 12:17:45,918 INFO L382 AbstractCegarLoop]: Interprodecural is true 71.18/24.01 [2019-03-28 12:17:45,918 INFO L383 AbstractCegarLoop]: Hoare is true 71.18/24.01 [2019-03-28 12:17:45,918 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates 71.18/24.01 [2019-03-28 12:17:45,918 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE 71.18/24.01 [2019-03-28 12:17:45,918 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION 71.18/24.01 [2019-03-28 12:17:45,918 INFO L387 AbstractCegarLoop]: Difference is false 71.18/24.01 [2019-03-28 12:17:45,919 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA 71.18/24.01 [2019-03-28 12:17:45,919 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== 71.18/24.01 [2019-03-28 12:17:45,936 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states. 71.18/24.01 [2019-03-28 12:17:45,942 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. 71.18/24.01 [2019-03-28 12:17:45,948 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 15 states. 71.18/24.01 [2019-03-28 12:17:46,008 INFO L451 ceAbstractionStarter]: At program point L46(line 46) the Hoare annotation is: true 71.18/24.01 [2019-03-28 12:17:46,009 INFO L451 ceAbstractionStarter]: At program point loopENTRY(lines 40 48) the Hoare annotation is: true 71.18/24.01 [2019-03-28 12:17:46,009 INFO L448 ceAbstractionStarter]: For program point L41(lines 41 47) no Hoare annotation was computed. 71.18/24.01 [2019-03-28 12:17:46,009 INFO L448 ceAbstractionStarter]: For program point L41-1(lines 40 48) no Hoare annotation was computed. 71.18/24.01 [2019-03-28 12:17:46,009 INFO L451 ceAbstractionStarter]: At program point L37(lines 32 38) the Hoare annotation is: true 71.18/24.01 [2019-03-28 12:17:46,010 INFO L448 ceAbstractionStarter]: For program point loopEXIT(lines 40 48) no Hoare annotation was computed. 71.18/24.01 [2019-03-28 12:17:46,010 INFO L448 ceAbstractionStarter]: For program point L34(lines 34 37) no Hoare annotation was computed. 71.18/24.01 [2019-03-28 12:17:46,010 INFO L448 ceAbstractionStarter]: For program point L34-1(lines 34 37) no Hoare annotation was computed. 71.18/24.01 [2019-03-28 12:17:46,010 INFO L448 ceAbstractionStarter]: For program point L34-2(lines 34 37) no Hoare annotation was computed. 71.18/24.01 [2019-03-28 12:17:46,011 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. 71.18/24.01 [2019-03-28 12:17:46,011 INFO L451 ceAbstractionStarter]: At program point L28(line 28) the Hoare annotation is: true 71.18/24.01 [2019-03-28 12:17:46,011 INFO L451 ceAbstractionStarter]: At program point L37(lines 32 38) the Hoare annotation is: true 71.18/24.01 [2019-03-28 12:17:46,011 INFO L451 ceAbstractionStarter]: At program point L37-1(lines 32 38) the Hoare annotation is: true 71.18/24.01 [2019-03-28 12:17:46,011 INFO L451 ceAbstractionStarter]: At program point L37-2(lines 32 38) the Hoare annotation is: true 71.18/24.01 [2019-03-28 12:17:46,012 INFO L448 ceAbstractionStarter]: For program point L34(lines 34 37) no Hoare annotation was computed. 71.18/24.01 [2019-03-28 12:17:46,020 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:17:46 BasicIcfg 71.18/24.01 [2019-03-28 12:17:46,021 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- 71.18/24.01 [2019-03-28 12:17:46,021 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- 71.18/24.01 [2019-03-28 12:17:46,021 INFO L271 PluginConnector]: Initializing BuchiAutomizer... 71.18/24.01 [2019-03-28 12:17:46,025 INFO L276 PluginConnector]: BuchiAutomizer initialized 71.18/24.01 [2019-03-28 12:17:46,026 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 71.18/24.01 [2019-03-28 12:17:46,026 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.03 12:17:45" (1/5) ... 71.18/24.01 [2019-03-28 12:17:46,026 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5baaa7c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.03 12:17:46, skipping insertion in model container 71.18/24.01 [2019-03-28 12:17:46,027 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 71.18/24.01 [2019-03-28 12:17:46,027 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:17:45" (2/5) ... 71.18/24.01 [2019-03-28 12:17:46,027 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5baaa7c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.03 12:17:46, skipping insertion in model container 71.18/24.01 [2019-03-28 12:17:46,027 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 71.18/24.01 [2019-03-28 12:17:46,027 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:17:45" (3/5) ... 71.18/24.01 [2019-03-28 12:17:46,028 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5baaa7c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:17:46, skipping insertion in model container 71.18/24.01 [2019-03-28 12:17:46,028 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 71.18/24.01 [2019-03-28 12:17:46,028 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:17:45" (4/5) ... 71.18/24.01 [2019-03-28 12:17:46,028 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5baaa7c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:17:46, skipping insertion in model container 71.18/24.01 [2019-03-28 12:17:46,029 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 71.18/24.01 [2019-03-28 12:17:46,029 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:17:46" (5/5) ... 71.18/24.01 [2019-03-28 12:17:46,030 INFO L375 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 71.18/24.01 [2019-03-28 12:17:46,058 INFO L133 ementStrategyFactory]: Using default assertion order modulation 71.18/24.01 [2019-03-28 12:17:46,058 INFO L374 BuchiCegarLoop]: Interprodecural is true 71.18/24.01 [2019-03-28 12:17:46,058 INFO L375 BuchiCegarLoop]: Hoare is true 71.18/24.01 [2019-03-28 12:17:46,058 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates 71.18/24.01 [2019-03-28 12:17:46,058 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE 71.18/24.01 [2019-03-28 12:17:46,058 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION 71.18/24.01 [2019-03-28 12:17:46,059 INFO L379 BuchiCegarLoop]: Difference is false 71.18/24.01 [2019-03-28 12:17:46,059 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA 71.18/24.01 [2019-03-28 12:17:46,059 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== 71.18/24.01 [2019-03-28 12:17:46,063 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. 71.18/24.01 [2019-03-28 12:17:46,083 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 71.18/24.01 [2019-03-28 12:17:46,083 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 71.18/24.01 [2019-03-28 12:17:46,083 INFO L119 BuchiIsEmpty]: Starting construction of run 71.18/24.01 [2019-03-28 12:17:46,091 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] 71.18/24.01 [2019-03-28 12:17:46,091 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] 71.18/24.01 [2019-03-28 12:17:46,091 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ 71.18/24.01 [2019-03-28 12:17:46,091 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. 71.18/24.01 [2019-03-28 12:17:46,093 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 71.18/24.01 [2019-03-28 12:17:46,093 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 71.18/24.01 [2019-03-28 12:17:46,093 INFO L119 BuchiIsEmpty]: Starting construction of run 71.18/24.01 [2019-03-28 12:17:46,094 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] 71.18/24.01 [2019-03-28 12:17:46,094 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] 71.18/24.01 [2019-03-28 12:17:46,100 INFO L794 eck$LassoCheckResult]: Stem: 10#ULTIMATE.startENTRYtrue [58] ULTIMATE.startENTRY-->L34: Formula: (and (= v_ULTIMATE.start_main_~y~0_1 |v_ULTIMATE.start_main_#t~nondet1_4|) (= v_ULTIMATE.start_main_~x~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|) (= v_ULTIMATE.start_main_~z~0_1 |v_ULTIMATE.start_main_#t~nondet2_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_1|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_1|, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_1, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1, ULTIMATE.start_random_#res=|v_ULTIMATE.start_random_#res_4|, ULTIMATE.start_random_#t~nondet6=|v_ULTIMATE.start_random_#t~nondet6_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_2|, ULTIMATE.start_random_~x~1=v_ULTIMATE.start_random_~x~1_3, ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_1, ULTIMATE.start_main_#t~ret5=|v_ULTIMATE.start_main_#t~ret5_4|, ULTIMATE.start_main_#t~ret3=|v_ULTIMATE.start_main_#t~ret3_3|, ULTIMATE.start_main_#t~ret4=|v_ULTIMATE.start_main_#t~ret4_3|} AuxVars[|v_ULTIMATE.start_main_#t~nondet2_4|, |v_ULTIMATE.start_main_#t~nondet1_4|, |v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_~z~0, ULTIMATE.start_main_~x~0, ULTIMATE.start_random_#res, ULTIMATE.start_random_#t~nondet6, ULTIMATE.start_main_#res, ULTIMATE.start_random_~x~1, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_#t~ret5, ULTIMATE.start_main_#t~ret3, ULTIMATE.start_main_#t~ret4] 15#L34true [72] L34-->L37: Formula: (and (>= v_ULTIMATE.start_random_~x~1_6 0) (= |v_ULTIMATE.start_random_#res_6| v_ULTIMATE.start_random_~x~1_6)) InVars {ULTIMATE.start_random_~x~1=v_ULTIMATE.start_random_~x~1_6} OutVars{ULTIMATE.start_random_~x~1=v_ULTIMATE.start_random_~x~1_6, ULTIMATE.start_random_#res=|v_ULTIMATE.start_random_#res_6|} AuxVars[] AssignedVars[ULTIMATE.start_random_#res] 4#L37true [52] L37-->L34-1: Formula: (= |v_ULTIMATE.start_main_#t~ret3_4| |v_ULTIMATE.start_random_#res_8|) InVars {ULTIMATE.start_random_#res=|v_ULTIMATE.start_random_#res_8|} OutVars{ULTIMATE.start_random_#t~nondet6=|v_ULTIMATE.start_random_#t~nondet6_3|, ULTIMATE.start_main_#t~ret3=|v_ULTIMATE.start_main_#t~ret3_4|, ULTIMATE.start_random_~x~1=v_ULTIMATE.start_random_~x~1_7, ULTIMATE.start_random_#res=|v_ULTIMATE.start_random_#res_7|} AuxVars[] AssignedVars[ULTIMATE.start_random_#t~nondet6, ULTIMATE.start_random_~x~1, ULTIMATE.start_main_#t~ret3, ULTIMATE.start_random_#res] 13#L34-1true [62] L34-1-->L37-1: Formula: (and (= |v_ULTIMATE.start_random_#res_9| (- v_ULTIMATE.start_random_~x~1_9)) (< v_ULTIMATE.start_random_~x~1_9 0)) InVars {ULTIMATE.start_random_~x~1=v_ULTIMATE.start_random_~x~1_9} OutVars{ULTIMATE.start_random_~x~1=v_ULTIMATE.start_random_~x~1_9, ULTIMATE.start_random_#res=|v_ULTIMATE.start_random_#res_9|} AuxVars[] AssignedVars[ULTIMATE.start_random_#res] 17#L37-1true [69] L37-1-->L34-2: Formula: (= |v_ULTIMATE.start_main_#t~ret4_4| |v_ULTIMATE.start_random_#res_12|) InVars {ULTIMATE.start_random_#res=|v_ULTIMATE.start_random_#res_12|} OutVars{ULTIMATE.start_random_#t~nondet6=|v_ULTIMATE.start_random_#t~nondet6_5|, ULTIMATE.start_random_~x~1=v_ULTIMATE.start_random_~x~1_11, ULTIMATE.start_random_#res=|v_ULTIMATE.start_random_#res_11|, ULTIMATE.start_main_#t~ret4=|v_ULTIMATE.start_main_#t~ret4_4|} AuxVars[] AssignedVars[ULTIMATE.start_random_#t~nondet6, ULTIMATE.start_random_~x~1, ULTIMATE.start_random_#res, ULTIMATE.start_main_#t~ret4] 11#L34-2true [59] L34-2-->L37-2: Formula: (and (= |v_ULTIMATE.start_random_#res_1| (- v_ULTIMATE.start_random_~x~1_1)) (< v_ULTIMATE.start_random_~x~1_1 0)) InVars {ULTIMATE.start_random_~x~1=v_ULTIMATE.start_random_~x~1_1} OutVars{ULTIMATE.start_random_~x~1=v_ULTIMATE.start_random_~x~1_1, ULTIMATE.start_random_#res=|v_ULTIMATE.start_random_#res_1|} AuxVars[] AssignedVars[ULTIMATE.start_random_#res] 16#L37-2true [68] L37-2-->L28: Formula: (= |v_ULTIMATE.start_main_#t~ret5_1| |v_ULTIMATE.start_random_#res_3|) InVars {ULTIMATE.start_random_#res=|v_ULTIMATE.start_random_#res_3|} OutVars{ULTIMATE.start_main_#t~ret5=|v_ULTIMATE.start_main_#t~ret5_1|, ULTIMATE.start_random_#res=|v_ULTIMATE.start_random_#res_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret5] 7#L28true [54] L28-->loopENTRY: Formula: (and (= |v_loop_#in~cInParam_2| |v_ULTIMATE.start_main_#t~ret5_5|) (= |v_loop_#in~aInParam_2| |v_ULTIMATE.start_main_#t~ret3_5|) (= |v_loop_#in~bInParam_2| |v_ULTIMATE.start_main_#t~ret4_5|)) InVars {ULTIMATE.start_main_#t~ret5=|v_ULTIMATE.start_main_#t~ret5_5|, ULTIMATE.start_main_#t~ret3=|v_ULTIMATE.start_main_#t~ret3_5|, ULTIMATE.start_main_#t~ret4=|v_ULTIMATE.start_main_#t~ret4_5|} OutVars{loop_#in~c=|v_loop_#in~cInParam_2|, loop_#in~b=|v_loop_#in~bInParam_2|, loop_#in~a=|v_loop_#in~aInParam_2|} AuxVars[] AssignedVars[loop_#in~c, loop_#in~b, loop_#in~a]< 5#loopENTRYtrue 71.18/24.01 [2019-03-28 12:17:46,101 INFO L796 eck$LassoCheckResult]: Loop: 5#loopENTRYtrue [50] loopENTRY-->L41: Formula: (and (= v_loop_~b_1 |v_loop_#in~b_1|) (= v_loop_~c_1 |v_loop_#in~c_1|) (= v_loop_~a_1 |v_loop_#in~a_1|)) InVars {loop_#in~c=|v_loop_#in~c_1|, loop_#in~b=|v_loop_#in~b_1|, loop_#in~a=|v_loop_#in~a_1|} OutVars{loop_#in~c=|v_loop_#in~c_1|, loop_#in~b=|v_loop_#in~b_1|, loop_#in~a=|v_loop_#in~a_1|, loop_~b=v_loop_~b_1, loop_~c=v_loop_~c_1, loop_~a=v_loop_~a_1} AuxVars[] AssignedVars[loop_~b, loop_~c, loop_~a] 3#L41true [48] L41-->L34: Formula: (and (= v_loop_~c_2 v_loop_~a_2) (<= (+ v_loop_~c_2 1) v_loop_~b_2)) InVars {loop_~b=v_loop_~b_2, loop_~c=v_loop_~c_2, loop_~a=v_loop_~a_2} OutVars{loop_random_~x~1=v_loop_random_~x~1_1, loop_random_#t~nondet6=|v_loop_random_#t~nondet6_1|, loop_random_#res=|v_loop_random_#res_1|, loop_~b=v_loop_~b_2, loop_~c=v_loop_~c_2, loop_~a=v_loop_~a_2} AuxVars[] AssignedVars[loop_random_~x~1, loop_random_#t~nondet6, loop_random_#res] 8#L34true [55] L34-->L37: Formula: (and (< v_loop_random_~x~1_3 0) (= |v_loop_random_#res_2| (- v_loop_random_~x~1_3))) InVars {loop_random_~x~1=v_loop_random_~x~1_3} OutVars{loop_random_~x~1=v_loop_random_~x~1_3, loop_random_#res=|v_loop_random_#res_2|} AuxVars[] AssignedVars[loop_random_#res] 12#L37true [61] L37-->L46: Formula: (and (= v_loop_~a_3 v_loop_~c_3) (= v_loop_~c_3 (+ v_loop_~r~0_1 v_loop_~c_4 1)) (= v_loop_~b_3 10) (= v_loop_~r~0_1 |v_loop_random_#res_4|)) InVars {loop_~c=v_loop_~c_4, loop_random_#res=|v_loop_random_#res_4|} OutVars{loop_~r~0=v_loop_~r~0_1, loop_#t~ret7=|v_loop_#t~ret7_1|, loop_random_#res=|v_loop_random_#res_4|, loop_~b=v_loop_~b_3, loop_~c=v_loop_~c_3, loop_~a=v_loop_~a_3} AuxVars[] AssignedVars[loop_~r~0, loop_#t~ret7, loop_~b, loop_~c, loop_~a] 9#L46true [57] L46-->loopENTRY: Formula: (and (= |v_loop_#in~bInParam_1| v_loop_~b_6) (= |v_loop_#in~cInParam_1| v_loop_~c_7) (= |v_loop_#in~aInParam_1| v_loop_~a_6)) InVars {loop_~b=v_loop_~b_6, loop_~c=v_loop_~c_7, loop_~a=v_loop_~a_6} OutVars{loop_#in~c=|v_loop_#in~cInParam_1|, loop_#in~b=|v_loop_#in~bInParam_1|, loop_#in~a=|v_loop_#in~aInParam_1|} AuxVars[] AssignedVars[loop_#in~c, loop_#in~b, loop_#in~a]< 5#loopENTRYtrue 71.18/24.01 [2019-03-28 12:17:46,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 71.18/24.01 [2019-03-28 12:17:46,107 INFO L82 PathProgramCache]: Analyzing trace with hash 1515141345, now seen corresponding path program 1 times 71.18/24.01 [2019-03-28 12:17:46,109 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 71.18/24.01 [2019-03-28 12:17:46,109 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 71.18/24.01 [2019-03-28 12:17:46,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 71.18/24.01 [2019-03-28 12:17:46,130 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 71.18/24.01 [2019-03-28 12:17:46,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 71.18/24.01 [2019-03-28 12:17:46,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 71.18/24.01 [2019-03-28 12:17:46,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 71.18/24.01 [2019-03-28 12:17:46,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 71.18/24.01 [2019-03-28 12:17:46,196 INFO L82 PathProgramCache]: Analyzing trace with hash 76289972, now seen corresponding path program 1 times 71.18/24.01 [2019-03-28 12:17:46,196 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 71.18/24.01 [2019-03-28 12:17:46,196 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 71.18/24.01 [2019-03-28 12:17:46,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 71.18/24.01 [2019-03-28 12:17:46,198 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 71.18/24.01 [2019-03-28 12:17:46,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 71.18/24.01 [2019-03-28 12:17:46,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 71.18/24.01 [2019-03-28 12:17:46,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 71.18/24.01 [2019-03-28 12:17:46,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 71.18/24.01 [2019-03-28 12:17:46,217 INFO L82 PathProgramCache]: Analyzing trace with hash -784504108, now seen corresponding path program 1 times 71.18/24.01 [2019-03-28 12:17:46,217 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 71.18/24.01 [2019-03-28 12:17:46,217 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 71.18/24.01 [2019-03-28 12:17:46,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 71.18/24.01 [2019-03-28 12:17:46,218 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 71.18/24.01 [2019-03-28 12:17:46,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 71.18/24.01 [2019-03-28 12:17:46,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 71.18/24.01 [2019-03-28 12:17:46,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 71.18/24.01 [2019-03-28 12:17:46,428 INFO L216 LassoAnalysis]: Preferences: 71.18/24.01 [2019-03-28 12:17:46,429 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 71.18/24.01 [2019-03-28 12:17:46,429 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 71.18/24.01 [2019-03-28 12:17:46,429 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 71.18/24.01 [2019-03-28 12:17:46,429 INFO L127 ssoRankerPreferences]: Use exernal solver: true 71.18/24.01 [2019-03-28 12:17:46,430 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 71.18/24.01 [2019-03-28 12:17:46,430 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 71.18/24.01 [2019-03-28 12:17:46,430 INFO L130 ssoRankerPreferences]: Path of dumped script: 71.18/24.01 [2019-03-28 12:17:46,430 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Loop 71.18/24.01 [2019-03-28 12:17:46,430 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 71.18/24.01 [2019-03-28 12:17:46,430 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 71.18/24.01 [2019-03-28 12:17:46,450 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 71.18/24.01 [2019-03-28 12:17:46,459 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 71.18/24.01 [2019-03-28 12:17:46,462 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 71.18/24.01 [2019-03-28 12:17:46,467 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 71.18/24.01 [2019-03-28 12:17:46,471 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 71.18/24.01 [2019-03-28 12:17:46,475 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 71.18/24.01 [2019-03-28 12:17:46,477 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 71.18/24.01 [2019-03-28 12:17:46,480 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 71.18/24.01 [2019-03-28 12:17:46,495 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 71.18/24.01 [2019-03-28 12:17:46,579 INFO L300 LassoAnalysis]: Preprocessing complete. 71.18/24.01 [2019-03-28 12:17:46,580 INFO L412 LassoAnalysis]: Checking for nontermination... 71.18/24.01 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 71.18/24.01 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 71.18/24.01 Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 71.18/24.01 [2019-03-28 12:17:46,588 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 71.18/24.01 [2019-03-28 12:17:46,589 INFO L163 nArgumentSynthesizer]: Using integer mode. 71.18/24.01 [2019-03-28 12:17:46,598 INFO L445 LassoAnalysis]: Proved nontermination for one component. 71.18/24.01 [2019-03-28 12:17:46,598 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {loop_random_#t~nondet6=0} Honda state: {loop_random_#t~nondet6=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 71.18/24.01 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 71.18/24.01 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 71.18/24.01 Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 71.18/24.01 [2019-03-28 12:17:46,631 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 71.18/24.01 [2019-03-28 12:17:46,632 INFO L163 nArgumentSynthesizer]: Using integer mode. 71.18/24.01 [2019-03-28 12:17:46,638 INFO L445 LassoAnalysis]: Proved nontermination for one component. 71.18/24.01 [2019-03-28 12:17:46,638 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {loop_#t~ret7=0} Honda state: {loop_#t~ret7=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 71.18/24.01 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 71.18/24.01 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 71.18/24.01 Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 71.18/24.01 [2019-03-28 12:17:46,667 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 71.18/24.01 [2019-03-28 12:17:46,667 INFO L163 nArgumentSynthesizer]: Using integer mode. 71.18/24.01 [2019-03-28 12:17:46,671 INFO L445 LassoAnalysis]: Proved nontermination for one component. 71.18/24.01 [2019-03-28 12:17:46,671 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {loop_~r~0=0} Honda state: {loop_~r~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 71.18/24.01 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 71.18/24.01 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 71.18/24.01 Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 71.18/24.01 [2019-03-28 12:17:46,698 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 71.18/24.01 [2019-03-28 12:17:46,698 INFO L163 nArgumentSynthesizer]: Using integer mode. 71.18/24.01 [2019-03-28 12:17:46,701 INFO L445 LassoAnalysis]: Proved nontermination for one component. 71.18/24.01 [2019-03-28 12:17:46,702 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {loop_random_~x~1=0} Honda state: {loop_random_~x~1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 71.18/24.01 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 71.18/24.01 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 71.18/24.01 Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 71.18/24.01 [2019-03-28 12:17:46,728 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 71.18/24.01 [2019-03-28 12:17:46,729 INFO L163 nArgumentSynthesizer]: Using integer mode. 71.18/24.01 [2019-03-28 12:17:46,732 INFO L445 LassoAnalysis]: Proved nontermination for one component. 71.18/24.01 [2019-03-28 12:17:46,733 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {loop_~c=0} Honda state: {loop_~c=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 71.18/24.01 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 71.18/24.01 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 71.18/24.01 Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 71.18/24.01 [2019-03-28 12:17:46,762 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 71.18/24.01 [2019-03-28 12:17:46,762 INFO L163 nArgumentSynthesizer]: Using integer mode. 71.18/24.01 [2019-03-28 12:17:46,766 INFO L445 LassoAnalysis]: Proved nontermination for one component. 71.18/24.01 [2019-03-28 12:17:46,766 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {loop_~b=0} Honda state: {loop_~b=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 71.18/24.01 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 71.18/24.01 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 71.18/24.01 Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 71.18/24.01 [2019-03-28 12:17:46,794 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 71.18/24.01 [2019-03-28 12:17:46,794 INFO L163 nArgumentSynthesizer]: Using integer mode. 71.18/24.01 [2019-03-28 12:17:46,798 INFO L445 LassoAnalysis]: Proved nontermination for one component. 71.18/24.01 [2019-03-28 12:17:46,798 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {loop_~a=0} Honda state: {loop_~a=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 71.18/24.01 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 71.18/24.01 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 71.18/24.01 Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 71.18/24.01 [2019-03-28 12:17:46,825 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 71.18/24.01 [2019-03-28 12:17:46,825 INFO L163 nArgumentSynthesizer]: Using integer mode. 71.18/24.01 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 71.18/24.01 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 71.18/24.01 Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 71.18/24.01 [2019-03-28 12:17:46,859 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 71.18/24.01 [2019-03-28 12:17:46,859 INFO L163 nArgumentSynthesizer]: Using integer mode. 71.18/24.01 [2019-03-28 12:17:49,757 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. 71.18/24.01 [2019-03-28 12:17:49,766 INFO L216 LassoAnalysis]: Preferences: 71.18/24.01 [2019-03-28 12:17:49,766 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 71.18/24.01 [2019-03-28 12:17:49,766 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 71.18/24.01 [2019-03-28 12:17:49,766 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 71.18/24.01 [2019-03-28 12:17:49,766 INFO L127 ssoRankerPreferences]: Use exernal solver: false 71.18/24.01 [2019-03-28 12:17:49,766 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 71.18/24.01 [2019-03-28 12:17:49,767 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 71.18/24.01 [2019-03-28 12:17:49,767 INFO L130 ssoRankerPreferences]: Path of dumped script: 71.18/24.01 [2019-03-28 12:17:49,767 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Loop 71.18/24.01 [2019-03-28 12:17:49,767 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 71.18/24.01 [2019-03-28 12:17:49,767 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 71.18/24.01 [2019-03-28 12:17:49,769 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 71.18/24.01 [2019-03-28 12:17:49,771 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 71.18/24.01 [2019-03-28 12:17:49,773 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 71.18/24.01 [2019-03-28 12:17:49,775 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 71.18/24.01 [2019-03-28 12:17:49,777 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 71.18/24.01 [2019-03-28 12:17:49,779 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 71.18/24.01 [2019-03-28 12:17:49,781 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 71.18/24.01 [2019-03-28 12:17:49,795 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 71.18/24.01 [2019-03-28 12:17:49,797 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 71.18/24.01 [2019-03-28 12:17:49,865 INFO L300 LassoAnalysis]: Preprocessing complete. 71.18/24.01 [2019-03-28 12:17:49,871 INFO L497 LassoAnalysis]: Using template 'affine'. 71.18/24.01 [2019-03-28 12:17:49,873 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 71.18/24.01 Termination analysis: LINEAR_WITH_GUESSES 71.18/24.01 Number of strict supporting invariants: 0 71.18/24.01 Number of non-strict supporting invariants: 1 71.18/24.01 Consider only non-deceasing supporting invariants: true 71.18/24.01 Simplify termination arguments: true 71.18/24.01 Simplify supporting invariants: trueOverapproximate stem: false 71.18/24.01 [2019-03-28 12:17:49,875 INFO L339 nArgumentSynthesizer]: Template has degree 0. 71.18/24.01 [2019-03-28 12:17:49,875 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 71.18/24.01 [2019-03-28 12:17:49,876 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 71.18/24.01 [2019-03-28 12:17:49,876 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 71.18/24.01 [2019-03-28 12:17:49,876 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 71.18/24.01 [2019-03-28 12:17:49,878 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 71.18/24.01 [2019-03-28 12:17:49,879 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 71.18/24.01 [2019-03-28 12:17:49,884 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 71.18/24.01 [2019-03-28 12:17:49,885 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 71.18/24.01 Termination analysis: LINEAR_WITH_GUESSES 71.18/24.01 Number of strict supporting invariants: 0 71.18/24.01 Number of non-strict supporting invariants: 1 71.18/24.01 Consider only non-deceasing supporting invariants: true 71.18/24.01 Simplify termination arguments: true 71.18/24.01 Simplify supporting invariants: trueOverapproximate stem: false 71.18/24.01 [2019-03-28 12:17:49,885 INFO L339 nArgumentSynthesizer]: Template has degree 0. 71.18/24.01 [2019-03-28 12:17:49,886 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 71.18/24.01 [2019-03-28 12:17:49,886 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 71.18/24.01 [2019-03-28 12:17:49,886 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 71.18/24.01 [2019-03-28 12:17:49,886 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 71.18/24.01 [2019-03-28 12:17:49,887 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 71.18/24.01 [2019-03-28 12:17:49,887 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 71.18/24.01 [2019-03-28 12:17:49,889 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 71.18/24.01 [2019-03-28 12:17:49,889 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 71.18/24.01 Termination analysis: LINEAR_WITH_GUESSES 71.18/24.01 Number of strict supporting invariants: 0 71.18/24.01 Number of non-strict supporting invariants: 1 71.18/24.01 Consider only non-deceasing supporting invariants: true 71.18/24.01 Simplify termination arguments: true 71.18/24.01 Simplify supporting invariants: trueOverapproximate stem: false 71.18/24.01 [2019-03-28 12:17:49,890 INFO L339 nArgumentSynthesizer]: Template has degree 0. 71.18/24.01 [2019-03-28 12:17:49,890 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 71.18/24.01 [2019-03-28 12:17:49,890 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 71.18/24.01 [2019-03-28 12:17:49,890 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 71.18/24.01 [2019-03-28 12:17:49,891 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 71.18/24.01 [2019-03-28 12:17:49,891 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 71.18/24.01 [2019-03-28 12:17:49,891 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 71.18/24.01 [2019-03-28 12:17:49,893 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 71.18/24.01 [2019-03-28 12:17:49,893 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 71.18/24.01 Termination analysis: LINEAR_WITH_GUESSES 71.18/24.01 Number of strict supporting invariants: 0 71.18/24.01 Number of non-strict supporting invariants: 1 71.18/24.01 Consider only non-deceasing supporting invariants: true 71.18/24.01 Simplify termination arguments: true 71.18/24.01 Simplify supporting invariants: trueOverapproximate stem: false 71.18/24.01 [2019-03-28 12:17:49,894 INFO L339 nArgumentSynthesizer]: Template has degree 0. 71.18/24.01 [2019-03-28 12:17:49,894 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 71.18/24.01 [2019-03-28 12:17:49,894 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 71.18/24.01 [2019-03-28 12:17:49,894 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 71.18/24.01 [2019-03-28 12:17:49,894 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 71.18/24.01 [2019-03-28 12:17:49,895 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 71.18/24.01 [2019-03-28 12:17:49,895 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 71.18/24.01 [2019-03-28 12:17:49,896 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 71.18/24.01 [2019-03-28 12:17:49,897 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 71.18/24.01 Termination analysis: LINEAR_WITH_GUESSES 71.18/24.01 Number of strict supporting invariants: 0 71.18/24.01 Number of non-strict supporting invariants: 1 71.18/24.01 Consider only non-deceasing supporting invariants: true 71.18/24.01 Simplify termination arguments: true 71.18/24.01 Simplify supporting invariants: trueOverapproximate stem: false 71.18/24.01 [2019-03-28 12:17:49,897 INFO L339 nArgumentSynthesizer]: Template has degree 0. 71.18/24.01 [2019-03-28 12:17:49,897 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 71.18/24.01 [2019-03-28 12:17:49,898 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 71.18/24.01 [2019-03-28 12:17:49,898 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 71.18/24.01 [2019-03-28 12:17:49,898 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 71.18/24.01 [2019-03-28 12:17:49,899 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 71.18/24.01 [2019-03-28 12:17:49,899 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 71.18/24.01 [2019-03-28 12:17:49,900 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 71.18/24.01 [2019-03-28 12:17:49,901 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 71.18/24.01 Termination analysis: LINEAR_WITH_GUESSES 71.18/24.01 Number of strict supporting invariants: 0 71.18/24.01 Number of non-strict supporting invariants: 1 71.18/24.01 Consider only non-deceasing supporting invariants: true 71.18/24.01 Simplify termination arguments: true 71.18/24.01 Simplify supporting invariants: trueOverapproximate stem: false 71.18/24.01 [2019-03-28 12:17:49,902 INFO L339 nArgumentSynthesizer]: Template has degree 0. 71.18/24.01 [2019-03-28 12:17:49,902 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 71.18/24.01 [2019-03-28 12:17:49,902 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 71.18/24.01 [2019-03-28 12:17:49,902 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 71.18/24.01 [2019-03-28 12:17:49,902 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 71.18/24.01 [2019-03-28 12:17:49,903 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 71.18/24.01 [2019-03-28 12:17:49,903 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 71.18/24.01 [2019-03-28 12:17:49,904 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 71.18/24.01 [2019-03-28 12:17:49,905 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 71.18/24.01 Termination analysis: LINEAR_WITH_GUESSES 71.18/24.01 Number of strict supporting invariants: 0 71.18/24.01 Number of non-strict supporting invariants: 1 71.18/24.01 Consider only non-deceasing supporting invariants: true 71.18/24.01 Simplify termination arguments: true 71.18/24.01 Simplify supporting invariants: trueOverapproximate stem: false 71.18/24.01 [2019-03-28 12:17:49,905 INFO L339 nArgumentSynthesizer]: Template has degree 0. 71.18/24.01 [2019-03-28 12:17:49,905 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 71.18/24.01 [2019-03-28 12:17:49,906 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 71.18/24.01 [2019-03-28 12:17:49,906 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 71.18/24.01 [2019-03-28 12:17:49,906 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 71.18/24.01 [2019-03-28 12:17:49,907 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 71.18/24.01 [2019-03-28 12:17:49,907 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 71.18/24.01 [2019-03-28 12:17:49,918 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 71.18/24.01 [2019-03-28 12:17:49,919 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 71.18/24.01 Termination analysis: LINEAR_WITH_GUESSES 71.18/24.01 Number of strict supporting invariants: 0 71.18/24.01 Number of non-strict supporting invariants: 1 71.18/24.01 Consider only non-deceasing supporting invariants: true 71.18/24.01 Simplify termination arguments: true 71.18/24.01 Simplify supporting invariants: trueOverapproximate stem: false 71.18/24.01 [2019-03-28 12:17:49,919 INFO L339 nArgumentSynthesizer]: Template has degree 0. 71.18/24.01 [2019-03-28 12:17:49,919 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 71.18/24.01 [2019-03-28 12:17:49,920 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 71.18/24.01 [2019-03-28 12:17:49,920 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 71.18/24.01 [2019-03-28 12:17:49,920 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 71.18/24.01 [2019-03-28 12:17:49,921 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 71.18/24.01 [2019-03-28 12:17:49,921 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 71.18/24.01 [2019-03-28 12:17:49,922 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 71.18/24.01 [2019-03-28 12:17:49,922 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 71.18/24.01 Termination analysis: LINEAR_WITH_GUESSES 71.18/24.01 Number of strict supporting invariants: 0 71.18/24.01 Number of non-strict supporting invariants: 1 71.18/24.01 Consider only non-deceasing supporting invariants: true 71.18/24.01 Simplify termination arguments: true 71.18/24.01 Simplify supporting invariants: trueOverapproximate stem: false 71.18/24.01 [2019-03-28 12:17:49,923 INFO L339 nArgumentSynthesizer]: Template has degree 0. 71.18/24.01 [2019-03-28 12:17:49,923 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 71.18/24.01 [2019-03-28 12:17:49,923 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 71.18/24.01 [2019-03-28 12:17:49,923 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 71.18/24.01 [2019-03-28 12:17:49,924 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 71.18/24.01 [2019-03-28 12:17:49,924 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 71.18/24.01 [2019-03-28 12:17:49,925 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 71.18/24.01 [2019-03-28 12:17:49,926 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 71.18/24.01 [2019-03-28 12:17:49,927 INFO L497 LassoAnalysis]: Using template '2-nested'. 71.18/24.01 [2019-03-28 12:17:49,927 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 71.18/24.01 Termination analysis: LINEAR_WITH_GUESSES 71.18/24.01 Number of strict supporting invariants: 0 71.18/24.01 Number of non-strict supporting invariants: 1 71.18/24.01 Consider only non-deceasing supporting invariants: true 71.18/24.01 Simplify termination arguments: true 71.18/24.01 Simplify supporting invariants: trueOverapproximate stem: false 71.18/24.01 [2019-03-28 12:17:49,928 INFO L339 nArgumentSynthesizer]: Template has degree 0. 71.18/24.01 [2019-03-28 12:17:49,928 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 71.18/24.01 [2019-03-28 12:17:49,928 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 71.18/24.01 [2019-03-28 12:17:49,929 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 71.18/24.01 [2019-03-28 12:17:49,929 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. 71.18/24.01 [2019-03-28 12:17:49,929 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. 71.18/24.01 [2019-03-28 12:17:49,930 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 71.18/24.01 [2019-03-28 12:17:49,931 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 71.18/24.01 [2019-03-28 12:17:49,931 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 71.18/24.01 Termination analysis: LINEAR_WITH_GUESSES 71.18/24.01 Number of strict supporting invariants: 0 71.18/24.01 Number of non-strict supporting invariants: 1 71.18/24.01 Consider only non-deceasing supporting invariants: true 71.18/24.01 Simplify termination arguments: true 71.18/24.01 Simplify supporting invariants: trueOverapproximate stem: false 71.18/24.01 [2019-03-28 12:17:49,932 INFO L339 nArgumentSynthesizer]: Template has degree 0. 71.18/24.01 [2019-03-28 12:17:49,932 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 71.18/24.01 [2019-03-28 12:17:49,932 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 71.18/24.01 [2019-03-28 12:17:49,932 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 71.18/24.01 [2019-03-28 12:17:49,933 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. 71.18/24.01 [2019-03-28 12:17:49,933 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. 71.18/24.01 [2019-03-28 12:17:49,933 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 71.18/24.01 [2019-03-28 12:17:49,935 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 71.18/24.01 [2019-03-28 12:17:49,935 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 71.18/24.01 Termination analysis: LINEAR_WITH_GUESSES 71.18/24.01 Number of strict supporting invariants: 0 71.18/24.01 Number of non-strict supporting invariants: 1 71.18/24.01 Consider only non-deceasing supporting invariants: true 71.18/24.01 Simplify termination arguments: true 71.18/24.01 Simplify supporting invariants: trueOverapproximate stem: false 71.18/24.01 [2019-03-28 12:17:49,936 INFO L339 nArgumentSynthesizer]: Template has degree 0. 71.18/24.01 [2019-03-28 12:17:49,937 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 71.18/24.01 [2019-03-28 12:17:49,937 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 71.18/24.01 [2019-03-28 12:17:49,937 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 71.18/24.01 [2019-03-28 12:17:49,937 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. 71.18/24.01 [2019-03-28 12:17:49,938 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. 71.18/24.01 [2019-03-28 12:17:49,938 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 71.18/24.01 [2019-03-28 12:17:49,939 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 71.18/24.01 [2019-03-28 12:17:49,940 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 71.18/24.01 Termination analysis: LINEAR_WITH_GUESSES 71.18/24.01 Number of strict supporting invariants: 0 71.18/24.01 Number of non-strict supporting invariants: 1 71.18/24.01 Consider only non-deceasing supporting invariants: true 71.18/24.01 Simplify termination arguments: true 71.18/24.01 Simplify supporting invariants: trueOverapproximate stem: false 71.18/24.01 [2019-03-28 12:17:49,940 INFO L339 nArgumentSynthesizer]: Template has degree 0. 71.18/24.01 [2019-03-28 12:17:49,940 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 71.18/24.01 [2019-03-28 12:17:49,940 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 71.18/24.01 [2019-03-28 12:17:49,941 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 71.18/24.01 [2019-03-28 12:17:49,941 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. 71.18/24.01 [2019-03-28 12:17:49,941 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. 71.18/24.01 [2019-03-28 12:17:49,942 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 71.18/24.01 [2019-03-28 12:17:49,943 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 71.18/24.01 [2019-03-28 12:17:49,943 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 71.18/24.01 Termination analysis: LINEAR_WITH_GUESSES 71.18/24.01 Number of strict supporting invariants: 0 71.18/24.01 Number of non-strict supporting invariants: 1 71.18/24.01 Consider only non-deceasing supporting invariants: true 71.18/24.01 Simplify termination arguments: true 71.18/24.01 Simplify supporting invariants: trueOverapproximate stem: false 71.18/24.01 [2019-03-28 12:17:49,944 INFO L339 nArgumentSynthesizer]: Template has degree 0. 71.18/24.01 [2019-03-28 12:17:49,944 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 71.18/24.01 [2019-03-28 12:17:49,944 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 71.18/24.01 [2019-03-28 12:17:49,944 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 71.18/24.01 [2019-03-28 12:17:49,944 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. 71.18/24.01 [2019-03-28 12:17:49,946 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. 71.18/24.01 [2019-03-28 12:17:49,946 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 71.18/24.01 [2019-03-28 12:17:49,947 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 71.18/24.01 [2019-03-28 12:17:49,947 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 71.18/24.01 Termination analysis: LINEAR_WITH_GUESSES 71.18/24.01 Number of strict supporting invariants: 0 71.18/24.01 Number of non-strict supporting invariants: 1 71.18/24.01 Consider only non-deceasing supporting invariants: true 71.18/24.01 Simplify termination arguments: true 71.18/24.01 Simplify supporting invariants: trueOverapproximate stem: false 71.18/24.01 [2019-03-28 12:17:49,948 INFO L339 nArgumentSynthesizer]: Template has degree 0. 71.18/24.01 [2019-03-28 12:17:49,948 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 71.18/24.01 [2019-03-28 12:17:49,948 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 71.18/24.01 [2019-03-28 12:17:49,948 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 71.18/24.01 [2019-03-28 12:17:49,949 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. 71.18/24.01 [2019-03-28 12:17:49,949 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. 71.18/24.01 [2019-03-28 12:17:49,949 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 71.18/24.01 [2019-03-28 12:17:49,951 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 71.18/24.01 [2019-03-28 12:17:49,951 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 71.18/24.01 Termination analysis: LINEAR_WITH_GUESSES 71.18/24.01 Number of strict supporting invariants: 0 71.18/24.01 Number of non-strict supporting invariants: 1 71.18/24.01 Consider only non-deceasing supporting invariants: true 71.18/24.01 Simplify termination arguments: true 71.18/24.01 Simplify supporting invariants: trueOverapproximate stem: false 71.18/24.01 [2019-03-28 12:17:49,952 INFO L339 nArgumentSynthesizer]: Template has degree 0. 71.18/24.01 [2019-03-28 12:17:49,952 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 71.18/24.01 [2019-03-28 12:17:49,952 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 71.18/24.01 [2019-03-28 12:17:49,952 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 71.18/24.01 [2019-03-28 12:17:49,952 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. 71.18/24.01 [2019-03-28 12:17:49,954 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. 71.18/24.01 [2019-03-28 12:17:49,954 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 71.18/24.01 [2019-03-28 12:17:49,966 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 71.18/24.01 [2019-03-28 12:17:49,982 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 71.18/24.01 [2019-03-28 12:17:49,983 INFO L444 ModelExtractionUtils]: 4 out of 9 variables were initially zero. Simplification set additionally 0 variables to zero. 71.18/24.01 [2019-03-28 12:17:49,985 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 71.18/24.01 [2019-03-28 12:17:49,985 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 71.18/24.01 [2019-03-28 12:17:49,986 INFO L518 LassoAnalysis]: Proved termination. 71.18/24.01 [2019-03-28 12:17:49,986 INFO L520 LassoAnalysis]: Termination argument consisting of: 71.18/24.01 Ranking function 2-nested ranking function: 71.18/24.01 f0 = -1*loop_#in~c + 8 71.18/24.01 f1 = -1*loop_#in~c + 1*loop_#in~b 71.18/24.01 Supporting invariants [] 71.18/24.01 [2019-03-28 12:17:49,988 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed 71.18/24.01 [2019-03-28 12:17:50,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 71.18/24.01 [2019-03-28 12:17:50,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 71.18/24.01 [2019-03-28 12:17:50,074 INFO L256 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 4 conjunts are in the unsatisfiable core 71.18/24.01 [2019-03-28 12:17:50,076 INFO L279 TraceCheckSpWp]: Computing forward predicates... 71.18/24.01 [2019-03-28 12:17:50,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 71.18/24.01 [2019-03-28 12:17:50,105 INFO L256 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 17 conjunts are in the unsatisfiable core 71.18/24.01 [2019-03-28 12:17:50,107 INFO L279 TraceCheckSpWp]: Computing forward predicates... 71.18/24.01 [2019-03-28 12:17:50,276 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 71.18/24.01 [2019-03-28 12:17:50,658 INFO L98 LoopCannibalizer]: 17 predicates before loop cannibalization 17 predicates after loop cannibalization 71.18/24.01 [2019-03-28 12:17:50,663 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 17 loop predicates 71.18/24.01 [2019-03-28 12:17:50,665 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 15 states. Second operand 6 states. 71.18/24.01 [2019-03-28 12:17:50,829 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 29 71.18/24.01 [2019-03-28 12:17:51,879 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 15 states.. Second operand 6 states. Result 164 states and 247 transitions. Complement of second has 69 states. 71.18/24.01 [2019-03-28 12:17:51,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 14 states 1 stem states 12 non-accepting loop states 1 accepting loop states 71.18/24.01 [2019-03-28 12:17:51,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. 71.18/24.01 [2019-03-28 12:17:51,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 69 transitions. 71.18/24.01 [2019-03-28 12:17:51,886 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 69 transitions. Stem has 8 letters. Loop has 5 letters. 71.18/24.01 [2019-03-28 12:17:51,888 INFO L116 BuchiAccepts]: Finished buchiAccepts. 71.18/24.01 [2019-03-28 12:17:51,888 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 69 transitions. Stem has 13 letters. Loop has 5 letters. 71.18/24.01 [2019-03-28 12:17:51,889 INFO L116 BuchiAccepts]: Finished buchiAccepts. 71.18/24.01 [2019-03-28 12:17:51,889 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 69 transitions. Stem has 8 letters. Loop has 10 letters. 71.18/24.01 [2019-03-28 12:17:51,889 INFO L116 BuchiAccepts]: Finished buchiAccepts. 71.18/24.01 [2019-03-28 12:17:51,901 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 164 states and 247 transitions. 71.18/24.01 [2019-03-28 12:17:51,913 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 71.18/24.01 [2019-03-28 12:17:51,920 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 164 states to 47 states and 55 transitions. 71.18/24.01 [2019-03-28 12:17:51,921 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 36 71.18/24.01 [2019-03-28 12:17:51,921 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 38 71.18/24.01 [2019-03-28 12:17:51,922 INFO L73 IsDeterministic]: Start isDeterministic. Operand 47 states and 55 transitions. 71.18/24.01 [2019-03-28 12:17:51,922 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 71.18/24.01 [2019-03-28 12:17:51,922 INFO L706 BuchiCegarLoop]: Abstraction has 47 states and 55 transitions. 71.18/24.01 [2019-03-28 12:17:51,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states and 55 transitions. 71.18/24.01 [2019-03-28 12:17:51,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 21. 71.18/24.01 [2019-03-28 12:17:51,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. 71.18/24.01 [2019-03-28 12:17:51,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 27 transitions. 71.18/24.01 [2019-03-28 12:17:51,955 INFO L729 BuchiCegarLoop]: Abstraction has 21 states and 27 transitions. 71.18/24.01 [2019-03-28 12:17:51,955 INFO L609 BuchiCegarLoop]: Abstraction has 21 states and 27 transitions. 71.18/24.01 [2019-03-28 12:17:51,955 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ 71.18/24.01 [2019-03-28 12:17:51,955 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 27 transitions. 71.18/24.01 [2019-03-28 12:17:51,956 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 71.18/24.01 [2019-03-28 12:17:51,956 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 71.18/24.01 [2019-03-28 12:17:51,956 INFO L119 BuchiIsEmpty]: Starting construction of run 71.18/24.01 [2019-03-28 12:17:51,957 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 71.18/24.01 [2019-03-28 12:17:51,957 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] 71.18/24.01 [2019-03-28 12:17:51,957 INFO L794 eck$LassoCheckResult]: Stem: 368#ULTIMATE.startENTRY [58] ULTIMATE.startENTRY-->L34: Formula: (and (= v_ULTIMATE.start_main_~y~0_1 |v_ULTIMATE.start_main_#t~nondet1_4|) (= v_ULTIMATE.start_main_~x~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|) (= v_ULTIMATE.start_main_~z~0_1 |v_ULTIMATE.start_main_#t~nondet2_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_1|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_1|, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_1, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1, ULTIMATE.start_random_#res=|v_ULTIMATE.start_random_#res_4|, ULTIMATE.start_random_#t~nondet6=|v_ULTIMATE.start_random_#t~nondet6_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_2|, ULTIMATE.start_random_~x~1=v_ULTIMATE.start_random_~x~1_3, ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_1, ULTIMATE.start_main_#t~ret5=|v_ULTIMATE.start_main_#t~ret5_4|, ULTIMATE.start_main_#t~ret3=|v_ULTIMATE.start_main_#t~ret3_3|, ULTIMATE.start_main_#t~ret4=|v_ULTIMATE.start_main_#t~ret4_3|} AuxVars[|v_ULTIMATE.start_main_#t~nondet2_4|, |v_ULTIMATE.start_main_#t~nondet1_4|, |v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_~z~0, ULTIMATE.start_main_~x~0, ULTIMATE.start_random_#res, ULTIMATE.start_random_#t~nondet6, ULTIMATE.start_main_#res, ULTIMATE.start_random_~x~1, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_#t~ret5, ULTIMATE.start_main_#t~ret3, ULTIMATE.start_main_#t~ret4] 369#L34 [72] L34-->L37: Formula: (and (>= v_ULTIMATE.start_random_~x~1_6 0) (= |v_ULTIMATE.start_random_#res_6| v_ULTIMATE.start_random_~x~1_6)) InVars {ULTIMATE.start_random_~x~1=v_ULTIMATE.start_random_~x~1_6} OutVars{ULTIMATE.start_random_~x~1=v_ULTIMATE.start_random_~x~1_6, ULTIMATE.start_random_#res=|v_ULTIMATE.start_random_#res_6|} AuxVars[] AssignedVars[ULTIMATE.start_random_#res] 362#L37 [52] L37-->L34-1: Formula: (= |v_ULTIMATE.start_main_#t~ret3_4| |v_ULTIMATE.start_random_#res_8|) InVars {ULTIMATE.start_random_#res=|v_ULTIMATE.start_random_#res_8|} OutVars{ULTIMATE.start_random_#t~nondet6=|v_ULTIMATE.start_random_#t~nondet6_3|, ULTIMATE.start_main_#t~ret3=|v_ULTIMATE.start_main_#t~ret3_4|, ULTIMATE.start_random_~x~1=v_ULTIMATE.start_random_~x~1_7, ULTIMATE.start_random_#res=|v_ULTIMATE.start_random_#res_7|} AuxVars[] AssignedVars[ULTIMATE.start_random_#t~nondet6, ULTIMATE.start_random_~x~1, ULTIMATE.start_main_#t~ret3, ULTIMATE.start_random_#res] 363#L34-1 [62] L34-1-->L37-1: Formula: (and (= |v_ULTIMATE.start_random_#res_9| (- v_ULTIMATE.start_random_~x~1_9)) (< v_ULTIMATE.start_random_~x~1_9 0)) InVars {ULTIMATE.start_random_~x~1=v_ULTIMATE.start_random_~x~1_9} OutVars{ULTIMATE.start_random_~x~1=v_ULTIMATE.start_random_~x~1_9, ULTIMATE.start_random_#res=|v_ULTIMATE.start_random_#res_9|} AuxVars[] AssignedVars[ULTIMATE.start_random_#res] 372#L37-1 [69] L37-1-->L34-2: Formula: (= |v_ULTIMATE.start_main_#t~ret4_4| |v_ULTIMATE.start_random_#res_12|) InVars {ULTIMATE.start_random_#res=|v_ULTIMATE.start_random_#res_12|} OutVars{ULTIMATE.start_random_#t~nondet6=|v_ULTIMATE.start_random_#t~nondet6_5|, ULTIMATE.start_random_~x~1=v_ULTIMATE.start_random_~x~1_11, ULTIMATE.start_random_#res=|v_ULTIMATE.start_random_#res_11|, ULTIMATE.start_main_#t~ret4=|v_ULTIMATE.start_main_#t~ret4_4|} AuxVars[] AssignedVars[ULTIMATE.start_random_#t~nondet6, ULTIMATE.start_random_~x~1, ULTIMATE.start_random_#res, ULTIMATE.start_main_#t~ret4] 370#L34-2 [59] L34-2-->L37-2: Formula: (and (= |v_ULTIMATE.start_random_#res_1| (- v_ULTIMATE.start_random_~x~1_1)) (< v_ULTIMATE.start_random_~x~1_1 0)) InVars {ULTIMATE.start_random_~x~1=v_ULTIMATE.start_random_~x~1_1} OutVars{ULTIMATE.start_random_~x~1=v_ULTIMATE.start_random_~x~1_1, ULTIMATE.start_random_#res=|v_ULTIMATE.start_random_#res_1|} AuxVars[] AssignedVars[ULTIMATE.start_random_#res] 371#L37-2 [68] L37-2-->L28: Formula: (= |v_ULTIMATE.start_main_#t~ret5_1| |v_ULTIMATE.start_random_#res_3|) InVars {ULTIMATE.start_random_#res=|v_ULTIMATE.start_random_#res_3|} OutVars{ULTIMATE.start_main_#t~ret5=|v_ULTIMATE.start_main_#t~ret5_1|, ULTIMATE.start_random_#res=|v_ULTIMATE.start_random_#res_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret5] 358#L28 [54] L28-->loopENTRY: Formula: (and (= |v_loop_#in~cInParam_2| |v_ULTIMATE.start_main_#t~ret5_5|) (= |v_loop_#in~aInParam_2| |v_ULTIMATE.start_main_#t~ret3_5|) (= |v_loop_#in~bInParam_2| |v_ULTIMATE.start_main_#t~ret4_5|)) InVars {ULTIMATE.start_main_#t~ret5=|v_ULTIMATE.start_main_#t~ret5_5|, ULTIMATE.start_main_#t~ret3=|v_ULTIMATE.start_main_#t~ret3_5|, ULTIMATE.start_main_#t~ret4=|v_ULTIMATE.start_main_#t~ret4_5|} OutVars{loop_#in~c=|v_loop_#in~cInParam_2|, loop_#in~b=|v_loop_#in~bInParam_2|, loop_#in~a=|v_loop_#in~aInParam_2|} AuxVars[] AssignedVars[loop_#in~c, loop_#in~b, loop_#in~a]< 364#loopENTRY [50] loopENTRY-->L41: Formula: (and (= v_loop_~b_1 |v_loop_#in~b_1|) (= v_loop_~c_1 |v_loop_#in~c_1|) (= v_loop_~a_1 |v_loop_#in~a_1|)) InVars {loop_#in~c=|v_loop_#in~c_1|, loop_#in~b=|v_loop_#in~b_1|, loop_#in~a=|v_loop_#in~a_1|} OutVars{loop_#in~c=|v_loop_#in~c_1|, loop_#in~b=|v_loop_#in~b_1|, loop_#in~a=|v_loop_#in~a_1|, loop_~b=v_loop_~b_1, loop_~c=v_loop_~c_1, loop_~a=v_loop_~a_1} AuxVars[] AssignedVars[loop_~b, loop_~c, loop_~a] 361#L41 [48] L41-->L34: Formula: (and (= v_loop_~c_2 v_loop_~a_2) (<= (+ v_loop_~c_2 1) v_loop_~b_2)) InVars {loop_~b=v_loop_~b_2, loop_~c=v_loop_~c_2, loop_~a=v_loop_~a_2} OutVars{loop_random_~x~1=v_loop_random_~x~1_1, loop_random_#t~nondet6=|v_loop_random_#t~nondet6_1|, loop_random_#res=|v_loop_random_#res_1|, loop_~b=v_loop_~b_2, loop_~c=v_loop_~c_2, loop_~a=v_loop_~a_2} AuxVars[] AssignedVars[loop_random_~x~1, loop_random_#t~nondet6, loop_random_#res] 365#L34 [76] L34-->L37: Formula: (and (= |v_loop_random_#res_3| v_loop_random_~x~1_4) (>= v_loop_random_~x~1_4 0)) InVars {loop_random_~x~1=v_loop_random_~x~1_4} OutVars{loop_random_~x~1=v_loop_random_~x~1_4, loop_random_#res=|v_loop_random_#res_3|} AuxVars[] AssignedVars[loop_random_#res] 366#L37 71.18/24.01 [2019-03-28 12:17:51,958 INFO L796 eck$LassoCheckResult]: Loop: 366#L37 [61] L37-->L46: Formula: (and (= v_loop_~a_3 v_loop_~c_3) (= v_loop_~c_3 (+ v_loop_~r~0_1 v_loop_~c_4 1)) (= v_loop_~b_3 10) (= v_loop_~r~0_1 |v_loop_random_#res_4|)) InVars {loop_~c=v_loop_~c_4, loop_random_#res=|v_loop_random_#res_4|} OutVars{loop_~r~0=v_loop_~r~0_1, loop_#t~ret7=|v_loop_#t~ret7_1|, loop_random_#res=|v_loop_random_#res_4|, loop_~b=v_loop_~b_3, loop_~c=v_loop_~c_3, loop_~a=v_loop_~a_3} AuxVars[] AssignedVars[loop_~r~0, loop_#t~ret7, loop_~b, loop_~c, loop_~a] 353#L46 [57] L46-->loopENTRY: Formula: (and (= |v_loop_#in~bInParam_1| v_loop_~b_6) (= |v_loop_#in~cInParam_1| v_loop_~c_7) (= |v_loop_#in~aInParam_1| v_loop_~a_6)) InVars {loop_~b=v_loop_~b_6, loop_~c=v_loop_~c_7, loop_~a=v_loop_~a_6} OutVars{loop_#in~c=|v_loop_#in~cInParam_1|, loop_#in~b=|v_loop_#in~bInParam_1|, loop_#in~a=|v_loop_#in~aInParam_1|} AuxVars[] AssignedVars[loop_#in~c, loop_#in~b, loop_#in~a]< 359#loopENTRY [50] loopENTRY-->L41: Formula: (and (= v_loop_~b_1 |v_loop_#in~b_1|) (= v_loop_~c_1 |v_loop_#in~c_1|) (= v_loop_~a_1 |v_loop_#in~a_1|)) InVars {loop_#in~c=|v_loop_#in~c_1|, loop_#in~b=|v_loop_#in~b_1|, loop_#in~a=|v_loop_#in~a_1|} OutVars{loop_#in~c=|v_loop_#in~c_1|, loop_#in~b=|v_loop_#in~b_1|, loop_#in~a=|v_loop_#in~a_1|, loop_~b=v_loop_~b_1, loop_~c=v_loop_~c_1, loop_~a=v_loop_~a_1} AuxVars[] AssignedVars[loop_~b, loop_~c, loop_~a] 352#L41 [48] L41-->L34: Formula: (and (= v_loop_~c_2 v_loop_~a_2) (<= (+ v_loop_~c_2 1) v_loop_~b_2)) InVars {loop_~b=v_loop_~b_2, loop_~c=v_loop_~c_2, loop_~a=v_loop_~a_2} OutVars{loop_random_~x~1=v_loop_random_~x~1_1, loop_random_#t~nondet6=|v_loop_random_#t~nondet6_1|, loop_random_#res=|v_loop_random_#res_1|, loop_~b=v_loop_~b_2, loop_~c=v_loop_~c_2, loop_~a=v_loop_~a_2} AuxVars[] AssignedVars[loop_random_~x~1, loop_random_#t~nondet6, loop_random_#res] 354#L34 [55] L34-->L37: Formula: (and (< v_loop_random_~x~1_3 0) (= |v_loop_random_#res_2| (- v_loop_random_~x~1_3))) InVars {loop_random_~x~1=v_loop_random_~x~1_3} OutVars{loop_random_~x~1=v_loop_random_~x~1_3, loop_random_#res=|v_loop_random_#res_2|} AuxVars[] AssignedVars[loop_random_#res] 366#L37 71.18/24.01 [2019-03-28 12:17:51,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 71.18/24.01 [2019-03-28 12:17:51,958 INFO L82 PathProgramCache]: Analyzing trace with hash 1764544845, now seen corresponding path program 1 times 71.18/24.01 [2019-03-28 12:17:51,958 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 71.18/24.01 [2019-03-28 12:17:51,958 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 71.18/24.01 [2019-03-28 12:17:51,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 71.18/24.01 [2019-03-28 12:17:51,960 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 71.18/24.01 [2019-03-28 12:17:51,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 71.18/24.01 [2019-03-28 12:17:51,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 71.18/24.01 [2019-03-28 12:17:51,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 71.18/24.01 [2019-03-28 12:17:51,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 71.18/24.01 [2019-03-28 12:17:51,977 INFO L82 PathProgramCache]: Analyzing trace with hash 86711612, now seen corresponding path program 2 times 71.18/24.01 [2019-03-28 12:17:51,978 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 71.18/24.01 [2019-03-28 12:17:51,978 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 71.18/24.01 [2019-03-28 12:17:51,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 71.18/24.01 [2019-03-28 12:17:51,979 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 71.18/24.01 [2019-03-28 12:17:51,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 71.18/24.01 [2019-03-28 12:17:51,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 71.18/24.01 [2019-03-28 12:17:51,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 71.18/24.01 [2019-03-28 12:17:51,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 71.18/24.01 [2019-03-28 12:17:51,990 INFO L82 PathProgramCache]: Analyzing trace with hash -1643562128, now seen corresponding path program 1 times 71.18/24.01 [2019-03-28 12:17:51,990 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 71.18/24.01 [2019-03-28 12:17:51,990 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 71.18/24.01 [2019-03-28 12:17:51,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 71.18/24.01 [2019-03-28 12:17:51,991 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 71.18/24.01 [2019-03-28 12:17:51,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 71.18/24.01 [2019-03-28 12:17:52,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 71.18/24.01 [2019-03-28 12:17:52,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 71.18/24.01 [2019-03-28 12:17:52,155 INFO L216 LassoAnalysis]: Preferences: 71.18/24.01 [2019-03-28 12:17:52,156 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 71.18/24.01 [2019-03-28 12:17:52,156 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 71.18/24.01 [2019-03-28 12:17:52,156 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 71.18/24.01 [2019-03-28 12:17:52,156 INFO L127 ssoRankerPreferences]: Use exernal solver: true 71.18/24.01 [2019-03-28 12:17:52,156 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 71.18/24.01 [2019-03-28 12:17:52,156 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 71.18/24.01 [2019-03-28 12:17:52,156 INFO L130 ssoRankerPreferences]: Path of dumped script: 71.18/24.01 [2019-03-28 12:17:52,157 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration2_Loop 71.18/24.01 [2019-03-28 12:17:52,157 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 71.18/24.01 [2019-03-28 12:17:52,157 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 71.18/24.01 [2019-03-28 12:17:52,158 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 71.18/24.01 [2019-03-28 12:17:52,160 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 71.18/24.01 [2019-03-28 12:17:52,177 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 71.18/24.01 [2019-03-28 12:17:52,178 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 71.18/24.01 [2019-03-28 12:17:52,251 INFO L300 LassoAnalysis]: Preprocessing complete. 71.18/24.01 [2019-03-28 12:17:52,251 INFO L412 LassoAnalysis]: Checking for nontermination... 71.18/24.01 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 71.18/24.01 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 71.18/24.01 Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 71.18/24.01 [2019-03-28 12:17:52,254 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 71.18/24.01 [2019-03-28 12:17:52,255 INFO L163 nArgumentSynthesizer]: Using integer mode. 71.18/24.01 [2019-03-28 12:17:52,259 INFO L445 LassoAnalysis]: Proved nontermination for one component. 71.18/24.01 [2019-03-28 12:17:52,259 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {loop_#t~ret7=0} Honda state: {loop_#t~ret7=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 71.18/24.01 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 71.18/24.01 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 71.18/24.01 Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 71.18/24.01 [2019-03-28 12:17:52,286 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 71.18/24.01 [2019-03-28 12:17:52,287 INFO L163 nArgumentSynthesizer]: Using integer mode. 71.18/24.01 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 71.18/24.01 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 71.18/24.01 Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 71.18/24.01 [2019-03-28 12:17:52,329 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 71.18/24.01 [2019-03-28 12:17:52,330 INFO L163 nArgumentSynthesizer]: Using integer mode. 71.18/24.01 [2019-03-28 12:18:04,404 INFO L450 LassoAnalysis]: Proving nontermination failed: SMT Solver returned 'unknown'. 71.18/24.01 [2019-03-28 12:18:04,412 INFO L216 LassoAnalysis]: Preferences: 71.18/24.01 [2019-03-28 12:18:04,413 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 71.18/24.01 [2019-03-28 12:18:04,413 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 71.18/24.01 [2019-03-28 12:18:04,413 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 71.18/24.01 [2019-03-28 12:18:04,413 INFO L127 ssoRankerPreferences]: Use exernal solver: false 71.18/24.01 [2019-03-28 12:18:04,413 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 71.18/24.01 [2019-03-28 12:18:04,413 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 71.18/24.01 [2019-03-28 12:18:04,413 INFO L130 ssoRankerPreferences]: Path of dumped script: 71.18/24.01 [2019-03-28 12:18:04,414 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration2_Loop 71.18/24.01 [2019-03-28 12:18:04,414 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 71.18/24.01 [2019-03-28 12:18:04,414 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 71.18/24.01 [2019-03-28 12:18:04,416 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 71.18/24.01 [2019-03-28 12:18:04,418 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 71.18/24.01 [2019-03-28 12:18:04,436 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 71.18/24.01 [2019-03-28 12:18:04,438 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 71.18/24.01 [2019-03-28 12:18:04,505 INFO L300 LassoAnalysis]: Preprocessing complete. 71.18/24.01 [2019-03-28 12:18:04,505 INFO L497 LassoAnalysis]: Using template 'affine'. 71.18/24.01 [2019-03-28 12:18:04,506 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 71.18/24.01 Termination analysis: LINEAR_WITH_GUESSES 71.18/24.01 Number of strict supporting invariants: 0 71.18/24.01 Number of non-strict supporting invariants: 1 71.18/24.01 Consider only non-deceasing supporting invariants: true 71.18/24.01 Simplify termination arguments: true 71.18/24.01 Simplify supporting invariants: trueOverapproximate stem: false 71.18/24.01 [2019-03-28 12:18:04,506 INFO L339 nArgumentSynthesizer]: Template has degree 0. 71.18/24.01 [2019-03-28 12:18:04,506 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 71.18/24.01 [2019-03-28 12:18:04,507 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 71.18/24.01 [2019-03-28 12:18:04,507 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 71.18/24.01 [2019-03-28 12:18:04,507 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 71.18/24.01 [2019-03-28 12:18:04,508 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 71.18/24.01 [2019-03-28 12:18:04,508 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 71.18/24.01 [2019-03-28 12:18:04,509 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 71.18/24.01 [2019-03-28 12:18:04,509 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 71.18/24.01 Termination analysis: LINEAR_WITH_GUESSES 71.18/24.01 Number of strict supporting invariants: 0 71.18/24.01 Number of non-strict supporting invariants: 1 71.18/24.01 Consider only non-deceasing supporting invariants: true 71.18/24.01 Simplify termination arguments: true 71.18/24.01 Simplify supporting invariants: trueOverapproximate stem: false 71.18/24.01 [2019-03-28 12:18:04,510 INFO L339 nArgumentSynthesizer]: Template has degree 0. 71.18/24.01 [2019-03-28 12:18:04,510 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 71.18/24.01 [2019-03-28 12:18:04,510 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 71.18/24.01 [2019-03-28 12:18:04,510 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 71.18/24.01 [2019-03-28 12:18:04,510 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 71.18/24.01 [2019-03-28 12:18:04,512 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 71.18/24.01 [2019-03-28 12:18:04,512 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 71.18/24.01 [2019-03-28 12:18:04,522 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 71.18/24.01 [2019-03-28 12:18:04,530 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 71.18/24.01 [2019-03-28 12:18:04,530 INFO L444 ModelExtractionUtils]: 6 out of 10 variables were initially zero. Simplification set additionally 0 variables to zero. 71.18/24.01 [2019-03-28 12:18:04,531 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 71.18/24.01 [2019-03-28 12:18:04,531 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 71.18/24.01 [2019-03-28 12:18:04,531 INFO L518 LassoAnalysis]: Proved termination. 71.18/24.01 [2019-03-28 12:18:04,531 INFO L520 LassoAnalysis]: Termination argument consisting of: 71.18/24.01 Ranking function f(loop_random_#res, loop_~c) = -1*loop_random_#res - 1*loop_~c + 9 71.18/24.01 Supporting invariants [] 71.18/24.01 [2019-03-28 12:18:04,532 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed 71.18/24.01 [2019-03-28 12:18:04,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 71.18/24.01 [2019-03-28 12:18:04,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 71.18/24.01 [2019-03-28 12:18:04,568 INFO L256 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 4 conjunts are in the unsatisfiable core 71.18/24.01 [2019-03-28 12:18:04,569 INFO L279 TraceCheckSpWp]: Computing forward predicates... 71.18/24.01 [2019-03-28 12:18:04,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 71.18/24.01 [2019-03-28 12:18:04,585 INFO L256 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 14 conjunts are in the unsatisfiable core 71.18/24.01 [2019-03-28 12:18:04,586 INFO L279 TraceCheckSpWp]: Computing forward predicates... 71.18/24.01 [2019-03-28 12:18:04,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 71.18/24.01 [2019-03-28 12:18:04,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 71.18/24.01 [2019-03-28 12:18:04,678 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 71.18/24.01 [2019-03-28 12:18:04,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 71.18/24.01 [2019-03-28 12:18:04,689 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 71.18/24.01 [2019-03-28 12:18:04,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 71.18/24.01 [2019-03-28 12:18:04,700 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 71.18/24.01 [2019-03-28 12:18:04,700 INFO L98 LoopCannibalizer]: 6 predicates before loop cannibalization 6 predicates after loop cannibalization 71.18/24.01 [2019-03-28 12:18:04,700 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 6 loop predicates 71.18/24.01 [2019-03-28 12:18:04,700 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 21 states and 27 transitions. cyclomatic complexity: 8 Second operand 5 states. 71.18/24.01 [2019-03-28 12:18:04,874 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 21 states and 27 transitions. cyclomatic complexity: 8. Second operand 5 states. Result 149 states and 195 transitions. Complement of second has 135 states. 71.18/24.01 [2019-03-28 12:18:04,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 1 stem states 5 non-accepting loop states 2 accepting loop states 71.18/24.01 [2019-03-28 12:18:04,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. 71.18/24.01 [2019-03-28 12:18:04,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 26 transitions. 71.18/24.01 [2019-03-28 12:18:04,876 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 26 transitions. Stem has 11 letters. Loop has 5 letters. 71.18/24.01 [2019-03-28 12:18:04,877 INFO L116 BuchiAccepts]: Finished buchiAccepts. 71.18/24.01 [2019-03-28 12:18:04,877 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 26 transitions. Stem has 16 letters. Loop has 5 letters. 71.18/24.01 [2019-03-28 12:18:04,877 INFO L116 BuchiAccepts]: Finished buchiAccepts. 71.18/24.01 [2019-03-28 12:18:04,877 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 26 transitions. Stem has 11 letters. Loop has 10 letters. 71.18/24.01 [2019-03-28 12:18:04,878 INFO L116 BuchiAccepts]: Finished buchiAccepts. 71.18/24.01 [2019-03-28 12:18:04,880 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 149 states and 195 transitions. 71.18/24.01 [2019-03-28 12:18:04,885 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 71.18/24.01 [2019-03-28 12:18:04,885 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 149 states to 0 states and 0 transitions. 71.18/24.01 [2019-03-28 12:18:04,885 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 71.18/24.01 [2019-03-28 12:18:04,885 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 71.18/24.01 [2019-03-28 12:18:04,886 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. 71.18/24.01 [2019-03-28 12:18:04,886 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 71.18/24.01 [2019-03-28 12:18:04,886 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 71.18/24.01 [2019-03-28 12:18:04,886 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 71.18/24.01 [2019-03-28 12:18:04,886 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 71.18/24.01 [2019-03-28 12:18:04,886 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ 71.18/24.01 [2019-03-28 12:18:04,886 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. 71.18/24.01 [2019-03-28 12:18:04,886 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 71.18/24.01 [2019-03-28 12:18:04,887 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true 71.18/24.01 [2019-03-28 12:18:04,893 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:18:04 BasicIcfg 71.18/24.01 [2019-03-28 12:18:04,893 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- 71.18/24.01 [2019-03-28 12:18:04,893 INFO L168 Benchmark]: Toolchain (without parser) took 19708.61 ms. Allocated memory was 649.6 MB in the beginning and 762.3 MB in the end (delta: 112.7 MB). Free memory was 559.2 MB in the beginning and 719.5 MB in the end (delta: -160.3 MB). There was no memory consumed. Max. memory is 50.3 GB. 71.18/24.01 [2019-03-28 12:18:04,894 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 649.6 MB. Free memory is still 580.0 MB. There was no memory consumed. Max. memory is 50.3 GB. 71.18/24.01 [2019-03-28 12:18:04,895 INFO L168 Benchmark]: CACSL2BoogieTranslator took 288.50 ms. Allocated memory was 649.6 MB in the beginning and 671.6 MB in the end (delta: 22.0 MB). Free memory was 559.2 MB in the beginning and 638.2 MB in the end (delta: -79.0 MB). Peak memory consumption was 30.6 MB. Max. memory is 50.3 GB. 71.18/24.01 [2019-03-28 12:18:04,895 INFO L168 Benchmark]: Boogie Procedure Inliner took 38.09 ms. Allocated memory is still 671.6 MB. Free memory was 638.2 MB in the beginning and 636.1 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 50.3 GB. 71.18/24.01 [2019-03-28 12:18:04,896 INFO L168 Benchmark]: Boogie Preprocessor took 18.81 ms. Allocated memory is still 671.6 MB. Free memory was 636.1 MB in the beginning and 633.2 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 50.3 GB. 71.18/24.01 [2019-03-28 12:18:04,896 INFO L168 Benchmark]: RCFGBuilder took 224.79 ms. Allocated memory is still 671.6 MB. Free memory was 633.2 MB in the beginning and 617.6 MB in the end (delta: 15.7 MB). Peak memory consumption was 15.7 MB. Max. memory is 50.3 GB. 71.18/24.01 [2019-03-28 12:18:04,897 INFO L168 Benchmark]: BlockEncodingV2 took 81.91 ms. Allocated memory is still 671.6 MB. Free memory was 617.6 MB in the beginning and 612.2 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 50.3 GB. 71.18/24.01 [2019-03-28 12:18:04,898 INFO L168 Benchmark]: TraceAbstraction took 179.80 ms. Allocated memory is still 671.6 MB. Free memory was 611.1 MB in the beginning and 600.3 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 50.3 GB. 71.18/24.01 [2019-03-28 12:18:04,898 INFO L168 Benchmark]: BuchiAutomizer took 18871.44 ms. Allocated memory was 671.6 MB in the beginning and 762.3 MB in the end (delta: 90.7 MB). Free memory was 600.3 MB in the beginning and 719.5 MB in the end (delta: -119.2 MB). There was no memory consumed. Max. memory is 50.3 GB. 71.18/24.01 [2019-03-28 12:18:04,903 INFO L337 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### 71.18/24.01 --- Results --- 71.18/24.01 * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: 71.18/24.01 - StatisticsResult: Initial Icfg 71.18/24.01 19 locations, 24 edges 71.18/24.01 - StatisticsResult: Encoded RCFG 71.18/24.01 15 locations, 22 edges 71.18/24.01 * Results from de.uni_freiburg.informatik.ultimate.core: 71.18/24.01 - StatisticsResult: Toolchain Benchmarks 71.18/24.01 Benchmark results are: 71.18/24.01 * CDTParser took 0.17 ms. Allocated memory is still 649.6 MB. Free memory is still 580.0 MB. There was no memory consumed. Max. memory is 50.3 GB. 71.18/24.01 * CACSL2BoogieTranslator took 288.50 ms. Allocated memory was 649.6 MB in the beginning and 671.6 MB in the end (delta: 22.0 MB). Free memory was 559.2 MB in the beginning and 638.2 MB in the end (delta: -79.0 MB). Peak memory consumption was 30.6 MB. Max. memory is 50.3 GB. 71.18/24.01 * Boogie Procedure Inliner took 38.09 ms. Allocated memory is still 671.6 MB. Free memory was 638.2 MB in the beginning and 636.1 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 50.3 GB. 71.18/24.01 * Boogie Preprocessor took 18.81 ms. Allocated memory is still 671.6 MB. Free memory was 636.1 MB in the beginning and 633.2 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 50.3 GB. 71.18/24.01 * RCFGBuilder took 224.79 ms. Allocated memory is still 671.6 MB. Free memory was 633.2 MB in the beginning and 617.6 MB in the end (delta: 15.7 MB). Peak memory consumption was 15.7 MB. Max. memory is 50.3 GB. 71.18/24.01 * BlockEncodingV2 took 81.91 ms. Allocated memory is still 671.6 MB. Free memory was 617.6 MB in the beginning and 612.2 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 50.3 GB. 71.18/24.01 * TraceAbstraction took 179.80 ms. Allocated memory is still 671.6 MB. Free memory was 611.1 MB in the beginning and 600.3 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 50.3 GB. 71.18/24.01 * BuchiAutomizer took 18871.44 ms. Allocated memory was 671.6 MB in the beginning and 762.3 MB in the end (delta: 90.7 MB). Free memory was 600.3 MB in the beginning and 719.5 MB in the end (delta: -119.2 MB). There was no memory consumed. Max. memory is 50.3 GB. 71.18/24.01 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: 71.18/24.01 - AllSpecificationsHoldResult: All specifications hold 71.18/24.01 We were not able to verify any specifiation because the program does not contain any specification. 71.18/24.01 - InvariantResult [Line: 32]: Loop Invariant 71.18/24.01 Derived loop invariant: 1 71.18/24.01 - InvariantResult [Line: 32]: Loop Invariant 71.18/24.01 Derived loop invariant: 1 71.18/24.01 - InvariantResult [Line: 32]: Loop Invariant 71.18/24.01 Derived loop invariant: 1 71.18/24.01 - InvariantResult [Line: 32]: Loop Invariant 71.18/24.01 Derived loop invariant: 1 71.18/24.01 - StatisticsResult: Ultimate Automizer benchmark data 71.18/24.01 CFG has 2 procedures, 15 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=15occurred 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, 7 LocationsWithAnnotation, 10 PreInvPairs, 10 NumberOfFragments, 7 HoareAnnotationTreeSize, 10 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: No data available, ReuseStatistics: No data available 71.18/24.01 - StatisticsResult: Constructed decomposition of program 71.18/24.01 Your program was decomposed into 2 terminating modules (0 trivial, 0 deterministic, 2 nondeterministic). One nondeterministic module has 2-nested ranking function (if -1 * \old(c) + 8 > 0 then 1 else 0), (if -1 * \old(c) + 8 > 0 then -1 * \old(c) + 8 else -1 * \old(c) + \old(b)) and consists of 14 locations. One nondeterministic module has affine ranking function -1 * \result + -1 * c + 9 and consists of 8 locations. 71.18/24.01 - StatisticsResult: Timing statistics 71.18/24.01 BüchiAutomizer plugin needed 18.8s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 16.4s. Construction of modules took 0.2s. Büchi inclusion checks took 1.9s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 1. Automata minimization 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 26 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 21 states and ocurred in iteration 1. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 53 SDtfs, 196 SDslu, 96 SDs, 0 SdLazy, 250 SolverSat, 106 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT2 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital28 mio100 ax100 hnf101 lsp100 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq174 hnf90 smp100 dnf100 smp100 tf104 neg100 sie104 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 3ms VariablesStem: 0 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 3 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 8 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 1 LassoNonterminationAnalysisUnknown: 1 LassoNonterminationAnalysisTime: 15.1s 71.18/24.01 - TerminationAnalysisResult: Termination proven 71.18/24.01 Buchi Automizer proved that your program is terminating 71.18/24.01 RESULT: Ultimate proved your program to be correct! 71.18/24.01 !SESSION 2019-03-28 12:17:41.932 ----------------------------------------------- 71.18/24.01 eclipse.buildId=unknown 71.18/24.01 java.version=1.8.0_181 71.18/24.01 java.vendor=Oracle Corporation 71.18/24.01 BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US 71.18/24.01 Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox/benchmark/theBenchmark.c 71.18/24.01 Command-line arguments: -os linux -ws gtk -arch x86_64 -consoleLog -data @user.home/.ultimate -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -data /export/starexec/sandbox/tmp -i /export/starexec/sandbox/benchmark/theBenchmark.c 71.18/24.01 71.18/24.01 !ENTRY org.eclipse.core.resources 2 10035 2019-03-28 12:18:05.136 71.18/24.01 !MESSAGE The workspace will exit with unsaved changes in this session. 71.18/24.01 Received shutdown request... 71.18/24.01 Ultimate: 71.18/24.01 GTK+ Version Check 71.18/24.01 EOF