YES Ultimate: Cannot open display: This is Ultimate 0.1.24-8dc7c08-m [2020-06-22 05:01:25,828 INFO L170 SettingsManager]: Resetting all preferences to default values... [2020-06-22 05:01:25,830 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2020-06-22 05:01:25,841 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-06-22 05:01:25,842 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-06-22 05:01:25,842 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-06-22 05:01:25,844 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-06-22 05:01:25,845 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2020-06-22 05:01:25,847 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-06-22 05:01:25,848 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-06-22 05:01:25,848 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-06-22 05:01:25,849 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-06-22 05:01:25,849 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-06-22 05:01:25,850 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-06-22 05:01:25,851 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-06-22 05:01:25,852 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-06-22 05:01:25,853 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-06-22 05:01:25,855 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-06-22 05:01:25,857 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2020-06-22 05:01:25,858 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-06-22 05:01:25,859 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-06-22 05:01:25,860 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-06-22 05:01:25,862 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-06-22 05:01:25,862 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-06-22 05:01:25,863 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-06-22 05:01:25,863 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-06-22 05:01:25,864 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-06-22 05:01:25,865 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-06-22 05:01:25,865 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-06-22 05:01:25,865 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-06-22 05:01:25,866 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-06-22 05:01:25,867 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2020-06-22 05:01:25,868 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-06-22 05:01:25,868 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2020-06-22 05:01:25,869 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-06-22 05:01:25,869 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-06-22 05:01:25,869 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2020-06-22 05:01:25,870 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2020-06-22 05:01:25,871 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2020-06-22 05:01:25,871 INFO L98 SettingsManager]: Beginning loading settings from /export/starexec/sandbox/solver/bin/./../termcomp2017.epf [2020-06-22 05:01:25,885 INFO L110 SettingsManager]: Loading preferences was successful [2020-06-22 05:01:25,885 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2020-06-22 05:01:25,886 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-06-22 05:01:25,887 INFO L133 SettingsManager]: * Rewrite not-equals=true [2020-06-22 05:01:25,887 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2020-06-22 05:01:25,887 INFO L133 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE [2020-06-22 05:01:25,887 INFO L133 SettingsManager]: * Use SBE=true [2020-06-22 05:01:25,887 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-06-22 05:01:25,888 INFO L133 SettingsManager]: * Use old map elimination=false [2020-06-22 05:01:25,888 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2020-06-22 05:01:25,888 INFO L133 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION [2020-06-22 05:01:25,888 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2020-06-22 05:01:25,888 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-06-22 05:01:25,888 INFO L133 SettingsManager]: * Construct termination proof for TermComp=true [2020-06-22 05:01:25,889 INFO L133 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 05:01:25,889 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-06-22 05:01:25,889 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-06-22 05:01:25,889 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2020-06-22 05:01:25,889 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2020-06-22 05:01:25,889 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-06-22 05:01:25,890 INFO L133 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE [2020-06-22 05:01:25,890 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-06-22 05:01:25,890 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-06-22 05:01:25,890 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-06-22 05:01:25,890 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-06-22 05:01:25,890 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-06-22 05:01:25,891 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-06-22 05:01:25,891 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2020-06-22 05:01:25,891 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-06-22 05:01:25,916 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-06-22 05:01:25,929 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-06-22 05:01:25,932 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-06-22 05:01:25,934 INFO L271 PluginConnector]: Initializing CDTParser... [2020-06-22 05:01:25,934 INFO L276 PluginConnector]: CDTParser initialized [2020-06-22 05:01:25,935 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox/benchmark/theBenchmark.c [2020-06-22 05:01:25,999 INFO L221 CDTParser]: Created temporary CDT project at /export/starexec/sandbox/tmp/955c5d0e822f40d9bf5517fde4d2d6f2/FLAG33286ae90 [2020-06-22 05:01:26,333 INFO L307 CDTParser]: Found 1 translation units. [2020-06-22 05:01:26,334 INFO L161 CDTParser]: Scanning /export/starexec/sandbox/benchmark/theBenchmark.c [2020-06-22 05:01:26,341 INFO L355 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox/tmp/955c5d0e822f40d9bf5517fde4d2d6f2/FLAG33286ae90 [2020-06-22 05:01:26,731 INFO L363 CDTParser]: Successfully deleted /export/starexec/sandbox/tmp/955c5d0e822f40d9bf5517fde4d2d6f2 [2020-06-22 05:01:26,742 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-06-22 05:01:26,744 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. [2020-06-22 05:01:26,745 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-06-22 05:01:26,745 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-06-22 05:01:26,749 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2020-06-22 05:01:26,749 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.06 05:01:26" (1/1) ... [2020-06-22 05:01:26,752 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f21a2fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 05:01:26, skipping insertion in model container [2020-06-22 05:01:26,753 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.06 05:01:26" (1/1) ... [2020-06-22 05:01:26,760 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-06-22 05:01:26,776 INFO L176 MainTranslator]: Built tables and reachable declarations [2020-06-22 05:01:26,926 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-06-22 05:01:26,930 INFO L191 MainTranslator]: Completed pre-run [2020-06-22 05:01:26,998 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-06-22 05:01:27,013 INFO L195 MainTranslator]: Completed translation [2020-06-22 05:01:27,013 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 05:01:27 WrapperNode [2020-06-22 05:01:27,014 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-06-22 05:01:27,014 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-06-22 05:01:27,015 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-06-22 05:01:27,015 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2020-06-22 05:01:27,024 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 05:01:27" (1/1) ... [2020-06-22 05:01:27,029 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 05:01:27" (1/1) ... [2020-06-22 05:01:27,047 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-06-22 05:01:27,047 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-06-22 05:01:27,047 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-06-22 05:01:27,047 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2020-06-22 05:01:27,057 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 05:01:27" (1/1) ... [2020-06-22 05:01:27,057 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 05:01:27" (1/1) ... [2020-06-22 05:01:27,057 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 05:01:27" (1/1) ... [2020-06-22 05:01:27,058 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 05:01:27" (1/1) ... [2020-06-22 05:01:27,060 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 05:01:27" (1/1) ... [2020-06-22 05:01:27,061 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 05:01:27" (1/1) ... [2020-06-22 05:01:27,062 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 05:01:27" (1/1) ... [2020-06-22 05:01:27,063 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-06-22 05:01:27,064 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-06-22 05:01:27,064 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-06-22 05:01:27,064 INFO L276 PluginConnector]: RCFGBuilder initialized [2020-06-22 05:01:27,065 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 05:01:27" (1/1) ... No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-06-22 05:01:27,129 INFO L130 BoogieDeclarations]: Found specification of procedure rec1 [2020-06-22 05:01:27,129 INFO L138 BoogieDeclarations]: Found implementation of procedure rec1 [2020-06-22 05:01:27,129 INFO L130 BoogieDeclarations]: Found specification of procedure rec2 [2020-06-22 05:01:27,129 INFO L138 BoogieDeclarations]: Found implementation of procedure rec2 [2020-06-22 05:01:27,129 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-06-22 05:01:27,130 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-06-22 05:01:27,264 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-06-22 05:01:27,265 INFO L286 CfgBuilder]: Removed 4 assue(true) statements. [2020-06-22 05:01:27,266 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 05:01:27 BoogieIcfgContainer [2020-06-22 05:01:27,266 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-06-22 05:01:27,266 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- [2020-06-22 05:01:27,267 INFO L271 PluginConnector]: Initializing BlockEncodingV2... [2020-06-22 05:01:27,269 INFO L276 PluginConnector]: BlockEncodingV2 initialized [2020-06-22 05:01:27,269 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 05:01:27" (1/1) ... [2020-06-22 05:01:27,287 INFO L313 BlockEncoder]: Initial Icfg 21 locations, 26 edges [2020-06-22 05:01:27,288 INFO L258 BlockEncoder]: Using Remove infeasible edges [2020-06-22 05:01:27,289 INFO L263 BlockEncoder]: Using Maximize final states [2020-06-22 05:01:27,290 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false [2020-06-22 05:01:27,290 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE [2020-06-22 05:01:27,292 INFO L296 BlockEncoder]: Using Remove sink states [2020-06-22 05:01:27,293 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true [2020-06-22 05:01:27,293 INFO L179 BlockEncoder]: Using Rewrite not-equals [2020-06-22 05:01:27,307 INFO L185 BlockEncoder]: Using Use SBE [2020-06-22 05:01:27,314 INFO L200 BlockEncoder]: SBE split 0 edges [2020-06-22 05:01:27,319 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-06-22 05:01:27,321 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-06-22 05:01:27,330 INFO L100 BaseMinimizeStates]: Removed 4 edges and 2 locations by large block encoding [2020-06-22 05:01:27,333 INFO L70 RemoveSinkStates]: Removed 2 edges and 2 locations by removing sink states [2020-06-22 05:01:27,334 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-06-22 05:01:27,335 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-06-22 05:01:27,335 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding [2020-06-22 05:01:27,335 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states [2020-06-22 05:01:27,336 INFO L313 BlockEncoder]: Encoded RCFG 17 locations, 22 edges [2020-06-22 05:01:27,336 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 05:01:27 BasicIcfg [2020-06-22 05:01:27,336 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- [2020-06-22 05:01:27,337 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-06-22 05:01:27,337 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-06-22 05:01:27,341 INFO L276 PluginConnector]: TraceAbstraction initialized [2020-06-22 05:01:27,341 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.06 05:01:26" (1/4) ... [2020-06-22 05:01:27,342 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f21056d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 05:01:27, skipping insertion in model container [2020-06-22 05:01:27,342 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 05:01:27" (2/4) ... [2020-06-22 05:01:27,342 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f21056d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 05:01:27, skipping insertion in model container [2020-06-22 05:01:27,342 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 05:01:27" (3/4) ... [2020-06-22 05:01:27,343 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f21056d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 05:01:27, skipping insertion in model container [2020-06-22 05:01:27,343 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 05:01:27" (4/4) ... [2020-06-22 05:01:27,344 INFO L112 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-06-22 05:01:27,354 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2020-06-22 05:01:27,362 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 0 error locations. [2020-06-22 05:01:27,378 INFO L257 AbstractCegarLoop]: Starting to check reachability of 0 error locations. [2020-06-22 05:01:27,411 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2020-06-22 05:01:27,412 INFO L382 AbstractCegarLoop]: Interprodecural is true [2020-06-22 05:01:27,412 INFO L383 AbstractCegarLoop]: Hoare is true [2020-06-22 05:01:27,412 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2020-06-22 05:01:27,413 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-06-22 05:01:27,413 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-06-22 05:01:27,413 INFO L387 AbstractCegarLoop]: Difference is false [2020-06-22 05:01:27,413 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-06-22 05:01:27,413 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-06-22 05:01:27,432 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states. [2020-06-22 05:01:27,439 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-06-22 05:01:27,446 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 17 states. [2020-06-22 05:01:27,512 INFO L451 ceAbstractionStarter]: At program point L14(line 14) the Hoare annotation is: true [2020-06-22 05:01:27,512 INFO L451 ceAbstractionStarter]: At program point rec1ENTRY(lines 11 15) the Hoare annotation is: true [2020-06-22 05:01:27,512 INFO L448 ceAbstractionStarter]: For program point rec1FINAL(lines 11 15) no Hoare annotation was computed. [2020-06-22 05:01:27,513 INFO L451 ceAbstractionStarter]: At program point L14-1(line 14) the Hoare annotation is: true [2020-06-22 05:01:27,513 INFO L448 ceAbstractionStarter]: For program point L12(lines 12 13) no Hoare annotation was computed. [2020-06-22 05:01:27,513 INFO L451 ceAbstractionStarter]: At program point L14-2(line 14) the Hoare annotation is: true [2020-06-22 05:01:27,513 INFO L448 ceAbstractionStarter]: For program point L14-3(line 14) no Hoare annotation was computed. [2020-06-22 05:01:27,513 INFO L448 ceAbstractionStarter]: For program point rec1EXIT(lines 11 15) no Hoare annotation was computed. [2020-06-22 05:01:27,514 INFO L451 ceAbstractionStarter]: At program point rec2ENTRY(lines 17 21) the Hoare annotation is: true [2020-06-22 05:01:27,514 INFO L448 ceAbstractionStarter]: For program point rec2FINAL(lines 17 21) no Hoare annotation was computed. [2020-06-22 05:01:27,514 INFO L448 ceAbstractionStarter]: For program point rec2EXIT(lines 17 21) no Hoare annotation was computed. [2020-06-22 05:01:27,514 INFO L451 ceAbstractionStarter]: At program point L20(line 20) the Hoare annotation is: true [2020-06-22 05:01:27,515 INFO L451 ceAbstractionStarter]: At program point L20-1(line 20) the Hoare annotation is: true [2020-06-22 05:01:27,515 INFO L448 ceAbstractionStarter]: For program point L18(lines 18 19) no Hoare annotation was computed. [2020-06-22 05:01:27,515 INFO L448 ceAbstractionStarter]: For program point L20-2(line 20) no Hoare annotation was computed. [2020-06-22 05:01:27,515 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-06-22 05:01:27,515 INFO L451 ceAbstractionStarter]: At program point L25(line 25) the Hoare annotation is: true [2020-06-22 05:01:27,519 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 05:01:27 BasicIcfg [2020-06-22 05:01:27,519 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-06-22 05:01:27,520 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-06-22 05:01:27,520 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-06-22 05:01:27,523 INFO L276 PluginConnector]: BuchiAutomizer initialized [2020-06-22 05:01:27,524 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 05:01:27,524 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.06 05:01:26" (1/5) ... [2020-06-22 05:01:27,525 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2bf358cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.06 05:01:27, skipping insertion in model container [2020-06-22 05:01:27,525 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 05:01:27,525 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 05:01:27" (2/5) ... [2020-06-22 05:01:27,526 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2bf358cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.06 05:01:27, skipping insertion in model container [2020-06-22 05:01:27,526 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 05:01:27,526 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 05:01:27" (3/5) ... [2020-06-22 05:01:27,526 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2bf358cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 05:01:27, skipping insertion in model container [2020-06-22 05:01:27,527 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 05:01:27,527 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 05:01:27" (4/5) ... [2020-06-22 05:01:27,527 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2bf358cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 05:01:27, skipping insertion in model container [2020-06-22 05:01:27,527 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 05:01:27,527 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 05:01:27" (5/5) ... [2020-06-22 05:01:27,529 INFO L375 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-06-22 05:01:27,556 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2020-06-22 05:01:27,556 INFO L374 BuchiCegarLoop]: Interprodecural is true [2020-06-22 05:01:27,556 INFO L375 BuchiCegarLoop]: Hoare is true [2020-06-22 05:01:27,557 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-06-22 05:01:27,557 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-06-22 05:01:27,557 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-06-22 05:01:27,557 INFO L379 BuchiCegarLoop]: Difference is false [2020-06-22 05:01:27,557 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-06-22 05:01:27,557 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-06-22 05:01:27,561 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states. [2020-06-22 05:01:27,582 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2020-06-22 05:01:27,582 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 05:01:27,582 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 05:01:27,590 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-06-22 05:01:27,590 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 05:01:27,590 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2020-06-22 05:01:27,590 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states. [2020-06-22 05:01:27,593 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2020-06-22 05:01:27,593 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 05:01:27,593 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 05:01:27,593 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-06-22 05:01:27,593 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 05:01:27,598 INFO L794 eck$LassoCheckResult]: Stem: 13#ULTIMATE.startENTRYtrue [47] ULTIMATE.startENTRY-->L25: Formula: (= v_ULTIMATE.start_main_~x~0_1 |v_ULTIMATE.start_main_#t~nondet5_4|) InVars {} OutVars{ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_1|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1, ULTIMATE.start_main_#t~ret6=|v_ULTIMATE.start_main_#t~ret6_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|} AuxVars[|v_ULTIMATE.start_main_#t~nondet5_4|] AssignedVars[ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_#res, ULTIMATE.start_main_~x~0, ULTIMATE.start_main_#t~ret6] 18#L25true [56] L25-->rec2ENTRY: Formula: (= |v_rec2_#in~jInParam_2| v_ULTIMATE.start_main_~x~0_5) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} OutVars{rec2_#in~j=|v_rec2_#in~jInParam_2|} AuxVars[] AssignedVars[rec2_#in~j]< 3#rec2ENTRYtrue [2020-06-22 05:01:27,599 INFO L796 eck$LassoCheckResult]: Loop: 3#rec2ENTRYtrue [38] rec2ENTRY-->L18: Formula: (= v_rec2_~j_1 |v_rec2_#in~j_1|) InVars {rec2_#in~j=|v_rec2_#in~j_1|} OutVars{rec2_~j=v_rec2_~j_1, rec2_#in~j=|v_rec2_#in~j_1|} AuxVars[] AssignedVars[rec2_~j] 16#L18true [64] L18-->L20: Formula: (> v_rec2_~j_3 0) InVars {rec2_~j=v_rec2_~j_3} OutVars{rec2_~j=v_rec2_~j_3} AuxVars[] AssignedVars[] 15#L20true [50] L20-->rec1ENTRY: Formula: (= |v_rec1_#in~iInParam_4| (+ v_rec2_~j_5 (- 1))) InVars {rec2_~j=v_rec2_~j_5} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_4|} AuxVars[] AssignedVars[rec1_#in~i]< 4#rec1ENTRYtrue [39] rec1ENTRY-->L12: Formula: (= v_rec1_~i_1 |v_rec1_#in~i_1|) InVars {rec1_#in~i=|v_rec1_#in~i_1|} OutVars{rec1_#in~i=|v_rec1_#in~i_1|, rec1_~i=v_rec1_~i_1} AuxVars[] AssignedVars[rec1_~i] 9#L12true [44] L12-->rec1FINAL: Formula: (and (<= v_rec1_~i_2 0) (= |v_rec1_#res_1| 0)) InVars {rec1_~i=v_rec1_~i_2} OutVars{rec1_#res=|v_rec1_#res_1|, rec1_~i=v_rec1_~i_2} AuxVars[] AssignedVars[rec1_#res] 5#rec1FINALtrue [40] rec1FINAL-->rec1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 12#rec1EXITtrue >[62] rec1EXIT-->L20-1: AOR: Formula: (= |v_rec2_#t~ret3_4| |v_rec1_#resOutParam_4|) InVars {rec1_#res=|v_rec1_#resOutParam_4|} OutVars{rec2_#t~ret3=|v_rec2_#t~ret3_4|} AuxVars[] AssignedVars[rec2_#t~ret3] LVA: Formula: (= |v_rec1_#in~iInParam_4| (+ v_rec2_~j_5 (- 1))) InVars {rec2_~j=v_rec2_~j_5} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_4|} AuxVars[] AssignedVars[rec1_#in~i] 19#L20-1true [57] L20-1-->rec2ENTRY: Formula: (= |v_rec2_#in~jInParam_1| |v_rec2_#t~ret3_5|) InVars {rec2_#t~ret3=|v_rec2_#t~ret3_5|} OutVars{rec2_#in~j=|v_rec2_#in~jInParam_1|} AuxVars[] AssignedVars[rec2_#in~j]< 3#rec2ENTRYtrue [2020-06-22 05:01:27,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 05:01:27,606 INFO L82 PathProgramCache]: Analyzing trace with hash 2474, now seen corresponding path program 1 times [2020-06-22 05:01:27,608 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 05:01:27,608 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 05:01:27,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:01:27,628 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 05:01:27,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:01:27,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:01:27,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:01:27,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 05:01:27,669 INFO L82 PathProgramCache]: Analyzing trace with hash -1865651641, now seen corresponding path program 1 times [2020-06-22 05:01:27,669 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 05:01:27,670 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 05:01:27,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:01:27,671 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 05:01:27,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:01:27,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:01:27,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:01:27,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 05:01:27,694 INFO L82 PathProgramCache]: Analyzing trace with hash -639583504, now seen corresponding path program 1 times [2020-06-22 05:01:27,694 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 05:01:27,694 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 05:01:27,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:01:27,696 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 05:01:27,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:01:27,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:01:27,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:01:27,844 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 05:01:27,845 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 05:01:27,845 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 05:01:27,845 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 05:01:27,846 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2020-06-22 05:01:27,846 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 05:01:27,846 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 05:01:27,846 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 05:01:27,846 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Loop [2020-06-22 05:01:27,846 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 05:01:27,847 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 05:01: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 [2020-06-22 05:01:27,871 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 05:01:27,873 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 05:01:27,875 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 05:01: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 [2020-06-22 05:01:27,933 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 05:01:27,935 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 05:01:27,942 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 05:01:27,942 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 05:01:27,953 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 05:01:27,953 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {rec2_~j=0} Honda state: {rec2_~j=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 05:01:27,984 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 05:01:27,984 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 05:01:27,988 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 05:01:27,988 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {rec2_#t~ret3=0} Honda state: {rec2_#t~ret3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 05:01:28,018 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 05:01:28,018 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 05:01:28,022 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 05:01:28,022 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {rec2_#res=0} Honda state: {rec2_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 05:01:28,050 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 05:01:28,051 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 05:01:28,054 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 05:01:28,054 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {rec2_#t~ret4=0} Honda state: {rec2_#t~ret4=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 05:01:28,082 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 05:01:28,082 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 05:01:28,113 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-06-22 05:01:28,113 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 05:01:28,119 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-06-22 05:01:28,143 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 05:01:28,143 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 05:01:28,144 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 05:01:28,144 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 05:01:28,144 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 05:01:28,144 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 05:01:28,144 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 05:01:28,144 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 05:01:28,144 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Loop [2020-06-22 05:01:28,145 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 05:01:28,145 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 05:01:28,146 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 05:01:28,149 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 05:01:28,152 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 05:01:28,154 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 05:01:28,162 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 05:01:28,201 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 05:01:28,207 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 05:01:28,209 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 05:01:28,210 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 05:01:28,210 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 05:01:28,211 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 05:01:28,211 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 05:01:28,211 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 05:01:28,213 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 05:01:28,214 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 05:01:28,218 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 05:01:28,218 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 05:01:28,219 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 05:01:28,219 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 05:01:28,219 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 05:01:28,219 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 05:01:28,219 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 05:01:28,220 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 05:01:28,220 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 05:01:28,221 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 05:01:28,222 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 05:01:28,222 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 05:01:28,222 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 05:01:28,223 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 05:01:28,223 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 05:01:28,223 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 05:01:28,223 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 05:01:28,223 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 05:01:28,225 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 05:01:28,225 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 05:01:28,226 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 05:01:28,226 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 05:01:28,226 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 05:01:28,226 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 05:01:28,226 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 05:01:28,227 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 05:01:28,227 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 05:01:28,233 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 05:01:28,238 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-06-22 05:01:28,239 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2020-06-22 05:01:28,241 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 05:01:28,241 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-06-22 05:01:28,241 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 05:01:28,242 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(rec2_#in~j) = 1*rec2_#in~j Supporting invariants [] [2020-06-22 05:01:28,243 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-06-22 05:01:28,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 05:01:28,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:01:28,293 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 05:01:28,295 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:01:28,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:01:28,322 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 11 conjunts are in the unsatisfiable core [2020-06-22 05:01:28,324 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:01:28,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 05:01:28,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:01:28,458 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 5 conjunts are in the unsatisfiable core [2020-06-22 05:01:28,459 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:01:28,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:01:28,551 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 05:01:28,551 INFO L98 LoopCannibalizer]: 6 predicates before loop cannibalization 9 predicates after loop cannibalization [2020-06-22 05:01:28,557 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 9 loop predicates [2020-06-22 05:01:28,558 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 17 states. Second operand 7 states. [2020-06-22 05:01:29,217 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 17 states.. Second operand 7 states. Result 193 states and 255 transitions. Complement of second has 56 states. [2020-06-22 05:01:29,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 15 states 1 stem states 11 non-accepting loop states 2 accepting loop states [2020-06-22 05:01:29,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-06-22 05:01:29,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 99 transitions. [2020-06-22 05:01:29,224 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 99 transitions. Stem has 2 letters. Loop has 8 letters. [2020-06-22 05:01:29,228 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 05:01:29,229 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 99 transitions. Stem has 10 letters. Loop has 8 letters. [2020-06-22 05:01:29,229 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 05:01:29,230 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 99 transitions. Stem has 2 letters. Loop has 16 letters. [2020-06-22 05:01:29,231 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 05:01:29,240 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 193 states and 255 transitions. [2020-06-22 05:01:29,255 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2020-06-22 05:01:29,264 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 193 states to 40 states and 58 transitions. [2020-06-22 05:01:29,265 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 39 [2020-06-22 05:01:29,266 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 40 [2020-06-22 05:01:29,266 INFO L73 IsDeterministic]: Start isDeterministic. Operand 40 states and 58 transitions. [2020-06-22 05:01:29,267 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 05:01:29,267 INFO L706 BuchiCegarLoop]: Abstraction has 40 states and 58 transitions. [2020-06-22 05:01:29,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states and 58 transitions. [2020-06-22 05:01:29,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 22. [2020-06-22 05:01:29,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2020-06-22 05:01:29,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 28 transitions. [2020-06-22 05:01:29,303 INFO L729 BuchiCegarLoop]: Abstraction has 22 states and 28 transitions. [2020-06-22 05:01:29,303 INFO L609 BuchiCegarLoop]: Abstraction has 22 states and 28 transitions. [2020-06-22 05:01:29,303 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2020-06-22 05:01:29,304 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 28 transitions. [2020-06-22 05:01:29,305 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2020-06-22 05:01:29,305 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 05:01:29,305 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 05:01:29,306 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-06-22 05:01:29,306 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 05:01:29,306 INFO L794 eck$LassoCheckResult]: Stem: 386#ULTIMATE.startENTRY [47] ULTIMATE.startENTRY-->L25: Formula: (= v_ULTIMATE.start_main_~x~0_1 |v_ULTIMATE.start_main_#t~nondet5_4|) InVars {} OutVars{ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_1|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1, ULTIMATE.start_main_#t~ret6=|v_ULTIMATE.start_main_#t~ret6_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|} AuxVars[|v_ULTIMATE.start_main_#t~nondet5_4|] AssignedVars[ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_#res, ULTIMATE.start_main_~x~0, ULTIMATE.start_main_#t~ret6] 373#L25 [56] L25-->rec2ENTRY: Formula: (= |v_rec2_#in~jInParam_2| v_ULTIMATE.start_main_~x~0_5) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} OutVars{rec2_#in~j=|v_rec2_#in~jInParam_2|} AuxVars[] AssignedVars[rec2_#in~j]< 370#rec2ENTRY [2020-06-22 05:01:29,307 INFO L796 eck$LassoCheckResult]: Loop: 370#rec2ENTRY [38] rec2ENTRY-->L18: Formula: (= v_rec2_~j_1 |v_rec2_#in~j_1|) InVars {rec2_#in~j=|v_rec2_#in~j_1|} OutVars{rec2_~j=v_rec2_~j_1, rec2_#in~j=|v_rec2_#in~j_1|} AuxVars[] AssignedVars[rec2_~j] 372#L18 [64] L18-->L20: Formula: (> v_rec2_~j_3 0) InVars {rec2_~j=v_rec2_~j_3} OutVars{rec2_~j=v_rec2_~j_3} AuxVars[] AssignedVars[] 387#L20 [50] L20-->rec1ENTRY: Formula: (= |v_rec1_#in~iInParam_4| (+ v_rec2_~j_5 (- 1))) InVars {rec2_~j=v_rec2_~j_5} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_4|} AuxVars[] AssignedVars[rec1_#in~i]< 388#rec1ENTRY [39] rec1ENTRY-->L12: Formula: (= v_rec1_~i_1 |v_rec1_#in~i_1|) InVars {rec1_#in~i=|v_rec1_#in~i_1|} OutVars{rec1_#in~i=|v_rec1_#in~i_1|, rec1_~i=v_rec1_~i_1} AuxVars[] AssignedVars[rec1_~i] 391#L12 [65] L12-->L14: Formula: (> v_rec1_~i_3 0) InVars {rec1_~i=v_rec1_~i_3} OutVars{rec1_~i=v_rec1_~i_3} AuxVars[] AssignedVars[] 375#L14 [48] L14-->rec1ENTRY: Formula: (= |v_rec1_#in~iInParam_1| (+ v_rec1_~i_5 (- 2))) InVars {rec1_~i=v_rec1_~i_5} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_1|} AuxVars[] AssignedVars[rec1_#in~i]< 374#rec1ENTRY [39] rec1ENTRY-->L12: Formula: (= v_rec1_~i_1 |v_rec1_#in~i_1|) InVars {rec1_#in~i=|v_rec1_#in~i_1|} OutVars{rec1_#in~i=|v_rec1_#in~i_1|, rec1_~i=v_rec1_~i_1} AuxVars[] AssignedVars[rec1_~i] 381#L12 [44] L12-->rec1FINAL: Formula: (and (<= v_rec1_~i_2 0) (= |v_rec1_#res_1| 0)) InVars {rec1_~i=v_rec1_~i_2} OutVars{rec1_#res=|v_rec1_#res_1|, rec1_~i=v_rec1_~i_2} AuxVars[] AssignedVars[rec1_#res] 382#rec1FINAL [40] rec1FINAL-->rec1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 383#rec1EXIT >[59] rec1EXIT-->L14-1: AOR: Formula: (= |v_rec1_#t~ret0_4| |v_rec1_#resOutParam_1|) InVars {rec1_#res=|v_rec1_#resOutParam_1|} OutVars{rec1_#t~ret0=|v_rec1_#t~ret0_4|} AuxVars[] AssignedVars[rec1_#t~ret0] LVA: Formula: (= |v_rec1_#in~iInParam_1| (+ v_rec1_~i_5 (- 2))) InVars {rec1_~i=v_rec1_~i_5} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_1|} AuxVars[] AssignedVars[rec1_#in~i] 380#L14-1 [42] L14-1-->rec1ENTRY: Formula: (= |v_rec1_#in~iInParam_2| (+ |v_rec1_#t~ret0_5| (- 1))) InVars {rec1_#t~ret0=|v_rec1_#t~ret0_5|} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_2|} AuxVars[] AssignedVars[rec1_#in~i]< 374#rec1ENTRY [39] rec1ENTRY-->L12: Formula: (= v_rec1_~i_1 |v_rec1_#in~i_1|) InVars {rec1_#in~i=|v_rec1_#in~i_1|} OutVars{rec1_#in~i=|v_rec1_#in~i_1|, rec1_~i=v_rec1_~i_1} AuxVars[] AssignedVars[rec1_~i] 381#L12 [44] L12-->rec1FINAL: Formula: (and (<= v_rec1_~i_2 0) (= |v_rec1_#res_1| 0)) InVars {rec1_~i=v_rec1_~i_2} OutVars{rec1_#res=|v_rec1_#res_1|, rec1_~i=v_rec1_~i_2} AuxVars[] AssignedVars[rec1_#res] 382#rec1FINAL [40] rec1FINAL-->rec1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 383#rec1EXIT >[58] rec1EXIT-->L14-2: AOR: Formula: (= |v_rec1_#t~ret1_4| |v_rec1_#resOutParam_2|) InVars {rec1_#res=|v_rec1_#resOutParam_2|} OutVars{rec1_#t~ret1=|v_rec1_#t~ret1_4|} AuxVars[] AssignedVars[rec1_#t~ret1] LVA: Formula: (= |v_rec1_#in~iInParam_2| (+ |v_rec1_#t~ret0_5| (- 1))) InVars {rec1_#t~ret0=|v_rec1_#t~ret0_5|} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_2|} AuxVars[] AssignedVars[rec1_#in~i] 377#L14-2 [46] L14-2-->rec1ENTRY: Formula: (= |v_rec1_#in~iInParam_3| |v_rec1_#t~ret1_5|) InVars {rec1_#t~ret1=|v_rec1_#t~ret1_5|} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_3|} AuxVars[] AssignedVars[rec1_#in~i]< 374#rec1ENTRY [39] rec1ENTRY-->L12: Formula: (= v_rec1_~i_1 |v_rec1_#in~i_1|) InVars {rec1_#in~i=|v_rec1_#in~i_1|} OutVars{rec1_#in~i=|v_rec1_#in~i_1|, rec1_~i=v_rec1_~i_1} AuxVars[] AssignedVars[rec1_~i] 381#L12 [44] L12-->rec1FINAL: Formula: (and (<= v_rec1_~i_2 0) (= |v_rec1_#res_1| 0)) InVars {rec1_~i=v_rec1_~i_2} OutVars{rec1_#res=|v_rec1_#res_1|, rec1_~i=v_rec1_~i_2} AuxVars[] AssignedVars[rec1_#res] 382#rec1FINAL [40] rec1FINAL-->rec1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 383#rec1EXIT >[63] rec1EXIT-->L14-3: AOR: Formula: (= |v_rec1_#t~ret2_4| |v_rec1_#resOutParam_3|) InVars {rec1_#res=|v_rec1_#resOutParam_3|} OutVars{rec1_#t~ret2=|v_rec1_#t~ret2_4|} AuxVars[] AssignedVars[rec1_#t~ret2] LVA: Formula: (= |v_rec1_#in~iInParam_3| |v_rec1_#t~ret1_5|) InVars {rec1_#t~ret1=|v_rec1_#t~ret1_5|} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_3|} AuxVars[] AssignedVars[rec1_#in~i] 385#L14-3 [43] L14-3-->rec1FINAL: Formula: (= |v_rec1_#res_2| (+ |v_rec1_#t~ret2_3| 1)) InVars {rec1_#t~ret2=|v_rec1_#t~ret2_3|} OutVars{rec1_#t~ret1=|v_rec1_#t~ret1_3|, rec1_#t~ret2=|v_rec1_#t~ret2_2|, rec1_#res=|v_rec1_#res_2|, rec1_#t~ret0=|v_rec1_#t~ret0_3|} AuxVars[] AssignedVars[rec1_#t~ret1, rec1_#t~ret2, rec1_#res, rec1_#t~ret0] 390#rec1FINAL [40] rec1FINAL-->rec1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 389#rec1EXIT >[62] rec1EXIT-->L20-1: AOR: Formula: (= |v_rec2_#t~ret3_4| |v_rec1_#resOutParam_4|) InVars {rec1_#res=|v_rec1_#resOutParam_4|} OutVars{rec2_#t~ret3=|v_rec2_#t~ret3_4|} AuxVars[] AssignedVars[rec2_#t~ret3] LVA: Formula: (= |v_rec1_#in~iInParam_4| (+ v_rec2_~j_5 (- 1))) InVars {rec2_~j=v_rec2_~j_5} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_4|} AuxVars[] AssignedVars[rec1_#in~i] 371#L20-1 [57] L20-1-->rec2ENTRY: Formula: (= |v_rec2_#in~jInParam_1| |v_rec2_#t~ret3_5|) InVars {rec2_#t~ret3=|v_rec2_#t~ret3_5|} OutVars{rec2_#in~j=|v_rec2_#in~jInParam_1|} AuxVars[] AssignedVars[rec2_#in~j]< 370#rec2ENTRY [2020-06-22 05:01:29,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 05:01:29,308 INFO L82 PathProgramCache]: Analyzing trace with hash 2474, now seen corresponding path program 2 times [2020-06-22 05:01:29,308 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 05:01:29,308 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 05:01:29,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:01:29,309 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 05:01:29,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:01:29,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:01:29,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:01:29,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 05:01:29,313 INFO L82 PathProgramCache]: Analyzing trace with hash -129367784, now seen corresponding path program 1 times [2020-06-22 05:01:29,314 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 05:01:29,314 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 05:01:29,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:01:29,315 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 05:01:29,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:01:29,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:01:29,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:01:29,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 05:01:29,339 INFO L82 PathProgramCache]: Analyzing trace with hash -287187007, now seen corresponding path program 1 times [2020-06-22 05:01:29,339 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 05:01:29,339 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 05:01:29,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:01:29,340 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 05:01:29,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:01:29,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:01:29,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:01:29,636 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 05:01:29,636 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 05:01:29,636 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 05:01:29,636 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 05:01:29,636 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2020-06-22 05:01:29,637 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 05:01:29,637 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 05:01:29,637 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 05:01:29,637 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration2_Loop [2020-06-22 05:01:29,637 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 05:01:29,637 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 05:01:29,638 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 05:01:29,644 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 05:01:29,646 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 05:01:29,648 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 05:01:29,649 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 05:01:29,671 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 05:01:29,672 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 05:01:29,674 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 05:01:29,675 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 05:01:29,705 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-06-22 05:01:29,705 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 05:01:29,709 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-06-22 05:01:29,734 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 05:01:29,734 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 05:01:29,735 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 05:01:29,735 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 05:01:29,735 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 05:01:29,735 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 05:01:29,735 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 05:01:29,735 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 05:01:29,735 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration2_Loop [2020-06-22 05:01:29,735 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 05:01:29,736 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 05:01:29,737 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 05:01:29,743 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 05:01:29,744 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 05:01:29,746 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 05:01:29,747 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 05:01:29,769 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 05:01:29,769 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 05:01:29,769 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 05:01:29,770 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 05:01:29,770 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 05:01:29,770 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 05:01:29,771 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 05:01:29,771 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 05:01:29,771 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 05:01:29,772 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 05:01:29,777 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 05:01:29,780 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-06-22 05:01:29,780 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2020-06-22 05:01:29,781 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 05:01:29,781 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-06-22 05:01:29,781 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 05:01:29,781 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(rec2_#in~j) = 1*rec2_#in~j Supporting invariants [] [2020-06-22 05:01:29,781 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-06-22 05:01:29,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 05:01:29,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:01:29,799 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 05:01:29,800 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:01:29,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:01:29,830 INFO L256 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 21 conjunts are in the unsatisfiable core [2020-06-22 05:01:29,832 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:01:29,946 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 8 proven. 5 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-06-22 05:01:30,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:01:30,055 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 05:01:30,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:01:30,087 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 05:01:30,087 INFO L98 LoopCannibalizer]: 10 predicates before loop cannibalization 10 predicates after loop cannibalization [2020-06-22 05:01:30,088 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 10 loop predicates [2020-06-22 05:01:30,088 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 22 states and 28 transitions. cyclomatic complexity: 8 Second operand 10 states. [2020-06-22 05:01:30,759 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 22 states and 28 transitions. cyclomatic complexity: 8. Second operand 10 states. Result 145 states and 219 transitions. Complement of second has 72 states. [2020-06-22 05:01:30,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 18 states 1 stem states 16 non-accepting loop states 1 accepting loop states [2020-06-22 05:01:30,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-06-22 05:01:30,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 73 transitions. [2020-06-22 05:01:30,762 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 73 transitions. Stem has 2 letters. Loop has 24 letters. [2020-06-22 05:01:30,763 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 05:01:30,763 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 73 transitions. Stem has 26 letters. Loop has 24 letters. [2020-06-22 05:01:30,764 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 05:01:30,764 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 73 transitions. Stem has 2 letters. Loop has 48 letters. [2020-06-22 05:01:30,765 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 05:01:30,768 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 145 states and 219 transitions. [2020-06-22 05:01:30,774 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14 [2020-06-22 05:01:30,781 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 145 states to 134 states and 208 transitions. [2020-06-22 05:01:30,781 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 59 [2020-06-22 05:01:30,781 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 62 [2020-06-22 05:01:30,782 INFO L73 IsDeterministic]: Start isDeterministic. Operand 134 states and 208 transitions. [2020-06-22 05:01:30,782 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 05:01:30,782 INFO L706 BuchiCegarLoop]: Abstraction has 134 states and 208 transitions. [2020-06-22 05:01:30,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states and 208 transitions. [2020-06-22 05:01:30,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 52. [2020-06-22 05:01:30,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2020-06-22 05:01:30,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 75 transitions. [2020-06-22 05:01:30,798 INFO L729 BuchiCegarLoop]: Abstraction has 52 states and 75 transitions. [2020-06-22 05:01:30,798 INFO L609 BuchiCegarLoop]: Abstraction has 52 states and 75 transitions. [2020-06-22 05:01:30,799 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2020-06-22 05:01:30,799 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 52 states and 75 transitions. [2020-06-22 05:01:30,800 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2020-06-22 05:01:30,800 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 05:01:30,800 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 05:01:30,802 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2020-06-22 05:01:30,802 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [7, 7, 5, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2020-06-22 05:01:30,802 INFO L794 eck$LassoCheckResult]: Stem: 782#ULTIMATE.startENTRY [47] ULTIMATE.startENTRY-->L25: Formula: (= v_ULTIMATE.start_main_~x~0_1 |v_ULTIMATE.start_main_#t~nondet5_4|) InVars {} OutVars{ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_1|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1, ULTIMATE.start_main_#t~ret6=|v_ULTIMATE.start_main_#t~ret6_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|} AuxVars[|v_ULTIMATE.start_main_#t~nondet5_4|] AssignedVars[ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_#res, ULTIMATE.start_main_~x~0, ULTIMATE.start_main_#t~ret6] 783#L25 [56] L25-->rec2ENTRY: Formula: (= |v_rec2_#in~jInParam_2| v_ULTIMATE.start_main_~x~0_5) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} OutVars{rec2_#in~j=|v_rec2_#in~jInParam_2|} AuxVars[] AssignedVars[rec2_#in~j]< 787#rec2ENTRY [38] rec2ENTRY-->L18: Formula: (= v_rec2_~j_1 |v_rec2_#in~j_1|) InVars {rec2_#in~j=|v_rec2_#in~j_1|} OutVars{rec2_~j=v_rec2_~j_1, rec2_#in~j=|v_rec2_#in~j_1|} AuxVars[] AssignedVars[rec2_~j] 748#L18 [2020-06-22 05:01:30,803 INFO L796 eck$LassoCheckResult]: Loop: 748#L18 [64] L18-->L20: Formula: (> v_rec2_~j_3 0) InVars {rec2_~j=v_rec2_~j_3} OutVars{rec2_~j=v_rec2_~j_3} AuxVars[] AssignedVars[] 772#L20 [50] L20-->rec1ENTRY: Formula: (= |v_rec1_#in~iInParam_4| (+ v_rec2_~j_5 (- 1))) InVars {rec2_~j=v_rec2_~j_5} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_4|} AuxVars[] AssignedVars[rec1_#in~i]< 784#rec1ENTRY [39] rec1ENTRY-->L12: Formula: (= v_rec1_~i_1 |v_rec1_#in~i_1|) InVars {rec1_#in~i=|v_rec1_#in~i_1|} OutVars{rec1_#in~i=|v_rec1_#in~i_1|, rec1_~i=v_rec1_~i_1} AuxVars[] AssignedVars[rec1_~i] 777#L12 [65] L12-->L14: Formula: (> v_rec1_~i_3 0) InVars {rec1_~i=v_rec1_~i_3} OutVars{rec1_~i=v_rec1_~i_3} AuxVars[] AssignedVars[] 757#L14 [48] L14-->rec1ENTRY: Formula: (= |v_rec1_#in~iInParam_1| (+ v_rec1_~i_5 (- 2))) InVars {rec1_~i=v_rec1_~i_5} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_1|} AuxVars[] AssignedVars[rec1_#in~i]< 752#rec1ENTRY [39] rec1ENTRY-->L12: Formula: (= v_rec1_~i_1 |v_rec1_#in~i_1|) InVars {rec1_#in~i=|v_rec1_#in~i_1|} OutVars{rec1_#in~i=|v_rec1_#in~i_1|, rec1_~i=v_rec1_~i_1} AuxVars[] AssignedVars[rec1_~i] 759#L12 [44] L12-->rec1FINAL: Formula: (and (<= v_rec1_~i_2 0) (= |v_rec1_#res_1| 0)) InVars {rec1_~i=v_rec1_~i_2} OutVars{rec1_#res=|v_rec1_#res_1|, rec1_~i=v_rec1_~i_2} AuxVars[] AssignedVars[rec1_#res] 768#rec1FINAL [40] rec1FINAL-->rec1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 769#rec1EXIT >[59] rec1EXIT-->L14-1: AOR: Formula: (= |v_rec1_#t~ret0_4| |v_rec1_#resOutParam_1|) InVars {rec1_#res=|v_rec1_#resOutParam_1|} OutVars{rec1_#t~ret0=|v_rec1_#t~ret0_4|} AuxVars[] AssignedVars[rec1_#t~ret0] LVA: Formula: (= |v_rec1_#in~iInParam_1| (+ v_rec1_~i_5 (- 2))) InVars {rec1_~i=v_rec1_~i_5} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_1|} AuxVars[] AssignedVars[rec1_#in~i] 754#L14-1 [42] L14-1-->rec1ENTRY: Formula: (= |v_rec1_#in~iInParam_2| (+ |v_rec1_#t~ret0_5| (- 1))) InVars {rec1_#t~ret0=|v_rec1_#t~ret0_5|} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_2|} AuxVars[] AssignedVars[rec1_#in~i]< 752#rec1ENTRY [39] rec1ENTRY-->L12: Formula: (= v_rec1_~i_1 |v_rec1_#in~i_1|) InVars {rec1_#in~i=|v_rec1_#in~i_1|} OutVars{rec1_#in~i=|v_rec1_#in~i_1|, rec1_~i=v_rec1_~i_1} AuxVars[] AssignedVars[rec1_~i] 759#L12 [44] L12-->rec1FINAL: Formula: (and (<= v_rec1_~i_2 0) (= |v_rec1_#res_1| 0)) InVars {rec1_~i=v_rec1_~i_2} OutVars{rec1_#res=|v_rec1_#res_1|, rec1_~i=v_rec1_~i_2} AuxVars[] AssignedVars[rec1_#res] 768#rec1FINAL [40] rec1FINAL-->rec1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 769#rec1EXIT >[58] rec1EXIT-->L14-2: AOR: Formula: (= |v_rec1_#t~ret1_4| |v_rec1_#resOutParam_2|) InVars {rec1_#res=|v_rec1_#resOutParam_2|} OutVars{rec1_#t~ret1=|v_rec1_#t~ret1_4|} AuxVars[] AssignedVars[rec1_#t~ret1] LVA: Formula: (= |v_rec1_#in~iInParam_2| (+ |v_rec1_#t~ret0_5| (- 1))) InVars {rec1_#t~ret0=|v_rec1_#t~ret0_5|} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_2|} AuxVars[] AssignedVars[rec1_#in~i] 755#L14-2 [46] L14-2-->rec1ENTRY: Formula: (= |v_rec1_#in~iInParam_3| |v_rec1_#t~ret1_5|) InVars {rec1_#t~ret1=|v_rec1_#t~ret1_5|} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_3|} AuxVars[] AssignedVars[rec1_#in~i]< 752#rec1ENTRY [39] rec1ENTRY-->L12: Formula: (= v_rec1_~i_1 |v_rec1_#in~i_1|) InVars {rec1_#in~i=|v_rec1_#in~i_1|} OutVars{rec1_#in~i=|v_rec1_#in~i_1|, rec1_~i=v_rec1_~i_1} AuxVars[] AssignedVars[rec1_~i] 759#L12 [65] L12-->L14: Formula: (> v_rec1_~i_3 0) InVars {rec1_~i=v_rec1_~i_3} OutVars{rec1_~i=v_rec1_~i_3} AuxVars[] AssignedVars[] 758#L14 [48] L14-->rec1ENTRY: Formula: (= |v_rec1_#in~iInParam_1| (+ v_rec1_~i_5 (- 2))) InVars {rec1_~i=v_rec1_~i_5} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_1|} AuxVars[] AssignedVars[rec1_#in~i]< 752#rec1ENTRY [39] rec1ENTRY-->L12: Formula: (= v_rec1_~i_1 |v_rec1_#in~i_1|) InVars {rec1_#in~i=|v_rec1_#in~i_1|} OutVars{rec1_#in~i=|v_rec1_#in~i_1|, rec1_~i=v_rec1_~i_1} AuxVars[] AssignedVars[rec1_~i] 759#L12 [44] L12-->rec1FINAL: Formula: (and (<= v_rec1_~i_2 0) (= |v_rec1_#res_1| 0)) InVars {rec1_~i=v_rec1_~i_2} OutVars{rec1_#res=|v_rec1_#res_1|, rec1_~i=v_rec1_~i_2} AuxVars[] AssignedVars[rec1_#res] 768#rec1FINAL [40] rec1FINAL-->rec1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 769#rec1EXIT >[59] rec1EXIT-->L14-1: AOR: Formula: (= |v_rec1_#t~ret0_4| |v_rec1_#resOutParam_1|) InVars {rec1_#res=|v_rec1_#resOutParam_1|} OutVars{rec1_#t~ret0=|v_rec1_#t~ret0_4|} AuxVars[] AssignedVars[rec1_#t~ret0] LVA: Formula: (= |v_rec1_#in~iInParam_1| (+ v_rec1_~i_5 (- 2))) InVars {rec1_~i=v_rec1_~i_5} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_1|} AuxVars[] AssignedVars[rec1_#in~i] 756#L14-1 [42] L14-1-->rec1ENTRY: Formula: (= |v_rec1_#in~iInParam_2| (+ |v_rec1_#t~ret0_5| (- 1))) InVars {rec1_#t~ret0=|v_rec1_#t~ret0_5|} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_2|} AuxVars[] AssignedVars[rec1_#in~i]< 752#rec1ENTRY [39] rec1ENTRY-->L12: Formula: (= v_rec1_~i_1 |v_rec1_#in~i_1|) InVars {rec1_#in~i=|v_rec1_#in~i_1|} OutVars{rec1_#in~i=|v_rec1_#in~i_1|, rec1_~i=v_rec1_~i_1} AuxVars[] AssignedVars[rec1_~i] 759#L12 [44] L12-->rec1FINAL: Formula: (and (<= v_rec1_~i_2 0) (= |v_rec1_#res_1| 0)) InVars {rec1_~i=v_rec1_~i_2} OutVars{rec1_#res=|v_rec1_#res_1|, rec1_~i=v_rec1_~i_2} AuxVars[] AssignedVars[rec1_#res] 768#rec1FINAL [40] rec1FINAL-->rec1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 769#rec1EXIT >[58] rec1EXIT-->L14-2: AOR: Formula: (= |v_rec1_#t~ret1_4| |v_rec1_#resOutParam_2|) InVars {rec1_#res=|v_rec1_#resOutParam_2|} OutVars{rec1_#t~ret1=|v_rec1_#t~ret1_4|} AuxVars[] AssignedVars[rec1_#t~ret1] LVA: Formula: (= |v_rec1_#in~iInParam_2| (+ |v_rec1_#t~ret0_5| (- 1))) InVars {rec1_#t~ret0=|v_rec1_#t~ret0_5|} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_2|} AuxVars[] AssignedVars[rec1_#in~i] 753#L14-2 [46] L14-2-->rec1ENTRY: Formula: (= |v_rec1_#in~iInParam_3| |v_rec1_#t~ret1_5|) InVars {rec1_#t~ret1=|v_rec1_#t~ret1_5|} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_3|} AuxVars[] AssignedVars[rec1_#in~i]< 752#rec1ENTRY [39] rec1ENTRY-->L12: Formula: (= v_rec1_~i_1 |v_rec1_#in~i_1|) InVars {rec1_#in~i=|v_rec1_#in~i_1|} OutVars{rec1_#in~i=|v_rec1_#in~i_1|, rec1_~i=v_rec1_~i_1} AuxVars[] AssignedVars[rec1_~i] 759#L12 [44] L12-->rec1FINAL: Formula: (and (<= v_rec1_~i_2 0) (= |v_rec1_#res_1| 0)) InVars {rec1_~i=v_rec1_~i_2} OutVars{rec1_#res=|v_rec1_#res_1|, rec1_~i=v_rec1_~i_2} AuxVars[] AssignedVars[rec1_#res] 768#rec1FINAL [40] rec1FINAL-->rec1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 769#rec1EXIT >[63] rec1EXIT-->L14-3: AOR: Formula: (= |v_rec1_#t~ret2_4| |v_rec1_#resOutParam_3|) InVars {rec1_#res=|v_rec1_#resOutParam_3|} OutVars{rec1_#t~ret2=|v_rec1_#t~ret2_4|} AuxVars[] AssignedVars[rec1_#t~ret2] LVA: Formula: (= |v_rec1_#in~iInParam_3| |v_rec1_#t~ret1_5|) InVars {rec1_#t~ret1=|v_rec1_#t~ret1_5|} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_3|} AuxVars[] AssignedVars[rec1_#in~i] 774#L14-3 [43] L14-3-->rec1FINAL: Formula: (= |v_rec1_#res_2| (+ |v_rec1_#t~ret2_3| 1)) InVars {rec1_#t~ret2=|v_rec1_#t~ret2_3|} OutVars{rec1_#t~ret1=|v_rec1_#t~ret1_3|, rec1_#t~ret2=|v_rec1_#t~ret2_2|, rec1_#res=|v_rec1_#res_2|, rec1_#t~ret0=|v_rec1_#t~ret0_3|} AuxVars[] AssignedVars[rec1_#t~ret1, rec1_#t~ret2, rec1_#res, rec1_#t~ret0] 775#rec1FINAL [40] rec1FINAL-->rec1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 791#rec1EXIT >[63] rec1EXIT-->L14-3: AOR: Formula: (= |v_rec1_#t~ret2_4| |v_rec1_#resOutParam_3|) InVars {rec1_#res=|v_rec1_#resOutParam_3|} OutVars{rec1_#t~ret2=|v_rec1_#t~ret2_4|} AuxVars[] AssignedVars[rec1_#t~ret2] LVA: Formula: (= |v_rec1_#in~iInParam_3| |v_rec1_#t~ret1_5|) InVars {rec1_#t~ret1=|v_rec1_#t~ret1_5|} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_3|} AuxVars[] AssignedVars[rec1_#in~i] 790#L14-3 [43] L14-3-->rec1FINAL: Formula: (= |v_rec1_#res_2| (+ |v_rec1_#t~ret2_3| 1)) InVars {rec1_#t~ret2=|v_rec1_#t~ret2_3|} OutVars{rec1_#t~ret1=|v_rec1_#t~ret1_3|, rec1_#t~ret2=|v_rec1_#t~ret2_2|, rec1_#res=|v_rec1_#res_2|, rec1_#t~ret0=|v_rec1_#t~ret0_3|} AuxVars[] AssignedVars[rec1_#t~ret1, rec1_#t~ret2, rec1_#res, rec1_#t~ret0] 789#rec1FINAL [40] rec1FINAL-->rec1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 779#rec1EXIT >[62] rec1EXIT-->L20-1: AOR: Formula: (= |v_rec2_#t~ret3_4| |v_rec1_#resOutParam_4|) InVars {rec1_#res=|v_rec1_#resOutParam_4|} OutVars{rec2_#t~ret3=|v_rec2_#t~ret3_4|} AuxVars[] AssignedVars[rec2_#t~ret3] LVA: Formula: (= |v_rec1_#in~iInParam_4| (+ v_rec2_~j_5 (- 1))) InVars {rec2_~j=v_rec2_~j_5} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_4|} AuxVars[] AssignedVars[rec1_#in~i] 747#L20-1 [57] L20-1-->rec2ENTRY: Formula: (= |v_rec2_#in~jInParam_1| |v_rec2_#t~ret3_5|) InVars {rec2_#t~ret3=|v_rec2_#t~ret3_5|} OutVars{rec2_#in~j=|v_rec2_#in~jInParam_1|} AuxVars[] AssignedVars[rec2_#in~j]< 746#rec2ENTRY [38] rec2ENTRY-->L18: Formula: (= v_rec2_~j_1 |v_rec2_#in~j_1|) InVars {rec2_#in~j=|v_rec2_#in~j_1|} OutVars{rec2_~j=v_rec2_~j_1, rec2_#in~j=|v_rec2_#in~j_1|} AuxVars[] AssignedVars[rec2_~j] 748#L18 [2020-06-22 05:01:30,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 05:01:30,803 INFO L82 PathProgramCache]: Analyzing trace with hash 76732, now seen corresponding path program 1 times [2020-06-22 05:01:30,804 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 05:01:30,804 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 05:01:30,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:01:30,805 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 05:01:30,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:01:30,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:01:30,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:01:30,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 05:01:30,809 INFO L82 PathProgramCache]: Analyzing trace with hash 1000338971, now seen corresponding path program 2 times [2020-06-22 05:01:30,809 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 05:01:30,809 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 05:01:30,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:01:30,810 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 05:01:30,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:01:30,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:01:30,880 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 28 proven. 12 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2020-06-22 05:01:30,882 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 05:01:30,882 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2020-06-22 05:01:30,893 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2020-06-22 05:01:30,910 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-06-22 05:01:30,910 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-06-22 05:01:30,911 INFO L256 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 5 conjunts are in the unsatisfiable core [2020-06-22 05:01:30,913 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:01:30,925 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 28 proven. 12 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2020-06-22 05:01:30,951 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-06-22 05:01:30,952 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2020-06-22 05:01:30,954 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-06-22 05:01:30,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-06-22 05:01:30,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-06-22 05:01:30,958 INFO L87 Difference]: Start difference. First operand 52 states and 75 transitions. cyclomatic complexity: 27 Second operand 6 states. [2020-06-22 05:01:31,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 05:01:31,064 INFO L93 Difference]: Finished difference Result 59 states and 85 transitions. [2020-06-22 05:01:31,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-06-22 05:01:31,067 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 59 states and 85 transitions. [2020-06-22 05:01:31,070 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2020-06-22 05:01:31,072 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 59 states to 59 states and 85 transitions. [2020-06-22 05:01:31,072 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2020-06-22 05:01:31,073 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2020-06-22 05:01:31,073 INFO L73 IsDeterministic]: Start isDeterministic. Operand 59 states and 85 transitions. [2020-06-22 05:01:31,073 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 05:01:31,073 INFO L706 BuchiCegarLoop]: Abstraction has 59 states and 85 transitions. [2020-06-22 05:01:31,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states and 85 transitions. [2020-06-22 05:01:31,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 56. [2020-06-22 05:01:31,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2020-06-22 05:01:31,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 82 transitions. [2020-06-22 05:01:31,080 INFO L729 BuchiCegarLoop]: Abstraction has 56 states and 82 transitions. [2020-06-22 05:01:31,080 INFO L609 BuchiCegarLoop]: Abstraction has 56 states and 82 transitions. [2020-06-22 05:01:31,080 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2020-06-22 05:01:31,080 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 56 states and 82 transitions. [2020-06-22 05:01:31,081 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2020-06-22 05:01:31,081 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 05:01:31,081 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 05:01:31,085 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2020-06-22 05:01:31,085 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [10, 10, 7, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1] [2020-06-22 05:01:31,085 INFO L794 eck$LassoCheckResult]: Stem: 1028#ULTIMATE.startENTRY [47] ULTIMATE.startENTRY-->L25: Formula: (= v_ULTIMATE.start_main_~x~0_1 |v_ULTIMATE.start_main_#t~nondet5_4|) InVars {} OutVars{ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_1|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1, ULTIMATE.start_main_#t~ret6=|v_ULTIMATE.start_main_#t~ret6_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|} AuxVars[|v_ULTIMATE.start_main_#t~nondet5_4|] AssignedVars[ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_#res, ULTIMATE.start_main_~x~0, ULTIMATE.start_main_#t~ret6] 1029#L25 [56] L25-->rec2ENTRY: Formula: (= |v_rec2_#in~jInParam_2| v_ULTIMATE.start_main_~x~0_5) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} OutVars{rec2_#in~j=|v_rec2_#in~jInParam_2|} AuxVars[] AssignedVars[rec2_#in~j]< 1032#rec2ENTRY [38] rec2ENTRY-->L18: Formula: (= v_rec2_~j_1 |v_rec2_#in~j_1|) InVars {rec2_#in~j=|v_rec2_#in~j_1|} OutVars{rec2_~j=v_rec2_~j_1, rec2_#in~j=|v_rec2_#in~j_1|} AuxVars[] AssignedVars[rec2_~j] 992#L18 [2020-06-22 05:01:31,087 INFO L796 eck$LassoCheckResult]: Loop: 992#L18 [64] L18-->L20: Formula: (> v_rec2_~j_3 0) InVars {rec2_~j=v_rec2_~j_3} OutVars{rec2_~j=v_rec2_~j_3} AuxVars[] AssignedVars[] 1025#L20 [50] L20-->rec1ENTRY: Formula: (= |v_rec1_#in~iInParam_4| (+ v_rec2_~j_5 (- 1))) InVars {rec2_~j=v_rec2_~j_5} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_4|} AuxVars[] AssignedVars[rec1_#in~i]< 1031#rec1ENTRY [39] rec1ENTRY-->L12: Formula: (= v_rec1_~i_1 |v_rec1_#in~i_1|) InVars {rec1_#in~i=|v_rec1_#in~i_1|} OutVars{rec1_#in~i=|v_rec1_#in~i_1|, rec1_~i=v_rec1_~i_1} AuxVars[] AssignedVars[rec1_~i] 1043#L12 [65] L12-->L14: Formula: (> v_rec1_~i_3 0) InVars {rec1_~i=v_rec1_~i_3} OutVars{rec1_~i=v_rec1_~i_3} AuxVars[] AssignedVars[] 998#L14 [48] L14-->rec1ENTRY: Formula: (= |v_rec1_#in~iInParam_1| (+ v_rec1_~i_5 (- 2))) InVars {rec1_~i=v_rec1_~i_5} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_1|} AuxVars[] AssignedVars[rec1_#in~i]< 996#rec1ENTRY [39] rec1ENTRY-->L12: Formula: (= v_rec1_~i_1 |v_rec1_#in~i_1|) InVars {rec1_#in~i=|v_rec1_#in~i_1|} OutVars{rec1_#in~i=|v_rec1_#in~i_1|, rec1_~i=v_rec1_~i_1} AuxVars[] AssignedVars[rec1_~i] 1005#L12 [44] L12-->rec1FINAL: Formula: (and (<= v_rec1_~i_2 0) (= |v_rec1_#res_1| 0)) InVars {rec1_~i=v_rec1_~i_2} OutVars{rec1_#res=|v_rec1_#res_1|, rec1_~i=v_rec1_~i_2} AuxVars[] AssignedVars[rec1_#res] 1024#rec1FINAL [40] rec1FINAL-->rec1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 1026#rec1EXIT >[59] rec1EXIT-->L14-1: AOR: Formula: (= |v_rec1_#t~ret0_4| |v_rec1_#resOutParam_1|) InVars {rec1_#res=|v_rec1_#resOutParam_1|} OutVars{rec1_#t~ret0=|v_rec1_#t~ret0_4|} AuxVars[] AssignedVars[rec1_#t~ret0] LVA: Formula: (= |v_rec1_#in~iInParam_1| (+ v_rec1_~i_5 (- 2))) InVars {rec1_~i=v_rec1_~i_5} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_1|} AuxVars[] AssignedVars[rec1_#in~i] 997#L14-1 [42] L14-1-->rec1ENTRY: Formula: (= |v_rec1_#in~iInParam_2| (+ |v_rec1_#t~ret0_5| (- 1))) InVars {rec1_#t~ret0=|v_rec1_#t~ret0_5|} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_2|} AuxVars[] AssignedVars[rec1_#in~i]< 996#rec1ENTRY [39] rec1ENTRY-->L12: Formula: (= v_rec1_~i_1 |v_rec1_#in~i_1|) InVars {rec1_#in~i=|v_rec1_#in~i_1|} OutVars{rec1_#in~i=|v_rec1_#in~i_1|, rec1_~i=v_rec1_~i_1} AuxVars[] AssignedVars[rec1_~i] 1005#L12 [65] L12-->L14: Formula: (> v_rec1_~i_3 0) InVars {rec1_~i=v_rec1_~i_3} OutVars{rec1_~i=v_rec1_~i_3} AuxVars[] AssignedVars[] 1003#L14 [48] L14-->rec1ENTRY: Formula: (= |v_rec1_#in~iInParam_1| (+ v_rec1_~i_5 (- 2))) InVars {rec1_~i=v_rec1_~i_5} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_1|} AuxVars[] AssignedVars[rec1_#in~i]< 996#rec1ENTRY [39] rec1ENTRY-->L12: Formula: (= v_rec1_~i_1 |v_rec1_#in~i_1|) InVars {rec1_#in~i=|v_rec1_#in~i_1|} OutVars{rec1_#in~i=|v_rec1_#in~i_1|, rec1_~i=v_rec1_~i_1} AuxVars[] AssignedVars[rec1_~i] 1005#L12 [44] L12-->rec1FINAL: Formula: (and (<= v_rec1_~i_2 0) (= |v_rec1_#res_1| 0)) InVars {rec1_~i=v_rec1_~i_2} OutVars{rec1_#res=|v_rec1_#res_1|, rec1_~i=v_rec1_~i_2} AuxVars[] AssignedVars[rec1_#res] 1024#rec1FINAL [40] rec1FINAL-->rec1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 1026#rec1EXIT >[59] rec1EXIT-->L14-1: AOR: Formula: (= |v_rec1_#t~ret0_4| |v_rec1_#resOutParam_1|) InVars {rec1_#res=|v_rec1_#resOutParam_1|} OutVars{rec1_#t~ret0=|v_rec1_#t~ret0_4|} AuxVars[] AssignedVars[rec1_#t~ret0] LVA: Formula: (= |v_rec1_#in~iInParam_1| (+ v_rec1_~i_5 (- 2))) InVars {rec1_~i=v_rec1_~i_5} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_1|} AuxVars[] AssignedVars[rec1_#in~i] 1002#L14-1 [42] L14-1-->rec1ENTRY: Formula: (= |v_rec1_#in~iInParam_2| (+ |v_rec1_#t~ret0_5| (- 1))) InVars {rec1_#t~ret0=|v_rec1_#t~ret0_5|} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_2|} AuxVars[] AssignedVars[rec1_#in~i]< 996#rec1ENTRY [39] rec1ENTRY-->L12: Formula: (= v_rec1_~i_1 |v_rec1_#in~i_1|) InVars {rec1_#in~i=|v_rec1_#in~i_1|} OutVars{rec1_#in~i=|v_rec1_#in~i_1|, rec1_~i=v_rec1_~i_1} AuxVars[] AssignedVars[rec1_~i] 1005#L12 [44] L12-->rec1FINAL: Formula: (and (<= v_rec1_~i_2 0) (= |v_rec1_#res_1| 0)) InVars {rec1_~i=v_rec1_~i_2} OutVars{rec1_#res=|v_rec1_#res_1|, rec1_~i=v_rec1_~i_2} AuxVars[] AssignedVars[rec1_#res] 1024#rec1FINAL [40] rec1FINAL-->rec1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 1026#rec1EXIT >[58] rec1EXIT-->L14-2: AOR: Formula: (= |v_rec1_#t~ret1_4| |v_rec1_#resOutParam_2|) InVars {rec1_#res=|v_rec1_#resOutParam_2|} OutVars{rec1_#t~ret1=|v_rec1_#t~ret1_4|} AuxVars[] AssignedVars[rec1_#t~ret1] LVA: Formula: (= |v_rec1_#in~iInParam_2| (+ |v_rec1_#t~ret0_5| (- 1))) InVars {rec1_#t~ret0=|v_rec1_#t~ret0_5|} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_2|} AuxVars[] AssignedVars[rec1_#in~i] 1004#L14-2 [46] L14-2-->rec1ENTRY: Formula: (= |v_rec1_#in~iInParam_3| |v_rec1_#t~ret1_5|) InVars {rec1_#t~ret1=|v_rec1_#t~ret1_5|} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_3|} AuxVars[] AssignedVars[rec1_#in~i]< 996#rec1ENTRY [39] rec1ENTRY-->L12: Formula: (= v_rec1_~i_1 |v_rec1_#in~i_1|) InVars {rec1_#in~i=|v_rec1_#in~i_1|} OutVars{rec1_#in~i=|v_rec1_#in~i_1|, rec1_~i=v_rec1_~i_1} AuxVars[] AssignedVars[rec1_~i] 1005#L12 [44] L12-->rec1FINAL: Formula: (and (<= v_rec1_~i_2 0) (= |v_rec1_#res_1| 0)) InVars {rec1_~i=v_rec1_~i_2} OutVars{rec1_#res=|v_rec1_#res_1|, rec1_~i=v_rec1_~i_2} AuxVars[] AssignedVars[rec1_#res] 1024#rec1FINAL [40] rec1FINAL-->rec1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 1026#rec1EXIT >[63] rec1EXIT-->L14-3: AOR: Formula: (= |v_rec1_#t~ret2_4| |v_rec1_#resOutParam_3|) InVars {rec1_#res=|v_rec1_#resOutParam_3|} OutVars{rec1_#t~ret2=|v_rec1_#t~ret2_4|} AuxVars[] AssignedVars[rec1_#t~ret2] LVA: Formula: (= |v_rec1_#in~iInParam_3| |v_rec1_#t~ret1_5|) InVars {rec1_#t~ret1=|v_rec1_#t~ret1_5|} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_3|} AuxVars[] AssignedVars[rec1_#in~i] 1022#L14-3 [43] L14-3-->rec1FINAL: Formula: (= |v_rec1_#res_2| (+ |v_rec1_#t~ret2_3| 1)) InVars {rec1_#t~ret2=|v_rec1_#t~ret2_3|} OutVars{rec1_#t~ret1=|v_rec1_#t~ret1_3|, rec1_#t~ret2=|v_rec1_#t~ret2_2|, rec1_#res=|v_rec1_#res_2|, rec1_#t~ret0=|v_rec1_#t~ret0_3|} AuxVars[] AssignedVars[rec1_#t~ret1, rec1_#t~ret2, rec1_#res, rec1_#t~ret0] 1009#rec1FINAL [40] rec1FINAL-->rec1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 1010#rec1EXIT >[58] rec1EXIT-->L14-2: AOR: Formula: (= |v_rec1_#t~ret1_4| |v_rec1_#resOutParam_2|) InVars {rec1_#res=|v_rec1_#resOutParam_2|} OutVars{rec1_#t~ret1=|v_rec1_#t~ret1_4|} AuxVars[] AssignedVars[rec1_#t~ret1] LVA: Formula: (= |v_rec1_#in~iInParam_2| (+ |v_rec1_#t~ret0_5| (- 1))) InVars {rec1_#t~ret0=|v_rec1_#t~ret0_5|} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_2|} AuxVars[] AssignedVars[rec1_#in~i] 999#L14-2 [46] L14-2-->rec1ENTRY: Formula: (= |v_rec1_#in~iInParam_3| |v_rec1_#t~ret1_5|) InVars {rec1_#t~ret1=|v_rec1_#t~ret1_5|} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_3|} AuxVars[] AssignedVars[rec1_#in~i]< 996#rec1ENTRY [39] rec1ENTRY-->L12: Formula: (= v_rec1_~i_1 |v_rec1_#in~i_1|) InVars {rec1_#in~i=|v_rec1_#in~i_1|} OutVars{rec1_#in~i=|v_rec1_#in~i_1|, rec1_~i=v_rec1_~i_1} AuxVars[] AssignedVars[rec1_~i] 1005#L12 [65] L12-->L14: Formula: (> v_rec1_~i_3 0) InVars {rec1_~i=v_rec1_~i_3} OutVars{rec1_~i=v_rec1_~i_3} AuxVars[] AssignedVars[] 1003#L14 [48] L14-->rec1ENTRY: Formula: (= |v_rec1_#in~iInParam_1| (+ v_rec1_~i_5 (- 2))) InVars {rec1_~i=v_rec1_~i_5} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_1|} AuxVars[] AssignedVars[rec1_#in~i]< 996#rec1ENTRY [39] rec1ENTRY-->L12: Formula: (= v_rec1_~i_1 |v_rec1_#in~i_1|) InVars {rec1_#in~i=|v_rec1_#in~i_1|} OutVars{rec1_#in~i=|v_rec1_#in~i_1|, rec1_~i=v_rec1_~i_1} AuxVars[] AssignedVars[rec1_~i] 1005#L12 [44] L12-->rec1FINAL: Formula: (and (<= v_rec1_~i_2 0) (= |v_rec1_#res_1| 0)) InVars {rec1_~i=v_rec1_~i_2} OutVars{rec1_#res=|v_rec1_#res_1|, rec1_~i=v_rec1_~i_2} AuxVars[] AssignedVars[rec1_#res] 1024#rec1FINAL [40] rec1FINAL-->rec1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 1026#rec1EXIT >[59] rec1EXIT-->L14-1: AOR: Formula: (= |v_rec1_#t~ret0_4| |v_rec1_#resOutParam_1|) InVars {rec1_#res=|v_rec1_#resOutParam_1|} OutVars{rec1_#t~ret0=|v_rec1_#t~ret0_4|} AuxVars[] AssignedVars[rec1_#t~ret0] LVA: Formula: (= |v_rec1_#in~iInParam_1| (+ v_rec1_~i_5 (- 2))) InVars {rec1_~i=v_rec1_~i_5} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_1|} AuxVars[] AssignedVars[rec1_#in~i] 1002#L14-1 [42] L14-1-->rec1ENTRY: Formula: (= |v_rec1_#in~iInParam_2| (+ |v_rec1_#t~ret0_5| (- 1))) InVars {rec1_#t~ret0=|v_rec1_#t~ret0_5|} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_2|} AuxVars[] AssignedVars[rec1_#in~i]< 996#rec1ENTRY [39] rec1ENTRY-->L12: Formula: (= v_rec1_~i_1 |v_rec1_#in~i_1|) InVars {rec1_#in~i=|v_rec1_#in~i_1|} OutVars{rec1_#in~i=|v_rec1_#in~i_1|, rec1_~i=v_rec1_~i_1} AuxVars[] AssignedVars[rec1_~i] 1005#L12 [44] L12-->rec1FINAL: Formula: (and (<= v_rec1_~i_2 0) (= |v_rec1_#res_1| 0)) InVars {rec1_~i=v_rec1_~i_2} OutVars{rec1_#res=|v_rec1_#res_1|, rec1_~i=v_rec1_~i_2} AuxVars[] AssignedVars[rec1_#res] 1024#rec1FINAL [40] rec1FINAL-->rec1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 1026#rec1EXIT >[58] rec1EXIT-->L14-2: AOR: Formula: (= |v_rec1_#t~ret1_4| |v_rec1_#resOutParam_2|) InVars {rec1_#res=|v_rec1_#resOutParam_2|} OutVars{rec1_#t~ret1=|v_rec1_#t~ret1_4|} AuxVars[] AssignedVars[rec1_#t~ret1] LVA: Formula: (= |v_rec1_#in~iInParam_2| (+ |v_rec1_#t~ret0_5| (- 1))) InVars {rec1_#t~ret0=|v_rec1_#t~ret0_5|} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_2|} AuxVars[] AssignedVars[rec1_#in~i] 1004#L14-2 [46] L14-2-->rec1ENTRY: Formula: (= |v_rec1_#in~iInParam_3| |v_rec1_#t~ret1_5|) InVars {rec1_#t~ret1=|v_rec1_#t~ret1_5|} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_3|} AuxVars[] AssignedVars[rec1_#in~i]< 996#rec1ENTRY [39] rec1ENTRY-->L12: Formula: (= v_rec1_~i_1 |v_rec1_#in~i_1|) InVars {rec1_#in~i=|v_rec1_#in~i_1|} OutVars{rec1_#in~i=|v_rec1_#in~i_1|, rec1_~i=v_rec1_~i_1} AuxVars[] AssignedVars[rec1_~i] 1005#L12 [44] L12-->rec1FINAL: Formula: (and (<= v_rec1_~i_2 0) (= |v_rec1_#res_1| 0)) InVars {rec1_~i=v_rec1_~i_2} OutVars{rec1_#res=|v_rec1_#res_1|, rec1_~i=v_rec1_~i_2} AuxVars[] AssignedVars[rec1_#res] 1024#rec1FINAL [40] rec1FINAL-->rec1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 1026#rec1EXIT >[63] rec1EXIT-->L14-3: AOR: Formula: (= |v_rec1_#t~ret2_4| |v_rec1_#resOutParam_3|) InVars {rec1_#res=|v_rec1_#resOutParam_3|} OutVars{rec1_#t~ret2=|v_rec1_#t~ret2_4|} AuxVars[] AssignedVars[rec1_#t~ret2] LVA: Formula: (= |v_rec1_#in~iInParam_3| |v_rec1_#t~ret1_5|) InVars {rec1_#t~ret1=|v_rec1_#t~ret1_5|} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_3|} AuxVars[] AssignedVars[rec1_#in~i] 1022#L14-3 [43] L14-3-->rec1FINAL: Formula: (= |v_rec1_#res_2| (+ |v_rec1_#t~ret2_3| 1)) InVars {rec1_#t~ret2=|v_rec1_#t~ret2_3|} OutVars{rec1_#t~ret1=|v_rec1_#t~ret1_3|, rec1_#t~ret2=|v_rec1_#t~ret2_2|, rec1_#res=|v_rec1_#res_2|, rec1_#t~ret0=|v_rec1_#t~ret0_3|} AuxVars[] AssignedVars[rec1_#t~ret1, rec1_#t~ret2, rec1_#res, rec1_#t~ret0] 1009#rec1FINAL [40] rec1FINAL-->rec1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 1010#rec1EXIT >[63] rec1EXIT-->L14-3: AOR: Formula: (= |v_rec1_#t~ret2_4| |v_rec1_#resOutParam_3|) InVars {rec1_#res=|v_rec1_#resOutParam_3|} OutVars{rec1_#t~ret2=|v_rec1_#t~ret2_4|} AuxVars[] AssignedVars[rec1_#t~ret2] LVA: Formula: (= |v_rec1_#in~iInParam_3| |v_rec1_#t~ret1_5|) InVars {rec1_#t~ret1=|v_rec1_#t~ret1_5|} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_3|} AuxVars[] AssignedVars[rec1_#in~i] 1041#L14-3 [43] L14-3-->rec1FINAL: Formula: (= |v_rec1_#res_2| (+ |v_rec1_#t~ret2_3| 1)) InVars {rec1_#t~ret2=|v_rec1_#t~ret2_3|} OutVars{rec1_#t~ret1=|v_rec1_#t~ret1_3|, rec1_#t~ret2=|v_rec1_#t~ret2_2|, rec1_#res=|v_rec1_#res_2|, rec1_#t~ret0=|v_rec1_#t~ret0_3|} AuxVars[] AssignedVars[rec1_#t~ret1, rec1_#t~ret2, rec1_#res, rec1_#t~ret0] 1039#rec1FINAL [40] rec1FINAL-->rec1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 1036#rec1EXIT >[62] rec1EXIT-->L20-1: AOR: Formula: (= |v_rec2_#t~ret3_4| |v_rec1_#resOutParam_4|) InVars {rec1_#res=|v_rec1_#resOutParam_4|} OutVars{rec2_#t~ret3=|v_rec2_#t~ret3_4|} AuxVars[] AssignedVars[rec2_#t~ret3] LVA: Formula: (= |v_rec1_#in~iInParam_4| (+ v_rec2_~j_5 (- 1))) InVars {rec2_~j=v_rec2_~j_5} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_4|} AuxVars[] AssignedVars[rec1_#in~i] 991#L20-1 [57] L20-1-->rec2ENTRY: Formula: (= |v_rec2_#in~jInParam_1| |v_rec2_#t~ret3_5|) InVars {rec2_#t~ret3=|v_rec2_#t~ret3_5|} OutVars{rec2_#in~j=|v_rec2_#in~jInParam_1|} AuxVars[] AssignedVars[rec2_#in~j]< 990#rec2ENTRY [38] rec2ENTRY-->L18: Formula: (= v_rec2_~j_1 |v_rec2_#in~j_1|) InVars {rec2_#in~j=|v_rec2_#in~j_1|} OutVars{rec2_~j=v_rec2_~j_1, rec2_#in~j=|v_rec2_#in~j_1|} AuxVars[] AssignedVars[rec2_~j] 992#L18 [2020-06-22 05:01:31,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 05:01:31,087 INFO L82 PathProgramCache]: Analyzing trace with hash 76732, now seen corresponding path program 2 times [2020-06-22 05:01:31,087 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 05:01:31,088 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 05:01:31,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:01:31,089 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 05:01:31,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:01:31,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:01:31,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:01:31,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 05:01:31,094 INFO L82 PathProgramCache]: Analyzing trace with hash 1577716842, now seen corresponding path program 3 times [2020-06-22 05:01:31,094 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 05:01:31,094 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 05:01:31,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:01:31,095 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 05:01:31,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:01:31,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:01:31,163 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 30 proven. 38 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2020-06-22 05:01:31,164 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 05:01:31,164 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2020-06-22 05:01:31,180 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2020-06-22 05:01:31,214 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2020-06-22 05:01:31,214 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-06-22 05:01:31,215 INFO L256 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 5 conjunts are in the unsatisfiable core [2020-06-22 05:01:31,218 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:01:31,244 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 115 proven. 12 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2020-06-22 05:01:31,271 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-06-22 05:01:31,272 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2020-06-22 05:01:31,272 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-06-22 05:01:31,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-06-22 05:01:31,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-06-22 05:01:31,273 INFO L87 Difference]: Start difference. First operand 56 states and 82 transitions. cyclomatic complexity: 30 Second operand 6 states. [2020-06-22 05:01:31,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 05:01:31,374 INFO L93 Difference]: Finished difference Result 67 states and 100 transitions. [2020-06-22 05:01:31,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-06-22 05:01:31,378 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 67 states and 100 transitions. [2020-06-22 05:01:31,380 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2020-06-22 05:01:31,383 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 67 states to 67 states and 100 transitions. [2020-06-22 05:01:31,383 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 32 [2020-06-22 05:01:31,383 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 32 [2020-06-22 05:01:31,383 INFO L73 IsDeterministic]: Start isDeterministic. Operand 67 states and 100 transitions. [2020-06-22 05:01:31,384 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 05:01:31,384 INFO L706 BuchiCegarLoop]: Abstraction has 67 states and 100 transitions. [2020-06-22 05:01:31,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states and 100 transitions. [2020-06-22 05:01:31,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 60. [2020-06-22 05:01:31,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2020-06-22 05:01:31,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 90 transitions. [2020-06-22 05:01:31,391 INFO L729 BuchiCegarLoop]: Abstraction has 60 states and 90 transitions. [2020-06-22 05:01:31,391 INFO L609 BuchiCegarLoop]: Abstraction has 60 states and 90 transitions. [2020-06-22 05:01:31,391 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2020-06-22 05:01:31,391 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 60 states and 90 transitions. [2020-06-22 05:01:31,392 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2020-06-22 05:01:31,392 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 05:01:31,393 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 05:01:31,394 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2020-06-22 05:01:31,395 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [13, 13, 9, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1] [2020-06-22 05:01:31,395 INFO L794 eck$LassoCheckResult]: Stem: 1335#ULTIMATE.startENTRY [47] ULTIMATE.startENTRY-->L25: Formula: (= v_ULTIMATE.start_main_~x~0_1 |v_ULTIMATE.start_main_#t~nondet5_4|) InVars {} OutVars{ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_1|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1, ULTIMATE.start_main_#t~ret6=|v_ULTIMATE.start_main_#t~ret6_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|} AuxVars[|v_ULTIMATE.start_main_#t~nondet5_4|] AssignedVars[ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_#res, ULTIMATE.start_main_~x~0, ULTIMATE.start_main_#t~ret6] 1336#L25 [56] L25-->rec2ENTRY: Formula: (= |v_rec2_#in~jInParam_2| v_ULTIMATE.start_main_~x~0_5) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} OutVars{rec2_#in~j=|v_rec2_#in~jInParam_2|} AuxVars[] AssignedVars[rec2_#in~j]< 1340#rec2ENTRY [38] rec2ENTRY-->L18: Formula: (= v_rec2_~j_1 |v_rec2_#in~j_1|) InVars {rec2_#in~j=|v_rec2_#in~j_1|} OutVars{rec2_~j=v_rec2_~j_1, rec2_#in~j=|v_rec2_#in~j_1|} AuxVars[] AssignedVars[rec2_~j] 1295#L18 [2020-06-22 05:01:31,396 INFO L796 eck$LassoCheckResult]: Loop: 1295#L18 [64] L18-->L20: Formula: (> v_rec2_~j_3 0) InVars {rec2_~j=v_rec2_~j_3} OutVars{rec2_~j=v_rec2_~j_3} AuxVars[] AssignedVars[] 1333#L20 [50] L20-->rec1ENTRY: Formula: (= |v_rec1_#in~iInParam_4| (+ v_rec2_~j_5 (- 1))) InVars {rec2_~j=v_rec2_~j_5} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_4|} AuxVars[] AssignedVars[rec1_#in~i]< 1338#rec1ENTRY [39] rec1ENTRY-->L12: Formula: (= v_rec1_~i_1 |v_rec1_#in~i_1|) InVars {rec1_#in~i=|v_rec1_#in~i_1|} OutVars{rec1_#in~i=|v_rec1_#in~i_1|, rec1_~i=v_rec1_~i_1} AuxVars[] AssignedVars[rec1_~i] 1352#L12 [65] L12-->L14: Formula: (> v_rec1_~i_3 0) InVars {rec1_~i=v_rec1_~i_3} OutVars{rec1_~i=v_rec1_~i_3} AuxVars[] AssignedVars[] 1300#L14 [48] L14-->rec1ENTRY: Formula: (= |v_rec1_#in~iInParam_1| (+ v_rec1_~i_5 (- 2))) InVars {rec1_~i=v_rec1_~i_5} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_1|} AuxVars[] AssignedVars[rec1_#in~i]< 1299#rec1ENTRY [39] rec1ENTRY-->L12: Formula: (= v_rec1_~i_1 |v_rec1_#in~i_1|) InVars {rec1_#in~i=|v_rec1_#in~i_1|} OutVars{rec1_#in~i=|v_rec1_#in~i_1|, rec1_~i=v_rec1_~i_1} AuxVars[] AssignedVars[rec1_~i] 1310#L12 [65] L12-->L14: Formula: (> v_rec1_~i_3 0) InVars {rec1_~i=v_rec1_~i_3} OutVars{rec1_~i=v_rec1_~i_3} AuxVars[] AssignedVars[] 1306#L14 [48] L14-->rec1ENTRY: Formula: (= |v_rec1_#in~iInParam_1| (+ v_rec1_~i_5 (- 2))) InVars {rec1_~i=v_rec1_~i_5} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_1|} AuxVars[] AssignedVars[rec1_#in~i]< 1299#rec1ENTRY [39] rec1ENTRY-->L12: Formula: (= v_rec1_~i_1 |v_rec1_#in~i_1|) InVars {rec1_#in~i=|v_rec1_#in~i_1|} OutVars{rec1_#in~i=|v_rec1_#in~i_1|, rec1_~i=v_rec1_~i_1} AuxVars[] AssignedVars[rec1_~i] 1310#L12 [44] L12-->rec1FINAL: Formula: (and (<= v_rec1_~i_2 0) (= |v_rec1_#res_1| 0)) InVars {rec1_~i=v_rec1_~i_2} OutVars{rec1_#res=|v_rec1_#res_1|, rec1_~i=v_rec1_~i_2} AuxVars[] AssignedVars[rec1_#res] 1314#rec1FINAL [40] rec1FINAL-->rec1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 1315#rec1EXIT >[59] rec1EXIT-->L14-1: AOR: Formula: (= |v_rec1_#t~ret0_4| |v_rec1_#resOutParam_1|) InVars {rec1_#res=|v_rec1_#resOutParam_1|} OutVars{rec1_#t~ret0=|v_rec1_#t~ret0_4|} AuxVars[] AssignedVars[rec1_#t~ret0] LVA: Formula: (= |v_rec1_#in~iInParam_1| (+ v_rec1_~i_5 (- 2))) InVars {rec1_~i=v_rec1_~i_5} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_1|} AuxVars[] AssignedVars[rec1_#in~i] 1305#L14-1 [42] L14-1-->rec1ENTRY: Formula: (= |v_rec1_#in~iInParam_2| (+ |v_rec1_#t~ret0_5| (- 1))) InVars {rec1_#t~ret0=|v_rec1_#t~ret0_5|} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_2|} AuxVars[] AssignedVars[rec1_#in~i]< 1299#rec1ENTRY [39] rec1ENTRY-->L12: Formula: (= v_rec1_~i_1 |v_rec1_#in~i_1|) InVars {rec1_#in~i=|v_rec1_#in~i_1|} OutVars{rec1_#in~i=|v_rec1_#in~i_1|, rec1_~i=v_rec1_~i_1} AuxVars[] AssignedVars[rec1_~i] 1310#L12 [44] L12-->rec1FINAL: Formula: (and (<= v_rec1_~i_2 0) (= |v_rec1_#res_1| 0)) InVars {rec1_~i=v_rec1_~i_2} OutVars{rec1_#res=|v_rec1_#res_1|, rec1_~i=v_rec1_~i_2} AuxVars[] AssignedVars[rec1_#res] 1314#rec1FINAL [40] rec1FINAL-->rec1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 1315#rec1EXIT >[58] rec1EXIT-->L14-2: AOR: Formula: (= |v_rec1_#t~ret1_4| |v_rec1_#resOutParam_2|) InVars {rec1_#res=|v_rec1_#resOutParam_2|} OutVars{rec1_#t~ret1=|v_rec1_#t~ret1_4|} AuxVars[] AssignedVars[rec1_#t~ret1] LVA: Formula: (= |v_rec1_#in~iInParam_2| (+ |v_rec1_#t~ret0_5| (- 1))) InVars {rec1_#t~ret0=|v_rec1_#t~ret0_5|} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_2|} AuxVars[] AssignedVars[rec1_#in~i] 1307#L14-2 [46] L14-2-->rec1ENTRY: Formula: (= |v_rec1_#in~iInParam_3| |v_rec1_#t~ret1_5|) InVars {rec1_#t~ret1=|v_rec1_#t~ret1_5|} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_3|} AuxVars[] AssignedVars[rec1_#in~i]< 1299#rec1ENTRY [39] rec1ENTRY-->L12: Formula: (= v_rec1_~i_1 |v_rec1_#in~i_1|) InVars {rec1_#in~i=|v_rec1_#in~i_1|} OutVars{rec1_#in~i=|v_rec1_#in~i_1|, rec1_~i=v_rec1_~i_1} AuxVars[] AssignedVars[rec1_~i] 1310#L12 [44] L12-->rec1FINAL: Formula: (and (<= v_rec1_~i_2 0) (= |v_rec1_#res_1| 0)) InVars {rec1_~i=v_rec1_~i_2} OutVars{rec1_#res=|v_rec1_#res_1|, rec1_~i=v_rec1_~i_2} AuxVars[] AssignedVars[rec1_#res] 1314#rec1FINAL [40] rec1FINAL-->rec1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 1315#rec1EXIT >[63] rec1EXIT-->L14-3: AOR: Formula: (= |v_rec1_#t~ret2_4| |v_rec1_#resOutParam_3|) InVars {rec1_#res=|v_rec1_#resOutParam_3|} OutVars{rec1_#t~ret2=|v_rec1_#t~ret2_4|} AuxVars[] AssignedVars[rec1_#t~ret2] LVA: Formula: (= |v_rec1_#in~iInParam_3| |v_rec1_#t~ret1_5|) InVars {rec1_#t~ret1=|v_rec1_#t~ret1_5|} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_3|} AuxVars[] AssignedVars[rec1_#in~i] 1329#L14-3 [43] L14-3-->rec1FINAL: Formula: (= |v_rec1_#res_2| (+ |v_rec1_#t~ret2_3| 1)) InVars {rec1_#t~ret2=|v_rec1_#t~ret2_3|} OutVars{rec1_#t~ret1=|v_rec1_#t~ret1_3|, rec1_#t~ret2=|v_rec1_#t~ret2_2|, rec1_#res=|v_rec1_#res_2|, rec1_#t~ret0=|v_rec1_#t~ret0_3|} AuxVars[] AssignedVars[rec1_#t~ret1, rec1_#t~ret2, rec1_#res, rec1_#t~ret0] 1330#rec1FINAL [40] rec1FINAL-->rec1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 1351#rec1EXIT >[59] rec1EXIT-->L14-1: AOR: Formula: (= |v_rec1_#t~ret0_4| |v_rec1_#resOutParam_1|) InVars {rec1_#res=|v_rec1_#resOutParam_1|} OutVars{rec1_#t~ret0=|v_rec1_#t~ret0_4|} AuxVars[] AssignedVars[rec1_#t~ret0] LVA: Formula: (= |v_rec1_#in~iInParam_1| (+ v_rec1_~i_5 (- 2))) InVars {rec1_~i=v_rec1_~i_5} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_1|} AuxVars[] AssignedVars[rec1_#in~i] 1302#L14-1 [42] L14-1-->rec1ENTRY: Formula: (= |v_rec1_#in~iInParam_2| (+ |v_rec1_#t~ret0_5| (- 1))) InVars {rec1_#t~ret0=|v_rec1_#t~ret0_5|} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_2|} AuxVars[] AssignedVars[rec1_#in~i]< 1299#rec1ENTRY [39] rec1ENTRY-->L12: Formula: (= v_rec1_~i_1 |v_rec1_#in~i_1|) InVars {rec1_#in~i=|v_rec1_#in~i_1|} OutVars{rec1_#in~i=|v_rec1_#in~i_1|, rec1_~i=v_rec1_~i_1} AuxVars[] AssignedVars[rec1_~i] 1310#L12 [65] L12-->L14: Formula: (> v_rec1_~i_3 0) InVars {rec1_~i=v_rec1_~i_3} OutVars{rec1_~i=v_rec1_~i_3} AuxVars[] AssignedVars[] 1306#L14 [48] L14-->rec1ENTRY: Formula: (= |v_rec1_#in~iInParam_1| (+ v_rec1_~i_5 (- 2))) InVars {rec1_~i=v_rec1_~i_5} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_1|} AuxVars[] AssignedVars[rec1_#in~i]< 1299#rec1ENTRY [39] rec1ENTRY-->L12: Formula: (= v_rec1_~i_1 |v_rec1_#in~i_1|) InVars {rec1_#in~i=|v_rec1_#in~i_1|} OutVars{rec1_#in~i=|v_rec1_#in~i_1|, rec1_~i=v_rec1_~i_1} AuxVars[] AssignedVars[rec1_~i] 1310#L12 [44] L12-->rec1FINAL: Formula: (and (<= v_rec1_~i_2 0) (= |v_rec1_#res_1| 0)) InVars {rec1_~i=v_rec1_~i_2} OutVars{rec1_#res=|v_rec1_#res_1|, rec1_~i=v_rec1_~i_2} AuxVars[] AssignedVars[rec1_#res] 1314#rec1FINAL [40] rec1FINAL-->rec1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 1315#rec1EXIT >[59] rec1EXIT-->L14-1: AOR: Formula: (= |v_rec1_#t~ret0_4| |v_rec1_#resOutParam_1|) InVars {rec1_#res=|v_rec1_#resOutParam_1|} OutVars{rec1_#t~ret0=|v_rec1_#t~ret0_4|} AuxVars[] AssignedVars[rec1_#t~ret0] LVA: Formula: (= |v_rec1_#in~iInParam_1| (+ v_rec1_~i_5 (- 2))) InVars {rec1_~i=v_rec1_~i_5} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_1|} AuxVars[] AssignedVars[rec1_#in~i] 1305#L14-1 [42] L14-1-->rec1ENTRY: Formula: (= |v_rec1_#in~iInParam_2| (+ |v_rec1_#t~ret0_5| (- 1))) InVars {rec1_#t~ret0=|v_rec1_#t~ret0_5|} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_2|} AuxVars[] AssignedVars[rec1_#in~i]< 1299#rec1ENTRY [39] rec1ENTRY-->L12: Formula: (= v_rec1_~i_1 |v_rec1_#in~i_1|) InVars {rec1_#in~i=|v_rec1_#in~i_1|} OutVars{rec1_#in~i=|v_rec1_#in~i_1|, rec1_~i=v_rec1_~i_1} AuxVars[] AssignedVars[rec1_~i] 1310#L12 [44] L12-->rec1FINAL: Formula: (and (<= v_rec1_~i_2 0) (= |v_rec1_#res_1| 0)) InVars {rec1_~i=v_rec1_~i_2} OutVars{rec1_#res=|v_rec1_#res_1|, rec1_~i=v_rec1_~i_2} AuxVars[] AssignedVars[rec1_#res] 1314#rec1FINAL [40] rec1FINAL-->rec1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 1315#rec1EXIT >[58] rec1EXIT-->L14-2: AOR: Formula: (= |v_rec1_#t~ret1_4| |v_rec1_#resOutParam_2|) InVars {rec1_#res=|v_rec1_#resOutParam_2|} OutVars{rec1_#t~ret1=|v_rec1_#t~ret1_4|} AuxVars[] AssignedVars[rec1_#t~ret1] LVA: Formula: (= |v_rec1_#in~iInParam_2| (+ |v_rec1_#t~ret0_5| (- 1))) InVars {rec1_#t~ret0=|v_rec1_#t~ret0_5|} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_2|} AuxVars[] AssignedVars[rec1_#in~i] 1307#L14-2 [46] L14-2-->rec1ENTRY: Formula: (= |v_rec1_#in~iInParam_3| |v_rec1_#t~ret1_5|) InVars {rec1_#t~ret1=|v_rec1_#t~ret1_5|} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_3|} AuxVars[] AssignedVars[rec1_#in~i]< 1299#rec1ENTRY [39] rec1ENTRY-->L12: Formula: (= v_rec1_~i_1 |v_rec1_#in~i_1|) InVars {rec1_#in~i=|v_rec1_#in~i_1|} OutVars{rec1_#in~i=|v_rec1_#in~i_1|, rec1_~i=v_rec1_~i_1} AuxVars[] AssignedVars[rec1_~i] 1310#L12 [44] L12-->rec1FINAL: Formula: (and (<= v_rec1_~i_2 0) (= |v_rec1_#res_1| 0)) InVars {rec1_~i=v_rec1_~i_2} OutVars{rec1_#res=|v_rec1_#res_1|, rec1_~i=v_rec1_~i_2} AuxVars[] AssignedVars[rec1_#res] 1314#rec1FINAL [40] rec1FINAL-->rec1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 1315#rec1EXIT >[63] rec1EXIT-->L14-3: AOR: Formula: (= |v_rec1_#t~ret2_4| |v_rec1_#resOutParam_3|) InVars {rec1_#res=|v_rec1_#resOutParam_3|} OutVars{rec1_#t~ret2=|v_rec1_#t~ret2_4|} AuxVars[] AssignedVars[rec1_#t~ret2] LVA: Formula: (= |v_rec1_#in~iInParam_3| |v_rec1_#t~ret1_5|) InVars {rec1_#t~ret1=|v_rec1_#t~ret1_5|} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_3|} AuxVars[] AssignedVars[rec1_#in~i] 1329#L14-3 [43] L14-3-->rec1FINAL: Formula: (= |v_rec1_#res_2| (+ |v_rec1_#t~ret2_3| 1)) InVars {rec1_#t~ret2=|v_rec1_#t~ret2_3|} OutVars{rec1_#t~ret1=|v_rec1_#t~ret1_3|, rec1_#t~ret2=|v_rec1_#t~ret2_2|, rec1_#res=|v_rec1_#res_2|, rec1_#t~ret0=|v_rec1_#t~ret0_3|} AuxVars[] AssignedVars[rec1_#t~ret1, rec1_#t~ret2, rec1_#res, rec1_#t~ret0] 1330#rec1FINAL [40] rec1FINAL-->rec1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 1351#rec1EXIT >[58] rec1EXIT-->L14-2: AOR: Formula: (= |v_rec1_#t~ret1_4| |v_rec1_#resOutParam_2|) InVars {rec1_#res=|v_rec1_#resOutParam_2|} OutVars{rec1_#t~ret1=|v_rec1_#t~ret1_4|} AuxVars[] AssignedVars[rec1_#t~ret1] LVA: Formula: (= |v_rec1_#in~iInParam_2| (+ |v_rec1_#t~ret0_5| (- 1))) InVars {rec1_#t~ret0=|v_rec1_#t~ret0_5|} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_2|} AuxVars[] AssignedVars[rec1_#in~i] 1308#L14-2 [46] L14-2-->rec1ENTRY: Formula: (= |v_rec1_#in~iInParam_3| |v_rec1_#t~ret1_5|) InVars {rec1_#t~ret1=|v_rec1_#t~ret1_5|} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_3|} AuxVars[] AssignedVars[rec1_#in~i]< 1299#rec1ENTRY [39] rec1ENTRY-->L12: Formula: (= v_rec1_~i_1 |v_rec1_#in~i_1|) InVars {rec1_#in~i=|v_rec1_#in~i_1|} OutVars{rec1_#in~i=|v_rec1_#in~i_1|, rec1_~i=v_rec1_~i_1} AuxVars[] AssignedVars[rec1_~i] 1310#L12 [65] L12-->L14: Formula: (> v_rec1_~i_3 0) InVars {rec1_~i=v_rec1_~i_3} OutVars{rec1_~i=v_rec1_~i_3} AuxVars[] AssignedVars[] 1306#L14 [48] L14-->rec1ENTRY: Formula: (= |v_rec1_#in~iInParam_1| (+ v_rec1_~i_5 (- 2))) InVars {rec1_~i=v_rec1_~i_5} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_1|} AuxVars[] AssignedVars[rec1_#in~i]< 1299#rec1ENTRY [39] rec1ENTRY-->L12: Formula: (= v_rec1_~i_1 |v_rec1_#in~i_1|) InVars {rec1_#in~i=|v_rec1_#in~i_1|} OutVars{rec1_#in~i=|v_rec1_#in~i_1|, rec1_~i=v_rec1_~i_1} AuxVars[] AssignedVars[rec1_~i] 1310#L12 [44] L12-->rec1FINAL: Formula: (and (<= v_rec1_~i_2 0) (= |v_rec1_#res_1| 0)) InVars {rec1_~i=v_rec1_~i_2} OutVars{rec1_#res=|v_rec1_#res_1|, rec1_~i=v_rec1_~i_2} AuxVars[] AssignedVars[rec1_#res] 1314#rec1FINAL [40] rec1FINAL-->rec1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 1315#rec1EXIT >[59] rec1EXIT-->L14-1: AOR: Formula: (= |v_rec1_#t~ret0_4| |v_rec1_#resOutParam_1|) InVars {rec1_#res=|v_rec1_#resOutParam_1|} OutVars{rec1_#t~ret0=|v_rec1_#t~ret0_4|} AuxVars[] AssignedVars[rec1_#t~ret0] LVA: Formula: (= |v_rec1_#in~iInParam_1| (+ v_rec1_~i_5 (- 2))) InVars {rec1_~i=v_rec1_~i_5} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_1|} AuxVars[] AssignedVars[rec1_#in~i] 1305#L14-1 [42] L14-1-->rec1ENTRY: Formula: (= |v_rec1_#in~iInParam_2| (+ |v_rec1_#t~ret0_5| (- 1))) InVars {rec1_#t~ret0=|v_rec1_#t~ret0_5|} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_2|} AuxVars[] AssignedVars[rec1_#in~i]< 1299#rec1ENTRY [39] rec1ENTRY-->L12: Formula: (= v_rec1_~i_1 |v_rec1_#in~i_1|) InVars {rec1_#in~i=|v_rec1_#in~i_1|} OutVars{rec1_#in~i=|v_rec1_#in~i_1|, rec1_~i=v_rec1_~i_1} AuxVars[] AssignedVars[rec1_~i] 1310#L12 [44] L12-->rec1FINAL: Formula: (and (<= v_rec1_~i_2 0) (= |v_rec1_#res_1| 0)) InVars {rec1_~i=v_rec1_~i_2} OutVars{rec1_#res=|v_rec1_#res_1|, rec1_~i=v_rec1_~i_2} AuxVars[] AssignedVars[rec1_#res] 1314#rec1FINAL [40] rec1FINAL-->rec1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 1315#rec1EXIT >[58] rec1EXIT-->L14-2: AOR: Formula: (= |v_rec1_#t~ret1_4| |v_rec1_#resOutParam_2|) InVars {rec1_#res=|v_rec1_#resOutParam_2|} OutVars{rec1_#t~ret1=|v_rec1_#t~ret1_4|} AuxVars[] AssignedVars[rec1_#t~ret1] LVA: Formula: (= |v_rec1_#in~iInParam_2| (+ |v_rec1_#t~ret0_5| (- 1))) InVars {rec1_#t~ret0=|v_rec1_#t~ret0_5|} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_2|} AuxVars[] AssignedVars[rec1_#in~i] 1307#L14-2 [46] L14-2-->rec1ENTRY: Formula: (= |v_rec1_#in~iInParam_3| |v_rec1_#t~ret1_5|) InVars {rec1_#t~ret1=|v_rec1_#t~ret1_5|} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_3|} AuxVars[] AssignedVars[rec1_#in~i]< 1299#rec1ENTRY [39] rec1ENTRY-->L12: Formula: (= v_rec1_~i_1 |v_rec1_#in~i_1|) InVars {rec1_#in~i=|v_rec1_#in~i_1|} OutVars{rec1_#in~i=|v_rec1_#in~i_1|, rec1_~i=v_rec1_~i_1} AuxVars[] AssignedVars[rec1_~i] 1310#L12 [44] L12-->rec1FINAL: Formula: (and (<= v_rec1_~i_2 0) (= |v_rec1_#res_1| 0)) InVars {rec1_~i=v_rec1_~i_2} OutVars{rec1_#res=|v_rec1_#res_1|, rec1_~i=v_rec1_~i_2} AuxVars[] AssignedVars[rec1_#res] 1314#rec1FINAL [40] rec1FINAL-->rec1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 1315#rec1EXIT >[63] rec1EXIT-->L14-3: AOR: Formula: (= |v_rec1_#t~ret2_4| |v_rec1_#resOutParam_3|) InVars {rec1_#res=|v_rec1_#resOutParam_3|} OutVars{rec1_#t~ret2=|v_rec1_#t~ret2_4|} AuxVars[] AssignedVars[rec1_#t~ret2] LVA: Formula: (= |v_rec1_#in~iInParam_3| |v_rec1_#t~ret1_5|) InVars {rec1_#t~ret1=|v_rec1_#t~ret1_5|} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_3|} AuxVars[] AssignedVars[rec1_#in~i] 1329#L14-3 [43] L14-3-->rec1FINAL: Formula: (= |v_rec1_#res_2| (+ |v_rec1_#t~ret2_3| 1)) InVars {rec1_#t~ret2=|v_rec1_#t~ret2_3|} OutVars{rec1_#t~ret1=|v_rec1_#t~ret1_3|, rec1_#t~ret2=|v_rec1_#t~ret2_2|, rec1_#res=|v_rec1_#res_2|, rec1_#t~ret0=|v_rec1_#t~ret0_3|} AuxVars[] AssignedVars[rec1_#t~ret1, rec1_#t~ret2, rec1_#res, rec1_#t~ret0] 1330#rec1FINAL [40] rec1FINAL-->rec1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 1351#rec1EXIT >[63] rec1EXIT-->L14-3: AOR: Formula: (= |v_rec1_#t~ret2_4| |v_rec1_#resOutParam_3|) InVars {rec1_#res=|v_rec1_#resOutParam_3|} OutVars{rec1_#t~ret2=|v_rec1_#t~ret2_4|} AuxVars[] AssignedVars[rec1_#t~ret2] LVA: Formula: (= |v_rec1_#in~iInParam_3| |v_rec1_#t~ret1_5|) InVars {rec1_#t~ret1=|v_rec1_#t~ret1_5|} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_3|} AuxVars[] AssignedVars[rec1_#in~i] 1350#L14-3 [43] L14-3-->rec1FINAL: Formula: (= |v_rec1_#res_2| (+ |v_rec1_#t~ret2_3| 1)) InVars {rec1_#t~ret2=|v_rec1_#t~ret2_3|} OutVars{rec1_#t~ret1=|v_rec1_#t~ret1_3|, rec1_#t~ret2=|v_rec1_#t~ret2_2|, rec1_#res=|v_rec1_#res_2|, rec1_#t~ret0=|v_rec1_#t~ret0_3|} AuxVars[] AssignedVars[rec1_#t~ret1, rec1_#t~ret2, rec1_#res, rec1_#t~ret0] 1349#rec1FINAL [40] rec1FINAL-->rec1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 1347#rec1EXIT >[62] rec1EXIT-->L20-1: AOR: Formula: (= |v_rec2_#t~ret3_4| |v_rec1_#resOutParam_4|) InVars {rec1_#res=|v_rec1_#resOutParam_4|} OutVars{rec2_#t~ret3=|v_rec2_#t~ret3_4|} AuxVars[] AssignedVars[rec2_#t~ret3] LVA: Formula: (= |v_rec1_#in~iInParam_4| (+ v_rec2_~j_5 (- 1))) InVars {rec2_~j=v_rec2_~j_5} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_4|} AuxVars[] AssignedVars[rec1_#in~i] 1294#L20-1 [57] L20-1-->rec2ENTRY: Formula: (= |v_rec2_#in~jInParam_1| |v_rec2_#t~ret3_5|) InVars {rec2_#t~ret3=|v_rec2_#t~ret3_5|} OutVars{rec2_#in~j=|v_rec2_#in~jInParam_1|} AuxVars[] AssignedVars[rec2_#in~j]< 1293#rec2ENTRY [38] rec2ENTRY-->L18: Formula: (= v_rec2_~j_1 |v_rec2_#in~j_1|) InVars {rec2_#in~j=|v_rec2_#in~j_1|} OutVars{rec2_~j=v_rec2_~j_1, rec2_#in~j=|v_rec2_#in~j_1|} AuxVars[] AssignedVars[rec2_~j] 1295#L18 [2020-06-22 05:01:31,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 05:01:31,396 INFO L82 PathProgramCache]: Analyzing trace with hash 76732, now seen corresponding path program 3 times [2020-06-22 05:01:31,397 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 05:01:31,397 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 05:01:31,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:01:31,398 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 05:01:31,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:01:31,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:01:31,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:01:31,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 05:01:31,401 INFO L82 PathProgramCache]: Analyzing trace with hash -865815173, now seen corresponding path program 4 times [2020-06-22 05:01:31,401 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 05:01:31,401 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 05:01:31,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:01:31,402 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 05:01:31,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:01:31,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:01:31,484 INFO L134 CoverageAnalysis]: Checked inductivity of 336 backedges. 57 proven. 58 refuted. 0 times theorem prover too weak. 221 trivial. 0 not checked. [2020-06-22 05:01:31,484 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 05:01:31,485 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2020-06-22 05:01:31,496 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2020-06-22 05:01:31,520 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-06-22 05:01:31,521 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-06-22 05:01:31,521 INFO L256 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 7 conjunts are in the unsatisfiable core [2020-06-22 05:01:31,525 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:01:31,539 INFO L134 CoverageAnalysis]: Checked inductivity of 336 backedges. 194 proven. 23 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2020-06-22 05:01:31,565 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-06-22 05:01:31,566 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2020-06-22 05:01:31,566 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-06-22 05:01:31,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-06-22 05:01:31,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-06-22 05:01:31,567 INFO L87 Difference]: Start difference. First operand 60 states and 90 transitions. cyclomatic complexity: 34 Second operand 8 states. [2020-06-22 05:01:31,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 05:01:31,664 INFO L93 Difference]: Finished difference Result 46 states and 65 transitions. [2020-06-22 05:01:31,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-06-22 05:01:31,667 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 65 transitions. [2020-06-22 05:01:31,668 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2020-06-22 05:01:31,670 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 46 states and 65 transitions. [2020-06-22 05:01:31,670 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2020-06-22 05:01:31,670 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2020-06-22 05:01:31,670 INFO L73 IsDeterministic]: Start isDeterministic. Operand 46 states and 65 transitions. [2020-06-22 05:01:31,671 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 05:01:31,671 INFO L706 BuchiCegarLoop]: Abstraction has 46 states and 65 transitions. [2020-06-22 05:01:31,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states and 65 transitions. [2020-06-22 05:01:31,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 42. [2020-06-22 05:01:31,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-06-22 05:01:31,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 57 transitions. [2020-06-22 05:01:31,675 INFO L729 BuchiCegarLoop]: Abstraction has 42 states and 57 transitions. [2020-06-22 05:01:31,675 INFO L609 BuchiCegarLoop]: Abstraction has 42 states and 57 transitions. [2020-06-22 05:01:31,676 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2020-06-22 05:01:31,676 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 42 states and 57 transitions. [2020-06-22 05:01:31,676 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-06-22 05:01:31,676 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 05:01:31,677 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 05:01:31,677 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 05:01:31,677 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-06-22 05:01:31,677 INFO L794 eck$LassoCheckResult]: Stem: 1665#ULTIMATE.startENTRY [47] ULTIMATE.startENTRY-->L25: Formula: (= v_ULTIMATE.start_main_~x~0_1 |v_ULTIMATE.start_main_#t~nondet5_4|) InVars {} OutVars{ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_1|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1, ULTIMATE.start_main_#t~ret6=|v_ULTIMATE.start_main_#t~ret6_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|} AuxVars[|v_ULTIMATE.start_main_#t~nondet5_4|] AssignedVars[ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_#res, ULTIMATE.start_main_~x~0, ULTIMATE.start_main_#t~ret6] 1634#L25 [56] L25-->rec2ENTRY: Formula: (= |v_rec2_#in~jInParam_2| v_ULTIMATE.start_main_~x~0_5) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} OutVars{rec2_#in~j=|v_rec2_#in~jInParam_2|} AuxVars[] AssignedVars[rec2_#in~j]< 1633#rec2ENTRY [38] rec2ENTRY-->L18: Formula: (= v_rec2_~j_1 |v_rec2_#in~j_1|) InVars {rec2_#in~j=|v_rec2_#in~j_1|} OutVars{rec2_~j=v_rec2_~j_1, rec2_#in~j=|v_rec2_#in~j_1|} AuxVars[] AssignedVars[rec2_~j] 1636#L18 [64] L18-->L20: Formula: (> v_rec2_~j_3 0) InVars {rec2_~j=v_rec2_~j_3} OutVars{rec2_~j=v_rec2_~j_3} AuxVars[] AssignedVars[] 1640#L20 [50] L20-->rec1ENTRY: Formula: (= |v_rec1_#in~iInParam_4| (+ v_rec2_~j_5 (- 1))) InVars {rec2_~j=v_rec2_~j_5} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_4|} AuxVars[] AssignedVars[rec1_#in~i]< 1639#rec1ENTRY [39] rec1ENTRY-->L12: Formula: (= v_rec1_~i_1 |v_rec1_#in~i_1|) InVars {rec1_#in~i=|v_rec1_#in~i_1|} OutVars{rec1_#in~i=|v_rec1_#in~i_1|, rec1_~i=v_rec1_~i_1} AuxVars[] AssignedVars[rec1_~i] 1641#L12 [65] L12-->L14: Formula: (> v_rec1_~i_3 0) InVars {rec1_~i=v_rec1_~i_3} OutVars{rec1_~i=v_rec1_~i_3} AuxVars[] AssignedVars[] 1649#L14 [48] L14-->rec1ENTRY: Formula: (= |v_rec1_#in~iInParam_1| (+ v_rec1_~i_5 (- 2))) InVars {rec1_~i=v_rec1_~i_5} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_1|} AuxVars[] AssignedVars[rec1_#in~i]< 1661#rec1ENTRY [2020-06-22 05:01:31,678 INFO L796 eck$LassoCheckResult]: Loop: 1661#rec1ENTRY [39] rec1ENTRY-->L12: Formula: (= v_rec1_~i_1 |v_rec1_#in~i_1|) InVars {rec1_#in~i=|v_rec1_#in~i_1|} OutVars{rec1_#in~i=|v_rec1_#in~i_1|, rec1_~i=v_rec1_~i_1} AuxVars[] AssignedVars[rec1_~i] 1668#L12 [65] L12-->L14: Formula: (> v_rec1_~i_3 0) InVars {rec1_~i=v_rec1_~i_3} OutVars{rec1_~i=v_rec1_~i_3} AuxVars[] AssignedVars[] 1646#L14 [48] L14-->rec1ENTRY: Formula: (= |v_rec1_#in~iInParam_1| (+ v_rec1_~i_5 (- 2))) InVars {rec1_~i=v_rec1_~i_5} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_1|} AuxVars[] AssignedVars[rec1_#in~i]< 1661#rec1ENTRY [2020-06-22 05:01:31,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 05:01:31,678 INFO L82 PathProgramCache]: Analyzing trace with hash 2104360712, now seen corresponding path program 1 times [2020-06-22 05:01:31,678 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 05:01:31,678 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 05:01:31,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:01:31,679 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 05:01:31,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:01:31,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:01:31,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:01:31,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 05:01:31,686 INFO L82 PathProgramCache]: Analyzing trace with hash 69333, now seen corresponding path program 1 times [2020-06-22 05:01:31,686 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 05:01:31,686 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 05:01:31,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:01:31,687 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 05:01:31,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:01:31,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:01:31,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:01:31,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 05:01:31,690 INFO L82 PathProgramCache]: Analyzing trace with hash 1667358318, now seen corresponding path program 2 times [2020-06-22 05:01:31,690 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 05:01:31,690 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 05:01:31,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:01:31,691 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 05:01:31,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:01:31,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:01:31,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:01:31,724 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 05:01:31,724 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 05:01:31,724 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 05:01:31,724 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 05:01:31,724 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2020-06-22 05:01:31,724 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 05:01:31,724 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 05:01:31,725 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 05:01:31,725 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration6_Loop [2020-06-22 05:01:31,725 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 05:01:31,725 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 05:01:31,726 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 05:01:31,728 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 05:01:31,733 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 05:01:31,734 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 05:01:31,736 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 05:01:31,737 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 05:01:31,760 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 05:01:31,760 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 05:01:31,763 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 05:01:31,763 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 05:01:31,767 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 05:01:31,767 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {rec1_#res=0} Honda state: {rec1_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 05:01:31,794 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 05:01:31,794 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 05:01:31,823 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-06-22 05:01:31,824 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 05:01:31,855 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-06-22 05:01:31,857 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 05:01:31,857 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 05:01:31,857 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 05:01:31,857 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 05:01:31,857 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 05:01:31,857 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 05:01:31,857 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 05:01:31,858 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 05:01:31,858 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration6_Loop [2020-06-22 05:01:31,858 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 05:01:31,858 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 05:01:31,859 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 05:01:31,861 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 05:01:31,866 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 05:01:31,868 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 05:01:31,869 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 05:01:31,871 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 05:01:31,896 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 05:01:31,896 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 05:01:31,896 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 05:01:31,897 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 05:01:31,897 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 05:01:31,897 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 05:01:31,897 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 05:01:31,898 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 05:01:31,898 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 05:01:31,898 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 05:01:31,899 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 05:01:31,900 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 05:01:31,900 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 05:01:31,900 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 05:01:31,900 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 05:01:31,900 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 05:01:31,900 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 05:01:31,901 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 05:01:31,901 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 05:01:31,904 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 05:01:31,906 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2020-06-22 05:01:31,906 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2020-06-22 05:01:31,906 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 05:01:31,906 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-06-22 05:01:31,906 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 05:01:31,907 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(rec1_#in~i) = 1*rec1_#in~i Supporting invariants [] [2020-06-22 05:01:31,907 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-06-22 05:01:31,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 05:01:31,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:01:31,945 INFO L256 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 05:01:31,946 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:01:31,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:01:31,960 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 7 conjunts are in the unsatisfiable core [2020-06-22 05:01:31,961 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:01:31,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 05:01:31,987 INFO L98 LoopCannibalizer]: 3 predicates before loop cannibalization 3 predicates after loop cannibalization [2020-06-22 05:01:31,987 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2020-06-22 05:01:31,988 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 42 states and 57 transitions. cyclomatic complexity: 18 Second operand 4 states. [2020-06-22 05:01:32,065 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 42 states and 57 transitions. cyclomatic complexity: 18. Second operand 4 states. Result 180 states and 213 transitions. Complement of second has 47 states. [2020-06-22 05:01:32,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2020-06-22 05:01:32,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-06-22 05:01:32,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 25 transitions. [2020-06-22 05:01:32,066 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 25 transitions. Stem has 8 letters. Loop has 3 letters. [2020-06-22 05:01:32,067 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 05:01:32,067 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 25 transitions. Stem has 11 letters. Loop has 3 letters. [2020-06-22 05:01:32,067 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 05:01:32,067 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 25 transitions. Stem has 8 letters. Loop has 6 letters. [2020-06-22 05:01:32,068 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 05:01:32,069 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 180 states and 213 transitions. [2020-06-22 05:01:32,073 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 17 [2020-06-22 05:01:32,076 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 180 states to 83 states and 113 transitions. [2020-06-22 05:01:32,076 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2020-06-22 05:01:32,076 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 33 [2020-06-22 05:01:32,077 INFO L73 IsDeterministic]: Start isDeterministic. Operand 83 states and 113 transitions. [2020-06-22 05:01:32,077 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 05:01:32,077 INFO L706 BuchiCegarLoop]: Abstraction has 83 states and 113 transitions. [2020-06-22 05:01:32,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states and 113 transitions. [2020-06-22 05:01:32,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 61. [2020-06-22 05:01:32,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2020-06-22 05:01:32,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 77 transitions. [2020-06-22 05:01:32,083 INFO L729 BuchiCegarLoop]: Abstraction has 61 states and 77 transitions. [2020-06-22 05:01:32,083 INFO L609 BuchiCegarLoop]: Abstraction has 61 states and 77 transitions. [2020-06-22 05:01:32,083 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2020-06-22 05:01:32,084 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 61 states and 77 transitions. [2020-06-22 05:01:32,085 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2020-06-22 05:01:32,085 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 05:01:32,085 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 05:01:32,085 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 05:01:32,086 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [3, 2, 2, 1, 1, 1, 1] [2020-06-22 05:01:32,086 INFO L794 eck$LassoCheckResult]: Stem: 1992#ULTIMATE.startENTRY [47] ULTIMATE.startENTRY-->L25: Formula: (= v_ULTIMATE.start_main_~x~0_1 |v_ULTIMATE.start_main_#t~nondet5_4|) InVars {} OutVars{ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_1|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1, ULTIMATE.start_main_#t~ret6=|v_ULTIMATE.start_main_#t~ret6_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|} AuxVars[|v_ULTIMATE.start_main_#t~nondet5_4|] AssignedVars[ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_#res, ULTIMATE.start_main_~x~0, ULTIMATE.start_main_#t~ret6] 1958#L25 [56] L25-->rec2ENTRY: Formula: (= |v_rec2_#in~jInParam_2| v_ULTIMATE.start_main_~x~0_5) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} OutVars{rec2_#in~j=|v_rec2_#in~jInParam_2|} AuxVars[] AssignedVars[rec2_#in~j]< 1957#rec2ENTRY [38] rec2ENTRY-->L18: Formula: (= v_rec2_~j_1 |v_rec2_#in~j_1|) InVars {rec2_#in~j=|v_rec2_#in~j_1|} OutVars{rec2_~j=v_rec2_~j_1, rec2_#in~j=|v_rec2_#in~j_1|} AuxVars[] AssignedVars[rec2_~j] 1960#L18 [64] L18-->L20: Formula: (> v_rec2_~j_3 0) InVars {rec2_~j=v_rec2_~j_3} OutVars{rec2_~j=v_rec2_~j_3} AuxVars[] AssignedVars[] 1981#L20 [50] L20-->rec1ENTRY: Formula: (= |v_rec1_#in~iInParam_4| (+ v_rec2_~j_5 (- 1))) InVars {rec2_~j=v_rec2_~j_5} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_4|} AuxVars[] AssignedVars[rec1_#in~i]< 1994#rec1ENTRY [39] rec1ENTRY-->L12: Formula: (= v_rec1_~i_1 |v_rec1_#in~i_1|) InVars {rec1_#in~i=|v_rec1_#in~i_1|} OutVars{rec1_#in~i=|v_rec1_#in~i_1|, rec1_~i=v_rec1_~i_1} AuxVars[] AssignedVars[rec1_~i] 2012#L12 [65] L12-->L14: Formula: (> v_rec1_~i_3 0) InVars {rec1_~i=v_rec1_~i_3} OutVars{rec1_~i=v_rec1_~i_3} AuxVars[] AssignedVars[] 1964#L14 [48] L14-->rec1ENTRY: Formula: (= |v_rec1_#in~iInParam_1| (+ v_rec1_~i_5 (- 2))) InVars {rec1_~i=v_rec1_~i_5} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_1|} AuxVars[] AssignedVars[rec1_#in~i]< 1963#rec1ENTRY [2020-06-22 05:01:32,086 INFO L796 eck$LassoCheckResult]: Loop: 1963#rec1ENTRY [39] rec1ENTRY-->L12: Formula: (= v_rec1_~i_1 |v_rec1_#in~i_1|) InVars {rec1_#in~i=|v_rec1_#in~i_1|} OutVars{rec1_#in~i=|v_rec1_#in~i_1|, rec1_~i=v_rec1_~i_1} AuxVars[] AssignedVars[rec1_~i] 1966#L12 [65] L12-->L14: Formula: (> v_rec1_~i_3 0) InVars {rec1_~i=v_rec1_~i_3} OutVars{rec1_~i=v_rec1_~i_3} AuxVars[] AssignedVars[] 1975#L14 [48] L14-->rec1ENTRY: Formula: (= |v_rec1_#in~iInParam_1| (+ v_rec1_~i_5 (- 2))) InVars {rec1_~i=v_rec1_~i_5} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_1|} AuxVars[] AssignedVars[rec1_#in~i]< 1993#rec1ENTRY [39] rec1ENTRY-->L12: Formula: (= v_rec1_~i_1 |v_rec1_#in~i_1|) InVars {rec1_#in~i=|v_rec1_#in~i_1|} OutVars{rec1_#in~i=|v_rec1_#in~i_1|, rec1_~i=v_rec1_~i_1} AuxVars[] AssignedVars[rec1_~i] 2015#L12 [44] L12-->rec1FINAL: Formula: (and (<= v_rec1_~i_2 0) (= |v_rec1_#res_1| 0)) InVars {rec1_~i=v_rec1_~i_2} OutVars{rec1_#res=|v_rec1_#res_1|, rec1_~i=v_rec1_~i_2} AuxVars[] AssignedVars[rec1_#res] 2014#rec1FINAL [40] rec1FINAL-->rec1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 1991#rec1EXIT >[59] rec1EXIT-->L14-1: AOR: Formula: (= |v_rec1_#t~ret0_4| |v_rec1_#resOutParam_1|) InVars {rec1_#res=|v_rec1_#resOutParam_1|} OutVars{rec1_#t~ret0=|v_rec1_#t~ret0_4|} AuxVars[] AssignedVars[rec1_#t~ret0] LVA: Formula: (= |v_rec1_#in~iInParam_1| (+ v_rec1_~i_5 (- 2))) InVars {rec1_~i=v_rec1_~i_5} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_1|} AuxVars[] AssignedVars[rec1_#in~i] 1974#L14-1 [42] L14-1-->rec1ENTRY: Formula: (= |v_rec1_#in~iInParam_2| (+ |v_rec1_#t~ret0_5| (- 1))) InVars {rec1_#t~ret0=|v_rec1_#t~ret0_5|} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_2|} AuxVars[] AssignedVars[rec1_#in~i]< 1982#rec1ENTRY [39] rec1ENTRY-->L12: Formula: (= v_rec1_~i_1 |v_rec1_#in~i_1|) InVars {rec1_#in~i=|v_rec1_#in~i_1|} OutVars{rec1_#in~i=|v_rec1_#in~i_1|, rec1_~i=v_rec1_~i_1} AuxVars[] AssignedVars[rec1_~i] 1999#L12 [65] L12-->L14: Formula: (> v_rec1_~i_3 0) InVars {rec1_~i=v_rec1_~i_3} OutVars{rec1_~i=v_rec1_~i_3} AuxVars[] AssignedVars[] 1965#L14 [48] L14-->rec1ENTRY: Formula: (= |v_rec1_#in~iInParam_1| (+ v_rec1_~i_5 (- 2))) InVars {rec1_~i=v_rec1_~i_5} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_1|} AuxVars[] AssignedVars[rec1_#in~i]< 1963#rec1ENTRY [2020-06-22 05:01:32,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 05:01:32,087 INFO L82 PathProgramCache]: Analyzing trace with hash 2104360712, now seen corresponding path program 3 times [2020-06-22 05:01:32,087 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 05:01:32,087 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 05:01:32,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:01:32,088 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 05:01:32,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:01:32,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:01:32,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:01:32,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 05:01:32,094 INFO L82 PathProgramCache]: Analyzing trace with hash -1132960615, now seen corresponding path program 1 times [2020-06-22 05:01:32,094 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 05:01:32,094 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 05:01:32,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:01:32,095 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 05:01:32,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:01:32,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:01:32,124 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-06-22 05:01:32,125 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 05:01:32,125 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-06-22 05:01:32,125 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-06-22 05:01:32,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-06-22 05:01:32,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-06-22 05:01:32,126 INFO L87 Difference]: Start difference. First operand 61 states and 77 transitions. cyclomatic complexity: 19 Second operand 6 states. [2020-06-22 05:01:32,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 05:01:32,174 INFO L93 Difference]: Finished difference Result 80 states and 101 transitions. [2020-06-22 05:01:32,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-06-22 05:01:32,177 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 80 states and 101 transitions. [2020-06-22 05:01:32,178 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2020-06-22 05:01:32,180 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 80 states to 80 states and 101 transitions. [2020-06-22 05:01:32,180 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 36 [2020-06-22 05:01:32,180 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 [2020-06-22 05:01:32,181 INFO L73 IsDeterministic]: Start isDeterministic. Operand 80 states and 101 transitions. [2020-06-22 05:01:32,181 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 05:01:32,181 INFO L706 BuchiCegarLoop]: Abstraction has 80 states and 101 transitions. [2020-06-22 05:01:32,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states and 101 transitions. [2020-06-22 05:01:32,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 73. [2020-06-22 05:01:32,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2020-06-22 05:01:32,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 91 transitions. [2020-06-22 05:01:32,187 INFO L729 BuchiCegarLoop]: Abstraction has 73 states and 91 transitions. [2020-06-22 05:01:32,187 INFO L609 BuchiCegarLoop]: Abstraction has 73 states and 91 transitions. [2020-06-22 05:01:32,187 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2020-06-22 05:01:32,187 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 73 states and 91 transitions. [2020-06-22 05:01:32,188 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2020-06-22 05:01:32,188 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 05:01:32,188 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 05:01:32,189 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 05:01:32,189 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [6, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1] [2020-06-22 05:01:32,190 INFO L794 eck$LassoCheckResult]: Stem: 2149#ULTIMATE.startENTRY [47] ULTIMATE.startENTRY-->L25: Formula: (= v_ULTIMATE.start_main_~x~0_1 |v_ULTIMATE.start_main_#t~nondet5_4|) InVars {} OutVars{ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_1|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1, ULTIMATE.start_main_#t~ret6=|v_ULTIMATE.start_main_#t~ret6_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|} AuxVars[|v_ULTIMATE.start_main_#t~nondet5_4|] AssignedVars[ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_#res, ULTIMATE.start_main_~x~0, ULTIMATE.start_main_#t~ret6] 2112#L25 [56] L25-->rec2ENTRY: Formula: (= |v_rec2_#in~jInParam_2| v_ULTIMATE.start_main_~x~0_5) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} OutVars{rec2_#in~j=|v_rec2_#in~jInParam_2|} AuxVars[] AssignedVars[rec2_#in~j]< 2111#rec2ENTRY [38] rec2ENTRY-->L18: Formula: (= v_rec2_~j_1 |v_rec2_#in~j_1|) InVars {rec2_#in~j=|v_rec2_#in~j_1|} OutVars{rec2_~j=v_rec2_~j_1, rec2_#in~j=|v_rec2_#in~j_1|} AuxVars[] AssignedVars[rec2_~j] 2114#L18 [64] L18-->L20: Formula: (> v_rec2_~j_3 0) InVars {rec2_~j=v_rec2_~j_3} OutVars{rec2_~j=v_rec2_~j_3} AuxVars[] AssignedVars[] 2145#L20 [50] L20-->rec1ENTRY: Formula: (= |v_rec1_#in~iInParam_4| (+ v_rec2_~j_5 (- 1))) InVars {rec2_~j=v_rec2_~j_5} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_4|} AuxVars[] AssignedVars[rec1_#in~i]< 2152#rec1ENTRY [39] rec1ENTRY-->L12: Formula: (= v_rec1_~i_1 |v_rec1_#in~i_1|) InVars {rec1_#in~i=|v_rec1_#in~i_1|} OutVars{rec1_#in~i=|v_rec1_#in~i_1|, rec1_~i=v_rec1_~i_1} AuxVars[] AssignedVars[rec1_~i] 2156#L12 [65] L12-->L14: Formula: (> v_rec1_~i_3 0) InVars {rec1_~i=v_rec1_~i_3} OutVars{rec1_~i=v_rec1_~i_3} AuxVars[] AssignedVars[] 2132#L14 [48] L14-->rec1ENTRY: Formula: (= |v_rec1_#in~iInParam_1| (+ v_rec1_~i_5 (- 2))) InVars {rec1_~i=v_rec1_~i_5} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_1|} AuxVars[] AssignedVars[rec1_#in~i]< 2150#rec1ENTRY [2020-06-22 05:01:32,190 INFO L796 eck$LassoCheckResult]: Loop: 2150#rec1ENTRY [39] rec1ENTRY-->L12: Formula: (= v_rec1_~i_1 |v_rec1_#in~i_1|) InVars {rec1_#in~i=|v_rec1_#in~i_1|} OutVars{rec1_#in~i=|v_rec1_#in~i_1|, rec1_~i=v_rec1_~i_1} AuxVars[] AssignedVars[rec1_~i] 2167#L12 [65] L12-->L14: Formula: (> v_rec1_~i_3 0) InVars {rec1_~i=v_rec1_~i_3} OutVars{rec1_~i=v_rec1_~i_3} AuxVars[] AssignedVars[] 2125#L14 [48] L14-->rec1ENTRY: Formula: (= |v_rec1_#in~iInParam_1| (+ v_rec1_~i_5 (- 2))) InVars {rec1_~i=v_rec1_~i_5} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_1|} AuxVars[] AssignedVars[rec1_#in~i]< 2165#rec1ENTRY [39] rec1ENTRY-->L12: Formula: (= v_rec1_~i_1 |v_rec1_#in~i_1|) InVars {rec1_#in~i=|v_rec1_#in~i_1|} OutVars{rec1_#in~i=|v_rec1_#in~i_1|, rec1_~i=v_rec1_~i_1} AuxVars[] AssignedVars[rec1_~i] 2167#L12 [65] L12-->L14: Formula: (> v_rec1_~i_3 0) InVars {rec1_~i=v_rec1_~i_3} OutVars{rec1_~i=v_rec1_~i_3} AuxVars[] AssignedVars[] 2125#L14 [48] L14-->rec1ENTRY: Formula: (= |v_rec1_#in~iInParam_1| (+ v_rec1_~i_5 (- 2))) InVars {rec1_~i=v_rec1_~i_5} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_1|} AuxVars[] AssignedVars[rec1_#in~i]< 2165#rec1ENTRY [39] rec1ENTRY-->L12: Formula: (= v_rec1_~i_1 |v_rec1_#in~i_1|) InVars {rec1_#in~i=|v_rec1_#in~i_1|} OutVars{rec1_#in~i=|v_rec1_#in~i_1|, rec1_~i=v_rec1_~i_1} AuxVars[] AssignedVars[rec1_~i] 2143#L12 [44] L12-->rec1FINAL: Formula: (and (<= v_rec1_~i_2 0) (= |v_rec1_#res_1| 0)) InVars {rec1_~i=v_rec1_~i_2} OutVars{rec1_#res=|v_rec1_#res_1|, rec1_~i=v_rec1_~i_2} AuxVars[] AssignedVars[rec1_#res] 2124#rec1FINAL [40] rec1FINAL-->rec1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 2126#rec1EXIT >[59] rec1EXIT-->L14-1: AOR: Formula: (= |v_rec1_#t~ret0_4| |v_rec1_#resOutParam_1|) InVars {rec1_#res=|v_rec1_#resOutParam_1|} OutVars{rec1_#t~ret0=|v_rec1_#t~ret0_4|} AuxVars[] AssignedVars[rec1_#t~ret0] LVA: Formula: (= |v_rec1_#in~iInParam_1| (+ v_rec1_~i_5 (- 2))) InVars {rec1_~i=v_rec1_~i_5} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_1|} AuxVars[] AssignedVars[rec1_#in~i] 2118#L14-1 [42] L14-1-->rec1ENTRY: Formula: (= |v_rec1_#in~iInParam_2| (+ |v_rec1_#t~ret0_5| (- 1))) InVars {rec1_#t~ret0=|v_rec1_#t~ret0_5|} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_2|} AuxVars[] AssignedVars[rec1_#in~i]< 2117#rec1ENTRY [39] rec1ENTRY-->L12: Formula: (= v_rec1_~i_1 |v_rec1_#in~i_1|) InVars {rec1_#in~i=|v_rec1_#in~i_1|} OutVars{rec1_#in~i=|v_rec1_#in~i_1|, rec1_~i=v_rec1_~i_1} AuxVars[] AssignedVars[rec1_~i] 2120#L12 [44] L12-->rec1FINAL: Formula: (and (<= v_rec1_~i_2 0) (= |v_rec1_#res_1| 0)) InVars {rec1_~i=v_rec1_~i_2} OutVars{rec1_#res=|v_rec1_#res_1|, rec1_~i=v_rec1_~i_2} AuxVars[] AssignedVars[rec1_#res] 2172#rec1FINAL [40] rec1FINAL-->rec1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 2171#rec1EXIT >[58] rec1EXIT-->L14-2: AOR: Formula: (= |v_rec1_#t~ret1_4| |v_rec1_#resOutParam_2|) InVars {rec1_#res=|v_rec1_#resOutParam_2|} OutVars{rec1_#t~ret1=|v_rec1_#t~ret1_4|} AuxVars[] AssignedVars[rec1_#t~ret1] LVA: Formula: (= |v_rec1_#in~iInParam_2| (+ |v_rec1_#t~ret0_5| (- 1))) InVars {rec1_#t~ret0=|v_rec1_#t~ret0_5|} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_2|} AuxVars[] AssignedVars[rec1_#in~i] 2134#L14-2 [46] L14-2-->rec1ENTRY: Formula: (= |v_rec1_#in~iInParam_3| |v_rec1_#t~ret1_5|) InVars {rec1_#t~ret1=|v_rec1_#t~ret1_5|} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_3|} AuxVars[] AssignedVars[rec1_#in~i]< 2146#rec1ENTRY [39] rec1ENTRY-->L12: Formula: (= v_rec1_~i_1 |v_rec1_#in~i_1|) InVars {rec1_#in~i=|v_rec1_#in~i_1|} OutVars{rec1_#in~i=|v_rec1_#in~i_1|, rec1_~i=v_rec1_~i_1} AuxVars[] AssignedVars[rec1_~i] 2159#L12 [44] L12-->rec1FINAL: Formula: (and (<= v_rec1_~i_2 0) (= |v_rec1_#res_1| 0)) InVars {rec1_~i=v_rec1_~i_2} OutVars{rec1_#res=|v_rec1_#res_1|, rec1_~i=v_rec1_~i_2} AuxVars[] AssignedVars[rec1_#res] 2158#rec1FINAL [40] rec1FINAL-->rec1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 2157#rec1EXIT >[63] rec1EXIT-->L14-3: AOR: Formula: (= |v_rec1_#t~ret2_4| |v_rec1_#resOutParam_3|) InVars {rec1_#res=|v_rec1_#resOutParam_3|} OutVars{rec1_#t~ret2=|v_rec1_#t~ret2_4|} AuxVars[] AssignedVars[rec1_#t~ret2] LVA: Formula: (= |v_rec1_#in~iInParam_3| |v_rec1_#t~ret1_5|) InVars {rec1_#t~ret1=|v_rec1_#t~ret1_5|} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_3|} AuxVars[] AssignedVars[rec1_#in~i] 2138#L14-3 [43] L14-3-->rec1FINAL: Formula: (= |v_rec1_#res_2| (+ |v_rec1_#t~ret2_3| 1)) InVars {rec1_#t~ret2=|v_rec1_#t~ret2_3|} OutVars{rec1_#t~ret1=|v_rec1_#t~ret1_3|, rec1_#t~ret2=|v_rec1_#t~ret2_2|, rec1_#res=|v_rec1_#res_2|, rec1_#t~ret0=|v_rec1_#t~ret0_3|} AuxVars[] AssignedVars[rec1_#t~ret1, rec1_#t~ret2, rec1_#res, rec1_#t~ret0] 2139#rec1FINAL [40] rec1FINAL-->rec1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 2164#rec1EXIT >[59] rec1EXIT-->L14-1: AOR: Formula: (= |v_rec1_#t~ret0_4| |v_rec1_#resOutParam_1|) InVars {rec1_#res=|v_rec1_#resOutParam_1|} OutVars{rec1_#t~ret0=|v_rec1_#t~ret0_4|} AuxVars[] AssignedVars[rec1_#t~ret0] LVA: Formula: (= |v_rec1_#in~iInParam_1| (+ v_rec1_~i_5 (- 2))) InVars {rec1_~i=v_rec1_~i_5} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_1|} AuxVars[] AssignedVars[rec1_#in~i] 2131#L14-1 [42] L14-1-->rec1ENTRY: Formula: (= |v_rec1_#in~iInParam_2| (+ |v_rec1_#t~ret0_5| (- 1))) InVars {rec1_#t~ret0=|v_rec1_#t~ret0_5|} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_2|} AuxVars[] AssignedVars[rec1_#in~i]< 2146#rec1ENTRY [39] rec1ENTRY-->L12: Formula: (= v_rec1_~i_1 |v_rec1_#in~i_1|) InVars {rec1_#in~i=|v_rec1_#in~i_1|} OutVars{rec1_#in~i=|v_rec1_#in~i_1|, rec1_~i=v_rec1_~i_1} AuxVars[] AssignedVars[rec1_~i] 2159#L12 [65] L12-->L14: Formula: (> v_rec1_~i_3 0) InVars {rec1_~i=v_rec1_~i_3} OutVars{rec1_~i=v_rec1_~i_3} AuxVars[] AssignedVars[] 2130#L14 [48] L14-->rec1ENTRY: Formula: (= |v_rec1_#in~iInParam_1| (+ v_rec1_~i_5 (- 2))) InVars {rec1_~i=v_rec1_~i_5} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_1|} AuxVars[] AssignedVars[rec1_#in~i]< 2150#rec1ENTRY [2020-06-22 05:01:32,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 05:01:32,191 INFO L82 PathProgramCache]: Analyzing trace with hash 2104360712, now seen corresponding path program 4 times [2020-06-22 05:01:32,191 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 05:01:32,191 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 05:01:32,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:01:32,192 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 05:01:32,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:01:32,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:01:32,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:01:32,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 05:01:32,198 INFO L82 PathProgramCache]: Analyzing trace with hash -561081304, now seen corresponding path program 1 times [2020-06-22 05:01:32,198 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 05:01:32,198 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 05:01:32,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:01:32,199 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 05:01:32,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:01:32,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:01:32,240 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 21 proven. 2 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2020-06-22 05:01:32,241 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 05:01:32,241 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2020-06-22 05:01:32,252 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 05:01:32,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:01:32,262 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2020-06-22 05:01:32,264 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:01:32,271 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 21 proven. 2 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2020-06-22 05:01:32,298 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-06-22 05:01:32,298 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2020-06-22 05:01:32,299 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-06-22 05:01:32,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-06-22 05:01:32,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-06-22 05:01:32,299 INFO L87 Difference]: Start difference. First operand 73 states and 91 transitions. cyclomatic complexity: 21 Second operand 8 states. [2020-06-22 05:01:32,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 05:01:32,356 INFO L93 Difference]: Finished difference Result 81 states and 97 transitions. [2020-06-22 05:01:32,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-06-22 05:01:32,358 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 81 states and 97 transitions. [2020-06-22 05:01:32,360 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2020-06-22 05:01:32,361 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 81 states to 81 states and 97 transitions. [2020-06-22 05:01:32,362 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 37 [2020-06-22 05:01:32,362 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 37 [2020-06-22 05:01:32,362 INFO L73 IsDeterministic]: Start isDeterministic. Operand 81 states and 97 transitions. [2020-06-22 05:01:32,362 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 05:01:32,362 INFO L706 BuchiCegarLoop]: Abstraction has 81 states and 97 transitions. [2020-06-22 05:01:32,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states and 97 transitions. [2020-06-22 05:01:32,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 69. [2020-06-22 05:01:32,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2020-06-22 05:01:32,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 83 transitions. [2020-06-22 05:01:32,368 INFO L729 BuchiCegarLoop]: Abstraction has 69 states and 83 transitions. [2020-06-22 05:01:32,368 INFO L609 BuchiCegarLoop]: Abstraction has 69 states and 83 transitions. [2020-06-22 05:01:32,368 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2020-06-22 05:01:32,368 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 69 states and 83 transitions. [2020-06-22 05:01:32,369 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2020-06-22 05:01:32,369 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 05:01:32,369 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 05:01:32,370 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 05:01:32,370 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [4, 2, 2, 2, 2, 1, 1, 1, 1] [2020-06-22 05:01:32,370 INFO L794 eck$LassoCheckResult]: Stem: 2400#ULTIMATE.startENTRY [47] ULTIMATE.startENTRY-->L25: Formula: (= v_ULTIMATE.start_main_~x~0_1 |v_ULTIMATE.start_main_#t~nondet5_4|) InVars {} OutVars{ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_1|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1, ULTIMATE.start_main_#t~ret6=|v_ULTIMATE.start_main_#t~ret6_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|} AuxVars[|v_ULTIMATE.start_main_#t~nondet5_4|] AssignedVars[ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_#res, ULTIMATE.start_main_~x~0, ULTIMATE.start_main_#t~ret6] 2363#L25 [56] L25-->rec2ENTRY: Formula: (= |v_rec2_#in~jInParam_2| v_ULTIMATE.start_main_~x~0_5) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} OutVars{rec2_#in~j=|v_rec2_#in~jInParam_2|} AuxVars[] AssignedVars[rec2_#in~j]< 2362#rec2ENTRY [38] rec2ENTRY-->L18: Formula: (= v_rec2_~j_1 |v_rec2_#in~j_1|) InVars {rec2_#in~j=|v_rec2_#in~j_1|} OutVars{rec2_~j=v_rec2_~j_1, rec2_#in~j=|v_rec2_#in~j_1|} AuxVars[] AssignedVars[rec2_~j] 2365#L18 [64] L18-->L20: Formula: (> v_rec2_~j_3 0) InVars {rec2_~j=v_rec2_~j_3} OutVars{rec2_~j=v_rec2_~j_3} AuxVars[] AssignedVars[] 2386#L20 [50] L20-->rec1ENTRY: Formula: (= |v_rec1_#in~iInParam_4| (+ v_rec2_~j_5 (- 1))) InVars {rec2_~j=v_rec2_~j_5} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_4|} AuxVars[] AssignedVars[rec1_#in~i]< 2403#rec1ENTRY [39] rec1ENTRY-->L12: Formula: (= v_rec1_~i_1 |v_rec1_#in~i_1|) InVars {rec1_#in~i=|v_rec1_#in~i_1|} OutVars{rec1_#in~i=|v_rec1_#in~i_1|, rec1_~i=v_rec1_~i_1} AuxVars[] AssignedVars[rec1_~i] 2415#L12 [65] L12-->L14: Formula: (> v_rec1_~i_3 0) InVars {rec1_~i=v_rec1_~i_3} OutVars{rec1_~i=v_rec1_~i_3} AuxVars[] AssignedVars[] 2379#L14 [48] L14-->rec1ENTRY: Formula: (= |v_rec1_#in~iInParam_1| (+ v_rec1_~i_5 (- 2))) InVars {rec1_~i=v_rec1_~i_5} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_1|} AuxVars[] AssignedVars[rec1_#in~i]< 2401#rec1ENTRY [2020-06-22 05:01:32,371 INFO L796 eck$LassoCheckResult]: Loop: 2401#rec1ENTRY [39] rec1ENTRY-->L12: Formula: (= v_rec1_~i_1 |v_rec1_#in~i_1|) InVars {rec1_#in~i=|v_rec1_#in~i_1|} OutVars{rec1_#in~i=|v_rec1_#in~i_1|, rec1_~i=v_rec1_~i_1} AuxVars[] AssignedVars[rec1_~i] 2422#L12 [65] L12-->L14: Formula: (> v_rec1_~i_3 0) InVars {rec1_~i=v_rec1_~i_3} OutVars{rec1_~i=v_rec1_~i_3} AuxVars[] AssignedVars[] 2377#L14 [48] L14-->rec1ENTRY: Formula: (= |v_rec1_#in~iInParam_1| (+ v_rec1_~i_5 (- 2))) InVars {rec1_~i=v_rec1_~i_5} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_1|} AuxVars[] AssignedVars[rec1_#in~i]< 2420#rec1ENTRY [39] rec1ENTRY-->L12: Formula: (= v_rec1_~i_1 |v_rec1_#in~i_1|) InVars {rec1_#in~i=|v_rec1_#in~i_1|} OutVars{rec1_#in~i=|v_rec1_#in~i_1|, rec1_~i=v_rec1_~i_1} AuxVars[] AssignedVars[rec1_~i] 2421#L12 [44] L12-->rec1FINAL: Formula: (and (<= v_rec1_~i_2 0) (= |v_rec1_#res_1| 0)) InVars {rec1_~i=v_rec1_~i_2} OutVars{rec1_#res=|v_rec1_#res_1|, rec1_~i=v_rec1_~i_2} AuxVars[] AssignedVars[rec1_#res] 2419#rec1FINAL [40] rec1FINAL-->rec1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 2398#rec1EXIT >[59] rec1EXIT-->L14-1: AOR: Formula: (= |v_rec1_#t~ret0_4| |v_rec1_#resOutParam_1|) InVars {rec1_#res=|v_rec1_#resOutParam_1|} OutVars{rec1_#t~ret0=|v_rec1_#t~ret0_4|} AuxVars[] AssignedVars[rec1_#t~ret0] LVA: Formula: (= |v_rec1_#in~iInParam_1| (+ v_rec1_~i_5 (- 2))) InVars {rec1_~i=v_rec1_~i_5} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_1|} AuxVars[] AssignedVars[rec1_#in~i] 2369#L14-1 [42] L14-1-->rec1ENTRY: Formula: (= |v_rec1_#in~iInParam_2| (+ |v_rec1_#t~ret0_5| (- 1))) InVars {rec1_#t~ret0=|v_rec1_#t~ret0_5|} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_2|} AuxVars[] AssignedVars[rec1_#in~i]< 2368#rec1ENTRY [39] rec1ENTRY-->L12: Formula: (= v_rec1_~i_1 |v_rec1_#in~i_1|) InVars {rec1_#in~i=|v_rec1_#in~i_1|} OutVars{rec1_#in~i=|v_rec1_#in~i_1|, rec1_~i=v_rec1_~i_1} AuxVars[] AssignedVars[rec1_~i] 2371#L12 [44] L12-->rec1FINAL: Formula: (and (<= v_rec1_~i_2 0) (= |v_rec1_#res_1| 0)) InVars {rec1_~i=v_rec1_~i_2} OutVars{rec1_#res=|v_rec1_#res_1|, rec1_~i=v_rec1_~i_2} AuxVars[] AssignedVars[rec1_#res] 2424#rec1FINAL [40] rec1FINAL-->rec1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 2406#rec1EXIT >[58] rec1EXIT-->L14-2: AOR: Formula: (= |v_rec1_#t~ret1_4| |v_rec1_#resOutParam_2|) InVars {rec1_#res=|v_rec1_#resOutParam_2|} OutVars{rec1_#t~ret1=|v_rec1_#t~ret1_4|} AuxVars[] AssignedVars[rec1_#t~ret1] LVA: Formula: (= |v_rec1_#in~iInParam_2| (+ |v_rec1_#t~ret0_5| (- 1))) InVars {rec1_#t~ret0=|v_rec1_#t~ret0_5|} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_2|} AuxVars[] AssignedVars[rec1_#in~i] 2381#L14-2 [46] L14-2-->rec1ENTRY: Formula: (= |v_rec1_#in~iInParam_3| |v_rec1_#t~ret1_5|) InVars {rec1_#t~ret1=|v_rec1_#t~ret1_5|} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_3|} AuxVars[] AssignedVars[rec1_#in~i]< 2395#rec1ENTRY [39] rec1ENTRY-->L12: Formula: (= v_rec1_~i_1 |v_rec1_#in~i_1|) InVars {rec1_#in~i=|v_rec1_#in~i_1|} OutVars{rec1_#in~i=|v_rec1_#in~i_1|, rec1_~i=v_rec1_~i_1} AuxVars[] AssignedVars[rec1_~i] 2409#L12 [65] L12-->L14: Formula: (> v_rec1_~i_3 0) InVars {rec1_~i=v_rec1_~i_3} OutVars{rec1_~i=v_rec1_~i_3} AuxVars[] AssignedVars[] 2378#L14 [48] L14-->rec1ENTRY: Formula: (= |v_rec1_#in~iInParam_1| (+ v_rec1_~i_5 (- 2))) InVars {rec1_~i=v_rec1_~i_5} OutVars{rec1_#in~i=|v_rec1_#in~iInParam_1|} AuxVars[] AssignedVars[rec1_#in~i]< 2401#rec1ENTRY [2020-06-22 05:01:32,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 05:01:32,371 INFO L82 PathProgramCache]: Analyzing trace with hash 2104360712, now seen corresponding path program 5 times [2020-06-22 05:01:32,371 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 05:01:32,371 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 05:01:32,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:01:32,372 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 05:01:32,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:01:32,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:01:32,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:01:32,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 05:01:32,378 INFO L82 PathProgramCache]: Analyzing trace with hash -1762080644, now seen corresponding path program 1 times [2020-06-22 05:01:32,378 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 05:01:32,378 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 05:01:32,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:01:32,379 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 05:01:32,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:01:32,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:01:32,403 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-06-22 05:01:32,404 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 05:01:32,404 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-06-22 05:01:32,404 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-06-22 05:01:32,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-06-22 05:01:32,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-06-22 05:01:32,405 INFO L87 Difference]: Start difference. First operand 69 states and 83 transitions. cyclomatic complexity: 17 Second operand 6 states. [2020-06-22 05:01:32,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 05:01:32,455 INFO L93 Difference]: Finished difference Result 68 states and 79 transitions. [2020-06-22 05:01:32,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-06-22 05:01:32,457 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 68 states and 79 transitions. [2020-06-22 05:01:32,458 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-06-22 05:01:32,459 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 68 states to 0 states and 0 transitions. [2020-06-22 05:01:32,459 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-06-22 05:01:32,459 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-06-22 05:01:32,459 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-06-22 05:01:32,459 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 05:01:32,459 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 05:01:32,459 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 05:01:32,459 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 05:01:32,459 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2020-06-22 05:01:32,459 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-06-22 05:01:32,460 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-06-22 05:01:32,460 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-06-22 05:01:32,466 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 05:01:32 BasicIcfg [2020-06-22 05:01:32,466 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-06-22 05:01:32,466 INFO L168 Benchmark]: Toolchain (without parser) took 5723.88 ms. Allocated memory was 649.6 MB in the beginning and 774.9 MB in the end (delta: 125.3 MB). Free memory was 560.9 MB in the beginning and 508.4 MB in the end (delta: 52.5 MB). Peak memory consumption was 177.8 MB. Max. memory is 50.3 GB. [2020-06-22 05:01:32,468 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 649.6 MB. Free memory is still 580.4 MB. There was no memory consumed. Max. memory is 50.3 GB. [2020-06-22 05:01:32,469 INFO L168 Benchmark]: CACSL2BoogieTranslator took 269.13 ms. Allocated memory was 649.6 MB in the beginning and 698.4 MB in the end (delta: 48.8 MB). Free memory was 560.9 MB in the beginning and 662.4 MB in the end (delta: -101.4 MB). Peak memory consumption was 29.2 MB. Max. memory is 50.3 GB. [2020-06-22 05:01:32,469 INFO L168 Benchmark]: Boogie Procedure Inliner took 32.46 ms. Allocated memory is still 698.4 MB. Free memory was 662.4 MB in the beginning and 661.3 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 50.3 GB. [2020-06-22 05:01:32,470 INFO L168 Benchmark]: Boogie Preprocessor took 16.19 ms. Allocated memory is still 698.4 MB. Free memory was 661.3 MB in the beginning and 660.2 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 50.3 GB. [2020-06-22 05:01:32,470 INFO L168 Benchmark]: RCFGBuilder took 202.51 ms. Allocated memory is still 698.4 MB. Free memory was 660.2 MB in the beginning and 645.7 MB in the end (delta: 14.5 MB). Peak memory consumption was 14.5 MB. Max. memory is 50.3 GB. [2020-06-22 05:01:32,471 INFO L168 Benchmark]: BlockEncodingV2 took 70.04 ms. Allocated memory is still 698.4 MB. Free memory was 645.7 MB in the beginning and 641.4 MB in the end (delta: 4.3 MB). Peak memory consumption was 4.3 MB. Max. memory is 50.3 GB. [2020-06-22 05:01:32,471 INFO L168 Benchmark]: TraceAbstraction took 181.82 ms. Allocated memory is still 698.4 MB. Free memory was 640.3 MB in the beginning and 628.4 MB in the end (delta: 11.9 MB). Peak memory consumption was 11.9 MB. Max. memory is 50.3 GB. [2020-06-22 05:01:32,472 INFO L168 Benchmark]: BuchiAutomizer took 4946.32 ms. Allocated memory was 698.4 MB in the beginning and 774.9 MB in the end (delta: 76.5 MB). Free memory was 628.4 MB in the beginning and 508.4 MB in the end (delta: 120.0 MB). Peak memory consumption was 196.5 MB. Max. memory is 50.3 GB. [2020-06-22 05:01:32,476 INFO L337 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 21 locations, 26 edges - StatisticsResult: Encoded RCFG 17 locations, 22 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 649.6 MB. Free memory is still 580.4 MB. There was no memory consumed. Max. memory is 50.3 GB. * CACSL2BoogieTranslator took 269.13 ms. Allocated memory was 649.6 MB in the beginning and 698.4 MB in the end (delta: 48.8 MB). Free memory was 560.9 MB in the beginning and 662.4 MB in the end (delta: -101.4 MB). Peak memory consumption was 29.2 MB. Max. memory is 50.3 GB. * Boogie Procedure Inliner took 32.46 ms. Allocated memory is still 698.4 MB. Free memory was 662.4 MB in the beginning and 661.3 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 50.3 GB. * Boogie Preprocessor took 16.19 ms. Allocated memory is still 698.4 MB. Free memory was 661.3 MB in the beginning and 660.2 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 50.3 GB. * RCFGBuilder took 202.51 ms. Allocated memory is still 698.4 MB. Free memory was 660.2 MB in the beginning and 645.7 MB in the end (delta: 14.5 MB). Peak memory consumption was 14.5 MB. Max. memory is 50.3 GB. * BlockEncodingV2 took 70.04 ms. Allocated memory is still 698.4 MB. Free memory was 645.7 MB in the beginning and 641.4 MB in the end (delta: 4.3 MB). Peak memory consumption was 4.3 MB. Max. memory is 50.3 GB. * TraceAbstraction took 181.82 ms. Allocated memory is still 698.4 MB. Free memory was 640.3 MB in the beginning and 628.4 MB in the end (delta: 11.9 MB). Peak memory consumption was 11.9 MB. Max. memory is 50.3 GB. * BuchiAutomizer took 4946.32 ms. Allocated memory was 698.4 MB in the beginning and 774.9 MB in the end (delta: 76.5 MB). Free memory was 628.4 MB in the beginning and 508.4 MB in the end (delta: 120.0 MB). Peak memory consumption was 196.5 MB. Max. memory is 50.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - AllSpecificationsHoldResult: All specifications hold We were not able to verify any specifiation because the program does not contain any specification. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 17 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=17occurred 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, 8 LocationsWithAnnotation, 23 PreInvPairs, 23 NumberOfFragments, 8 HoareAnnotationTreeSize, 23 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 8 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - StatisticsResult: Constructed decomposition of program Your program was decomposed into 9 terminating modules (6 trivial, 0 deterministic, 3 nondeterministic). One nondeterministic module has affine ranking function \old(j) and consists of 15 locations. One nondeterministic module has affine ranking function \old(j) and consists of 18 locations. One nondeterministic module has affine ranking function \old(i) and consists of 5 locations. 6 modules have a trivial ranking function, the largest among these consists of 8 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 4.9s and 10 iterations. TraceHistogramMax:13. Analysis of lassos took 2.0s. Construction of modules took 0.6s. Büchi inclusion checks took 1.9s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 7. Automata minimization 0.0s AutomataMinimizationTime, 8 MinimizatonAttempts, 155 StatesRemovedByMinimization, 8 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 73 states and ocurred in iteration 7. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 19/24 HoareTripleCheckerStatistics: 175 SDtfs, 175 SDslu, 478 SDs, 0 SdLazy, 724 SolverSat, 205 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time LassoAnalysisResults: nont0 unkn0 SFLI6 SFLT3 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital10 mio100 ax100 hnf100 lsp100 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq144 hnf93 smp100 dnf100 smp100 tf113 neg100 sie112 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 9ms VariablesStem: 0 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 5 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 3 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.1s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! !SESSION 2020-06-22 05:01:23.508 ----------------------------------------------- eclipse.buildId=unknown java.version=1.8.0_242 java.vendor=Oracle Corporation BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox/benchmark/theBenchmark.c Command-line arguments: -os linux -ws gtk -arch x86_64 -consoleLog -data @user.home/.ultimate -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -data /export/starexec/sandbox/tmp -i /export/starexec/sandbox/benchmark/theBenchmark.c !ENTRY org.eclipse.core.resources 2 10035 2020-06-22 05:01:32.711 !MESSAGE The workspace will exit with unsaved changes in this session. Received shutdown request... Ultimate: GTK+ Version Check