NO Ultimate: Cannot open display: This is Ultimate 0.1.24-8dc7c08-m [2020-06-22 05:31:24,758 INFO L170 SettingsManager]: Resetting all preferences to default values... [2020-06-22 05:31:24,760 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2020-06-22 05:31:24,771 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-06-22 05:31:24,771 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-06-22 05:31:24,772 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-06-22 05:31:24,773 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-06-22 05:31:24,775 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2020-06-22 05:31:24,776 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-06-22 05:31:24,777 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-06-22 05:31:24,778 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-06-22 05:31:24,778 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-06-22 05:31:24,779 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-06-22 05:31:24,780 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-06-22 05:31:24,781 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-06-22 05:31:24,782 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-06-22 05:31:24,782 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-06-22 05:31:24,784 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-06-22 05:31:24,786 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2020-06-22 05:31:24,787 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-06-22 05:31:24,788 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-06-22 05:31:24,789 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-06-22 05:31:24,791 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-06-22 05:31:24,792 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-06-22 05:31:24,792 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-06-22 05:31:24,793 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-06-22 05:31:24,793 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-06-22 05:31:24,794 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-06-22 05:31:24,794 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-06-22 05:31:24,795 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-06-22 05:31:24,795 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-06-22 05:31:24,796 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2020-06-22 05:31:24,797 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-06-22 05:31:24,797 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2020-06-22 05:31:24,798 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-06-22 05:31:24,798 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-06-22 05:31:24,798 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2020-06-22 05:31:24,799 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2020-06-22 05:31:24,800 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2020-06-22 05:31:24,800 INFO L98 SettingsManager]: Beginning loading settings from /export/starexec/sandbox2/solver/bin/./../termcomp2017.epf [2020-06-22 05:31:24,814 INFO L110 SettingsManager]: Loading preferences was successful [2020-06-22 05:31:24,814 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2020-06-22 05:31:24,815 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-06-22 05:31:24,815 INFO L133 SettingsManager]: * Rewrite not-equals=true [2020-06-22 05:31:24,815 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2020-06-22 05:31:24,816 INFO L133 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE [2020-06-22 05:31:24,816 INFO L133 SettingsManager]: * Use SBE=true [2020-06-22 05:31:24,816 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-06-22 05:31:24,816 INFO L133 SettingsManager]: * Use old map elimination=false [2020-06-22 05:31:24,816 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2020-06-22 05:31:24,816 INFO L133 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION [2020-06-22 05:31:24,817 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2020-06-22 05:31:24,817 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-06-22 05:31:24,817 INFO L133 SettingsManager]: * Construct termination proof for TermComp=true [2020-06-22 05:31:24,817 INFO L133 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 05:31:24,817 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-06-22 05:31:24,817 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-06-22 05:31:24,818 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2020-06-22 05:31:24,818 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2020-06-22 05:31:24,818 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-06-22 05:31:24,818 INFO L133 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE [2020-06-22 05:31:24,819 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-06-22 05:31:24,819 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-06-22 05:31:24,819 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-06-22 05:31:24,819 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-06-22 05:31:24,819 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-06-22 05:31:24,819 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-06-22 05:31:24,819 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2020-06-22 05:31:24,820 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-06-22 05:31:24,845 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-06-22 05:31:24,858 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-06-22 05:31:24,861 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-06-22 05:31:24,862 INFO L271 PluginConnector]: Initializing CDTParser... [2020-06-22 05:31:24,863 INFO L276 PluginConnector]: CDTParser initialized [2020-06-22 05:31:24,864 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox2/benchmark/theBenchmark.c [2020-06-22 05:31:24,934 INFO L221 CDTParser]: Created temporary CDT project at /export/starexec/sandbox2/tmp/8b11638a21584a78b3ef57532b9047d1/FLAG9b6ac0c6f [2020-06-22 05:31:25,273 INFO L307 CDTParser]: Found 1 translation units. [2020-06-22 05:31:25,274 INFO L161 CDTParser]: Scanning /export/starexec/sandbox2/benchmark/theBenchmark.c [2020-06-22 05:31:25,280 INFO L355 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox2/tmp/8b11638a21584a78b3ef57532b9047d1/FLAG9b6ac0c6f [2020-06-22 05:31:25,661 INFO L363 CDTParser]: Successfully deleted /export/starexec/sandbox2/tmp/8b11638a21584a78b3ef57532b9047d1 [2020-06-22 05:31:25,672 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-06-22 05:31:25,674 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. [2020-06-22 05:31:25,675 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-06-22 05:31:25,675 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-06-22 05:31:25,679 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2020-06-22 05:31:25,680 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.06 05:31:25" (1/1) ... [2020-06-22 05:31:25,684 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@50a4ef63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 05:31:25, skipping insertion in model container [2020-06-22 05:31:25,684 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.06 05:31:25" (1/1) ... [2020-06-22 05:31:25,692 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-06-22 05:31:25,709 INFO L176 MainTranslator]: Built tables and reachable declarations [2020-06-22 05:31:25,850 WARN L614 FunctionHandler]: implicit declaration of function g [2020-06-22 05:31:25,861 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-06-22 05:31:25,865 INFO L191 MainTranslator]: Completed pre-run [2020-06-22 05:31:25,879 WARN L614 FunctionHandler]: implicit declaration of function g [2020-06-22 05:31:25,881 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-06-22 05:31:25,957 INFO L195 MainTranslator]: Completed translation [2020-06-22 05:31:25,958 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 05:31:25 WrapperNode [2020-06-22 05:31:25,958 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-06-22 05:31:25,959 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-06-22 05:31:25,959 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-06-22 05:31:25,959 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2020-06-22 05:31:25,968 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:31:25" (1/1) ... [2020-06-22 05:31:25,974 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:31:25" (1/1) ... [2020-06-22 05:31:25,992 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-06-22 05:31:25,992 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-06-22 05:31:25,992 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-06-22 05:31:25,993 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2020-06-22 05:31:26,002 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 05:31:25" (1/1) ... [2020-06-22 05:31:26,002 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 05:31:25" (1/1) ... [2020-06-22 05:31:26,003 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 05:31:25" (1/1) ... [2020-06-22 05:31:26,003 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 05:31:25" (1/1) ... [2020-06-22 05:31:26,005 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 05:31:25" (1/1) ... [2020-06-22 05:31:26,007 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 05:31:25" (1/1) ... [2020-06-22 05:31:26,007 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 05:31:25" (1/1) ... [2020-06-22 05:31:26,008 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-06-22 05:31:26,009 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-06-22 05:31:26,009 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-06-22 05:31:26,009 INFO L276 PluginConnector]: RCFGBuilder initialized [2020-06-22 05:31:26,010 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 05:31:25" (1/1) ... No working directory specified, using /export/starexec/sandbox2/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:31:26,074 INFO L130 BoogieDeclarations]: Found specification of procedure f [2020-06-22 05:31:26,075 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2020-06-22 05:31:26,075 INFO L130 BoogieDeclarations]: Found specification of procedure g [2020-06-22 05:31:26,075 INFO L138 BoogieDeclarations]: Found implementation of procedure g [2020-06-22 05:31:26,075 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-06-22 05:31:26,075 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-06-22 05:31:26,210 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-06-22 05:31:26,210 INFO L286 CfgBuilder]: Removed 4 assue(true) statements. [2020-06-22 05:31:26,212 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 05:31:26 BoogieIcfgContainer [2020-06-22 05:31:26,212 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-06-22 05:31:26,212 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- [2020-06-22 05:31:26,213 INFO L271 PluginConnector]: Initializing BlockEncodingV2... [2020-06-22 05:31:26,215 INFO L276 PluginConnector]: BlockEncodingV2 initialized [2020-06-22 05:31:26,215 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 05:31:26" (1/1) ... [2020-06-22 05:31:26,233 INFO L313 BlockEncoder]: Initial Icfg 20 locations, 24 edges [2020-06-22 05:31:26,235 INFO L258 BlockEncoder]: Using Remove infeasible edges [2020-06-22 05:31:26,235 INFO L263 BlockEncoder]: Using Maximize final states [2020-06-22 05:31:26,236 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false [2020-06-22 05:31:26,236 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE [2020-06-22 05:31:26,238 INFO L296 BlockEncoder]: Using Remove sink states [2020-06-22 05:31:26,239 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true [2020-06-22 05:31:26,239 INFO L179 BlockEncoder]: Using Rewrite not-equals [2020-06-22 05:31:26,253 INFO L185 BlockEncoder]: Using Use SBE [2020-06-22 05:31:26,260 INFO L200 BlockEncoder]: SBE split 0 edges [2020-06-22 05:31:26,266 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-06-22 05:31:26,267 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-06-22 05:31:26,277 INFO L100 BaseMinimizeStates]: Removed 4 edges and 2 locations by large block encoding [2020-06-22 05:31:26,279 INFO L70 RemoveSinkStates]: Removed 2 edges and 2 locations by removing sink states [2020-06-22 05:31:26,281 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-06-22 05:31:26,281 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-06-22 05:31:26,282 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding [2020-06-22 05:31:26,282 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states [2020-06-22 05:31:26,283 INFO L313 BlockEncoder]: Encoded RCFG 16 locations, 20 edges [2020-06-22 05:31:26,283 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 05:31:26 BasicIcfg [2020-06-22 05:31:26,283 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- [2020-06-22 05:31:26,284 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-06-22 05:31:26,284 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-06-22 05:31:26,287 INFO L276 PluginConnector]: TraceAbstraction initialized [2020-06-22 05:31:26,288 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.06 05:31:25" (1/4) ... [2020-06-22 05:31:26,288 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@535187 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 05:31:26, skipping insertion in model container [2020-06-22 05:31:26,289 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 05:31:25" (2/4) ... [2020-06-22 05:31:26,289 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@535187 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 05:31:26, skipping insertion in model container [2020-06-22 05:31:26,289 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 05:31:26" (3/4) ... [2020-06-22 05:31:26,290 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@535187 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 05:31:26, skipping insertion in model container [2020-06-22 05:31:26,290 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 05:31:26" (4/4) ... [2020-06-22 05:31:26,291 INFO L112 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-06-22 05:31:26,301 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2020-06-22 05:31:26,308 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 0 error locations. [2020-06-22 05:31:26,325 INFO L257 AbstractCegarLoop]: Starting to check reachability of 0 error locations. [2020-06-22 05:31:26,353 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2020-06-22 05:31:26,354 INFO L382 AbstractCegarLoop]: Interprodecural is true [2020-06-22 05:31:26,354 INFO L383 AbstractCegarLoop]: Hoare is true [2020-06-22 05:31:26,354 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2020-06-22 05:31:26,354 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-06-22 05:31:26,355 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-06-22 05:31:26,355 INFO L387 AbstractCegarLoop]: Difference is false [2020-06-22 05:31:26,355 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-06-22 05:31:26,355 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-06-22 05:31:26,373 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states. [2020-06-22 05:31:26,379 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-06-22 05:31:26,386 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 16 states. [2020-06-22 05:31:26,449 INFO L451 ceAbstractionStarter]: At program point L11(line 11) the Hoare annotation is: true [2020-06-22 05:31:26,449 INFO L448 ceAbstractionStarter]: For program point L10(lines 10 11) no Hoare annotation was computed. [2020-06-22 05:31:26,450 INFO L451 ceAbstractionStarter]: At program point L11-1(line 11) the Hoare annotation is: true [2020-06-22 05:31:26,450 INFO L448 ceAbstractionStarter]: For program point L11-2(line 11) no Hoare annotation was computed. [2020-06-22 05:31:26,450 INFO L448 ceAbstractionStarter]: For program point fEXIT(lines 8 12) no Hoare annotation was computed. [2020-06-22 05:31:26,450 INFO L451 ceAbstractionStarter]: At program point fENTRY(lines 8 12) the Hoare annotation is: true [2020-06-22 05:31:26,450 INFO L448 ceAbstractionStarter]: For program point fFINAL(lines 8 12) no Hoare annotation was computed. [2020-06-22 05:31:26,451 INFO L451 ceAbstractionStarter]: At program point L17(line 17) the Hoare annotation is: true [2020-06-22 05:31:26,451 INFO L448 ceAbstractionStarter]: For program point L16(lines 16 17) no Hoare annotation was computed. [2020-06-22 05:31:26,451 INFO L451 ceAbstractionStarter]: At program point L17-1(line 17) the Hoare annotation is: true [2020-06-22 05:31:26,451 INFO L448 ceAbstractionStarter]: For program point L17-2(line 17) no Hoare annotation was computed. [2020-06-22 05:31:26,451 INFO L448 ceAbstractionStarter]: For program point gEXIT(lines 14 18) no Hoare annotation was computed. [2020-06-22 05:31:26,452 INFO L448 ceAbstractionStarter]: For program point gFINAL(lines 14 18) no Hoare annotation was computed. [2020-06-22 05:31:26,452 INFO L451 ceAbstractionStarter]: At program point gENTRY(lines 14 18) the Hoare annotation is: true [2020-06-22 05:31:26,452 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-06-22 05:31:26,452 INFO L451 ceAbstractionStarter]: At program point L23(line 23) the Hoare annotation is: true [2020-06-22 05:31:26,455 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 05:31:26 BasicIcfg [2020-06-22 05:31:26,456 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-06-22 05:31:26,457 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-06-22 05:31:26,457 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-06-22 05:31:26,460 INFO L276 PluginConnector]: BuchiAutomizer initialized [2020-06-22 05:31:26,461 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 05:31:26,461 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.06 05:31:25" (1/5) ... [2020-06-22 05:31:26,462 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3872490 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.06 05:31:26, skipping insertion in model container [2020-06-22 05:31:26,462 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 05:31:26,462 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 05:31:25" (2/5) ... [2020-06-22 05:31:26,463 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3872490 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.06 05:31:26, skipping insertion in model container [2020-06-22 05:31:26,463 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 05:31:26,463 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 05:31:26" (3/5) ... [2020-06-22 05:31:26,464 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3872490 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 05:31:26, skipping insertion in model container [2020-06-22 05:31:26,464 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 05:31:26,464 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 05:31:26" (4/5) ... [2020-06-22 05:31:26,464 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3872490 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 05:31:26, skipping insertion in model container [2020-06-22 05:31:26,464 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 05:31:26,465 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 05:31:26" (5/5) ... [2020-06-22 05:31:26,466 INFO L375 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-06-22 05:31:26,494 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2020-06-22 05:31:26,495 INFO L374 BuchiCegarLoop]: Interprodecural is true [2020-06-22 05:31:26,495 INFO L375 BuchiCegarLoop]: Hoare is true [2020-06-22 05:31:26,495 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-06-22 05:31:26,495 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-06-22 05:31:26,496 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-06-22 05:31:26,496 INFO L379 BuchiCegarLoop]: Difference is false [2020-06-22 05:31:26,496 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-06-22 05:31:26,496 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-06-22 05:31:26,500 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states. [2020-06-22 05:31:26,520 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2020-06-22 05:31:26,521 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 05:31:26,521 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 05:31:26,528 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-06-22 05:31:26,528 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2020-06-22 05:31:26,528 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2020-06-22 05:31:26,528 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states. [2020-06-22 05:31:26,530 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2020-06-22 05:31:26,530 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 05:31:26,530 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 05:31:26,531 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-06-22 05:31:26,531 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2020-06-22 05:31:26,536 INFO L794 eck$LassoCheckResult]: Stem: 11#ULTIMATE.startENTRYtrue [43] ULTIMATE.startENTRY-->L23: Formula: (= v_ULTIMATE.start_main_~x~0_1 |v_ULTIMATE.start_main_#t~nondet4_4|) InVars {} OutVars{ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_1|, ULTIMATE.start_main_#t~ret5=|v_ULTIMATE.start_main_#t~ret5_1|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|} AuxVars[|v_ULTIMATE.start_main_#t~nondet4_4|] AssignedVars[ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~ret5, ULTIMATE.start_main_~x~0] 17#L23true [51] L23-->gENTRY: Formula: (= |v_g_#in~xInParam_3| v_ULTIMATE.start_main_~x~0_5) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} OutVars{g_#in~x=|v_g_#in~xInParam_3|} AuxVars[] AssignedVars[g_#in~x]< 13#gENTRYtrue [2020-06-22 05:31:26,537 INFO L796 eck$LassoCheckResult]: Loop: 13#gENTRYtrue [45] gENTRY-->L16: Formula: (= v_g_~x_1 |v_g_#in~x_1|) InVars {g_#in~x=|v_g_#in~x_1|} OutVars{g_#in~x=|v_g_#in~x_1|, g_~x=v_g_~x_1} AuxVars[] AssignedVars[g_~x] 14#L16true [59] L16-->L17: Formula: (> v_g_~x_3 0) InVars {g_~x=v_g_~x_3} OutVars{g_~x=v_g_~x_3} AuxVars[] AssignedVars[] 12#L17true [44] L17-->fENTRY: Formula: (= |v_f_#in~xInParam_1| (+ v_g_~x_6 (- 1))) InVars {g_~x=v_g_~x_6} OutVars{f_#in~x=|v_f_#in~xInParam_1|} AuxVars[] AssignedVars[f_#in~x]< 15#fENTRYtrue [47] fENTRY-->L10: Formula: (= v_f_~x_1 |v_f_#in~x_1|) InVars {f_#in~x=|v_f_#in~x_1|} OutVars{f_~x=v_f_~x_1, f_#in~x=|v_f_#in~x_1|} AuxVars[] AssignedVars[f_~x] 5#L10true [60] L10-->L11: Formula: (> v_f_~x_3 0) InVars {f_~x=v_f_~x_3} OutVars{f_~x=v_f_~x_3} AuxVars[] AssignedVars[] 3#L11true [35] L11-->gENTRY: Formula: (= |v_g_#in~xInParam_1| v_f_~x_6) InVars {f_~x=v_f_~x_6} OutVars{g_#in~x=|v_g_#in~xInParam_1|} AuxVars[] AssignedVars[g_#in~x]< 13#gENTRYtrue [2020-06-22 05:31:26,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 05:31:26,543 INFO L82 PathProgramCache]: Analyzing trace with hash 2345, now seen corresponding path program 1 times [2020-06-22 05:31:26,545 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 05:31:26,546 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 05:31:26,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:31:26,566 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 05:31:26,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:31:26,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:31:26,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:31:26,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 05:31:26,611 INFO L82 PathProgramCache]: Analyzing trace with hash -2063306215, now seen corresponding path program 1 times [2020-06-22 05:31:26,611 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 05:31:26,611 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 05:31:26,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:31:26,612 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 05:31:26,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:31:26,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:31:26,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:31:26,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 05:31:26,635 INFO L82 PathProgramCache]: Analyzing trace with hash -518849215, now seen corresponding path program 1 times [2020-06-22 05:31:26,635 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 05:31:26,635 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 05:31:26,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:31:26,636 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 05:31:26,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:31:26,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:31:26,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:31:26,774 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 05:31:26,776 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 05:31:26,776 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 05:31:26,776 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 05:31:26,776 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2020-06-22 05:31:26,776 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 05:31:26,776 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 05:31:26,777 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 05:31:26,777 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Loop [2020-06-22 05:31:26,777 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 05:31:26,777 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 05:31:26,795 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:31:26,803 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:31:26,805 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:31:26,808 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:31:26,810 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:31:26,823 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:31:26,826 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:31:26,829 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:31:26,831 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:31:26,833 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:31:26,901 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 05:31:26,902 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /export/starexec/sandbox2/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:31:26,910 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 05:31:26,910 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 05:31:26,919 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 05:31:26,919 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {f_#res=0} Honda state: {f_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox2/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:31:26,948 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 05:31:26,948 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 05:31:26,952 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 05:31:26,952 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {g_#t~ret2=0} Honda state: {g_#t~ret2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox2/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:31:26,979 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 05:31:26,980 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 05:31:26,983 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 05:31:26,983 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {g_#t~ret3=0} Honda state: {g_#t~ret3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox2/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:31:27,011 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 05:31:27,011 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 05:31:27,015 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 05:31:27,015 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {g_#res=0} Honda state: {g_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox2/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:31:27,043 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 05:31:27,043 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /export/starexec/sandbox2/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:31:27,073 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-06-22 05:31:27,074 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 05:31:27,143 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-06-22 05:31:27,145 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 05:31:27,145 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 05:31:27,145 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 05:31:27,145 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 05:31:27,146 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 05:31:27,146 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 05:31:27,146 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 05:31:27,146 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 05:31:27,146 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Loop [2020-06-22 05:31:27,146 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 05:31:27,146 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 05:31:27,148 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:31:27,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:31:27,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:31:27,157 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:31:27,159 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:31:27,161 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:31:27,163 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:31:27,170 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:31:27,178 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:31:27,181 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:31:27,237 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 05:31:27,243 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 05:31:27,245 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:31:27,247 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 05:31:27,247 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 05:31:27,248 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 05:31:27,248 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 05:31:27,248 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 05:31:27,250 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 05:31:27,250 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 05:31:27,254 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 05:31:27,255 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:31:27,255 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 05:31:27,256 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 05:31:27,256 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 05:31:27,256 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 05:31:27,256 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 05:31:27,257 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 05:31:27,257 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 05:31:27,258 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 05:31:27,259 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:31:27,259 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 05:31:27,259 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 05:31:27,260 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 05:31:27,260 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 05:31:27,260 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 05:31:27,261 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 05:31:27,261 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 05:31:27,262 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 05:31:27,262 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:31:27,263 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 05:31:27,263 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 05:31:27,263 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 05:31:27,263 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 05:31:27,264 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 05:31:27,264 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 05:31:27,264 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 05:31:27,266 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 05:31:27,266 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:31:27,267 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 05:31:27,267 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 05:31:27,267 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 05:31:27,267 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 05:31:27,267 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 05:31:27,268 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 05:31:27,268 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 05:31:27,269 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 05:31:27,270 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:31:27,270 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 05:31:27,270 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 05:31:27,271 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 05:31:27,271 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 05:31:27,271 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 05:31:27,271 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 05:31:27,272 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 05:31:27,273 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 05:31:27,273 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:31:27,274 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 05:31:27,274 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 05:31:27,274 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 05:31:27,274 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 05:31:27,274 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 05:31:27,275 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 05:31:27,275 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 05:31:27,281 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 05:31:27,285 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-06-22 05:31:27,285 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2020-06-22 05:31:27,287 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 05:31:27,287 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-06-22 05:31:27,288 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 05:31:27,288 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(g_#in~x) = 1*g_#in~x Supporting invariants [] [2020-06-22 05:31:27,289 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-06-22 05:31:27,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 05:31:27,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:31:27,330 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 05:31:27,331 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:31:27,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:31:27,357 INFO L256 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 11 conjunts are in the unsatisfiable core [2020-06-22 05:31:27,358 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:31:27,415 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:31:27,441 INFO L98 LoopCannibalizer]: 5 predicates before loop cannibalization 5 predicates after loop cannibalization [2020-06-22 05:31:27,446 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 5 loop predicates [2020-06-22 05:31:27,448 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 16 states. Second operand 6 states. [2020-06-22 05:31:27,637 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 16 states.. Second operand 6 states. Result 62 states and 82 transitions. Complement of second has 28 states. [2020-06-22 05:31:27,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 1 stem states 6 non-accepting loop states 1 accepting loop states [2020-06-22 05:31:27,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-06-22 05:31:27,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 34 transitions. [2020-06-22 05:31:27,644 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 34 transitions. Stem has 2 letters. Loop has 6 letters. [2020-06-22 05:31:27,646 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 05:31:27,646 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 34 transitions. Stem has 8 letters. Loop has 6 letters. [2020-06-22 05:31:27,646 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 05:31:27,647 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 34 transitions. Stem has 2 letters. Loop has 12 letters. [2020-06-22 05:31:27,647 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 05:31:27,654 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 62 states and 82 transitions. [2020-06-22 05:31:27,661 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2020-06-22 05:31:27,672 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 62 states to 47 states and 63 transitions. [2020-06-22 05:31:27,673 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 31 [2020-06-22 05:31:27,673 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 32 [2020-06-22 05:31:27,674 INFO L73 IsDeterministic]: Start isDeterministic. Operand 47 states and 63 transitions. [2020-06-22 05:31:27,676 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 05:31:27,677 INFO L706 BuchiCegarLoop]: Abstraction has 47 states and 63 transitions. [2020-06-22 05:31:27,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states and 63 transitions. [2020-06-22 05:31:27,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 44. [2020-06-22 05:31:27,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2020-06-22 05:31:27,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 56 transitions. [2020-06-22 05:31:27,714 INFO L729 BuchiCegarLoop]: Abstraction has 44 states and 56 transitions. [2020-06-22 05:31:27,714 INFO L609 BuchiCegarLoop]: Abstraction has 44 states and 56 transitions. [2020-06-22 05:31:27,714 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2020-06-22 05:31:27,714 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 44 states and 56 transitions. [2020-06-22 05:31:27,716 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2020-06-22 05:31:27,716 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 05:31:27,716 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 05:31:27,718 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 05:31:27,718 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 05:31:27,718 INFO L794 eck$LassoCheckResult]: Stem: 187#ULTIMATE.startENTRY [43] ULTIMATE.startENTRY-->L23: Formula: (= v_ULTIMATE.start_main_~x~0_1 |v_ULTIMATE.start_main_#t~nondet4_4|) InVars {} OutVars{ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_1|, ULTIMATE.start_main_#t~ret5=|v_ULTIMATE.start_main_#t~ret5_1|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|} AuxVars[|v_ULTIMATE.start_main_#t~nondet4_4|] AssignedVars[ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~ret5, ULTIMATE.start_main_~x~0] 185#L23 [51] L23-->gENTRY: Formula: (= |v_g_#in~xInParam_3| v_ULTIMATE.start_main_~x~0_5) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} OutVars{g_#in~x=|v_g_#in~xInParam_3|} AuxVars[] AssignedVars[g_#in~x]< 188#gENTRY [45] gENTRY-->L16: Formula: (= v_g_~x_1 |v_g_#in~x_1|) InVars {g_#in~x=|v_g_#in~x_1|} OutVars{g_#in~x=|v_g_#in~x_1|, g_~x=v_g_~x_1} AuxVars[] AssignedVars[g_~x] 189#L16 [59] L16-->L17: Formula: (> v_g_~x_3 0) InVars {g_~x=v_g_~x_3} OutVars{g_~x=v_g_~x_3} AuxVars[] AssignedVars[] 166#L17 [44] L17-->fENTRY: Formula: (= |v_f_#in~xInParam_1| (+ v_g_~x_6 (- 1))) InVars {g_~x=v_g_~x_6} OutVars{f_#in~x=|v_f_#in~xInParam_1|} AuxVars[] AssignedVars[f_#in~x]< 186#fENTRY [47] fENTRY-->L10: Formula: (= v_f_~x_1 |v_f_#in~x_1|) InVars {f_#in~x=|v_f_#in~x_1|} OutVars{f_~x=v_f_~x_1, f_#in~x=|v_f_#in~x_1|} AuxVars[] AssignedVars[f_~x] 200#L10 [60] L10-->L11: Formula: (> v_f_~x_3 0) InVars {f_~x=v_f_~x_3} OutVars{f_~x=v_f_~x_3} AuxVars[] AssignedVars[] 165#L11 [35] L11-->gENTRY: Formula: (= |v_g_#in~xInParam_1| v_f_~x_6) InVars {f_~x=v_f_~x_6} OutVars{g_#in~x=|v_g_#in~xInParam_1|} AuxVars[] AssignedVars[g_#in~x]< 168#gENTRY [45] gENTRY-->L16: Formula: (= v_g_~x_1 |v_g_#in~x_1|) InVars {g_#in~x=|v_g_#in~x_1|} OutVars{g_#in~x=|v_g_#in~x_1|, g_~x=v_g_~x_1} AuxVars[] AssignedVars[g_~x] 191#L16 [48] L16-->gFINAL: Formula: (and (= |v_g_#res_2| 0) (<= v_g_~x_2 0)) InVars {g_~x=v_g_~x_2} OutVars{g_#res=|v_g_#res_2|, g_~x=v_g_~x_2} AuxVars[] AssignedVars[g_#res] 176#gFINAL [39] gFINAL-->gEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 177#gEXIT >[56] gEXIT-->L11-1: AOR: Formula: (= |v_f_#t~ret0_4| |v_g_#resOutParam_1|) InVars {g_#res=|v_g_#resOutParam_1|} OutVars{f_#t~ret0=|v_f_#t~ret0_4|} AuxVars[] AssignedVars[f_#t~ret0] LVA: Formula: (= |v_g_#in~xInParam_1| v_f_~x_6) InVars {f_~x=v_f_~x_6} OutVars{g_#in~x=|v_g_#in~xInParam_1|} AuxVars[] AssignedVars[g_#in~x] 171#L11-1 [2020-06-22 05:31:27,719 INFO L796 eck$LassoCheckResult]: Loop: 171#L11-1 [38] L11-1-->gENTRY: Formula: (= |v_g_#in~xInParam_2| (+ v_f_~x_7 1)) InVars {f_~x=v_f_~x_7} OutVars{g_#in~x=|v_g_#in~xInParam_2|} AuxVars[] AssignedVars[g_#in~x]< 164#gENTRY [45] gENTRY-->L16: Formula: (= v_g_~x_1 |v_g_#in~x_1|) InVars {g_#in~x=|v_g_#in~x_1|} OutVars{g_#in~x=|v_g_#in~x_1|, g_~x=v_g_~x_1} AuxVars[] AssignedVars[g_~x] 201#L16 [59] L16-->L17: Formula: (> v_g_~x_3 0) InVars {g_~x=v_g_~x_3} OutVars{g_~x=v_g_~x_3} AuxVars[] AssignedVars[] 162#L17 [44] L17-->fENTRY: Formula: (= |v_f_#in~xInParam_1| (+ v_g_~x_6 (- 1))) InVars {g_~x=v_g_~x_6} OutVars{f_#in~x=|v_f_#in~xInParam_1|} AuxVars[] AssignedVars[f_#in~x]< 193#fENTRY [47] fENTRY-->L10: Formula: (= v_f_~x_1 |v_f_#in~x_1|) InVars {f_#in~x=|v_f_#in~x_1|} OutVars{f_~x=v_f_~x_1, f_#in~x=|v_f_#in~x_1|} AuxVars[] AssignedVars[f_~x] 196#L10 [60] L10-->L11: Formula: (> v_f_~x_3 0) InVars {f_~x=v_f_~x_3} OutVars{f_~x=v_f_~x_3} AuxVars[] AssignedVars[] 161#L11 [35] L11-->gENTRY: Formula: (= |v_g_#in~xInParam_1| v_f_~x_6) InVars {f_~x=v_f_~x_6} OutVars{g_#in~x=|v_g_#in~xInParam_1|} AuxVars[] AssignedVars[g_#in~x]< 164#gENTRY [45] gENTRY-->L16: Formula: (= v_g_~x_1 |v_g_#in~x_1|) InVars {g_#in~x=|v_g_#in~x_1|} OutVars{g_#in~x=|v_g_#in~x_1|, g_~x=v_g_~x_1} AuxVars[] AssignedVars[g_~x] 201#L16 [48] L16-->gFINAL: Formula: (and (= |v_g_#res_2| 0) (<= v_g_~x_2 0)) InVars {g_~x=v_g_~x_2} OutVars{g_#res=|v_g_#res_2|, g_~x=v_g_~x_2} AuxVars[] AssignedVars[g_#res] 195#gFINAL [39] gFINAL-->gEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 204#gEXIT >[56] gEXIT-->L11-1: AOR: Formula: (= |v_f_#t~ret0_4| |v_g_#resOutParam_1|) InVars {g_#res=|v_g_#resOutParam_1|} OutVars{f_#t~ret0=|v_f_#t~ret0_4|} AuxVars[] AssignedVars[f_#t~ret0] LVA: Formula: (= |v_g_#in~xInParam_1| v_f_~x_6) InVars {f_~x=v_f_~x_6} OutVars{g_#in~x=|v_g_#in~xInParam_1|} AuxVars[] AssignedVars[g_#in~x] 171#L11-1 [2020-06-22 05:31:27,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 05:31:27,719 INFO L82 PathProgramCache]: Analyzing trace with hash -118119787, now seen corresponding path program 1 times [2020-06-22 05:31:27,719 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 05:31:27,719 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 05:31:27,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:31:27,721 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 05:31:27,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:31:27,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:31:27,778 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-06-22 05:31:27,781 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 05:31:27,781 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-06-22 05:31:27,783 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-06-22 05:31:27,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 05:31:27,784 INFO L82 PathProgramCache]: Analyzing trace with hash 934307505, now seen corresponding path program 1 times [2020-06-22 05:31:27,784 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 05:31:27,784 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 05:31:27,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:31:27,785 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 05:31:27,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:31:27,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:31:27,815 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-06-22 05:31:27,815 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 05:31:27,816 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-06-22 05:31:27,816 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-06-22 05:31:27,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-06-22 05:31:27,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-06-22 05:31:27,820 INFO L87 Difference]: Start difference. First operand 44 states and 56 transitions. cyclomatic complexity: 14 Second operand 5 states. [2020-06-22 05:31:27,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 05:31:27,910 INFO L93 Difference]: Finished difference Result 48 states and 59 transitions. [2020-06-22 05:31:27,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-06-22 05:31:27,916 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 48 states and 59 transitions. [2020-06-22 05:31:27,919 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2020-06-22 05:31:27,921 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 48 states to 44 states and 55 transitions. [2020-06-22 05:31:27,921 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2020-06-22 05:31:27,922 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2020-06-22 05:31:27,922 INFO L73 IsDeterministic]: Start isDeterministic. Operand 44 states and 55 transitions. [2020-06-22 05:31:27,922 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 05:31:27,923 INFO L706 BuchiCegarLoop]: Abstraction has 44 states and 55 transitions. [2020-06-22 05:31:27,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states and 55 transitions. [2020-06-22 05:31:27,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2020-06-22 05:31:27,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2020-06-22 05:31:27,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 55 transitions. [2020-06-22 05:31:27,928 INFO L729 BuchiCegarLoop]: Abstraction has 44 states and 55 transitions. [2020-06-22 05:31:27,929 INFO L609 BuchiCegarLoop]: Abstraction has 44 states and 55 transitions. [2020-06-22 05:31:27,929 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2020-06-22 05:31:27,929 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 44 states and 55 transitions. [2020-06-22 05:31:27,930 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2020-06-22 05:31:27,930 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 05:31:27,930 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 05:31:27,932 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 05:31:27,932 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 05:31:27,933 INFO L794 eck$LassoCheckResult]: Stem: 290#ULTIMATE.startENTRY [43] ULTIMATE.startENTRY-->L23: Formula: (= v_ULTIMATE.start_main_~x~0_1 |v_ULTIMATE.start_main_#t~nondet4_4|) InVars {} OutVars{ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_1|, ULTIMATE.start_main_#t~ret5=|v_ULTIMATE.start_main_#t~ret5_1|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|} AuxVars[|v_ULTIMATE.start_main_#t~nondet4_4|] AssignedVars[ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~ret5, ULTIMATE.start_main_~x~0] 282#L23 [51] L23-->gENTRY: Formula: (= |v_g_#in~xInParam_3| v_ULTIMATE.start_main_~x~0_5) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5} OutVars{g_#in~x=|v_g_#in~xInParam_3|} AuxVars[] AssignedVars[g_#in~x]< 293#gENTRY [45] gENTRY-->L16: Formula: (= v_g_~x_1 |v_g_#in~x_1|) InVars {g_#in~x=|v_g_#in~x_1|} OutVars{g_#in~x=|v_g_#in~x_1|, g_~x=v_g_~x_1} AuxVars[] AssignedVars[g_~x] 294#L16 [59] L16-->L17: Formula: (> v_g_~x_3 0) InVars {g_~x=v_g_~x_3} OutVars{g_~x=v_g_~x_3} AuxVars[] AssignedVars[] 272#L17 [44] L17-->fENTRY: Formula: (= |v_f_#in~xInParam_1| (+ v_g_~x_6 (- 1))) InVars {g_~x=v_g_~x_6} OutVars{f_#in~x=|v_f_#in~xInParam_1|} AuxVars[] AssignedVars[f_#in~x]< 292#fENTRY [47] fENTRY-->L10: Formula: (= v_f_~x_1 |v_f_#in~x_1|) InVars {f_#in~x=|v_f_#in~x_1|} OutVars{f_~x=v_f_~x_1, f_#in~x=|v_f_#in~x_1|} AuxVars[] AssignedVars[f_~x] 309#L10 [60] L10-->L11: Formula: (> v_f_~x_3 0) InVars {f_~x=v_f_~x_3} OutVars{f_~x=v_f_~x_3} AuxVars[] AssignedVars[] 270#L11 [35] L11-->gENTRY: Formula: (= |v_g_#in~xInParam_1| v_f_~x_6) InVars {f_~x=v_f_~x_6} OutVars{g_#in~x=|v_g_#in~xInParam_1|} AuxVars[] AssignedVars[g_#in~x]< 275#gENTRY [45] gENTRY-->L16: Formula: (= v_g_~x_1 |v_g_#in~x_1|) InVars {g_#in~x=|v_g_#in~x_1|} OutVars{g_#in~x=|v_g_#in~x_1|, g_~x=v_g_~x_1} AuxVars[] AssignedVars[g_~x] 296#L16 [59] L16-->L17: Formula: (> v_g_~x_3 0) InVars {g_~x=v_g_~x_3} OutVars{g_~x=v_g_~x_3} AuxVars[] AssignedVars[] 277#L17 [44] L17-->fENTRY: Formula: (= |v_f_#in~xInParam_1| (+ v_g_~x_6 (- 1))) InVars {g_~x=v_g_~x_6} OutVars{f_#in~x=|v_f_#in~xInParam_1|} AuxVars[] AssignedVars[f_#in~x]< 291#fENTRY [47] fENTRY-->L10: Formula: (= v_f_~x_1 |v_f_#in~x_1|) InVars {f_#in~x=|v_f_#in~x_1|} OutVars{f_~x=v_f_~x_1, f_#in~x=|v_f_#in~x_1|} AuxVars[] AssignedVars[f_~x] 276#L10 [36] L10-->fFINAL: Formula: (and (<= v_f_~x_2 0) (= |v_f_#res_1| 0)) InVars {f_~x=v_f_~x_2} OutVars{f_#res=|v_f_#res_1|, f_~x=v_f_~x_2} AuxVars[] AssignedVars[f_#res] 278#fFINAL [41] fFINAL-->fEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 286#fEXIT >[54] fEXIT-->L17-1: AOR: Formula: (= |v_g_#t~ret2_4| |v_f_#resOutParam_1|) InVars {f_#res=|v_f_#resOutParam_1|} OutVars{g_#t~ret2=|v_g_#t~ret2_4|} AuxVars[] AssignedVars[g_#t~ret2] LVA: Formula: (= |v_f_#in~xInParam_1| (+ v_g_~x_6 (- 1))) InVars {g_~x=v_g_~x_6} OutVars{f_#in~x=|v_f_#in~xInParam_1|} AuxVars[] AssignedVars[f_#in~x] 289#L17-1 [50] L17-1-->fENTRY: Formula: (= |v_f_#in~xInParam_2| (+ v_g_~x_7 (- 2))) InVars {g_~x=v_g_~x_7} OutVars{f_#in~x=|v_f_#in~xInParam_2|} AuxVars[] AssignedVars[f_#in~x]< 298#fENTRY [47] fENTRY-->L10: Formula: (= v_f_~x_1 |v_f_#in~x_1|) InVars {f_#in~x=|v_f_#in~x_1|} OutVars{f_~x=v_f_~x_1, f_#in~x=|v_f_#in~x_1|} AuxVars[] AssignedVars[f_~x] 308#L10 [36] L10-->fFINAL: Formula: (and (<= v_f_~x_2 0) (= |v_f_#res_1| 0)) InVars {f_~x=v_f_~x_2} OutVars{f_#res=|v_f_#res_1|, f_~x=v_f_~x_2} AuxVars[] AssignedVars[f_#res] 307#fFINAL [41] fFINAL-->fEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 306#fEXIT >[58] fEXIT-->L17-2: AOR: Formula: (= |v_g_#t~ret3_4| |v_f_#resOutParam_2|) InVars {f_#res=|v_f_#resOutParam_2|} OutVars{g_#t~ret3=|v_g_#t~ret3_4|} AuxVars[] AssignedVars[g_#t~ret3] LVA: Formula: (= |v_f_#in~xInParam_2| (+ v_g_~x_7 (- 2))) InVars {g_~x=v_g_~x_7} OutVars{f_#in~x=|v_f_#in~xInParam_2|} AuxVars[] AssignedVars[f_#in~x] 299#L17-2 [52] L17-2-->gFINAL: Formula: (= |v_g_#res_1| (+ |v_g_#t~ret2_2| |v_g_#t~ret3_2|)) InVars {g_#t~ret2=|v_g_#t~ret2_2|, g_#t~ret3=|v_g_#t~ret3_2|} OutVars{g_#t~ret3=|v_g_#t~ret3_1|, g_#t~ret2=|v_g_#t~ret2_1|, g_#res=|v_g_#res_1|} AuxVars[] AssignedVars[g_#t~ret3, g_#t~ret2, g_#res] 281#gFINAL [39] gFINAL-->gEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 283#gEXIT >[56] gEXIT-->L11-1: AOR: Formula: (= |v_f_#t~ret0_4| |v_g_#resOutParam_1|) InVars {g_#res=|v_g_#resOutParam_1|} OutVars{f_#t~ret0=|v_f_#t~ret0_4|} AuxVars[] AssignedVars[f_#t~ret0] LVA: Formula: (= |v_g_#in~xInParam_1| v_f_~x_6) InVars {f_~x=v_f_~x_6} OutVars{g_#in~x=|v_g_#in~xInParam_1|} AuxVars[] AssignedVars[g_#in~x] 280#L11-1 [2020-06-22 05:31:27,934 INFO L796 eck$LassoCheckResult]: Loop: 280#L11-1 [38] L11-1-->gENTRY: Formula: (= |v_g_#in~xInParam_2| (+ v_f_~x_7 1)) InVars {f_~x=v_f_~x_7} OutVars{g_#in~x=|v_g_#in~xInParam_2|} AuxVars[] AssignedVars[g_#in~x]< 269#gENTRY [45] gENTRY-->L16: Formula: (= v_g_~x_1 |v_g_#in~x_1|) InVars {g_#in~x=|v_g_#in~x_1|} OutVars{g_#in~x=|v_g_#in~x_1|, g_~x=v_g_~x_1} AuxVars[] AssignedVars[g_~x] 305#L16 [59] L16-->L17: Formula: (> v_g_~x_3 0) InVars {g_~x=v_g_~x_3} OutVars{g_~x=v_g_~x_3} AuxVars[] AssignedVars[] 268#L17 [44] L17-->fENTRY: Formula: (= |v_f_#in~xInParam_1| (+ v_g_~x_6 (- 1))) InVars {g_~x=v_g_~x_6} OutVars{f_#in~x=|v_f_#in~xInParam_1|} AuxVars[] AssignedVars[f_#in~x]< 304#fENTRY [47] fENTRY-->L10: Formula: (= v_f_~x_1 |v_f_#in~x_1|) InVars {f_#in~x=|v_f_#in~x_1|} OutVars{f_~x=v_f_~x_1, f_#in~x=|v_f_#in~x_1|} AuxVars[] AssignedVars[f_~x] 300#L10 [60] L10-->L11: Formula: (> v_f_~x_3 0) InVars {f_~x=v_f_~x_3} OutVars{f_~x=v_f_~x_3} AuxVars[] AssignedVars[] 266#L11 [35] L11-->gENTRY: Formula: (= |v_g_#in~xInParam_1| v_f_~x_6) InVars {f_~x=v_f_~x_6} OutVars{g_#in~x=|v_g_#in~xInParam_1|} AuxVars[] AssignedVars[g_#in~x]< 269#gENTRY [45] gENTRY-->L16: Formula: (= v_g_~x_1 |v_g_#in~x_1|) InVars {g_#in~x=|v_g_#in~x_1|} OutVars{g_#in~x=|v_g_#in~x_1|, g_~x=v_g_~x_1} AuxVars[] AssignedVars[g_~x] 305#L16 [59] L16-->L17: Formula: (> v_g_~x_3 0) InVars {g_~x=v_g_~x_3} OutVars{g_~x=v_g_~x_3} AuxVars[] AssignedVars[] 268#L17 [44] L17-->fENTRY: Formula: (= |v_f_#in~xInParam_1| (+ v_g_~x_6 (- 1))) InVars {g_~x=v_g_~x_6} OutVars{f_#in~x=|v_f_#in~xInParam_1|} AuxVars[] AssignedVars[f_#in~x]< 304#fENTRY [47] fENTRY-->L10: Formula: (= v_f_~x_1 |v_f_#in~x_1|) InVars {f_#in~x=|v_f_#in~x_1|} OutVars{f_~x=v_f_~x_1, f_#in~x=|v_f_#in~x_1|} AuxVars[] AssignedVars[f_~x] 300#L10 [36] L10-->fFINAL: Formula: (and (<= v_f_~x_2 0) (= |v_f_#res_1| 0)) InVars {f_~x=v_f_~x_2} OutVars{f_#res=|v_f_#res_1|, f_~x=v_f_~x_2} AuxVars[] AssignedVars[f_#res] 301#fFINAL [41] fFINAL-->fEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 302#fEXIT >[54] fEXIT-->L17-1: AOR: Formula: (= |v_g_#t~ret2_4| |v_f_#resOutParam_1|) InVars {f_#res=|v_f_#resOutParam_1|} OutVars{g_#t~ret2=|v_g_#t~ret2_4|} AuxVars[] AssignedVars[g_#t~ret2] LVA: Formula: (= |v_f_#in~xInParam_1| (+ v_g_~x_6 (- 1))) InVars {g_~x=v_g_~x_6} OutVars{f_#in~x=|v_f_#in~xInParam_1|} AuxVars[] AssignedVars[f_#in~x] 267#L17-1 [50] L17-1-->fENTRY: Formula: (= |v_f_#in~xInParam_2| (+ v_g_~x_7 (- 2))) InVars {g_~x=v_g_~x_7} OutVars{f_#in~x=|v_f_#in~xInParam_2|} AuxVars[] AssignedVars[f_#in~x]< 304#fENTRY [47] fENTRY-->L10: Formula: (= v_f_~x_1 |v_f_#in~x_1|) InVars {f_#in~x=|v_f_#in~x_1|} OutVars{f_~x=v_f_~x_1, f_#in~x=|v_f_#in~x_1|} AuxVars[] AssignedVars[f_~x] 300#L10 [36] L10-->fFINAL: Formula: (and (<= v_f_~x_2 0) (= |v_f_#res_1| 0)) InVars {f_~x=v_f_~x_2} OutVars{f_#res=|v_f_#res_1|, f_~x=v_f_~x_2} AuxVars[] AssignedVars[f_#res] 301#fFINAL [41] fFINAL-->fEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 302#fEXIT >[58] fEXIT-->L17-2: AOR: Formula: (= |v_g_#t~ret3_4| |v_f_#resOutParam_2|) InVars {f_#res=|v_f_#resOutParam_2|} OutVars{g_#t~ret3=|v_g_#t~ret3_4|} AuxVars[] AssignedVars[g_#t~ret3] LVA: Formula: (= |v_f_#in~xInParam_2| (+ v_g_~x_7 (- 2))) InVars {g_~x=v_g_~x_7} OutVars{f_#in~x=|v_f_#in~xInParam_2|} AuxVars[] AssignedVars[f_#in~x] 299#L17-2 [52] L17-2-->gFINAL: Formula: (= |v_g_#res_1| (+ |v_g_#t~ret2_2| |v_g_#t~ret3_2|)) InVars {g_#t~ret2=|v_g_#t~ret2_2|, g_#t~ret3=|v_g_#t~ret3_2|} OutVars{g_#t~ret3=|v_g_#t~ret3_1|, g_#t~ret2=|v_g_#t~ret2_1|, g_#res=|v_g_#res_1|} AuxVars[] AssignedVars[g_#t~ret3, g_#t~ret2, g_#res] 281#gFINAL [39] gFINAL-->gEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 283#gEXIT >[56] gEXIT-->L11-1: AOR: Formula: (= |v_f_#t~ret0_4| |v_g_#resOutParam_1|) InVars {g_#res=|v_g_#resOutParam_1|} OutVars{f_#t~ret0=|v_f_#t~ret0_4|} AuxVars[] AssignedVars[f_#t~ret0] LVA: Formula: (= |v_g_#in~xInParam_1| v_f_~x_6) InVars {f_~x=v_f_~x_6} OutVars{g_#in~x=|v_g_#in~xInParam_1|} AuxVars[] AssignedVars[g_#in~x] 280#L11-1 [2020-06-22 05:31:27,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 05:31:27,934 INFO L82 PathProgramCache]: Analyzing trace with hash -550172724, now seen corresponding path program 1 times [2020-06-22 05:31:27,935 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 05:31:27,935 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 05:31:27,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:31:27,936 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 05:31:27,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:31:27,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:31:27,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:31:27,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 05:31:27,956 INFO L82 PathProgramCache]: Analyzing trace with hash -498738640, now seen corresponding path program 1 times [2020-06-22 05:31:27,956 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 05:31:27,956 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 05:31:27,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:31:27,957 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 05:31:27,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:31:27,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:31:27,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:31:27,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 05:31:27,978 INFO L82 PathProgramCache]: Analyzing trace with hash 1816143803, now seen corresponding path program 1 times [2020-06-22 05:31:27,978 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 05:31:27,978 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 05:31:27,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:31:27,979 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 05:31:27,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:31:27,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:31:28,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:31:28,625 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 05:31:28 BasicIcfg [2020-06-22 05:31:28,625 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-06-22 05:31:28,625 INFO L168 Benchmark]: Toolchain (without parser) took 2952.75 ms. Allocated memory was 649.6 MB in the beginning and 762.3 MB in the end (delta: 112.7 MB). Free memory was 565.0 MB in the beginning and 687.5 MB in the end (delta: -122.5 MB). Peak memory consumption was 225.2 MB. Max. memory is 50.3 GB. [2020-06-22 05:31:28,627 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 649.6 MB. Free memory is still 585.8 MB. There was no memory consumed. Max. memory is 50.3 GB. [2020-06-22 05:31:28,628 INFO L168 Benchmark]: CACSL2BoogieTranslator took 282.99 ms. Allocated memory was 649.6 MB in the beginning and 700.4 MB in the end (delta: 50.9 MB). Free memory was 565.0 MB in the beginning and 668.1 MB in the end (delta: -103.2 MB). Peak memory consumption was 30.7 MB. Max. memory is 50.3 GB. [2020-06-22 05:31:28,628 INFO L168 Benchmark]: Boogie Procedure Inliner took 33.53 ms. Allocated memory is still 700.4 MB. Free memory was 668.1 MB in the beginning and 667.1 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:31:28,629 INFO L168 Benchmark]: Boogie Preprocessor took 16.27 ms. Allocated memory is still 700.4 MB. Free memory was 667.1 MB in the beginning and 665.9 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:31:28,630 INFO L168 Benchmark]: RCFGBuilder took 203.15 ms. Allocated memory is still 700.4 MB. Free memory was 665.9 MB in the beginning and 649.4 MB in the end (delta: 16.6 MB). Peak memory consumption was 16.6 MB. Max. memory is 50.3 GB. [2020-06-22 05:31:28,630 INFO L168 Benchmark]: BlockEncodingV2 took 70.89 ms. Allocated memory is still 700.4 MB. Free memory was 649.4 MB in the beginning and 645.0 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:31:28,631 INFO L168 Benchmark]: TraceAbstraction took 172.02 ms. Allocated memory is still 700.4 MB. Free memory was 644.0 MB in the beginning and 631.9 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 50.3 GB. [2020-06-22 05:31:28,631 INFO L168 Benchmark]: BuchiAutomizer took 2168.38 ms. Allocated memory was 700.4 MB in the beginning and 762.3 MB in the end (delta: 61.9 MB). Free memory was 631.9 MB in the beginning and 687.5 MB in the end (delta: -55.6 MB). Peak memory consumption was 241.3 MB. Max. memory is 50.3 GB. [2020-06-22 05:31:28,635 INFO L337 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 20 locations, 24 edges - StatisticsResult: Encoded RCFG 16 locations, 20 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 585.8 MB. There was no memory consumed. Max. memory is 50.3 GB. * CACSL2BoogieTranslator took 282.99 ms. Allocated memory was 649.6 MB in the beginning and 700.4 MB in the end (delta: 50.9 MB). Free memory was 565.0 MB in the beginning and 668.1 MB in the end (delta: -103.2 MB). Peak memory consumption was 30.7 MB. Max. memory is 50.3 GB. * Boogie Procedure Inliner took 33.53 ms. Allocated memory is still 700.4 MB. Free memory was 668.1 MB in the beginning and 667.1 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.27 ms. Allocated memory is still 700.4 MB. Free memory was 667.1 MB in the beginning and 665.9 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 50.3 GB. * RCFGBuilder took 203.15 ms. Allocated memory is still 700.4 MB. Free memory was 665.9 MB in the beginning and 649.4 MB in the end (delta: 16.6 MB). Peak memory consumption was 16.6 MB. Max. memory is 50.3 GB. * BlockEncodingV2 took 70.89 ms. Allocated memory is still 700.4 MB. Free memory was 649.4 MB in the beginning and 645.0 MB in the end (delta: 4.3 MB). Peak memory consumption was 4.3 MB. Max. memory is 50.3 GB. * TraceAbstraction took 172.02 ms. Allocated memory is still 700.4 MB. Free memory was 644.0 MB in the beginning and 631.9 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 50.3 GB. * BuchiAutomizer took 2168.38 ms. Allocated memory was 700.4 MB in the beginning and 762.3 MB in the end (delta: 61.9 MB). Free memory was 631.9 MB in the beginning and 687.5 MB in the end (delta: -55.6 MB). Peak memory consumption was 241.3 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, 16 locations, 0 error locations. SAFE Result, 0.1s OverallTime, 0 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=16occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 16 PreInvPairs, 16 NumberOfFragments, 7 HoareAnnotationTreeSize, 16 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - StatisticsResult: Constructed decomposition of program Your program was decomposed into 2 terminating modules (1 trivial, 0 deterministic, 1 nondeterministic) and one nonterminating remainder module.One nondeterministic module has affine ranking function \old(x) and consists of 8 locations. 1 modules have a trivial ranking function, the largest among these consists of 5 locations. The remainder module has 44 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.1s and 3 iterations. TraceHistogramMax:3. Analysis of lassos took 1.5s. Construction of modules took 0.1s. Büchi inclusion checks took 0.3s. Highest rank in rank-based complementation 3. Minimization of det autom 0. Minimization of nondet autom 2. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 3 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 44 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 42 SDtfs, 41 SDslu, 50 SDs, 0 SdLazy, 87 SolverSat, 9 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT1 conc0 concLT0 SILN0 SILU0 SILI1 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital10 mio100 ax100 hnf100 lsp100 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq160 hnf93 smp100 dnf100 smp100 tf113 neg100 sie111 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 10ms VariablesStem: 0 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 4 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 1 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.1s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 11]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {} State at position 1 is {org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@86f2097=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@53c3512=0, \result=0, \result=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6c0acf6d=0, x=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6c44166b=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@774fa43e=0, \old(x)=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@50b5b622=0, NULL=0, x=1, \result=0, \old(x)=0, x=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 11]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L22] int x = __VERIFIER_nondet_int(); [L23] CALL g(x) [L16] COND FALSE !(x <= 0) [L17] CALL, EXPR f(x - 1) [L10] COND FALSE !(x <= 0) [L11] CALL g(x) [L16] COND FALSE !(x <= 0) [L17] CALL, EXPR f(x - 1) [L10] COND TRUE x <= 0 [L10] return 0; [L17] RET, EXPR f(x - 1) [L17] CALL, EXPR f(x - 2) [L10] COND TRUE x <= 0 [L10] return 0; [L17] RET, EXPR f(x - 2) [L17] return f(x - 1) + f(x - 2); [L11] RET g(x) Loop: [L11] CALL g(x + 1) [L16] COND FALSE !(x <= 0) [L17] CALL, EXPR f(x - 1) [L10] COND FALSE !(x <= 0) [L11] CALL g(x) [L16] COND FALSE !(x <= 0) [L17] CALL, EXPR f(x - 1) [L10] COND TRUE x <= 0 [L10] return 0; [L17] RET, EXPR f(x - 1) [L17] CALL, EXPR f(x - 2) [L10] COND TRUE x <= 0 [L10] return 0; [L17] RET, EXPR f(x - 2) [L17] return f(x - 1) + f(x - 2); [L11] RET g(x) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! !SESSION 2020-06-22 05:31:22.468 ----------------------------------------------- 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/sandbox2/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/sandbox2/tmp -i /export/starexec/sandbox2/benchmark/theBenchmark.c !ENTRY org.eclipse.core.resources 2 10035 2020-06-22 05:31:28.873 !MESSAGE The workspace will exit with unsaved changes in this session. Received shutdown request... Ultimate: GTK+ Version Check