28.43/19.82 YES 28.43/19.82 28.43/19.82 Ultimate: Cannot open display: 28.43/19.82 This is Ultimate 0.1.24-8dc7c08-m 28.43/19.82 [2019-03-28 12:09:57,722 INFO L170 SettingsManager]: Resetting all preferences to default values... 28.43/19.82 [2019-03-28 12:09:57,724 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values 28.43/19.82 [2019-03-28 12:09:57,735 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... 28.43/19.82 [2019-03-28 12:09:57,736 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values 28.43/19.82 [2019-03-28 12:09:57,737 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values 28.43/19.82 [2019-03-28 12:09:57,738 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values 28.43/19.82 [2019-03-28 12:09:57,739 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values 28.43/19.82 [2019-03-28 12:09:57,741 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values 28.43/19.82 [2019-03-28 12:09:57,742 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values 28.43/19.82 [2019-03-28 12:09:57,742 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... 28.43/19.82 [2019-03-28 12:09:57,743 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values 28.43/19.82 [2019-03-28 12:09:57,743 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values 28.43/19.82 [2019-03-28 12:09:57,744 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values 28.43/19.82 [2019-03-28 12:09:57,745 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values 28.43/19.82 [2019-03-28 12:09:57,746 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values 28.43/19.82 [2019-03-28 12:09:57,747 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values 28.43/19.82 [2019-03-28 12:09:57,749 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values 28.43/19.82 [2019-03-28 12:09:57,750 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values 28.43/19.82 [2019-03-28 12:09:57,752 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values 28.43/19.82 [2019-03-28 12:09:57,753 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values 28.43/19.82 [2019-03-28 12:09:57,754 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values 28.43/19.82 [2019-03-28 12:09:57,756 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... 28.43/19.82 [2019-03-28 12:09:57,756 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... 28.43/19.82 [2019-03-28 12:09:57,756 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values 28.43/19.82 [2019-03-28 12:09:57,757 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values 28.43/19.82 [2019-03-28 12:09:57,758 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values 28.43/19.82 [2019-03-28 12:09:57,758 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... 28.43/19.82 [2019-03-28 12:09:57,759 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values 28.43/19.82 [2019-03-28 12:09:57,759 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values 28.43/19.82 [2019-03-28 12:09:57,760 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values 28.43/19.82 [2019-03-28 12:09:57,761 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values 28.43/19.82 [2019-03-28 12:09:57,762 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... 28.43/19.82 [2019-03-28 12:09:57,762 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values 28.43/19.82 [2019-03-28 12:09:57,762 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... 28.43/19.82 [2019-03-28 12:09:57,763 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... 28.43/19.82 [2019-03-28 12:09:57,763 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values 28.43/19.82 [2019-03-28 12:09:57,764 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values 28.43/19.82 [2019-03-28 12:09:57,764 INFO L181 SettingsManager]: Finished resetting all preferences to default values... 28.43/19.82 [2019-03-28 12:09:57,765 INFO L98 SettingsManager]: Beginning loading settings from /export/starexec/sandbox/solver/bin/./../termcomp2017.epf 28.43/19.82 [2019-03-28 12:09:57,779 INFO L110 SettingsManager]: Loading preferences was successful 28.43/19.82 [2019-03-28 12:09:57,779 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: 28.43/19.82 [2019-03-28 12:09:57,781 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: 28.43/19.82 [2019-03-28 12:09:57,781 INFO L133 SettingsManager]: * Rewrite not-equals=true 28.43/19.82 [2019-03-28 12:09:57,781 INFO L133 SettingsManager]: * Create parallel compositions if possible=false 28.43/19.82 [2019-03-28 12:09:57,781 INFO L133 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE 28.43/19.82 [2019-03-28 12:09:57,781 INFO L133 SettingsManager]: * Use SBE=true 28.43/19.82 [2019-03-28 12:09:57,782 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: 28.43/19.82 [2019-03-28 12:09:57,782 INFO L133 SettingsManager]: * Use old map elimination=false 28.43/19.82 [2019-03-28 12:09:57,782 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false 28.43/19.82 [2019-03-28 12:09:57,782 INFO L133 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION 28.43/19.82 [2019-03-28 12:09:57,782 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true 28.43/19.82 [2019-03-28 12:09:57,782 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES 28.43/19.82 [2019-03-28 12:09:57,783 INFO L133 SettingsManager]: * Construct termination proof for TermComp=true 28.43/19.82 [2019-03-28 12:09:57,783 INFO L133 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 28.43/19.82 [2019-03-28 12:09:57,783 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: 28.43/19.82 [2019-03-28 12:09:57,783 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false 28.43/19.82 [2019-03-28 12:09:57,784 INFO L133 SettingsManager]: * Check division by zero=IGNORE 28.43/19.82 [2019-03-28 12:09:57,784 INFO L133 SettingsManager]: * Check if freed pointer was valid=false 28.43/19.82 [2019-03-28 12:09:57,784 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false 28.43/19.82 [2019-03-28 12:09:57,784 INFO L133 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE 28.43/19.82 [2019-03-28 12:09:57,784 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: 28.43/19.82 [2019-03-28 12:09:57,784 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements 28.43/19.82 [2019-03-28 12:09:57,785 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump 28.43/19.82 [2019-03-28 12:09:57,785 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 28.43/19.82 [2019-03-28 12:09:57,785 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: 28.43/19.82 [2019-03-28 12:09:57,785 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles 28.43/19.82 [2019-03-28 12:09:57,785 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL 28.43/19.82 [2019-03-28 12:09:57,785 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 28.43/19.82 [2019-03-28 12:09:57,811 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp 28.43/19.82 [2019-03-28 12:09:57,824 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized 28.43/19.82 [2019-03-28 12:09:57,827 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. 28.43/19.82 [2019-03-28 12:09:57,829 INFO L271 PluginConnector]: Initializing CDTParser... 28.43/19.82 [2019-03-28 12:09:57,829 INFO L276 PluginConnector]: CDTParser initialized 28.43/19.82 [2019-03-28 12:09:57,830 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox/benchmark/theBenchmark.c 28.43/19.82 [2019-03-28 12:09:57,887 INFO L221 CDTParser]: Created temporary CDT project at /export/starexec/sandbox/tmp/598a56fa170441548e7de0228ebd4c2c/FLAG7bc188383 28.43/19.82 [2019-03-28 12:09:58,220 INFO L307 CDTParser]: Found 1 translation units. 28.43/19.82 [2019-03-28 12:09:58,221 INFO L161 CDTParser]: Scanning /export/starexec/sandbox/benchmark/theBenchmark.c 28.43/19.82 [2019-03-28 12:09:58,227 INFO L355 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox/tmp/598a56fa170441548e7de0228ebd4c2c/FLAG7bc188383 28.43/19.82 [2019-03-28 12:09:58,625 INFO L363 CDTParser]: Successfully deleted /export/starexec/sandbox/tmp/598a56fa170441548e7de0228ebd4c2c 28.43/19.82 [2019-03-28 12:09:58,637 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### 28.43/19.82 [2019-03-28 12:09:58,639 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. 28.43/19.82 [2019-03-28 12:09:58,640 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- 28.43/19.82 [2019-03-28 12:09:58,640 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... 28.43/19.82 [2019-03-28 12:09:58,644 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized 28.43/19.82 [2019-03-28 12:09:58,645 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 12:09:58" (1/1) ... 28.43/19.82 [2019-03-28 12:09:58,648 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ba22711 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:09:58, skipping insertion in model container 28.43/19.82 [2019-03-28 12:09:58,648 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 12:09:58" (1/1) ... 28.43/19.82 [2019-03-28 12:09:58,656 INFO L145 MainTranslator]: Starting translation in SV-COMP mode 28.43/19.82 [2019-03-28 12:09:58,673 INFO L176 MainTranslator]: Built tables and reachable declarations 28.43/19.82 [2019-03-28 12:09:58,832 INFO L206 PostProcessor]: Analyzing one entry point: main 28.43/19.82 [2019-03-28 12:09:58,837 INFO L191 MainTranslator]: Completed pre-run 28.43/19.82 [2019-03-28 12:09:58,854 INFO L206 PostProcessor]: Analyzing one entry point: main 28.43/19.82 [2019-03-28 12:09:58,869 INFO L195 MainTranslator]: Completed translation 28.43/19.82 [2019-03-28 12:09:58,870 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:09:58 WrapperNode 28.43/19.82 [2019-03-28 12:09:58,870 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- 28.43/19.82 [2019-03-28 12:09:58,871 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- 28.43/19.82 [2019-03-28 12:09:58,871 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... 28.43/19.82 [2019-03-28 12:09:58,871 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized 28.43/19.82 [2019-03-28 12:09:58,941 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:09:58" (1/1) ... 28.43/19.82 [2019-03-28 12:09:58,947 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:09:58" (1/1) ... 28.43/19.82 [2019-03-28 12:09:58,969 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- 28.43/19.82 [2019-03-28 12:09:58,969 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- 28.43/19.82 [2019-03-28 12:09:58,969 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... 28.43/19.82 [2019-03-28 12:09:58,969 INFO L276 PluginConnector]: Boogie Preprocessor initialized 28.43/19.82 [2019-03-28 12:09:58,979 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:09:58" (1/1) ... 28.43/19.82 [2019-03-28 12:09:58,980 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:09:58" (1/1) ... 28.43/19.82 [2019-03-28 12:09:58,980 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:09:58" (1/1) ... 28.43/19.82 [2019-03-28 12:09:58,981 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:09:58" (1/1) ... 28.43/19.82 [2019-03-28 12:09:58,983 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:09:58" (1/1) ... 28.43/19.82 [2019-03-28 12:09:58,986 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:09:58" (1/1) ... 28.43/19.82 [2019-03-28 12:09:58,987 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:09:58" (1/1) ... 28.43/19.82 [2019-03-28 12:09:58,988 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- 28.43/19.82 [2019-03-28 12:09:58,989 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- 28.43/19.82 [2019-03-28 12:09:58,989 INFO L271 PluginConnector]: Initializing RCFGBuilder... 28.43/19.82 [2019-03-28 12:09:58,989 INFO L276 PluginConnector]: RCFGBuilder initialized 28.43/19.82 [2019-03-28 12:09:58,990 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:09:58" (1/1) ... 28.43/19.82 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 28.43/19.82 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) 28.43/19.82 Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 28.43/19.82 [2019-03-28 12:09:59,067 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start 28.43/19.82 [2019-03-28 12:09:59,068 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start 28.43/19.82 [2019-03-28 12:09:59,068 INFO L130 BoogieDeclarations]: Found specification of procedure addition 28.43/19.82 [2019-03-28 12:09:59,068 INFO L138 BoogieDeclarations]: Found implementation of procedure addition 28.43/19.82 [2019-03-28 12:09:59,226 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) 28.43/19.82 [2019-03-28 12:09:59,226 INFO L286 CfgBuilder]: Removed 4 assue(true) statements. 28.43/19.82 [2019-03-28 12:09:59,228 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:09:59 BoogieIcfgContainer 28.43/19.82 [2019-03-28 12:09:59,228 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- 28.43/19.83 [2019-03-28 12:09:59,229 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- 28.43/19.83 [2019-03-28 12:09:59,229 INFO L271 PluginConnector]: Initializing BlockEncodingV2... 28.43/19.83 [2019-03-28 12:09:59,231 INFO L276 PluginConnector]: BlockEncodingV2 initialized 28.43/19.83 [2019-03-28 12:09:59,233 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:09:59" (1/1) ... 28.43/19.83 [2019-03-28 12:09:59,251 INFO L313 BlockEncoder]: Initial Icfg 18 locations, 24 edges 28.43/19.83 [2019-03-28 12:09:59,253 INFO L258 BlockEncoder]: Using Remove infeasible edges 28.43/19.83 [2019-03-28 12:09:59,254 INFO L263 BlockEncoder]: Using Maximize final states 28.43/19.83 [2019-03-28 12:09:59,255 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false 28.43/19.83 [2019-03-28 12:09:59,255 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE 28.43/19.83 [2019-03-28 12:09:59,257 INFO L296 BlockEncoder]: Using Remove sink states 28.43/19.83 [2019-03-28 12:09:59,258 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true 28.43/19.83 [2019-03-28 12:09:59,258 INFO L179 BlockEncoder]: Using Rewrite not-equals 28.43/19.83 [2019-03-28 12:09:59,277 INFO L185 BlockEncoder]: Using Use SBE 28.43/19.83 [2019-03-28 12:09:59,293 INFO L200 BlockEncoder]: SBE split 1 edges 28.43/19.83 [2019-03-28 12:09:59,299 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility 28.43/19.83 [2019-03-28 12:09:59,301 INFO L71 MaximizeFinalStates]: 0 new accepting states 28.43/19.83 [2019-03-28 12:09:59,309 INFO L100 BaseMinimizeStates]: Removed 2 edges and 1 locations by large block encoding 28.43/19.83 [2019-03-28 12:09:59,311 INFO L70 RemoveSinkStates]: Removed 5 edges and 3 locations by removing sink states 28.43/19.83 [2019-03-28 12:09:59,313 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility 28.43/19.83 [2019-03-28 12:09:59,313 INFO L71 MaximizeFinalStates]: 0 new accepting states 28.43/19.83 [2019-03-28 12:09:59,320 INFO L100 BaseMinimizeStates]: Removed 4 edges and 2 locations by large block encoding 28.43/19.83 [2019-03-28 12:09:59,320 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states 28.43/19.83 [2019-03-28 12:09:59,320 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility 28.43/19.83 [2019-03-28 12:09:59,321 INFO L71 MaximizeFinalStates]: 0 new accepting states 28.43/19.83 [2019-03-28 12:09:59,321 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding 28.43/19.83 [2019-03-28 12:09:59,321 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states 28.43/19.83 [2019-03-28 12:09:59,322 INFO L313 BlockEncoder]: Encoded RCFG 12 locations, 17 edges 28.43/19.83 [2019-03-28 12:09:59,322 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:09:59 BasicIcfg 28.43/19.83 [2019-03-28 12:09:59,323 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- 28.43/19.83 [2019-03-28 12:09:59,323 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- 28.43/19.83 [2019-03-28 12:09:59,324 INFO L271 PluginConnector]: Initializing TraceAbstraction... 28.43/19.83 [2019-03-28 12:09:59,327 INFO L276 PluginConnector]: TraceAbstraction initialized 28.43/19.83 [2019-03-28 12:09:59,327 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.03 12:09:58" (1/4) ... 28.43/19.83 [2019-03-28 12:09:59,328 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@af45a07 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 12:09:59, skipping insertion in model container 28.43/19.83 [2019-03-28 12:09:59,328 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:09:58" (2/4) ... 28.43/19.83 [2019-03-28 12:09:59,329 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@af45a07 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 12:09:59, skipping insertion in model container 28.43/19.83 [2019-03-28 12:09:59,329 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:09:59" (3/4) ... 28.43/19.83 [2019-03-28 12:09:59,329 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@af45a07 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:09:59, skipping insertion in model container 28.43/19.83 [2019-03-28 12:09:59,329 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:09:59" (4/4) ... 28.43/19.83 [2019-03-28 12:09:59,331 INFO L112 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 28.43/19.83 [2019-03-28 12:09:59,342 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION 28.43/19.83 [2019-03-28 12:09:59,350 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 0 error locations. 28.43/19.83 [2019-03-28 12:09:59,370 INFO L257 AbstractCegarLoop]: Starting to check reachability of 0 error locations. 28.43/19.83 [2019-03-28 12:09:59,399 INFO L133 ementStrategyFactory]: Using default assertion order modulation 28.43/19.83 [2019-03-28 12:09:59,400 INFO L382 AbstractCegarLoop]: Interprodecural is true 28.43/19.83 [2019-03-28 12:09:59,400 INFO L383 AbstractCegarLoop]: Hoare is true 28.43/19.83 [2019-03-28 12:09:59,400 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates 28.43/19.83 [2019-03-28 12:09:59,400 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE 28.43/19.83 [2019-03-28 12:09:59,400 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION 28.43/19.83 [2019-03-28 12:09:59,400 INFO L387 AbstractCegarLoop]: Difference is false 28.43/19.83 [2019-03-28 12:09:59,401 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA 28.43/19.83 [2019-03-28 12:09:59,401 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== 28.43/19.83 [2019-03-28 12:09:59,419 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states. 28.43/19.83 [2019-03-28 12:09:59,425 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. 28.43/19.83 [2019-03-28 12:09:59,431 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 12 states. 28.43/19.83 [2019-03-28 12:09:59,489 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. 28.43/19.83 [2019-03-28 12:09:59,489 INFO L451 ceAbstractionStarter]: At program point L35(line 35) the Hoare annotation is: true 28.43/19.83 [2019-03-28 12:09:59,490 INFO L448 ceAbstractionStarter]: For program point L17(lines 17 19) no Hoare annotation was computed. 28.43/19.83 [2019-03-28 12:09:59,490 INFO L448 ceAbstractionStarter]: For program point L18-1(line 18) no Hoare annotation was computed. 28.43/19.83 [2019-03-28 12:09:59,490 INFO L451 ceAbstractionStarter]: At program point additionENTRY(lines 13 23) the Hoare annotation is: true 28.43/19.83 [2019-03-28 12:09:59,490 INFO L448 ceAbstractionStarter]: For program point L14(lines 14 16) no Hoare annotation was computed. 28.43/19.83 [2019-03-28 12:09:59,490 INFO L448 ceAbstractionStarter]: For program point additionEXIT(lines 13 23) no Hoare annotation was computed. 28.43/19.83 [2019-03-28 12:09:59,490 INFO L448 ceAbstractionStarter]: For program point additionFINAL(lines 13 23) no Hoare annotation was computed. 28.43/19.83 [2019-03-28 12:09:59,491 INFO L451 ceAbstractionStarter]: At program point L21(line 21) the Hoare annotation is: true 28.43/19.83 [2019-03-28 12:09:59,491 INFO L448 ceAbstractionStarter]: For program point L20(lines 20 22) no Hoare annotation was computed. 28.43/19.83 [2019-03-28 12:09:59,491 INFO L448 ceAbstractionStarter]: For program point L21-1(line 21) no Hoare annotation was computed. 28.43/19.83 [2019-03-28 12:09:59,491 INFO L451 ceAbstractionStarter]: At program point L18(line 18) the Hoare annotation is: true 28.43/19.83 [2019-03-28 12:09:59,495 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:09:59 BasicIcfg 28.43/19.83 [2019-03-28 12:09:59,495 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- 28.43/19.83 [2019-03-28 12:09:59,495 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- 28.43/19.83 [2019-03-28 12:09:59,496 INFO L271 PluginConnector]: Initializing BuchiAutomizer... 28.43/19.83 [2019-03-28 12:09:59,499 INFO L276 PluginConnector]: BuchiAutomizer initialized 28.43/19.83 [2019-03-28 12:09:59,500 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 28.43/19.83 [2019-03-28 12:09:59,500 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.03 12:09:58" (1/5) ... 28.43/19.83 [2019-03-28 12:09:59,501 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2509ec9e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.03 12:09:59, skipping insertion in model container 28.43/19.83 [2019-03-28 12:09:59,501 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 28.43/19.83 [2019-03-28 12:09:59,501 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:09:58" (2/5) ... 28.43/19.83 [2019-03-28 12:09:59,502 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2509ec9e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.03 12:09:59, skipping insertion in model container 28.43/19.83 [2019-03-28 12:09:59,502 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 28.43/19.83 [2019-03-28 12:09:59,502 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:09:59" (3/5) ... 28.43/19.83 [2019-03-28 12:09:59,502 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2509ec9e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:09:59, skipping insertion in model container 28.43/19.83 [2019-03-28 12:09:59,503 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 28.43/19.83 [2019-03-28 12:09:59,503 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:09:59" (4/5) ... 28.43/19.83 [2019-03-28 12:09:59,503 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2509ec9e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:09:59, skipping insertion in model container 28.43/19.83 [2019-03-28 12:09:59,503 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 28.43/19.83 [2019-03-28 12:09:59,503 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:09:59" (5/5) ... 28.43/19.83 [2019-03-28 12:09:59,505 INFO L375 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 28.43/19.83 [2019-03-28 12:09:59,533 INFO L133 ementStrategyFactory]: Using default assertion order modulation 28.43/19.83 [2019-03-28 12:09:59,533 INFO L374 BuchiCegarLoop]: Interprodecural is true 28.43/19.83 [2019-03-28 12:09:59,534 INFO L375 BuchiCegarLoop]: Hoare is true 28.43/19.83 [2019-03-28 12:09:59,534 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates 28.43/19.83 [2019-03-28 12:09:59,534 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE 28.43/19.83 [2019-03-28 12:09:59,534 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION 28.43/19.83 [2019-03-28 12:09:59,534 INFO L379 BuchiCegarLoop]: Difference is false 28.43/19.83 [2019-03-28 12:09:59,534 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA 28.43/19.83 [2019-03-28 12:09:59,535 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== 28.43/19.83 [2019-03-28 12:09:59,538 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states. 28.43/19.83 [2019-03-28 12:09:59,560 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 28.43/19.83 [2019-03-28 12:09:59,560 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 28.43/19.83 [2019-03-28 12:09:59,561 INFO L119 BuchiIsEmpty]: Starting construction of run 28.43/19.83 [2019-03-28 12:09:59,568 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] 28.43/19.83 [2019-03-28 12:09:59,568 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] 28.43/19.83 [2019-03-28 12:09:59,568 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ 28.43/19.83 [2019-03-28 12:09:59,569 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states. 28.43/19.83 [2019-03-28 12:09:59,570 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 28.43/19.83 [2019-03-28 12:09:59,570 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 28.43/19.83 [2019-03-28 12:09:59,570 INFO L119 BuchiIsEmpty]: Starting construction of run 28.43/19.83 [2019-03-28 12:09:59,571 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] 28.43/19.83 [2019-03-28 12:09:59,571 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] 28.43/19.83 [2019-03-28 12:09:59,576 INFO L794 eck$LassoCheckResult]: Stem: 7#ULTIMATE.startENTRYtrue [74] ULTIMATE.startENTRY-->L35: Formula: (and (< 0 v_ULTIMATE.start_main_~n~0_9) (< 0 v_ULTIMATE.start_main_~m~0_9)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_8|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_7|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_6|, ULTIMATE.start_main_~m~0=v_ULTIMATE.start_main_~m~0_9, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_9, ULTIMATE.start_main_#t~ret4=|v_ULTIMATE.start_main_#t~ret4_7|, ULTIMATE.start_main_~result~0=v_ULTIMATE.start_main_~result~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~m~0, ULTIMATE.start_main_~n~0, ULTIMATE.start_main_#t~ret4, ULTIMATE.start_main_~result~0] 11#L35true [60] L35-->additionENTRY: Formula: (and (= |v_addition_#in~mInParam_1| v_ULTIMATE.start_main_~m~0_7) (= |v_addition_#in~nInParam_1| v_ULTIMATE.start_main_~n~0_6)) InVars {ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_6, ULTIMATE.start_main_~m~0=v_ULTIMATE.start_main_~m~0_7} OutVars{addition_#in~m=|v_addition_#in~mInParam_1|, addition_#in~n=|v_addition_#in~nInParam_1|} AuxVars[] AssignedVars[addition_#in~m, addition_#in~n]< 3#additionENTRYtrue 28.43/19.83 [2019-03-28 12:09:59,577 INFO L796 eck$LassoCheckResult]: Loop: 3#additionENTRYtrue [52] additionENTRY-->L14: Formula: (and (= v_addition_~m_1 |v_addition_#in~m_1|) (= v_addition_~n_1 |v_addition_#in~n_1|)) InVars {addition_#in~m=|v_addition_#in~m_1|, addition_#in~n=|v_addition_#in~n_1|} OutVars{addition_~n=v_addition_~n_1, addition_#in~m=|v_addition_#in~m_1|, addition_#in~n=|v_addition_#in~n_1|, addition_~m=v_addition_~m_1} AuxVars[] AssignedVars[addition_~n, addition_~m] 8#L14true [70] L14-->L17: Formula: (> 0 v_addition_~n_4) InVars {addition_~n=v_addition_~n_4} OutVars{addition_~n=v_addition_~n_4} AuxVars[] AssignedVars[] 13#L17true [49] L17-->L18: Formula: (< 0 v_addition_~n_5) InVars {addition_~n=v_addition_~n_5} OutVars{addition_~n=v_addition_~n_5} AuxVars[] AssignedVars[] 10#L18true [48] L18-->additionENTRY: Formula: (and (= |v_addition_#in~mInParam_2| (+ v_addition_~m_5 1)) (= |v_addition_#in~nInParam_2| (+ v_addition_~n_10 (- 1)))) InVars {addition_~n=v_addition_~n_10, addition_~m=v_addition_~m_5} OutVars{addition_#in~m=|v_addition_#in~mInParam_2|, addition_#in~n=|v_addition_#in~nInParam_2|} AuxVars[] AssignedVars[addition_#in~m, addition_#in~n]< 3#additionENTRYtrue 28.43/19.83 [2019-03-28 12:09:59,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 28.43/19.83 [2019-03-28 12:09:59,583 INFO L82 PathProgramCache]: Analyzing trace with hash 3315, now seen corresponding path program 1 times 28.43/19.83 [2019-03-28 12:09:59,585 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 28.43/19.83 [2019-03-28 12:09:59,586 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 28.43/19.83 [2019-03-28 12:09:59,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 28.43/19.83 [2019-03-28 12:09:59,606 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 28.43/19.83 [2019-03-28 12:09:59,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 28.43/19.83 [2019-03-28 12:09:59,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 28.43/19.83 [2019-03-28 12:09:59,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 28.43/19.83 [2019-03-28 12:09:59,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 28.43/19.83 [2019-03-28 12:09:59,659 INFO L82 PathProgramCache]: Analyzing trace with hash 2541490, now seen corresponding path program 1 times 28.43/19.83 [2019-03-28 12:09:59,659 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 28.43/19.83 [2019-03-28 12:09:59,659 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 28.43/19.83 [2019-03-28 12:09:59,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 28.43/19.83 [2019-03-28 12:09:59,660 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 28.43/19.83 [2019-03-28 12:09:59,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 28.43/19.83 [2019-03-28 12:09:59,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 28.43/19.83 [2019-03-28 12:09:59,708 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 28.43/19.83 [2019-03-28 12:09:59,710 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 28.43/19.83 [2019-03-28 12:09:59,710 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 28.43/19.83 [2019-03-28 12:09:59,714 INFO L811 eck$LassoCheckResult]: loop already infeasible 28.43/19.83 [2019-03-28 12:09:59,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 28.43/19.83 [2019-03-28 12:09:59,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 28.43/19.83 [2019-03-28 12:09:59,731 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 3 states. 28.43/19.83 [2019-03-28 12:09:59,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 28.43/19.83 [2019-03-28 12:09:59,770 INFO L93 Difference]: Finished difference Result 16 states and 22 transitions. 28.43/19.83 [2019-03-28 12:09:59,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 28.43/19.83 [2019-03-28 12:09:59,774 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 22 transitions. 28.43/19.83 [2019-03-28 12:09:59,777 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 28.43/19.83 [2019-03-28 12:09:59,782 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 10 states and 12 transitions. 28.43/19.83 [2019-03-28 12:09:59,783 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 28.43/19.83 [2019-03-28 12:09:59,783 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 28.43/19.83 [2019-03-28 12:09:59,784 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 12 transitions. 28.43/19.83 [2019-03-28 12:09:59,784 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 28.43/19.83 [2019-03-28 12:09:59,784 INFO L706 BuchiCegarLoop]: Abstraction has 10 states and 12 transitions. 28.43/19.83 [2019-03-28 12:09:59,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 12 transitions. 28.43/19.83 [2019-03-28 12:09:59,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. 28.43/19.83 [2019-03-28 12:09:59,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. 28.43/19.83 [2019-03-28 12:09:59,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 11 transitions. 28.43/19.83 [2019-03-28 12:09:59,815 INFO L729 BuchiCegarLoop]: Abstraction has 9 states and 11 transitions. 28.43/19.83 [2019-03-28 12:09:59,815 INFO L609 BuchiCegarLoop]: Abstraction has 9 states and 11 transitions. 28.43/19.83 [2019-03-28 12:09:59,815 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ 28.43/19.83 [2019-03-28 12:09:59,815 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 11 transitions. 28.43/19.83 [2019-03-28 12:09:59,816 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 28.43/19.83 [2019-03-28 12:09:59,816 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 28.43/19.83 [2019-03-28 12:09:59,816 INFO L119 BuchiIsEmpty]: Starting construction of run 28.43/19.83 [2019-03-28 12:09:59,816 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] 28.43/19.83 [2019-03-28 12:09:59,817 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] 28.43/19.83 [2019-03-28 12:09:59,817 INFO L794 eck$LassoCheckResult]: Stem: 43#ULTIMATE.startENTRY [74] ULTIMATE.startENTRY-->L35: Formula: (and (< 0 v_ULTIMATE.start_main_~n~0_9) (< 0 v_ULTIMATE.start_main_~m~0_9)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_8|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_7|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_6|, ULTIMATE.start_main_~m~0=v_ULTIMATE.start_main_~m~0_9, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_9, ULTIMATE.start_main_#t~ret4=|v_ULTIMATE.start_main_#t~ret4_7|, ULTIMATE.start_main_~result~0=v_ULTIMATE.start_main_~result~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~m~0, ULTIMATE.start_main_~n~0, ULTIMATE.start_main_#t~ret4, ULTIMATE.start_main_~result~0] 39#L35 [60] L35-->additionENTRY: Formula: (and (= |v_addition_#in~mInParam_1| v_ULTIMATE.start_main_~m~0_7) (= |v_addition_#in~nInParam_1| v_ULTIMATE.start_main_~n~0_6)) InVars {ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_6, ULTIMATE.start_main_~m~0=v_ULTIMATE.start_main_~m~0_7} OutVars{addition_#in~m=|v_addition_#in~mInParam_1|, addition_#in~n=|v_addition_#in~nInParam_1|} AuxVars[] AssignedVars[addition_#in~m, addition_#in~n]< 37#additionENTRY 28.43/19.83 [2019-03-28 12:09:59,818 INFO L796 eck$LassoCheckResult]: Loop: 37#additionENTRY [52] additionENTRY-->L14: Formula: (and (= v_addition_~m_1 |v_addition_#in~m_1|) (= v_addition_~n_1 |v_addition_#in~n_1|)) InVars {addition_#in~m=|v_addition_#in~m_1|, addition_#in~n=|v_addition_#in~n_1|} OutVars{addition_~n=v_addition_~n_1, addition_#in~m=|v_addition_#in~m_1|, addition_#in~n=|v_addition_#in~n_1|, addition_~m=v_addition_~m_1} AuxVars[] AssignedVars[addition_~n, addition_~m] 41#L14 [71] L14-->L17: Formula: (< 0 v_addition_~n_4) InVars {addition_~n=v_addition_~n_4} OutVars{addition_~n=v_addition_~n_4} AuxVars[] AssignedVars[] 45#L17 [49] L17-->L18: Formula: (< 0 v_addition_~n_5) InVars {addition_~n=v_addition_~n_5} OutVars{addition_~n=v_addition_~n_5} AuxVars[] AssignedVars[] 40#L18 [48] L18-->additionENTRY: Formula: (and (= |v_addition_#in~mInParam_2| (+ v_addition_~m_5 1)) (= |v_addition_#in~nInParam_2| (+ v_addition_~n_10 (- 1)))) InVars {addition_~n=v_addition_~n_10, addition_~m=v_addition_~m_5} OutVars{addition_#in~m=|v_addition_#in~mInParam_2|, addition_#in~n=|v_addition_#in~nInParam_2|} AuxVars[] AssignedVars[addition_#in~m, addition_#in~n]< 37#additionENTRY 28.43/19.83 [2019-03-28 12:09:59,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 28.43/19.83 [2019-03-28 12:09:59,818 INFO L82 PathProgramCache]: Analyzing trace with hash 3315, now seen corresponding path program 2 times 28.43/19.83 [2019-03-28 12:09:59,818 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 28.43/19.83 [2019-03-28 12:09:59,818 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 28.43/19.83 [2019-03-28 12:09:59,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 28.43/19.83 [2019-03-28 12:09:59,820 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 28.43/19.83 [2019-03-28 12:09:59,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 28.43/19.83 [2019-03-28 12:09:59,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 28.43/19.83 [2019-03-28 12:09:59,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 28.43/19.83 [2019-03-28 12:09:59,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 28.43/19.83 [2019-03-28 12:09:59,828 INFO L82 PathProgramCache]: Analyzing trace with hash 2542451, now seen corresponding path program 1 times 28.43/19.83 [2019-03-28 12:09:59,828 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 28.43/19.83 [2019-03-28 12:09:59,828 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 28.43/19.83 [2019-03-28 12:09:59,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 28.43/19.83 [2019-03-28 12:09:59,829 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 28.43/19.83 [2019-03-28 12:09:59,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 28.43/19.83 [2019-03-28 12:09:59,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 28.43/19.83 [2019-03-28 12:09:59,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 28.43/19.83 [2019-03-28 12:09:59,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 28.43/19.83 [2019-03-28 12:09:59,838 INFO L82 PathProgramCache]: Analyzing trace with hash -1231876251, now seen corresponding path program 1 times 28.43/19.83 [2019-03-28 12:09:59,838 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 28.43/19.83 [2019-03-28 12:09:59,838 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 28.43/19.83 [2019-03-28 12:09:59,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 28.43/19.83 [2019-03-28 12:09:59,839 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 28.43/19.83 [2019-03-28 12:09:59,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 28.43/19.83 [2019-03-28 12:09:59,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 28.43/19.83 [2019-03-28 12:09:59,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 28.43/19.83 [2019-03-28 12:09:59,931 INFO L216 LassoAnalysis]: Preferences: 28.43/19.83 [2019-03-28 12:09:59,932 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 28.43/19.83 [2019-03-28 12:09:59,932 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 28.43/19.83 [2019-03-28 12:09:59,933 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 28.43/19.83 [2019-03-28 12:09:59,933 INFO L127 ssoRankerPreferences]: Use exernal solver: true 28.43/19.83 [2019-03-28 12:09:59,933 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 28.43/19.83 [2019-03-28 12:09:59,933 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 28.43/19.83 [2019-03-28 12:09:59,933 INFO L130 ssoRankerPreferences]: Path of dumped script: 28.43/19.83 [2019-03-28 12:09:59,933 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration2_Loop 28.43/19.83 [2019-03-28 12:09:59,934 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 28.43/19.83 [2019-03-28 12:09:59,934 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 28.43/19.83 [2019-03-28 12:09:59,952 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 28.43/19.83 [2019-03-28 12:09:59,959 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 28.43/19.83 [2019-03-28 12:09:59,961 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 28.43/19.83 [2019-03-28 12:09:59,964 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 28.43/19.83 [2019-03-28 12:09:59,969 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 28.43/19.83 [2019-03-28 12:09:59,971 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 28.43/19.83 [2019-03-28 12:09:59,980 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 28.43/19.83 [2019-03-28 12:10:00,046 INFO L300 LassoAnalysis]: Preprocessing complete. 28.43/19.83 [2019-03-28 12:10:00,047 INFO L412 LassoAnalysis]: Checking for nontermination... 28.43/19.83 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 28.43/19.83 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 28.43/19.83 Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 28.43/19.83 [2019-03-28 12:10:00,054 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 28.43/19.83 [2019-03-28 12:10:00,055 INFO L163 nArgumentSynthesizer]: Using integer mode. 28.43/19.83 [2019-03-28 12:10:00,064 INFO L445 LassoAnalysis]: Proved nontermination for one component. 28.43/19.83 [2019-03-28 12:10:00,064 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {addition_~m=0} Honda state: {addition_~m=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 28.43/19.83 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 28.43/19.83 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 28.43/19.83 Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 28.43/19.83 [2019-03-28 12:10:00,093 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 28.43/19.83 [2019-03-28 12:10:00,093 INFO L163 nArgumentSynthesizer]: Using integer mode. 28.43/19.83 [2019-03-28 12:10:00,097 INFO L445 LassoAnalysis]: Proved nontermination for one component. 28.43/19.83 [2019-03-28 12:10:00,097 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {addition_#t~ret1=0} Honda state: {addition_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 28.43/19.83 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 28.43/19.83 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 28.43/19.83 Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 28.43/19.83 [2019-03-28 12:10:00,126 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 28.43/19.83 [2019-03-28 12:10:00,126 INFO L163 nArgumentSynthesizer]: Using integer mode. 28.43/19.83 [2019-03-28 12:10:00,130 INFO L445 LassoAnalysis]: Proved nontermination for one component. 28.43/19.83 [2019-03-28 12:10:00,130 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {addition_#t~ret0=0} Honda state: {addition_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 28.43/19.83 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 28.43/19.83 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 28.43/19.83 Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 28.43/19.83 [2019-03-28 12:10:00,156 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 28.43/19.83 [2019-03-28 12:10:00,157 INFO L163 nArgumentSynthesizer]: Using integer mode. 28.43/19.83 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 28.43/19.83 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 28.43/19.83 Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 28.43/19.83 [2019-03-28 12:10:00,187 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 28.43/19.83 [2019-03-28 12:10:00,187 INFO L163 nArgumentSynthesizer]: Using integer mode. 28.43/19.83 [2019-03-28 12:10:00,204 INFO L445 LassoAnalysis]: Proved nontermination for one component. 28.43/19.83 [2019-03-28 12:10:00,204 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {addition_#in~m=0} Honda state: {addition_#in~m=0} Generalized eigenvectors: [{addition_#in~m=5}, {addition_#in~m=4}, {addition_#in~m=-8}] Lambdas: [1, 3, 1] Nus: [0, 1] 28.43/19.83 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 28.43/19.83 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 28.43/19.83 Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 28.43/19.83 [2019-03-28 12:10:00,237 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 28.43/19.83 [2019-03-28 12:10:00,237 INFO L163 nArgumentSynthesizer]: Using integer mode. 28.43/19.83 [2019-03-28 12:10:00,241 INFO L445 LassoAnalysis]: Proved nontermination for one component. 28.43/19.83 [2019-03-28 12:10:00,241 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {addition_#res=0} Honda state: {addition_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 28.43/19.83 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 28.43/19.83 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 28.43/19.83 Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 28.43/19.83 [2019-03-28 12:10:00,268 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 28.43/19.83 [2019-03-28 12:10:00,269 INFO L163 nArgumentSynthesizer]: Using integer mode. 28.43/19.83 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 28.43/19.83 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 28.43/19.83 Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 28.43/19.83 [2019-03-28 12:10:00,300 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 28.43/19.83 [2019-03-28 12:10:00,300 INFO L163 nArgumentSynthesizer]: Using integer mode. 28.43/19.83 [2019-03-28 12:10:00,330 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. 28.43/19.83 [2019-03-28 12:10:00,332 INFO L216 LassoAnalysis]: Preferences: 28.43/19.83 [2019-03-28 12:10:00,332 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 28.43/19.83 [2019-03-28 12:10:00,332 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 28.43/19.83 [2019-03-28 12:10:00,332 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 28.43/19.83 [2019-03-28 12:10:00,332 INFO L127 ssoRankerPreferences]: Use exernal solver: false 28.43/19.83 [2019-03-28 12:10:00,333 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 28.43/19.83 [2019-03-28 12:10:00,333 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 28.43/19.83 [2019-03-28 12:10:00,333 INFO L130 ssoRankerPreferences]: Path of dumped script: 28.43/19.83 [2019-03-28 12:10:00,333 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration2_Loop 28.43/19.83 [2019-03-28 12:10:00,333 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 28.43/19.83 [2019-03-28 12:10:00,333 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 28.43/19.83 [2019-03-28 12:10:00,335 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 28.43/19.83 [2019-03-28 12:10:00,338 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 28.43/19.83 [2019-03-28 12:10:00,340 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 28.43/19.83 [2019-03-28 12:10:00,342 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 28.43/19.83 [2019-03-28 12:10:00,345 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 28.43/19.83 [2019-03-28 12:10:00,349 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 28.43/19.83 [2019-03-28 12:10:00,351 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 28.43/19.83 [2019-03-28 12:10:00,405 INFO L300 LassoAnalysis]: Preprocessing complete. 28.43/19.83 [2019-03-28 12:10:00,411 INFO L497 LassoAnalysis]: Using template 'affine'. 28.43/19.83 [2019-03-28 12:10:00,413 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 28.43/19.83 Termination analysis: LINEAR_WITH_GUESSES 28.43/19.83 Number of strict supporting invariants: 0 28.43/19.83 Number of non-strict supporting invariants: 1 28.43/19.83 Consider only non-deceasing supporting invariants: true 28.43/19.83 Simplify termination arguments: true 28.43/19.83 Simplify supporting invariants: trueOverapproximate stem: false 28.43/19.83 [2019-03-28 12:10:00,415 INFO L339 nArgumentSynthesizer]: Template has degree 0. 28.43/19.83 [2019-03-28 12:10:00,415 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 28.43/19.83 [2019-03-28 12:10:00,415 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 28.43/19.83 [2019-03-28 12:10:00,416 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 28.43/19.83 [2019-03-28 12:10:00,416 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 28.43/19.83 [2019-03-28 12:10:00,418 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 28.43/19.83 [2019-03-28 12:10:00,418 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 28.43/19.83 [2019-03-28 12:10:00,420 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 28.43/19.83 [2019-03-28 12:10:00,421 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 28.43/19.83 Termination analysis: LINEAR_WITH_GUESSES 28.43/19.83 Number of strict supporting invariants: 0 28.43/19.83 Number of non-strict supporting invariants: 1 28.43/19.83 Consider only non-deceasing supporting invariants: true 28.43/19.83 Simplify termination arguments: true 28.43/19.83 Simplify supporting invariants: trueOverapproximate stem: false 28.43/19.83 [2019-03-28 12:10:00,421 INFO L339 nArgumentSynthesizer]: Template has degree 0. 28.43/19.83 [2019-03-28 12:10:00,422 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 28.43/19.83 [2019-03-28 12:10:00,422 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 28.43/19.83 [2019-03-28 12:10:00,422 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 28.43/19.83 [2019-03-28 12:10:00,422 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 28.43/19.83 [2019-03-28 12:10:00,423 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 28.43/19.83 [2019-03-28 12:10:00,423 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 28.43/19.83 [2019-03-28 12:10:00,424 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 28.43/19.83 [2019-03-28 12:10:00,424 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 28.43/19.83 Termination analysis: LINEAR_WITH_GUESSES 28.43/19.83 Number of strict supporting invariants: 0 28.43/19.83 Number of non-strict supporting invariants: 1 28.43/19.83 Consider only non-deceasing supporting invariants: true 28.43/19.83 Simplify termination arguments: true 28.43/19.83 Simplify supporting invariants: trueOverapproximate stem: false 28.43/19.83 [2019-03-28 12:10:00,425 INFO L339 nArgumentSynthesizer]: Template has degree 0. 28.43/19.83 [2019-03-28 12:10:00,425 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 28.43/19.83 [2019-03-28 12:10:00,425 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 28.43/19.83 [2019-03-28 12:10:00,425 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 28.43/19.83 [2019-03-28 12:10:00,426 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 28.43/19.83 [2019-03-28 12:10:00,426 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 28.43/19.83 [2019-03-28 12:10:00,426 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 28.43/19.83 [2019-03-28 12:10:00,428 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 28.43/19.83 [2019-03-28 12:10:00,428 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 28.43/19.83 Termination analysis: LINEAR_WITH_GUESSES 28.43/19.83 Number of strict supporting invariants: 0 28.43/19.83 Number of non-strict supporting invariants: 1 28.43/19.83 Consider only non-deceasing supporting invariants: true 28.43/19.83 Simplify termination arguments: true 28.43/19.83 Simplify supporting invariants: trueOverapproximate stem: false 28.43/19.83 [2019-03-28 12:10:00,428 INFO L339 nArgumentSynthesizer]: Template has degree 0. 28.43/19.83 [2019-03-28 12:10:00,429 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 28.43/19.83 [2019-03-28 12:10:00,429 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 28.43/19.83 [2019-03-28 12:10:00,429 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 28.43/19.83 [2019-03-28 12:10:00,429 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 28.43/19.83 [2019-03-28 12:10:00,430 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 28.43/19.83 [2019-03-28 12:10:00,430 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 28.43/19.83 [2019-03-28 12:10:00,434 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 28.43/19.83 [2019-03-28 12:10:00,435 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 28.43/19.83 Termination analysis: LINEAR_WITH_GUESSES 28.43/19.83 Number of strict supporting invariants: 0 28.43/19.83 Number of non-strict supporting invariants: 1 28.43/19.83 Consider only non-deceasing supporting invariants: true 28.43/19.83 Simplify termination arguments: true 28.43/19.83 Simplify supporting invariants: trueOverapproximate stem: false 28.43/19.83 [2019-03-28 12:10:00,436 INFO L339 nArgumentSynthesizer]: Template has degree 0. 28.43/19.83 [2019-03-28 12:10:00,436 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 28.43/19.83 [2019-03-28 12:10:00,436 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 28.43/19.83 [2019-03-28 12:10:00,436 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 28.43/19.83 [2019-03-28 12:10:00,436 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 28.43/19.83 [2019-03-28 12:10:00,437 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 28.43/19.83 [2019-03-28 12:10:00,437 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 28.43/19.83 [2019-03-28 12:10:00,438 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 28.43/19.83 [2019-03-28 12:10:00,439 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 28.43/19.83 Termination analysis: LINEAR_WITH_GUESSES 28.43/19.83 Number of strict supporting invariants: 0 28.43/19.83 Number of non-strict supporting invariants: 1 28.43/19.83 Consider only non-deceasing supporting invariants: true 28.43/19.83 Simplify termination arguments: true 28.43/19.83 Simplify supporting invariants: trueOverapproximate stem: false 28.43/19.83 [2019-03-28 12:10:00,439 INFO L339 nArgumentSynthesizer]: Template has degree 0. 28.43/19.83 [2019-03-28 12:10:00,439 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 28.43/19.83 [2019-03-28 12:10:00,439 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 28.43/19.83 [2019-03-28 12:10:00,439 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 28.43/19.83 [2019-03-28 12:10:00,440 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 28.43/19.83 [2019-03-28 12:10:00,440 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 28.43/19.83 [2019-03-28 12:10:00,440 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 28.43/19.83 [2019-03-28 12:10:00,441 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 28.43/19.83 [2019-03-28 12:10:00,442 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 28.43/19.83 Termination analysis: LINEAR_WITH_GUESSES 28.43/19.83 Number of strict supporting invariants: 0 28.43/19.83 Number of non-strict supporting invariants: 1 28.43/19.83 Consider only non-deceasing supporting invariants: true 28.43/19.83 Simplify termination arguments: true 28.43/19.83 Simplify supporting invariants: trueOverapproximate stem: false 28.43/19.83 [2019-03-28 12:10:00,442 INFO L339 nArgumentSynthesizer]: Template has degree 0. 28.43/19.83 [2019-03-28 12:10:00,442 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 28.43/19.83 [2019-03-28 12:10:00,443 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 28.43/19.83 [2019-03-28 12:10:00,443 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 28.43/19.83 [2019-03-28 12:10:00,443 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 28.43/19.83 [2019-03-28 12:10:00,444 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 28.43/19.83 [2019-03-28 12:10:00,444 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 28.43/19.83 [2019-03-28 12:10:00,449 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 28.43/19.83 [2019-03-28 12:10:00,452 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 28.43/19.83 [2019-03-28 12:10:00,452 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. 28.43/19.83 [2019-03-28 12:10:00,454 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 28.43/19.83 [2019-03-28 12:10:00,455 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 28.43/19.83 [2019-03-28 12:10:00,455 INFO L518 LassoAnalysis]: Proved termination. 28.43/19.83 [2019-03-28 12:10:00,455 INFO L520 LassoAnalysis]: Termination argument consisting of: 28.43/19.83 Ranking function f(addition_#in~n) = 1*addition_#in~n 28.43/19.83 Supporting invariants [] 28.43/19.83 [2019-03-28 12:10:00,457 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed 28.43/19.83 [2019-03-28 12:10:00,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 28.43/19.83 [2019-03-28 12:10:00,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 28.43/19.83 [2019-03-28 12:10:00,500 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 4 conjunts are in the unsatisfiable core 28.43/19.83 [2019-03-28 12:10:00,502 INFO L279 TraceCheckSpWp]: Computing forward predicates... 28.43/19.83 [2019-03-28 12:10:00,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 28.43/19.83 [2019-03-28 12:10:00,521 INFO L256 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 7 conjunts are in the unsatisfiable core 28.43/19.83 [2019-03-28 12:10:00,522 INFO L279 TraceCheckSpWp]: Computing forward predicates... 28.43/19.83 [2019-03-28 12:10:00,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 28.43/19.83 [2019-03-28 12:10:00,568 INFO L98 LoopCannibalizer]: 3 predicates before loop cannibalization 3 predicates after loop cannibalization 28.43/19.83 [2019-03-28 12:10:00,571 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 28.43/19.83 [2019-03-28 12:10:00,572 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 9 states and 11 transitions. cyclomatic complexity: 3 Second operand 4 states. 28.43/19.83 [2019-03-28 12:10:00,677 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 9 states and 11 transitions. cyclomatic complexity: 3. Second operand 4 states. Result 46 states and 54 transitions. Complement of second has 15 states. 28.43/19.83 [2019-03-28 12:10:00,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states 28.43/19.83 [2019-03-28 12:10:00,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. 28.43/19.83 [2019-03-28 12:10:00,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 27 transitions. 28.43/19.83 [2019-03-28 12:10:00,683 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 27 transitions. Stem has 2 letters. Loop has 4 letters. 28.43/19.83 [2019-03-28 12:10:00,685 INFO L116 BuchiAccepts]: Finished buchiAccepts. 28.43/19.83 [2019-03-28 12:10:00,685 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 27 transitions. Stem has 6 letters. Loop has 4 letters. 28.43/19.83 [2019-03-28 12:10:00,686 INFO L116 BuchiAccepts]: Finished buchiAccepts. 28.43/19.83 [2019-03-28 12:10:00,686 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 27 transitions. Stem has 2 letters. Loop has 8 letters. 28.43/19.83 [2019-03-28 12:10:00,686 INFO L116 BuchiAccepts]: Finished buchiAccepts. 28.43/19.83 [2019-03-28 12:10:00,693 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 54 transitions. 28.43/19.83 [2019-03-28 12:10:00,697 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 28.43/19.83 [2019-03-28 12:10:00,698 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 25 states and 29 transitions. 28.43/19.83 [2019-03-28 12:10:00,698 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 28.43/19.83 [2019-03-28 12:10:00,699 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 28.43/19.83 [2019-03-28 12:10:00,699 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 29 transitions. 28.43/19.83 [2019-03-28 12:10:00,699 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 28.43/19.83 [2019-03-28 12:10:00,699 INFO L706 BuchiCegarLoop]: Abstraction has 25 states and 29 transitions. 28.43/19.83 [2019-03-28 12:10:00,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 29 transitions. 28.43/19.83 [2019-03-28 12:10:00,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 15. 28.43/19.83 [2019-03-28 12:10:00,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. 28.43/19.83 [2019-03-28 12:10:00,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 19 transitions. 28.43/19.83 [2019-03-28 12:10:00,702 INFO L729 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. 28.43/19.83 [2019-03-28 12:10:00,702 INFO L609 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. 28.43/19.83 [2019-03-28 12:10:00,702 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ 28.43/19.83 [2019-03-28 12:10:00,702 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 19 transitions. 28.43/19.83 [2019-03-28 12:10:00,703 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 28.43/19.83 [2019-03-28 12:10:00,703 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 28.43/19.83 [2019-03-28 12:10:00,703 INFO L119 BuchiIsEmpty]: Starting construction of run 28.43/19.83 [2019-03-28 12:10:00,704 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] 28.43/19.83 [2019-03-28 12:10:00,704 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] 28.43/19.83 [2019-03-28 12:10:00,704 INFO L794 eck$LassoCheckResult]: Stem: 156#ULTIMATE.startENTRY [74] ULTIMATE.startENTRY-->L35: Formula: (and (< 0 v_ULTIMATE.start_main_~n~0_9) (< 0 v_ULTIMATE.start_main_~m~0_9)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_8|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_7|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_6|, ULTIMATE.start_main_~m~0=v_ULTIMATE.start_main_~m~0_9, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_9, ULTIMATE.start_main_#t~ret4=|v_ULTIMATE.start_main_#t~ret4_7|, ULTIMATE.start_main_~result~0=v_ULTIMATE.start_main_~result~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~m~0, ULTIMATE.start_main_~n~0, ULTIMATE.start_main_#t~ret4, ULTIMATE.start_main_~result~0] 147#L35 [60] L35-->additionENTRY: Formula: (and (= |v_addition_#in~mInParam_1| v_ULTIMATE.start_main_~m~0_7) (= |v_addition_#in~nInParam_1| v_ULTIMATE.start_main_~n~0_6)) InVars {ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_6, ULTIMATE.start_main_~m~0=v_ULTIMATE.start_main_~m~0_7} OutVars{addition_#in~m=|v_addition_#in~mInParam_1|, addition_#in~n=|v_addition_#in~nInParam_1|} AuxVars[] AssignedVars[addition_#in~m, addition_#in~n]< 151#additionENTRY [52] additionENTRY-->L14: Formula: (and (= v_addition_~m_1 |v_addition_#in~m_1|) (= v_addition_~n_1 |v_addition_#in~n_1|)) InVars {addition_#in~m=|v_addition_#in~m_1|, addition_#in~n=|v_addition_#in~n_1|} OutVars{addition_~n=v_addition_~n_1, addition_#in~m=|v_addition_#in~m_1|, addition_#in~n=|v_addition_#in~n_1|, addition_~m=v_addition_~m_1} AuxVars[] AssignedVars[addition_~n, addition_~m] 153#L14 [70] L14-->L17: Formula: (> 0 v_addition_~n_4) InVars {addition_~n=v_addition_~n_4} OutVars{addition_~n=v_addition_~n_4} AuxVars[] AssignedVars[] 157#L17 28.43/19.83 [2019-03-28 12:10:00,705 INFO L796 eck$LassoCheckResult]: Loop: 157#L17 [68] L17-->L20: Formula: (>= 0 v_addition_~n_7) InVars {addition_~n=v_addition_~n_7} OutVars{addition_~n=v_addition_~n_7} AuxVars[] AssignedVars[] 146#L20 [42] L20-->L21: Formula: (< v_addition_~n_8 0) InVars {addition_~n=v_addition_~n_8} OutVars{addition_~n=v_addition_~n_8} AuxVars[] AssignedVars[] 148#L21 [45] L21-->additionENTRY: Formula: (and (= |v_addition_#in~mInParam_3| (+ v_addition_~m_6 (- 1))) (= |v_addition_#in~nInParam_3| (+ v_addition_~n_11 1))) InVars {addition_~n=v_addition_~n_11, addition_~m=v_addition_~m_6} OutVars{addition_#in~m=|v_addition_#in~mInParam_3|, addition_#in~n=|v_addition_#in~nInParam_3|} AuxVars[] AssignedVars[addition_#in~m, addition_#in~n]< 155#additionENTRY [52] additionENTRY-->L14: Formula: (and (= v_addition_~m_1 |v_addition_#in~m_1|) (= v_addition_~n_1 |v_addition_#in~n_1|)) InVars {addition_#in~m=|v_addition_#in~m_1|, addition_#in~n=|v_addition_#in~n_1|} OutVars{addition_~n=v_addition_~n_1, addition_#in~m=|v_addition_#in~m_1|, addition_#in~n=|v_addition_#in~n_1|, addition_~m=v_addition_~m_1} AuxVars[] AssignedVars[addition_~n, addition_~m] 160#L14 [70] L14-->L17: Formula: (> 0 v_addition_~n_4) InVars {addition_~n=v_addition_~n_4} OutVars{addition_~n=v_addition_~n_4} AuxVars[] AssignedVars[] 157#L17 28.43/19.83 [2019-03-28 12:10:00,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 28.43/19.83 [2019-03-28 12:10:00,705 INFO L82 PathProgramCache]: Analyzing trace with hash 3187397, now seen corresponding path program 1 times 28.43/19.83 [2019-03-28 12:10:00,705 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 28.43/19.83 [2019-03-28 12:10:00,706 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 28.43/19.83 [2019-03-28 12:10:00,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 28.43/19.83 [2019-03-28 12:10:00,707 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 28.43/19.83 [2019-03-28 12:10:00,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 28.43/19.83 [2019-03-28 12:10:00,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 28.43/19.83 [2019-03-28 12:10:00,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 28.43/19.83 [2019-03-28 12:10:00,761 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 28.43/19.83 [2019-03-28 12:10:00,762 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 28.43/19.83 [2019-03-28 12:10:00,762 INFO L799 eck$LassoCheckResult]: stem already infeasible 28.43/19.83 [2019-03-28 12:10:00,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 28.43/19.83 [2019-03-28 12:10:00,762 INFO L82 PathProgramCache]: Analyzing trace with hash 92724728, now seen corresponding path program 1 times 28.43/19.83 [2019-03-28 12:10:00,762 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 28.43/19.83 [2019-03-28 12:10:00,763 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 28.43/19.83 [2019-03-28 12:10:00,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 28.43/19.83 [2019-03-28 12:10:00,764 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 28.43/19.83 [2019-03-28 12:10:00,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 28.43/19.83 [2019-03-28 12:10:00,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 28.43/19.83 [2019-03-28 12:10:00,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 28.43/19.83 [2019-03-28 12:10:00,868 INFO L216 LassoAnalysis]: Preferences: 28.43/19.83 [2019-03-28 12:10:00,868 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 28.43/19.83 [2019-03-28 12:10:00,868 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 28.43/19.83 [2019-03-28 12:10:00,868 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 28.43/19.83 [2019-03-28 12:10:00,868 INFO L127 ssoRankerPreferences]: Use exernal solver: true 28.43/19.83 [2019-03-28 12:10:00,869 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 28.43/19.83 [2019-03-28 12:10:00,869 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 28.43/19.83 [2019-03-28 12:10:00,869 INFO L130 ssoRankerPreferences]: Path of dumped script: 28.43/19.83 [2019-03-28 12:10:00,869 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration3_Loop 28.43/19.83 [2019-03-28 12:10:00,869 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 28.43/19.83 [2019-03-28 12:10:00,869 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 28.43/19.83 [2019-03-28 12:10:00,871 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 28.43/19.83 [2019-03-28 12:10:00,875 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 28.43/19.83 [2019-03-28 12:10:00,882 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 28.43/19.83 [2019-03-28 12:10:00,885 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 28.43/19.83 [2019-03-28 12:10:00,887 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 28.43/19.83 [2019-03-28 12:10:00,953 INFO L300 LassoAnalysis]: Preprocessing complete. 28.43/19.83 [2019-03-28 12:10:00,954 INFO L412 LassoAnalysis]: Checking for nontermination... 28.43/19.83 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 28.43/19.83 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 28.43/19.83 Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 28.43/19.83 [2019-03-28 12:10:00,960 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 28.43/19.83 [2019-03-28 12:10:00,960 INFO L163 nArgumentSynthesizer]: Using integer mode. 28.43/19.83 [2019-03-28 12:10:00,965 INFO L445 LassoAnalysis]: Proved nontermination for one component. 28.43/19.83 [2019-03-28 12:10:00,965 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {addition_#t~ret1=0} Honda state: {addition_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 28.43/19.83 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 28.43/19.83 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 28.43/19.83 Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 28.43/19.83 [2019-03-28 12:10:00,995 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 28.43/19.83 [2019-03-28 12:10:00,995 INFO L163 nArgumentSynthesizer]: Using integer mode. 28.43/19.83 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 28.43/19.83 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 28.43/19.83 Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 28.43/19.83 [2019-03-28 12:10:01,032 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 28.43/19.83 [2019-03-28 12:10:01,032 INFO L163 nArgumentSynthesizer]: Using integer mode. 28.43/19.83 [2019-03-28 12:10:01,215 INFO L445 LassoAnalysis]: Proved nontermination for one component. 28.43/19.83 [2019-03-28 12:10:01,215 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {addition_#in~m=-8, addition_~m=-8} Honda state: {addition_#in~m=-8, addition_~m=-8} Generalized eigenvectors: [{addition_#in~m=7, addition_~m=-1}, {addition_#in~m=-8, addition_~m=0}, {addition_#in~m=0, addition_~m=0}] Lambdas: [1, 0, 15] Nus: [1, 0] 28.43/19.83 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 28.43/19.83 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 28.43/19.83 Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 28.43/19.83 [2019-03-28 12:10:01,244 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 28.43/19.83 [2019-03-28 12:10:01,244 INFO L163 nArgumentSynthesizer]: Using integer mode. 28.43/19.83 [2019-03-28 12:10:01,247 INFO L445 LassoAnalysis]: Proved nontermination for one component. 28.43/19.83 [2019-03-28 12:10:01,248 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {addition_#res=0} Honda state: {addition_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 28.43/19.83 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 28.43/19.83 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 28.43/19.83 Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 28.43/19.83 [2019-03-28 12:10:01,274 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 28.43/19.83 [2019-03-28 12:10:01,275 INFO L163 nArgumentSynthesizer]: Using integer mode. 28.43/19.83 [2019-03-28 12:10:01,278 INFO L445 LassoAnalysis]: Proved nontermination for one component. 28.43/19.83 [2019-03-28 12:10:01,278 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {addition_#t~ret0=0} Honda state: {addition_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 28.43/19.83 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 28.43/19.83 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 28.43/19.83 Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 28.43/19.83 [2019-03-28 12:10:01,305 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 28.43/19.83 [2019-03-28 12:10:01,306 INFO L163 nArgumentSynthesizer]: Using integer mode. 28.43/19.83 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 28.43/19.83 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 28.43/19.83 Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 28.43/19.83 [2019-03-28 12:10:01,340 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 28.43/19.83 [2019-03-28 12:10:01,341 INFO L163 nArgumentSynthesizer]: Using integer mode. 28.43/19.83 [2019-03-28 12:10:13,375 INFO L450 LassoAnalysis]: Proving nontermination failed: SMT Solver returned 'unknown'. 28.43/19.83 [2019-03-28 12:10:13,379 INFO L216 LassoAnalysis]: Preferences: 28.43/19.83 [2019-03-28 12:10:13,379 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 28.43/19.83 [2019-03-28 12:10:13,379 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 28.43/19.83 [2019-03-28 12:10:13,379 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 28.43/19.83 [2019-03-28 12:10:13,379 INFO L127 ssoRankerPreferences]: Use exernal solver: false 28.43/19.83 [2019-03-28 12:10:13,379 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 28.43/19.83 [2019-03-28 12:10:13,379 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 28.43/19.83 [2019-03-28 12:10:13,380 INFO L130 ssoRankerPreferences]: Path of dumped script: 28.43/19.83 [2019-03-28 12:10:13,380 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration3_Loop 28.43/19.83 [2019-03-28 12:10:13,380 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 28.43/19.83 [2019-03-28 12:10:13,380 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 28.43/19.83 [2019-03-28 12:10:13,381 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 28.43/19.83 [2019-03-28 12:10:13,385 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 28.43/19.83 [2019-03-28 12:10:13,387 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 28.43/19.83 [2019-03-28 12:10:13,394 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 28.43/19.83 [2019-03-28 12:10:13,397 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 28.43/19.83 [2019-03-28 12:10:13,457 INFO L300 LassoAnalysis]: Preprocessing complete. 28.43/19.83 [2019-03-28 12:10:13,457 INFO L497 LassoAnalysis]: Using template 'affine'. 28.43/19.83 [2019-03-28 12:10:13,458 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 28.43/19.83 Termination analysis: LINEAR_WITH_GUESSES 28.43/19.83 Number of strict supporting invariants: 0 28.43/19.83 Number of non-strict supporting invariants: 1 28.43/19.83 Consider only non-deceasing supporting invariants: true 28.43/19.83 Simplify termination arguments: true 28.43/19.83 Simplify supporting invariants: trueOverapproximate stem: false 28.43/19.83 [2019-03-28 12:10:13,459 INFO L339 nArgumentSynthesizer]: Template has degree 0. 28.43/19.83 [2019-03-28 12:10:13,459 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 28.43/19.83 [2019-03-28 12:10:13,459 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 28.43/19.83 [2019-03-28 12:10:13,459 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 28.43/19.83 [2019-03-28 12:10:13,459 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 28.43/19.83 [2019-03-28 12:10:13,460 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 28.43/19.83 [2019-03-28 12:10:13,460 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 28.43/19.83 [2019-03-28 12:10:13,462 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 28.43/19.83 [2019-03-28 12:10:13,462 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 28.43/19.83 Termination analysis: LINEAR_WITH_GUESSES 28.43/19.83 Number of strict supporting invariants: 0 28.43/19.83 Number of non-strict supporting invariants: 1 28.43/19.83 Consider only non-deceasing supporting invariants: true 28.43/19.83 Simplify termination arguments: true 28.43/19.83 Simplify supporting invariants: trueOverapproximate stem: false 28.43/19.83 [2019-03-28 12:10:13,462 INFO L339 nArgumentSynthesizer]: Template has degree 0. 28.43/19.83 [2019-03-28 12:10:13,463 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 28.43/19.83 [2019-03-28 12:10:13,463 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 28.43/19.83 [2019-03-28 12:10:13,463 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 28.43/19.83 [2019-03-28 12:10:13,463 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 28.43/19.83 [2019-03-28 12:10:13,463 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 28.43/19.83 [2019-03-28 12:10:13,464 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 28.43/19.83 [2019-03-28 12:10:13,465 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 28.43/19.83 [2019-03-28 12:10:13,465 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 28.43/19.83 Termination analysis: LINEAR_WITH_GUESSES 28.43/19.83 Number of strict supporting invariants: 0 28.43/19.83 Number of non-strict supporting invariants: 1 28.43/19.83 Consider only non-deceasing supporting invariants: true 28.43/19.83 Simplify termination arguments: true 28.43/19.83 Simplify supporting invariants: trueOverapproximate stem: false 28.43/19.83 [2019-03-28 12:10:13,466 INFO L339 nArgumentSynthesizer]: Template has degree 0. 28.43/19.83 [2019-03-28 12:10:13,466 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 28.43/19.83 [2019-03-28 12:10:13,466 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 28.43/19.83 [2019-03-28 12:10:13,466 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 28.43/19.83 [2019-03-28 12:10:13,467 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 28.43/19.83 [2019-03-28 12:10:13,467 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 28.43/19.83 [2019-03-28 12:10:13,467 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 28.43/19.83 [2019-03-28 12:10:13,472 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 28.43/19.83 [2019-03-28 12:10:13,473 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 28.43/19.83 Termination analysis: LINEAR_WITH_GUESSES 28.43/19.83 Number of strict supporting invariants: 0 28.43/19.83 Number of non-strict supporting invariants: 1 28.43/19.83 Consider only non-deceasing supporting invariants: true 28.43/19.83 Simplify termination arguments: true 28.43/19.83 Simplify supporting invariants: trueOverapproximate stem: false 28.43/19.83 [2019-03-28 12:10:13,473 INFO L339 nArgumentSynthesizer]: Template has degree 0. 28.43/19.83 [2019-03-28 12:10:13,473 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 28.43/19.83 [2019-03-28 12:10:13,474 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 28.43/19.83 [2019-03-28 12:10:13,474 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 28.43/19.83 [2019-03-28 12:10:13,474 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 28.43/19.83 [2019-03-28 12:10:13,474 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 28.43/19.83 [2019-03-28 12:10:13,474 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 28.43/19.83 [2019-03-28 12:10:13,475 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 28.43/19.83 [2019-03-28 12:10:13,476 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 28.43/19.83 Termination analysis: LINEAR_WITH_GUESSES 28.43/19.83 Number of strict supporting invariants: 0 28.43/19.83 Number of non-strict supporting invariants: 1 28.43/19.83 Consider only non-deceasing supporting invariants: true 28.43/19.83 Simplify termination arguments: true 28.43/19.83 Simplify supporting invariants: trueOverapproximate stem: false 28.43/19.83 [2019-03-28 12:10:13,476 INFO L339 nArgumentSynthesizer]: Template has degree 0. 28.43/19.83 [2019-03-28 12:10:13,477 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 28.43/19.83 [2019-03-28 12:10:13,477 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 28.43/19.83 [2019-03-28 12:10:13,477 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 28.43/19.83 [2019-03-28 12:10:13,477 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 28.43/19.83 [2019-03-28 12:10:13,478 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 28.43/19.83 [2019-03-28 12:10:13,478 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 28.43/19.83 [2019-03-28 12:10:13,484 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 28.43/19.83 [2019-03-28 12:10:13,488 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 28.43/19.83 [2019-03-28 12:10:13,488 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. 28.43/19.83 [2019-03-28 12:10:13,489 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 28.43/19.83 [2019-03-28 12:10:13,489 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 28.43/19.83 [2019-03-28 12:10:13,489 INFO L518 LassoAnalysis]: Proved termination. 28.43/19.83 [2019-03-28 12:10:13,489 INFO L520 LassoAnalysis]: Termination argument consisting of: 28.43/19.83 Ranking function f(addition_~n) = -1*addition_~n 28.43/19.83 Supporting invariants [] 28.43/19.83 [2019-03-28 12:10:13,490 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed 28.43/19.83 [2019-03-28 12:10:13,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 28.43/19.83 [2019-03-28 12:10:13,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 28.43/19.83 [2019-03-28 12:10:13,521 INFO L256 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 4 conjunts are in the unsatisfiable core 28.43/19.83 [2019-03-28 12:10:13,522 INFO L279 TraceCheckSpWp]: Computing forward predicates... 28.43/19.83 [2019-03-28 12:10:13,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 28.43/19.83 [2019-03-28 12:10:13,542 INFO L256 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 7 conjunts are in the unsatisfiable core 28.43/19.83 [2019-03-28 12:10:13,543 INFO L279 TraceCheckSpWp]: Computing forward predicates... 28.43/19.83 [2019-03-28 12:10:13,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 28.43/19.83 [2019-03-28 12:10:13,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 28.43/19.83 [2019-03-28 12:10:13,580 INFO L256 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 7 conjunts are in the unsatisfiable core 28.43/19.83 [2019-03-28 12:10:13,580 INFO L279 TraceCheckSpWp]: Computing forward predicates... 28.43/19.83 [2019-03-28 12:10:13,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 28.43/19.83 [2019-03-28 12:10:13,624 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 28.43/19.83 [2019-03-28 12:10:13,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 28.43/19.83 [2019-03-28 12:10:13,636 INFO L256 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 7 conjunts are in the unsatisfiable core 28.43/19.83 [2019-03-28 12:10:13,637 INFO L279 TraceCheckSpWp]: Computing forward predicates... 28.43/19.83 [2019-03-28 12:10:13,708 INFO L98 LoopCannibalizer]: 3 predicates before loop cannibalization 5 predicates after loop cannibalization 28.43/19.83 [2019-03-28 12:10:13,708 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 5 loop predicates 28.43/19.83 [2019-03-28 12:10:13,708 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 15 states and 19 transitions. cyclomatic complexity: 6 Second operand 5 states. 28.43/19.83 [2019-03-28 12:10:13,774 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 15 states and 19 transitions. cyclomatic complexity: 6. Second operand 5 states. Result 80 states and 100 transitions. Complement of second has 43 states. 28.43/19.83 [2019-03-28 12:10:13,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 3 non-accepting loop states 2 accepting loop states 28.43/19.83 [2019-03-28 12:10:13,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. 28.43/19.83 [2019-03-28 12:10:13,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 20 transitions. 28.43/19.83 [2019-03-28 12:10:13,775 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 20 transitions. Stem has 4 letters. Loop has 5 letters. 28.43/19.83 [2019-03-28 12:10:13,776 INFO L116 BuchiAccepts]: Finished buchiAccepts. 28.43/19.83 [2019-03-28 12:10:13,776 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 20 transitions. Stem has 9 letters. Loop has 5 letters. 28.43/19.83 [2019-03-28 12:10:13,777 INFO L116 BuchiAccepts]: Finished buchiAccepts. 28.43/19.83 [2019-03-28 12:10:13,777 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 20 transitions. Stem has 4 letters. Loop has 10 letters. 28.43/19.83 [2019-03-28 12:10:13,778 INFO L116 BuchiAccepts]: Finished buchiAccepts. 28.43/19.83 [2019-03-28 12:10:13,780 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 80 states and 100 transitions. 28.43/19.83 [2019-03-28 12:10:13,783 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 29 28.43/19.83 [2019-03-28 12:10:13,785 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 80 states to 37 states and 45 transitions. 28.43/19.83 [2019-03-28 12:10:13,785 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 28.43/19.83 [2019-03-28 12:10:13,786 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 28.43/19.83 [2019-03-28 12:10:13,786 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 45 transitions. 28.43/19.83 [2019-03-28 12:10:13,786 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 28.43/19.83 [2019-03-28 12:10:13,786 INFO L706 BuchiCegarLoop]: Abstraction has 37 states and 45 transitions. 28.43/19.83 [2019-03-28 12:10:13,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 45 transitions. 28.43/19.83 [2019-03-28 12:10:13,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 21. 28.43/19.83 [2019-03-28 12:10:13,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. 28.43/19.83 [2019-03-28 12:10:13,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 27 transitions. 28.43/19.83 [2019-03-28 12:10:13,789 INFO L729 BuchiCegarLoop]: Abstraction has 21 states and 27 transitions. 28.43/19.83 [2019-03-28 12:10:13,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. 28.43/19.83 [2019-03-28 12:10:13,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 28.43/19.83 [2019-03-28 12:10:13,790 INFO L87 Difference]: Start difference. First operand 21 states and 27 transitions. Second operand 5 states. 28.43/19.83 [2019-03-28 12:10:13,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 28.43/19.83 [2019-03-28 12:10:13,820 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. 28.43/19.83 [2019-03-28 12:10:13,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 28.43/19.83 [2019-03-28 12:10:13,822 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 27 transitions. 28.43/19.83 [2019-03-28 12:10:13,823 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 28.43/19.83 [2019-03-28 12:10:13,823 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 22 states and 25 transitions. 28.43/19.83 [2019-03-28 12:10:13,823 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 28.43/19.83 [2019-03-28 12:10:13,824 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 28.43/19.83 [2019-03-28 12:10:13,824 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 25 transitions. 28.43/19.83 [2019-03-28 12:10:13,824 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 28.43/19.83 [2019-03-28 12:10:13,824 INFO L706 BuchiCegarLoop]: Abstraction has 22 states and 25 transitions. 28.43/19.83 [2019-03-28 12:10:13,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 25 transitions. 28.43/19.83 [2019-03-28 12:10:13,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 18. 28.43/19.83 [2019-03-28 12:10:13,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. 28.43/19.83 [2019-03-28 12:10:13,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions. 28.43/19.83 [2019-03-28 12:10:13,826 INFO L729 BuchiCegarLoop]: Abstraction has 18 states and 21 transitions. 28.43/19.83 [2019-03-28 12:10:13,826 INFO L609 BuchiCegarLoop]: Abstraction has 18 states and 21 transitions. 28.43/19.83 [2019-03-28 12:10:13,827 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ 28.43/19.83 [2019-03-28 12:10:13,827 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 21 transitions. 28.43/19.83 [2019-03-28 12:10:13,827 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 28.43/19.83 [2019-03-28 12:10:13,827 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 28.43/19.83 [2019-03-28 12:10:13,828 INFO L119 BuchiIsEmpty]: Starting construction of run 28.43/19.83 [2019-03-28 12:10:13,828 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1] 28.43/19.83 [2019-03-28 12:10:13,828 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1, 1] 28.43/19.83 [2019-03-28 12:10:13,829 INFO L794 eck$LassoCheckResult]: Stem: 420#ULTIMATE.startENTRY [74] ULTIMATE.startENTRY-->L35: Formula: (and (< 0 v_ULTIMATE.start_main_~n~0_9) (< 0 v_ULTIMATE.start_main_~m~0_9)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_8|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_7|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_6|, ULTIMATE.start_main_~m~0=v_ULTIMATE.start_main_~m~0_9, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_9, ULTIMATE.start_main_#t~ret4=|v_ULTIMATE.start_main_#t~ret4_7|, ULTIMATE.start_main_~result~0=v_ULTIMATE.start_main_~result~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~m~0, ULTIMATE.start_main_~n~0, ULTIMATE.start_main_#t~ret4, ULTIMATE.start_main_~result~0] 411#L35 [60] L35-->additionENTRY: Formula: (and (= |v_addition_#in~mInParam_1| v_ULTIMATE.start_main_~m~0_7) (= |v_addition_#in~nInParam_1| v_ULTIMATE.start_main_~n~0_6)) InVars {ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_6, ULTIMATE.start_main_~m~0=v_ULTIMATE.start_main_~m~0_7} OutVars{addition_#in~m=|v_addition_#in~mInParam_1|, addition_#in~n=|v_addition_#in~nInParam_1|} AuxVars[] AssignedVars[addition_#in~m, addition_#in~n]< 410#additionENTRY [52] additionENTRY-->L14: Formula: (and (= v_addition_~m_1 |v_addition_#in~m_1|) (= v_addition_~n_1 |v_addition_#in~n_1|)) InVars {addition_#in~m=|v_addition_#in~m_1|, addition_#in~n=|v_addition_#in~n_1|} OutVars{addition_~n=v_addition_~n_1, addition_#in~m=|v_addition_#in~m_1|, addition_#in~n=|v_addition_#in~n_1|, addition_~m=v_addition_~m_1} AuxVars[] AssignedVars[addition_~n, addition_~m] 412#L14 [71] L14-->L17: Formula: (< 0 v_addition_~n_4) InVars {addition_~n=v_addition_~n_4} OutVars{addition_~n=v_addition_~n_4} AuxVars[] AssignedVars[] 422#L17 [49] L17-->L18: Formula: (< 0 v_addition_~n_5) InVars {addition_~n=v_addition_~n_5} OutVars{addition_~n=v_addition_~n_5} AuxVars[] AssignedVars[] 414#L18 [48] L18-->additionENTRY: Formula: (and (= |v_addition_#in~mInParam_2| (+ v_addition_~m_5 1)) (= |v_addition_#in~nInParam_2| (+ v_addition_~n_10 (- 1)))) InVars {addition_~n=v_addition_~n_10, addition_~m=v_addition_~m_5} OutVars{addition_#in~m=|v_addition_#in~mInParam_2|, addition_#in~n=|v_addition_#in~nInParam_2|} AuxVars[] AssignedVars[addition_#in~m, addition_#in~n]< 413#additionENTRY [52] additionENTRY-->L14: Formula: (and (= v_addition_~m_1 |v_addition_#in~m_1|) (= v_addition_~n_1 |v_addition_#in~n_1|)) InVars {addition_#in~m=|v_addition_#in~m_1|, addition_#in~n=|v_addition_#in~n_1|} OutVars{addition_~n=v_addition_~n_1, addition_#in~m=|v_addition_#in~m_1|, addition_#in~n=|v_addition_#in~n_1|, addition_~m=v_addition_~m_1} AuxVars[] AssignedVars[addition_~n, addition_~m] 415#L14 [70] L14-->L17: Formula: (> 0 v_addition_~n_4) InVars {addition_~n=v_addition_~n_4} OutVars{addition_~n=v_addition_~n_4} AuxVars[] AssignedVars[] 421#L17 28.43/19.83 [2019-03-28 12:10:13,829 INFO L796 eck$LassoCheckResult]: Loop: 421#L17 [68] L17-->L20: Formula: (>= 0 v_addition_~n_7) InVars {addition_~n=v_addition_~n_7} OutVars{addition_~n=v_addition_~n_7} AuxVars[] AssignedVars[] 416#L20 [42] L20-->L21: Formula: (< v_addition_~n_8 0) InVars {addition_~n=v_addition_~n_8} OutVars{addition_~n=v_addition_~n_8} AuxVars[] AssignedVars[] 417#L21 [45] L21-->additionENTRY: Formula: (and (= |v_addition_#in~mInParam_3| (+ v_addition_~m_6 (- 1))) (= |v_addition_#in~nInParam_3| (+ v_addition_~n_11 1))) InVars {addition_~n=v_addition_~n_11, addition_~m=v_addition_~m_6} OutVars{addition_#in~m=|v_addition_#in~mInParam_3|, addition_#in~n=|v_addition_#in~nInParam_3|} AuxVars[] AssignedVars[addition_#in~m, addition_#in~n]< 419#additionENTRY [52] additionENTRY-->L14: Formula: (and (= v_addition_~m_1 |v_addition_#in~m_1|) (= v_addition_~n_1 |v_addition_#in~n_1|)) InVars {addition_#in~m=|v_addition_#in~m_1|, addition_#in~n=|v_addition_#in~n_1|} OutVars{addition_~n=v_addition_~n_1, addition_#in~m=|v_addition_#in~m_1|, addition_#in~n=|v_addition_#in~n_1|, addition_~m=v_addition_~m_1} AuxVars[] AssignedVars[addition_~n, addition_~m] 426#L14 [71] L14-->L17: Formula: (< 0 v_addition_~n_4) InVars {addition_~n=v_addition_~n_4} OutVars{addition_~n=v_addition_~n_4} AuxVars[] AssignedVars[] 424#L17 [49] L17-->L18: Formula: (< 0 v_addition_~n_5) InVars {addition_~n=v_addition_~n_5} OutVars{addition_~n=v_addition_~n_5} AuxVars[] AssignedVars[] 418#L18 [48] L18-->additionENTRY: Formula: (and (= |v_addition_#in~mInParam_2| (+ v_addition_~m_5 1)) (= |v_addition_#in~nInParam_2| (+ v_addition_~n_10 (- 1)))) InVars {addition_~n=v_addition_~n_10, addition_~m=v_addition_~m_5} OutVars{addition_#in~m=|v_addition_#in~mInParam_2|, addition_#in~n=|v_addition_#in~nInParam_2|} AuxVars[] AssignedVars[addition_#in~m, addition_#in~n]< 423#additionENTRY [52] additionENTRY-->L14: Formula: (and (= v_addition_~m_1 |v_addition_#in~m_1|) (= v_addition_~n_1 |v_addition_#in~n_1|)) InVars {addition_#in~m=|v_addition_#in~m_1|, addition_#in~n=|v_addition_#in~n_1|} OutVars{addition_~n=v_addition_~n_1, addition_#in~m=|v_addition_#in~m_1|, addition_#in~n=|v_addition_#in~n_1|, addition_~m=v_addition_~m_1} AuxVars[] AssignedVars[addition_~n, addition_~m] 427#L14 [70] L14-->L17: Formula: (> 0 v_addition_~n_4) InVars {addition_~n=v_addition_~n_4} OutVars{addition_~n=v_addition_~n_4} AuxVars[] AssignedVars[] 421#L17 28.43/19.83 [2019-03-28 12:10:13,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 28.43/19.83 [2019-03-28 12:10:13,829 INFO L82 PathProgramCache]: Analyzing trace with hash 1577898167, now seen corresponding path program 1 times 28.43/19.83 [2019-03-28 12:10:13,830 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 28.43/19.83 [2019-03-28 12:10:13,830 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 28.43/19.83 [2019-03-28 12:10:13,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 28.43/19.83 [2019-03-28 12:10:13,831 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 28.43/19.83 [2019-03-28 12:10:13,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 28.43/19.83 [2019-03-28 12:10:13,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 28.43/19.83 [2019-03-28 12:10:13,855 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 28.43/19.83 [2019-03-28 12:10:13,855 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 28.43/19.83 [2019-03-28 12:10:13,855 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 28.43/19.83 [2019-03-28 12:10:13,856 INFO L799 eck$LassoCheckResult]: stem already infeasible 28.43/19.83 [2019-03-28 12:10:13,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 28.43/19.83 [2019-03-28 12:10:13,856 INFO L82 PathProgramCache]: Analyzing trace with hash 178010730, now seen corresponding path program 1 times 28.43/19.83 [2019-03-28 12:10:13,856 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 28.43/19.83 [2019-03-28 12:10:13,856 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 28.43/19.83 [2019-03-28 12:10:13,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 28.43/19.83 [2019-03-28 12:10:13,857 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 28.43/19.83 [2019-03-28 12:10:13,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 28.43/19.83 [2019-03-28 12:10:13,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 28.43/19.83 [2019-03-28 12:10:13,881 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 28.43/19.83 [2019-03-28 12:10:13,881 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 28.43/19.83 [2019-03-28 12:10:13,881 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 28.43/19.83 [2019-03-28 12:10:13,882 INFO L811 eck$LassoCheckResult]: loop already infeasible 28.43/19.83 [2019-03-28 12:10:13,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. 28.43/19.83 [2019-03-28 12:10:13,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 28.43/19.83 [2019-03-28 12:10:13,882 INFO L87 Difference]: Start difference. First operand 18 states and 21 transitions. cyclomatic complexity: 5 Second operand 5 states. 28.43/19.83 [2019-03-28 12:10:13,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 28.43/19.83 [2019-03-28 12:10:13,905 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. 28.43/19.83 [2019-03-28 12:10:13,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 28.43/19.83 [2019-03-28 12:10:13,907 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 11 transitions. 28.43/19.83 [2019-03-28 12:10:13,908 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 28.43/19.83 [2019-03-28 12:10:13,908 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 0 states and 0 transitions. 28.43/19.83 [2019-03-28 12:10:13,908 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 28.43/19.83 [2019-03-28 12:10:13,908 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 28.43/19.83 [2019-03-28 12:10:13,908 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. 28.43/19.83 [2019-03-28 12:10:13,908 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 28.43/19.83 [2019-03-28 12:10:13,908 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 28.43/19.83 [2019-03-28 12:10:13,908 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 28.43/19.83 [2019-03-28 12:10:13,909 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 28.43/19.83 [2019-03-28 12:10:13,909 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ 28.43/19.83 [2019-03-28 12:10:13,909 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. 28.43/19.83 [2019-03-28 12:10:13,909 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 28.43/19.83 [2019-03-28 12:10:13,909 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true 28.43/19.83 [2019-03-28 12:10:13,915 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:10:13 BasicIcfg 28.43/19.83 [2019-03-28 12:10:13,915 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- 28.43/19.83 [2019-03-28 12:10:13,916 INFO L168 Benchmark]: Toolchain (without parser) took 15278.40 ms. Allocated memory was 649.6 MB in the beginning and 740.8 MB in the end (delta: 91.2 MB). Free memory was 565.0 MB in the beginning and 653.8 MB in the end (delta: -88.9 MB). Peak memory consumption was 2.4 MB. Max. memory is 50.3 GB. 28.43/19.83 [2019-03-28 12:10:13,917 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 649.6 MB. Free memory is still 585.4 MB. There was no memory consumed. Max. memory is 50.3 GB. 28.43/19.83 [2019-03-28 12:10:13,918 INFO L168 Benchmark]: CACSL2BoogieTranslator took 230.44 ms. Allocated memory is still 649.6 MB. Free memory was 565.0 MB in the beginning and 555.5 MB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 50.3 GB. 28.43/19.83 [2019-03-28 12:10:13,918 INFO L168 Benchmark]: Boogie Procedure Inliner took 97.80 ms. Allocated memory was 649.6 MB in the beginning and 672.7 MB in the end (delta: 23.1 MB). Free memory was 555.5 MB in the beginning and 638.0 MB in the end (delta: -82.5 MB). Peak memory consumption was 21.4 MB. Max. memory is 50.3 GB. 28.43/19.83 [2019-03-28 12:10:13,919 INFO L168 Benchmark]: Boogie Preprocessor took 19.22 ms. Allocated memory is still 672.7 MB. Free memory is still 638.0 MB. There was no memory consumed. Max. memory is 50.3 GB. 28.43/19.83 [2019-03-28 12:10:13,919 INFO L168 Benchmark]: RCFGBuilder took 239.67 ms. Allocated memory is still 672.7 MB. Free memory was 638.0 MB in the beginning and 619.5 MB in the end (delta: 18.5 MB). Peak memory consumption was 18.5 MB. Max. memory is 50.3 GB. 28.43/19.83 [2019-03-28 12:10:13,920 INFO L168 Benchmark]: BlockEncodingV2 took 93.95 ms. Allocated memory is still 672.7 MB. Free memory was 619.5 MB in the beginning and 614.1 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 50.3 GB. 28.43/19.83 [2019-03-28 12:10:13,920 INFO L168 Benchmark]: TraceAbstraction took 171.54 ms. Allocated memory is still 672.7 MB. Free memory was 614.1 MB in the beginning and 603.3 MB in the end (delta: 10.9 MB). Peak memory consumption was 10.9 MB. Max. memory is 50.3 GB. 28.43/19.83 [2019-03-28 12:10:13,921 INFO L168 Benchmark]: BuchiAutomizer took 14419.79 ms. Allocated memory was 672.7 MB in the beginning and 740.8 MB in the end (delta: 68.2 MB). Free memory was 603.3 MB in the beginning and 653.8 MB in the end (delta: -50.6 MB). Peak memory consumption was 17.6 MB. Max. memory is 50.3 GB. 28.43/19.83 [2019-03-28 12:10:13,925 INFO L337 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### 28.43/19.83 --- Results --- 28.43/19.83 * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: 28.43/19.83 - StatisticsResult: Initial Icfg 28.43/19.83 18 locations, 24 edges 28.43/19.83 - StatisticsResult: Encoded RCFG 28.43/19.83 12 locations, 17 edges 28.43/19.83 * Results from de.uni_freiburg.informatik.ultimate.core: 28.43/19.83 - StatisticsResult: Toolchain Benchmarks 28.43/19.83 Benchmark results are: 28.43/19.83 * CDTParser took 0.17 ms. Allocated memory is still 649.6 MB. Free memory is still 585.4 MB. There was no memory consumed. Max. memory is 50.3 GB. 28.43/19.83 * CACSL2BoogieTranslator took 230.44 ms. Allocated memory is still 649.6 MB. Free memory was 565.0 MB in the beginning and 555.5 MB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 50.3 GB. 28.43/19.83 * Boogie Procedure Inliner took 97.80 ms. Allocated memory was 649.6 MB in the beginning and 672.7 MB in the end (delta: 23.1 MB). Free memory was 555.5 MB in the beginning and 638.0 MB in the end (delta: -82.5 MB). Peak memory consumption was 21.4 MB. Max. memory is 50.3 GB. 28.43/19.83 * Boogie Preprocessor took 19.22 ms. Allocated memory is still 672.7 MB. Free memory is still 638.0 MB. There was no memory consumed. Max. memory is 50.3 GB. 28.43/19.83 * RCFGBuilder took 239.67 ms. Allocated memory is still 672.7 MB. Free memory was 638.0 MB in the beginning and 619.5 MB in the end (delta: 18.5 MB). Peak memory consumption was 18.5 MB. Max. memory is 50.3 GB. 28.43/19.83 * BlockEncodingV2 took 93.95 ms. Allocated memory is still 672.7 MB. Free memory was 619.5 MB in the beginning and 614.1 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 50.3 GB. 28.43/19.83 * TraceAbstraction took 171.54 ms. Allocated memory is still 672.7 MB. Free memory was 614.1 MB in the beginning and 603.3 MB in the end (delta: 10.9 MB). Peak memory consumption was 10.9 MB. Max. memory is 50.3 GB. 28.43/19.83 * BuchiAutomizer took 14419.79 ms. Allocated memory was 672.7 MB in the beginning and 740.8 MB in the end (delta: 68.2 MB). Free memory was 603.3 MB in the beginning and 653.8 MB in the end (delta: -50.6 MB). Peak memory consumption was 17.6 MB. Max. memory is 50.3 GB. 28.43/19.83 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: 28.43/19.83 - AllSpecificationsHoldResult: All specifications hold 28.43/19.83 We were not able to verify any specifiation because the program does not contain any specification. 28.43/19.83 - StatisticsResult: Ultimate Automizer benchmark data 28.43/19.83 CFG has 2 procedures, 12 locations, 0 error locations. SAFE Result, 0.1s OverallTime, 0 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=12occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 10 PreInvPairs, 10 NumberOfFragments, 4 HoareAnnotationTreeSize, 10 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 4 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: No data available, ReuseStatistics: No data available 28.43/19.83 - StatisticsResult: Constructed decomposition of program 28.43/19.83 Your program was decomposed into 5 terminating modules (3 trivial, 0 deterministic, 2 nondeterministic). One nondeterministic module has affine ranking function \old(n) and consists of 5 locations. One nondeterministic module has affine ranking function -1 * n and consists of 6 locations. 3 modules have a trivial ranking function, the largest among these consists of 5 locations. 28.43/19.83 - StatisticsResult: Timing statistics 28.43/19.83 BüchiAutomizer plugin needed 14.3s and 5 iterations. TraceHistogramMax:2. Analysis of lassos took 13.6s. Construction of modules took 0.0s. Büchi inclusion checks took 0.5s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 31 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 18 states and ocurred in iteration 3. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 43 SDtfs, 56 SDslu, 29 SDs, 0 SdLazy, 107 SolverSat, 17 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT1 conc0 concLT0 SILN0 SILU0 SILI1 SILT1 lasso0 LassoPreprocessingBenchmarks: Lassos: inital18 mio100 ax100 hnf100 lsp64 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq168 hnf92 smp100 dnf100 smp100 tf111 neg100 sie110 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 8ms VariablesStem: 0 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 7 LassoNonterminationAnalysisSatUnbounded: 2 LassoNonterminationAnalysisUnsat: 1 LassoNonterminationAnalysisUnknown: 1 LassoNonterminationAnalysisTime: 12.4s 28.43/19.83 - TerminationAnalysisResult: Termination proven 28.43/19.83 Buchi Automizer proved that your program is terminating 28.43/19.83 RESULT: Ultimate proved your program to be correct! 28.43/19.83 !SESSION 2019-03-28 12:09:55.354 ----------------------------------------------- 28.43/19.83 eclipse.buildId=unknown 28.43/19.83 java.version=1.8.0_181 28.43/19.83 java.vendor=Oracle Corporation 28.43/19.83 BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US 28.43/19.83 Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox/benchmark/theBenchmark.c 28.43/19.83 Command-line arguments: -os linux -ws gtk -arch x86_64 -consoleLog -data @user.home/.ultimate -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -data /export/starexec/sandbox/tmp -i /export/starexec/sandbox/benchmark/theBenchmark.c 28.43/19.83 28.43/19.83 !ENTRY org.eclipse.core.resources 2 10035 2019-03-28 12:10:14.157 28.43/19.83 !MESSAGE The workspace will exit with unsaved changes in this session. 28.43/19.83 Received shutdown request... 28.43/19.83 Ultimate: 28.43/19.83 GTK+ Version Check 28.43/19.83 EOF