YES Ultimate: Cannot open display: This is Ultimate 0.1.24-8dc7c08-m [2020-06-22 05:59:25,220 INFO L170 SettingsManager]: Resetting all preferences to default values... [2020-06-22 05:59:25,223 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2020-06-22 05:59:25,234 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-06-22 05:59:25,234 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-06-22 05:59:25,235 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-06-22 05:59:25,236 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-06-22 05:59:25,238 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2020-06-22 05:59:25,240 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-06-22 05:59:25,241 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-06-22 05:59:25,242 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-06-22 05:59:25,242 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-06-22 05:59:25,243 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-06-22 05:59:25,246 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-06-22 05:59:25,247 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-06-22 05:59:25,247 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-06-22 05:59:25,248 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-06-22 05:59:25,250 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-06-22 05:59:25,252 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2020-06-22 05:59:25,254 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-06-22 05:59:25,255 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-06-22 05:59:25,256 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-06-22 05:59:25,258 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-06-22 05:59:25,258 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-06-22 05:59:25,259 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-06-22 05:59:25,259 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-06-22 05:59:25,260 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-06-22 05:59:25,261 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-06-22 05:59:25,261 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-06-22 05:59:25,262 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-06-22 05:59:25,263 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-06-22 05:59:25,263 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2020-06-22 05:59:25,265 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-06-22 05:59:25,265 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2020-06-22 05:59:25,265 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-06-22 05:59:25,266 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-06-22 05:59:25,266 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2020-06-22 05:59:25,267 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2020-06-22 05:59:25,267 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2020-06-22 05:59:25,268 INFO L98 SettingsManager]: Beginning loading settings from /export/starexec/sandbox/solver/bin/./../termcomp2017.epf [2020-06-22 05:59:25,284 INFO L110 SettingsManager]: Loading preferences was successful [2020-06-22 05:59:25,284 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2020-06-22 05:59:25,285 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-06-22 05:59:25,285 INFO L133 SettingsManager]: * Rewrite not-equals=true [2020-06-22 05:59:25,285 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2020-06-22 05:59:25,286 INFO L133 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE [2020-06-22 05:59:25,286 INFO L133 SettingsManager]: * Use SBE=true [2020-06-22 05:59:25,286 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-06-22 05:59:25,286 INFO L133 SettingsManager]: * Use old map elimination=false [2020-06-22 05:59:25,286 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2020-06-22 05:59:25,287 INFO L133 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION [2020-06-22 05:59:25,287 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2020-06-22 05:59:25,287 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-06-22 05:59:25,287 INFO L133 SettingsManager]: * Construct termination proof for TermComp=true [2020-06-22 05:59:25,287 INFO L133 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 05:59:25,287 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-06-22 05:59:25,288 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-06-22 05:59:25,288 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2020-06-22 05:59:25,288 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2020-06-22 05:59:25,288 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-06-22 05:59:25,288 INFO L133 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE [2020-06-22 05:59:25,289 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-06-22 05:59:25,289 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-06-22 05:59:25,289 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-06-22 05:59:25,289 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-06-22 05:59:25,289 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-06-22 05:59:25,290 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-06-22 05:59:25,290 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2020-06-22 05:59:25,290 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-06-22 05:59:25,315 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-06-22 05:59:25,329 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-06-22 05:59:25,332 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-06-22 05:59:25,333 INFO L271 PluginConnector]: Initializing CDTParser... [2020-06-22 05:59:25,334 INFO L276 PluginConnector]: CDTParser initialized [2020-06-22 05:59:25,334 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox/benchmark/theBenchmark.c [2020-06-22 05:59:25,401 INFO L221 CDTParser]: Created temporary CDT project at /export/starexec/sandbox/tmp/ba7ece9c431c4cfd8e90824fddd5a70b/FLAGd9b8ad544 !SESSION 2020-06-22 05:59:22.888 ----------------------------------------------- eclipse.buildId=unknown java.version=1.8.0_242 java.vendor=Oracle Corporation BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox/benchmark/theBenchmark.c Command-line arguments: -os linux -ws gtk -arch x86_64 -consoleLog -data @user.home/.ultimate -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -data /export/starexec/sandbox/tmp -i /export/starexec/sandbox/benchmark/theBenchmark.c !ENTRY org.eclipse.cdt.core 1 0 2020-06-22 05:59:25.663 !MESSAGE Indexed 'FLAGd9b8ad544' (0 sources, 0 headers) in 0.006 sec: 0 declarations; 0 references; 0 unresolved inclusions; 0 syntax errors; 0 unresolved names (0%) [2020-06-22 05:59:25,748 INFO L307 CDTParser]: Found 1 translation units. [2020-06-22 05:59:25,749 INFO L161 CDTParser]: Scanning /export/starexec/sandbox/benchmark/theBenchmark.c [2020-06-22 05:59:25,756 INFO L355 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox/tmp/ba7ece9c431c4cfd8e90824fddd5a70b/FLAGd9b8ad544 [2020-06-22 05:59:26,198 INFO L363 CDTParser]: Successfully deleted /export/starexec/sandbox/tmp/ba7ece9c431c4cfd8e90824fddd5a70b [2020-06-22 05:59:26,211 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-06-22 05:59:26,212 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. [2020-06-22 05:59:26,213 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-06-22 05:59:26,214 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-06-22 05:59:26,217 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2020-06-22 05:59:26,218 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.06 05:59:26" (1/1) ... [2020-06-22 05:59:26,221 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5671eedd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 05:59:26, skipping insertion in model container [2020-06-22 05:59:26,221 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.06 05:59:26" (1/1) ... [2020-06-22 05:59:26,229 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-06-22 05:59:26,247 INFO L176 MainTranslator]: Built tables and reachable declarations [2020-06-22 05:59:26,404 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-06-22 05:59:26,409 INFO L191 MainTranslator]: Completed pre-run [2020-06-22 05:59:26,479 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-06-22 05:59:26,493 INFO L195 MainTranslator]: Completed translation [2020-06-22 05:59:26,494 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 05:59:26 WrapperNode [2020-06-22 05:59:26,494 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-06-22 05:59:26,495 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-06-22 05:59:26,495 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-06-22 05:59:26,495 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2020-06-22 05:59:26,504 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:59:26" (1/1) ... [2020-06-22 05:59:26,510 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:59:26" (1/1) ... [2020-06-22 05:59:26,530 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-06-22 05:59:26,530 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-06-22 05:59:26,530 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-06-22 05:59:26,530 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2020-06-22 05:59:26,539 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 05:59:26" (1/1) ... [2020-06-22 05:59:26,540 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 05:59:26" (1/1) ... [2020-06-22 05:59:26,540 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 05:59:26" (1/1) ... [2020-06-22 05:59:26,541 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 05:59:26" (1/1) ... [2020-06-22 05:59:26,543 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 05:59:26" (1/1) ... [2020-06-22 05:59:26,545 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 05:59:26" (1/1) ... [2020-06-22 05:59:26,546 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 05:59:26" (1/1) ... [2020-06-22 05:59:26,547 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-06-22 05:59:26,547 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-06-22 05:59:26,547 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-06-22 05:59:26,548 INFO L276 PluginConnector]: RCFGBuilder initialized [2020-06-22 05:59:26,548 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 05:59:26" (1/1) ... No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-06-22 05:59:26,615 INFO L130 BoogieDeclarations]: Found specification of procedure average [2020-06-22 05:59:26,615 INFO L138 BoogieDeclarations]: Found implementation of procedure average [2020-06-22 05:59:26,615 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-06-22 05:59:26,615 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-06-22 05:59:26,764 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-06-22 05:59:26,764 INFO L286 CfgBuilder]: Removed 8 assue(true) statements. [2020-06-22 05:59:26,766 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 05:59:26 BoogieIcfgContainer [2020-06-22 05:59:26,766 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-06-22 05:59:26,766 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- [2020-06-22 05:59:26,766 INFO L271 PluginConnector]: Initializing BlockEncodingV2... [2020-06-22 05:59:26,769 INFO L276 PluginConnector]: BlockEncodingV2 initialized [2020-06-22 05:59:26,769 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 05:59:26" (1/1) ... [2020-06-22 05:59:26,789 INFO L313 BlockEncoder]: Initial Icfg 19 locations, 24 edges [2020-06-22 05:59:26,791 INFO L258 BlockEncoder]: Using Remove infeasible edges [2020-06-22 05:59:26,792 INFO L263 BlockEncoder]: Using Maximize final states [2020-06-22 05:59:26,792 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false [2020-06-22 05:59:26,792 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE [2020-06-22 05:59:26,798 INFO L296 BlockEncoder]: Using Remove sink states [2020-06-22 05:59:26,799 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true [2020-06-22 05:59:26,799 INFO L179 BlockEncoder]: Using Rewrite not-equals [2020-06-22 05:59:26,815 INFO L185 BlockEncoder]: Using Use SBE [2020-06-22 05:59:26,823 INFO L200 BlockEncoder]: SBE split 0 edges [2020-06-22 05:59:26,828 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-06-22 05:59:26,830 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-06-22 05:59:26,839 INFO L100 BaseMinimizeStates]: Removed 4 edges and 2 locations by large block encoding [2020-06-22 05:59:26,841 INFO L70 RemoveSinkStates]: Removed 2 edges and 2 locations by removing sink states [2020-06-22 05:59:26,843 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-06-22 05:59:26,843 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-06-22 05:59:26,844 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding [2020-06-22 05:59:26,844 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states [2020-06-22 05:59:26,845 INFO L313 BlockEncoder]: Encoded RCFG 15 locations, 20 edges [2020-06-22 05:59:26,845 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 05:59:26 BasicIcfg [2020-06-22 05:59:26,845 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- [2020-06-22 05:59:26,846 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-06-22 05:59:26,847 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-06-22 05:59:26,850 INFO L276 PluginConnector]: TraceAbstraction initialized [2020-06-22 05:59:26,850 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.06 05:59:26" (1/4) ... [2020-06-22 05:59:26,851 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7020cfbe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 05:59:26, skipping insertion in model container [2020-06-22 05:59:26,851 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 05:59:26" (2/4) ... [2020-06-22 05:59:26,851 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7020cfbe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 05:59:26, skipping insertion in model container [2020-06-22 05:59:26,852 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 05:59:26" (3/4) ... [2020-06-22 05:59:26,852 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7020cfbe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 05:59:26, skipping insertion in model container [2020-06-22 05:59:26,852 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 05:59:26" (4/4) ... [2020-06-22 05:59:26,854 INFO L112 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-06-22 05:59:26,864 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2020-06-22 05:59:26,873 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 0 error locations. [2020-06-22 05:59:26,890 INFO L257 AbstractCegarLoop]: Starting to check reachability of 0 error locations. [2020-06-22 05:59:26,919 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2020-06-22 05:59:26,920 INFO L382 AbstractCegarLoop]: Interprodecural is true [2020-06-22 05:59:26,920 INFO L383 AbstractCegarLoop]: Hoare is true [2020-06-22 05:59:26,920 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2020-06-22 05:59:26,921 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-06-22 05:59:26,921 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-06-22 05:59:26,921 INFO L387 AbstractCegarLoop]: Difference is false [2020-06-22 05:59:26,921 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-06-22 05:59:26,921 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-06-22 05:59:26,940 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states. [2020-06-22 05:59:26,945 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-06-22 05:59:26,952 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 15 states. [2020-06-22 05:59:27,014 INFO L448 ceAbstractionStarter]: For program point averageFINAL(lines 42 50) no Hoare annotation was computed. [2020-06-22 05:59:27,015 INFO L451 ceAbstractionStarter]: At program point L46(line 46) the Hoare annotation is: true [2020-06-22 05:59:27,015 INFO L448 ceAbstractionStarter]: For program point L45(lines 45 49) no Hoare annotation was computed. [2020-06-22 05:59:27,015 INFO L448 ceAbstractionStarter]: For program point L46-1(line 46) no Hoare annotation was computed. [2020-06-22 05:59:27,015 INFO L451 ceAbstractionStarter]: At program point L44(line 44) the Hoare annotation is: true [2020-06-22 05:59:27,016 INFO L448 ceAbstractionStarter]: For program point L43(lines 43 49) no Hoare annotation was computed. [2020-06-22 05:59:27,016 INFO L448 ceAbstractionStarter]: For program point L44-1(line 44) no Hoare annotation was computed. [2020-06-22 05:59:27,016 INFO L451 ceAbstractionStarter]: At program point averageENTRY(lines 42 50) the Hoare annotation is: true [2020-06-22 05:59:27,016 INFO L448 ceAbstractionStarter]: For program point averageEXIT(lines 42 50) no Hoare annotation was computed. [2020-06-22 05:59:27,016 INFO L448 ceAbstractionStarter]: For program point L34-1(lines 34 37) no Hoare annotation was computed. [2020-06-22 05:59:27,016 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-06-22 05:59:27,017 INFO L451 ceAbstractionStarter]: At program point L28(line 28) the Hoare annotation is: true [2020-06-22 05:59:27,017 INFO L451 ceAbstractionStarter]: At program point L37(lines 32 38) the Hoare annotation is: true [2020-06-22 05:59:27,017 INFO L451 ceAbstractionStarter]: At program point L37-1(lines 32 38) the Hoare annotation is: true [2020-06-22 05:59:27,017 INFO L448 ceAbstractionStarter]: For program point L34(lines 34 37) no Hoare annotation was computed. [2020-06-22 05:59:27,026 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 05:59:27 BasicIcfg [2020-06-22 05:59:27,026 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-06-22 05:59:27,027 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-06-22 05:59:27,027 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-06-22 05:59:27,030 INFO L276 PluginConnector]: BuchiAutomizer initialized [2020-06-22 05:59:27,031 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 05:59:27,031 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.06 05:59:26" (1/5) ... [2020-06-22 05:59:27,032 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@64ea3ee8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.06 05:59:27, skipping insertion in model container [2020-06-22 05:59:27,032 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 05:59:27,032 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 05:59:26" (2/5) ... [2020-06-22 05:59:27,032 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@64ea3ee8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.06 05:59:27, skipping insertion in model container [2020-06-22 05:59:27,032 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 05:59:27,032 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 05:59:26" (3/5) ... [2020-06-22 05:59:27,033 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@64ea3ee8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 05:59:27, skipping insertion in model container [2020-06-22 05:59:27,033 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 05:59:27,033 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 05:59:26" (4/5) ... [2020-06-22 05:59:27,033 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@64ea3ee8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 05:59:27, skipping insertion in model container [2020-06-22 05:59:27,034 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 05:59:27,034 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 05:59:27" (5/5) ... [2020-06-22 05:59:27,035 INFO L375 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-06-22 05:59:27,062 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2020-06-22 05:59:27,062 INFO L374 BuchiCegarLoop]: Interprodecural is true [2020-06-22 05:59:27,062 INFO L375 BuchiCegarLoop]: Hoare is true [2020-06-22 05:59:27,063 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-06-22 05:59:27,063 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-06-22 05:59:27,063 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-06-22 05:59:27,063 INFO L379 BuchiCegarLoop]: Difference is false [2020-06-22 05:59:27,063 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-06-22 05:59:27,063 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-06-22 05:59:27,067 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2020-06-22 05:59:27,088 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-06-22 05:59:27,089 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 05:59:27,089 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 05:59:27,096 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2020-06-22 05:59:27,096 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-06-22 05:59:27,096 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2020-06-22 05:59:27,096 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2020-06-22 05:59:27,098 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-06-22 05:59:27,098 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 05:59:27,099 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 05:59:27,099 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2020-06-22 05:59:27,099 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-06-22 05:59:27,105 INFO L794 eck$LassoCheckResult]: Stem: 8#ULTIMATE.startENTRYtrue [49] ULTIMATE.startENTRY-->L34: Formula: (and (= v_ULTIMATE.start_main_~y~0_1 |v_ULTIMATE.start_main_#t~nondet1_4|) (= v_ULTIMATE.start_main_~x~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|) (= v_ULTIMATE.start_main_~z~0_1 |v_ULTIMATE.start_main_#t~nondet2_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_1|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_1|, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_1, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1, ULTIMATE.start_random_#res=|v_ULTIMATE.start_random_#res_8|, ULTIMATE.start_random_#t~nondet6=|v_ULTIMATE.start_random_#t~nondet6_3|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_2|, ULTIMATE.start_random_~x~1=v_ULTIMATE.start_random_~x~1_7, ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_1, ULTIMATE.start_main_#t~ret5=|v_ULTIMATE.start_main_#t~ret5_2|, ULTIMATE.start_main_#t~ret3=|v_ULTIMATE.start_main_#t~ret3_3|, ULTIMATE.start_main_#t~ret4=|v_ULTIMATE.start_main_#t~ret4_3|} AuxVars[|v_ULTIMATE.start_main_#t~nondet2_4|, |v_ULTIMATE.start_main_#t~nondet1_4|, |v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_~z~0, ULTIMATE.start_main_~x~0, ULTIMATE.start_random_#res, ULTIMATE.start_random_#t~nondet6, ULTIMATE.start_main_#res, ULTIMATE.start_random_~x~1, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_#t~ret5, ULTIMATE.start_main_#t~ret3, ULTIMATE.start_main_#t~ret4] 12#L34true [52] L34-->L37: Formula: (and (= |v_ULTIMATE.start_random_#res_1| (- v_ULTIMATE.start_random_~x~1_1)) (< v_ULTIMATE.start_random_~x~1_1 0)) InVars {ULTIMATE.start_random_~x~1=v_ULTIMATE.start_random_~x~1_1} OutVars{ULTIMATE.start_random_~x~1=v_ULTIMATE.start_random_~x~1_1, ULTIMATE.start_random_#res=|v_ULTIMATE.start_random_#res_1|} AuxVars[] AssignedVars[ULTIMATE.start_random_#res] 4#L37true [42] L37-->L34-1: Formula: (= |v_ULTIMATE.start_main_#t~ret3_1| |v_ULTIMATE.start_random_#res_4|) InVars {ULTIMATE.start_random_#res=|v_ULTIMATE.start_random_#res_4|} OutVars{ULTIMATE.start_random_#t~nondet6=|v_ULTIMATE.start_random_#t~nondet6_1|, ULTIMATE.start_main_#t~ret3=|v_ULTIMATE.start_main_#t~ret3_1|, ULTIMATE.start_random_~x~1=v_ULTIMATE.start_random_~x~1_3, ULTIMATE.start_random_#res=|v_ULTIMATE.start_random_#res_3|} AuxVars[] AssignedVars[ULTIMATE.start_random_#t~nondet6, ULTIMATE.start_random_~x~1, ULTIMATE.start_main_#t~ret3, ULTIMATE.start_random_#res] 10#L34-1true [66] L34-1-->L37-1: Formula: (and (>= v_ULTIMATE.start_random_~x~1_6 0) (= |v_ULTIMATE.start_random_#res_6| v_ULTIMATE.start_random_~x~1_6)) InVars {ULTIMATE.start_random_~x~1=v_ULTIMATE.start_random_~x~1_6} OutVars{ULTIMATE.start_random_~x~1=v_ULTIMATE.start_random_~x~1_6, ULTIMATE.start_random_#res=|v_ULTIMATE.start_random_#res_6|} AuxVars[] AssignedVars[ULTIMATE.start_random_#res] 17#L37-1true [61] L37-1-->L28: Formula: (= |v_ULTIMATE.start_main_#t~ret4_1| |v_ULTIMATE.start_random_#res_7|) InVars {ULTIMATE.start_random_#res=|v_ULTIMATE.start_random_#res_7|} OutVars{ULTIMATE.start_main_#t~ret4=|v_ULTIMATE.start_main_#t~ret4_1|, ULTIMATE.start_random_#res=|v_ULTIMATE.start_random_#res_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret4] 7#L28true [47] L28-->averageENTRY: Formula: (and (= |v_average_#in~xInParam_3| |v_ULTIMATE.start_main_#t~ret3_5|) (= |v_average_#in~yInParam_3| |v_ULTIMATE.start_main_#t~ret4_5|)) InVars {ULTIMATE.start_main_#t~ret3=|v_ULTIMATE.start_main_#t~ret3_5|, ULTIMATE.start_main_#t~ret4=|v_ULTIMATE.start_main_#t~ret4_5|} OutVars{average_#in~x=|v_average_#in~xInParam_3|, average_#in~y=|v_average_#in~yInParam_3|} AuxVars[] AssignedVars[average_#in~x, average_#in~y]< 9#averageENTRYtrue [2020-06-22 05:59:27,105 INFO L796 eck$LassoCheckResult]: Loop: 9#averageENTRYtrue [48] averageENTRY-->L43: Formula: (and (= v_average_~x_1 |v_average_#in~x_1|) (= v_average_~y_1 |v_average_#in~y_1|)) InVars {average_#in~y=|v_average_#in~y_1|, average_#in~x=|v_average_#in~x_1|} OutVars{average_~x=v_average_~x_1, average_~y=v_average_~y_1, average_#in~y=|v_average_#in~y_1|, average_#in~x=|v_average_#in~x_1|} AuxVars[] AssignedVars[average_~x, average_~y] 5#L43true [43] L43-->L44: Formula: (< 0 v_average_~x_2) InVars {average_~x=v_average_~x_2} OutVars{average_~x=v_average_~x_2} AuxVars[] AssignedVars[] 3#L44true [41] L44-->averageENTRY: Formula: (and (= |v_average_#in~yInParam_1| (+ v_average_~y_6 1)) (= |v_average_#in~xInParam_1| (+ v_average_~x_6 (- 1)))) InVars {average_~x=v_average_~x_6, average_~y=v_average_~y_6} OutVars{average_#in~x=|v_average_#in~xInParam_1|, average_#in~y=|v_average_#in~yInParam_1|} AuxVars[] AssignedVars[average_#in~x, average_#in~y]< 9#averageENTRYtrue [2020-06-22 05:59:27,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 05:59:27,112 INFO L82 PathProgramCache]: Analyzing trace with hash -1955295538, now seen corresponding path program 1 times [2020-06-22 05:59:27,114 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 05:59:27,114 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 05:59:27,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:59:27,134 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 05:59:27,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:59:27,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:59:27,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:59:27,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 05:59:27,196 INFO L82 PathProgramCache]: Analyzing trace with hash 77293, now seen corresponding path program 1 times [2020-06-22 05:59:27,196 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 05:59:27,196 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 05:59:27,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:59:27,197 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 05:59:27,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:59:27,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:59:27,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:59:27,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 05:59:27,207 INFO L82 PathProgramCache]: Analyzing trace with hash -1862856704, now seen corresponding path program 1 times [2020-06-22 05:59:27,207 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 05:59:27,207 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 05:59:27,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:59:27,208 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 05:59:27,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:59:27,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:59:27,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:59:27,310 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 05:59:27,311 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 05:59:27,311 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 05:59:27,311 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 05:59:27,311 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2020-06-22 05:59:27,312 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 05:59:27,312 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 05:59:27,312 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 05:59:27,312 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Loop [2020-06-22 05:59:27,312 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 05:59:27,312 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 05:59:27,331 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:59:27,338 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:59:27,340 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:59:27,343 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:59:27,353 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:59:27,366 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:59:27,374 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:59:27,448 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 05:59:27,449 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 05:59:27,454 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 05:59:27,455 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 05:59:27,463 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 05:59:27,464 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {average_#t~ret7=0} Honda state: {average_#t~ret7=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 05:59:27,497 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 05:59:27,498 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 05:59:27,501 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 05:59:27,501 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {average_#res=0} Honda state: {average_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 05:59:27,531 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 05:59:27,532 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 05:59:27,535 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 05:59:27,536 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {average_#t~ret8=0} Honda state: {average_#t~ret8=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 05:59:27,563 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 05:59:27,563 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 05:59:27,592 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-06-22 05:59:27,593 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 05:59:27,622 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-06-22 05:59:27,625 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 05:59:27,625 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 05:59:27,625 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 05:59:27,625 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 05:59:27,625 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 05:59:27,625 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 05:59:27,626 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 05:59:27,626 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 05:59:27,626 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Loop [2020-06-22 05:59:27,626 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 05:59:27,626 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 05:59:27,627 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:59:27,630 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:59:27,633 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:59:27,635 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:59:27,638 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 05:59:27,646 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 05:59:27,651 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:59:27,705 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 05:59:27,711 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 05:59:27,713 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:59:27,714 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 05:59:27,714 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 05:59:27,715 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 05:59:27,715 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 05:59:27,715 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 05:59:27,719 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 05:59:27,719 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 05:59:27,723 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 05:59:27,723 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:59:27,724 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 05:59:27,724 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 05:59:27,724 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 05:59:27,724 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 05:59:27,724 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 05:59:27,725 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 05:59:27,725 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 05:59:27,726 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 05:59:27,727 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:59:27,727 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 05:59:27,727 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 05:59:27,727 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 05:59:27,728 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 05:59:27,728 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 05:59:27,728 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 05:59:27,728 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 05:59:27,730 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 05:59:27,730 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:59:27,730 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 05:59:27,731 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 05:59:27,731 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 05:59:27,731 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 05:59:27,731 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 05:59:27,732 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 05:59:27,732 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 05:59:27,733 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 05:59:27,733 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:59:27,734 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 05:59:27,734 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 05:59:27,734 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 05:59:27,734 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 05:59:27,735 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 05:59:27,735 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 05:59:27,735 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 05:59:27,742 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 05:59:27,745 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-06-22 05:59:27,745 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2020-06-22 05:59:27,747 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 05:59:27,748 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-06-22 05:59:27,748 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 05:59:27,748 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(average_#in~x) = 1*average_#in~x Supporting invariants [] [2020-06-22 05:59:27,750 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-06-22 05:59:27,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 05:59:27,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:59:27,798 INFO L256 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 05:59:27,800 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:59:27,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:59:27,821 INFO L256 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 7 conjunts are in the unsatisfiable core [2020-06-22 05:59:27,822 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:59:27,857 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:59:27,879 INFO L98 LoopCannibalizer]: 3 predicates before loop cannibalization 3 predicates after loop cannibalization [2020-06-22 05:59:27,884 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2020-06-22 05:59:27,886 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 15 states. Second operand 4 states. [2020-06-22 05:59:27,991 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 15 states.. Second operand 4 states. Result 53 states and 68 transitions. Complement of second has 16 states. [2020-06-22 05:59:27,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2020-06-22 05:59:27,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-06-22 05:59:27,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2020-06-22 05:59:27,999 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 32 transitions. Stem has 6 letters. Loop has 3 letters. [2020-06-22 05:59:28,001 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 05:59:28,002 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 32 transitions. Stem has 9 letters. Loop has 3 letters. [2020-06-22 05:59:28,002 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 05:59:28,002 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 32 transitions. Stem has 6 letters. Loop has 6 letters. [2020-06-22 05:59:28,003 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 05:59:28,011 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 53 states and 68 transitions. [2020-06-22 05:59:28,017 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-06-22 05:59:28,023 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 53 states to 23 states and 28 transitions. [2020-06-22 05:59:28,025 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2020-06-22 05:59:28,025 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2020-06-22 05:59:28,026 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 28 transitions. [2020-06-22 05:59:28,026 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 05:59:28,026 INFO L706 BuchiCegarLoop]: Abstraction has 23 states and 28 transitions. [2020-06-22 05:59:28,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 28 transitions. [2020-06-22 05:59:28,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 16. [2020-06-22 05:59:28,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-06-22 05:59:28,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 21 transitions. [2020-06-22 05:59:28,061 INFO L729 BuchiCegarLoop]: Abstraction has 16 states and 21 transitions. [2020-06-22 05:59:28,061 INFO L609 BuchiCegarLoop]: Abstraction has 16 states and 21 transitions. [2020-06-22 05:59:28,061 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2020-06-22 05:59:28,061 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 21 transitions. [2020-06-22 05:59:28,062 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-06-22 05:59:28,062 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 05:59:28,062 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 05:59:28,063 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 05:59:28,063 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-06-22 05:59:28,063 INFO L794 eck$LassoCheckResult]: Stem: 148#ULTIMATE.startENTRY [49] ULTIMATE.startENTRY-->L34: Formula: (and (= v_ULTIMATE.start_main_~y~0_1 |v_ULTIMATE.start_main_#t~nondet1_4|) (= v_ULTIMATE.start_main_~x~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|) (= v_ULTIMATE.start_main_~z~0_1 |v_ULTIMATE.start_main_#t~nondet2_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_1|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_1|, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_1, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1, ULTIMATE.start_random_#res=|v_ULTIMATE.start_random_#res_8|, ULTIMATE.start_random_#t~nondet6=|v_ULTIMATE.start_random_#t~nondet6_3|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_2|, ULTIMATE.start_random_~x~1=v_ULTIMATE.start_random_~x~1_7, ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_1, ULTIMATE.start_main_#t~ret5=|v_ULTIMATE.start_main_#t~ret5_2|, ULTIMATE.start_main_#t~ret3=|v_ULTIMATE.start_main_#t~ret3_3|, ULTIMATE.start_main_#t~ret4=|v_ULTIMATE.start_main_#t~ret4_3|} AuxVars[|v_ULTIMATE.start_main_#t~nondet2_4|, |v_ULTIMATE.start_main_#t~nondet1_4|, |v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_~z~0, ULTIMATE.start_main_~x~0, ULTIMATE.start_random_#res, ULTIMATE.start_random_#t~nondet6, ULTIMATE.start_main_#res, ULTIMATE.start_random_~x~1, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_#t~ret5, ULTIMATE.start_main_#t~ret3, ULTIMATE.start_main_#t~ret4] 149#L34 [52] L34-->L37: Formula: (and (= |v_ULTIMATE.start_random_#res_1| (- v_ULTIMATE.start_random_~x~1_1)) (< v_ULTIMATE.start_random_~x~1_1 0)) InVars {ULTIMATE.start_random_~x~1=v_ULTIMATE.start_random_~x~1_1} OutVars{ULTIMATE.start_random_~x~1=v_ULTIMATE.start_random_~x~1_1, ULTIMATE.start_random_#res=|v_ULTIMATE.start_random_#res_1|} AuxVars[] AssignedVars[ULTIMATE.start_random_#res] 142#L37 [42] L37-->L34-1: Formula: (= |v_ULTIMATE.start_main_#t~ret3_1| |v_ULTIMATE.start_random_#res_4|) InVars {ULTIMATE.start_random_#res=|v_ULTIMATE.start_random_#res_4|} OutVars{ULTIMATE.start_random_#t~nondet6=|v_ULTIMATE.start_random_#t~nondet6_1|, ULTIMATE.start_main_#t~ret3=|v_ULTIMATE.start_main_#t~ret3_1|, ULTIMATE.start_random_~x~1=v_ULTIMATE.start_random_~x~1_3, ULTIMATE.start_random_#res=|v_ULTIMATE.start_random_#res_3|} AuxVars[] AssignedVars[ULTIMATE.start_random_#t~nondet6, ULTIMATE.start_random_~x~1, ULTIMATE.start_main_#t~ret3, ULTIMATE.start_random_#res] 143#L34-1 [66] L34-1-->L37-1: Formula: (and (>= v_ULTIMATE.start_random_~x~1_6 0) (= |v_ULTIMATE.start_random_#res_6| v_ULTIMATE.start_random_~x~1_6)) InVars {ULTIMATE.start_random_~x~1=v_ULTIMATE.start_random_~x~1_6} OutVars{ULTIMATE.start_random_~x~1=v_ULTIMATE.start_random_~x~1_6, ULTIMATE.start_random_#res=|v_ULTIMATE.start_random_#res_6|} AuxVars[] AssignedVars[ULTIMATE.start_random_#res] 150#L37-1 [61] L37-1-->L28: Formula: (= |v_ULTIMATE.start_main_#t~ret4_1| |v_ULTIMATE.start_random_#res_7|) InVars {ULTIMATE.start_random_#res=|v_ULTIMATE.start_random_#res_7|} OutVars{ULTIMATE.start_main_#t~ret4=|v_ULTIMATE.start_main_#t~ret4_1|, ULTIMATE.start_random_#res=|v_ULTIMATE.start_random_#res_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret4] 140#L28 [47] L28-->averageENTRY: Formula: (and (= |v_average_#in~xInParam_3| |v_ULTIMATE.start_main_#t~ret3_5|) (= |v_average_#in~yInParam_3| |v_ULTIMATE.start_main_#t~ret4_5|)) InVars {ULTIMATE.start_main_#t~ret3=|v_ULTIMATE.start_main_#t~ret3_5|, ULTIMATE.start_main_#t~ret4=|v_ULTIMATE.start_main_#t~ret4_5|} OutVars{average_#in~x=|v_average_#in~xInParam_3|, average_#in~y=|v_average_#in~yInParam_3|} AuxVars[] AssignedVars[average_#in~x, average_#in~y]< 144#averageENTRY [48] averageENTRY-->L43: Formula: (and (= v_average_~x_1 |v_average_#in~x_1|) (= v_average_~y_1 |v_average_#in~y_1|)) InVars {average_#in~y=|v_average_#in~y_1|, average_#in~x=|v_average_#in~x_1|} OutVars{average_~x=v_average_~x_1, average_~y=v_average_~y_1, average_#in~y=|v_average_#in~y_1|, average_#in~x=|v_average_#in~x_1|} AuxVars[] AssignedVars[average_~x, average_~y] 146#L43 [67] L43-->L45: Formula: (>= 0 v_average_~x_4) InVars {average_~x=v_average_~x_4} OutVars{average_~x=v_average_~x_4} AuxVars[] AssignedVars[] 147#L45 [2020-06-22 05:59:28,064 INFO L796 eck$LassoCheckResult]: Loop: 147#L45 [58] L45-->L46: Formula: (< 2 v_average_~y_3) InVars {average_~y=v_average_~y_3} OutVars{average_~y=v_average_~y_3} AuxVars[] AssignedVars[] 137#L46 [54] L46-->averageENTRY: Formula: (and (= |v_average_#in~xInParam_2| (+ v_average_~x_7 1)) (= |v_average_#in~yInParam_2| (+ v_average_~y_7 (- 2)))) InVars {average_~x=v_average_~x_7, average_~y=v_average_~y_7} OutVars{average_#in~x=|v_average_#in~xInParam_2|, average_#in~y=|v_average_#in~yInParam_2|} AuxVars[] AssignedVars[average_#in~x, average_#in~y]< 138#averageENTRY [48] averageENTRY-->L43: Formula: (and (= v_average_~x_1 |v_average_#in~x_1|) (= v_average_~y_1 |v_average_#in~y_1|)) InVars {average_#in~y=|v_average_#in~y_1|, average_#in~x=|v_average_#in~x_1|} OutVars{average_~x=v_average_~x_1, average_~y=v_average_~y_1, average_#in~y=|v_average_#in~y_1|, average_#in~x=|v_average_#in~x_1|} AuxVars[] AssignedVars[average_~x, average_~y] 151#L43 [67] L43-->L45: Formula: (>= 0 v_average_~x_4) InVars {average_~x=v_average_~x_4} OutVars{average_~x=v_average_~x_4} AuxVars[] AssignedVars[] 147#L45 [2020-06-22 05:59:28,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 05:59:28,064 INFO L82 PathProgramCache]: Analyzing trace with hash -2138302111, now seen corresponding path program 1 times [2020-06-22 05:59:28,064 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 05:59:28,064 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 05:59:28,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:59:28,065 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 05:59:28,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:59:28,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:59:28,128 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:59:28,130 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 05:59:28,131 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-06-22 05:59:28,135 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-06-22 05:59:28,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 05:59:28,135 INFO L82 PathProgramCache]: Analyzing trace with hash 2704848, now seen corresponding path program 1 times [2020-06-22 05:59:28,136 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 05:59:28,136 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 05:59:28,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:59:28,137 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 05:59:28,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:59:28,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:59:28,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:59:28,237 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 05:59:28,237 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 05:59:28,237 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 05:59:28,237 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 05:59:28,237 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2020-06-22 05:59:28,237 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 05:59:28,238 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 05:59:28,238 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 05:59:28,238 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration2_Loop [2020-06-22 05:59:28,238 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 05:59:28,238 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 05:59:28,240 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:59:28,245 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:59:28,254 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:59:28,256 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:59:28,258 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:59:28,326 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 05:59:28,326 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 05:59:28,330 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 05:59:28,330 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 05:59:28,334 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 05:59:28,335 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {average_#t~ret8=0} Honda state: {average_#t~ret8=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 05:59:28,365 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 05:59:28,365 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 05:59:28,403 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-06-22 05:59:28,403 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 05:59:28,919 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-06-22 05:59:28,921 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 05:59:28,921 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 05:59:28,921 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 05:59:28,921 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 05:59:28,922 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 05:59:28,922 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 05:59:28,922 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 05:59:28,922 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 05:59:28,922 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration2_Loop [2020-06-22 05:59:28,922 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 05:59:28,922 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 05:59:28,924 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:59:28,927 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:59:28,935 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:59:28,938 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:59:28,947 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:59:29,006 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 05:59:29,007 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 05:59:29,007 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:59:29,008 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 05:59:29,008 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 05:59:29,008 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 05:59:29,009 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 05:59:29,009 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 05:59:29,009 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 05:59:29,009 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 05:59:29,011 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 05:59:29,011 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:59:29,011 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 05:59:29,012 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 05:59:29,012 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 05:59:29,012 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 05:59:29,012 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 05:59:29,013 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 05:59:29,013 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 05:59:29,020 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 05:59:29,025 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-06-22 05:59:29,025 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2020-06-22 05:59:29,025 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 05:59:29,025 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-06-22 05:59:29,025 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 05:59:29,026 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(average_~y) = 1*average_~y Supporting invariants [] [2020-06-22 05:59:29,026 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-06-22 05:59:29,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 05:59:29,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:59:29,060 INFO L256 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 05:59:29,061 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:59:29,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:59:29,079 INFO L256 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 7 conjunts are in the unsatisfiable core [2020-06-22 05:59:29,080 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:59:29,125 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:59:29,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:59:29,176 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 05:59:29,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:59:29,194 INFO L256 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 7 conjunts are in the unsatisfiable core [2020-06-22 05:59:29,195 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:59:29,203 INFO L98 LoopCannibalizer]: 5 predicates before loop cannibalization 5 predicates after loop cannibalization [2020-06-22 05:59:29,203 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:59:29,203 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 16 states and 21 transitions. cyclomatic complexity: 7 Second operand 5 states. [2020-06-22 05:59:29,248 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 16 states and 21 transitions. cyclomatic complexity: 7. Second operand 5 states. Result 48 states and 63 transitions. Complement of second has 36 states. [2020-06-22 05:59:29,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2020-06-22 05:59:29,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-06-22 05:59:29,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 21 transitions. [2020-06-22 05:59:29,250 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 8 letters. Loop has 4 letters. [2020-06-22 05:59:29,251 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 05:59:29,251 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 12 letters. Loop has 4 letters. [2020-06-22 05:59:29,251 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 05:59:29,252 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 8 letters. Loop has 8 letters. [2020-06-22 05:59:29,252 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 05:59:29,255 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 48 states and 63 transitions. [2020-06-22 05:59:29,258 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2020-06-22 05:59:29,259 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 48 states to 26 states and 33 transitions. [2020-06-22 05:59:29,259 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2020-06-22 05:59:29,259 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2020-06-22 05:59:29,259 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 33 transitions. [2020-06-22 05:59:29,260 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 05:59:29,260 INFO L706 BuchiCegarLoop]: Abstraction has 26 states and 33 transitions. [2020-06-22 05:59:29,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 33 transitions. [2020-06-22 05:59:29,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 19. [2020-06-22 05:59:29,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2020-06-22 05:59:29,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 25 transitions. [2020-06-22 05:59:29,262 INFO L729 BuchiCegarLoop]: Abstraction has 19 states and 25 transitions. [2020-06-22 05:59:29,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-06-22 05:59:29,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-06-22 05:59:29,266 INFO L87 Difference]: Start difference. First operand 19 states and 25 transitions. Second operand 6 states. [2020-06-22 05:59:29,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 05:59:29,332 INFO L93 Difference]: Finished difference Result 31 states and 38 transitions. [2020-06-22 05:59:29,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-06-22 05:59:29,334 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 38 transitions. [2020-06-22 05:59:29,335 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2020-06-22 05:59:29,336 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 30 states and 37 transitions. [2020-06-22 05:59:29,336 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2020-06-22 05:59:29,337 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2020-06-22 05:59:29,337 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 37 transitions. [2020-06-22 05:59:29,337 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 05:59:29,337 INFO L706 BuchiCegarLoop]: Abstraction has 30 states and 37 transitions. [2020-06-22 05:59:29,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 37 transitions. [2020-06-22 05:59:29,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 24. [2020-06-22 05:59:29,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2020-06-22 05:59:29,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 31 transitions. [2020-06-22 05:59:29,340 INFO L729 BuchiCegarLoop]: Abstraction has 24 states and 31 transitions. [2020-06-22 05:59:29,340 INFO L609 BuchiCegarLoop]: Abstraction has 24 states and 31 transitions. [2020-06-22 05:59:29,340 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2020-06-22 05:59:29,341 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 31 transitions. [2020-06-22 05:59:29,341 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2020-06-22 05:59:29,342 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 05:59:29,342 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 05:59:29,342 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 05:59:29,342 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1] [2020-06-22 05:59:29,343 INFO L794 eck$LassoCheckResult]: Stem: 370#ULTIMATE.startENTRY [49] ULTIMATE.startENTRY-->L34: Formula: (and (= v_ULTIMATE.start_main_~y~0_1 |v_ULTIMATE.start_main_#t~nondet1_4|) (= v_ULTIMATE.start_main_~x~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|) (= v_ULTIMATE.start_main_~z~0_1 |v_ULTIMATE.start_main_#t~nondet2_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_1|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_1|, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_1, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1, ULTIMATE.start_random_#res=|v_ULTIMATE.start_random_#res_8|, ULTIMATE.start_random_#t~nondet6=|v_ULTIMATE.start_random_#t~nondet6_3|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_2|, ULTIMATE.start_random_~x~1=v_ULTIMATE.start_random_~x~1_7, ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_1, ULTIMATE.start_main_#t~ret5=|v_ULTIMATE.start_main_#t~ret5_2|, ULTIMATE.start_main_#t~ret3=|v_ULTIMATE.start_main_#t~ret3_3|, ULTIMATE.start_main_#t~ret4=|v_ULTIMATE.start_main_#t~ret4_3|} AuxVars[|v_ULTIMATE.start_main_#t~nondet2_4|, |v_ULTIMATE.start_main_#t~nondet1_4|, |v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_~z~0, ULTIMATE.start_main_~x~0, ULTIMATE.start_random_#res, ULTIMATE.start_random_#t~nondet6, ULTIMATE.start_main_#res, ULTIMATE.start_random_~x~1, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_#t~ret5, ULTIMATE.start_main_#t~ret3, ULTIMATE.start_main_#t~ret4] 371#L34 [65] L34-->L37: Formula: (and (>= v_ULTIMATE.start_random_~x~1_2 0) (= |v_ULTIMATE.start_random_#res_2| v_ULTIMATE.start_random_~x~1_2)) InVars {ULTIMATE.start_random_~x~1=v_ULTIMATE.start_random_~x~1_2} OutVars{ULTIMATE.start_random_~x~1=v_ULTIMATE.start_random_~x~1_2, ULTIMATE.start_random_#res=|v_ULTIMATE.start_random_#res_2|} AuxVars[] AssignedVars[ULTIMATE.start_random_#res] 368#L37 [42] L37-->L34-1: Formula: (= |v_ULTIMATE.start_main_#t~ret3_1| |v_ULTIMATE.start_random_#res_4|) InVars {ULTIMATE.start_random_#res=|v_ULTIMATE.start_random_#res_4|} OutVars{ULTIMATE.start_random_#t~nondet6=|v_ULTIMATE.start_random_#t~nondet6_1|, ULTIMATE.start_main_#t~ret3=|v_ULTIMATE.start_main_#t~ret3_1|, ULTIMATE.start_random_~x~1=v_ULTIMATE.start_random_~x~1_3, ULTIMATE.start_random_#res=|v_ULTIMATE.start_random_#res_3|} AuxVars[] AssignedVars[ULTIMATE.start_random_#t~nondet6, ULTIMATE.start_random_~x~1, ULTIMATE.start_main_#t~ret3, ULTIMATE.start_random_#res] 369#L34-1 [66] L34-1-->L37-1: Formula: (and (>= v_ULTIMATE.start_random_~x~1_6 0) (= |v_ULTIMATE.start_random_#res_6| v_ULTIMATE.start_random_~x~1_6)) InVars {ULTIMATE.start_random_~x~1=v_ULTIMATE.start_random_~x~1_6} OutVars{ULTIMATE.start_random_~x~1=v_ULTIMATE.start_random_~x~1_6, ULTIMATE.start_random_#res=|v_ULTIMATE.start_random_#res_6|} AuxVars[] AssignedVars[ULTIMATE.start_random_#res] 384#L37-1 [61] L37-1-->L28: Formula: (= |v_ULTIMATE.start_main_#t~ret4_1| |v_ULTIMATE.start_random_#res_7|) InVars {ULTIMATE.start_random_#res=|v_ULTIMATE.start_random_#res_7|} OutVars{ULTIMATE.start_main_#t~ret4=|v_ULTIMATE.start_main_#t~ret4_1|, ULTIMATE.start_random_#res=|v_ULTIMATE.start_random_#res_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret4] 367#L28 [47] L28-->averageENTRY: Formula: (and (= |v_average_#in~xInParam_3| |v_ULTIMATE.start_main_#t~ret3_5|) (= |v_average_#in~yInParam_3| |v_ULTIMATE.start_main_#t~ret4_5|)) InVars {ULTIMATE.start_main_#t~ret3=|v_ULTIMATE.start_main_#t~ret3_5|, ULTIMATE.start_main_#t~ret4=|v_ULTIMATE.start_main_#t~ret4_5|} OutVars{average_#in~x=|v_average_#in~xInParam_3|, average_#in~y=|v_average_#in~yInParam_3|} AuxVars[] AssignedVars[average_#in~x, average_#in~y]< 383#averageENTRY [48] averageENTRY-->L43: Formula: (and (= v_average_~x_1 |v_average_#in~x_1|) (= v_average_~y_1 |v_average_#in~y_1|)) InVars {average_#in~y=|v_average_#in~y_1|, average_#in~x=|v_average_#in~x_1|} OutVars{average_~x=v_average_~x_1, average_~y=v_average_~y_1, average_#in~y=|v_average_#in~y_1|, average_#in~x=|v_average_#in~x_1|} AuxVars[] AssignedVars[average_~x, average_~y] 374#L43 [67] L43-->L45: Formula: (>= 0 v_average_~x_4) InVars {average_~x=v_average_~x_4} OutVars{average_~x=v_average_~x_4} AuxVars[] AssignedVars[] 375#L45 [2020-06-22 05:59:29,343 INFO L796 eck$LassoCheckResult]: Loop: 375#L45 [58] L45-->L46: Formula: (< 2 v_average_~y_3) InVars {average_~y=v_average_~y_3} OutVars{average_~y=v_average_~y_3} AuxVars[] AssignedVars[] 362#L46 [54] L46-->averageENTRY: Formula: (and (= |v_average_#in~xInParam_2| (+ v_average_~x_7 1)) (= |v_average_#in~yInParam_2| (+ v_average_~y_7 (- 2)))) InVars {average_~x=v_average_~x_7, average_~y=v_average_~y_7} OutVars{average_#in~x=|v_average_#in~xInParam_2|, average_#in~y=|v_average_#in~yInParam_2|} AuxVars[] AssignedVars[average_#in~x, average_#in~y]< 379#averageENTRY [48] averageENTRY-->L43: Formula: (and (= v_average_~x_1 |v_average_#in~x_1|) (= v_average_~y_1 |v_average_#in~y_1|)) InVars {average_#in~y=|v_average_#in~y_1|, average_#in~x=|v_average_#in~x_1|} OutVars{average_~x=v_average_~x_1, average_~y=v_average_~y_1, average_#in~y=|v_average_#in~y_1|, average_#in~x=|v_average_#in~x_1|} AuxVars[] AssignedVars[average_~x, average_~y] 381#L43 [43] L43-->L44: Formula: (< 0 v_average_~x_2) InVars {average_~x=v_average_~x_2} OutVars{average_~x=v_average_~x_2} AuxVars[] AssignedVars[] 361#L44 [41] L44-->averageENTRY: Formula: (and (= |v_average_#in~yInParam_1| (+ v_average_~y_6 1)) (= |v_average_#in~xInParam_1| (+ v_average_~x_6 (- 1)))) InVars {average_~x=v_average_~x_6, average_~y=v_average_~y_6} OutVars{average_#in~x=|v_average_#in~xInParam_1|, average_#in~y=|v_average_#in~yInParam_1|} AuxVars[] AssignedVars[average_#in~x, average_#in~y]< 363#averageENTRY [48] averageENTRY-->L43: Formula: (and (= v_average_~x_1 |v_average_#in~x_1|) (= v_average_~y_1 |v_average_#in~y_1|)) InVars {average_#in~y=|v_average_#in~y_1|, average_#in~x=|v_average_#in~x_1|} OutVars{average_~x=v_average_~x_1, average_~y=v_average_~y_1, average_#in~y=|v_average_#in~y_1|, average_#in~x=|v_average_#in~x_1|} AuxVars[] AssignedVars[average_~x, average_~y] 382#L43 [67] L43-->L45: Formula: (>= 0 v_average_~x_4) InVars {average_~x=v_average_~x_4} OutVars{average_~x=v_average_~x_4} AuxVars[] AssignedVars[] 375#L45 [2020-06-22 05:59:29,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 05:59:29,343 INFO L82 PathProgramCache]: Analyzing trace with hash 809311150, now seen corresponding path program 1 times [2020-06-22 05:59:29,343 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 05:59:29,343 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 05:59:29,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:59:29,344 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 05:59:29,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:59:29,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:59:29,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:59:29,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 05:59:29,356 INFO L82 PathProgramCache]: Analyzing trace with hash -1024925884, now seen corresponding path program 1 times [2020-06-22 05:59:29,356 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 05:59:29,356 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 05:59:29,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:59:29,357 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 05:59:29,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:59:29,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:59:29,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:59:29,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 05:59:29,366 INFO L82 PathProgramCache]: Analyzing trace with hash 921876215, now seen corresponding path program 1 times [2020-06-22 05:59:29,367 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 05:59:29,367 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 05:59:29,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:59:29,368 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 05:59:29,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:59:29,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:59:29,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:59:29,541 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 05:59:29,541 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 05:59:29,541 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 05:59:29,541 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 05:59:29,541 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2020-06-22 05:59:29,541 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 05:59:29,542 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 05:59:29,542 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 05:59:29,542 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration3_Loop [2020-06-22 05:59:29,542 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 05:59:29,542 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 05:59:29,543 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:59:29,550 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:59:29,552 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:59:29,553 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:59:29,561 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:59:29,609 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 05:59:29,609 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 10 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 10 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 05:59:29,612 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 05:59:29,612 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 11 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 11 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 05:59:29,646 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-06-22 05:59:29,646 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 05:59:30,462 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-06-22 05:59:30,465 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 05:59:30,465 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 05:59:30,465 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 05:59:30,465 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 05:59:30,465 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 05:59:30,466 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 05:59:30,466 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 05:59:30,466 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 05:59:30,466 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration3_Loop [2020-06-22 05:59:30,466 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 05:59:30,466 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 05:59:30,467 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:59:30,474 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:59:30,476 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:59:30,483 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:59:30,485 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:59:30,535 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 05:59:30,535 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 05:59:30,535 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:59:30,536 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 05:59:30,536 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 05:59:30,537 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 05:59:30,537 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 05:59:30,537 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 05:59:30,538 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 05:59:30,538 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 05:59:30,543 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 05:59:30,546 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-06-22 05:59:30,546 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2020-06-22 05:59:30,547 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 05:59:30,547 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-06-22 05:59:30,547 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 05:59:30,547 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(average_~y) = 1*average_~y Supporting invariants [] [2020-06-22 05:59:30,547 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-06-22 05:59:30,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 05:59:30,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:59:30,575 INFO L256 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 05:59:30,576 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:59:30,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:59:30,594 INFO L256 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 11 conjunts are in the unsatisfiable core [2020-06-22 05:59:30,595 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:59:30,650 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 05:59:30,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:59:30,722 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 05:59:30,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:59:30,736 INFO L256 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 11 conjunts are in the unsatisfiable core [2020-06-22 05:59:30,737 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:59:30,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:59:30,817 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 05:59:30,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:59:30,830 INFO L256 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 11 conjunts are in the unsatisfiable core [2020-06-22 05:59:30,831 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:59:30,841 INFO L98 LoopCannibalizer]: 7 predicates before loop cannibalization 10 predicates after loop cannibalization [2020-06-22 05:59:30,841 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 10 loop predicates [2020-06-22 05:59:30,841 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 24 states and 31 transitions. cyclomatic complexity: 9 Second operand 7 states. [2020-06-22 05:59:30,997 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 24 states and 31 transitions. cyclomatic complexity: 9. Second operand 7 states. Result 150 states and 202 transitions. Complement of second has 126 states. [2020-06-22 05:59:30,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 1 stem states 7 non-accepting loop states 1 accepting loop states [2020-06-22 05:59:30,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-06-22 05:59:30,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 28 transitions. [2020-06-22 05:59:30,999 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 28 transitions. Stem has 8 letters. Loop has 7 letters. [2020-06-22 05:59:31,000 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 05:59:31,000 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 28 transitions. Stem has 15 letters. Loop has 7 letters. [2020-06-22 05:59:31,000 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 05:59:31,000 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 28 transitions. Stem has 8 letters. Loop has 14 letters. [2020-06-22 05:59:31,001 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 05:59:31,003 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 150 states and 202 transitions. [2020-06-22 05:59:31,008 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 40 [2020-06-22 05:59:31,009 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 150 states to 56 states and 70 transitions. [2020-06-22 05:59:31,009 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2020-06-22 05:59:31,010 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2020-06-22 05:59:31,010 INFO L73 IsDeterministic]: Start isDeterministic. Operand 56 states and 70 transitions. [2020-06-22 05:59:31,010 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 05:59:31,010 INFO L706 BuchiCegarLoop]: Abstraction has 56 states and 70 transitions. [2020-06-22 05:59:31,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states and 70 transitions. [2020-06-22 05:59:31,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 30. [2020-06-22 05:59:31,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-06-22 05:59:31,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 38 transitions. [2020-06-22 05:59:31,013 INFO L729 BuchiCegarLoop]: Abstraction has 30 states and 38 transitions. [2020-06-22 05:59:31,013 INFO L609 BuchiCegarLoop]: Abstraction has 30 states and 38 transitions. [2020-06-22 05:59:31,014 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2020-06-22 05:59:31,014 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 38 transitions. [2020-06-22 05:59:31,015 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2020-06-22 05:59:31,015 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 05:59:31,015 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 05:59:31,015 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 05:59:31,015 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [3, 2, 2, 1, 1, 1] [2020-06-22 05:59:31,016 INFO L794 eck$LassoCheckResult]: Stem: 792#ULTIMATE.startENTRY [49] ULTIMATE.startENTRY-->L34: Formula: (and (= v_ULTIMATE.start_main_~y~0_1 |v_ULTIMATE.start_main_#t~nondet1_4|) (= v_ULTIMATE.start_main_~x~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|) (= v_ULTIMATE.start_main_~z~0_1 |v_ULTIMATE.start_main_#t~nondet2_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_1|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_1|, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_1, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1, ULTIMATE.start_random_#res=|v_ULTIMATE.start_random_#res_8|, ULTIMATE.start_random_#t~nondet6=|v_ULTIMATE.start_random_#t~nondet6_3|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_2|, ULTIMATE.start_random_~x~1=v_ULTIMATE.start_random_~x~1_7, ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_1, ULTIMATE.start_main_#t~ret5=|v_ULTIMATE.start_main_#t~ret5_2|, ULTIMATE.start_main_#t~ret3=|v_ULTIMATE.start_main_#t~ret3_3|, ULTIMATE.start_main_#t~ret4=|v_ULTIMATE.start_main_#t~ret4_3|} AuxVars[|v_ULTIMATE.start_main_#t~nondet2_4|, |v_ULTIMATE.start_main_#t~nondet1_4|, |v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_~z~0, ULTIMATE.start_main_~x~0, ULTIMATE.start_random_#res, ULTIMATE.start_random_#t~nondet6, ULTIMATE.start_main_#res, ULTIMATE.start_random_~x~1, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_#t~ret5, ULTIMATE.start_main_#t~ret3, ULTIMATE.start_main_#t~ret4] 793#L34 [65] L34-->L37: Formula: (and (>= v_ULTIMATE.start_random_~x~1_2 0) (= |v_ULTIMATE.start_random_#res_2| v_ULTIMATE.start_random_~x~1_2)) InVars {ULTIMATE.start_random_~x~1=v_ULTIMATE.start_random_~x~1_2} OutVars{ULTIMATE.start_random_~x~1=v_ULTIMATE.start_random_~x~1_2, ULTIMATE.start_random_#res=|v_ULTIMATE.start_random_#res_2|} AuxVars[] AssignedVars[ULTIMATE.start_random_#res] 786#L37 [42] L37-->L34-1: Formula: (= |v_ULTIMATE.start_main_#t~ret3_1| |v_ULTIMATE.start_random_#res_4|) InVars {ULTIMATE.start_random_#res=|v_ULTIMATE.start_random_#res_4|} OutVars{ULTIMATE.start_random_#t~nondet6=|v_ULTIMATE.start_random_#t~nondet6_1|, ULTIMATE.start_main_#t~ret3=|v_ULTIMATE.start_main_#t~ret3_1|, ULTIMATE.start_random_~x~1=v_ULTIMATE.start_random_~x~1_3, ULTIMATE.start_random_#res=|v_ULTIMATE.start_random_#res_3|} AuxVars[] AssignedVars[ULTIMATE.start_random_#t~nondet6, ULTIMATE.start_random_~x~1, ULTIMATE.start_main_#t~ret3, ULTIMATE.start_random_#res] 787#L34-1 [66] L34-1-->L37-1: Formula: (and (>= v_ULTIMATE.start_random_~x~1_6 0) (= |v_ULTIMATE.start_random_#res_6| v_ULTIMATE.start_random_~x~1_6)) InVars {ULTIMATE.start_random_~x~1=v_ULTIMATE.start_random_~x~1_6} OutVars{ULTIMATE.start_random_~x~1=v_ULTIMATE.start_random_~x~1_6, ULTIMATE.start_random_#res=|v_ULTIMATE.start_random_#res_6|} AuxVars[] AssignedVars[ULTIMATE.start_random_#res] 809#L37-1 [61] L37-1-->L28: Formula: (= |v_ULTIMATE.start_main_#t~ret4_1| |v_ULTIMATE.start_random_#res_7|) InVars {ULTIMATE.start_random_#res=|v_ULTIMATE.start_random_#res_7|} OutVars{ULTIMATE.start_main_#t~ret4=|v_ULTIMATE.start_main_#t~ret4_1|, ULTIMATE.start_random_#res=|v_ULTIMATE.start_random_#res_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret4] 801#L28 [47] L28-->averageENTRY: Formula: (and (= |v_average_#in~xInParam_3| |v_ULTIMATE.start_main_#t~ret3_5|) (= |v_average_#in~yInParam_3| |v_ULTIMATE.start_main_#t~ret4_5|)) InVars {ULTIMATE.start_main_#t~ret3=|v_ULTIMATE.start_main_#t~ret3_5|, ULTIMATE.start_main_#t~ret4=|v_ULTIMATE.start_main_#t~ret4_5|} OutVars{average_#in~x=|v_average_#in~xInParam_3|, average_#in~y=|v_average_#in~yInParam_3|} AuxVars[] AssignedVars[average_#in~x, average_#in~y]< 808#averageENTRY [48] averageENTRY-->L43: Formula: (and (= v_average_~x_1 |v_average_#in~x_1|) (= v_average_~y_1 |v_average_#in~y_1|)) InVars {average_#in~y=|v_average_#in~y_1|, average_#in~x=|v_average_#in~x_1|} OutVars{average_~x=v_average_~x_1, average_~y=v_average_~y_1, average_#in~y=|v_average_#in~y_1|, average_#in~x=|v_average_#in~x_1|} AuxVars[] AssignedVars[average_~x, average_~y] 803#L43 [67] L43-->L45: Formula: (>= 0 v_average_~x_4) InVars {average_~x=v_average_~x_4} OutVars{average_~x=v_average_~x_4} AuxVars[] AssignedVars[] 802#L45 [2020-06-22 05:59:31,016 INFO L796 eck$LassoCheckResult]: Loop: 802#L45 [58] L45-->L46: Formula: (< 2 v_average_~y_3) InVars {average_~y=v_average_~y_3} OutVars{average_~y=v_average_~y_3} AuxVars[] AssignedVars[] 782#L46 [54] L46-->averageENTRY: Formula: (and (= |v_average_#in~xInParam_2| (+ v_average_~x_7 1)) (= |v_average_#in~yInParam_2| (+ v_average_~y_7 (- 2)))) InVars {average_~x=v_average_~x_7, average_~y=v_average_~y_7} OutVars{average_#in~x=|v_average_#in~xInParam_2|, average_#in~y=|v_average_#in~yInParam_2|} AuxVars[] AssignedVars[average_#in~x, average_#in~y]< 799#averageENTRY [48] averageENTRY-->L43: Formula: (and (= v_average_~x_1 |v_average_#in~x_1|) (= v_average_~y_1 |v_average_#in~y_1|)) InVars {average_#in~y=|v_average_#in~y_1|, average_#in~x=|v_average_#in~x_1|} OutVars{average_~x=v_average_~x_1, average_~y=v_average_~y_1, average_#in~y=|v_average_#in~y_1|, average_#in~x=|v_average_#in~x_1|} AuxVars[] AssignedVars[average_~x, average_~y] 810#L43 [43] L43-->L44: Formula: (< 0 v_average_~x_2) InVars {average_~x=v_average_~x_2} OutVars{average_~x=v_average_~x_2} AuxVars[] AssignedVars[] 781#L44 [41] L44-->averageENTRY: Formula: (and (= |v_average_#in~yInParam_1| (+ v_average_~y_6 1)) (= |v_average_#in~xInParam_1| (+ v_average_~x_6 (- 1)))) InVars {average_~x=v_average_~x_6, average_~y=v_average_~y_6} OutVars{average_#in~x=|v_average_#in~xInParam_1|, average_#in~y=|v_average_#in~yInParam_1|} AuxVars[] AssignedVars[average_#in~x, average_#in~y]< 783#averageENTRY [48] averageENTRY-->L43: Formula: (and (= v_average_~x_1 |v_average_#in~x_1|) (= v_average_~y_1 |v_average_#in~y_1|)) InVars {average_#in~y=|v_average_#in~y_1|, average_#in~x=|v_average_#in~x_1|} OutVars{average_~x=v_average_~x_1, average_~y=v_average_~y_1, average_#in~y=|v_average_#in~y_1|, average_#in~x=|v_average_#in~x_1|} AuxVars[] AssignedVars[average_~x, average_~y] 788#L43 [43] L43-->L44: Formula: (< 0 v_average_~x_2) InVars {average_~x=v_average_~x_2} OutVars{average_~x=v_average_~x_2} AuxVars[] AssignedVars[] 790#L44 [41] L44-->averageENTRY: Formula: (and (= |v_average_#in~yInParam_1| (+ v_average_~y_6 1)) (= |v_average_#in~xInParam_1| (+ v_average_~x_6 (- 1)))) InVars {average_~x=v_average_~x_6, average_~y=v_average_~y_6} OutVars{average_#in~x=|v_average_#in~xInParam_1|, average_#in~y=|v_average_#in~yInParam_1|} AuxVars[] AssignedVars[average_#in~x, average_#in~y]< 804#averageENTRY [48] averageENTRY-->L43: Formula: (and (= v_average_~x_1 |v_average_#in~x_1|) (= v_average_~y_1 |v_average_#in~y_1|)) InVars {average_#in~y=|v_average_#in~y_1|, average_#in~x=|v_average_#in~x_1|} OutVars{average_~x=v_average_~x_1, average_~y=v_average_~y_1, average_#in~y=|v_average_#in~y_1|, average_#in~x=|v_average_#in~x_1|} AuxVars[] AssignedVars[average_~x, average_~y] 805#L43 [67] L43-->L45: Formula: (>= 0 v_average_~x_4) InVars {average_~x=v_average_~x_4} OutVars{average_~x=v_average_~x_4} AuxVars[] AssignedVars[] 802#L45 [2020-06-22 05:59:31,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 05:59:31,016 INFO L82 PathProgramCache]: Analyzing trace with hash 809311150, now seen corresponding path program 2 times [2020-06-22 05:59:31,017 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 05:59:31,017 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 05:59:31,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:59:31,018 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 05:59:31,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:59:31,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:59:31,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:59:31,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 05:59:31,028 INFO L82 PathProgramCache]: Analyzing trace with hash -645177008, now seen corresponding path program 2 times [2020-06-22 05:59:31,028 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 05:59:31,028 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 05:59:31,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:59:31,029 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 05:59:31,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:59:31,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:59:31,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:59:31,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 05:59:31,040 INFO L82 PathProgramCache]: Analyzing trace with hash 1592756413, now seen corresponding path program 2 times [2020-06-22 05:59:31,041 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 05:59:31,041 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 05:59:31,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:59:31,041 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 05:59:31,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:59:31,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:59:31,074 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 05:59:31,074 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 05:59:31,075 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-06-22 05:59:31,270 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 05:59:31,270 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 05:59:31,270 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 05:59:31,270 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 05:59:31,270 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2020-06-22 05:59:31,270 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 05:59:31,270 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 05:59:31,271 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 05:59:31,271 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration4_Loop [2020-06-22 05:59:31,271 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 05:59:31,271 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 05:59:31,272 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:59:31,274 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:59:31,281 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:59:31,286 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:59:31,288 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:59:31,338 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 05:59:31,338 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 12 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 12 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 05:59:31,341 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 05:59:31,341 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 05:59:31,345 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 05:59:31,345 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {average_#res=0} Honda state: {average_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 05:59:31,372 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 05:59:31,372 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 05:59:31,404 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-06-22 05:59:31,404 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 05:59:32,125 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-06-22 05:59:32,128 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 05:59:32,128 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 05:59:32,128 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 05:59:32,128 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 05:59:32,128 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 05:59:32,128 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 05:59:32,128 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 05:59:32,128 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 05:59:32,129 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration4_Loop [2020-06-22 05:59:32,129 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 05:59:32,129 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 05:59:32,130 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:59:32,132 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:59:32,134 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:59:32,143 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:59:32,146 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 05:59:32,198 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 05:59:32,198 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 05:59:32,199 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:59:32,200 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 05:59:32,200 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 05:59:32,200 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 05:59:32,200 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 05:59:32,200 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 05:59:32,201 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 05:59:32,201 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 05:59:32,202 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 05:59:32,202 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:59:32,203 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 05:59:32,203 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 05:59:32,203 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 05:59:32,203 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 05:59:32,203 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 05:59:32,203 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 05:59:32,204 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 05:59:32,204 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 05:59:32,205 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:59:32,205 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 05:59:32,205 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 05:59:32,205 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 05:59:32,205 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 05:59:32,205 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 05:59:32,206 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 05:59:32,206 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 05:59:32,216 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 05:59:32,218 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-06-22 05:59:32,218 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2020-06-22 05:59:32,219 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 05:59:32,219 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-06-22 05:59:32,219 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 05:59:32,219 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(average_~x) = 1*average_~x Supporting invariants [] [2020-06-22 05:59:32,219 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-06-22 05:59:32,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 05:59:32,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:59:32,248 INFO L256 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 05:59:32,249 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:59:32,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:59:32,270 INFO L256 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 14 conjunts are in the unsatisfiable core [2020-06-22 05:59:32,272 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:59:32,315 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 05:59:32,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:59:32,336 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 05:59:32,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:59:32,356 INFO L256 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 14 conjunts are in the unsatisfiable core [2020-06-22 05:59:32,357 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:59:32,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:59:32,473 INFO L256 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 14 conjunts are in the unsatisfiable core [2020-06-22 05:59:32,474 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:59:32,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:59:32,535 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 05:59:32,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:59:32,554 INFO L256 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 14 conjunts are in the unsatisfiable core [2020-06-22 05:59:32,555 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:59:32,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:59:32,653 INFO L256 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 6 conjunts are in the unsatisfiable core [2020-06-22 05:59:32,654 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:59:32,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:59:32,679 INFO L256 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 6 conjunts are in the unsatisfiable core [2020-06-22 05:59:32,680 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:59:32,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:59:32,716 INFO L256 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 6 conjunts are in the unsatisfiable core [2020-06-22 05:59:32,717 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:59:32,721 INFO L98 LoopCannibalizer]: 5 predicates before loop cannibalization 14 predicates after loop cannibalization [2020-06-22 05:59:32,721 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 14 loop predicates [2020-06-22 05:59:32,721 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 30 states and 38 transitions. cyclomatic complexity: 10 Second operand 7 states. [2020-06-22 05:59:33,205 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 30 states and 38 transitions. cyclomatic complexity: 10. Second operand 7 states. Result 1955 states and 2647 transitions. Complement of second has 1201 states. [2020-06-22 05:59:33,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 14 states 1 stem states 11 non-accepting loop states 1 accepting loop states [2020-06-22 05:59:33,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-06-22 05:59:33,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 45 transitions. [2020-06-22 05:59:33,208 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 45 transitions. Stem has 8 letters. Loop has 10 letters. [2020-06-22 05:59:33,208 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 05:59:33,209 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 45 transitions. Stem has 18 letters. Loop has 10 letters. [2020-06-22 05:59:33,209 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 05:59:33,209 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 45 transitions. Stem has 8 letters. Loop has 20 letters. [2020-06-22 05:59:33,211 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 05:59:33,212 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1955 states and 2647 transitions. [2020-06-22 05:59:33,239 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-06-22 05:59:33,240 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1955 states to 0 states and 0 transitions. [2020-06-22 05:59:33,240 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-06-22 05:59:33,240 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-06-22 05:59:33,240 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-06-22 05:59:33,240 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 05:59:33,240 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 05:59:33,240 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 05:59:33,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-06-22 05:59:33,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-06-22 05:59:33,241 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 6 states. [2020-06-22 05:59:33,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 05:59:33,241 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-06-22 05:59:33,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-06-22 05:59:33,243 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2020-06-22 05:59:33,243 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-06-22 05:59:33,244 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2020-06-22 05:59:33,244 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-06-22 05:59:33,244 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-06-22 05:59:33,244 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-06-22 05:59:33,244 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 05:59:33,244 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 05:59:33,244 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 05:59:33,244 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 05:59:33,244 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2020-06-22 05:59:33,245 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-06-22 05:59:33,245 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-06-22 05:59:33,245 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-06-22 05:59:33,251 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 05:59:33 BasicIcfg [2020-06-22 05:59:33,251 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-06-22 05:59:33,251 INFO L168 Benchmark]: Toolchain (without parser) took 7040.07 ms. Allocated memory was 649.6 MB in the beginning and 767.0 MB in the end (delta: 117.4 MB). Free memory was 564.2 MB in the beginning and 546.8 MB in the end (delta: 17.4 MB). Peak memory consumption was 134.8 MB. Max. memory is 50.3 GB. [2020-06-22 05:59:33,255 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 649.6 MB. Free memory is still 586.9 MB. There was no memory consumed. Max. memory is 50.3 GB. [2020-06-22 05:59:33,255 INFO L168 Benchmark]: CACSL2BoogieTranslator took 280.71 ms. Allocated memory was 649.6 MB in the beginning and 677.9 MB in the end (delta: 28.3 MB). Free memory was 564.2 MB in the beginning and 642.5 MB in the end (delta: -78.2 MB). Peak memory consumption was 28.7 MB. Max. memory is 50.3 GB. [2020-06-22 05:59:33,256 INFO L168 Benchmark]: Boogie Procedure Inliner took 35.12 ms. Allocated memory is still 677.9 MB. Free memory was 642.5 MB in the beginning and 641.1 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. [2020-06-22 05:59:33,256 INFO L168 Benchmark]: Boogie Preprocessor took 17.11 ms. Allocated memory is still 677.9 MB. Free memory was 641.1 MB in the beginning and 639.8 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. [2020-06-22 05:59:33,257 INFO L168 Benchmark]: RCFGBuilder took 218.63 ms. Allocated memory is still 677.9 MB. Free memory was 639.8 MB in the beginning and 624.2 MB in the end (delta: 15.6 MB). Peak memory consumption was 15.6 MB. Max. memory is 50.3 GB. [2020-06-22 05:59:33,257 INFO L168 Benchmark]: BlockEncodingV2 took 79.20 ms. Allocated memory is still 677.9 MB. Free memory was 624.2 MB in the beginning and 619.0 MB in the end (delta: 5.1 MB). Peak memory consumption was 5.1 MB. Max. memory is 50.3 GB. [2020-06-22 05:59:33,258 INFO L168 Benchmark]: TraceAbstraction took 179.62 ms. Allocated memory is still 677.9 MB. Free memory was 617.7 MB in the beginning and 606.9 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 50.3 GB. [2020-06-22 05:59:33,258 INFO L168 Benchmark]: BuchiAutomizer took 6224.42 ms. Allocated memory was 677.9 MB in the beginning and 767.0 MB in the end (delta: 89.1 MB). Free memory was 606.9 MB in the beginning and 546.8 MB in the end (delta: 60.1 MB). Peak memory consumption was 149.2 MB. Max. memory is 50.3 GB. [2020-06-22 05:59:33,262 INFO L337 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 19 locations, 24 edges - StatisticsResult: Encoded RCFG 15 locations, 20 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 649.6 MB. Free memory is still 586.9 MB. There was no memory consumed. Max. memory is 50.3 GB. * CACSL2BoogieTranslator took 280.71 ms. Allocated memory was 649.6 MB in the beginning and 677.9 MB in the end (delta: 28.3 MB). Free memory was 564.2 MB in the beginning and 642.5 MB in the end (delta: -78.2 MB). Peak memory consumption was 28.7 MB. Max. memory is 50.3 GB. * Boogie Procedure Inliner took 35.12 ms. Allocated memory is still 677.9 MB. Free memory was 642.5 MB in the beginning and 641.1 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. * Boogie Preprocessor took 17.11 ms. Allocated memory is still 677.9 MB. Free memory was 641.1 MB in the beginning and 639.8 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. * RCFGBuilder took 218.63 ms. Allocated memory is still 677.9 MB. Free memory was 639.8 MB in the beginning and 624.2 MB in the end (delta: 15.6 MB). Peak memory consumption was 15.6 MB. Max. memory is 50.3 GB. * BlockEncodingV2 took 79.20 ms. Allocated memory is still 677.9 MB. Free memory was 624.2 MB in the beginning and 619.0 MB in the end (delta: 5.1 MB). Peak memory consumption was 5.1 MB. Max. memory is 50.3 GB. * TraceAbstraction took 179.62 ms. Allocated memory is still 677.9 MB. Free memory was 617.7 MB in the beginning and 606.9 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 50.3 GB. * BuchiAutomizer took 6224.42 ms. Allocated memory was 677.9 MB in the beginning and 767.0 MB in the end (delta: 89.1 MB). Free memory was 606.9 MB in the beginning and 546.8 MB in the end (delta: 60.1 MB). Peak memory consumption was 149.2 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. - InvariantResult [Line: 32]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 32]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 15 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=15occurred 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, 6 LocationsWithAnnotation, 12 PreInvPairs, 12 NumberOfFragments, 6 HoareAnnotationTreeSize, 12 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 6 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - StatisticsResult: Constructed decomposition of program Your program was decomposed into 6 terminating modules (2 trivial, 0 deterministic, 4 nondeterministic). One nondeterministic module has affine ranking function \old(x) and consists of 5 locations. One nondeterministic module has affine ranking function y and consists of 5 locations. One nondeterministic module has affine ranking function y and consists of 9 locations. One nondeterministic module has affine ranking function x and consists of 14 locations. 2 modules have a trivial ranking function, the largest among these consists of 6 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 6.1s and 5 iterations. TraceHistogramMax:3. Analysis of lassos took 4.0s. Construction of modules took 0.1s. Büchi inclusion checks took 1.8s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 4. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 46 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 30 states and ocurred in iteration 3. Nontrivial modules had stage [4, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 2/9 HoareTripleCheckerStatistics: 85 SDtfs, 128 SDslu, 129 SDs, 0 SdLazy, 258 SolverSat, 46 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT2 conc0 concLT1 SILN0 SILU0 SILI0 SILT1 lasso0 LassoPreprocessingBenchmarks: Lassos: inital23 mio100 ax100 hnf100 lsp61 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq160 hnf92 smp95 dnf100 smp100 tf110 neg100 sie109 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 10ms VariablesStem: 0 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 5 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 4 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 2.2s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! !ENTRY org.eclipse.core.resources 2 10035 2020-06-22 05:59:33.492 !MESSAGE The workspace will exit with unsaved changes in this session. Received shutdown request... Ultimate: GTK+ Version Check