43.62/24.60 YES 43.62/24.60 43.62/24.61 Ultimate: Cannot open display: 43.62/24.61 This is Ultimate 0.1.24-8dc7c08-m 43.62/24.61 [2019-03-28 12:07:04,916 INFO L170 SettingsManager]: Resetting all preferences to default values... 43.62/24.61 [2019-03-28 12:07:04,919 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values 43.62/24.61 [2019-03-28 12:07:04,930 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... 43.62/24.61 [2019-03-28 12:07:04,930 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values 43.62/24.61 [2019-03-28 12:07:04,931 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values 43.62/24.61 [2019-03-28 12:07:04,933 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values 43.62/24.61 [2019-03-28 12:07:04,934 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values 43.62/24.61 [2019-03-28 12:07:04,936 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values 43.62/24.61 [2019-03-28 12:07:04,936 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values 43.62/24.61 [2019-03-28 12:07:04,937 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... 43.62/24.61 [2019-03-28 12:07:04,938 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values 43.62/24.61 [2019-03-28 12:07:04,939 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values 43.62/24.61 [2019-03-28 12:07:04,939 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values 43.62/24.61 [2019-03-28 12:07:04,940 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values 43.62/24.61 [2019-03-28 12:07:04,941 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values 43.62/24.61 [2019-03-28 12:07:04,942 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values 43.62/24.61 [2019-03-28 12:07:04,944 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values 43.62/24.61 [2019-03-28 12:07:04,946 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values 43.62/24.61 [2019-03-28 12:07:04,947 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values 43.62/24.61 [2019-03-28 12:07:04,948 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values 43.62/24.61 [2019-03-28 12:07:04,950 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values 43.62/24.61 [2019-03-28 12:07:04,952 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... 43.62/24.61 [2019-03-28 12:07:04,952 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... 43.62/24.61 [2019-03-28 12:07:04,952 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values 43.62/24.61 [2019-03-28 12:07:04,953 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values 43.62/24.61 [2019-03-28 12:07:04,953 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values 43.62/24.61 [2019-03-28 12:07:04,954 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... 43.62/24.61 [2019-03-28 12:07:04,954 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values 43.62/24.61 [2019-03-28 12:07:04,955 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values 43.62/24.61 [2019-03-28 12:07:04,956 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values 43.62/24.61 [2019-03-28 12:07:04,956 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values 43.62/24.61 [2019-03-28 12:07:04,957 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... 43.62/24.61 [2019-03-28 12:07:04,957 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values 43.62/24.61 [2019-03-28 12:07:04,958 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... 43.62/24.61 [2019-03-28 12:07:04,958 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... 43.62/24.61 [2019-03-28 12:07:04,958 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values 43.62/24.61 [2019-03-28 12:07:04,959 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values 43.62/24.61 [2019-03-28 12:07:04,960 INFO L181 SettingsManager]: Finished resetting all preferences to default values... 43.62/24.61 [2019-03-28 12:07:04,960 INFO L98 SettingsManager]: Beginning loading settings from /export/starexec/sandbox2/solver/bin/./../termcomp2017.epf 43.62/24.61 [2019-03-28 12:07:04,975 INFO L110 SettingsManager]: Loading preferences was successful 43.62/24.61 [2019-03-28 12:07:04,975 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: 43.62/24.61 [2019-03-28 12:07:04,977 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: 43.62/24.61 [2019-03-28 12:07:04,977 INFO L133 SettingsManager]: * Rewrite not-equals=true 43.62/24.61 [2019-03-28 12:07:04,977 INFO L133 SettingsManager]: * Create parallel compositions if possible=false 43.62/24.61 [2019-03-28 12:07:04,977 INFO L133 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE 43.62/24.61 [2019-03-28 12:07:04,977 INFO L133 SettingsManager]: * Use SBE=true 43.62/24.61 [2019-03-28 12:07:04,978 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: 43.62/24.61 [2019-03-28 12:07:04,978 INFO L133 SettingsManager]: * Use old map elimination=false 43.62/24.61 [2019-03-28 12:07:04,978 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false 43.62/24.61 [2019-03-28 12:07:04,978 INFO L133 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION 43.62/24.61 [2019-03-28 12:07:04,978 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true 43.62/24.61 [2019-03-28 12:07:04,979 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES 43.62/24.61 [2019-03-28 12:07:04,979 INFO L133 SettingsManager]: * Construct termination proof for TermComp=true 43.62/24.61 [2019-03-28 12:07:04,979 INFO L133 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 43.62/24.61 [2019-03-28 12:07:04,979 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: 43.62/24.61 [2019-03-28 12:07:04,979 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false 43.62/24.61 [2019-03-28 12:07:04,980 INFO L133 SettingsManager]: * Check division by zero=IGNORE 43.62/24.61 [2019-03-28 12:07:04,980 INFO L133 SettingsManager]: * Check if freed pointer was valid=false 43.62/24.61 [2019-03-28 12:07:04,980 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false 43.62/24.61 [2019-03-28 12:07:04,980 INFO L133 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE 43.62/24.61 [2019-03-28 12:07:04,980 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: 43.62/24.61 [2019-03-28 12:07:04,981 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements 43.62/24.61 [2019-03-28 12:07:04,981 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump 43.62/24.61 [2019-03-28 12:07:04,981 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 43.62/24.61 [2019-03-28 12:07:04,981 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: 43.62/24.61 [2019-03-28 12:07:04,981 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles 43.62/24.61 [2019-03-28 12:07:04,982 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL 43.62/24.61 [2019-03-28 12:07:04,982 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 43.62/24.61 [2019-03-28 12:07:05,007 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp 43.62/24.61 [2019-03-28 12:07:05,045 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized 43.62/24.61 [2019-03-28 12:07:05,048 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. 43.62/24.61 [2019-03-28 12:07:05,050 INFO L271 PluginConnector]: Initializing CDTParser... 43.62/24.61 [2019-03-28 12:07:05,050 INFO L276 PluginConnector]: CDTParser initialized 43.62/24.61 [2019-03-28 12:07:05,051 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox2/benchmark/theBenchmark.c 43.62/24.61 [2019-03-28 12:07:05,110 INFO L221 CDTParser]: Created temporary CDT project at /export/starexec/sandbox2/tmp/c0e5fe20be2f44a7b1355684ccecc247/FLAGfc51ec9dc 43.62/24.61 [2019-03-28 12:07:05,628 INFO L307 CDTParser]: Found 1 translation units. 43.62/24.61 [2019-03-28 12:07:05,629 INFO L161 CDTParser]: Scanning /export/starexec/sandbox2/benchmark/theBenchmark.c 43.62/24.61 [2019-03-28 12:07:05,636 INFO L355 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox2/tmp/c0e5fe20be2f44a7b1355684ccecc247/FLAGfc51ec9dc 43.62/24.61 [2019-03-28 12:07:06,048 INFO L363 CDTParser]: Successfully deleted /export/starexec/sandbox2/tmp/c0e5fe20be2f44a7b1355684ccecc247 43.62/24.61 [2019-03-28 12:07:06,060 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### 43.62/24.61 [2019-03-28 12:07:06,062 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. 43.62/24.61 [2019-03-28 12:07:06,063 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- 43.62/24.61 [2019-03-28 12:07:06,063 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... 43.62/24.61 [2019-03-28 12:07:06,067 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized 43.62/24.61 [2019-03-28 12:07:06,067 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 12:07:06" (1/1) ... 43.62/24.61 [2019-03-28 12:07:06,071 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7420e2e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:07:06, skipping insertion in model container 43.62/24.61 [2019-03-28 12:07:06,071 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 12:07:06" (1/1) ... 43.62/24.61 [2019-03-28 12:07:06,078 INFO L145 MainTranslator]: Starting translation in SV-COMP mode 43.62/24.61 [2019-03-28 12:07:06,095 INFO L176 MainTranslator]: Built tables and reachable declarations 43.62/24.61 [2019-03-28 12:07:06,243 INFO L206 PostProcessor]: Analyzing one entry point: main 43.62/24.61 [2019-03-28 12:07:06,248 INFO L191 MainTranslator]: Completed pre-run 43.62/24.61 [2019-03-28 12:07:06,263 INFO L206 PostProcessor]: Analyzing one entry point: main 43.62/24.61 [2019-03-28 12:07:06,277 INFO L195 MainTranslator]: Completed translation 43.62/24.61 [2019-03-28 12:07:06,278 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:07:06 WrapperNode 43.62/24.61 [2019-03-28 12:07:06,278 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- 43.62/24.61 [2019-03-28 12:07:06,279 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- 43.62/24.61 [2019-03-28 12:07:06,279 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... 43.62/24.61 [2019-03-28 12:07:06,279 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized 43.62/24.61 [2019-03-28 12:07:06,341 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:07:06" (1/1) ... 43.62/24.61 [2019-03-28 12:07:06,349 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:07:06" (1/1) ... 43.62/24.61 [2019-03-28 12:07:06,368 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- 43.62/24.61 [2019-03-28 12:07:06,368 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- 43.62/24.61 [2019-03-28 12:07:06,368 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... 43.62/24.61 [2019-03-28 12:07:06,369 INFO L276 PluginConnector]: Boogie Preprocessor initialized 43.62/24.61 [2019-03-28 12:07:06,378 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:07:06" (1/1) ... 43.62/24.61 [2019-03-28 12:07:06,379 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:07:06" (1/1) ... 43.62/24.61 [2019-03-28 12:07:06,379 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:07:06" (1/1) ... 43.62/24.61 [2019-03-28 12:07:06,379 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:07:06" (1/1) ... 43.62/24.61 [2019-03-28 12:07:06,381 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:07:06" (1/1) ... 43.62/24.61 [2019-03-28 12:07:06,384 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:07:06" (1/1) ... 43.62/24.61 [2019-03-28 12:07:06,384 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:07:06" (1/1) ... 43.62/24.61 [2019-03-28 12:07:06,386 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- 43.62/24.61 [2019-03-28 12:07:06,386 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- 43.62/24.61 [2019-03-28 12:07:06,386 INFO L271 PluginConnector]: Initializing RCFGBuilder... 43.62/24.61 [2019-03-28 12:07:06,386 INFO L276 PluginConnector]: RCFGBuilder initialized 43.62/24.61 [2019-03-28 12:07:06,389 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:07:06" (1/1) ... 43.62/24.61 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 43.62/24.61 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) 43.62/24.61 Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 43.62/24.61 [2019-03-28 12:07:06,451 INFO L130 BoogieDeclarations]: Found specification of procedure g 43.62/24.61 [2019-03-28 12:07:06,451 INFO L138 BoogieDeclarations]: Found implementation of procedure g 43.62/24.61 [2019-03-28 12:07:06,451 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start 43.62/24.61 [2019-03-28 12:07:06,451 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start 43.62/24.61 [2019-03-28 12:07:06,577 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) 43.62/24.61 [2019-03-28 12:07:06,577 INFO L286 CfgBuilder]: Removed 4 assue(true) statements. 43.62/24.61 [2019-03-28 12:07:06,578 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:07:06 BoogieIcfgContainer 43.62/24.61 [2019-03-28 12:07:06,578 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- 43.62/24.61 [2019-03-28 12:07:06,579 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- 43.62/24.61 [2019-03-28 12:07:06,579 INFO L271 PluginConnector]: Initializing BlockEncodingV2... 43.62/24.61 [2019-03-28 12:07:06,581 INFO L276 PluginConnector]: BlockEncodingV2 initialized 43.62/24.61 [2019-03-28 12:07:06,582 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:07:06" (1/1) ... 43.62/24.61 [2019-03-28 12:07:06,597 INFO L313 BlockEncoder]: Initial Icfg 14 locations, 17 edges 43.62/24.61 [2019-03-28 12:07:06,598 INFO L258 BlockEncoder]: Using Remove infeasible edges 43.62/24.61 [2019-03-28 12:07:06,599 INFO L263 BlockEncoder]: Using Maximize final states 43.62/24.61 [2019-03-28 12:07:06,600 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false 43.62/24.61 [2019-03-28 12:07:06,600 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE 43.62/24.61 [2019-03-28 12:07:06,602 INFO L296 BlockEncoder]: Using Remove sink states 43.62/24.61 [2019-03-28 12:07:06,603 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true 43.62/24.61 [2019-03-28 12:07:06,603 INFO L179 BlockEncoder]: Using Rewrite not-equals 43.62/24.61 [2019-03-28 12:07:06,617 INFO L185 BlockEncoder]: Using Use SBE 43.62/24.61 [2019-03-28 12:07:06,631 INFO L200 BlockEncoder]: SBE split 1 edges 43.62/24.61 [2019-03-28 12:07:06,635 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility 43.62/24.61 [2019-03-28 12:07:06,637 INFO L71 MaximizeFinalStates]: 0 new accepting states 43.62/24.61 [2019-03-28 12:07:06,645 INFO L100 BaseMinimizeStates]: Removed 2 edges and 1 locations by large block encoding 43.62/24.61 [2019-03-28 12:07:06,647 INFO L70 RemoveSinkStates]: Removed 4 edges and 3 locations by removing sink states 43.62/24.61 [2019-03-28 12:07:06,648 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility 43.62/24.61 [2019-03-28 12:07:06,648 INFO L71 MaximizeFinalStates]: 0 new accepting states 43.62/24.61 [2019-03-28 12:07:06,653 INFO L100 BaseMinimizeStates]: Removed 2 edges and 1 locations by large block encoding 43.62/24.61 [2019-03-28 12:07:06,653 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states 43.62/24.61 [2019-03-28 12:07:06,654 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility 43.62/24.61 [2019-03-28 12:07:06,654 INFO L71 MaximizeFinalStates]: 0 new accepting states 43.62/24.61 [2019-03-28 12:07:06,654 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding 43.62/24.61 [2019-03-28 12:07:06,654 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states 43.62/24.61 [2019-03-28 12:07:06,655 INFO L313 BlockEncoder]: Encoded RCFG 9 locations, 12 edges 43.62/24.61 [2019-03-28 12:07:06,655 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:07:06 BasicIcfg 43.62/24.61 [2019-03-28 12:07:06,655 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- 43.62/24.61 [2019-03-28 12:07:06,656 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- 43.62/24.61 [2019-03-28 12:07:06,656 INFO L271 PluginConnector]: Initializing TraceAbstraction... 43.62/24.61 [2019-03-28 12:07:06,660 INFO L276 PluginConnector]: TraceAbstraction initialized 43.62/24.61 [2019-03-28 12:07:06,660 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.03 12:07:06" (1/4) ... 43.62/24.61 [2019-03-28 12:07:06,661 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e28b22b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 12:07:06, skipping insertion in model container 43.62/24.61 [2019-03-28 12:07:06,661 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:07:06" (2/4) ... 43.62/24.61 [2019-03-28 12:07:06,661 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e28b22b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 12:07:06, skipping insertion in model container 43.62/24.61 [2019-03-28 12:07:06,661 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:07:06" (3/4) ... 43.62/24.61 [2019-03-28 12:07:06,662 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e28b22b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:07:06, skipping insertion in model container 43.62/24.61 [2019-03-28 12:07:06,662 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:07:06" (4/4) ... 43.62/24.61 [2019-03-28 12:07:06,664 INFO L112 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 43.62/24.61 [2019-03-28 12:07:06,674 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION 43.62/24.61 [2019-03-28 12:07:06,681 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 0 error locations. 43.62/24.61 [2019-03-28 12:07:06,698 INFO L257 AbstractCegarLoop]: Starting to check reachability of 0 error locations. 43.62/24.61 [2019-03-28 12:07:06,727 INFO L133 ementStrategyFactory]: Using default assertion order modulation 43.62/24.61 [2019-03-28 12:07:06,728 INFO L382 AbstractCegarLoop]: Interprodecural is true 43.62/24.61 [2019-03-28 12:07:06,728 INFO L383 AbstractCegarLoop]: Hoare is true 43.62/24.61 [2019-03-28 12:07:06,728 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates 43.62/24.61 [2019-03-28 12:07:06,728 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE 43.62/24.61 [2019-03-28 12:07:06,728 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION 43.62/24.61 [2019-03-28 12:07:06,729 INFO L387 AbstractCegarLoop]: Difference is false 43.62/24.61 [2019-03-28 12:07:06,729 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA 43.62/24.61 [2019-03-28 12:07:06,729 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== 43.62/24.61 [2019-03-28 12:07:06,746 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states. 43.62/24.61 [2019-03-28 12:07:06,752 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. 43.62/24.61 [2019-03-28 12:07:06,758 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 9 states. 43.62/24.61 [2019-03-28 12:07:06,815 INFO L451 ceAbstractionStarter]: At program point L15(line 15) the Hoare annotation is: true 43.62/24.61 [2019-03-28 12:07:06,815 INFO L451 ceAbstractionStarter]: At program point L15-1(line 15) the Hoare annotation is: true 43.62/24.61 [2019-03-28 12:07:06,815 INFO L448 ceAbstractionStarter]: For program point L15-2(line 15) no Hoare annotation was computed. 43.62/24.61 [2019-03-28 12:07:06,815 INFO L448 ceAbstractionStarter]: For program point L12(lines 12 15) no Hoare annotation was computed. 43.62/24.61 [2019-03-28 12:07:06,815 INFO L448 ceAbstractionStarter]: For program point gEXIT(lines 10 16) no Hoare annotation was computed. 43.62/24.61 [2019-03-28 12:07:06,816 INFO L448 ceAbstractionStarter]: For program point gFINAL(lines 10 16) no Hoare annotation was computed. 43.62/24.61 [2019-03-28 12:07:06,816 INFO L451 ceAbstractionStarter]: At program point gENTRY(lines 10 16) the Hoare annotation is: true 43.62/24.61 [2019-03-28 12:07:06,816 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. 43.62/24.61 [2019-03-28 12:07:06,816 INFO L451 ceAbstractionStarter]: At program point L21(line 21) the Hoare annotation is: true 43.62/24.61 [2019-03-28 12:07:06,820 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:07:06 BasicIcfg 43.62/24.61 [2019-03-28 12:07:06,820 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- 43.62/24.61 [2019-03-28 12:07:06,820 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- 43.62/24.61 [2019-03-28 12:07:06,821 INFO L271 PluginConnector]: Initializing BuchiAutomizer... 43.62/24.61 [2019-03-28 12:07:06,824 INFO L276 PluginConnector]: BuchiAutomizer initialized 43.62/24.61 [2019-03-28 12:07:06,825 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 43.62/24.61 [2019-03-28 12:07:06,825 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.03 12:07:06" (1/5) ... 43.62/24.61 [2019-03-28 12:07:06,826 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4fe55bea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.03 12:07:06, skipping insertion in model container 43.62/24.61 [2019-03-28 12:07:06,826 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 43.62/24.61 [2019-03-28 12:07:06,826 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:07:06" (2/5) ... 43.62/24.61 [2019-03-28 12:07:06,827 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4fe55bea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.03 12:07:06, skipping insertion in model container 43.62/24.61 [2019-03-28 12:07:06,827 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 43.62/24.61 [2019-03-28 12:07:06,827 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:07:06" (3/5) ... 43.62/24.61 [2019-03-28 12:07:06,827 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4fe55bea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:07:06, skipping insertion in model container 43.62/24.61 [2019-03-28 12:07:06,827 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 43.62/24.61 [2019-03-28 12:07:06,828 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:07:06" (4/5) ... 43.62/24.61 [2019-03-28 12:07:06,828 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4fe55bea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:07:06, skipping insertion in model container 43.62/24.61 [2019-03-28 12:07:06,828 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 43.62/24.61 [2019-03-28 12:07:06,828 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:07:06" (5/5) ... 43.62/24.61 [2019-03-28 12:07:06,830 INFO L375 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 43.62/24.61 [2019-03-28 12:07:06,857 INFO L133 ementStrategyFactory]: Using default assertion order modulation 43.62/24.61 [2019-03-28 12:07:06,857 INFO L374 BuchiCegarLoop]: Interprodecural is true 43.62/24.61 [2019-03-28 12:07:06,858 INFO L375 BuchiCegarLoop]: Hoare is true 43.62/24.61 [2019-03-28 12:07:06,858 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates 43.62/24.61 [2019-03-28 12:07:06,858 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE 43.62/24.61 [2019-03-28 12:07:06,858 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION 43.62/24.61 [2019-03-28 12:07:06,858 INFO L379 BuchiCegarLoop]: Difference is false 43.62/24.61 [2019-03-28 12:07:06,858 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA 43.62/24.61 [2019-03-28 12:07:06,858 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== 43.62/24.61 [2019-03-28 12:07:06,862 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states. 43.62/24.61 [2019-03-28 12:07:06,882 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 43.62/24.61 [2019-03-28 12:07:06,882 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 43.62/24.61 [2019-03-28 12:07:06,883 INFO L119 BuchiIsEmpty]: Starting construction of run 43.62/24.61 [2019-03-28 12:07:06,890 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] 43.62/24.61 [2019-03-28 12:07:06,890 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] 43.62/24.61 [2019-03-28 12:07:06,890 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ 43.62/24.61 [2019-03-28 12:07:06,890 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states. 43.62/24.61 [2019-03-28 12:07:06,891 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 43.62/24.61 [2019-03-28 12:07:06,892 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 43.62/24.61 [2019-03-28 12:07:06,892 INFO L119 BuchiIsEmpty]: Starting construction of run 43.62/24.61 [2019-03-28 12:07:06,892 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] 43.62/24.61 [2019-03-28 12:07:06,892 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] 43.62/24.61 [2019-03-28 12:07:06,897 INFO L794 eck$LassoCheckResult]: Stem: 5#ULTIMATE.startENTRYtrue [49] ULTIMATE.startENTRY-->L21: Formula: (<= 0 v_ULTIMATE.start_main_~x~0_8) InVars {} OutVars{ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_6|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_5|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8, ULTIMATE.start_main_#t~ret3=|v_ULTIMATE.start_main_#t~ret3_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#res, ULTIMATE.start_main_~x~0, ULTIMATE.start_main_#t~ret3] 3#L21true [34] L21-->gENTRY: Formula: (= |v_g_#in~xInParam_3| v_ULTIMATE.start_main_~x~0_7) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} OutVars{g_#in~x=|v_g_#in~xInParam_3|} AuxVars[] AssignedVars[g_#in~x]< 6#gENTRYtrue 43.62/24.61 [2019-03-28 12:07:06,898 INFO L796 eck$LassoCheckResult]: Loop: 6#gENTRYtrue [36] gENTRY-->L12: Formula: (= v_g_~x_1 |v_g_#in~x_1|) InVars {g_#in~x=|v_g_#in~x_1|} OutVars{g_#in~x=|v_g_#in~x_1|, g_~x=v_g_~x_1} AuxVars[] AssignedVars[g_~x] 4#L12true [46] L12-->L15: Formula: (< 0 v_g_~x_3) InVars {g_~x=v_g_~x_3} OutVars{g_~x=v_g_~x_3} AuxVars[] AssignedVars[] 8#L15true [37] L15-->gENTRY: Formula: (= |v_g_#in~xInParam_1| (+ v_g_~x_5 (- 1))) InVars {g_~x=v_g_~x_5} OutVars{g_#in~x=|v_g_#in~xInParam_1|} AuxVars[] AssignedVars[g_#in~x]< 6#gENTRYtrue 43.62/24.61 [2019-03-28 12:07:06,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 43.62/24.61 [2019-03-28 12:07:06,904 INFO L82 PathProgramCache]: Analyzing trace with hash 2514, now seen corresponding path program 1 times 43.62/24.61 [2019-03-28 12:07:06,906 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 43.62/24.61 [2019-03-28 12:07:06,906 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 43.62/24.61 [2019-03-28 12:07:06,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 43.62/24.61 [2019-03-28 12:07:06,926 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 43.62/24.61 [2019-03-28 12:07:06,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 43.62/24.61 [2019-03-28 12:07:06,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 43.62/24.61 [2019-03-28 12:07:06,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 43.62/24.61 [2019-03-28 12:07:06,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 43.62/24.61 [2019-03-28 12:07:06,975 INFO L82 PathProgramCache]: Analyzing trace with hash 65850, now seen corresponding path program 1 times 43.62/24.61 [2019-03-28 12:07:06,975 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 43.62/24.61 [2019-03-28 12:07:06,975 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 43.62/24.61 [2019-03-28 12:07:06,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 43.62/24.61 [2019-03-28 12:07:06,976 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 43.62/24.61 [2019-03-28 12:07:06,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 43.62/24.61 [2019-03-28 12:07:06,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 43.62/24.61 [2019-03-28 12:07:06,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 43.62/24.61 [2019-03-28 12:07:06,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 43.62/24.61 [2019-03-28 12:07:06,986 INFO L82 PathProgramCache]: Analyzing trace with hash 74930633, now seen corresponding path program 1 times 43.62/24.61 [2019-03-28 12:07:06,987 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 43.62/24.61 [2019-03-28 12:07:06,987 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 43.62/24.61 [2019-03-28 12:07:06,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 43.62/24.61 [2019-03-28 12:07:06,988 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 43.62/24.61 [2019-03-28 12:07:06,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 43.62/24.61 [2019-03-28 12:07:06,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 43.62/24.61 [2019-03-28 12:07:06,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 43.62/24.61 [2019-03-28 12:07:07,062 INFO L216 LassoAnalysis]: Preferences: 43.62/24.61 [2019-03-28 12:07:07,063 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 43.62/24.61 [2019-03-28 12:07:07,063 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 43.62/24.61 [2019-03-28 12:07:07,063 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 43.62/24.61 [2019-03-28 12:07:07,063 INFO L127 ssoRankerPreferences]: Use exernal solver: true 43.62/24.61 [2019-03-28 12:07:07,063 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 43.62/24.61 [2019-03-28 12:07:07,064 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 43.62/24.61 [2019-03-28 12:07:07,064 INFO L130 ssoRankerPreferences]: Path of dumped script: 43.62/24.61 [2019-03-28 12:07:07,064 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Loop 43.62/24.61 [2019-03-28 12:07:07,064 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 43.62/24.61 [2019-03-28 12:07:07,064 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 43.62/24.61 [2019-03-28 12:07:07,082 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 43.62/24.61 [2019-03-28 12:07:07,090 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 43.62/24.61 [2019-03-28 12:07:07,093 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 43.62/24.61 [2019-03-28 12:07:07,096 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 43.62/24.61 [2019-03-28 12:07:07,099 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 43.62/24.61 [2019-03-28 12:07:07,174 INFO L300 LassoAnalysis]: Preprocessing complete. 43.62/24.61 [2019-03-28 12:07:07,175 INFO L412 LassoAnalysis]: Checking for nontermination... 43.62/24.61 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 43.62/24.61 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 43.62/24.61 Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 43.62/24.61 [2019-03-28 12:07:07,181 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 43.62/24.61 [2019-03-28 12:07:07,181 INFO L163 nArgumentSynthesizer]: Using integer mode. 43.62/24.61 [2019-03-28 12:07:07,191 INFO L445 LassoAnalysis]: Proved nontermination for one component. 43.62/24.61 [2019-03-28 12:07:07,191 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {g_~x=0} Honda state: {g_~x=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 43.62/24.61 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 43.62/24.61 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 43.62/24.61 Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 43.62/24.61 [2019-03-28 12:07:07,219 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 43.62/24.61 [2019-03-28 12:07:07,219 INFO L163 nArgumentSynthesizer]: Using integer mode. 43.62/24.61 [2019-03-28 12:07:07,223 INFO L445 LassoAnalysis]: Proved nontermination for one component. 43.62/24.61 [2019-03-28 12:07:07,223 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {g_#t~ret1=0} Honda state: {g_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 43.62/24.61 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 43.62/24.61 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 43.62/24.61 Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 43.62/24.61 [2019-03-28 12:07:07,250 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 43.62/24.61 [2019-03-28 12:07:07,250 INFO L163 nArgumentSynthesizer]: Using integer mode. 43.62/24.61 [2019-03-28 12:07:07,254 INFO L445 LassoAnalysis]: Proved nontermination for one component. 43.62/24.61 [2019-03-28 12:07:07,254 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {g_#res=0} Honda state: {g_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 43.62/24.61 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 43.62/24.61 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 43.62/24.61 Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 43.62/24.61 [2019-03-28 12:07:07,281 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 43.62/24.61 [2019-03-28 12:07:07,282 INFO L163 nArgumentSynthesizer]: Using integer mode. 43.62/24.61 [2019-03-28 12:07:07,286 INFO L445 LassoAnalysis]: Proved nontermination for one component. 43.62/24.61 [2019-03-28 12:07:07,286 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {g_#t~ret0=0} Honda state: {g_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 43.62/24.61 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 43.62/24.61 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 43.62/24.61 Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 43.62/24.61 [2019-03-28 12:07:07,313 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 43.62/24.61 [2019-03-28 12:07:07,314 INFO L163 nArgumentSynthesizer]: Using integer mode. 43.62/24.61 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 43.62/24.61 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 43.62/24.61 Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 43.62/24.61 [2019-03-28 12:07:07,345 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 43.62/24.61 [2019-03-28 12:07:07,346 INFO L163 nArgumentSynthesizer]: Using integer mode. 43.62/24.61 [2019-03-28 12:07:07,377 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. 43.62/24.61 [2019-03-28 12:07:07,379 INFO L216 LassoAnalysis]: Preferences: 43.62/24.61 [2019-03-28 12:07:07,379 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 43.62/24.61 [2019-03-28 12:07:07,379 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 43.62/24.61 [2019-03-28 12:07:07,380 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 43.62/24.61 [2019-03-28 12:07:07,380 INFO L127 ssoRankerPreferences]: Use exernal solver: false 43.62/24.61 [2019-03-28 12:07:07,380 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 43.62/24.61 [2019-03-28 12:07:07,380 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 43.62/24.61 [2019-03-28 12:07:07,380 INFO L130 ssoRankerPreferences]: Path of dumped script: 43.62/24.61 [2019-03-28 12:07:07,380 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Loop 43.62/24.61 [2019-03-28 12:07:07,380 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 43.62/24.61 [2019-03-28 12:07:07,381 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 43.62/24.61 [2019-03-28 12:07:07,382 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 43.62/24.61 [2019-03-28 12:07:07,387 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 43.62/24.61 [2019-03-28 12:07:07,390 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 43.62/24.61 [2019-03-28 12:07:07,396 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 43.62/24.61 [2019-03-28 12:07:07,399 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 43.62/24.61 [2019-03-28 12:07:07,450 INFO L300 LassoAnalysis]: Preprocessing complete. 43.62/24.61 [2019-03-28 12:07:07,456 INFO L497 LassoAnalysis]: Using template 'affine'. 43.62/24.61 [2019-03-28 12:07:07,458 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 43.62/24.61 Termination analysis: LINEAR_WITH_GUESSES 43.62/24.61 Number of strict supporting invariants: 0 43.62/24.61 Number of non-strict supporting invariants: 1 43.62/24.61 Consider only non-deceasing supporting invariants: true 43.62/24.61 Simplify termination arguments: true 43.62/24.61 Simplify supporting invariants: trueOverapproximate stem: false 43.62/24.61 [2019-03-28 12:07:07,460 INFO L339 nArgumentSynthesizer]: Template has degree 0. 43.62/24.61 [2019-03-28 12:07:07,460 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 43.62/24.61 [2019-03-28 12:07:07,461 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 43.62/24.61 [2019-03-28 12:07:07,461 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 43.62/24.61 [2019-03-28 12:07:07,461 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 43.62/24.61 [2019-03-28 12:07:07,463 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 43.62/24.61 [2019-03-28 12:07:07,464 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 43.62/24.61 [2019-03-28 12:07:07,468 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 43.62/24.61 [2019-03-28 12:07:07,468 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 43.62/24.61 Termination analysis: LINEAR_WITH_GUESSES 43.62/24.61 Number of strict supporting invariants: 0 43.62/24.61 Number of non-strict supporting invariants: 1 43.62/24.61 Consider only non-deceasing supporting invariants: true 43.62/24.61 Simplify termination arguments: true 43.62/24.61 Simplify supporting invariants: trueOverapproximate stem: false 43.62/24.61 [2019-03-28 12:07:07,469 INFO L339 nArgumentSynthesizer]: Template has degree 0. 43.62/24.61 [2019-03-28 12:07:07,469 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 43.62/24.61 [2019-03-28 12:07:07,470 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 43.62/24.61 [2019-03-28 12:07:07,470 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 43.62/24.61 [2019-03-28 12:07:07,470 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 43.62/24.61 [2019-03-28 12:07:07,471 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 43.62/24.61 [2019-03-28 12:07:07,471 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 43.62/24.61 [2019-03-28 12:07:07,473 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 43.62/24.61 [2019-03-28 12:07:07,473 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 43.62/24.61 Termination analysis: LINEAR_WITH_GUESSES 43.62/24.61 Number of strict supporting invariants: 0 43.62/24.61 Number of non-strict supporting invariants: 1 43.62/24.61 Consider only non-deceasing supporting invariants: true 43.62/24.61 Simplify termination arguments: true 43.62/24.61 Simplify supporting invariants: trueOverapproximate stem: false 43.62/24.61 [2019-03-28 12:07:07,474 INFO L339 nArgumentSynthesizer]: Template has degree 0. 43.62/24.61 [2019-03-28 12:07:07,474 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 43.62/24.61 [2019-03-28 12:07:07,474 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 43.62/24.61 [2019-03-28 12:07:07,474 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 43.62/24.61 [2019-03-28 12:07:07,474 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 43.62/24.61 [2019-03-28 12:07:07,475 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 43.62/24.61 [2019-03-28 12:07:07,475 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 43.62/24.61 [2019-03-28 12:07:07,477 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 43.62/24.61 [2019-03-28 12:07:07,477 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 43.62/24.61 Termination analysis: LINEAR_WITH_GUESSES 43.62/24.61 Number of strict supporting invariants: 0 43.62/24.61 Number of non-strict supporting invariants: 1 43.62/24.61 Consider only non-deceasing supporting invariants: true 43.62/24.61 Simplify termination arguments: true 43.62/24.61 Simplify supporting invariants: trueOverapproximate stem: false 43.62/24.61 [2019-03-28 12:07:07,478 INFO L339 nArgumentSynthesizer]: Template has degree 0. 43.62/24.61 [2019-03-28 12:07:07,478 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 43.62/24.61 [2019-03-28 12:07:07,478 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 43.62/24.61 [2019-03-28 12:07:07,479 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 43.62/24.61 [2019-03-28 12:07:07,479 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 43.62/24.61 [2019-03-28 12:07:07,479 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 43.62/24.61 [2019-03-28 12:07:07,480 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 43.62/24.61 [2019-03-28 12:07:07,481 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 43.62/24.61 [2019-03-28 12:07:07,482 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 43.62/24.61 Termination analysis: LINEAR_WITH_GUESSES 43.62/24.61 Number of strict supporting invariants: 0 43.62/24.61 Number of non-strict supporting invariants: 1 43.62/24.61 Consider only non-deceasing supporting invariants: true 43.62/24.61 Simplify termination arguments: true 43.62/24.61 Simplify supporting invariants: trueOverapproximate stem: false 43.62/24.61 [2019-03-28 12:07:07,482 INFO L339 nArgumentSynthesizer]: Template has degree 0. 43.62/24.61 [2019-03-28 12:07:07,483 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 43.62/24.61 [2019-03-28 12:07:07,483 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 43.62/24.61 [2019-03-28 12:07:07,483 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 43.62/24.61 [2019-03-28 12:07:07,483 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 43.62/24.61 [2019-03-28 12:07:07,484 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 43.62/24.61 [2019-03-28 12:07:07,484 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 43.62/24.61 [2019-03-28 12:07:07,490 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 43.62/24.61 [2019-03-28 12:07:07,494 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 43.62/24.61 [2019-03-28 12:07:07,494 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. 43.62/24.61 [2019-03-28 12:07:07,496 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 43.62/24.61 [2019-03-28 12:07:07,496 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 43.62/24.61 [2019-03-28 12:07:07,497 INFO L518 LassoAnalysis]: Proved termination. 43.62/24.61 [2019-03-28 12:07:07,497 INFO L520 LassoAnalysis]: Termination argument consisting of: 43.62/24.61 Ranking function f(g_#in~x) = 1*g_#in~x 43.62/24.61 Supporting invariants [] 43.62/24.61 [2019-03-28 12:07:07,499 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed 43.62/24.61 [2019-03-28 12:07:07,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 43.62/24.61 [2019-03-28 12:07:07,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 43.62/24.61 [2019-03-28 12:07:07,547 INFO L256 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 4 conjunts are in the unsatisfiable core 43.62/24.61 [2019-03-28 12:07:07,549 INFO L279 TraceCheckSpWp]: Computing forward predicates... 43.62/24.61 [2019-03-28 12:07:07,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 43.62/24.61 [2019-03-28 12:07:07,579 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 7 conjunts are in the unsatisfiable core 43.62/24.61 [2019-03-28 12:07:07,580 INFO L279 TraceCheckSpWp]: Computing forward predicates... 43.62/24.61 [2019-03-28 12:07:07,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 43.62/24.61 [2019-03-28 12:07:07,629 INFO L98 LoopCannibalizer]: 3 predicates before loop cannibalization 3 predicates after loop cannibalization 43.62/24.61 [2019-03-28 12:07:07,634 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates 43.62/24.61 [2019-03-28 12:07:07,635 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 9 states. Second operand 4 states. 43.62/24.61 [2019-03-28 12:07:07,744 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 9 states.. Second operand 4 states. Result 49 states and 75 transitions. Complement of second has 24 states. 43.62/24.61 [2019-03-28 12:07:07,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states 43.62/24.61 [2019-03-28 12:07:07,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. 43.62/24.61 [2019-03-28 12:07:07,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 22 transitions. 43.62/24.61 [2019-03-28 12:07:07,750 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 22 transitions. Stem has 2 letters. Loop has 3 letters. 43.62/24.61 [2019-03-28 12:07:07,752 INFO L116 BuchiAccepts]: Finished buchiAccepts. 43.62/24.61 [2019-03-28 12:07:07,752 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 22 transitions. Stem has 5 letters. Loop has 3 letters. 43.62/24.61 [2019-03-28 12:07:07,752 INFO L116 BuchiAccepts]: Finished buchiAccepts. 43.62/24.61 [2019-03-28 12:07:07,753 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 22 transitions. Stem has 2 letters. Loop has 6 letters. 43.62/24.61 [2019-03-28 12:07:07,753 INFO L116 BuchiAccepts]: Finished buchiAccepts. 43.62/24.61 [2019-03-28 12:07:07,760 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 75 transitions. 43.62/24.61 [2019-03-28 12:07:07,765 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 43.62/24.61 [2019-03-28 12:07:07,785 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 35 states and 60 transitions. 43.62/24.61 [2019-03-28 12:07:07,786 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 43.62/24.61 [2019-03-28 12:07:07,787 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 43.62/24.61 [2019-03-28 12:07:07,788 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 60 transitions. 43.62/24.61 [2019-03-28 12:07:07,788 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 43.62/24.61 [2019-03-28 12:07:07,788 INFO L706 BuchiCegarLoop]: Abstraction has 35 states and 60 transitions. 43.62/24.61 [2019-03-28 12:07:07,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 60 transitions. 43.62/24.61 [2019-03-28 12:07:07,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 27. 43.62/24.61 [2019-03-28 12:07:07,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. 43.62/24.61 [2019-03-28 12:07:07,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 41 transitions. 43.62/24.61 [2019-03-28 12:07:07,826 INFO L729 BuchiCegarLoop]: Abstraction has 27 states and 41 transitions. 43.62/24.61 [2019-03-28 12:07:07,826 INFO L609 BuchiCegarLoop]: Abstraction has 27 states and 41 transitions. 43.62/24.61 [2019-03-28 12:07:07,826 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ 43.62/24.61 [2019-03-28 12:07:07,826 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 41 transitions. 43.62/24.61 [2019-03-28 12:07:07,828 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 43.62/24.61 [2019-03-28 12:07:07,828 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 43.62/24.61 [2019-03-28 12:07:07,828 INFO L119 BuchiIsEmpty]: Starting construction of run 43.62/24.61 [2019-03-28 12:07:07,828 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] 43.62/24.61 [2019-03-28 12:07:07,828 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] 43.62/24.61 [2019-03-28 12:07:07,829 INFO L794 eck$LassoCheckResult]: Stem: 131#ULTIMATE.startENTRY [49] ULTIMATE.startENTRY-->L21: Formula: (<= 0 v_ULTIMATE.start_main_~x~0_8) InVars {} OutVars{ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_6|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_5|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8, ULTIMATE.start_main_#t~ret3=|v_ULTIMATE.start_main_#t~ret3_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#res, ULTIMATE.start_main_~x~0, ULTIMATE.start_main_#t~ret3] 124#L21 [34] L21-->gENTRY: Formula: (= |v_g_#in~xInParam_3| v_ULTIMATE.start_main_~x~0_7) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} OutVars{g_#in~x=|v_g_#in~xInParam_3|} AuxVars[] AssignedVars[g_#in~x]< 130#gENTRY [36] gENTRY-->L12: Formula: (= v_g_~x_1 |v_g_#in~x_1|) InVars {g_#in~x=|v_g_#in~x_1|} OutVars{g_#in~x=|v_g_#in~x_1|, g_~x=v_g_~x_1} AuxVars[] AssignedVars[g_~x] 123#L12 [47] L12-->L15: Formula: (> 0 v_g_~x_3) InVars {g_~x=v_g_~x_3} OutVars{g_~x=v_g_~x_3} AuxVars[] AssignedVars[] 125#L15 43.62/24.61 [2019-03-28 12:07:07,829 INFO L796 eck$LassoCheckResult]: Loop: 125#L15 [37] L15-->gENTRY: Formula: (= |v_g_#in~xInParam_1| (+ v_g_~x_5 (- 1))) InVars {g_~x=v_g_~x_5} OutVars{g_#in~x=|v_g_#in~xInParam_1|} AuxVars[] AssignedVars[g_#in~x]< 132#gENTRY [36] gENTRY-->L12: Formula: (= v_g_~x_1 |v_g_#in~x_1|) InVars {g_#in~x=|v_g_#in~x_1|} OutVars{g_#in~x=|v_g_#in~x_1|, g_~x=v_g_~x_1} AuxVars[] AssignedVars[g_~x] 133#L12 [47] L12-->L15: Formula: (> 0 v_g_~x_3) InVars {g_~x=v_g_~x_3} OutVars{g_~x=v_g_~x_3} AuxVars[] AssignedVars[] 125#L15 43.62/24.61 [2019-03-28 12:07:07,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 43.62/24.61 [2019-03-28 12:07:07,830 INFO L82 PathProgramCache]: Analyzing trace with hash 2417117, now seen corresponding path program 1 times 43.62/24.61 [2019-03-28 12:07:07,830 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 43.62/24.61 [2019-03-28 12:07:07,830 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 43.62/24.61 [2019-03-28 12:07:07,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 43.62/24.61 [2019-03-28 12:07:07,831 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 43.62/24.61 [2019-03-28 12:07:07,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 43.62/24.61 [2019-03-28 12:07:07,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 43.62/24.61 [2019-03-28 12:07:07,872 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 43.62/24.61 [2019-03-28 12:07:07,874 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 43.62/24.61 [2019-03-28 12:07:07,874 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 43.62/24.61 [2019-03-28 12:07:07,876 INFO L799 eck$LassoCheckResult]: stem already infeasible 43.62/24.61 [2019-03-28 12:07:07,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 43.62/24.61 [2019-03-28 12:07:07,877 INFO L82 PathProgramCache]: Analyzing trace with hash 66511, now seen corresponding path program 1 times 43.62/24.61 [2019-03-28 12:07:07,877 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 43.62/24.61 [2019-03-28 12:07:07,877 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 43.62/24.61 [2019-03-28 12:07:07,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 43.62/24.61 [2019-03-28 12:07:07,878 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 43.62/24.61 [2019-03-28 12:07:07,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 43.62/24.61 [2019-03-28 12:07:07,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 43.62/24.61 [2019-03-28 12:07:07,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 43.62/24.61 [2019-03-28 12:07:07,914 INFO L216 LassoAnalysis]: Preferences: 43.62/24.61 [2019-03-28 12:07:07,915 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 43.62/24.61 [2019-03-28 12:07:07,915 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 43.62/24.61 [2019-03-28 12:07:07,915 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 43.62/24.61 [2019-03-28 12:07:07,916 INFO L127 ssoRankerPreferences]: Use exernal solver: true 43.62/24.61 [2019-03-28 12:07:07,916 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 43.62/24.61 [2019-03-28 12:07:07,916 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 43.62/24.61 [2019-03-28 12:07:07,916 INFO L130 ssoRankerPreferences]: Path of dumped script: 43.62/24.61 [2019-03-28 12:07:07,916 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration2_Loop 43.62/24.61 [2019-03-28 12:07:07,916 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 43.62/24.61 [2019-03-28 12:07:07,916 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 43.62/24.61 [2019-03-28 12:07:07,917 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 43.62/24.61 [2019-03-28 12:07:07,929 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 43.62/24.61 [2019-03-28 12:07:07,931 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 43.62/24.61 [2019-03-28 12:07:07,934 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 43.62/24.61 [2019-03-28 12:07:07,972 INFO L300 LassoAnalysis]: Preprocessing complete. 43.62/24.61 [2019-03-28 12:07:07,972 INFO L412 LassoAnalysis]: Checking for nontermination... 43.62/24.61 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 43.62/24.61 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 43.62/24.61 Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 43.62/24.61 [2019-03-28 12:07:07,978 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 43.62/24.61 [2019-03-28 12:07:07,978 INFO L163 nArgumentSynthesizer]: Using integer mode. 43.62/24.61 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 43.62/24.61 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 43.62/24.61 Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 43.62/24.61 [2019-03-28 12:07:08,016 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 43.62/24.61 [2019-03-28 12:07:08,016 INFO L163 nArgumentSynthesizer]: Using integer mode. 43.62/24.61 [2019-03-28 12:07:08,244 INFO L445 LassoAnalysis]: Proved nontermination for one component. 43.62/24.61 [2019-03-28 12:07:08,244 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {g_#in~x=-2, g_~x=-6} Honda state: {g_#in~x=-2, g_~x=-6} Generalized eigenvectors: [{g_#in~x=1, g_~x=0}, {g_#in~x=-5, g_~x=0}, {g_#in~x=-1, g_~x=-1}] Lambdas: [5, 0, 1] Nus: [1, 0] 43.62/24.61 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 43.62/24.61 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 43.62/24.61 Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 43.62/24.61 [2019-03-28 12:07:08,273 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 43.62/24.61 [2019-03-28 12:07:08,274 INFO L163 nArgumentSynthesizer]: Using integer mode. 43.62/24.61 [2019-03-28 12:07:08,277 INFO L445 LassoAnalysis]: Proved nontermination for one component. 43.62/24.61 [2019-03-28 12:07:08,277 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {g_#t~ret0=0} Honda state: {g_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 43.62/24.61 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 43.62/24.61 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 43.62/24.61 Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 43.62/24.61 [2019-03-28 12:07:08,306 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 43.62/24.61 [2019-03-28 12:07:08,307 INFO L163 nArgumentSynthesizer]: Using integer mode. 43.62/24.61 [2019-03-28 12:07:08,310 INFO L445 LassoAnalysis]: Proved nontermination for one component. 43.62/24.61 [2019-03-28 12:07:08,311 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {g_#t~ret1=0} Honda state: {g_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 43.62/24.61 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 43.62/24.61 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 43.62/24.61 Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 43.62/24.61 [2019-03-28 12:07:08,339 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 43.62/24.61 [2019-03-28 12:07:08,339 INFO L163 nArgumentSynthesizer]: Using integer mode. 43.62/24.61 [2019-03-28 12:07:08,343 INFO L445 LassoAnalysis]: Proved nontermination for one component. 43.62/24.61 [2019-03-28 12:07:08,343 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {g_#res=0} Honda state: {g_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 43.62/24.61 [2019-03-28 12:07:08,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. 43.62/24.61 [2019-03-28 12:07:08,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 43.62/24.61 [2019-03-28 12:07:08,372 INFO L87 Difference]: Start difference. First operand 27 states and 41 transitions. cyclomatic complexity: 17 Second operand 5 states. 43.62/24.61 [2019-03-28 12:07:08,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 43.62/24.61 [2019-03-28 12:07:08,426 INFO L93 Difference]: Finished difference Result 36 states and 57 transitions. 43.62/24.61 [2019-03-28 12:07:08,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 43.62/24.61 [2019-03-28 12:07:08,429 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 57 transitions. 43.62/24.61 [2019-03-28 12:07:08,432 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 43.62/24.61 [2019-03-28 12:07:08,435 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 32 states and 52 transitions. 43.62/24.61 [2019-03-28 12:07:08,435 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 43.62/24.61 [2019-03-28 12:07:08,436 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 43.62/24.61 [2019-03-28 12:07:08,436 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 52 transitions. 43.62/24.61 [2019-03-28 12:07:08,436 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 43.62/24.61 [2019-03-28 12:07:08,436 INFO L706 BuchiCegarLoop]: Abstraction has 32 states and 52 transitions. 43.62/24.61 [2019-03-28 12:07:08,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 52 transitions. 43.62/24.61 [2019-03-28 12:07:08,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. 43.62/24.61 [2019-03-28 12:07:08,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. 43.62/24.61 [2019-03-28 12:07:08,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 51 transitions. 43.62/24.61 [2019-03-28 12:07:08,443 INFO L729 BuchiCegarLoop]: Abstraction has 31 states and 51 transitions. 43.62/24.61 [2019-03-28 12:07:08,443 INFO L609 BuchiCegarLoop]: Abstraction has 31 states and 51 transitions. 43.62/24.61 [2019-03-28 12:07:08,443 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ 43.62/24.61 [2019-03-28 12:07:08,443 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 51 transitions. 43.62/24.61 [2019-03-28 12:07:08,444 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 43.62/24.61 [2019-03-28 12:07:08,445 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 43.62/24.61 [2019-03-28 12:07:08,445 INFO L119 BuchiIsEmpty]: Starting construction of run 43.62/24.61 [2019-03-28 12:07:08,445 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1] 43.62/24.61 [2019-03-28 12:07:08,445 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] 43.62/24.61 [2019-03-28 12:07:08,446 INFO L794 eck$LassoCheckResult]: Stem: 207#ULTIMATE.startENTRY [49] ULTIMATE.startENTRY-->L21: Formula: (<= 0 v_ULTIMATE.start_main_~x~0_8) InVars {} OutVars{ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_6|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_5|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8, ULTIMATE.start_main_#t~ret3=|v_ULTIMATE.start_main_#t~ret3_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#res, ULTIMATE.start_main_~x~0, ULTIMATE.start_main_#t~ret3] 196#L21 [34] L21-->gENTRY: Formula: (= |v_g_#in~xInParam_3| v_ULTIMATE.start_main_~x~0_7) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} OutVars{g_#in~x=|v_g_#in~xInParam_3|} AuxVars[] AssignedVars[g_#in~x]< 197#gENTRY [36] gENTRY-->L12: Formula: (= v_g_~x_1 |v_g_#in~x_1|) InVars {g_#in~x=|v_g_#in~x_1|} OutVars{g_#in~x=|v_g_#in~x_1|, g_~x=v_g_~x_1} AuxVars[] AssignedVars[g_~x] 205#L12 [46] L12-->L15: Formula: (< 0 v_g_~x_3) InVars {g_~x=v_g_~x_3} OutVars{g_~x=v_g_~x_3} AuxVars[] AssignedVars[] 206#L15 [37] L15-->gENTRY: Formula: (= |v_g_#in~xInParam_1| (+ v_g_~x_5 (- 1))) InVars {g_~x=v_g_~x_5} OutVars{g_#in~x=|v_g_#in~xInParam_1|} AuxVars[] AssignedVars[g_#in~x]< 217#gENTRY [36] gENTRY-->L12: Formula: (= v_g_~x_1 |v_g_#in~x_1|) InVars {g_#in~x=|v_g_#in~x_1|} OutVars{g_#in~x=|v_g_#in~x_1|, g_~x=v_g_~x_1} AuxVars[] AssignedVars[g_~x] 224#L12 [47] L12-->L15: Formula: (> 0 v_g_~x_3) InVars {g_~x=v_g_~x_3} OutVars{g_~x=v_g_~x_3} AuxVars[] AssignedVars[] 209#L15 43.62/24.61 [2019-03-28 12:07:08,446 INFO L796 eck$LassoCheckResult]: Loop: 209#L15 [37] L15-->gENTRY: Formula: (= |v_g_#in~xInParam_1| (+ v_g_~x_5 (- 1))) InVars {g_~x=v_g_~x_5} OutVars{g_#in~x=|v_g_#in~xInParam_1|} AuxVars[] AssignedVars[g_#in~x]< 208#gENTRY [36] gENTRY-->L12: Formula: (= v_g_~x_1 |v_g_#in~x_1|) InVars {g_#in~x=|v_g_#in~x_1|} OutVars{g_#in~x=|v_g_#in~x_1|, g_~x=v_g_~x_1} AuxVars[] AssignedVars[g_~x] 210#L12 [47] L12-->L15: Formula: (> 0 v_g_~x_3) InVars {g_~x=v_g_~x_3} OutVars{g_~x=v_g_~x_3} AuxVars[] AssignedVars[] 209#L15 43.62/24.61 [2019-03-28 12:07:08,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 43.62/24.61 [2019-03-28 12:07:08,447 INFO L82 PathProgramCache]: Analyzing trace with hash -1006104556, now seen corresponding path program 1 times 43.62/24.61 [2019-03-28 12:07:08,447 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 43.62/24.61 [2019-03-28 12:07:08,447 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 43.62/24.61 [2019-03-28 12:07:08,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 43.62/24.61 [2019-03-28 12:07:08,448 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 43.62/24.61 [2019-03-28 12:07:08,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 43.62/24.61 [2019-03-28 12:07:08,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 43.62/24.61 [2019-03-28 12:07:08,493 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 43.62/24.61 [2019-03-28 12:07:08,493 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 43.62/24.61 [2019-03-28 12:07:08,493 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 43.62/24.61 [2019-03-28 12:07:08,494 INFO L799 eck$LassoCheckResult]: stem already infeasible 43.62/24.61 [2019-03-28 12:07:08,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 43.62/24.61 [2019-03-28 12:07:08,494 INFO L82 PathProgramCache]: Analyzing trace with hash 66511, now seen corresponding path program 2 times 43.62/24.61 [2019-03-28 12:07:08,494 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 43.62/24.61 [2019-03-28 12:07:08,494 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 43.62/24.61 [2019-03-28 12:07:08,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 43.62/24.61 [2019-03-28 12:07:08,495 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 43.62/24.61 [2019-03-28 12:07:08,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 43.62/24.61 [2019-03-28 12:07:08,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 43.62/24.61 [2019-03-28 12:07:08,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 43.62/24.61 [2019-03-28 12:07:08,531 INFO L216 LassoAnalysis]: Preferences: 43.62/24.61 [2019-03-28 12:07:08,531 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 43.62/24.61 [2019-03-28 12:07:08,531 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 43.62/24.61 [2019-03-28 12:07:08,531 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 43.62/24.61 [2019-03-28 12:07:08,531 INFO L127 ssoRankerPreferences]: Use exernal solver: true 43.62/24.61 [2019-03-28 12:07:08,532 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 43.62/24.61 [2019-03-28 12:07:08,532 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 43.62/24.61 [2019-03-28 12:07:08,532 INFO L130 ssoRankerPreferences]: Path of dumped script: 43.62/24.61 [2019-03-28 12:07:08,532 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration3_Loop 43.62/24.61 [2019-03-28 12:07:08,532 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 43.62/24.61 [2019-03-28 12:07:08,532 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 43.62/24.61 [2019-03-28 12:07:08,533 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 43.62/24.61 [2019-03-28 12:07:08,541 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 43.62/24.61 [2019-03-28 12:07:08,543 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 43.62/24.61 [2019-03-28 12:07:08,545 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 43.62/24.61 [2019-03-28 12:07:08,574 INFO L300 LassoAnalysis]: Preprocessing complete. 43.62/24.61 [2019-03-28 12:07:08,574 INFO L412 LassoAnalysis]: Checking for nontermination... 43.62/24.61 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 43.62/24.61 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 43.62/24.61 Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 43.62/24.61 [2019-03-28 12:07:08,579 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 43.62/24.61 [2019-03-28 12:07:08,580 INFO L163 nArgumentSynthesizer]: Using integer mode. 43.62/24.61 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 43.62/24.61 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 43.62/24.61 Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 43.62/24.61 [2019-03-28 12:07:08,614 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 43.62/24.61 [2019-03-28 12:07:08,614 INFO L163 nArgumentSynthesizer]: Using integer mode. 43.62/24.61 [2019-03-28 12:07:08,824 INFO L445 LassoAnalysis]: Proved nontermination for one component. 43.62/24.61 [2019-03-28 12:07:08,824 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {g_#in~x=-7, g_~x=-2} Honda state: {g_#in~x=-7, g_~x=-2} Generalized eigenvectors: [{g_#in~x=-1, g_~x=0}, {g_#in~x=6, g_~x=0}, {g_#in~x=-1, g_~x=-1}] Lambdas: [6, 0, 1] Nus: [1, 0] 43.62/24.61 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 43.62/24.61 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 43.62/24.61 Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 43.62/24.61 [2019-03-28 12:07:08,854 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 43.62/24.61 [2019-03-28 12:07:08,855 INFO L163 nArgumentSynthesizer]: Using integer mode. 43.62/24.61 [2019-03-28 12:07:08,858 INFO L445 LassoAnalysis]: Proved nontermination for one component. 43.62/24.61 [2019-03-28 12:07:08,858 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {g_#t~ret0=0} Honda state: {g_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 43.62/24.61 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 43.62/24.61 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 43.62/24.61 Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 43.62/24.61 [2019-03-28 12:07:08,884 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 43.62/24.61 [2019-03-28 12:07:08,885 INFO L163 nArgumentSynthesizer]: Using integer mode. 43.62/24.61 [2019-03-28 12:07:08,889 INFO L445 LassoAnalysis]: Proved nontermination for one component. 43.62/24.61 [2019-03-28 12:07:08,889 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {g_#t~ret1=0} Honda state: {g_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 43.62/24.61 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 43.62/24.61 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 43.62/24.61 Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 43.62/24.61 [2019-03-28 12:07:08,919 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 43.62/24.61 [2019-03-28 12:07:08,919 INFO L163 nArgumentSynthesizer]: Using integer mode. 43.62/24.61 [2019-03-28 12:07:08,923 INFO L445 LassoAnalysis]: Proved nontermination for one component. 43.62/24.61 [2019-03-28 12:07:08,923 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {g_#res=0} Honda state: {g_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 43.62/24.61 [2019-03-28 12:07:08,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. 43.62/24.61 [2019-03-28 12:07:08,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 43.62/24.61 [2019-03-28 12:07:08,948 INFO L87 Difference]: Start difference. First operand 31 states and 51 transitions. cyclomatic complexity: 23 Second operand 5 states. 43.62/24.61 [2019-03-28 12:07:09,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 43.62/24.61 [2019-03-28 12:07:09,024 INFO L93 Difference]: Finished difference Result 35 states and 53 transitions. 43.62/24.61 [2019-03-28 12:07:09,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 43.62/24.61 [2019-03-28 12:07:09,026 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 53 transitions. 43.62/24.61 [2019-03-28 12:07:09,029 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 43.62/24.61 [2019-03-28 12:07:09,030 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 35 states and 53 transitions. 43.62/24.61 [2019-03-28 12:07:09,031 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 43.62/24.61 [2019-03-28 12:07:09,031 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 43.62/24.61 [2019-03-28 12:07:09,031 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 53 transitions. 43.62/24.61 [2019-03-28 12:07:09,032 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 43.62/24.61 [2019-03-28 12:07:09,032 INFO L706 BuchiCegarLoop]: Abstraction has 35 states and 53 transitions. 43.62/24.61 [2019-03-28 12:07:09,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 53 transitions. 43.62/24.61 [2019-03-28 12:07:09,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 29. 43.62/24.61 [2019-03-28 12:07:09,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. 43.62/24.61 [2019-03-28 12:07:09,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 40 transitions. 43.62/24.61 [2019-03-28 12:07:09,039 INFO L729 BuchiCegarLoop]: Abstraction has 29 states and 40 transitions. 43.62/24.61 [2019-03-28 12:07:09,040 INFO L609 BuchiCegarLoop]: Abstraction has 29 states and 40 transitions. 43.62/24.61 [2019-03-28 12:07:09,040 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ 43.62/24.61 [2019-03-28 12:07:09,040 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 40 transitions. 43.62/24.61 [2019-03-28 12:07:09,041 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 43.62/24.61 [2019-03-28 12:07:09,041 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 43.62/24.61 [2019-03-28 12:07:09,041 INFO L119 BuchiIsEmpty]: Starting construction of run 43.62/24.61 [2019-03-28 12:07:09,042 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] 43.62/24.61 [2019-03-28 12:07:09,042 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] 43.62/24.61 [2019-03-28 12:07:09,043 INFO L794 eck$LassoCheckResult]: Stem: 282#ULTIMATE.startENTRY [49] ULTIMATE.startENTRY-->L21: Formula: (<= 0 v_ULTIMATE.start_main_~x~0_8) InVars {} OutVars{ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_6|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_5|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8, ULTIMATE.start_main_#t~ret3=|v_ULTIMATE.start_main_#t~ret3_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#res, ULTIMATE.start_main_~x~0, ULTIMATE.start_main_#t~ret3] 280#L21 [34] L21-->gENTRY: Formula: (= |v_g_#in~xInParam_3| v_ULTIMATE.start_main_~x~0_7) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} OutVars{g_#in~x=|v_g_#in~xInParam_3|} AuxVars[] AssignedVars[g_#in~x]< 281#gENTRY [36] gENTRY-->L12: Formula: (= v_g_~x_1 |v_g_#in~x_1|) InVars {g_#in~x=|v_g_#in~x_1|} OutVars{g_#in~x=|v_g_#in~x_1|, g_~x=v_g_~x_1} AuxVars[] AssignedVars[g_~x] 279#L12 [46] L12-->L15: Formula: (< 0 v_g_~x_3) InVars {g_~x=v_g_~x_3} OutVars{g_~x=v_g_~x_3} AuxVars[] AssignedVars[] 277#L15 [37] L15-->gENTRY: Formula: (= |v_g_#in~xInParam_1| (+ v_g_~x_5 (- 1))) InVars {g_~x=v_g_~x_5} OutVars{g_#in~x=|v_g_#in~xInParam_1|} AuxVars[] AssignedVars[g_#in~x]< 287#gENTRY [36] gENTRY-->L12: Formula: (= v_g_~x_1 |v_g_#in~x_1|) InVars {g_#in~x=|v_g_#in~x_1|} OutVars{g_#in~x=|v_g_#in~x_1|, g_~x=v_g_~x_1} AuxVars[] AssignedVars[g_~x] 275#L12 [27] L12-->gFINAL: Formula: (and (= |v_g_#res_1| 1) (= 0 v_g_~x_2)) InVars {g_~x=v_g_~x_2} OutVars{g_#res=|v_g_#res_1|, g_~x=v_g_~x_2} AuxVars[] AssignedVars[g_#res] 278#gFINAL [29] gFINAL-->gEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 296#gEXIT >[43] gEXIT-->L15-1: AOR: Formula: (= |v_g_#t~ret0_4| |v_g_#resOutParam_1|) InVars {g_#res=|v_g_#resOutParam_1|} OutVars{g_#t~ret0=|v_g_#t~ret0_4|} AuxVars[] AssignedVars[g_#t~ret0] LVA: Formula: (= |v_g_#in~xInParam_1| (+ v_g_~x_5 (- 1))) InVars {g_~x=v_g_~x_5} OutVars{g_#in~x=|v_g_#in~xInParam_1|} AuxVars[] AssignedVars[g_#in~x] 293#L15-1 [38] L15-1-->gENTRY: Formula: (= |v_g_#in~xInParam_2| (+ |v_g_#t~ret0_5| (- 1))) InVars {g_#t~ret0=|v_g_#t~ret0_5|} OutVars{g_#in~x=|v_g_#in~xInParam_2|} AuxVars[] AssignedVars[g_#in~x]< 295#gENTRY 43.62/24.61 [2019-03-28 12:07:09,043 INFO L796 eck$LassoCheckResult]: Loop: 295#gENTRY [36] gENTRY-->L12: Formula: (= v_g_~x_1 |v_g_#in~x_1|) InVars {g_#in~x=|v_g_#in~x_1|} OutVars{g_#in~x=|v_g_#in~x_1|, g_~x=v_g_~x_1} AuxVars[] AssignedVars[g_~x] 302#L12 [47] L12-->L15: Formula: (> 0 v_g_~x_3) InVars {g_~x=v_g_~x_3} OutVars{g_~x=v_g_~x_3} AuxVars[] AssignedVars[] 290#L15 [37] L15-->gENTRY: Formula: (= |v_g_#in~xInParam_1| (+ v_g_~x_5 (- 1))) InVars {g_~x=v_g_~x_5} OutVars{g_#in~x=|v_g_#in~xInParam_1|} AuxVars[] AssignedVars[g_#in~x]< 295#gENTRY 43.62/24.61 [2019-03-28 12:07:09,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 43.62/24.61 [2019-03-28 12:07:09,044 INFO L82 PathProgramCache]: Analyzing trace with hash 1715364408, now seen corresponding path program 1 times 43.62/24.61 [2019-03-28 12:07:09,044 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 43.62/24.61 [2019-03-28 12:07:09,044 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 43.62/24.61 [2019-03-28 12:07:09,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 43.62/24.61 [2019-03-28 12:07:09,045 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 43.62/24.61 [2019-03-28 12:07:09,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 43.62/24.61 [2019-03-28 12:07:09,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 43.62/24.61 [2019-03-28 12:07:09,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 43.62/24.61 [2019-03-28 12:07:09,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 43.62/24.61 [2019-03-28 12:07:09,057 INFO L82 PathProgramCache]: Analyzing trace with hash 65881, now seen corresponding path program 3 times 43.62/24.61 [2019-03-28 12:07:09,057 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 43.62/24.61 [2019-03-28 12:07:09,057 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 43.62/24.61 [2019-03-28 12:07:09,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 43.62/24.61 [2019-03-28 12:07:09,058 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 43.62/24.61 [2019-03-28 12:07:09,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 43.62/24.61 [2019-03-28 12:07:09,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 43.62/24.61 [2019-03-28 12:07:09,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 43.62/24.61 [2019-03-28 12:07:09,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 43.62/24.61 [2019-03-28 12:07:09,063 INFO L82 PathProgramCache]: Analyzing trace with hash 900227010, now seen corresponding path program 1 times 43.62/24.61 [2019-03-28 12:07:09,063 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 43.62/24.61 [2019-03-28 12:07:09,063 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 43.62/24.61 [2019-03-28 12:07:09,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 43.62/24.61 [2019-03-28 12:07:09,064 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 43.62/24.61 [2019-03-28 12:07:09,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 43.62/24.61 [2019-03-28 12:07:09,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 43.62/24.61 [2019-03-28 12:07:09,111 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. 43.62/24.61 [2019-03-28 12:07:09,112 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 43.62/24.61 [2019-03-28 12:07:09,112 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 43.62/24.61 [2019-03-28 12:07:09,154 INFO L216 LassoAnalysis]: Preferences: 43.62/24.61 [2019-03-28 12:07:09,154 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 43.62/24.61 [2019-03-28 12:07:09,154 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 43.62/24.61 [2019-03-28 12:07:09,155 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 43.62/24.61 [2019-03-28 12:07:09,155 INFO L127 ssoRankerPreferences]: Use exernal solver: true 43.62/24.61 [2019-03-28 12:07:09,155 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 43.62/24.61 [2019-03-28 12:07:09,155 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 43.62/24.61 [2019-03-28 12:07:09,155 INFO L130 ssoRankerPreferences]: Path of dumped script: 43.62/24.61 [2019-03-28 12:07:09,155 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration4_Loop 43.62/24.61 [2019-03-28 12:07:09,155 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 43.62/24.61 [2019-03-28 12:07:09,155 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 43.62/24.61 [2019-03-28 12:07:09,156 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 43.62/24.61 [2019-03-28 12:07:09,163 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 43.62/24.61 [2019-03-28 12:07:09,166 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 43.62/24.61 [2019-03-28 12:07:09,168 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 43.62/24.61 [2019-03-28 12:07:09,171 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 43.62/24.61 [2019-03-28 12:07:09,202 INFO L300 LassoAnalysis]: Preprocessing complete. 43.62/24.61 [2019-03-28 12:07:09,202 INFO L412 LassoAnalysis]: Checking for nontermination... 43.62/24.61 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 43.62/24.61 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 43.62/24.61 Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 43.62/24.61 [2019-03-28 12:07:09,210 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 43.62/24.61 [2019-03-28 12:07:09,210 INFO L163 nArgumentSynthesizer]: Using integer mode. 43.62/24.61 [2019-03-28 12:07:09,214 INFO L445 LassoAnalysis]: Proved nontermination for one component. 43.62/24.61 [2019-03-28 12:07:09,214 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {g_#t~ret1=0} Honda state: {g_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 43.62/24.61 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 43.62/24.61 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 43.62/24.61 Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 43.62/24.61 [2019-03-28 12:07:09,243 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 43.62/24.61 [2019-03-28 12:07:09,243 INFO L163 nArgumentSynthesizer]: Using integer mode. 43.62/24.61 [2019-03-28 12:07:09,247 INFO L445 LassoAnalysis]: Proved nontermination for one component. 43.62/24.61 [2019-03-28 12:07:09,247 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {g_#res=0} Honda state: {g_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 43.62/24.61 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 43.62/24.61 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 43.62/24.61 Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 43.62/24.61 [2019-03-28 12:07:09,276 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 43.62/24.61 [2019-03-28 12:07:09,276 INFO L163 nArgumentSynthesizer]: Using integer mode. 43.62/24.61 [2019-03-28 12:07:09,279 INFO L445 LassoAnalysis]: Proved nontermination for one component. 43.62/24.61 [2019-03-28 12:07:09,280 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {g_~x=0} Honda state: {g_~x=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 43.62/24.61 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 43.62/24.61 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 43.62/24.61 Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 43.62/24.61 [2019-03-28 12:07:09,327 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 43.62/24.61 [2019-03-28 12:07:09,327 INFO L163 nArgumentSynthesizer]: Using integer mode. 43.62/24.61 [2019-03-28 12:07:09,331 INFO L445 LassoAnalysis]: Proved nontermination for one component. 43.62/24.61 [2019-03-28 12:07:09,331 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {g_#t~ret0=0} Honda state: {g_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 43.62/24.61 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 43.62/24.61 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 43.62/24.61 Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 43.62/24.61 [2019-03-28 12:07:09,360 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 43.62/24.61 [2019-03-28 12:07:09,360 INFO L163 nArgumentSynthesizer]: Using integer mode. 43.62/24.61 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 43.62/24.61 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 43.62/24.61 Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 43.62/24.61 [2019-03-28 12:07:09,390 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 43.62/24.61 [2019-03-28 12:07:09,390 INFO L163 nArgumentSynthesizer]: Using integer mode. 43.62/24.61 [2019-03-28 12:07:09,407 INFO L445 LassoAnalysis]: Proved nontermination for one component. 43.62/24.61 [2019-03-28 12:07:09,407 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {g_#in~x=-1} Honda state: {g_#in~x=-1} Generalized eigenvectors: [{g_#in~x=-1}, {g_#in~x=0}, {g_#in~x=0}] Lambdas: [1, 0, 0] Nus: [0, 0] 43.62/24.61 [2019-03-28 12:07:09,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. 43.62/24.61 [2019-03-28 12:07:09,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 43.62/24.61 [2019-03-28 12:07:09,433 INFO L87 Difference]: Start difference. First operand 29 states and 40 transitions. cyclomatic complexity: 13 Second operand 6 states. 43.62/24.61 [2019-03-28 12:07:09,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 43.62/24.61 [2019-03-28 12:07:09,539 INFO L93 Difference]: Finished difference Result 53 states and 83 transitions. 43.62/24.61 [2019-03-28 12:07:09,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 43.62/24.61 [2019-03-28 12:07:09,541 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 53 states and 83 transitions. 43.62/24.61 [2019-03-28 12:07:09,544 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 18 43.62/24.61 [2019-03-28 12:07:09,547 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 53 states to 53 states and 83 transitions. 43.62/24.61 [2019-03-28 12:07:09,547 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 48 43.62/24.61 [2019-03-28 12:07:09,548 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 48 43.62/24.61 [2019-03-28 12:07:09,548 INFO L73 IsDeterministic]: Start isDeterministic. Operand 53 states and 83 transitions. 43.62/24.61 [2019-03-28 12:07:09,548 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 43.62/24.61 [2019-03-28 12:07:09,548 INFO L706 BuchiCegarLoop]: Abstraction has 53 states and 83 transitions. 43.62/24.61 [2019-03-28 12:07:09,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states and 83 transitions. 43.62/24.61 [2019-03-28 12:07:09,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 42. 43.62/24.61 [2019-03-28 12:07:09,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. 43.62/24.61 [2019-03-28 12:07:09,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 62 transitions. 43.62/24.61 [2019-03-28 12:07:09,555 INFO L729 BuchiCegarLoop]: Abstraction has 42 states and 62 transitions. 43.62/24.61 [2019-03-28 12:07:09,555 INFO L609 BuchiCegarLoop]: Abstraction has 42 states and 62 transitions. 43.62/24.61 [2019-03-28 12:07:09,556 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ 43.62/24.61 [2019-03-28 12:07:09,556 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 42 states and 62 transitions. 43.62/24.61 [2019-03-28 12:07:09,557 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 43.62/24.61 [2019-03-28 12:07:09,557 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 43.62/24.61 [2019-03-28 12:07:09,557 INFO L119 BuchiIsEmpty]: Starting construction of run 43.62/24.61 [2019-03-28 12:07:09,558 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] 43.62/24.61 [2019-03-28 12:07:09,558 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1] 43.62/24.61 [2019-03-28 12:07:09,559 INFO L794 eck$LassoCheckResult]: Stem: 386#ULTIMATE.startENTRY [49] ULTIMATE.startENTRY-->L21: Formula: (<= 0 v_ULTIMATE.start_main_~x~0_8) InVars {} OutVars{ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_6|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_5|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8, ULTIMATE.start_main_#t~ret3=|v_ULTIMATE.start_main_#t~ret3_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#res, ULTIMATE.start_main_~x~0, ULTIMATE.start_main_#t~ret3] 379#L21 [34] L21-->gENTRY: Formula: (= |v_g_#in~xInParam_3| v_ULTIMATE.start_main_~x~0_7) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} OutVars{g_#in~x=|v_g_#in~xInParam_3|} AuxVars[] AssignedVars[g_#in~x]< 380#gENTRY [36] gENTRY-->L12: Formula: (= v_g_~x_1 |v_g_#in~x_1|) InVars {g_#in~x=|v_g_#in~x_1|} OutVars{g_#in~x=|v_g_#in~x_1|, g_~x=v_g_~x_1} AuxVars[] AssignedVars[g_~x] 407#L12 [46] L12-->L15: Formula: (< 0 v_g_~x_3) InVars {g_~x=v_g_~x_3} OutVars{g_~x=v_g_~x_3} AuxVars[] AssignedVars[] 382#L15 [37] L15-->gENTRY: Formula: (= |v_g_#in~xInParam_1| (+ v_g_~x_5 (- 1))) InVars {g_~x=v_g_~x_5} OutVars{g_#in~x=|v_g_#in~xInParam_1|} AuxVars[] AssignedVars[g_#in~x]< 393#gENTRY [36] gENTRY-->L12: Formula: (= v_g_~x_1 |v_g_#in~x_1|) InVars {g_#in~x=|v_g_#in~x_1|} OutVars{g_#in~x=|v_g_#in~x_1|, g_~x=v_g_~x_1} AuxVars[] AssignedVars[g_~x] 381#L12 [27] L12-->gFINAL: Formula: (and (= |v_g_#res_1| 1) (= 0 v_g_~x_2)) InVars {g_~x=v_g_~x_2} OutVars{g_#res=|v_g_#res_1|, g_~x=v_g_~x_2} AuxVars[] AssignedVars[g_#res] 384#gFINAL [29] gFINAL-->gEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 420#gEXIT >[43] gEXIT-->L15-1: AOR: Formula: (= |v_g_#t~ret0_4| |v_g_#resOutParam_1|) InVars {g_#res=|v_g_#resOutParam_1|} OutVars{g_#t~ret0=|v_g_#t~ret0_4|} AuxVars[] AssignedVars[g_#t~ret0] LVA: Formula: (= |v_g_#in~xInParam_1| (+ v_g_~x_5 (- 1))) InVars {g_~x=v_g_~x_5} OutVars{g_#in~x=|v_g_#in~xInParam_1|} AuxVars[] AssignedVars[g_#in~x] 389#L15-1 [38] L15-1-->gENTRY: Formula: (= |v_g_#in~xInParam_2| (+ |v_g_#t~ret0_5| (- 1))) InVars {g_#t~ret0=|v_g_#t~ret0_5|} OutVars{g_#in~x=|v_g_#in~xInParam_2|} AuxVars[] AssignedVars[g_#in~x]< 387#gENTRY 43.62/24.61 [2019-03-28 12:07:09,559 INFO L796 eck$LassoCheckResult]: Loop: 387#gENTRY [36] gENTRY-->L12: Formula: (= v_g_~x_1 |v_g_#in~x_1|) InVars {g_#in~x=|v_g_#in~x_1|} OutVars{g_#in~x=|v_g_#in~x_1|, g_~x=v_g_~x_1} AuxVars[] AssignedVars[g_~x] 392#L12 [46] L12-->L15: Formula: (< 0 v_g_~x_3) InVars {g_~x=v_g_~x_3} OutVars{g_~x=v_g_~x_3} AuxVars[] AssignedVars[] 404#L15 [37] L15-->gENTRY: Formula: (= |v_g_#in~xInParam_1| (+ v_g_~x_5 (- 1))) InVars {g_~x=v_g_~x_5} OutVars{g_#in~x=|v_g_#in~xInParam_1|} AuxVars[] AssignedVars[g_#in~x]< 402#gENTRY [36] gENTRY-->L12: Formula: (= v_g_~x_1 |v_g_#in~x_1|) InVars {g_#in~x=|v_g_#in~x_1|} OutVars{g_#in~x=|v_g_#in~x_1|, g_~x=v_g_~x_1} AuxVars[] AssignedVars[g_~x] 418#L12 [27] L12-->gFINAL: Formula: (and (= |v_g_#res_1| 1) (= 0 v_g_~x_2)) InVars {g_~x=v_g_~x_2} OutVars{g_#res=|v_g_#res_1|, g_~x=v_g_~x_2} AuxVars[] AssignedVars[g_#res] 419#gFINAL [29] gFINAL-->gEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 403#gEXIT >[43] gEXIT-->L15-1: AOR: Formula: (= |v_g_#t~ret0_4| |v_g_#resOutParam_1|) InVars {g_#res=|v_g_#resOutParam_1|} OutVars{g_#t~ret0=|v_g_#t~ret0_4|} AuxVars[] AssignedVars[g_#t~ret0] LVA: Formula: (= |v_g_#in~xInParam_1| (+ v_g_~x_5 (- 1))) InVars {g_~x=v_g_~x_5} OutVars{g_#in~x=|v_g_#in~xInParam_1|} AuxVars[] AssignedVars[g_#in~x] 390#L15-1 [38] L15-1-->gENTRY: Formula: (= |v_g_#in~xInParam_2| (+ |v_g_#t~ret0_5| (- 1))) InVars {g_#t~ret0=|v_g_#t~ret0_5|} OutVars{g_#in~x=|v_g_#in~xInParam_2|} AuxVars[] AssignedVars[g_#in~x]< 387#gENTRY 43.62/24.61 [2019-03-28 12:07:09,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 43.62/24.61 [2019-03-28 12:07:09,559 INFO L82 PathProgramCache]: Analyzing trace with hash 1715364408, now seen corresponding path program 2 times 43.62/24.61 [2019-03-28 12:07:09,560 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 43.62/24.61 [2019-03-28 12:07:09,560 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 43.62/24.61 [2019-03-28 12:07:09,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 43.62/24.61 [2019-03-28 12:07:09,561 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 43.62/24.61 [2019-03-28 12:07:09,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 43.62/24.61 [2019-03-28 12:07:09,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 43.62/24.61 [2019-03-28 12:07:09,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 43.62/24.61 [2019-03-28 12:07:09,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 43.62/24.61 [2019-03-28 12:07:09,570 INFO L82 PathProgramCache]: Analyzing trace with hash -226969241, now seen corresponding path program 1 times 43.62/24.61 [2019-03-28 12:07:09,570 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 43.62/24.61 [2019-03-28 12:07:09,571 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 43.62/24.61 [2019-03-28 12:07:09,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 43.62/24.61 [2019-03-28 12:07:09,571 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 43.62/24.61 [2019-03-28 12:07:09,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 43.62/24.61 [2019-03-28 12:07:09,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 43.62/24.61 [2019-03-28 12:07:09,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 43.62/24.61 [2019-03-28 12:07:09,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 43.62/24.61 [2019-03-28 12:07:09,579 INFO L82 PathProgramCache]: Analyzing trace with hash 1206449310, now seen corresponding path program 3 times 43.62/24.61 [2019-03-28 12:07:09,579 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 43.62/24.61 [2019-03-28 12:07:09,579 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 43.62/24.61 [2019-03-28 12:07:09,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 43.62/24.61 [2019-03-28 12:07:09,580 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 43.62/24.61 [2019-03-28 12:07:09,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 43.62/24.61 [2019-03-28 12:07:09,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 43.62/24.61 [2019-03-28 12:07:09,610 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. 43.62/24.61 [2019-03-28 12:07:09,610 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 43.62/24.61 [2019-03-28 12:07:09,610 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 43.62/24.61 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 43.62/24.61 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 43.62/24.61 Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 43.62/24.61 [2019-03-28 12:07:09,621 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 43.62/24.61 [2019-03-28 12:07:09,632 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) 43.62/24.61 [2019-03-28 12:07:09,632 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat 43.62/24.61 [2019-03-28 12:07:09,633 INFO L256 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 7 conjunts are in the unsatisfiable core 43.62/24.61 [2019-03-28 12:07:09,634 INFO L279 TraceCheckSpWp]: Computing forward predicates... 43.62/24.61 [2019-03-28 12:07:09,662 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. 43.62/24.61 [2019-03-28 12:07:09,688 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 43.62/24.61 [2019-03-28 12:07:09,688 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8] total 8 43.62/24.61 [2019-03-28 12:07:09,755 INFO L216 LassoAnalysis]: Preferences: 43.62/24.61 [2019-03-28 12:07:09,755 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 43.62/24.61 [2019-03-28 12:07:09,755 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 43.62/24.61 [2019-03-28 12:07:09,755 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 43.62/24.61 [2019-03-28 12:07:09,755 INFO L127 ssoRankerPreferences]: Use exernal solver: true 43.62/24.61 [2019-03-28 12:07:09,755 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 43.62/24.61 [2019-03-28 12:07:09,756 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 43.62/24.61 [2019-03-28 12:07:09,756 INFO L130 ssoRankerPreferences]: Path of dumped script: 43.62/24.61 [2019-03-28 12:07:09,756 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration5_Loop 43.62/24.61 [2019-03-28 12:07:09,756 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 43.62/24.61 [2019-03-28 12:07:09,756 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 43.62/24.61 [2019-03-28 12:07:09,757 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 43.62/24.61 [2019-03-28 12:07:09,759 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 43.62/24.61 [2019-03-28 12:07:09,763 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 43.62/24.61 [2019-03-28 12:07:09,764 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 43.62/24.61 [2019-03-28 12:07:09,766 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 43.62/24.61 [2019-03-28 12:07:09,788 INFO L300 LassoAnalysis]: Preprocessing complete. 43.62/24.61 [2019-03-28 12:07:09,788 INFO L412 LassoAnalysis]: Checking for nontermination... 43.62/24.61 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 43.62/24.61 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 43.62/24.61 Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 43.62/24.61 [2019-03-28 12:07:09,792 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 43.62/24.61 [2019-03-28 12:07:09,792 INFO L163 nArgumentSynthesizer]: Using integer mode. 43.62/24.61 [2019-03-28 12:07:09,795 INFO L445 LassoAnalysis]: Proved nontermination for one component. 43.62/24.61 [2019-03-28 12:07:09,795 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {g_#t~ret1=0} Honda state: {g_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 43.62/24.61 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 43.62/24.61 Starting monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 43.62/24.61 Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 43.62/24.61 [2019-03-28 12:07:09,821 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 43.62/24.61 [2019-03-28 12:07:09,821 INFO L163 nArgumentSynthesizer]: Using integer mode. 43.62/24.61 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 43.62/24.61 Starting monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 43.62/24.61 Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 43.62/24.61 [2019-03-28 12:07:09,851 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 43.62/24.61 [2019-03-28 12:07:09,851 INFO L163 nArgumentSynthesizer]: Using integer mode. 43.62/24.61 [2019-03-28 12:07:09,855 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. 43.62/24.61 [2019-03-28 12:07:09,878 INFO L216 LassoAnalysis]: Preferences: 43.62/24.61 [2019-03-28 12:07:09,879 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 43.62/24.61 [2019-03-28 12:07:09,879 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 43.62/24.61 [2019-03-28 12:07:09,879 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 43.62/24.61 [2019-03-28 12:07:09,879 INFO L127 ssoRankerPreferences]: Use exernal solver: false 43.62/24.61 [2019-03-28 12:07:09,879 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 43.62/24.61 [2019-03-28 12:07:09,879 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 43.62/24.61 [2019-03-28 12:07:09,879 INFO L130 ssoRankerPreferences]: Path of dumped script: 43.62/24.61 [2019-03-28 12:07:09,879 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration5_Loop 43.62/24.61 [2019-03-28 12:07:09,880 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 43.62/24.61 [2019-03-28 12:07:09,880 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 43.62/24.61 [2019-03-28 12:07:09,881 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 43.62/24.61 [2019-03-28 12:07:09,883 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 43.62/24.61 [2019-03-28 12:07:09,884 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 43.62/24.61 [2019-03-28 12:07:09,886 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 43.62/24.61 [2019-03-28 12:07:09,890 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 43.62/24.61 [2019-03-28 12:07:09,912 INFO L300 LassoAnalysis]: Preprocessing complete. 43.62/24.61 [2019-03-28 12:07:09,912 INFO L497 LassoAnalysis]: Using template 'affine'. 43.62/24.61 [2019-03-28 12:07:09,913 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 43.62/24.61 Termination analysis: LINEAR_WITH_GUESSES 43.62/24.61 Number of strict supporting invariants: 0 43.62/24.61 Number of non-strict supporting invariants: 1 43.62/24.61 Consider only non-deceasing supporting invariants: true 43.62/24.61 Simplify termination arguments: true 43.62/24.61 Simplify supporting invariants: trueOverapproximate stem: false 43.62/24.61 [2019-03-28 12:07:09,913 INFO L339 nArgumentSynthesizer]: Template has degree 0. 43.62/24.61 [2019-03-28 12:07:09,913 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 43.62/24.61 [2019-03-28 12:07:09,914 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 43.62/24.61 [2019-03-28 12:07:09,914 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 43.62/24.61 [2019-03-28 12:07:09,914 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 43.62/24.61 [2019-03-28 12:07:09,914 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 43.62/24.61 [2019-03-28 12:07:09,915 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 43.62/24.61 [2019-03-28 12:07:09,916 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 43.62/24.61 [2019-03-28 12:07:09,916 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 43.62/24.61 Termination analysis: LINEAR_WITH_GUESSES 43.62/24.61 Number of strict supporting invariants: 0 43.62/24.61 Number of non-strict supporting invariants: 1 43.62/24.61 Consider only non-deceasing supporting invariants: true 43.62/24.61 Simplify termination arguments: true 43.62/24.61 Simplify supporting invariants: trueOverapproximate stem: false 43.62/24.61 [2019-03-28 12:07:09,917 INFO L339 nArgumentSynthesizer]: Template has degree 0. 43.62/24.61 [2019-03-28 12:07:09,917 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 43.62/24.61 [2019-03-28 12:07:09,917 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 43.62/24.61 [2019-03-28 12:07:09,917 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 43.62/24.61 [2019-03-28 12:07:09,917 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 43.62/24.61 [2019-03-28 12:07:09,918 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 43.62/24.61 [2019-03-28 12:07:09,918 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 43.62/24.61 [2019-03-28 12:07:09,919 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 43.62/24.61 [2019-03-28 12:07:09,919 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 43.62/24.61 Termination analysis: LINEAR_WITH_GUESSES 43.62/24.61 Number of strict supporting invariants: 0 43.62/24.61 Number of non-strict supporting invariants: 1 43.62/24.61 Consider only non-deceasing supporting invariants: true 43.62/24.61 Simplify termination arguments: true 43.62/24.61 Simplify supporting invariants: trueOverapproximate stem: false 43.62/24.61 [2019-03-28 12:07:09,919 INFO L339 nArgumentSynthesizer]: Template has degree 0. 43.62/24.61 [2019-03-28 12:07:09,920 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 43.62/24.61 [2019-03-28 12:07:09,920 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 43.62/24.61 [2019-03-28 12:07:09,920 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 43.62/24.61 [2019-03-28 12:07:09,920 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 43.62/24.61 [2019-03-28 12:07:09,921 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 43.62/24.61 [2019-03-28 12:07:09,921 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 43.62/24.61 [2019-03-28 12:07:09,921 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 43.62/24.61 [2019-03-28 12:07:09,922 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 43.62/24.61 Termination analysis: LINEAR_WITH_GUESSES 43.62/24.61 Number of strict supporting invariants: 0 43.62/24.61 Number of non-strict supporting invariants: 1 43.62/24.61 Consider only non-deceasing supporting invariants: true 43.62/24.61 Simplify termination arguments: true 43.62/24.61 Simplify supporting invariants: trueOverapproximate stem: false 43.62/24.61 [2019-03-28 12:07:09,922 INFO L339 nArgumentSynthesizer]: Template has degree 0. 43.62/24.61 [2019-03-28 12:07:09,922 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 43.62/24.61 [2019-03-28 12:07:09,922 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 43.62/24.61 [2019-03-28 12:07:09,923 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 43.62/24.61 [2019-03-28 12:07:09,923 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 43.62/24.61 [2019-03-28 12:07:09,923 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 43.62/24.61 [2019-03-28 12:07:09,924 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 43.62/24.61 [2019-03-28 12:07:09,927 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 43.62/24.61 [2019-03-28 12:07:09,930 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 43.62/24.61 [2019-03-28 12:07:09,930 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. 43.62/24.61 [2019-03-28 12:07:09,930 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 43.62/24.61 [2019-03-28 12:07:09,930 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 43.62/24.61 [2019-03-28 12:07:09,931 INFO L518 LassoAnalysis]: Proved termination. 43.62/24.61 [2019-03-28 12:07:09,931 INFO L520 LassoAnalysis]: Termination argument consisting of: 43.62/24.61 Ranking function f(g_#in~x) = 1*g_#in~x 43.62/24.61 Supporting invariants [] 43.62/24.61 [2019-03-28 12:07:09,931 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed 43.62/24.61 [2019-03-28 12:07:09,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 43.62/24.61 [2019-03-28 12:07:09,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 43.62/24.61 [2019-03-28 12:07:09,971 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 8 conjunts are in the unsatisfiable core 43.62/24.61 [2019-03-28 12:07:09,973 INFO L279 TraceCheckSpWp]: Computing forward predicates... 43.62/24.61 [2019-03-28 12:07:10,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 43.62/24.61 [2019-03-28 12:07:10,007 INFO L256 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 11 conjunts are in the unsatisfiable core 43.62/24.61 [2019-03-28 12:07:10,008 INFO L279 TraceCheckSpWp]: Computing forward predicates... 43.62/24.61 [2019-03-28 12:07:10,057 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 43.62/24.61 [2019-03-28 12:07:10,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 43.62/24.61 [2019-03-28 12:07:10,116 INFO L256 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 5 conjunts are in the unsatisfiable core 43.62/24.61 [2019-03-28 12:07:10,117 INFO L279 TraceCheckSpWp]: Computing forward predicates... 43.62/24.61 [2019-03-28 12:07:10,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 43.62/24.61 [2019-03-28 12:07:10,180 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 43.62/24.61 [2019-03-28 12:07:10,180 INFO L98 LoopCannibalizer]: 6 predicates before loop cannibalization 9 predicates after loop cannibalization 43.62/24.61 [2019-03-28 12:07:10,181 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.3 stem predicates 9 loop predicates 43.62/24.61 [2019-03-28 12:07:10,181 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 42 states and 62 transitions. cyclomatic complexity: 22 Second operand 8 states. 43.62/24.61 [2019-03-28 12:07:12,477 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 42 states and 62 transitions. cyclomatic complexity: 22. Second operand 8 states. Result 11761 states and 20894 transitions. Complement of second has 5801 states. 43.62/24.61 [2019-03-28 12:07:12,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 23 states 2 stem states 19 non-accepting loop states 1 accepting loop states 43.62/24.61 [2019-03-28 12:07:12,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. 43.62/24.61 [2019-03-28 12:07:12,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 117 transitions. 43.62/24.61 [2019-03-28 12:07:12,480 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 117 transitions. Stem has 10 letters. Loop has 8 letters. 43.62/24.61 [2019-03-28 12:07:12,482 INFO L116 BuchiAccepts]: Finished buchiAccepts. 43.62/24.61 [2019-03-28 12:07:12,482 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 117 transitions. Stem has 18 letters. Loop has 8 letters. 43.62/24.61 [2019-03-28 12:07:12,484 INFO L116 BuchiAccepts]: Finished buchiAccepts. 43.62/24.61 [2019-03-28 12:07:12,484 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 117 transitions. Stem has 10 letters. Loop has 16 letters. 43.62/24.61 [2019-03-28 12:07:12,486 INFO L116 BuchiAccepts]: Finished buchiAccepts. 43.62/24.61 [2019-03-28 12:07:12,488 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11761 states and 20894 transitions. 43.62/24.61 [2019-03-28 12:07:12,917 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 50 43.62/24.61 [2019-03-28 12:07:12,925 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11761 states to 224 states and 337 transitions. 43.62/24.61 [2019-03-28 12:07:12,933 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 172 43.62/24.61 [2019-03-28 12:07:12,934 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 185 43.62/24.61 [2019-03-28 12:07:12,934 INFO L73 IsDeterministic]: Start isDeterministic. Operand 224 states and 337 transitions. 43.62/24.61 [2019-03-28 12:07:12,934 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 43.62/24.61 [2019-03-28 12:07:12,935 INFO L706 BuchiCegarLoop]: Abstraction has 224 states and 337 transitions. 43.62/24.61 [2019-03-28 12:07:12,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states and 337 transitions. 43.62/24.61 [2019-03-28 12:07:12,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 179. 43.62/24.61 [2019-03-28 12:07:12,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. 43.62/24.61 [2019-03-28 12:07:12,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 264 transitions. 43.62/24.61 [2019-03-28 12:07:12,959 INFO L729 BuchiCegarLoop]: Abstraction has 179 states and 264 transitions. 43.62/24.61 [2019-03-28 12:07:12,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. 43.62/24.61 [2019-03-28 12:07:12,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 43.62/24.61 [2019-03-28 12:07:12,960 INFO L87 Difference]: Start difference. First operand 179 states and 264 transitions. Second operand 8 states. 43.62/24.61 [2019-03-28 12:07:13,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 43.62/24.61 [2019-03-28 12:07:13,121 INFO L93 Difference]: Finished difference Result 84 states and 104 transitions. 43.62/24.61 [2019-03-28 12:07:13,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 43.62/24.61 [2019-03-28 12:07:13,124 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 84 states and 104 transitions. 43.62/24.61 [2019-03-28 12:07:13,126 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 43.62/24.61 [2019-03-28 12:07:13,128 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 84 states to 70 states and 87 transitions. 43.62/24.61 [2019-03-28 12:07:13,128 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 58 43.62/24.61 [2019-03-28 12:07:13,128 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 58 43.62/24.61 [2019-03-28 12:07:13,128 INFO L73 IsDeterministic]: Start isDeterministic. Operand 70 states and 87 transitions. 43.62/24.61 [2019-03-28 12:07:13,129 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 43.62/24.61 [2019-03-28 12:07:13,129 INFO L706 BuchiCegarLoop]: Abstraction has 70 states and 87 transitions. 43.62/24.61 [2019-03-28 12:07:13,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states and 87 transitions. 43.62/24.61 [2019-03-28 12:07:13,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 57. 43.62/24.61 [2019-03-28 12:07:13,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. 43.62/24.61 [2019-03-28 12:07:13,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 72 transitions. 43.62/24.61 [2019-03-28 12:07:13,134 INFO L729 BuchiCegarLoop]: Abstraction has 57 states and 72 transitions. 43.62/24.61 [2019-03-28 12:07:13,134 INFO L609 BuchiCegarLoop]: Abstraction has 57 states and 72 transitions. 43.62/24.61 [2019-03-28 12:07:13,135 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ 43.62/24.61 [2019-03-28 12:07:13,135 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 57 states and 72 transitions. 43.62/24.61 [2019-03-28 12:07:13,136 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 43.62/24.61 [2019-03-28 12:07:13,136 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 43.62/24.61 [2019-03-28 12:07:13,136 INFO L119 BuchiIsEmpty]: Starting construction of run 43.62/24.61 [2019-03-28 12:07:13,137 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [5, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] 43.62/24.61 [2019-03-28 12:07:13,137 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] 43.62/24.61 [2019-03-28 12:07:13,137 INFO L794 eck$LassoCheckResult]: Stem: 18469#ULTIMATE.startENTRY [49] ULTIMATE.startENTRY-->L21: Formula: (<= 0 v_ULTIMATE.start_main_~x~0_8) InVars {} OutVars{ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_6|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_5|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8, ULTIMATE.start_main_#t~ret3=|v_ULTIMATE.start_main_#t~ret3_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#res, ULTIMATE.start_main_~x~0, ULTIMATE.start_main_#t~ret3] 18467#L21 [34] L21-->gENTRY: Formula: (= |v_g_#in~xInParam_3| v_ULTIMATE.start_main_~x~0_7) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} OutVars{g_#in~x=|v_g_#in~xInParam_3|} AuxVars[] AssignedVars[g_#in~x]< 18468#gENTRY [36] gENTRY-->L12: Formula: (= v_g_~x_1 |v_g_#in~x_1|) InVars {g_#in~x=|v_g_#in~x_1|} OutVars{g_#in~x=|v_g_#in~x_1|, g_~x=v_g_~x_1} AuxVars[] AssignedVars[g_~x] 18470#L12 [46] L12-->L15: Formula: (< 0 v_g_~x_3) InVars {g_~x=v_g_~x_3} OutVars{g_~x=v_g_~x_3} AuxVars[] AssignedVars[] 18484#L15 [37] L15-->gENTRY: Formula: (= |v_g_#in~xInParam_1| (+ v_g_~x_5 (- 1))) InVars {g_~x=v_g_~x_5} OutVars{g_#in~x=|v_g_#in~xInParam_1|} AuxVars[] AssignedVars[g_#in~x]< 18485#gENTRY [36] gENTRY-->L12: Formula: (= v_g_~x_1 |v_g_#in~x_1|) InVars {g_#in~x=|v_g_#in~x_1|} OutVars{g_#in~x=|v_g_#in~x_1|, g_~x=v_g_~x_1} AuxVars[] AssignedVars[g_~x] 18505#L12 [46] L12-->L15: Formula: (< 0 v_g_~x_3) InVars {g_~x=v_g_~x_3} OutVars{g_~x=v_g_~x_3} AuxVars[] AssignedVars[] 18494#L15 [37] L15-->gENTRY: Formula: (= |v_g_#in~xInParam_1| (+ v_g_~x_5 (- 1))) InVars {g_~x=v_g_~x_5} OutVars{g_#in~x=|v_g_#in~xInParam_1|} AuxVars[] AssignedVars[g_#in~x]< 18485#gENTRY [36] gENTRY-->L12: Formula: (= v_g_~x_1 |v_g_#in~x_1|) InVars {g_#in~x=|v_g_#in~x_1|} OutVars{g_#in~x=|v_g_#in~x_1|, g_~x=v_g_~x_1} AuxVars[] AssignedVars[g_~x] 18501#L12 [27] L12-->gFINAL: Formula: (and (= |v_g_#res_1| 1) (= 0 v_g_~x_2)) InVars {g_~x=v_g_~x_2} OutVars{g_#res=|v_g_#res_1|, g_~x=v_g_~x_2} AuxVars[] AssignedVars[g_#res] 18502#gFINAL [29] gFINAL-->gEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 18498#gEXIT >[43] gEXIT-->L15-1: AOR: Formula: (= |v_g_#t~ret0_4| |v_g_#resOutParam_1|) InVars {g_#res=|v_g_#resOutParam_1|} OutVars{g_#t~ret0=|v_g_#t~ret0_4|} AuxVars[] AssignedVars[g_#t~ret0] LVA: Formula: (= |v_g_#in~xInParam_1| (+ v_g_~x_5 (- 1))) InVars {g_~x=v_g_~x_5} OutVars{g_#in~x=|v_g_#in~xInParam_1|} AuxVars[] AssignedVars[g_#in~x] 18491#L15-1 [38] L15-1-->gENTRY: Formula: (= |v_g_#in~xInParam_2| (+ |v_g_#t~ret0_5| (- 1))) InVars {g_#t~ret0=|v_g_#t~ret0_5|} OutVars{g_#in~x=|v_g_#in~xInParam_2|} AuxVars[] AssignedVars[g_#in~x]< 18490#gENTRY [36] gENTRY-->L12: Formula: (= v_g_~x_1 |v_g_#in~x_1|) InVars {g_#in~x=|v_g_#in~x_1|} OutVars{g_#in~x=|v_g_#in~x_1|, g_~x=v_g_~x_1} AuxVars[] AssignedVars[g_~x] 18492#L12 [27] L12-->gFINAL: Formula: (and (= |v_g_#res_1| 1) (= 0 v_g_~x_2)) InVars {g_~x=v_g_~x_2} OutVars{g_#res=|v_g_#res_1|, g_~x=v_g_~x_2} AuxVars[] AssignedVars[g_#res] 18510#gFINAL [29] gFINAL-->gEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 18503#gEXIT >[42] gEXIT-->L15-2: AOR: Formula: (= |v_g_#t~ret1_4| |v_g_#resOutParam_2|) InVars {g_#res=|v_g_#resOutParam_2|} OutVars{g_#t~ret1=|v_g_#t~ret1_4|} AuxVars[] AssignedVars[g_#t~ret1] LVA: Formula: (= |v_g_#in~xInParam_2| (+ |v_g_#t~ret0_5| (- 1))) InVars {g_#t~ret0=|v_g_#t~ret0_5|} OutVars{g_#in~x=|v_g_#in~xInParam_2|} AuxVars[] AssignedVars[g_#in~x] 18481#L15-2 [40] L15-2-->gFINAL: Formula: (= |v_g_#res_2| |v_g_#t~ret1_3|) InVars {g_#t~ret1=|v_g_#t~ret1_3|} OutVars{g_#t~ret1=|v_g_#t~ret1_2|, g_#res=|v_g_#res_2|, g_#t~ret0=|v_g_#t~ret0_3|} AuxVars[] AssignedVars[g_#t~ret1, g_#res, g_#t~ret0] 18497#gFINAL [29] gFINAL-->gEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 18493#gEXIT >[43] gEXIT-->L15-1: AOR: Formula: (= |v_g_#t~ret0_4| |v_g_#resOutParam_1|) InVars {g_#res=|v_g_#resOutParam_1|} OutVars{g_#t~ret0=|v_g_#t~ret0_4|} AuxVars[] AssignedVars[g_#t~ret0] LVA: Formula: (= |v_g_#in~xInParam_1| (+ v_g_~x_5 (- 1))) InVars {g_~x=v_g_~x_5} OutVars{g_#in~x=|v_g_#in~xInParam_1|} AuxVars[] AssignedVars[g_#in~x] 18479#L15-1 [38] L15-1-->gENTRY: Formula: (= |v_g_#in~xInParam_2| (+ |v_g_#t~ret0_5| (- 1))) InVars {g_#t~ret0=|v_g_#t~ret0_5|} OutVars{g_#in~x=|v_g_#in~xInParam_2|} AuxVars[] AssignedVars[g_#in~x]< 18489#gENTRY [36] gENTRY-->L12: Formula: (= v_g_~x_1 |v_g_#in~x_1|) InVars {g_#in~x=|v_g_#in~x_1|} OutVars{g_#in~x=|v_g_#in~x_1|, g_~x=v_g_~x_1} AuxVars[] AssignedVars[g_~x] 18512#L12 [47] L12-->L15: Formula: (> 0 v_g_~x_3) InVars {g_~x=v_g_~x_3} OutVars{g_~x=v_g_~x_3} AuxVars[] AssignedVars[] 18482#L15 43.62/24.61 [2019-03-28 12:07:13,137 INFO L796 eck$LassoCheckResult]: Loop: 18482#L15 [37] L15-->gENTRY: Formula: (= |v_g_#in~xInParam_1| (+ v_g_~x_5 (- 1))) InVars {g_~x=v_g_~x_5} OutVars{g_#in~x=|v_g_#in~xInParam_1|} AuxVars[] AssignedVars[g_#in~x]< 18483#gENTRY [36] gENTRY-->L12: Formula: (= v_g_~x_1 |v_g_#in~x_1|) InVars {g_#in~x=|v_g_#in~x_1|} OutVars{g_#in~x=|v_g_#in~x_1|, g_~x=v_g_~x_1} AuxVars[] AssignedVars[g_~x] 18488#L12 [47] L12-->L15: Formula: (> 0 v_g_~x_3) InVars {g_~x=v_g_~x_3} OutVars{g_~x=v_g_~x_3} AuxVars[] AssignedVars[] 18482#L15 43.62/24.61 [2019-03-28 12:07:13,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 43.62/24.61 [2019-03-28 12:07:13,138 INFO L82 PathProgramCache]: Analyzing trace with hash 2101012846, now seen corresponding path program 1 times 43.62/24.61 [2019-03-28 12:07:13,138 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 43.62/24.61 [2019-03-28 12:07:13,138 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 43.62/24.61 [2019-03-28 12:07:13,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 43.62/24.61 [2019-03-28 12:07:13,139 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 43.62/24.61 [2019-03-28 12:07:13,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 43.62/24.61 [2019-03-28 12:07:13,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 43.62/24.61 [2019-03-28 12:07:13,190 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. 43.62/24.61 [2019-03-28 12:07:13,191 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 43.62/24.61 [2019-03-28 12:07:13,191 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 43.62/24.61 [2019-03-28 12:07:13,191 INFO L799 eck$LassoCheckResult]: stem already infeasible 43.62/24.61 [2019-03-28 12:07:13,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 43.62/24.61 [2019-03-28 12:07:13,192 INFO L82 PathProgramCache]: Analyzing trace with hash 66511, now seen corresponding path program 4 times 43.62/24.61 [2019-03-28 12:07:13,192 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 43.62/24.61 [2019-03-28 12:07:13,192 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 43.62/24.61 [2019-03-28 12:07:13,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 43.62/24.61 [2019-03-28 12:07:13,193 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 43.62/24.61 [2019-03-28 12:07:13,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 43.62/24.61 [2019-03-28 12:07:13,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 43.62/24.61 [2019-03-28 12:07:13,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 43.62/24.61 [2019-03-28 12:07:13,231 INFO L216 LassoAnalysis]: Preferences: 43.62/24.61 [2019-03-28 12:07:13,231 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 43.62/24.61 [2019-03-28 12:07:13,231 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 43.62/24.61 [2019-03-28 12:07:13,232 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 43.62/24.61 [2019-03-28 12:07:13,232 INFO L127 ssoRankerPreferences]: Use exernal solver: true 43.62/24.61 [2019-03-28 12:07:13,232 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 43.62/24.61 [2019-03-28 12:07:13,232 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 43.62/24.61 [2019-03-28 12:07:13,232 INFO L130 ssoRankerPreferences]: Path of dumped script: 43.62/24.61 [2019-03-28 12:07:13,232 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration6_Loop 43.62/24.61 [2019-03-28 12:07:13,232 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 43.62/24.61 [2019-03-28 12:07:13,232 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 43.62/24.61 [2019-03-28 12:07:13,234 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 43.62/24.61 [2019-03-28 12:07:13,242 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 43.62/24.61 [2019-03-28 12:07:13,244 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 43.62/24.61 [2019-03-28 12:07:13,246 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 43.62/24.61 [2019-03-28 12:07:13,279 INFO L300 LassoAnalysis]: Preprocessing complete. 43.62/24.61 [2019-03-28 12:07:13,279 INFO L412 LassoAnalysis]: Checking for nontermination... 43.62/24.61 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 43.62/24.61 Starting monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 43.62/24.61 Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 43.62/24.61 [2019-03-28 12:07:13,285 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 43.62/24.61 [2019-03-28 12:07:13,285 INFO L163 nArgumentSynthesizer]: Using integer mode. 43.62/24.61 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 43.62/24.61 Starting monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 43.62/24.61 Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 43.62/24.61 [2019-03-28 12:07:13,320 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 43.62/24.61 [2019-03-28 12:07:13,320 INFO L163 nArgumentSynthesizer]: Using integer mode. 43.62/24.61 [2019-03-28 12:07:13,539 INFO L445 LassoAnalysis]: Proved nontermination for one component. 43.62/24.61 [2019-03-28 12:07:13,539 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {g_#in~x=-7, g_~x=-2} Honda state: {g_#in~x=-7, g_~x=-2} Generalized eigenvectors: [{g_#in~x=-1, g_~x=0}, {g_#in~x=6, g_~x=0}, {g_#in~x=-1, g_~x=-1}] Lambdas: [6, 0, 1] Nus: [1, 0] 43.62/24.61 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 43.62/24.61 Starting monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 43.62/24.61 Waiting until toolchain timeout for monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 43.62/24.61 [2019-03-28 12:07:13,569 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 43.62/24.61 [2019-03-28 12:07:13,569 INFO L163 nArgumentSynthesizer]: Using integer mode. 43.62/24.61 [2019-03-28 12:07:13,572 INFO L445 LassoAnalysis]: Proved nontermination for one component. 43.62/24.61 [2019-03-28 12:07:13,573 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {g_#res=0} Honda state: {g_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 43.62/24.61 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 43.62/24.61 Starting monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 43.62/24.61 Waiting until toolchain timeout for monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 43.62/24.61 [2019-03-28 12:07:13,600 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 43.62/24.61 [2019-03-28 12:07:13,600 INFO L163 nArgumentSynthesizer]: Using integer mode. 43.62/24.61 [2019-03-28 12:07:13,603 INFO L445 LassoAnalysis]: Proved nontermination for one component. 43.62/24.61 [2019-03-28 12:07:13,604 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {g_#t~ret1=0} Honda state: {g_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 43.62/24.61 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 43.62/24.61 Starting monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 43.62/24.61 Waiting until toolchain timeout for monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 43.62/24.61 [2019-03-28 12:07:13,632 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 43.62/24.61 [2019-03-28 12:07:13,632 INFO L163 nArgumentSynthesizer]: Using integer mode. 43.62/24.61 [2019-03-28 12:07:13,635 INFO L445 LassoAnalysis]: Proved nontermination for one component. 43.62/24.61 [2019-03-28 12:07:13,635 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {g_#t~ret0=0} Honda state: {g_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 43.62/24.61 [2019-03-28 12:07:13,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. 43.62/24.61 [2019-03-28 12:07:13,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 43.62/24.61 [2019-03-28 12:07:13,662 INFO L87 Difference]: Start difference. First operand 57 states and 72 transitions. cyclomatic complexity: 18 Second operand 7 states. 43.62/24.61 [2019-03-28 12:07:13,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 43.62/24.61 [2019-03-28 12:07:13,789 INFO L93 Difference]: Finished difference Result 54 states and 67 transitions. 43.62/24.61 [2019-03-28 12:07:13,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 43.62/24.61 [2019-03-28 12:07:13,792 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 54 states and 67 transitions. 43.62/24.61 [2019-03-28 12:07:13,794 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 43.62/24.61 [2019-03-28 12:07:13,795 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 54 states to 54 states and 67 transitions. 43.62/24.61 [2019-03-28 12:07:13,795 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 42 43.62/24.61 [2019-03-28 12:07:13,795 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 42 43.62/24.61 [2019-03-28 12:07:13,795 INFO L73 IsDeterministic]: Start isDeterministic. Operand 54 states and 67 transitions. 43.62/24.61 [2019-03-28 12:07:13,796 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 43.62/24.61 [2019-03-28 12:07:13,796 INFO L706 BuchiCegarLoop]: Abstraction has 54 states and 67 transitions. 43.62/24.61 [2019-03-28 12:07:13,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states and 67 transitions. 43.62/24.61 [2019-03-28 12:07:13,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. 43.62/24.61 [2019-03-28 12:07:13,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. 43.62/24.61 [2019-03-28 12:07:13,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 67 transitions. 43.62/24.61 [2019-03-28 12:07:13,800 INFO L729 BuchiCegarLoop]: Abstraction has 54 states and 67 transitions. 43.62/24.61 [2019-03-28 12:07:13,800 INFO L609 BuchiCegarLoop]: Abstraction has 54 states and 67 transitions. 43.62/24.61 [2019-03-28 12:07:13,801 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ 43.62/24.61 [2019-03-28 12:07:13,801 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 54 states and 67 transitions. 43.62/24.61 [2019-03-28 12:07:13,802 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 43.62/24.61 [2019-03-28 12:07:13,802 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 43.62/24.61 [2019-03-28 12:07:13,802 INFO L119 BuchiIsEmpty]: Starting construction of run 43.62/24.61 [2019-03-28 12:07:13,803 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [6, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1] 43.62/24.61 [2019-03-28 12:07:13,803 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] 43.62/24.61 [2019-03-28 12:07:13,803 INFO L794 eck$LassoCheckResult]: Stem: 18604#ULTIMATE.startENTRY [49] ULTIMATE.startENTRY-->L21: Formula: (<= 0 v_ULTIMATE.start_main_~x~0_8) InVars {} OutVars{ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_6|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_5|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8, ULTIMATE.start_main_#t~ret3=|v_ULTIMATE.start_main_#t~ret3_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#res, ULTIMATE.start_main_~x~0, ULTIMATE.start_main_#t~ret3] 18602#L21 [34] L21-->gENTRY: Formula: (= |v_g_#in~xInParam_3| v_ULTIMATE.start_main_~x~0_7) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} OutVars{g_#in~x=|v_g_#in~xInParam_3|} AuxVars[] AssignedVars[g_#in~x]< 18603#gENTRY [36] gENTRY-->L12: Formula: (= v_g_~x_1 |v_g_#in~x_1|) InVars {g_#in~x=|v_g_#in~x_1|} OutVars{g_#in~x=|v_g_#in~x_1|, g_~x=v_g_~x_1} AuxVars[] AssignedVars[g_~x] 18639#L12 [46] L12-->L15: Formula: (< 0 v_g_~x_3) InVars {g_~x=v_g_~x_3} OutVars{g_~x=v_g_~x_3} AuxVars[] AssignedVars[] 18609#L15 [37] L15-->gENTRY: Formula: (= |v_g_#in~xInParam_1| (+ v_g_~x_5 (- 1))) InVars {g_~x=v_g_~x_5} OutVars{g_#in~x=|v_g_#in~xInParam_1|} AuxVars[] AssignedVars[g_#in~x]< 18608#gENTRY [36] gENTRY-->L12: Formula: (= v_g_~x_1 |v_g_#in~x_1|) InVars {g_#in~x=|v_g_#in~x_1|} OutVars{g_#in~x=|v_g_#in~x_1|, g_~x=v_g_~x_1} AuxVars[] AssignedVars[g_~x] 18612#L12 [46] L12-->L15: Formula: (< 0 v_g_~x_3) InVars {g_~x=v_g_~x_3} OutVars{g_~x=v_g_~x_3} AuxVars[] AssignedVars[] 18610#L15 [37] L15-->gENTRY: Formula: (= |v_g_#in~xInParam_1| (+ v_g_~x_5 (- 1))) InVars {g_~x=v_g_~x_5} OutVars{g_#in~x=|v_g_#in~xInParam_1|} AuxVars[] AssignedVars[g_#in~x]< 18608#gENTRY [36] gENTRY-->L12: Formula: (= v_g_~x_1 |v_g_#in~x_1|) InVars {g_#in~x=|v_g_#in~x_1|} OutVars{g_#in~x=|v_g_#in~x_1|, g_~x=v_g_~x_1} AuxVars[] AssignedVars[g_~x] 18611#L12 [27] L12-->gFINAL: Formula: (and (= |v_g_#res_1| 1) (= 0 v_g_~x_2)) InVars {g_~x=v_g_~x_2} OutVars{g_#res=|v_g_#res_1|, g_~x=v_g_~x_2} AuxVars[] AssignedVars[g_#res] 18640#gFINAL [29] gFINAL-->gEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 18616#gEXIT >[43] gEXIT-->L15-1: AOR: Formula: (= |v_g_#t~ret0_4| |v_g_#resOutParam_1|) InVars {g_#res=|v_g_#resOutParam_1|} OutVars{g_#t~ret0=|v_g_#t~ret0_4|} AuxVars[] AssignedVars[g_#t~ret0] LVA: Formula: (= |v_g_#in~xInParam_1| (+ v_g_~x_5 (- 1))) InVars {g_~x=v_g_~x_5} OutVars{g_#in~x=|v_g_#in~xInParam_1|} AuxVars[] AssignedVars[g_#in~x] 18606#L15-1 [38] L15-1-->gENTRY: Formula: (= |v_g_#in~xInParam_2| (+ |v_g_#t~ret0_5| (- 1))) InVars {g_#t~ret0=|v_g_#t~ret0_5|} OutVars{g_#in~x=|v_g_#in~xInParam_2|} AuxVars[] AssignedVars[g_#in~x]< 18605#gENTRY [36] gENTRY-->L12: Formula: (= v_g_~x_1 |v_g_#in~x_1|) InVars {g_#in~x=|v_g_#in~x_1|} OutVars{g_#in~x=|v_g_#in~x_1|, g_~x=v_g_~x_1} AuxVars[] AssignedVars[g_~x] 18607#L12 [27] L12-->gFINAL: Formula: (and (= |v_g_#res_1| 1) (= 0 v_g_~x_2)) InVars {g_~x=v_g_~x_2} OutVars{g_#res=|v_g_#res_1|, g_~x=v_g_~x_2} AuxVars[] AssignedVars[g_#res] 18629#gFINAL [29] gFINAL-->gEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 18635#gEXIT >[42] gEXIT-->L15-2: AOR: Formula: (= |v_g_#t~ret1_4| |v_g_#resOutParam_2|) InVars {g_#res=|v_g_#resOutParam_2|} OutVars{g_#t~ret1=|v_g_#t~ret1_4|} AuxVars[] AssignedVars[g_#t~ret1] LVA: Formula: (= |v_g_#in~xInParam_2| (+ |v_g_#t~ret0_5| (- 1))) InVars {g_#t~ret0=|v_g_#t~ret0_5|} OutVars{g_#in~x=|v_g_#in~xInParam_2|} AuxVars[] AssignedVars[g_#in~x] 18620#L15-2 [40] L15-2-->gFINAL: Formula: (= |v_g_#res_2| |v_g_#t~ret1_3|) InVars {g_#t~ret1=|v_g_#t~ret1_3|} OutVars{g_#t~ret1=|v_g_#t~ret1_2|, g_#res=|v_g_#res_2|, g_#t~ret0=|v_g_#t~ret0_3|} AuxVars[] AssignedVars[g_#t~ret1, g_#res, g_#t~ret0] 18638#gFINAL [29] gFINAL-->gEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 18637#gEXIT >[43] gEXIT-->L15-1: AOR: Formula: (= |v_g_#t~ret0_4| |v_g_#resOutParam_1|) InVars {g_#res=|v_g_#resOutParam_1|} OutVars{g_#t~ret0=|v_g_#t~ret0_4|} AuxVars[] AssignedVars[g_#t~ret0] LVA: Formula: (= |v_g_#in~xInParam_1| (+ v_g_~x_5 (- 1))) InVars {g_~x=v_g_~x_5} OutVars{g_#in~x=|v_g_#in~xInParam_1|} AuxVars[] AssignedVars[g_#in~x] 18600#L15-1 [38] L15-1-->gENTRY: Formula: (= |v_g_#in~xInParam_2| (+ |v_g_#t~ret0_5| (- 1))) InVars {g_#t~ret0=|v_g_#t~ret0_5|} OutVars{g_#in~x=|v_g_#in~xInParam_2|} AuxVars[] AssignedVars[g_#in~x]< 18617#gENTRY [36] gENTRY-->L12: Formula: (= v_g_~x_1 |v_g_#in~x_1|) InVars {g_#in~x=|v_g_#in~x_1|} OutVars{g_#in~x=|v_g_#in~x_1|, g_~x=v_g_~x_1} AuxVars[] AssignedVars[g_~x] 18599#L12 [46] L12-->L15: Formula: (< 0 v_g_~x_3) InVars {g_~x=v_g_~x_3} OutVars{g_~x=v_g_~x_3} AuxVars[] AssignedVars[] 18595#L15 [37] L15-->gENTRY: Formula: (= |v_g_#in~xInParam_1| (+ v_g_~x_5 (- 1))) InVars {g_~x=v_g_~x_5} OutVars{g_#in~x=|v_g_#in~xInParam_1|} AuxVars[] AssignedVars[g_#in~x]< 18615#gENTRY [36] gENTRY-->L12: Formula: (= v_g_~x_1 |v_g_#in~x_1|) InVars {g_#in~x=|v_g_#in~x_1|} OutVars{g_#in~x=|v_g_#in~x_1|, g_~x=v_g_~x_1} AuxVars[] AssignedVars[g_~x] 18636#L12 [46] L12-->L15: Formula: (< 0 v_g_~x_3) InVars {g_~x=v_g_~x_3} OutVars{g_~x=v_g_~x_3} AuxVars[] AssignedVars[] 18596#L15 43.62/24.61 [2019-03-28 12:07:13,804 INFO L796 eck$LassoCheckResult]: Loop: 18596#L15 [37] L15-->gENTRY: Formula: (= |v_g_#in~xInParam_1| (+ v_g_~x_5 (- 1))) InVars {g_~x=v_g_~x_5} OutVars{g_#in~x=|v_g_#in~xInParam_1|} AuxVars[] AssignedVars[g_#in~x]< 18615#gENTRY [36] gENTRY-->L12: Formula: (= v_g_~x_1 |v_g_#in~x_1|) InVars {g_#in~x=|v_g_#in~x_1|} OutVars{g_#in~x=|v_g_#in~x_1|, g_~x=v_g_~x_1} AuxVars[] AssignedVars[g_~x] 18636#L12 [46] L12-->L15: Formula: (< 0 v_g_~x_3) InVars {g_~x=v_g_~x_3} OutVars{g_~x=v_g_~x_3} AuxVars[] AssignedVars[] 18596#L15 43.62/24.61 [2019-03-28 12:07:13,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 43.62/24.61 [2019-03-28 12:07:13,804 INFO L82 PathProgramCache]: Analyzing trace with hash 715297506, now seen corresponding path program 1 times 43.62/24.61 [2019-03-28 12:07:13,804 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 43.62/24.61 [2019-03-28 12:07:13,804 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 43.62/24.61 [2019-03-28 12:07:13,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 43.62/24.61 [2019-03-28 12:07:13,805 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 43.62/24.61 [2019-03-28 12:07:13,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 43.62/24.61 [2019-03-28 12:07:13,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 43.62/24.61 [2019-03-28 12:07:13,854 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. 43.62/24.61 [2019-03-28 12:07:13,854 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 43.62/24.61 [2019-03-28 12:07:13,854 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 43.62/24.61 [2019-03-28 12:07:13,854 INFO L799 eck$LassoCheckResult]: stem already infeasible 43.62/24.61 [2019-03-28 12:07:13,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 43.62/24.61 [2019-03-28 12:07:13,855 INFO L82 PathProgramCache]: Analyzing trace with hash 66510, now seen corresponding path program 2 times 43.62/24.61 [2019-03-28 12:07:13,855 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 43.62/24.61 [2019-03-28 12:07:13,855 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 43.62/24.61 [2019-03-28 12:07:13,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 43.62/24.61 [2019-03-28 12:07:13,856 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 43.62/24.61 [2019-03-28 12:07:13,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 43.62/24.61 [2019-03-28 12:07:13,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 43.62/24.61 [2019-03-28 12:07:13,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 43.62/24.61 [2019-03-28 12:07:13,892 INFO L216 LassoAnalysis]: Preferences: 43.62/24.61 [2019-03-28 12:07:13,892 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 43.62/24.61 [2019-03-28 12:07:13,892 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 43.62/24.61 [2019-03-28 12:07:13,892 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 43.62/24.61 [2019-03-28 12:07:13,892 INFO L127 ssoRankerPreferences]: Use exernal solver: true 43.62/24.61 [2019-03-28 12:07:13,892 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 43.62/24.61 [2019-03-28 12:07:13,892 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 43.62/24.61 [2019-03-28 12:07:13,893 INFO L130 ssoRankerPreferences]: Path of dumped script: 43.62/24.61 [2019-03-28 12:07:13,893 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration7_Loop 43.62/24.61 [2019-03-28 12:07:13,893 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 43.62/24.61 [2019-03-28 12:07:13,893 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 43.62/24.61 [2019-03-28 12:07:13,894 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 43.62/24.61 [2019-03-28 12:07:13,896 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 43.62/24.61 [2019-03-28 12:07:13,907 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 43.62/24.61 [2019-03-28 12:07:13,910 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 43.62/24.61 [2019-03-28 12:07:13,947 INFO L300 LassoAnalysis]: Preprocessing complete. 43.62/24.61 [2019-03-28 12:07:13,947 INFO L412 LassoAnalysis]: Checking for nontermination... 43.62/24.61 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 43.62/24.61 Starting monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 43.62/24.61 Waiting until toolchain timeout for monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 43.62/24.61 [2019-03-28 12:07:13,952 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 43.62/24.61 [2019-03-28 12:07:13,952 INFO L163 nArgumentSynthesizer]: Using integer mode. 43.62/24.61 [2019-03-28 12:07:13,955 INFO L445 LassoAnalysis]: Proved nontermination for one component. 43.62/24.61 [2019-03-28 12:07:13,956 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {g_#t~ret1=0} Honda state: {g_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 43.62/24.61 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 43.62/24.61 Starting monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 43.62/24.61 Waiting until toolchain timeout for monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 43.62/24.61 [2019-03-28 12:07:13,983 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 43.62/24.61 [2019-03-28 12:07:13,983 INFO L163 nArgumentSynthesizer]: Using integer mode. 43.62/24.61 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 43.62/24.61 Starting monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 43.62/24.61 Waiting until toolchain timeout for monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 43.62/24.61 [2019-03-28 12:07:14,017 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 43.62/24.61 [2019-03-28 12:07:14,018 INFO L163 nArgumentSynthesizer]: Using integer mode. 43.62/24.61 [2019-03-28 12:07:23,644 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. 43.62/24.61 [2019-03-28 12:07:23,646 INFO L216 LassoAnalysis]: Preferences: 43.62/24.61 [2019-03-28 12:07:23,647 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 43.62/24.61 [2019-03-28 12:07:23,647 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 43.62/24.61 [2019-03-28 12:07:23,647 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 43.62/24.61 [2019-03-28 12:07:23,647 INFO L127 ssoRankerPreferences]: Use exernal solver: false 43.62/24.61 [2019-03-28 12:07:23,647 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 43.62/24.61 [2019-03-28 12:07:23,647 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 43.62/24.61 [2019-03-28 12:07:23,647 INFO L130 ssoRankerPreferences]: Path of dumped script: 43.62/24.61 [2019-03-28 12:07:23,647 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration7_Loop 43.62/24.61 [2019-03-28 12:07:23,648 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 43.62/24.61 [2019-03-28 12:07:23,648 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 43.62/24.61 [2019-03-28 12:07:23,649 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 43.62/24.61 [2019-03-28 12:07:23,650 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 43.62/24.61 [2019-03-28 12:07:23,652 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 43.62/24.61 [2019-03-28 12:07:23,658 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 43.62/24.61 [2019-03-28 12:07:23,681 INFO L300 LassoAnalysis]: Preprocessing complete. 43.62/24.61 [2019-03-28 12:07:23,681 INFO L497 LassoAnalysis]: Using template 'affine'. 43.62/24.61 [2019-03-28 12:07:23,682 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 43.62/24.61 Termination analysis: LINEAR_WITH_GUESSES 43.62/24.61 Number of strict supporting invariants: 0 43.62/24.61 Number of non-strict supporting invariants: 1 43.62/24.61 Consider only non-deceasing supporting invariants: true 43.62/24.61 Simplify termination arguments: true 43.62/24.61 Simplify supporting invariants: trueOverapproximate stem: false 43.62/24.61 [2019-03-28 12:07:23,682 INFO L339 nArgumentSynthesizer]: Template has degree 0. 43.62/24.61 [2019-03-28 12:07:23,683 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 43.62/24.61 [2019-03-28 12:07:23,683 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 43.62/24.61 [2019-03-28 12:07:23,683 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 43.62/24.61 [2019-03-28 12:07:23,683 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 43.62/24.61 [2019-03-28 12:07:23,684 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 43.62/24.61 [2019-03-28 12:07:23,684 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 43.62/24.61 [2019-03-28 12:07:23,685 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 43.62/24.61 [2019-03-28 12:07:23,685 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 43.62/24.61 Termination analysis: LINEAR_WITH_GUESSES 43.62/24.61 Number of strict supporting invariants: 0 43.62/24.61 Number of non-strict supporting invariants: 1 43.62/24.61 Consider only non-deceasing supporting invariants: true 43.62/24.61 Simplify termination arguments: true 43.62/24.61 Simplify supporting invariants: trueOverapproximate stem: false 43.62/24.61 [2019-03-28 12:07:23,685 INFO L339 nArgumentSynthesizer]: Template has degree 0. 43.62/24.61 [2019-03-28 12:07:23,686 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 43.62/24.61 [2019-03-28 12:07:23,686 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 43.62/24.61 [2019-03-28 12:07:23,686 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 43.62/24.61 [2019-03-28 12:07:23,686 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 43.62/24.61 [2019-03-28 12:07:23,686 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 43.62/24.61 [2019-03-28 12:07:23,687 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 43.62/24.61 [2019-03-28 12:07:23,687 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 43.62/24.61 [2019-03-28 12:07:23,688 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 43.62/24.61 Termination analysis: LINEAR_WITH_GUESSES 43.62/24.61 Number of strict supporting invariants: 0 43.62/24.61 Number of non-strict supporting invariants: 1 43.62/24.61 Consider only non-deceasing supporting invariants: true 43.62/24.61 Simplify termination arguments: true 43.62/24.61 Simplify supporting invariants: trueOverapproximate stem: false 43.62/24.61 [2019-03-28 12:07:23,688 INFO L339 nArgumentSynthesizer]: Template has degree 0. 43.62/24.61 [2019-03-28 12:07:23,688 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 43.62/24.61 [2019-03-28 12:07:23,688 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 43.62/24.61 [2019-03-28 12:07:23,689 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 43.62/24.61 [2019-03-28 12:07:23,689 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 43.62/24.61 [2019-03-28 12:07:23,689 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 43.62/24.61 [2019-03-28 12:07:23,689 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 43.62/24.61 [2019-03-28 12:07:23,693 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 43.62/24.61 [2019-03-28 12:07:23,696 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 43.62/24.61 [2019-03-28 12:07:23,696 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. 43.62/24.61 [2019-03-28 12:07:23,696 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 43.62/24.61 [2019-03-28 12:07:23,696 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 43.62/24.61 [2019-03-28 12:07:23,696 INFO L518 LassoAnalysis]: Proved termination. 43.62/24.61 [2019-03-28 12:07:23,697 INFO L520 LassoAnalysis]: Termination argument consisting of: 43.62/24.61 Ranking function f(g_~x) = 1*g_~x 43.62/24.61 Supporting invariants [] 43.62/24.61 [2019-03-28 12:07:23,697 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed 43.62/24.61 [2019-03-28 12:07:23,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 43.62/24.61 [2019-03-28 12:07:23,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 43.62/24.61 [2019-03-28 12:07:23,751 INFO L256 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 14 conjunts are in the unsatisfiable core 43.62/24.61 [2019-03-28 12:07:23,753 INFO L279 TraceCheckSpWp]: Computing forward predicates... 43.62/24.61 [2019-03-28 12:07:23,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 43.62/24.61 [2019-03-28 12:07:23,790 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 7 conjunts are in the unsatisfiable core 43.62/24.61 [2019-03-28 12:07:23,791 INFO L279 TraceCheckSpWp]: Computing forward predicates... 43.62/24.61 [2019-03-28 12:07:23,811 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 43.62/24.61 [2019-03-28 12:07:23,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 43.62/24.61 [2019-03-28 12:07:23,843 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 7 conjunts are in the unsatisfiable core 43.62/24.61 [2019-03-28 12:07:23,843 INFO L279 TraceCheckSpWp]: Computing forward predicates... 43.62/24.61 [2019-03-28 12:07:23,899 INFO L98 LoopCannibalizer]: 3 predicates before loop cannibalization 5 predicates after loop cannibalization 43.62/24.61 [2019-03-28 12:07:23,900 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.3 stem predicates 5 loop predicates 43.62/24.61 [2019-03-28 12:07:23,900 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 54 states and 67 transitions. cyclomatic complexity: 15 Second operand 5 states. 43.62/24.61 [2019-03-28 12:07:24,021 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 54 states and 67 transitions. cyclomatic complexity: 15. Second operand 5 states. Result 206 states and 262 transitions. Complement of second has 76 states. 43.62/24.61 [2019-03-28 12:07:24,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 2 stem states 4 non-accepting loop states 2 accepting loop states 43.62/24.61 [2019-03-28 12:07:24,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. 43.62/24.61 [2019-03-28 12:07:24,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 20 transitions. 43.62/24.61 [2019-03-28 12:07:24,022 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 20 transitions. Stem has 26 letters. Loop has 3 letters. 43.62/24.61 [2019-03-28 12:07:24,023 INFO L116 BuchiAccepts]: Finished buchiAccepts. 43.62/24.61 [2019-03-28 12:07:24,023 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 20 transitions. Stem has 29 letters. Loop has 3 letters. 43.62/24.61 [2019-03-28 12:07:24,023 INFO L116 BuchiAccepts]: Finished buchiAccepts. 43.62/24.61 [2019-03-28 12:07:24,024 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 20 transitions. Stem has 26 letters. Loop has 6 letters. 43.62/24.61 [2019-03-28 12:07:24,024 INFO L116 BuchiAccepts]: Finished buchiAccepts. 43.62/24.61 [2019-03-28 12:07:24,025 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 206 states and 262 transitions. 43.62/24.61 [2019-03-28 12:07:24,029 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 43.62/24.61 [2019-03-28 12:07:24,032 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 206 states to 79 states and 104 transitions. 43.62/24.61 [2019-03-28 12:07:24,032 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 50 43.62/24.61 [2019-03-28 12:07:24,032 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 55 43.62/24.61 [2019-03-28 12:07:24,033 INFO L73 IsDeterministic]: Start isDeterministic. Operand 79 states and 104 transitions. 43.62/24.61 [2019-03-28 12:07:24,033 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 43.62/24.61 [2019-03-28 12:07:24,033 INFO L706 BuchiCegarLoop]: Abstraction has 79 states and 104 transitions. 43.62/24.61 [2019-03-28 12:07:24,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states and 104 transitions. 43.62/24.61 [2019-03-28 12:07:24,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 59. 43.62/24.61 [2019-03-28 12:07:24,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. 43.62/24.61 [2019-03-28 12:07:24,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 72 transitions. 43.62/24.61 [2019-03-28 12:07:24,038 INFO L729 BuchiCegarLoop]: Abstraction has 59 states and 72 transitions. 43.62/24.61 [2019-03-28 12:07:24,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. 43.62/24.61 [2019-03-28 12:07:24,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 43.62/24.61 [2019-03-28 12:07:24,038 INFO L87 Difference]: Start difference. First operand 59 states and 72 transitions. Second operand 7 states. 43.62/24.61 [2019-03-28 12:07:24,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 43.62/24.61 [2019-03-28 12:07:24,095 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. 43.62/24.61 [2019-03-28 12:07:24,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 43.62/24.61 [2019-03-28 12:07:24,096 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 29 transitions. 43.62/24.61 [2019-03-28 12:07:24,097 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 43.62/24.61 [2019-03-28 12:07:24,097 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 0 states and 0 transitions. 43.62/24.61 [2019-03-28 12:07:24,097 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 43.62/24.61 [2019-03-28 12:07:24,098 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 43.62/24.61 [2019-03-28 12:07:24,098 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. 43.62/24.61 [2019-03-28 12:07:24,098 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 43.62/24.61 [2019-03-28 12:07:24,098 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 43.62/24.61 [2019-03-28 12:07:24,098 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 43.62/24.61 [2019-03-28 12:07:24,098 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 43.62/24.61 [2019-03-28 12:07:24,098 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ 43.62/24.61 [2019-03-28 12:07:24,098 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. 43.62/24.61 [2019-03-28 12:07:24,098 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 43.62/24.61 [2019-03-28 12:07:24,099 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true 43.62/24.61 [2019-03-28 12:07:24,105 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:07:24 BasicIcfg 43.62/24.61 [2019-03-28 12:07:24,105 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- 43.62/24.61 [2019-03-28 12:07:24,106 INFO L168 Benchmark]: Toolchain (without parser) took 18045.49 ms. Allocated memory was 649.6 MB in the beginning and 868.2 MB in the end (delta: 218.6 MB). Free memory was 559.8 MB in the beginning and 455.1 MB in the end (delta: 104.7 MB). Peak memory consumption was 323.3 MB. Max. memory is 50.3 GB. 43.62/24.61 [2019-03-28 12:07:24,107 INFO L168 Benchmark]: CDTParser took 0.18 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. 43.62/24.61 [2019-03-28 12:07:24,108 INFO L168 Benchmark]: CACSL2BoogieTranslator took 215.61 ms. Allocated memory is still 649.6 MB. Free memory was 558.4 MB in the beginning and 548.9 MB in the end (delta: 9.5 MB). Peak memory consumption was 9.5 MB. Max. memory is 50.3 GB. 43.62/24.61 [2019-03-28 12:07:24,108 INFO L168 Benchmark]: Boogie Procedure Inliner took 89.30 ms. Allocated memory was 649.6 MB in the beginning and 661.7 MB in the end (delta: 12.1 MB). Free memory was 548.9 MB in the beginning and 627.5 MB in the end (delta: -78.6 MB). Peak memory consumption was 20.3 MB. Max. memory is 50.3 GB. 43.62/24.61 [2019-03-28 12:07:24,109 INFO L168 Benchmark]: Boogie Preprocessor took 17.36 ms. Allocated memory is still 661.7 MB. Free memory was 627.5 MB in the beginning and 626.2 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. 43.62/24.61 [2019-03-28 12:07:24,109 INFO L168 Benchmark]: RCFGBuilder took 192.61 ms. Allocated memory is still 661.7 MB. Free memory was 626.2 MB in the beginning and 613.2 MB in the end (delta: 13.0 MB). Peak memory consumption was 13.0 MB. Max. memory is 50.3 GB. 43.62/24.61 [2019-03-28 12:07:24,110 INFO L168 Benchmark]: BlockEncodingV2 took 76.49 ms. Allocated memory is still 661.7 MB. Free memory was 613.2 MB in the beginning and 607.8 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 50.3 GB. 43.62/24.61 [2019-03-28 12:07:24,110 INFO L168 Benchmark]: TraceAbstraction took 163.62 ms. Allocated memory is still 661.7 MB. Free memory was 606.5 MB in the beginning and 597.0 MB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 50.3 GB. 43.62/24.61 [2019-03-28 12:07:24,111 INFO L168 Benchmark]: BuchiAutomizer took 17284.81 ms. Allocated memory was 661.7 MB in the beginning and 868.2 MB in the end (delta: 206.6 MB). Free memory was 597.0 MB in the beginning and 455.1 MB in the end (delta: 141.9 MB). Peak memory consumption was 348.4 MB. Max. memory is 50.3 GB. 43.62/24.61 [2019-03-28 12:07:24,114 INFO L337 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### 43.62/24.61 --- Results --- 43.62/24.61 * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: 43.62/24.61 - StatisticsResult: Initial Icfg 43.62/24.61 14 locations, 17 edges 43.62/24.61 - StatisticsResult: Encoded RCFG 43.62/24.61 9 locations, 12 edges 43.62/24.61 * Results from de.uni_freiburg.informatik.ultimate.core: 43.62/24.61 - StatisticsResult: Toolchain Benchmarks 43.62/24.61 Benchmark results are: 43.62/24.61 * CDTParser took 0.18 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. 43.62/24.61 * CACSL2BoogieTranslator took 215.61 ms. Allocated memory is still 649.6 MB. Free memory was 558.4 MB in the beginning and 548.9 MB in the end (delta: 9.5 MB). Peak memory consumption was 9.5 MB. Max. memory is 50.3 GB. 43.62/24.61 * Boogie Procedure Inliner took 89.30 ms. Allocated memory was 649.6 MB in the beginning and 661.7 MB in the end (delta: 12.1 MB). Free memory was 548.9 MB in the beginning and 627.5 MB in the end (delta: -78.6 MB). Peak memory consumption was 20.3 MB. Max. memory is 50.3 GB. 43.62/24.61 * Boogie Preprocessor took 17.36 ms. Allocated memory is still 661.7 MB. Free memory was 627.5 MB in the beginning and 626.2 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. 43.62/24.61 * RCFGBuilder took 192.61 ms. Allocated memory is still 661.7 MB. Free memory was 626.2 MB in the beginning and 613.2 MB in the end (delta: 13.0 MB). Peak memory consumption was 13.0 MB. Max. memory is 50.3 GB. 43.62/24.61 * BlockEncodingV2 took 76.49 ms. Allocated memory is still 661.7 MB. Free memory was 613.2 MB in the beginning and 607.8 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 50.3 GB. 43.62/24.61 * TraceAbstraction took 163.62 ms. Allocated memory is still 661.7 MB. Free memory was 606.5 MB in the beginning and 597.0 MB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 50.3 GB. 43.62/24.61 * BuchiAutomizer took 17284.81 ms. Allocated memory was 661.7 MB in the beginning and 868.2 MB in the end (delta: 206.6 MB). Free memory was 597.0 MB in the beginning and 455.1 MB in the end (delta: 141.9 MB). Peak memory consumption was 348.4 MB. Max. memory is 50.3 GB. 43.62/24.61 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: 43.62/24.61 - AllSpecificationsHoldResult: All specifications hold 43.62/24.61 We were not able to verify any specifiation because the program does not contain any specification. 43.62/24.61 - StatisticsResult: Ultimate Automizer benchmark data 43.62/24.61 CFG has 2 procedures, 9 locations, 0 error locations. SAFE Result, 0.0s OverallTime, 0 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=9occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 10 PreInvPairs, 10 NumberOfFragments, 4 HoareAnnotationTreeSize, 10 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 4 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: No data available, ReuseStatistics: No data available 43.62/24.61 - StatisticsResult: Constructed decomposition of program 43.62/24.61 Your program was decomposed into 9 terminating modules (6 trivial, 0 deterministic, 3 nondeterministic). One nondeterministic module has affine ranking function \old(x) and consists of 6 locations. One nondeterministic module has affine ranking function \old(x) and consists of 23 locations. One nondeterministic module has affine ranking function x and consists of 8 locations. 6 modules have a trivial ranking function, the largest among these consists of 8 locations. 43.62/24.61 - StatisticsResult: Timing statistics 43.62/24.61 BüchiAutomizer plugin needed 17.2s and 8 iterations. TraceHistogramMax:6. Analysis of lassos took 12.8s. Construction of modules took 0.5s. Büchi inclusion checks took 3.2s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 8. Automata minimization 0.0s AutomataMinimizationTime, 8 MinimizatonAttempts, 104 StatesRemovedByMinimization, 7 NontrivialMinimizations. Non-live state removal took 0.5s Buchi closure took 0.0s. Biggest automaton had 57 states and ocurred in iteration 5. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/2 HoareTripleCheckerStatistics: 131 SDtfs, 156 SDslu, 278 SDs, 0 SdLazy, 537 SolverSat, 178 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT1 conc1 concLT1 SILN3 SILU0 SILI0 SILT1 lasso0 LassoPreprocessingBenchmarks: Lassos: inital11 mio100 ax100 hnf100 lsp100 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq176 hnf91 smp100 dnf100 smp100 tf111 neg100 sie107 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 10ms VariablesStem: 0 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 19 LassoNonterminationAnalysisSatUnbounded: 4 LassoNonterminationAnalysisUnsat: 3 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 10.7s 43.62/24.61 - TerminationAnalysisResult: Termination proven 43.62/24.61 Buchi Automizer proved that your program is terminating 43.62/24.61 RESULT: Ultimate proved your program to be correct! 43.62/24.61 !SESSION 2019-03-28 12:07:01.511 ----------------------------------------------- 43.62/24.61 eclipse.buildId=unknown 43.62/24.61 java.version=1.8.0_181 43.62/24.61 java.vendor=Oracle Corporation 43.62/24.61 BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US 43.62/24.61 Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox2/benchmark/theBenchmark.c 43.62/24.61 Command-line arguments: -os linux -ws gtk -arch x86_64 -consoleLog -data @user.home/.ultimate -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -data /export/starexec/sandbox2/tmp -i /export/starexec/sandbox2/benchmark/theBenchmark.c 43.62/24.61 43.62/24.61 !ENTRY org.eclipse.core.resources 2 10035 2019-03-28 12:07:24.349 43.62/24.61 !MESSAGE The workspace will exit with unsaved changes in this session. 43.62/24.61 Received shutdown request... 43.62/24.61 Ultimate: 43.62/24.61 GTK+ Version Check 43.62/24.61 EOF