25.50/15.63 YES 25.50/15.63 25.50/15.64 Ultimate: Cannot open display: 25.50/15.64 This is Ultimate 0.1.24-8dc7c08-m 25.50/15.64 [2019-03-28 12:22:16,563 INFO L170 SettingsManager]: Resetting all preferences to default values... 25.50/15.64 [2019-03-28 12:22:16,565 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values 25.50/15.64 [2019-03-28 12:22:16,577 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... 25.50/15.64 [2019-03-28 12:22:16,577 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values 25.50/15.64 [2019-03-28 12:22:16,578 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values 25.50/15.64 [2019-03-28 12:22:16,579 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values 25.50/15.64 [2019-03-28 12:22:16,581 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values 25.50/15.64 [2019-03-28 12:22:16,582 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values 25.50/15.64 [2019-03-28 12:22:16,583 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values 25.50/15.64 [2019-03-28 12:22:16,584 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... 25.50/15.64 [2019-03-28 12:22:16,584 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values 25.50/15.64 [2019-03-28 12:22:16,585 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values 25.50/15.64 [2019-03-28 12:22:16,586 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values 25.50/15.64 [2019-03-28 12:22:16,587 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values 25.50/15.64 [2019-03-28 12:22:16,588 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values 25.50/15.64 [2019-03-28 12:22:16,588 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values 25.50/15.64 [2019-03-28 12:22:16,590 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values 25.50/15.64 [2019-03-28 12:22:16,592 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values 25.50/15.64 [2019-03-28 12:22:16,593 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values 25.50/15.64 [2019-03-28 12:22:16,594 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values 25.50/15.64 [2019-03-28 12:22:16,595 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values 25.50/15.64 [2019-03-28 12:22:16,598 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... 25.50/15.64 [2019-03-28 12:22:16,598 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... 25.50/15.64 [2019-03-28 12:22:16,598 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values 25.50/15.64 [2019-03-28 12:22:16,599 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values 25.50/15.64 [2019-03-28 12:22:16,599 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values 25.50/15.64 [2019-03-28 12:22:16,600 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... 25.50/15.64 [2019-03-28 12:22:16,600 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values 25.50/15.64 [2019-03-28 12:22:16,601 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values 25.50/15.64 [2019-03-28 12:22:16,602 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values 25.50/15.64 [2019-03-28 12:22:16,602 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values 25.50/15.64 [2019-03-28 12:22:16,603 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... 25.50/15.64 [2019-03-28 12:22:16,604 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values 25.50/15.64 [2019-03-28 12:22:16,604 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... 25.50/15.64 [2019-03-28 12:22:16,604 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... 25.50/15.64 [2019-03-28 12:22:16,605 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values 25.50/15.64 [2019-03-28 12:22:16,606 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values 25.50/15.64 [2019-03-28 12:22:16,606 INFO L181 SettingsManager]: Finished resetting all preferences to default values... 25.50/15.64 [2019-03-28 12:22:16,606 INFO L98 SettingsManager]: Beginning loading settings from /export/starexec/sandbox2/solver/bin/./../termcomp2017.epf 25.50/15.64 [2019-03-28 12:22:16,621 INFO L110 SettingsManager]: Loading preferences was successful 25.50/15.64 [2019-03-28 12:22:16,621 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: 25.50/15.64 [2019-03-28 12:22:16,623 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: 25.50/15.64 [2019-03-28 12:22:16,623 INFO L133 SettingsManager]: * Rewrite not-equals=true 25.50/15.64 [2019-03-28 12:22:16,623 INFO L133 SettingsManager]: * Create parallel compositions if possible=false 25.50/15.64 [2019-03-28 12:22:16,623 INFO L133 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE 25.50/15.64 [2019-03-28 12:22:16,623 INFO L133 SettingsManager]: * Use SBE=true 25.50/15.64 [2019-03-28 12:22:16,624 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: 25.50/15.64 [2019-03-28 12:22:16,624 INFO L133 SettingsManager]: * Use old map elimination=false 25.50/15.64 [2019-03-28 12:22:16,624 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false 25.50/15.64 [2019-03-28 12:22:16,624 INFO L133 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION 25.50/15.64 [2019-03-28 12:22:16,624 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true 25.50/15.64 [2019-03-28 12:22:16,625 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES 25.50/15.64 [2019-03-28 12:22:16,625 INFO L133 SettingsManager]: * Construct termination proof for TermComp=true 25.50/15.64 [2019-03-28 12:22:16,625 INFO L133 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 25.50/15.64 [2019-03-28 12:22:16,625 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: 25.50/15.64 [2019-03-28 12:22:16,625 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false 25.50/15.64 [2019-03-28 12:22:16,625 INFO L133 SettingsManager]: * Check division by zero=IGNORE 25.50/15.64 [2019-03-28 12:22:16,626 INFO L133 SettingsManager]: * Check if freed pointer was valid=false 25.50/15.64 [2019-03-28 12:22:16,626 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false 25.50/15.64 [2019-03-28 12:22:16,626 INFO L133 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE 25.50/15.64 [2019-03-28 12:22:16,626 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: 25.50/15.64 [2019-03-28 12:22:16,626 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements 25.50/15.64 [2019-03-28 12:22:16,627 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump 25.50/15.64 [2019-03-28 12:22:16,627 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 25.50/15.64 [2019-03-28 12:22:16,627 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: 25.50/15.64 [2019-03-28 12:22:16,627 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles 25.50/15.64 [2019-03-28 12:22:16,627 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL 25.50/15.64 [2019-03-28 12:22:16,627 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 25.50/15.64 [2019-03-28 12:22:16,653 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp 25.50/15.64 [2019-03-28 12:22:16,666 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized 25.50/15.64 [2019-03-28 12:22:16,669 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. 25.50/15.64 [2019-03-28 12:22:16,670 INFO L271 PluginConnector]: Initializing CDTParser... 25.50/15.64 [2019-03-28 12:22:16,671 INFO L276 PluginConnector]: CDTParser initialized 25.50/15.64 [2019-03-28 12:22:16,672 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox2/benchmark/theBenchmark.c 25.50/15.64 [2019-03-28 12:22:16,733 INFO L221 CDTParser]: Created temporary CDT project at /export/starexec/sandbox2/tmp/1cd906fdba914cbe8380cf9d57c34835/FLAG10455490f 25.50/15.64 [2019-03-28 12:22:17,071 INFO L307 CDTParser]: Found 1 translation units. 25.50/15.64 [2019-03-28 12:22:17,072 INFO L161 CDTParser]: Scanning /export/starexec/sandbox2/benchmark/theBenchmark.c 25.50/15.64 [2019-03-28 12:22:17,079 INFO L355 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox2/tmp/1cd906fdba914cbe8380cf9d57c34835/FLAG10455490f 25.50/15.64 [2019-03-28 12:22:17,490 INFO L363 CDTParser]: Successfully deleted /export/starexec/sandbox2/tmp/1cd906fdba914cbe8380cf9d57c34835 25.50/15.64 [2019-03-28 12:22:17,502 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### 25.50/15.64 [2019-03-28 12:22:17,505 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. 25.50/15.64 [2019-03-28 12:22:17,506 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- 25.50/15.64 [2019-03-28 12:22:17,506 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... 25.50/15.64 [2019-03-28 12:22:17,509 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized 25.50/15.64 [2019-03-28 12:22:17,510 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 12:22:17" (1/1) ... 25.50/15.64 [2019-03-28 12:22:17,514 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@bdebb75 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:22:17, skipping insertion in model container 25.50/15.64 [2019-03-28 12:22:17,514 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 12:22:17" (1/1) ... 25.50/15.64 [2019-03-28 12:22:17,522 INFO L145 MainTranslator]: Starting translation in SV-COMP mode 25.50/15.64 [2019-03-28 12:22:17,540 INFO L176 MainTranslator]: Built tables and reachable declarations 25.50/15.64 [2019-03-28 12:22:17,705 INFO L206 PostProcessor]: Analyzing one entry point: main 25.50/15.64 [2019-03-28 12:22:17,710 INFO L191 MainTranslator]: Completed pre-run 25.50/15.64 [2019-03-28 12:22:17,728 INFO L206 PostProcessor]: Analyzing one entry point: main 25.50/15.64 [2019-03-28 12:22:17,804 INFO L195 MainTranslator]: Completed translation 25.50/15.64 [2019-03-28 12:22:17,805 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:22:17 WrapperNode 25.50/15.64 [2019-03-28 12:22:17,805 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- 25.50/15.64 [2019-03-28 12:22:17,806 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- 25.50/15.64 [2019-03-28 12:22:17,806 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... 25.50/15.64 [2019-03-28 12:22:17,806 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized 25.50/15.64 [2019-03-28 12:22:17,816 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:22:17" (1/1) ... 25.50/15.64 [2019-03-28 12:22:17,822 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:22:17" (1/1) ... 25.50/15.64 [2019-03-28 12:22:17,842 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- 25.50/15.64 [2019-03-28 12:22:17,843 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- 25.50/15.64 [2019-03-28 12:22:17,843 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... 25.50/15.64 [2019-03-28 12:22:17,843 INFO L276 PluginConnector]: Boogie Preprocessor initialized 25.50/15.64 [2019-03-28 12:22:17,853 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:22:17" (1/1) ... 25.50/15.64 [2019-03-28 12:22:17,853 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:22:17" (1/1) ... 25.50/15.64 [2019-03-28 12:22:17,854 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:22:17" (1/1) ... 25.50/15.64 [2019-03-28 12:22:17,854 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:22:17" (1/1) ... 25.50/15.64 [2019-03-28 12:22:17,856 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:22:17" (1/1) ... 25.50/15.64 [2019-03-28 12:22:17,859 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:22:17" (1/1) ... 25.50/15.64 [2019-03-28 12:22:17,860 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:22:17" (1/1) ... 25.50/15.64 [2019-03-28 12:22:17,861 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- 25.50/15.64 [2019-03-28 12:22:17,862 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- 25.50/15.64 [2019-03-28 12:22:17,862 INFO L271 PluginConnector]: Initializing RCFGBuilder... 25.50/15.64 [2019-03-28 12:22:17,862 INFO L276 PluginConnector]: RCFGBuilder initialized 25.50/15.64 [2019-03-28 12:22:17,863 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:22:17" (1/1) ... 25.50/15.64 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 25.50/15.64 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) 25.50/15.64 Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 25.50/15.64 [2019-03-28 12:22:17,929 INFO L130 BoogieDeclarations]: Found specification of procedure isEven 25.50/15.64 [2019-03-28 12:22:17,930 INFO L138 BoogieDeclarations]: Found implementation of procedure isEven 25.50/15.64 [2019-03-28 12:22:17,930 INFO L130 BoogieDeclarations]: Found specification of procedure isOdd 25.50/15.64 [2019-03-28 12:22:17,930 INFO L138 BoogieDeclarations]: Found implementation of procedure isOdd 25.50/15.64 [2019-03-28 12:22:17,930 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start 25.50/15.64 [2019-03-28 12:22:17,930 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start 25.50/15.64 [2019-03-28 12:22:18,096 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) 25.50/15.64 [2019-03-28 12:22:18,097 INFO L286 CfgBuilder]: Removed 4 assue(true) statements. 25.50/15.64 [2019-03-28 12:22:18,098 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:22:18 BoogieIcfgContainer 25.50/15.64 [2019-03-28 12:22:18,099 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- 25.50/15.64 [2019-03-28 12:22:18,099 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- 25.50/15.64 [2019-03-28 12:22:18,099 INFO L271 PluginConnector]: Initializing BlockEncodingV2... 25.50/15.64 [2019-03-28 12:22:18,102 INFO L276 PluginConnector]: BlockEncodingV2 initialized 25.50/15.64 [2019-03-28 12:22:18,103 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:22:18" (1/1) ... 25.50/15.64 [2019-03-28 12:22:18,120 INFO L313 BlockEncoder]: Initial Icfg 23 locations, 29 edges 25.50/15.64 [2019-03-28 12:22:18,122 INFO L258 BlockEncoder]: Using Remove infeasible edges 25.50/15.64 [2019-03-28 12:22:18,122 INFO L263 BlockEncoder]: Using Maximize final states 25.50/15.64 [2019-03-28 12:22:18,123 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false 25.50/15.64 [2019-03-28 12:22:18,123 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE 25.50/15.64 [2019-03-28 12:22:18,126 INFO L296 BlockEncoder]: Using Remove sink states 25.50/15.64 [2019-03-28 12:22:18,127 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true 25.50/15.64 [2019-03-28 12:22:18,127 INFO L179 BlockEncoder]: Using Rewrite not-equals 25.50/15.64 [2019-03-28 12:22:18,146 INFO L185 BlockEncoder]: Using Use SBE 25.50/15.64 [2019-03-28 12:22:18,169 INFO L200 BlockEncoder]: SBE split 7 edges 25.50/15.64 [2019-03-28 12:22:18,173 INFO L70 emoveInfeasibleEdges]: Removed 1 edges and 0 locations because of local infeasibility 25.50/15.64 [2019-03-28 12:22:18,175 INFO L71 MaximizeFinalStates]: 0 new accepting states 25.50/15.64 [2019-03-28 12:22:18,184 INFO L100 BaseMinimizeStates]: Removed 2 edges and 1 locations by large block encoding 25.50/15.64 [2019-03-28 12:22:18,186 INFO L70 RemoveSinkStates]: Removed 11 edges and 5 locations by removing sink states 25.50/15.64 [2019-03-28 12:22:18,188 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility 25.50/15.64 [2019-03-28 12:22:18,189 INFO L71 MaximizeFinalStates]: 0 new accepting states 25.50/15.64 [2019-03-28 12:22:18,194 INFO L100 BaseMinimizeStates]: Removed 2 edges and 1 locations by large block encoding 25.50/15.64 [2019-03-28 12:22:18,194 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states 25.50/15.64 [2019-03-28 12:22:18,195 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility 25.50/15.64 [2019-03-28 12:22:18,195 INFO L71 MaximizeFinalStates]: 0 new accepting states 25.50/15.64 [2019-03-28 12:22:18,195 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding 25.50/15.64 [2019-03-28 12:22:18,196 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states 25.50/15.64 [2019-03-28 12:22:18,196 INFO L313 BlockEncoder]: Encoded RCFG 16 locations, 24 edges 25.50/15.64 [2019-03-28 12:22:18,197 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:22:18 BasicIcfg 25.50/15.64 [2019-03-28 12:22:18,197 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- 25.50/15.64 [2019-03-28 12:22:18,198 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- 25.50/15.64 [2019-03-28 12:22:18,198 INFO L271 PluginConnector]: Initializing TraceAbstraction... 25.50/15.64 [2019-03-28 12:22:18,204 INFO L276 PluginConnector]: TraceAbstraction initialized 25.50/15.64 [2019-03-28 12:22:18,204 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.03 12:22:17" (1/4) ... 25.50/15.64 [2019-03-28 12:22:18,205 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1161370e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 12:22:18, skipping insertion in model container 25.50/15.64 [2019-03-28 12:22:18,205 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:22:17" (2/4) ... 25.50/15.64 [2019-03-28 12:22:18,206 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1161370e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 12:22:18, skipping insertion in model container 25.50/15.64 [2019-03-28 12:22:18,206 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:22:18" (3/4) ... 25.50/15.64 [2019-03-28 12:22:18,207 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1161370e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:22:18, skipping insertion in model container 25.50/15.64 [2019-03-28 12:22:18,207 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:22:18" (4/4) ... 25.50/15.64 [2019-03-28 12:22:18,209 INFO L112 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 25.50/15.64 [2019-03-28 12:22:18,219 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION 25.50/15.64 [2019-03-28 12:22:18,226 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 0 error locations. 25.50/15.64 [2019-03-28 12:22:18,243 INFO L257 AbstractCegarLoop]: Starting to check reachability of 0 error locations. 25.50/15.64 [2019-03-28 12:22:18,272 INFO L133 ementStrategyFactory]: Using default assertion order modulation 25.50/15.64 [2019-03-28 12:22:18,273 INFO L382 AbstractCegarLoop]: Interprodecural is true 25.50/15.64 [2019-03-28 12:22:18,273 INFO L383 AbstractCegarLoop]: Hoare is true 25.50/15.64 [2019-03-28 12:22:18,274 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates 25.50/15.64 [2019-03-28 12:22:18,274 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE 25.50/15.64 [2019-03-28 12:22:18,274 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION 25.50/15.64 [2019-03-28 12:22:18,274 INFO L387 AbstractCegarLoop]: Difference is false 25.50/15.64 [2019-03-28 12:22:18,274 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA 25.50/15.64 [2019-03-28 12:22:18,274 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== 25.50/15.64 [2019-03-28 12:22:18,292 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states. 25.50/15.64 [2019-03-28 12:22:18,298 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. 25.50/15.64 [2019-03-28 12:22:18,304 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 16 states. 25.50/15.64 [2019-03-28 12:22:18,362 INFO L451 ceAbstractionStarter]: At program point L32(line 32) the Hoare annotation is: true 25.50/15.64 [2019-03-28 12:22:18,362 INFO L448 ceAbstractionStarter]: For program point L32-1(line 32) no Hoare annotation was computed. 25.50/15.64 [2019-03-28 12:22:18,362 INFO L448 ceAbstractionStarter]: For program point L29(lines 29 33) no Hoare annotation was computed. 25.50/15.64 [2019-03-28 12:22:18,362 INFO L448 ceAbstractionStarter]: For program point isEvenEXIT(lines 26 34) no Hoare annotation was computed. 25.50/15.64 [2019-03-28 12:22:18,363 INFO L448 ceAbstractionStarter]: For program point L27(lines 27 33) no Hoare annotation was computed. 25.50/15.64 [2019-03-28 12:22:18,363 INFO L448 ceAbstractionStarter]: For program point isEvenFINAL(lines 26 34) no Hoare annotation was computed. 25.50/15.64 [2019-03-28 12:22:18,363 INFO L451 ceAbstractionStarter]: At program point isEvenENTRY(lines 26 34) the Hoare annotation is: true 25.50/15.64 [2019-03-28 12:22:18,363 INFO L448 ceAbstractionStarter]: For program point L17(lines 17 23) no Hoare annotation was computed. 25.50/15.64 [2019-03-28 12:22:18,363 INFO L448 ceAbstractionStarter]: For program point isOddFINAL(lines 16 24) no Hoare annotation was computed. 25.50/15.64 [2019-03-28 12:22:18,364 INFO L451 ceAbstractionStarter]: At program point isOddENTRY(lines 16 24) the Hoare annotation is: true 25.50/15.64 [2019-03-28 12:22:18,364 INFO L451 ceAbstractionStarter]: At program point L22(line 22) the Hoare annotation is: true 25.50/15.64 [2019-03-28 12:22:18,364 INFO L448 ceAbstractionStarter]: For program point L22-1(line 22) no Hoare annotation was computed. 25.50/15.64 [2019-03-28 12:22:18,364 INFO L448 ceAbstractionStarter]: For program point isOddEXIT(lines 16 24) no Hoare annotation was computed. 25.50/15.64 [2019-03-28 12:22:18,364 INFO L448 ceAbstractionStarter]: For program point L19(lines 19 23) no Hoare annotation was computed. 25.50/15.64 [2019-03-28 12:22:18,364 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. 25.50/15.64 [2019-03-28 12:22:18,365 INFO L451 ceAbstractionStarter]: At program point L42(line 42) the Hoare annotation is: true 25.50/15.64 [2019-03-28 12:22:18,368 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:22:18 BasicIcfg 25.50/15.64 [2019-03-28 12:22:18,369 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- 25.50/15.64 [2019-03-28 12:22:18,369 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- 25.50/15.64 [2019-03-28 12:22:18,369 INFO L271 PluginConnector]: Initializing BuchiAutomizer... 25.50/15.64 [2019-03-28 12:22:18,373 INFO L276 PluginConnector]: BuchiAutomizer initialized 25.50/15.64 [2019-03-28 12:22:18,374 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 25.50/15.64 [2019-03-28 12:22:18,374 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.03 12:22:17" (1/5) ... 25.50/15.64 [2019-03-28 12:22:18,375 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@76f36513 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.03 12:22:18, skipping insertion in model container 25.50/15.64 [2019-03-28 12:22:18,375 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 25.50/15.64 [2019-03-28 12:22:18,375 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:22:17" (2/5) ... 25.50/15.64 [2019-03-28 12:22:18,376 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@76f36513 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.03 12:22:18, skipping insertion in model container 25.50/15.64 [2019-03-28 12:22:18,376 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 25.50/15.64 [2019-03-28 12:22:18,376 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:22:18" (3/5) ... 25.50/15.64 [2019-03-28 12:22:18,376 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@76f36513 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:22:18, skipping insertion in model container 25.50/15.64 [2019-03-28 12:22:18,377 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 25.50/15.64 [2019-03-28 12:22:18,377 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:22:18" (4/5) ... 25.50/15.64 [2019-03-28 12:22:18,377 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@76f36513 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:22:18, skipping insertion in model container 25.50/15.64 [2019-03-28 12:22:18,377 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 25.50/15.64 [2019-03-28 12:22:18,377 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:22:18" (5/5) ... 25.50/15.64 [2019-03-28 12:22:18,379 INFO L375 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 25.50/15.64 [2019-03-28 12:22:18,408 INFO L133 ementStrategyFactory]: Using default assertion order modulation 25.50/15.64 [2019-03-28 12:22:18,408 INFO L374 BuchiCegarLoop]: Interprodecural is true 25.50/15.64 [2019-03-28 12:22:18,409 INFO L375 BuchiCegarLoop]: Hoare is true 25.50/15.64 [2019-03-28 12:22:18,409 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates 25.50/15.64 [2019-03-28 12:22:18,409 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE 25.50/15.64 [2019-03-28 12:22:18,409 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION 25.50/15.64 [2019-03-28 12:22:18,409 INFO L379 BuchiCegarLoop]: Difference is false 25.50/15.64 [2019-03-28 12:22:18,409 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA 25.50/15.64 [2019-03-28 12:22:18,410 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== 25.50/15.64 [2019-03-28 12:22:18,413 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states. 25.50/15.64 [2019-03-28 12:22:18,432 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 25.50/15.64 [2019-03-28 12:22:18,433 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 25.50/15.64 [2019-03-28 12:22:18,433 INFO L119 BuchiIsEmpty]: Starting construction of run 25.50/15.64 [2019-03-28 12:22:18,440 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] 25.50/15.64 [2019-03-28 12:22:18,440 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] 25.50/15.64 [2019-03-28 12:22:18,441 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ 25.50/15.64 [2019-03-28 12:22:18,441 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states. 25.50/15.64 [2019-03-28 12:22:18,443 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 25.50/15.64 [2019-03-28 12:22:18,443 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 25.50/15.64 [2019-03-28 12:22:18,443 INFO L119 BuchiIsEmpty]: Starting construction of run 25.50/15.64 [2019-03-28 12:22:18,443 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] 25.50/15.64 [2019-03-28 12:22:18,443 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] 25.50/15.64 [2019-03-28 12:22:18,449 INFO L794 eck$LassoCheckResult]: Stem: 11#ULTIMATE.startENTRYtrue [102] ULTIMATE.startENTRY-->L42: Formula: (<= 0 v_ULTIMATE.start_main_~n~0_9) InVars {} OutVars{ULTIMATE.start_main_~mod~0=v_ULTIMATE.start_main_~mod~0_5, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_6|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_6|, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_9, ULTIMATE.start_main_#t~ret3=|v_ULTIMATE.start_main_#t~ret3_6|, ULTIMATE.start_main_~result~0=v_ULTIMATE.start_main_~result~0_5} AuxVars[] AssignedVars[ULTIMATE.start_main_~mod~0, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#res, ULTIMATE.start_main_~n~0, ULTIMATE.start_main_#t~ret3, ULTIMATE.start_main_~result~0] 9#L42true [61] L42-->isOddENTRY: Formula: (= |v_isOdd_#in~nInParam_2| v_ULTIMATE.start_main_~n~0_8) InVars {ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_8} OutVars{isOdd_#in~n=|v_isOdd_#in~nInParam_2|} AuxVars[] AssignedVars[isOdd_#in~n]< 16#isOddENTRYtrue 25.50/15.64 [2019-03-28 12:22:18,450 INFO L796 eck$LassoCheckResult]: Loop: 16#isOddENTRYtrue [71] isOddENTRY-->L17: Formula: (= v_isOdd_~n_5 |v_isOdd_#in~n_1|) InVars {isOdd_#in~n=|v_isOdd_#in~n_1|} OutVars{isOdd_#in~n=|v_isOdd_#in~n_1|, isOdd_~n=v_isOdd_~n_5} AuxVars[] AssignedVars[isOdd_~n] 14#L17true [85] L17-->L19: Formula: (> 0 v_isOdd_~n_1) InVars {isOdd_~n=v_isOdd_~n_1} OutVars{isOdd_~n=v_isOdd_~n_1} AuxVars[] AssignedVars[] 10#L19true [87] L19-->L22: Formula: (> 1 v_isOdd_~n_3) InVars {isOdd_~n=v_isOdd_~n_3} OutVars{isOdd_~n=v_isOdd_~n_3} AuxVars[] AssignedVars[] 4#L22true [55] L22-->isEvenENTRY: Formula: (= |v_isEven_#in~nInParam_1| (+ v_isOdd_~n_7 (- 1))) InVars {isOdd_~n=v_isOdd_~n_7} OutVars{isEven_#in~n=|v_isEven_#in~nInParam_1|} AuxVars[] AssignedVars[isEven_#in~n]< 5#isEvenENTRYtrue [56] isEvenENTRY-->L27: Formula: (= v_isEven_~n_1 |v_isEven_#in~n_1|) InVars {isEven_#in~n=|v_isEven_#in~n_1|} OutVars{isEven_~n=v_isEven_~n_1, isEven_#in~n=|v_isEven_#in~n_1|} AuxVars[] AssignedVars[isEven_~n] 3#L27true [97] L27-->L29: Formula: (> 0 v_isEven_~n_3) InVars {isEven_~n=v_isEven_~n_3} OutVars{isEven_~n=v_isEven_~n_3} AuxVars[] AssignedVars[] 6#L29true [99] L29-->L32: Formula: (< 1 v_isEven_~n_5) InVars {isEven_~n=v_isEven_~n_5} OutVars{isEven_~n=v_isEven_~n_5} AuxVars[] AssignedVars[] 17#L32true [72] L32-->isOddENTRY: Formula: (= |v_isOdd_#in~nInParam_1| (+ v_isEven_~n_7 (- 1))) InVars {isEven_~n=v_isEven_~n_7} OutVars{isOdd_#in~n=|v_isOdd_#in~nInParam_1|} AuxVars[] AssignedVars[isOdd_#in~n]< 16#isOddENTRYtrue 25.50/15.64 [2019-03-28 12:22:18,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 25.50/15.64 [2019-03-28 12:22:18,456 INFO L82 PathProgramCache]: Analyzing trace with hash 4184, now seen corresponding path program 1 times 25.50/15.64 [2019-03-28 12:22:18,458 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 25.50/15.64 [2019-03-28 12:22:18,458 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 25.50/15.64 [2019-03-28 12:22:18,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.50/15.64 [2019-03-28 12:22:18,478 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 25.50/15.64 [2019-03-28 12:22:18,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.50/15.64 [2019-03-28 12:22:18,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 25.50/15.64 [2019-03-28 12:22:18,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 25.50/15.64 [2019-03-28 12:22:18,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 25.50/15.64 [2019-03-28 12:22:18,528 INFO L82 PathProgramCache]: Analyzing trace with hash -1950276259, now seen corresponding path program 1 times 25.50/15.64 [2019-03-28 12:22:18,528 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 25.50/15.64 [2019-03-28 12:22:18,528 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 25.50/15.64 [2019-03-28 12:22:18,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.50/15.64 [2019-03-28 12:22:18,530 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 25.50/15.64 [2019-03-28 12:22:18,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.50/15.64 [2019-03-28 12:22:18,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 25.50/15.64 [2019-03-28 12:22:18,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 25.50/15.64 [2019-03-28 12:22:18,581 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 25.50/15.64 [2019-03-28 12:22:18,581 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 25.50/15.64 [2019-03-28 12:22:18,585 INFO L811 eck$LassoCheckResult]: loop already infeasible 25.50/15.64 [2019-03-28 12:22:18,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 25.50/15.64 [2019-03-28 12:22:18,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 25.50/15.64 [2019-03-28 12:22:18,602 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 3 states. 25.50/15.64 [2019-03-28 12:22:18,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 25.50/15.64 [2019-03-28 12:22:18,650 INFO L93 Difference]: Finished difference Result 21 states and 30 transitions. 25.50/15.64 [2019-03-28 12:22:18,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 25.50/15.64 [2019-03-28 12:22:18,654 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 30 transitions. 25.50/15.64 [2019-03-28 12:22:18,659 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 25.50/15.64 [2019-03-28 12:22:18,664 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 12 states and 16 transitions. 25.50/15.64 [2019-03-28 12:22:18,665 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 25.50/15.64 [2019-03-28 12:22:18,665 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 25.50/15.64 [2019-03-28 12:22:18,666 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 16 transitions. 25.50/15.64 [2019-03-28 12:22:18,666 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 25.50/15.64 [2019-03-28 12:22:18,666 INFO L706 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. 25.50/15.64 [2019-03-28 12:22:18,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 16 transitions. 25.50/15.64 [2019-03-28 12:22:18,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 11. 25.50/15.64 [2019-03-28 12:22:18,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. 25.50/15.64 [2019-03-28 12:22:18,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 15 transitions. 25.50/15.64 [2019-03-28 12:22:18,697 INFO L729 BuchiCegarLoop]: Abstraction has 11 states and 15 transitions. 25.50/15.64 [2019-03-28 12:22:18,697 INFO L609 BuchiCegarLoop]: Abstraction has 11 states and 15 transitions. 25.50/15.64 [2019-03-28 12:22:18,697 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ 25.50/15.64 [2019-03-28 12:22:18,697 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 15 transitions. 25.50/15.64 [2019-03-28 12:22:18,698 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 25.50/15.64 [2019-03-28 12:22:18,698 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 25.50/15.64 [2019-03-28 12:22:18,698 INFO L119 BuchiIsEmpty]: Starting construction of run 25.50/15.64 [2019-03-28 12:22:18,699 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] 25.50/15.64 [2019-03-28 12:22:18,699 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] 25.50/15.64 [2019-03-28 12:22:18,699 INFO L794 eck$LassoCheckResult]: Stem: 51#ULTIMATE.startENTRY [102] ULTIMATE.startENTRY-->L42: Formula: (<= 0 v_ULTIMATE.start_main_~n~0_9) InVars {} OutVars{ULTIMATE.start_main_~mod~0=v_ULTIMATE.start_main_~mod~0_5, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_6|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_6|, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_9, ULTIMATE.start_main_#t~ret3=|v_ULTIMATE.start_main_#t~ret3_6|, ULTIMATE.start_main_~result~0=v_ULTIMATE.start_main_~result~0_5} AuxVars[] AssignedVars[ULTIMATE.start_main_~mod~0, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#res, ULTIMATE.start_main_~n~0, ULTIMATE.start_main_#t~ret3, ULTIMATE.start_main_~result~0] 46#L42 [61] L42-->isOddENTRY: Formula: (= |v_isOdd_#in~nInParam_2| v_ULTIMATE.start_main_~n~0_8) InVars {ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_8} OutVars{isOdd_#in~n=|v_isOdd_#in~nInParam_2|} AuxVars[] AssignedVars[isOdd_#in~n]< 47#isOddENTRY 25.50/15.64 [2019-03-28 12:22:18,700 INFO L796 eck$LassoCheckResult]: Loop: 47#isOddENTRY [71] isOddENTRY-->L17: Formula: (= v_isOdd_~n_5 |v_isOdd_#in~n_1|) InVars {isOdd_#in~n=|v_isOdd_#in~n_1|} OutVars{isOdd_#in~n=|v_isOdd_#in~n_1|, isOdd_~n=v_isOdd_~n_5} AuxVars[] AssignedVars[isOdd_~n] 52#L17 [85] L17-->L19: Formula: (> 0 v_isOdd_~n_1) InVars {isOdd_~n=v_isOdd_~n_1} OutVars{isOdd_~n=v_isOdd_~n_1} AuxVars[] AssignedVars[] 48#L19 [87] L19-->L22: Formula: (> 1 v_isOdd_~n_3) InVars {isOdd_~n=v_isOdd_~n_3} OutVars{isOdd_~n=v_isOdd_~n_3} AuxVars[] AssignedVars[] 50#L22 [55] L22-->isEvenENTRY: Formula: (= |v_isEven_#in~nInParam_1| (+ v_isOdd_~n_7 (- 1))) InVars {isOdd_~n=v_isOdd_~n_7} OutVars{isEven_#in~n=|v_isEven_#in~nInParam_1|} AuxVars[] AssignedVars[isEven_#in~n]< 56#isEvenENTRY [56] isEvenENTRY-->L27: Formula: (= v_isEven_~n_1 |v_isEven_#in~n_1|) InVars {isEven_#in~n=|v_isEven_#in~n_1|} OutVars{isEven_~n=v_isEven_~n_1, isEven_#in~n=|v_isEven_#in~n_1|} AuxVars[] AssignedVars[isEven_~n] 53#L27 [97] L27-->L29: Formula: (> 0 v_isEven_~n_3) InVars {isEven_~n=v_isEven_~n_3} OutVars{isEven_~n=v_isEven_~n_3} AuxVars[] AssignedVars[] 54#L29 [100] L29-->L32: Formula: (> 1 v_isEven_~n_5) InVars {isEven_~n=v_isEven_~n_5} OutVars{isEven_~n=v_isEven_~n_5} AuxVars[] AssignedVars[] 49#L32 [72] L32-->isOddENTRY: Formula: (= |v_isOdd_#in~nInParam_1| (+ v_isEven_~n_7 (- 1))) InVars {isEven_~n=v_isEven_~n_7} OutVars{isOdd_#in~n=|v_isOdd_#in~nInParam_1|} AuxVars[] AssignedVars[isOdd_#in~n]< 47#isOddENTRY 25.50/15.64 [2019-03-28 12:22:18,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 25.50/15.64 [2019-03-28 12:22:18,700 INFO L82 PathProgramCache]: Analyzing trace with hash 4184, now seen corresponding path program 2 times 25.50/15.64 [2019-03-28 12:22:18,700 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 25.50/15.64 [2019-03-28 12:22:18,700 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 25.50/15.64 [2019-03-28 12:22:18,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.50/15.64 [2019-03-28 12:22:18,702 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 25.50/15.64 [2019-03-28 12:22:18,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.50/15.64 [2019-03-28 12:22:18,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 25.50/15.64 [2019-03-28 12:22:18,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 25.50/15.64 [2019-03-28 12:22:18,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 25.50/15.64 [2019-03-28 12:22:18,707 INFO L82 PathProgramCache]: Analyzing trace with hash -1950276228, now seen corresponding path program 1 times 25.50/15.64 [2019-03-28 12:22:18,707 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 25.50/15.64 [2019-03-28 12:22:18,707 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 25.50/15.64 [2019-03-28 12:22:18,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.50/15.64 [2019-03-28 12:22:18,708 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 25.50/15.64 [2019-03-28 12:22:18,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.50/15.64 [2019-03-28 12:22:18,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 25.50/15.64 [2019-03-28 12:22:18,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 25.50/15.64 [2019-03-28 12:22:18,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 25.50/15.64 [2019-03-28 12:22:18,720 INFO L82 PathProgramCache]: Analyzing trace with hash 905113299, now seen corresponding path program 1 times 25.50/15.64 [2019-03-28 12:22:18,720 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 25.50/15.64 [2019-03-28 12:22:18,720 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 25.50/15.64 [2019-03-28 12:22:18,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.50/15.64 [2019-03-28 12:22:18,721 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 25.50/15.64 [2019-03-28 12:22:18,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.50/15.64 [2019-03-28 12:22:18,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 25.50/15.64 [2019-03-28 12:22:18,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 25.50/15.64 [2019-03-28 12:22:18,750 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 25.50/15.64 [2019-03-28 12:22:18,751 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 25.50/15.64 [2019-03-28 12:22:18,907 INFO L216 LassoAnalysis]: Preferences: 25.50/15.64 [2019-03-28 12:22:18,909 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 25.50/15.64 [2019-03-28 12:22:18,909 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 25.50/15.64 [2019-03-28 12:22:18,909 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 25.50/15.64 [2019-03-28 12:22:18,909 INFO L127 ssoRankerPreferences]: Use exernal solver: true 25.50/15.64 [2019-03-28 12:22:18,909 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 25.50/15.64 [2019-03-28 12:22:18,910 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 25.50/15.64 [2019-03-28 12:22:18,910 INFO L130 ssoRankerPreferences]: Path of dumped script: 25.50/15.64 [2019-03-28 12:22:18,910 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration2_Loop 25.50/15.64 [2019-03-28 12:22:18,910 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 25.50/15.64 [2019-03-28 12:22:18,910 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 25.50/15.64 [2019-03-28 12:22:18,929 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.50/15.64 [2019-03-28 12:22:18,935 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.50/15.64 [2019-03-28 12:22:18,938 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.50/15.64 [2019-03-28 12:22:18,940 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.50/15.64 [2019-03-28 12:22:18,942 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.50/15.64 [2019-03-28 12:22:18,957 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.50/15.64 [2019-03-28 12:22:18,960 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.50/15.64 [2019-03-28 12:22:18,963 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.50/15.64 [2019-03-28 12:22:19,009 INFO L300 LassoAnalysis]: Preprocessing complete. 25.50/15.64 [2019-03-28 12:22:19,010 INFO L412 LassoAnalysis]: Checking for nontermination... 25.50/15.64 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 25.50/15.64 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 25.50/15.64 Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 25.50/15.64 [2019-03-28 12:22:19,038 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 25.50/15.64 [2019-03-28 12:22:19,039 INFO L163 nArgumentSynthesizer]: Using integer mode. 25.50/15.64 [2019-03-28 12:22:19,048 INFO L445 LassoAnalysis]: Proved nontermination for one component. 25.50/15.64 [2019-03-28 12:22:19,048 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {isEven_~n=0} Honda state: {isEven_~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 25.50/15.64 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 25.50/15.64 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 25.50/15.64 Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 25.50/15.64 [2019-03-28 12:22:19,079 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 25.50/15.64 [2019-03-28 12:22:19,079 INFO L163 nArgumentSynthesizer]: Using integer mode. 25.50/15.64 [2019-03-28 12:22:19,083 INFO L445 LassoAnalysis]: Proved nontermination for one component. 25.50/15.64 [2019-03-28 12:22:19,083 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {isEven_#in~n=0} Honda state: {isEven_#in~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 25.50/15.64 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 25.50/15.64 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 25.50/15.64 Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 25.50/15.64 [2019-03-28 12:22:19,110 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 25.50/15.64 [2019-03-28 12:22:19,110 INFO L163 nArgumentSynthesizer]: Using integer mode. 25.50/15.64 [2019-03-28 12:22:19,114 INFO L445 LassoAnalysis]: Proved nontermination for one component. 25.50/15.64 [2019-03-28 12:22:19,114 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {isOdd_#t~ret0=0} Honda state: {isOdd_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 25.50/15.64 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 25.50/15.64 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 25.50/15.64 Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 25.50/15.64 [2019-03-28 12:22:19,141 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 25.50/15.64 [2019-03-28 12:22:19,141 INFO L163 nArgumentSynthesizer]: Using integer mode. 25.50/15.64 [2019-03-28 12:22:19,145 INFO L445 LassoAnalysis]: Proved nontermination for one component. 25.50/15.64 [2019-03-28 12:22:19,145 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {isOdd_#res=0} Honda state: {isOdd_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 25.50/15.64 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 25.50/15.64 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 25.50/15.64 Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 25.50/15.64 [2019-03-28 12:22:19,173 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 25.50/15.64 [2019-03-28 12:22:19,173 INFO L163 nArgumentSynthesizer]: Using integer mode. 25.50/15.64 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 25.50/15.64 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 25.50/15.64 Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 25.50/15.64 [2019-03-28 12:22:19,204 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 25.50/15.64 [2019-03-28 12:22:19,204 INFO L163 nArgumentSynthesizer]: Using integer mode. 25.50/15.64 [2019-03-28 12:22:19,270 INFO L445 LassoAnalysis]: Proved nontermination for one component. 25.50/15.64 [2019-03-28 12:22:19,270 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {isOdd_#in~n=-6} Honda state: {isOdd_#in~n=-6} Generalized eigenvectors: [{isOdd_#in~n=0}, {isOdd_#in~n=-2}, {isOdd_#in~n=0}] Lambdas: [1, 1, 0] Nus: [0, 0] 25.50/15.64 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 25.50/15.64 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 25.50/15.64 Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 25.50/15.64 [2019-03-28 12:22:19,299 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 25.50/15.64 [2019-03-28 12:22:19,300 INFO L163 nArgumentSynthesizer]: Using integer mode. 25.50/15.64 [2019-03-28 12:22:19,303 INFO L445 LassoAnalysis]: Proved nontermination for one component. 25.50/15.64 [2019-03-28 12:22:19,303 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {isEven_#res=0} Honda state: {isEven_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 25.50/15.64 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 25.50/15.64 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 25.50/15.64 Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 25.50/15.64 [2019-03-28 12:22:19,330 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 25.50/15.64 [2019-03-28 12:22:19,330 INFO L163 nArgumentSynthesizer]: Using integer mode. 25.50/15.64 [2019-03-28 12:22:19,334 INFO L445 LassoAnalysis]: Proved nontermination for one component. 25.50/15.64 [2019-03-28 12:22:19,334 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {isEven_#t~ret1=0} Honda state: {isEven_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 25.50/15.64 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 25.50/15.64 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 25.50/15.64 Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 25.50/15.64 [2019-03-28 12:22:19,362 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 25.50/15.64 [2019-03-28 12:22:19,362 INFO L163 nArgumentSynthesizer]: Using integer mode. 25.50/15.64 [2019-03-28 12:22:19,366 INFO L445 LassoAnalysis]: Proved nontermination for one component. 25.50/15.64 [2019-03-28 12:22:19,366 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {isOdd_~n=0} Honda state: {isOdd_~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 25.50/15.64 [2019-03-28 12:22:19,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. 25.50/15.64 [2019-03-28 12:22:19,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 25.50/15.64 [2019-03-28 12:22:19,391 INFO L87 Difference]: Start difference. First operand 11 states and 15 transitions. cyclomatic complexity: 5 Second operand 5 states. 25.50/15.64 [2019-03-28 12:22:19,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 25.50/15.64 [2019-03-28 12:22:19,437 INFO L93 Difference]: Finished difference Result 17 states and 23 transitions. 25.50/15.64 [2019-03-28 12:22:19,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 25.50/15.64 [2019-03-28 12:22:19,438 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 23 transitions. 25.50/15.64 [2019-03-28 12:22:19,439 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 25.50/15.64 [2019-03-28 12:22:19,440 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 17 states and 23 transitions. 25.50/15.64 [2019-03-28 12:22:19,440 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 25.50/15.64 [2019-03-28 12:22:19,441 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 25.50/15.64 [2019-03-28 12:22:19,441 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 23 transitions. 25.50/15.64 [2019-03-28 12:22:19,441 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 25.50/15.64 [2019-03-28 12:22:19,441 INFO L706 BuchiCegarLoop]: Abstraction has 17 states and 23 transitions. 25.50/15.64 [2019-03-28 12:22:19,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 23 transitions. 25.50/15.64 [2019-03-28 12:22:19,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 13. 25.50/15.64 [2019-03-28 12:22:19,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. 25.50/15.64 [2019-03-28 12:22:19,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 17 transitions. 25.50/15.64 [2019-03-28 12:22:19,443 INFO L729 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. 25.50/15.64 [2019-03-28 12:22:19,444 INFO L609 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. 25.50/15.64 [2019-03-28 12:22:19,444 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ 25.50/15.64 [2019-03-28 12:22:19,444 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 17 transitions. 25.50/15.64 [2019-03-28 12:22:19,444 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 25.50/15.64 [2019-03-28 12:22:19,445 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 25.50/15.64 [2019-03-28 12:22:19,445 INFO L119 BuchiIsEmpty]: Starting construction of run 25.50/15.64 [2019-03-28 12:22:19,445 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] 25.50/15.64 [2019-03-28 12:22:19,445 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] 25.50/15.64 [2019-03-28 12:22:19,446 INFO L794 eck$LassoCheckResult]: Stem: 91#ULTIMATE.startENTRY [102] ULTIMATE.startENTRY-->L42: Formula: (<= 0 v_ULTIMATE.start_main_~n~0_9) InVars {} OutVars{ULTIMATE.start_main_~mod~0=v_ULTIMATE.start_main_~mod~0_5, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_6|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_6|, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_9, ULTIMATE.start_main_#t~ret3=|v_ULTIMATE.start_main_#t~ret3_6|, ULTIMATE.start_main_~result~0=v_ULTIMATE.start_main_~result~0_5} AuxVars[] AssignedVars[ULTIMATE.start_main_~mod~0, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#res, ULTIMATE.start_main_~n~0, ULTIMATE.start_main_#t~ret3, ULTIMATE.start_main_~result~0] 86#L42 [61] L42-->isOddENTRY: Formula: (= |v_isOdd_#in~nInParam_2| v_ULTIMATE.start_main_~n~0_8) InVars {ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_8} OutVars{isOdd_#in~n=|v_isOdd_#in~nInParam_2|} AuxVars[] AssignedVars[isOdd_#in~n]< 87#isOddENTRY [71] isOddENTRY-->L17: Formula: (= v_isOdd_~n_5 |v_isOdd_#in~n_1|) InVars {isOdd_#in~n=|v_isOdd_#in~n_1|} OutVars{isOdd_#in~n=|v_isOdd_#in~n_1|, isOdd_~n=v_isOdd_~n_5} AuxVars[] AssignedVars[isOdd_~n] 92#L17 [86] L17-->L19: Formula: (< 0 v_isOdd_~n_1) InVars {isOdd_~n=v_isOdd_~n_1} OutVars{isOdd_~n=v_isOdd_~n_1} AuxVars[] AssignedVars[] 88#L19 25.50/15.64 [2019-03-28 12:22:19,446 INFO L796 eck$LassoCheckResult]: Loop: 88#L19 [87] L19-->L22: Formula: (> 1 v_isOdd_~n_3) InVars {isOdd_~n=v_isOdd_~n_3} OutVars{isOdd_~n=v_isOdd_~n_3} AuxVars[] AssignedVars[] 90#L22 [55] L22-->isEvenENTRY: Formula: (= |v_isEven_#in~nInParam_1| (+ v_isOdd_~n_7 (- 1))) InVars {isOdd_~n=v_isOdd_~n_7} OutVars{isEven_#in~n=|v_isEven_#in~nInParam_1|} AuxVars[] AssignedVars[isEven_#in~n]< 98#isEvenENTRY [56] isEvenENTRY-->L27: Formula: (= v_isEven_~n_1 |v_isEven_#in~n_1|) InVars {isEven_#in~n=|v_isEven_#in~n_1|} OutVars{isEven_~n=v_isEven_~n_1, isEven_#in~n=|v_isEven_#in~n_1|} AuxVars[] AssignedVars[isEven_~n] 95#L27 [97] L27-->L29: Formula: (> 0 v_isEven_~n_3) InVars {isEven_~n=v_isEven_~n_3} OutVars{isEven_~n=v_isEven_~n_3} AuxVars[] AssignedVars[] 96#L29 [100] L29-->L32: Formula: (> 1 v_isEven_~n_5) InVars {isEven_~n=v_isEven_~n_5} OutVars{isEven_~n=v_isEven_~n_5} AuxVars[] AssignedVars[] 89#L32 [72] L32-->isOddENTRY: Formula: (= |v_isOdd_#in~nInParam_1| (+ v_isEven_~n_7 (- 1))) InVars {isEven_~n=v_isEven_~n_7} OutVars{isOdd_#in~n=|v_isOdd_#in~nInParam_1|} AuxVars[] AssignedVars[isOdd_#in~n]< 93#isOddENTRY [71] isOddENTRY-->L17: Formula: (= v_isOdd_~n_5 |v_isOdd_#in~n_1|) InVars {isOdd_#in~n=|v_isOdd_#in~n_1|} OutVars{isOdd_#in~n=|v_isOdd_#in~n_1|, isOdd_~n=v_isOdd_~n_5} AuxVars[] AssignedVars[isOdd_~n] 94#L17 [85] L17-->L19: Formula: (> 0 v_isOdd_~n_1) InVars {isOdd_~n=v_isOdd_~n_1} OutVars{isOdd_~n=v_isOdd_~n_1} AuxVars[] AssignedVars[] 88#L19 25.50/15.64 [2019-03-28 12:22:19,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 25.50/15.64 [2019-03-28 12:22:19,446 INFO L82 PathProgramCache]: Analyzing trace with hash 4023111, now seen corresponding path program 1 times 25.50/15.64 [2019-03-28 12:22:19,447 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 25.50/15.64 [2019-03-28 12:22:19,447 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 25.50/15.64 [2019-03-28 12:22:19,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.50/15.64 [2019-03-28 12:22:19,448 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 25.50/15.64 [2019-03-28 12:22:19,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.50/15.64 [2019-03-28 12:22:19,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 25.50/15.64 [2019-03-28 12:22:19,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 25.50/15.64 [2019-03-28 12:22:19,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 25.50/15.64 [2019-03-28 12:22:19,455 INFO L82 PathProgramCache]: Analyzing trace with hash -1537851204, now seen corresponding path program 2 times 25.50/15.64 [2019-03-28 12:22:19,455 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 25.50/15.64 [2019-03-28 12:22:19,455 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 25.50/15.64 [2019-03-28 12:22:19,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.50/15.64 [2019-03-28 12:22:19,456 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 25.50/15.64 [2019-03-28 12:22:19,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.50/15.64 [2019-03-28 12:22:19,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 25.50/15.64 [2019-03-28 12:22:19,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 25.50/15.64 [2019-03-28 12:22:19,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 25.50/15.64 [2019-03-28 12:22:19,466 INFO L82 PathProgramCache]: Analyzing trace with hash 423034370, now seen corresponding path program 1 times 25.50/15.64 [2019-03-28 12:22:19,466 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 25.50/15.64 [2019-03-28 12:22:19,466 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 25.50/15.64 [2019-03-28 12:22:19,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.50/15.64 [2019-03-28 12:22:19,467 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 25.50/15.64 [2019-03-28 12:22:19,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.50/15.64 [2019-03-28 12:22:19,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 25.50/15.64 [2019-03-28 12:22:19,480 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 25.50/15.64 [2019-03-28 12:22:19,480 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 25.50/15.64 [2019-03-28 12:22:19,480 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 25.50/15.64 [2019-03-28 12:22:19,620 INFO L216 LassoAnalysis]: Preferences: 25.50/15.64 [2019-03-28 12:22:19,620 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 25.50/15.64 [2019-03-28 12:22:19,621 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 25.50/15.64 [2019-03-28 12:22:19,621 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 25.50/15.64 [2019-03-28 12:22:19,621 INFO L127 ssoRankerPreferences]: Use exernal solver: true 25.50/15.64 [2019-03-28 12:22:19,621 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 25.50/15.64 [2019-03-28 12:22:19,621 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 25.50/15.64 [2019-03-28 12:22:19,621 INFO L130 ssoRankerPreferences]: Path of dumped script: 25.50/15.64 [2019-03-28 12:22:19,621 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration3_Loop 25.50/15.64 [2019-03-28 12:22:19,621 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 25.50/15.64 [2019-03-28 12:22:19,622 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 25.50/15.64 [2019-03-28 12:22:19,623 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.50/15.64 [2019-03-28 12:22:19,627 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.50/15.64 [2019-03-28 12:22:19,636 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.50/15.64 [2019-03-28 12:22:19,639 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.50/15.64 [2019-03-28 12:22:19,641 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.50/15.64 [2019-03-28 12:22:19,646 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.50/15.64 [2019-03-28 12:22:19,649 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.50/15.64 [2019-03-28 12:22:19,712 INFO L300 LassoAnalysis]: Preprocessing complete. 25.50/15.64 [2019-03-28 12:22:19,712 INFO L412 LassoAnalysis]: Checking for nontermination... 25.50/15.64 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 25.50/15.64 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 25.50/15.64 Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 25.50/15.64 [2019-03-28 12:22:19,717 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 25.50/15.64 [2019-03-28 12:22:19,717 INFO L163 nArgumentSynthesizer]: Using integer mode. 25.50/15.64 [2019-03-28 12:22:19,722 INFO L445 LassoAnalysis]: Proved nontermination for one component. 25.50/15.64 [2019-03-28 12:22:19,722 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {isOdd_#t~ret0=0} Honda state: {isOdd_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 25.50/15.64 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 25.50/15.64 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 25.50/15.64 Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 25.50/15.64 [2019-03-28 12:22:19,750 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 25.50/15.64 [2019-03-28 12:22:19,751 INFO L163 nArgumentSynthesizer]: Using integer mode. 25.50/15.64 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 25.50/15.64 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 25.50/15.64 Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 25.50/15.64 [2019-03-28 12:22:19,789 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 25.50/15.64 [2019-03-28 12:22:19,789 INFO L163 nArgumentSynthesizer]: Using integer mode. 25.50/15.64 [2019-03-28 12:22:19,988 INFO L445 LassoAnalysis]: Proved nontermination for one component. 25.50/15.64 [2019-03-28 12:22:19,989 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {isOdd_#in~n=2, isOdd_~n=-5} Honda state: {isOdd_#in~n=2, isOdd_~n=-5} Generalized eigenvectors: [{isOdd_#in~n=-3, isOdd_~n=-2}, {isOdd_#in~n=1, isOdd_~n=0}, {isOdd_#in~n=-7, isOdd_~n=0}] Lambdas: [1, 7, 0] Nus: [1, 1] 25.50/15.64 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 25.50/15.64 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 25.50/15.64 Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 25.50/15.64 [2019-03-28 12:22:20,019 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 25.50/15.64 [2019-03-28 12:22:20,019 INFO L163 nArgumentSynthesizer]: Using integer mode. 25.50/15.64 [2019-03-28 12:22:20,023 INFO L445 LassoAnalysis]: Proved nontermination for one component. 25.50/15.64 [2019-03-28 12:22:20,023 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {isOdd_#res=0} Honda state: {isOdd_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 25.50/15.64 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 25.50/15.64 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 25.50/15.64 Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 25.50/15.64 [2019-03-28 12:22:20,051 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 25.50/15.64 [2019-03-28 12:22:20,052 INFO L163 nArgumentSynthesizer]: Using integer mode. 25.50/15.64 [2019-03-28 12:22:20,056 INFO L445 LassoAnalysis]: Proved nontermination for one component. 25.50/15.64 [2019-03-28 12:22:20,056 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {isEven_#t~ret1=0} Honda state: {isEven_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 25.50/15.64 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 25.50/15.64 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 25.50/15.64 Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 25.50/15.64 [2019-03-28 12:22:20,084 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 25.50/15.64 [2019-03-28 12:22:20,084 INFO L163 nArgumentSynthesizer]: Using integer mode. 25.50/15.64 [2019-03-28 12:22:20,088 INFO L445 LassoAnalysis]: Proved nontermination for one component. 25.50/15.64 [2019-03-28 12:22:20,088 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {isEven_~n=0} Honda state: {isEven_~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 25.50/15.64 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 25.50/15.64 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 25.50/15.64 Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 25.50/15.64 [2019-03-28 12:22:20,117 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 25.50/15.64 [2019-03-28 12:22:20,117 INFO L163 nArgumentSynthesizer]: Using integer mode. 25.50/15.64 [2019-03-28 12:22:20,120 INFO L445 LassoAnalysis]: Proved nontermination for one component. 25.50/15.64 [2019-03-28 12:22:20,120 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {isEven_#res=0} Honda state: {isEven_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 25.50/15.64 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 25.50/15.64 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 25.50/15.64 Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 25.50/15.64 [2019-03-28 12:22:20,147 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 25.50/15.64 [2019-03-28 12:22:20,148 INFO L163 nArgumentSynthesizer]: Using integer mode. 25.50/15.64 [2019-03-28 12:22:20,151 INFO L445 LassoAnalysis]: Proved nontermination for one component. 25.50/15.64 [2019-03-28 12:22:20,151 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {isEven_#in~n=0} Honda state: {isEven_#in~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 25.50/15.64 [2019-03-28 12:22:20,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 25.50/15.64 [2019-03-28 12:22:20,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 25.50/15.64 [2019-03-28 12:22:20,176 INFO L87 Difference]: Start difference. First operand 13 states and 17 transitions. cyclomatic complexity: 5 Second operand 3 states. 25.50/15.64 [2019-03-28 12:22:20,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 25.50/15.64 [2019-03-28 12:22:20,192 INFO L93 Difference]: Finished difference Result 15 states and 19 transitions. 25.50/15.64 [2019-03-28 12:22:20,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 25.50/15.64 [2019-03-28 12:22:20,193 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 19 transitions. 25.50/15.64 [2019-03-28 12:22:20,194 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 25.50/15.64 [2019-03-28 12:22:20,195 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 15 states and 19 transitions. 25.50/15.64 [2019-03-28 12:22:20,195 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 25.50/15.64 [2019-03-28 12:22:20,195 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 25.50/15.64 [2019-03-28 12:22:20,196 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 19 transitions. 25.50/15.64 [2019-03-28 12:22:20,196 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 25.50/15.64 [2019-03-28 12:22:20,196 INFO L706 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. 25.50/15.64 [2019-03-28 12:22:20,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 19 transitions. 25.50/15.64 [2019-03-28 12:22:20,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. 25.50/15.64 [2019-03-28 12:22:20,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. 25.50/15.64 [2019-03-28 12:22:20,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 18 transitions. 25.50/15.64 [2019-03-28 12:22:20,198 INFO L729 BuchiCegarLoop]: Abstraction has 14 states and 18 transitions. 25.50/15.64 [2019-03-28 12:22:20,198 INFO L609 BuchiCegarLoop]: Abstraction has 14 states and 18 transitions. 25.50/15.64 [2019-03-28 12:22:20,198 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ 25.50/15.64 [2019-03-28 12:22:20,199 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 18 transitions. 25.50/15.64 [2019-03-28 12:22:20,199 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 25.50/15.64 [2019-03-28 12:22:20,199 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 25.50/15.64 [2019-03-28 12:22:20,199 INFO L119 BuchiIsEmpty]: Starting construction of run 25.50/15.64 [2019-03-28 12:22:20,200 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] 25.50/15.64 [2019-03-28 12:22:20,200 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] 25.50/15.64 [2019-03-28 12:22:20,200 INFO L794 eck$LassoCheckResult]: Stem: 127#ULTIMATE.startENTRY [102] ULTIMATE.startENTRY-->L42: Formula: (<= 0 v_ULTIMATE.start_main_~n~0_9) InVars {} OutVars{ULTIMATE.start_main_~mod~0=v_ULTIMATE.start_main_~mod~0_5, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_6|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_6|, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_9, ULTIMATE.start_main_#t~ret3=|v_ULTIMATE.start_main_#t~ret3_6|, ULTIMATE.start_main_~result~0=v_ULTIMATE.start_main_~result~0_5} AuxVars[] AssignedVars[ULTIMATE.start_main_~mod~0, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#res, ULTIMATE.start_main_~n~0, ULTIMATE.start_main_#t~ret3, ULTIMATE.start_main_~result~0] 122#L42 [61] L42-->isOddENTRY: Formula: (= |v_isOdd_#in~nInParam_2| v_ULTIMATE.start_main_~n~0_8) InVars {ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_8} OutVars{isOdd_#in~n=|v_isOdd_#in~nInParam_2|} AuxVars[] AssignedVars[isOdd_#in~n]< 123#isOddENTRY [71] isOddENTRY-->L17: Formula: (= v_isOdd_~n_5 |v_isOdd_#in~n_1|) InVars {isOdd_#in~n=|v_isOdd_#in~n_1|} OutVars{isOdd_#in~n=|v_isOdd_#in~n_1|, isOdd_~n=v_isOdd_~n_5} AuxVars[] AssignedVars[isOdd_~n] 128#L17 [86] L17-->L19: Formula: (< 0 v_isOdd_~n_1) InVars {isOdd_~n=v_isOdd_~n_1} OutVars{isOdd_~n=v_isOdd_~n_1} AuxVars[] AssignedVars[] 124#L19 25.50/15.64 [2019-03-28 12:22:20,201 INFO L796 eck$LassoCheckResult]: Loop: 124#L19 [88] L19-->L22: Formula: (< 1 v_isOdd_~n_3) InVars {isOdd_~n=v_isOdd_~n_3} OutVars{isOdd_~n=v_isOdd_~n_3} AuxVars[] AssignedVars[] 126#L22 [55] L22-->isEvenENTRY: Formula: (= |v_isEven_#in~nInParam_1| (+ v_isOdd_~n_7 (- 1))) InVars {isOdd_~n=v_isOdd_~n_7} OutVars{isEven_#in~n=|v_isEven_#in~nInParam_1|} AuxVars[] AssignedVars[isEven_#in~n]< 134#isEvenENTRY [56] isEvenENTRY-->L27: Formula: (= v_isEven_~n_1 |v_isEven_#in~n_1|) InVars {isEven_#in~n=|v_isEven_#in~n_1|} OutVars{isEven_~n=v_isEven_~n_1, isEven_#in~n=|v_isEven_#in~n_1|} AuxVars[] AssignedVars[isEven_~n] 131#L27 [97] L27-->L29: Formula: (> 0 v_isEven_~n_3) InVars {isEven_~n=v_isEven_~n_3} OutVars{isEven_~n=v_isEven_~n_3} AuxVars[] AssignedVars[] 132#L29 [100] L29-->L32: Formula: (> 1 v_isEven_~n_5) InVars {isEven_~n=v_isEven_~n_5} OutVars{isEven_~n=v_isEven_~n_5} AuxVars[] AssignedVars[] 125#L32 [72] L32-->isOddENTRY: Formula: (= |v_isOdd_#in~nInParam_1| (+ v_isEven_~n_7 (- 1))) InVars {isEven_~n=v_isEven_~n_7} OutVars{isOdd_#in~n=|v_isOdd_#in~nInParam_1|} AuxVars[] AssignedVars[isOdd_#in~n]< 129#isOddENTRY [71] isOddENTRY-->L17: Formula: (= v_isOdd_~n_5 |v_isOdd_#in~n_1|) InVars {isOdd_#in~n=|v_isOdd_#in~n_1|} OutVars{isOdd_#in~n=|v_isOdd_#in~n_1|, isOdd_~n=v_isOdd_~n_5} AuxVars[] AssignedVars[isOdd_~n] 130#L17 [86] L17-->L19: Formula: (< 0 v_isOdd_~n_1) InVars {isOdd_~n=v_isOdd_~n_1} OutVars{isOdd_~n=v_isOdd_~n_1} AuxVars[] AssignedVars[] 124#L19 25.50/15.64 [2019-03-28 12:22:20,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 25.50/15.64 [2019-03-28 12:22:20,201 INFO L82 PathProgramCache]: Analyzing trace with hash 4023111, now seen corresponding path program 2 times 25.50/15.64 [2019-03-28 12:22:20,201 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 25.50/15.64 [2019-03-28 12:22:20,201 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 25.50/15.64 [2019-03-28 12:22:20,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.50/15.64 [2019-03-28 12:22:20,202 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 25.50/15.64 [2019-03-28 12:22:20,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.50/15.64 [2019-03-28 12:22:20,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 25.50/15.64 [2019-03-28 12:22:20,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 25.50/15.64 [2019-03-28 12:22:20,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 25.50/15.64 [2019-03-28 12:22:20,209 INFO L82 PathProgramCache]: Analyzing trace with hash 204959132, now seen corresponding path program 1 times 25.50/15.64 [2019-03-28 12:22:20,209 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 25.50/15.64 [2019-03-28 12:22:20,209 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 25.50/15.64 [2019-03-28 12:22:20,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.50/15.64 [2019-03-28 12:22:20,210 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 25.50/15.64 [2019-03-28 12:22:20,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.50/15.64 [2019-03-28 12:22:20,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 25.50/15.64 [2019-03-28 12:22:20,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 25.50/15.64 [2019-03-28 12:22:20,234 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 25.50/15.64 [2019-03-28 12:22:20,235 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 25.50/15.64 [2019-03-28 12:22:20,235 INFO L811 eck$LassoCheckResult]: loop already infeasible 25.50/15.64 [2019-03-28 12:22:20,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. 25.50/15.64 [2019-03-28 12:22:20,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 25.50/15.64 [2019-03-28 12:22:20,236 INFO L87 Difference]: Start difference. First operand 14 states and 18 transitions. cyclomatic complexity: 5 Second operand 5 states. 25.50/15.64 [2019-03-28 12:22:20,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 25.50/15.64 [2019-03-28 12:22:20,278 INFO L93 Difference]: Finished difference Result 20 states and 23 transitions. 25.50/15.64 [2019-03-28 12:22:20,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 25.50/15.64 [2019-03-28 12:22:20,279 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 23 transitions. 25.50/15.64 [2019-03-28 12:22:20,280 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 25.50/15.64 [2019-03-28 12:22:20,281 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 20 states and 23 transitions. 25.50/15.64 [2019-03-28 12:22:20,281 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 25.50/15.64 [2019-03-28 12:22:20,282 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 25.50/15.64 [2019-03-28 12:22:20,282 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 23 transitions. 25.50/15.64 [2019-03-28 12:22:20,282 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 25.50/15.64 [2019-03-28 12:22:20,282 INFO L706 BuchiCegarLoop]: Abstraction has 20 states and 23 transitions. 25.50/15.64 [2019-03-28 12:22:20,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 23 transitions. 25.50/15.64 [2019-03-28 12:22:20,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 17. 25.50/15.64 [2019-03-28 12:22:20,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. 25.50/15.64 [2019-03-28 12:22:20,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. 25.50/15.64 [2019-03-28 12:22:20,285 INFO L729 BuchiCegarLoop]: Abstraction has 17 states and 20 transitions. 25.50/15.64 [2019-03-28 12:22:20,285 INFO L609 BuchiCegarLoop]: Abstraction has 17 states and 20 transitions. 25.50/15.64 [2019-03-28 12:22:20,285 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ 25.50/15.64 [2019-03-28 12:22:20,285 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 20 transitions. 25.50/15.64 [2019-03-28 12:22:20,286 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 25.50/15.64 [2019-03-28 12:22:20,286 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 25.50/15.64 [2019-03-28 12:22:20,286 INFO L119 BuchiIsEmpty]: Starting construction of run 25.50/15.64 [2019-03-28 12:22:20,286 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] 25.50/15.64 [2019-03-28 12:22:20,286 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] 25.50/15.64 [2019-03-28 12:22:20,287 INFO L794 eck$LassoCheckResult]: Stem: 171#ULTIMATE.startENTRY [102] ULTIMATE.startENTRY-->L42: Formula: (<= 0 v_ULTIMATE.start_main_~n~0_9) InVars {} OutVars{ULTIMATE.start_main_~mod~0=v_ULTIMATE.start_main_~mod~0_5, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_6|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_6|, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_9, ULTIMATE.start_main_#t~ret3=|v_ULTIMATE.start_main_#t~ret3_6|, ULTIMATE.start_main_~result~0=v_ULTIMATE.start_main_~result~0_5} AuxVars[] AssignedVars[ULTIMATE.start_main_~mod~0, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#res, ULTIMATE.start_main_~n~0, ULTIMATE.start_main_#t~ret3, ULTIMATE.start_main_~result~0] 166#L42 [61] L42-->isOddENTRY: Formula: (= |v_isOdd_#in~nInParam_2| v_ULTIMATE.start_main_~n~0_8) InVars {ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_8} OutVars{isOdd_#in~n=|v_isOdd_#in~nInParam_2|} AuxVars[] AssignedVars[isOdd_#in~n]< 167#isOddENTRY [71] isOddENTRY-->L17: Formula: (= v_isOdd_~n_5 |v_isOdd_#in~n_1|) InVars {isOdd_#in~n=|v_isOdd_#in~n_1|} OutVars{isOdd_#in~n=|v_isOdd_#in~n_1|, isOdd_~n=v_isOdd_~n_5} AuxVars[] AssignedVars[isOdd_~n] 172#L17 [86] L17-->L19: Formula: (< 0 v_isOdd_~n_1) InVars {isOdd_~n=v_isOdd_~n_1} OutVars{isOdd_~n=v_isOdd_~n_1} AuxVars[] AssignedVars[] 168#L19 25.50/15.64 [2019-03-28 12:22:20,287 INFO L796 eck$LassoCheckResult]: Loop: 168#L19 [88] L19-->L22: Formula: (< 1 v_isOdd_~n_3) InVars {isOdd_~n=v_isOdd_~n_3} OutVars{isOdd_~n=v_isOdd_~n_3} AuxVars[] AssignedVars[] 170#L22 [55] L22-->isEvenENTRY: Formula: (= |v_isEven_#in~nInParam_1| (+ v_isOdd_~n_7 (- 1))) InVars {isOdd_~n=v_isOdd_~n_7} OutVars{isEven_#in~n=|v_isEven_#in~nInParam_1|} AuxVars[] AssignedVars[isEven_#in~n]< 182#isEvenENTRY [56] isEvenENTRY-->L27: Formula: (= v_isEven_~n_1 |v_isEven_#in~n_1|) InVars {isEven_#in~n=|v_isEven_#in~n_1|} OutVars{isEven_~n=v_isEven_~n_1, isEven_#in~n=|v_isEven_#in~n_1|} AuxVars[] AssignedVars[isEven_~n] 173#L27 [98] L27-->L29: Formula: (< 0 v_isEven_~n_3) InVars {isEven_~n=v_isEven_~n_3} OutVars{isEven_~n=v_isEven_~n_3} AuxVars[] AssignedVars[] 174#L29 [99] L29-->L32: Formula: (< 1 v_isEven_~n_5) InVars {isEven_~n=v_isEven_~n_5} OutVars{isEven_~n=v_isEven_~n_5} AuxVars[] AssignedVars[] 169#L32 [72] L32-->isOddENTRY: Formula: (= |v_isOdd_#in~nInParam_1| (+ v_isEven_~n_7 (- 1))) InVars {isEven_~n=v_isEven_~n_7} OutVars{isOdd_#in~n=|v_isOdd_#in~nInParam_1|} AuxVars[] AssignedVars[isOdd_#in~n]< 175#isOddENTRY [71] isOddENTRY-->L17: Formula: (= v_isOdd_~n_5 |v_isOdd_#in~n_1|) InVars {isOdd_#in~n=|v_isOdd_#in~n_1|} OutVars{isOdd_#in~n=|v_isOdd_#in~n_1|, isOdd_~n=v_isOdd_~n_5} AuxVars[] AssignedVars[isOdd_~n] 176#L17 [86] L17-->L19: Formula: (< 0 v_isOdd_~n_1) InVars {isOdd_~n=v_isOdd_~n_1} OutVars{isOdd_~n=v_isOdd_~n_1} AuxVars[] AssignedVars[] 168#L19 25.50/15.64 [2019-03-28 12:22:20,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 25.50/15.64 [2019-03-28 12:22:20,288 INFO L82 PathProgramCache]: Analyzing trace with hash 4023111, now seen corresponding path program 3 times 25.50/15.64 [2019-03-28 12:22:20,288 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 25.50/15.64 [2019-03-28 12:22:20,288 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 25.50/15.64 [2019-03-28 12:22:20,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.50/15.64 [2019-03-28 12:22:20,289 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 25.50/15.64 [2019-03-28 12:22:20,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.50/15.64 [2019-03-28 12:22:20,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 25.50/15.64 [2019-03-28 12:22:20,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 25.50/15.64 [2019-03-28 12:22:20,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 25.50/15.64 [2019-03-28 12:22:20,295 INFO L82 PathProgramCache]: Analyzing trace with hash 205852862, now seen corresponding path program 1 times 25.50/15.64 [2019-03-28 12:22:20,295 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 25.50/15.64 [2019-03-28 12:22:20,295 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 25.50/15.64 [2019-03-28 12:22:20,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.50/15.64 [2019-03-28 12:22:20,296 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 25.50/15.64 [2019-03-28 12:22:20,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.50/15.64 [2019-03-28 12:22:20,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 25.50/15.64 [2019-03-28 12:22:20,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 25.50/15.64 [2019-03-28 12:22:20,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 25.50/15.64 [2019-03-28 12:22:20,304 INFO L82 PathProgramCache]: Analyzing trace with hash -2128228860, now seen corresponding path program 1 times 25.50/15.64 [2019-03-28 12:22:20,305 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 25.50/15.64 [2019-03-28 12:22:20,305 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 25.50/15.64 [2019-03-28 12:22:20,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.50/15.64 [2019-03-28 12:22:20,306 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 25.50/15.64 [2019-03-28 12:22:20,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.50/15.64 [2019-03-28 12:22:20,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 25.50/15.64 [2019-03-28 12:22:20,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 25.50/15.64 [2019-03-28 12:22:20,425 INFO L216 LassoAnalysis]: Preferences: 25.50/15.64 [2019-03-28 12:22:20,425 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 25.50/15.64 [2019-03-28 12:22:20,425 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 25.50/15.64 [2019-03-28 12:22:20,425 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 25.50/15.64 [2019-03-28 12:22:20,426 INFO L127 ssoRankerPreferences]: Use exernal solver: true 25.50/15.64 [2019-03-28 12:22:20,426 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 25.50/15.64 [2019-03-28 12:22:20,426 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 25.50/15.64 [2019-03-28 12:22:20,426 INFO L130 ssoRankerPreferences]: Path of dumped script: 25.50/15.64 [2019-03-28 12:22:20,426 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration5_Loop 25.50/15.64 [2019-03-28 12:22:20,426 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 25.50/15.64 [2019-03-28 12:22:20,426 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 25.50/15.64 [2019-03-28 12:22:20,427 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.50/15.64 [2019-03-28 12:22:20,431 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.50/15.64 [2019-03-28 12:22:20,439 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.50/15.64 [2019-03-28 12:22:20,441 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.50/15.64 [2019-03-28 12:22:20,443 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.50/15.64 [2019-03-28 12:22:20,446 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.50/15.64 [2019-03-28 12:22:20,447 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.50/15.64 [2019-03-28 12:22:20,487 INFO L300 LassoAnalysis]: Preprocessing complete. 25.50/15.64 [2019-03-28 12:22:20,487 INFO L412 LassoAnalysis]: Checking for nontermination... 25.50/15.64 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 25.50/15.64 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 25.50/15.64 Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 25.50/15.64 [2019-03-28 12:22:20,494 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 25.50/15.64 [2019-03-28 12:22:20,494 INFO L163 nArgumentSynthesizer]: Using integer mode. 25.50/15.64 [2019-03-28 12:22:20,498 INFO L445 LassoAnalysis]: Proved nontermination for one component. 25.50/15.64 [2019-03-28 12:22:20,498 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {isEven_#res=0} Honda state: {isEven_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 25.50/15.64 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 25.50/15.64 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 25.50/15.64 Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 25.50/15.64 [2019-03-28 12:22:20,528 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 25.50/15.64 [2019-03-28 12:22:20,528 INFO L163 nArgumentSynthesizer]: Using integer mode. 25.50/15.64 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 25.50/15.64 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 25.50/15.64 Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 25.50/15.64 [2019-03-28 12:22:20,577 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 25.50/15.64 [2019-03-28 12:22:20,578 INFO L163 nArgumentSynthesizer]: Using integer mode. 25.50/15.64 [2019-03-28 12:22:27,068 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. 25.50/15.64 [2019-03-28 12:22:27,072 INFO L216 LassoAnalysis]: Preferences: 25.50/15.64 [2019-03-28 12:22:27,072 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 25.50/15.64 [2019-03-28 12:22:27,072 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 25.50/15.64 [2019-03-28 12:22:27,072 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 25.50/15.64 [2019-03-28 12:22:27,073 INFO L127 ssoRankerPreferences]: Use exernal solver: false 25.50/15.64 [2019-03-28 12:22:27,073 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 25.50/15.64 [2019-03-28 12:22:27,073 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 25.50/15.64 [2019-03-28 12:22:27,073 INFO L130 ssoRankerPreferences]: Path of dumped script: 25.50/15.64 [2019-03-28 12:22:27,073 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration5_Loop 25.50/15.64 [2019-03-28 12:22:27,073 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 25.50/15.64 [2019-03-28 12:22:27,073 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 25.50/15.64 [2019-03-28 12:22:27,075 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.50/15.64 [2019-03-28 12:22:27,078 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.50/15.64 [2019-03-28 12:22:27,086 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.50/15.64 [2019-03-28 12:22:27,089 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.50/15.64 [2019-03-28 12:22:27,095 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.50/15.64 [2019-03-28 12:22:27,097 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.50/15.64 [2019-03-28 12:22:27,105 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.50/15.64 [2019-03-28 12:22:27,163 INFO L300 LassoAnalysis]: Preprocessing complete. 25.50/15.64 [2019-03-28 12:22:27,169 INFO L497 LassoAnalysis]: Using template 'affine'. 25.50/15.64 [2019-03-28 12:22:27,171 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 25.50/15.64 Termination analysis: LINEAR_WITH_GUESSES 25.50/15.64 Number of strict supporting invariants: 0 25.50/15.64 Number of non-strict supporting invariants: 1 25.50/15.64 Consider only non-deceasing supporting invariants: true 25.50/15.64 Simplify termination arguments: true 25.50/15.64 Simplify supporting invariants: trueOverapproximate stem: false 25.50/15.64 [2019-03-28 12:22:27,172 INFO L339 nArgumentSynthesizer]: Template has degree 0. 25.50/15.64 [2019-03-28 12:22:27,173 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 25.50/15.64 [2019-03-28 12:22:27,173 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 25.50/15.64 [2019-03-28 12:22:27,173 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 25.50/15.64 [2019-03-28 12:22:27,174 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 25.50/15.64 [2019-03-28 12:22:27,176 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 25.50/15.64 [2019-03-28 12:22:27,176 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 25.50/15.64 [2019-03-28 12:22:27,178 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 25.50/15.64 [2019-03-28 12:22:27,179 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 25.50/15.64 Termination analysis: LINEAR_WITH_GUESSES 25.50/15.64 Number of strict supporting invariants: 0 25.50/15.64 Number of non-strict supporting invariants: 1 25.50/15.64 Consider only non-deceasing supporting invariants: true 25.50/15.64 Simplify termination arguments: true 25.50/15.64 Simplify supporting invariants: trueOverapproximate stem: false 25.50/15.64 [2019-03-28 12:22:27,179 INFO L339 nArgumentSynthesizer]: Template has degree 0. 25.50/15.64 [2019-03-28 12:22:27,179 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 25.50/15.64 [2019-03-28 12:22:27,180 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 25.50/15.64 [2019-03-28 12:22:27,180 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 25.50/15.64 [2019-03-28 12:22:27,180 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 25.50/15.64 [2019-03-28 12:22:27,181 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 25.50/15.64 [2019-03-28 12:22:27,181 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 25.50/15.64 [2019-03-28 12:22:27,188 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 25.50/15.64 [2019-03-28 12:22:27,194 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 25.50/15.64 [2019-03-28 12:22:27,195 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. 25.50/15.64 [2019-03-28 12:22:27,197 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 25.50/15.64 [2019-03-28 12:22:27,197 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 25.50/15.64 [2019-03-28 12:22:27,197 INFO L518 LassoAnalysis]: Proved termination. 25.50/15.64 [2019-03-28 12:22:27,197 INFO L520 LassoAnalysis]: Termination argument consisting of: 25.50/15.64 Ranking function f(isOdd_~n) = 1*isOdd_~n 25.50/15.64 Supporting invariants [] 25.50/15.64 [2019-03-28 12:22:27,199 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed 25.50/15.64 [2019-03-28 12:22:27,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 25.50/15.64 [2019-03-28 12:22:27,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 25.50/15.64 [2019-03-28 12:22:27,235 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 4 conjunts are in the unsatisfiable core 25.50/15.64 [2019-03-28 12:22:27,236 INFO L279 TraceCheckSpWp]: Computing forward predicates... 25.50/15.64 [2019-03-28 12:22:27,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 25.50/15.64 [2019-03-28 12:22:27,267 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 11 conjunts are in the unsatisfiable core 25.50/15.64 [2019-03-28 12:22:27,268 INFO L279 TraceCheckSpWp]: Computing forward predicates... 25.50/15.64 [2019-03-28 12:22:27,351 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 25.50/15.64 [2019-03-28 12:22:27,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 25.50/15.64 [2019-03-28 12:22:27,439 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 25.50/15.64 [2019-03-28 12:22:27,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 25.50/15.64 [2019-03-28 12:22:27,451 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 11 conjunts are in the unsatisfiable core 25.50/15.64 [2019-03-28 12:22:27,453 INFO L279 TraceCheckSpWp]: Computing forward predicates... 25.50/15.64 [2019-03-28 12:22:27,459 INFO L98 LoopCannibalizer]: 7 predicates before loop cannibalization 7 predicates after loop cannibalization 25.50/15.64 [2019-03-28 12:22:27,462 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 7 loop predicates 25.50/15.64 [2019-03-28 12:22:27,463 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 17 states and 20 transitions. cyclomatic complexity: 4 Second operand 8 states. 25.50/15.64 [2019-03-28 12:22:27,701 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 17 states and 20 transitions. cyclomatic complexity: 4. Second operand 8 states. Result 178 states and 224 transitions. Complement of second has 127 states. 25.50/15.64 [2019-03-28 12:22:27,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 12 states 1 stem states 10 non-accepting loop states 1 accepting loop states 25.50/15.64 [2019-03-28 12:22:27,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. 25.50/15.64 [2019-03-28 12:22:27,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 39 transitions. 25.50/15.64 [2019-03-28 12:22:27,706 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 39 transitions. Stem has 4 letters. Loop has 8 letters. 25.50/15.64 [2019-03-28 12:22:27,708 INFO L116 BuchiAccepts]: Finished buchiAccepts. 25.50/15.64 [2019-03-28 12:22:27,708 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 39 transitions. Stem has 12 letters. Loop has 8 letters. 25.50/15.64 [2019-03-28 12:22:27,709 INFO L116 BuchiAccepts]: Finished buchiAccepts. 25.50/15.64 [2019-03-28 12:22:27,709 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 39 transitions. Stem has 4 letters. Loop has 16 letters. 25.50/15.64 [2019-03-28 12:22:27,710 INFO L116 BuchiAccepts]: Finished buchiAccepts. 25.50/15.64 [2019-03-28 12:22:27,716 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 178 states and 224 transitions. 25.50/15.64 [2019-03-28 12:22:27,721 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 25.50/15.64 [2019-03-28 12:22:27,724 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 178 states to 90 states and 104 transitions. 25.50/15.64 [2019-03-28 12:22:27,724 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 25.50/15.64 [2019-03-28 12:22:27,724 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 25.50/15.64 [2019-03-28 12:22:27,724 INFO L73 IsDeterministic]: Start isDeterministic. Operand 90 states and 104 transitions. 25.50/15.64 [2019-03-28 12:22:27,725 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 25.50/15.64 [2019-03-28 12:22:27,725 INFO L706 BuchiCegarLoop]: Abstraction has 90 states and 104 transitions. 25.50/15.64 [2019-03-28 12:22:27,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states and 104 transitions. 25.50/15.64 [2019-03-28 12:22:27,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 29. 25.50/15.64 [2019-03-28 12:22:27,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. 25.50/15.64 [2019-03-28 12:22:27,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 34 transitions. 25.50/15.64 [2019-03-28 12:22:27,729 INFO L729 BuchiCegarLoop]: Abstraction has 29 states and 34 transitions. 25.50/15.64 [2019-03-28 12:22:27,729 INFO L609 BuchiCegarLoop]: Abstraction has 29 states and 34 transitions. 25.50/15.64 [2019-03-28 12:22:27,729 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ 25.50/15.64 [2019-03-28 12:22:27,729 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 34 transitions. 25.50/15.64 [2019-03-28 12:22:27,730 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 25.50/15.64 [2019-03-28 12:22:27,730 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 25.50/15.64 [2019-03-28 12:22:27,730 INFO L119 BuchiIsEmpty]: Starting construction of run 25.50/15.64 [2019-03-28 12:22:27,731 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 25.50/15.64 [2019-03-28 12:22:27,731 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] 25.50/15.64 [2019-03-28 12:22:27,731 INFO L794 eck$LassoCheckResult]: Stem: 591#ULTIMATE.startENTRY [102] ULTIMATE.startENTRY-->L42: Formula: (<= 0 v_ULTIMATE.start_main_~n~0_9) InVars {} OutVars{ULTIMATE.start_main_~mod~0=v_ULTIMATE.start_main_~mod~0_5, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_6|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_6|, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_9, ULTIMATE.start_main_#t~ret3=|v_ULTIMATE.start_main_#t~ret3_6|, ULTIMATE.start_main_~result~0=v_ULTIMATE.start_main_~result~0_5} AuxVars[] AssignedVars[ULTIMATE.start_main_~mod~0, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#res, ULTIMATE.start_main_~n~0, ULTIMATE.start_main_#t~ret3, ULTIMATE.start_main_~result~0] 584#L42 [61] L42-->isOddENTRY: Formula: (= |v_isOdd_#in~nInParam_2| v_ULTIMATE.start_main_~n~0_8) InVars {ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_8} OutVars{isOdd_#in~n=|v_isOdd_#in~nInParam_2|} AuxVars[] AssignedVars[isOdd_#in~n]< 585#isOddENTRY [71] isOddENTRY-->L17: Formula: (= v_isOdd_~n_5 |v_isOdd_#in~n_1|) InVars {isOdd_#in~n=|v_isOdd_#in~n_1|} OutVars{isOdd_#in~n=|v_isOdd_#in~n_1|, isOdd_~n=v_isOdd_~n_5} AuxVars[] AssignedVars[isOdd_~n] 597#L17 [86] L17-->L19: Formula: (< 0 v_isOdd_~n_1) InVars {isOdd_~n=v_isOdd_~n_1} OutVars{isOdd_~n=v_isOdd_~n_1} AuxVars[] AssignedVars[] 586#L19 [88] L19-->L22: Formula: (< 1 v_isOdd_~n_3) InVars {isOdd_~n=v_isOdd_~n_3} OutVars{isOdd_~n=v_isOdd_~n_3} AuxVars[] AssignedVars[] 587#L22 [55] L22-->isEvenENTRY: Formula: (= |v_isEven_#in~nInParam_1| (+ v_isOdd_~n_7 (- 1))) InVars {isOdd_~n=v_isOdd_~n_7} OutVars{isEven_#in~n=|v_isEven_#in~nInParam_1|} AuxVars[] AssignedVars[isEven_#in~n]< 612#isEvenENTRY [56] isEvenENTRY-->L27: Formula: (= v_isEven_~n_1 |v_isEven_#in~n_1|) InVars {isEven_#in~n=|v_isEven_#in~n_1|} OutVars{isEven_~n=v_isEven_~n_1, isEven_#in~n=|v_isEven_#in~n_1|} AuxVars[] AssignedVars[isEven_~n] 603#L27 [98] L27-->L29: Formula: (< 0 v_isEven_~n_3) InVars {isEven_~n=v_isEven_~n_3} OutVars{isEven_~n=v_isEven_~n_3} AuxVars[] AssignedVars[] 604#L29 [99] L29-->L32: Formula: (< 1 v_isEven_~n_5) InVars {isEven_~n=v_isEven_~n_5} OutVars{isEven_~n=v_isEven_~n_5} AuxVars[] AssignedVars[] 590#L32 [72] L32-->isOddENTRY: Formula: (= |v_isOdd_#in~nInParam_1| (+ v_isEven_~n_7 (- 1))) InVars {isEven_~n=v_isEven_~n_7} OutVars{isOdd_#in~n=|v_isOdd_#in~nInParam_1|} AuxVars[] AssignedVars[isOdd_#in~n]< 598#isOddENTRY [71] isOddENTRY-->L17: Formula: (= v_isOdd_~n_5 |v_isOdd_#in~n_1|) InVars {isOdd_#in~n=|v_isOdd_#in~n_1|} OutVars{isOdd_#in~n=|v_isOdd_#in~n_1|, isOdd_~n=v_isOdd_~n_5} AuxVars[] AssignedVars[isOdd_~n] 599#L17 [85] L17-->L19: Formula: (> 0 v_isOdd_~n_1) InVars {isOdd_~n=v_isOdd_~n_1} OutVars{isOdd_~n=v_isOdd_~n_1} AuxVars[] AssignedVars[] 594#L19 25.50/15.64 [2019-03-28 12:22:27,732 INFO L796 eck$LassoCheckResult]: Loop: 594#L19 [87] L19-->L22: Formula: (> 1 v_isOdd_~n_3) InVars {isOdd_~n=v_isOdd_~n_3} OutVars{isOdd_~n=v_isOdd_~n_3} AuxVars[] AssignedVars[] 601#L22 [55] L22-->isEvenENTRY: Formula: (= |v_isEven_#in~nInParam_1| (+ v_isOdd_~n_7 (- 1))) InVars {isOdd_~n=v_isOdd_~n_7} OutVars{isEven_#in~n=|v_isEven_#in~nInParam_1|} AuxVars[] AssignedVars[isEven_#in~n]< 605#isEvenENTRY [56] isEvenENTRY-->L27: Formula: (= v_isEven_~n_1 |v_isEven_#in~n_1|) InVars {isEven_#in~n=|v_isEven_#in~n_1|} OutVars{isEven_~n=v_isEven_~n_1, isEven_#in~n=|v_isEven_#in~n_1|} AuxVars[] AssignedVars[isEven_~n] 600#L27 [97] L27-->L29: Formula: (> 0 v_isEven_~n_3) InVars {isEven_~n=v_isEven_~n_3} OutVars{isEven_~n=v_isEven_~n_3} AuxVars[] AssignedVars[] 602#L29 [100] L29-->L32: Formula: (> 1 v_isEven_~n_5) InVars {isEven_~n=v_isEven_~n_5} OutVars{isEven_~n=v_isEven_~n_5} AuxVars[] AssignedVars[] 593#L32 [72] L32-->isOddENTRY: Formula: (= |v_isOdd_#in~nInParam_1| (+ v_isEven_~n_7 (- 1))) InVars {isEven_~n=v_isEven_~n_7} OutVars{isOdd_#in~n=|v_isOdd_#in~nInParam_1|} AuxVars[] AssignedVars[isOdd_#in~n]< 608#isOddENTRY [71] isOddENTRY-->L17: Formula: (= v_isOdd_~n_5 |v_isOdd_#in~n_1|) InVars {isOdd_#in~n=|v_isOdd_#in~n_1|} OutVars{isOdd_#in~n=|v_isOdd_#in~n_1|, isOdd_~n=v_isOdd_~n_5} AuxVars[] AssignedVars[isOdd_~n] 592#L17 [85] L17-->L19: Formula: (> 0 v_isOdd_~n_1) InVars {isOdd_~n=v_isOdd_~n_1} OutVars{isOdd_~n=v_isOdd_~n_1} AuxVars[] AssignedVars[] 594#L19 25.50/15.64 [2019-03-28 12:22:27,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 25.50/15.64 [2019-03-28 12:22:27,732 INFO L82 PathProgramCache]: Analyzing trace with hash -2128228861, now seen corresponding path program 1 times 25.50/15.64 [2019-03-28 12:22:27,732 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 25.50/15.64 [2019-03-28 12:22:27,732 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 25.50/15.64 [2019-03-28 12:22:27,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.50/15.64 [2019-03-28 12:22:27,733 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 25.50/15.64 [2019-03-28 12:22:27,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.50/15.64 [2019-03-28 12:22:27,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 25.50/15.64 [2019-03-28 12:22:27,758 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 25.50/15.64 [2019-03-28 12:22:27,758 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 25.50/15.64 [2019-03-28 12:22:27,758 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 25.50/15.64 [2019-03-28 12:22:27,758 INFO L799 eck$LassoCheckResult]: stem already infeasible 25.50/15.64 [2019-03-28 12:22:27,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 25.50/15.64 [2019-03-28 12:22:27,759 INFO L82 PathProgramCache]: Analyzing trace with hash -1537851204, now seen corresponding path program 3 times 25.50/15.64 [2019-03-28 12:22:27,759 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 25.50/15.64 [2019-03-28 12:22:27,759 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 25.50/15.64 [2019-03-28 12:22:27,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.50/15.64 [2019-03-28 12:22:27,760 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 25.50/15.64 [2019-03-28 12:22:27,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 25.50/15.64 [2019-03-28 12:22:27,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 25.50/15.64 [2019-03-28 12:22:27,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 25.50/15.64 [2019-03-28 12:22:27,853 INFO L216 LassoAnalysis]: Preferences: 25.50/15.64 [2019-03-28 12:22:27,853 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 25.50/15.64 [2019-03-28 12:22:27,853 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 25.50/15.64 [2019-03-28 12:22:27,854 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 25.50/15.64 [2019-03-28 12:22:27,854 INFO L127 ssoRankerPreferences]: Use exernal solver: true 25.50/15.64 [2019-03-28 12:22:27,854 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 25.50/15.64 [2019-03-28 12:22:27,854 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 25.50/15.64 [2019-03-28 12:22:27,854 INFO L130 ssoRankerPreferences]: Path of dumped script: 25.50/15.64 [2019-03-28 12:22:27,854 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration6_Loop 25.50/15.64 [2019-03-28 12:22:27,854 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 25.50/15.64 [2019-03-28 12:22:27,854 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 25.50/15.64 [2019-03-28 12:22:27,856 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.50/15.64 [2019-03-28 12:22:27,862 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.50/15.64 [2019-03-28 12:22:27,864 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.50/15.64 [2019-03-28 12:22:27,865 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.50/15.64 [2019-03-28 12:22:27,876 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.50/15.64 [2019-03-28 12:22:27,878 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.50/15.64 [2019-03-28 12:22:27,879 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 25.50/15.64 [2019-03-28 12:22:27,908 INFO L300 LassoAnalysis]: Preprocessing complete. 25.50/15.64 [2019-03-28 12:22:27,908 INFO L412 LassoAnalysis]: Checking for nontermination... 25.50/15.64 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 25.50/15.64 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 25.50/15.64 Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 25.50/15.64 [2019-03-28 12:22:27,914 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 25.50/15.64 [2019-03-28 12:22:27,914 INFO L163 nArgumentSynthesizer]: Using integer mode. 25.50/15.64 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 25.50/15.64 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 25.50/15.64 Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 25.50/15.64 [2019-03-28 12:22:27,947 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 25.50/15.64 [2019-03-28 12:22:27,947 INFO L163 nArgumentSynthesizer]: Using integer mode. 25.50/15.64 [2019-03-28 12:22:28,389 INFO L445 LassoAnalysis]: Proved nontermination for one component. 25.50/15.64 [2019-03-28 12:22:28,389 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {isOdd_#in~n=-8, isOdd_~n=-15} Honda state: {isOdd_#in~n=-8, isOdd_~n=-15} Generalized eigenvectors: [{isOdd_#in~n=0, isOdd_~n=0}, {isOdd_#in~n=-2, isOdd_~n=-2}, {isOdd_#in~n=-7, isOdd_~n=0}] Lambdas: [10, 1, 0] Nus: [0, 0] 25.50/15.64 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 25.50/15.64 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 25.50/15.64 Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 25.50/15.64 [2019-03-28 12:22:28,417 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 25.50/15.64 [2019-03-28 12:22:28,417 INFO L163 nArgumentSynthesizer]: Using integer mode. 25.50/15.64 [2019-03-28 12:22:28,420 INFO L445 LassoAnalysis]: Proved nontermination for one component. 25.50/15.64 [2019-03-28 12:22:28,420 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {isEven_#in~n=0} Honda state: {isEven_#in~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 25.50/15.64 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 25.50/15.64 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 25.50/15.64 Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 25.50/15.64 [2019-03-28 12:22:28,446 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 25.50/15.64 [2019-03-28 12:22:28,447 INFO L163 nArgumentSynthesizer]: Using integer mode. 25.50/15.64 [2019-03-28 12:22:28,450 INFO L445 LassoAnalysis]: Proved nontermination for one component. 25.50/15.64 [2019-03-28 12:22:28,450 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {isOdd_#res=0} Honda state: {isOdd_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 25.50/15.64 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 25.50/15.64 Starting monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 25.50/15.64 Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 25.50/15.64 [2019-03-28 12:22:28,476 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 25.50/15.64 [2019-03-28 12:22:28,476 INFO L163 nArgumentSynthesizer]: Using integer mode. 25.50/15.64 [2019-03-28 12:22:28,479 INFO L445 LassoAnalysis]: Proved nontermination for one component. 25.50/15.64 [2019-03-28 12:22:28,480 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {isOdd_#t~ret0=0} Honda state: {isOdd_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 25.50/15.64 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 25.50/15.64 Starting monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 25.50/15.64 Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 25.50/15.64 [2019-03-28 12:22:28,507 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 25.50/15.64 [2019-03-28 12:22:28,507 INFO L163 nArgumentSynthesizer]: Using integer mode. 25.50/15.64 [2019-03-28 12:22:28,510 INFO L445 LassoAnalysis]: Proved nontermination for one component. 25.50/15.64 [2019-03-28 12:22:28,510 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {isEven_#t~ret1=0} Honda state: {isEven_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 25.50/15.64 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 25.50/15.64 Starting monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 25.50/15.64 Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 25.50/15.64 [2019-03-28 12:22:28,536 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 25.50/15.64 [2019-03-28 12:22:28,536 INFO L163 nArgumentSynthesizer]: Using integer mode. 25.50/15.64 [2019-03-28 12:22:28,539 INFO L445 LassoAnalysis]: Proved nontermination for one component. 25.50/15.64 [2019-03-28 12:22:28,539 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {isEven_~n=0} Honda state: {isEven_~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 25.50/15.64 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 25.50/15.64 Starting monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 25.50/15.64 Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 25.50/15.64 [2019-03-28 12:22:28,565 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 25.50/15.64 [2019-03-28 12:22:28,565 INFO L163 nArgumentSynthesizer]: Using integer mode. 25.50/15.64 [2019-03-28 12:22:28,568 INFO L445 LassoAnalysis]: Proved nontermination for one component. 25.50/15.64 [2019-03-28 12:22:28,569 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {isEven_#res=0} Honda state: {isEven_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 25.50/15.64 [2019-03-28 12:22:28,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. 25.50/15.64 [2019-03-28 12:22:28,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 25.50/15.64 [2019-03-28 12:22:28,593 INFO L87 Difference]: Start difference. First operand 29 states and 34 transitions. cyclomatic complexity: 7 Second operand 5 states. 25.50/15.64 [2019-03-28 12:22:28,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 25.50/15.64 [2019-03-28 12:22:28,615 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. 25.50/15.64 [2019-03-28 12:22:28,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 25.50/15.64 [2019-03-28 12:22:28,618 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 14 transitions. 25.50/15.64 [2019-03-28 12:22:28,619 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 25.50/15.64 [2019-03-28 12:22:28,619 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 0 states and 0 transitions. 25.50/15.64 [2019-03-28 12:22:28,619 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 25.50/15.64 [2019-03-28 12:22:28,619 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 25.50/15.64 [2019-03-28 12:22:28,619 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. 25.50/15.64 [2019-03-28 12:22:28,619 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 25.50/15.64 [2019-03-28 12:22:28,620 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 25.50/15.64 [2019-03-28 12:22:28,620 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 25.50/15.64 [2019-03-28 12:22:28,620 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 25.50/15.64 [2019-03-28 12:22:28,620 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ 25.50/15.64 [2019-03-28 12:22:28,620 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. 25.50/15.64 [2019-03-28 12:22:28,620 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 25.50/15.64 [2019-03-28 12:22:28,620 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true 25.50/15.64 [2019-03-28 12:22:28,626 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:22:28 BasicIcfg 25.50/15.64 [2019-03-28 12:22:28,626 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- 25.50/15.64 [2019-03-28 12:22:28,627 INFO L168 Benchmark]: Toolchain (without parser) took 11124.29 ms. Allocated memory was 649.6 MB in the beginning and 735.1 MB in the end (delta: 85.5 MB). Free memory was 560.3 MB in the beginning and 516.8 MB in the end (delta: 43.4 MB). Peak memory consumption was 128.9 MB. Max. memory is 50.3 GB. 25.50/15.64 [2019-03-28 12:22:28,629 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 649.6 MB. Free memory is still 580.0 MB. There was no memory consumed. Max. memory is 50.3 GB. 25.50/15.64 [2019-03-28 12:22:28,629 INFO L168 Benchmark]: CACSL2BoogieTranslator took 299.57 ms. Allocated memory is still 649.6 MB. Free memory was 559.2 MB in the beginning and 617.4 MB in the end (delta: -58.2 MB). Peak memory consumption was 31.3 MB. Max. memory is 50.3 GB. 25.50/15.64 [2019-03-28 12:22:28,630 INFO L168 Benchmark]: Boogie Procedure Inliner took 36.79 ms. Allocated memory is still 649.6 MB. Free memory was 617.4 MB in the beginning and 616.3 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 50.3 GB. 25.50/15.64 [2019-03-28 12:22:28,630 INFO L168 Benchmark]: Boogie Preprocessor took 18.60 ms. Allocated memory is still 649.6 MB. Free memory was 616.3 MB in the beginning and 614.1 MB in the end (delta: 2.2 MB). Peak memory consumption was 3.9 MB. Max. memory is 50.3 GB. 25.50/15.64 [2019-03-28 12:22:28,631 INFO L168 Benchmark]: RCFGBuilder took 237.18 ms. Allocated memory is still 649.6 MB. Free memory was 612.4 MB in the beginning and 596.7 MB in the end (delta: 15.7 MB). Peak memory consumption was 15.7 MB. Max. memory is 50.3 GB. 25.50/15.64 [2019-03-28 12:22:28,631 INFO L168 Benchmark]: BlockEncodingV2 took 98.13 ms. Allocated memory is still 649.6 MB. Free memory was 596.7 MB in the beginning and 590.2 MB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 50.3 GB. 25.50/15.64 [2019-03-28 12:22:28,632 INFO L168 Benchmark]: TraceAbstraction took 170.50 ms. Allocated memory is still 649.6 MB. Free memory was 589.1 MB in the beginning and 579.3 MB in the end (delta: 9.8 MB). Peak memory consumption was 9.8 MB. Max. memory is 50.3 GB. 25.50/15.64 [2019-03-28 12:22:28,632 INFO L168 Benchmark]: BuchiAutomizer took 10257.13 ms. Allocated memory was 649.6 MB in the beginning and 735.1 MB in the end (delta: 85.5 MB). Free memory was 578.3 MB in the beginning and 516.8 MB in the end (delta: 61.4 MB). Peak memory consumption was 146.9 MB. Max. memory is 50.3 GB. 25.50/15.64 [2019-03-28 12:22:28,636 INFO L337 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### 25.50/15.64 --- Results --- 25.50/15.64 * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: 25.50/15.64 - StatisticsResult: Initial Icfg 25.50/15.64 23 locations, 29 edges 25.50/15.64 - StatisticsResult: Encoded RCFG 25.50/15.64 16 locations, 24 edges 25.50/15.64 * Results from de.uni_freiburg.informatik.ultimate.core: 25.50/15.64 - StatisticsResult: Toolchain Benchmarks 25.50/15.64 Benchmark results are: 25.50/15.64 * CDTParser took 0.17 ms. Allocated memory is still 649.6 MB. Free memory is still 580.0 MB. There was no memory consumed. Max. memory is 50.3 GB. 25.50/15.64 * CACSL2BoogieTranslator took 299.57 ms. Allocated memory is still 649.6 MB. Free memory was 559.2 MB in the beginning and 617.4 MB in the end (delta: -58.2 MB). Peak memory consumption was 31.3 MB. Max. memory is 50.3 GB. 25.50/15.64 * Boogie Procedure Inliner took 36.79 ms. Allocated memory is still 649.6 MB. Free memory was 617.4 MB in the beginning and 616.3 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 50.3 GB. 25.50/15.64 * Boogie Preprocessor took 18.60 ms. Allocated memory is still 649.6 MB. Free memory was 616.3 MB in the beginning and 614.1 MB in the end (delta: 2.2 MB). Peak memory consumption was 3.9 MB. Max. memory is 50.3 GB. 25.50/15.64 * RCFGBuilder took 237.18 ms. Allocated memory is still 649.6 MB. Free memory was 612.4 MB in the beginning and 596.7 MB in the end (delta: 15.7 MB). Peak memory consumption was 15.7 MB. Max. memory is 50.3 GB. 25.50/15.64 * BlockEncodingV2 took 98.13 ms. Allocated memory is still 649.6 MB. Free memory was 596.7 MB in the beginning and 590.2 MB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 50.3 GB. 25.50/15.64 * TraceAbstraction took 170.50 ms. Allocated memory is still 649.6 MB. Free memory was 589.1 MB in the beginning and 579.3 MB in the end (delta: 9.8 MB). Peak memory consumption was 9.8 MB. Max. memory is 50.3 GB. 25.50/15.64 * BuchiAutomizer took 10257.13 ms. Allocated memory was 649.6 MB in the beginning and 735.1 MB in the end (delta: 85.5 MB). Free memory was 578.3 MB in the beginning and 516.8 MB in the end (delta: 61.4 MB). Peak memory consumption was 146.9 MB. Max. memory is 50.3 GB. 25.50/15.64 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: 25.50/15.64 - AllSpecificationsHoldResult: All specifications hold 25.50/15.64 We were not able to verify any specifiation because the program does not contain any specification. 25.50/15.64 - StatisticsResult: Ultimate Automizer benchmark data 25.50/15.64 CFG has 3 procedures, 16 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=16occurred 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, 5 LocationsWithAnnotation, 7 PreInvPairs, 7 NumberOfFragments, 5 HoareAnnotationTreeSize, 7 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 5 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: No data available, ReuseStatistics: No data available 25.50/15.64 - StatisticsResult: Constructed decomposition of program 25.50/15.64 Your program was decomposed into 6 terminating modules (5 trivial, 0 deterministic, 1 nondeterministic). One nondeterministic module has affine ranking function n and consists of 12 locations. 5 modules have a trivial ranking function, the largest among these consists of 5 locations. 25.50/15.64 - StatisticsResult: Timing statistics 25.50/15.64 BüchiAutomizer plugin needed 10.2s and 7 iterations. TraceHistogramMax:2. Analysis of lassos took 9.3s. Construction of modules took 0.1s. Büchi inclusion checks took 0.5s. Highest rank in rank-based complementation 3. Minimization of det autom 5. Minimization of nondet autom 1. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 70 StatesRemovedByMinimization, 5 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 29 states and ocurred in iteration 5. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 51 SDtfs, 61 SDslu, 108 SDs, 0 SdLazy, 231 SolverSat, 25 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI2 SFLT1 conc2 concLT0 SILN1 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital13 mio100 ax100 hnf100 lsp100 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq169 hnf92 smp100 dnf100 smp100 tf109 neg100 sie108 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 8ms VariablesStem: 0 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 20 LassoNonterminationAnalysisSatUnbounded: 3 LassoNonterminationAnalysisUnsat: 1 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 7.5s 25.50/15.64 - TerminationAnalysisResult: Termination proven 25.50/15.64 Buchi Automizer proved that your program is terminating 25.50/15.64 RESULT: Ultimate proved your program to be correct! 25.50/15.64 !SESSION 2019-03-28 12:22:14.186 ----------------------------------------------- 25.50/15.64 eclipse.buildId=unknown 25.50/15.64 java.version=1.8.0_181 25.50/15.64 java.vendor=Oracle Corporation 25.50/15.64 BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US 25.50/15.64 Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox2/benchmark/theBenchmark.c 25.50/15.64 Command-line arguments: -os linux -ws gtk -arch x86_64 -consoleLog -data @user.home/.ultimate -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -data /export/starexec/sandbox2/tmp -i /export/starexec/sandbox2/benchmark/theBenchmark.c 25.50/15.64 25.50/15.64 !ENTRY org.eclipse.core.resources 2 10035 2019-03-28 12:22:28.868 25.50/15.64 !MESSAGE The workspace will exit with unsaved changes in this session. 25.50/15.64 Received shutdown request... 25.50/15.64 Ultimate: 25.50/15.64 GTK+ Version Check 25.50/15.64 EOF