/export/starexec/sandbox/solver/bin/starexec_run_default /export/starexec/sandbox/benchmark/theBenchmark.c /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- YES Ultimate: Cannot open display: This is Ultimate 0.1.25-34f2e62 [2020-07-01 12:52:36,722 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-01 12:52:36,724 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-01 12:52:36,735 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-01 12:52:36,735 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-01 12:52:36,736 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-01 12:52:36,737 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-01 12:52:36,739 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-01 12:52:36,740 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-01 12:52:36,741 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-01 12:52:36,742 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-01 12:52:36,743 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-01 12:52:36,743 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-01 12:52:36,744 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-01 12:52:36,745 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-01 12:52:36,746 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-01 12:52:36,747 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-01 12:52:36,748 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-01 12:52:36,749 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-01 12:52:36,751 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-01 12:52:36,752 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-01 12:52:36,753 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-01 12:52:36,754 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-01 12:52:36,755 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-01 12:52:36,757 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-01 12:52:36,757 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-01 12:52:36,757 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-01 12:52:36,758 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-01 12:52:36,758 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-01 12:52:36,759 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-01 12:52:36,759 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-01 12:52:36,760 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-01 12:52:36,761 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-01 12:52:36,761 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-01 12:52:36,762 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-01 12:52:36,762 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-01 12:52:36,763 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-01 12:52:36,763 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-01 12:52:36,763 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-01 12:52:36,764 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-01 12:52:36,765 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-01 12:52:36,765 INFO L101 SettingsManager]: Beginning loading settings from /export/starexec/sandbox/solver/bin/./../termcomp2017.epf [2020-07-01 12:52:36,778 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-01 12:52:36,778 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-01 12:52:36,780 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-01 12:52:36,780 INFO L138 SettingsManager]: * Rewrite not-equals=true [2020-07-01 12:52:36,780 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-01 12:52:36,780 INFO L138 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE [2020-07-01 12:52:36,780 INFO L138 SettingsManager]: * Use SBE=true [2020-07-01 12:52:36,780 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-07-01 12:52:36,781 INFO L138 SettingsManager]: * Use old map elimination=false [2020-07-01 12:52:36,781 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-07-01 12:52:36,781 INFO L138 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION [2020-07-01 12:52:36,781 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-07-01 12:52:36,781 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-07-01 12:52:36,781 INFO L138 SettingsManager]: * Construct termination proof for TermComp=true [2020-07-01 12:52:36,782 INFO L138 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 12:52:36,782 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-01 12:52:36,782 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-01 12:52:36,782 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-01 12:52:36,782 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-01 12:52:36,782 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-07-01 12:52:36,783 INFO L138 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE [2020-07-01 12:52:36,783 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-01 12:52:36,783 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-01 12:52:36,783 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-07-01 12:52:36,783 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-07-01 12:52:36,784 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-01 12:52:36,784 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-01 12:52:36,784 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-01 12:52:36,784 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-01 12:52:36,951 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-01 12:52:36,965 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-01 12:52:36,969 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-01 12:52:36,970 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-01 12:52:36,970 INFO L275 PluginConnector]: CDTParser initialized [2020-07-01 12:52:36,971 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox/benchmark/theBenchmark.c [2020-07-01 12:52:37,040 INFO L220 CDTParser]: Created temporary CDT project at /export/starexec/sandbox/tmp/BenchExec_run_sAZnHz/tmp/821e5f8a5460485b90c959a5fcc32bbb/FLAG79191e47f [2020-07-01 12:52:37,381 INFO L306 CDTParser]: Found 1 translation units. [2020-07-01 12:52:37,382 INFO L160 CDTParser]: Scanning /export/starexec/sandbox/benchmark/theBenchmark.c [2020-07-01 12:52:37,382 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. [2020-07-01 12:52:37,388 INFO L349 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox/tmp/BenchExec_run_sAZnHz/tmp/821e5f8a5460485b90c959a5fcc32bbb/FLAG79191e47f [2020-07-01 12:52:37,828 INFO L357 CDTParser]: Successfully deleted /export/starexec/sandbox/tmp/BenchExec_run_sAZnHz/tmp/821e5f8a5460485b90c959a5fcc32bbb [2020-07-01 12:52:37,840 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-01 12:52:37,841 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. [2020-07-01 12:52:37,842 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-01 12:52:37,842 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-01 12:52:37,846 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-01 12:52:37,847 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.07 12:52:37" (1/1) ... [2020-07-01 12:52:37,850 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@51111974 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:52:37, skipping insertion in model container [2020-07-01 12:52:37,850 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.07 12:52:37" (1/1) ... [2020-07-01 12:52:37,858 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-01 12:52:37,876 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-01 12:52:38,107 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-01 12:52:38,118 INFO L203 MainTranslator]: Completed pre-run [2020-07-01 12:52:38,136 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-01 12:52:38,151 INFO L208 MainTranslator]: Completed translation [2020-07-01 12:52:38,152 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:52:38 WrapperNode [2020-07-01 12:52:38,152 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-01 12:52:38,153 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-01 12:52:38,153 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-01 12:52:38,153 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-01 12:52:38,163 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:52:38" (1/1) ... [2020-07-01 12:52:38,171 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:52:38" (1/1) ... [2020-07-01 12:52:38,194 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-01 12:52:38,194 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-01 12:52:38,194 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-01 12:52:38,194 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-01 12:52:38,204 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:52:38" (1/1) ... [2020-07-01 12:52:38,204 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:52:38" (1/1) ... [2020-07-01 12:52:38,206 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:52:38" (1/1) ... [2020-07-01 12:52:38,206 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:52:38" (1/1) ... [2020-07-01 12:52:38,212 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:52:38" (1/1) ... [2020-07-01 12:52:38,217 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:52:38" (1/1) ... [2020-07-01 12:52:38,218 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:52:38" (1/1) ... [2020-07-01 12:52:38,220 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-01 12:52:38,220 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-01 12:52:38,221 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-01 12:52:38,221 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-01 12:52:38,222 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:52:38" (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-07-01 12:52:38,292 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-01 12:52:38,292 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-01 12:52:38,292 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-01 12:52:38,293 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-01 12:52:38,293 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-01 12:52:38,293 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-01 12:52:38,542 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-01 12:52:38,543 INFO L295 CfgBuilder]: Removed 8 assume(true) statements. [2020-07-01 12:52:38,546 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 12:52:38 BoogieIcfgContainer [2020-07-01 12:52:38,546 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-01 12:52:38,547 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- [2020-07-01 12:52:38,547 INFO L271 PluginConnector]: Initializing BlockEncodingV2... [2020-07-01 12:52:38,549 INFO L275 PluginConnector]: BlockEncodingV2 initialized [2020-07-01 12:52:38,550 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 12:52:38" (1/1) ... [2020-07-01 12:52:38,564 INFO L313 BlockEncoder]: Initial Icfg 33 locations, 38 edges [2020-07-01 12:52:38,565 INFO L258 BlockEncoder]: Using Remove infeasible edges [2020-07-01 12:52:38,566 INFO L263 BlockEncoder]: Using Maximize final states [2020-07-01 12:52:38,567 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false [2020-07-01 12:52:38,567 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE [2020-07-01 12:52:38,569 INFO L296 BlockEncoder]: Using Remove sink states [2020-07-01 12:52:38,570 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true [2020-07-01 12:52:38,570 INFO L179 BlockEncoder]: Using Rewrite not-equals [2020-07-01 12:52:38,591 INFO L185 BlockEncoder]: Using Use SBE [2020-07-01 12:52:38,619 INFO L200 BlockEncoder]: SBE split 13 edges [2020-07-01 12:52:38,624 INFO L70 emoveInfeasibleEdges]: Removed 2 edges and 0 locations because of local infeasibility [2020-07-01 12:52:38,626 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-07-01 12:52:38,651 INFO L100 BaseMinimizeStates]: Removed 14 edges and 7 locations by large block encoding [2020-07-01 12:52:38,654 INFO L70 RemoveSinkStates]: Removed 1 edges and 1 locations by removing sink states [2020-07-01 12:52:38,655 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-07-01 12:52:38,655 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-07-01 12:52:38,656 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding [2020-07-01 12:52:38,656 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states [2020-07-01 12:52:38,657 INFO L313 BlockEncoder]: Encoded RCFG 25 locations, 41 edges [2020-07-01 12:52:38,657 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 12:52:38 BasicIcfg [2020-07-01 12:52:38,657 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- [2020-07-01 12:52:38,659 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-01 12:52:38,659 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-01 12:52:38,662 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-01 12:52:38,662 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.07 12:52:37" (1/4) ... [2020-07-01 12:52:38,663 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ab2b76e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.07 12:52:38, skipping insertion in model container [2020-07-01 12:52:38,663 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:52:38" (2/4) ... [2020-07-01 12:52:38,664 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ab2b76e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.07 12:52:38, skipping insertion in model container [2020-07-01 12:52:38,664 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 12:52:38" (3/4) ... [2020-07-01 12:52:38,664 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ab2b76e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 12:52:38, skipping insertion in model container [2020-07-01 12:52:38,664 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 12:52:38" (4/4) ... [2020-07-01 12:52:38,666 INFO L109 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-07-01 12:52:38,676 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2020-07-01 12:52:38,684 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 12 error locations. [2020-07-01 12:52:38,697 INFO L251 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2020-07-01 12:52:38,721 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-01 12:52:38,721 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-01 12:52:38,722 INFO L377 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-01 12:52:38,722 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-01 12:52:38,722 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-01 12:52:38,722 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-01 12:52:38,722 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-01 12:52:38,722 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-01 12:52:38,738 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states. [2020-07-01 12:52:38,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-07-01 12:52:38,744 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:52:38,745 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2020-07-01 12:52:38,745 INFO L427 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 12:52:38,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:52:38,751 INFO L82 PathProgramCache]: Analyzing trace with hash 841575624, now seen corresponding path program 1 times [2020-07-01 12:52:38,761 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:52:38,761 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432450710] [2020-07-01 12:52:38,762 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:52:38,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:52:38,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:52:38,932 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432450710] [2020-07-01 12:52:38,933 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:52:38,933 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:52:38,934 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139456816] [2020-07-01 12:52:38,939 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:52:38,939 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:52:38,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:52:38,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:52:38,956 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 3 states. [2020-07-01 12:52:39,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:52:39,059 INFO L93 Difference]: Finished difference Result 25 states and 41 transitions. [2020-07-01 12:52:39,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:52:39,061 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2020-07-01 12:52:39,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:52:39,072 INFO L225 Difference]: With dead ends: 25 [2020-07-01 12:52:39,073 INFO L226 Difference]: Without dead ends: 19 [2020-07-01 12:52:39,076 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:52:39,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2020-07-01 12:52:39,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2020-07-01 12:52:39,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2020-07-01 12:52:39,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 29 transitions. [2020-07-01 12:52:39,111 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 29 transitions. Word has length 6 [2020-07-01 12:52:39,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:52:39,112 INFO L479 AbstractCegarLoop]: Abstraction has 19 states and 29 transitions. [2020-07-01 12:52:39,112 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:52:39,112 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 29 transitions. [2020-07-01 12:52:39,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-07-01 12:52:39,112 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:52:39,113 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2020-07-01 12:52:39,114 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-01 12:52:39,114 INFO L427 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 12:52:39,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:52:39,115 INFO L82 PathProgramCache]: Analyzing trace with hash 841575626, now seen corresponding path program 1 times [2020-07-01 12:52:39,115 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:52:39,115 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385758589] [2020-07-01 12:52:39,116 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:52:39,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:52:39,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:52:39,162 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385758589] [2020-07-01 12:52:39,162 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:52:39,162 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-01 12:52:39,163 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409277726] [2020-07-01 12:52:39,164 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-01 12:52:39,165 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:52:39,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-01 12:52:39,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-07-01 12:52:39,165 INFO L87 Difference]: Start difference. First operand 19 states and 29 transitions. Second operand 4 states. [2020-07-01 12:52:39,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:52:39,303 INFO L93 Difference]: Finished difference Result 41 states and 53 transitions. [2020-07-01 12:52:39,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-01 12:52:39,326 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2020-07-01 12:52:39,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:52:39,327 INFO L225 Difference]: With dead ends: 41 [2020-07-01 12:52:39,327 INFO L226 Difference]: Without dead ends: 35 [2020-07-01 12:52:39,328 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-07-01 12:52:39,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2020-07-01 12:52:39,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 27. [2020-07-01 12:52:39,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-07-01 12:52:39,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 45 transitions. [2020-07-01 12:52:39,335 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 45 transitions. Word has length 6 [2020-07-01 12:52:39,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:52:39,335 INFO L479 AbstractCegarLoop]: Abstraction has 27 states and 45 transitions. [2020-07-01 12:52:39,335 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-01 12:52:39,336 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 45 transitions. [2020-07-01 12:52:39,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-07-01 12:52:39,336 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:52:39,336 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2020-07-01 12:52:39,336 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-01 12:52:39,337 INFO L427 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 12:52:39,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:52:39,337 INFO L82 PathProgramCache]: Analyzing trace with hash 841575627, now seen corresponding path program 1 times [2020-07-01 12:52:39,337 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:52:39,338 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743542822] [2020-07-01 12:52:39,338 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:52:39,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:52:39,411 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:52:39,411 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743542822] [2020-07-01 12:52:39,412 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:52:39,412 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-01 12:52:39,412 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295163841] [2020-07-01 12:52:39,412 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-01 12:52:39,413 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:52:39,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-01 12:52:39,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-07-01 12:52:39,413 INFO L87 Difference]: Start difference. First operand 27 states and 45 transitions. Second operand 6 states. [2020-07-01 12:52:39,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:52:39,596 INFO L93 Difference]: Finished difference Result 35 states and 47 transitions. [2020-07-01 12:52:39,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-01 12:52:39,597 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2020-07-01 12:52:39,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:52:39,598 INFO L225 Difference]: With dead ends: 35 [2020-07-01 12:52:39,598 INFO L226 Difference]: Without dead ends: 32 [2020-07-01 12:52:39,599 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2020-07-01 12:52:39,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2020-07-01 12:52:39,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 27. [2020-07-01 12:52:39,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-07-01 12:52:39,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 42 transitions. [2020-07-01 12:52:39,604 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 42 transitions. Word has length 6 [2020-07-01 12:52:39,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:52:39,604 INFO L479 AbstractCegarLoop]: Abstraction has 27 states and 42 transitions. [2020-07-01 12:52:39,604 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-01 12:52:39,605 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 42 transitions. [2020-07-01 12:52:39,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-07-01 12:52:39,605 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:52:39,605 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:52:39,605 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-01 12:52:39,606 INFO L427 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 12:52:39,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:52:39,606 INFO L82 PathProgramCache]: Analyzing trace with hash 319039735, now seen corresponding path program 1 times [2020-07-01 12:52:39,606 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:52:39,606 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118203096] [2020-07-01 12:52:39,607 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:52:39,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:52:39,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:52:39,657 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118203096] [2020-07-01 12:52:39,657 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:52:39,658 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-01 12:52:39,658 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194471141] [2020-07-01 12:52:39,658 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-01 12:52:39,659 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:52:39,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-01 12:52:39,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-01 12:52:39,659 INFO L87 Difference]: Start difference. First operand 27 states and 42 transitions. Second operand 4 states. [2020-07-01 12:52:39,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:52:39,740 INFO L93 Difference]: Finished difference Result 33 states and 42 transitions. [2020-07-01 12:52:39,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-01 12:52:39,741 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2020-07-01 12:52:39,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:52:39,743 INFO L225 Difference]: With dead ends: 33 [2020-07-01 12:52:39,743 INFO L226 Difference]: Without dead ends: 27 [2020-07-01 12:52:39,744 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-07-01 12:52:39,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2020-07-01 12:52:39,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2020-07-01 12:52:39,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-07-01 12:52:39,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 33 transitions. [2020-07-01 12:52:39,750 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 33 transitions. Word has length 7 [2020-07-01 12:52:39,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:52:39,750 INFO L479 AbstractCegarLoop]: Abstraction has 27 states and 33 transitions. [2020-07-01 12:52:39,750 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-01 12:52:39,750 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 33 transitions. [2020-07-01 12:52:39,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-07-01 12:52:39,751 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:52:39,751 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:52:39,751 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-01 12:52:39,752 INFO L427 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 12:52:39,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:52:39,752 INFO L82 PathProgramCache]: Analyzing trace with hash 808207579, now seen corresponding path program 1 times [2020-07-01 12:52:39,752 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:52:39,753 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11510930] [2020-07-01 12:52:39,753 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:52:39,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:52:39,812 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:52:39,812 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11510930] [2020-07-01 12:52:39,813 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2011502034] [2020-07-01 12:52:39,813 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 12:52:39,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:52:39,859 INFO L264 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-01 12:52:39,865 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 12:52:39,922 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:52:39,923 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-01 12:52:39,923 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 7 [2020-07-01 12:52:39,923 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610641197] [2020-07-01 12:52:39,924 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-01 12:52:39,924 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:52:39,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-01 12:52:39,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-07-01 12:52:39,925 INFO L87 Difference]: Start difference. First operand 27 states and 33 transitions. Second operand 5 states. [2020-07-01 12:52:40,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:52:40,005 INFO L93 Difference]: Finished difference Result 30 states and 36 transitions. [2020-07-01 12:52:40,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-01 12:52:40,005 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2020-07-01 12:52:40,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:52:40,006 INFO L225 Difference]: With dead ends: 30 [2020-07-01 12:52:40,006 INFO L226 Difference]: Without dead ends: 0 [2020-07-01 12:52:40,007 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-07-01 12:52:40,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-01 12:52:40,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-01 12:52:40,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-01 12:52:40,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-01 12:52:40,008 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 11 [2020-07-01 12:52:40,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:52:40,008 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-01 12:52:40,008 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-01 12:52:40,008 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-01 12:52:40,008 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-01 12:52:40,209 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 12:52:40,212 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-01 12:52:40,355 INFO L268 CegarLoopResult]: For program point L13(line 13) no Hoare annotation was computed. [2020-07-01 12:52:40,356 INFO L268 CegarLoopResult]: For program point L13-1(line 13) no Hoare annotation was computed. [2020-07-01 12:52:40,356 INFO L268 CegarLoopResult]: For program point L11(line 11) no Hoare annotation was computed. [2020-07-01 12:52:40,356 INFO L268 CegarLoopResult]: For program point L11-1(line 11) no Hoare annotation was computed. [2020-07-01 12:52:40,356 INFO L268 CegarLoopResult]: For program point L11-2(lines 11 15) no Hoare annotation was computed. [2020-07-01 12:52:40,357 INFO L264 CegarLoopResult]: At program point L9-3(lines 9 17) the Hoare annotation is: (let ((.cse0 (select |#length| ULTIMATE.start_bubbleSort_~numbers.base))) (and (= 1 (select |#valid| ULTIMATE.start_bubbleSort_~numbers.base)) (= 0 ULTIMATE.start_bubbleSort_~numbers.offset) (<= 1 ULTIMATE.start_main_~array_size~0) (<= (+ ULTIMATE.start_bubbleSort_~i~0 4) .cse0) (<= (+ (* 4 ULTIMATE.start_bubbleSort_~i~0) 4) .cse0))) [2020-07-01 12:52:40,357 INFO L268 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-07-01 12:52:40,357 INFO L268 CegarLoopResult]: For program point L22(lines 22 24) no Hoare annotation was computed. [2020-07-01 12:52:40,357 INFO L268 CegarLoopResult]: For program point L22-2(lines 22 24) no Hoare annotation was computed. [2020-07-01 12:52:40,358 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr10REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. [2020-07-01 12:52:40,358 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr9REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. [2020-07-01 12:52:40,358 INFO L268 CegarLoopResult]: For program point L14(line 14) no Hoare annotation was computed. [2020-07-01 12:52:40,358 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr11REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. [2020-07-01 12:52:40,358 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr6REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. [2020-07-01 12:52:40,358 INFO L268 CegarLoopResult]: For program point L12(line 12) no Hoare annotation was computed. [2020-07-01 12:52:40,358 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr5REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. [2020-07-01 12:52:40,358 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr8REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. [2020-07-01 12:52:40,358 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr7REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. [2020-07-01 12:52:40,359 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr2REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. [2020-07-01 12:52:40,359 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr1REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. [2020-07-01 12:52:40,359 INFO L268 CegarLoopResult]: For program point L10-2(lines 10 16) no Hoare annotation was computed. [2020-07-01 12:52:40,359 INFO L264 CegarLoopResult]: At program point L10-3(lines 10 16) the Hoare annotation is: (let ((.cse5 (select |#length| ULTIMATE.start_bubbleSort_~numbers.base))) (let ((.cse0 (= 1 (select |#valid| ULTIMATE.start_bubbleSort_~numbers.base))) (.cse1 (= 0 ULTIMATE.start_bubbleSort_~numbers.offset)) (.cse2 (<= 1 ULTIMATE.start_main_~array_size~0)) (.cse3 (<= (+ (* 4 ULTIMATE.start_bubbleSort_~i~0) 4) .cse5)) (.cse4 (<= (+ ULTIMATE.start_bubbleSort_~i~0 4) .cse5))) (or (and .cse0 .cse1 (<= 2 ULTIMATE.start_bubbleSort_~j~0) .cse2 .cse3 .cse4) (and .cse0 .cse1 .cse2 (= 1 ULTIMATE.start_bubbleSort_~j~0) .cse3 .cse4)))) [2020-07-01 12:52:40,359 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr4REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. [2020-07-01 12:52:40,359 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr3REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. [2020-07-01 12:52:40,360 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr0REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. [2020-07-01 12:52:40,363 INFO L308 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2020-07-01 12:52:40,371 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:52:40,372 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:52:40,378 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:52:40,379 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:52:40,380 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:52:40,381 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:52:40,381 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:52:40,381 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:52:40,382 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:52:40,382 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:52:40,383 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:52:40,383 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:52:40,385 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 12:52:40 BasicIcfg [2020-07-01 12:52:40,385 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-01 12:52:40,386 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-07-01 12:52:40,386 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-07-01 12:52:40,389 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-07-01 12:52:40,390 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 12:52:40,390 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.07 12:52:37" (1/5) ... [2020-07-01 12:52:40,391 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3d40d174 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.07 12:52:40, skipping insertion in model container [2020-07-01 12:52:40,391 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 12:52:40,392 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:52:38" (2/5) ... [2020-07-01 12:52:40,392 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3d40d174 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.07 12:52:40, skipping insertion in model container [2020-07-01 12:52:40,392 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 12:52:40,392 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 12:52:38" (3/5) ... [2020-07-01 12:52:40,392 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3d40d174 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.07 12:52:40, skipping insertion in model container [2020-07-01 12:52:40,393 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 12:52:40,393 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 12:52:38" (4/5) ... [2020-07-01 12:52:40,393 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3d40d174 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.07 12:52:40, skipping insertion in model container [2020-07-01 12:52:40,393 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 12:52:40,393 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 12:52:40" (5/5) ... [2020-07-01 12:52:40,395 INFO L371 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-07-01 12:52:40,418 INFO L356 BuchiCegarLoop]: Interprodecural is true [2020-07-01 12:52:40,418 INFO L357 BuchiCegarLoop]: Hoare is true [2020-07-01 12:52:40,418 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-01 12:52:40,419 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-01 12:52:40,419 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-01 12:52:40,419 INFO L361 BuchiCegarLoop]: Difference is false [2020-07-01 12:52:40,419 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-01 12:52:40,419 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-07-01 12:52:40,423 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states. [2020-07-01 12:52:40,428 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2020-07-01 12:52:40,428 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 12:52:40,428 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 12:52:40,432 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2020-07-01 12:52:40,432 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-01 12:52:40,433 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2020-07-01 12:52:40,433 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states. [2020-07-01 12:52:40,434 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2020-07-01 12:52:40,434 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 12:52:40,434 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 12:52:40,435 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2020-07-01 12:52:40,435 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-01 12:52:40,440 INFO L794 eck$LassoCheckResult]: Stem: 23#ULTIMATE.startENTRYtrue [145] ULTIMATE.startENTRY-->L22: Formula: (and (= 0 |v_#NULL.base_2|) (= (store |v_#valid_20| 0 0) |v_#valid_19|) (< 0 |v_#StackHeapBarrier_3|) (= 0 |v_#NULL.offset_2|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_3|, #valid=|v_#valid_20|} OutVars{ULTIMATE.start_main_#t~malloc7.base=|v_ULTIMATE.start_main_#t~malloc7.base_5|, #StackHeapBarrier=|v_#StackHeapBarrier_3|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_8, ULTIMATE.start_main_~numbers~0.base=v_ULTIMATE.start_main_~numbers~0.base_3, #valid=|v_#valid_19|, ULTIMATE.start_main_~numbers~0.offset=v_ULTIMATE.start_main_~numbers~0.offset_3, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~nondet6=|v_ULTIMATE.start_main_#t~nondet6_6|, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~malloc7.offset=|v_ULTIMATE.start_main_#t~malloc7.offset_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc7.base, ULTIMATE.start_main_#res, ULTIMATE.start_main_~array_size~0, ULTIMATE.start_main_~numbers~0.base, #valid, ULTIMATE.start_main_~numbers~0.offset, #NULL.offset, ULTIMATE.start_main_#t~nondet6, #NULL.base, ULTIMATE.start_main_#t~malloc7.offset] 25#L22true [94] L22-->L22-2: Formula: (and (= v_ULTIMATE.start_main_~array_size~0_4 1) (< v_ULTIMATE.start_main_~array_size~0_5 1)) InVars {ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_5} OutVars{ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_~array_size~0] 9#L22-2true [120] L22-2-->L9-3: Formula: (and (= v_ULTIMATE.start_main_~numbers~0.offset_2 |v_ULTIMATE.start_main_#t~malloc7.offset_2|) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_#t~malloc7.base_2|) (= 0 (select |v_#valid_4| |v_ULTIMATE.start_main_#t~malloc7.base_2|)) (= |v_ULTIMATE.start_bubbleSort_#in~array_size_1| v_ULTIMATE.start_main_~array_size~0_7) (= 0 |v_ULTIMATE.start_main_#t~malloc7.offset_2|) (= v_ULTIMATE.start_main_~numbers~0.base_2 |v_ULTIMATE.start_main_#t~malloc7.base_2|) (= v_ULTIMATE.start_bubbleSort_~array_size_1 |v_ULTIMATE.start_bubbleSort_#in~array_size_1|) (= |v_ULTIMATE.start_bubbleSort_#in~numbers.offset_1| v_ULTIMATE.start_main_~numbers~0.offset_2) (= v_ULTIMATE.start_bubbleSort_~numbers.offset_1 |v_ULTIMATE.start_bubbleSort_#in~numbers.offset_1|) (= (store |v_#valid_4| |v_ULTIMATE.start_main_#t~malloc7.base_2| 1) |v_#valid_3|) (= |v_ULTIMATE.start_bubbleSort_#in~numbers.base_1| v_ULTIMATE.start_main_~numbers~0.base_2) (= v_ULTIMATE.start_bubbleSort_~numbers.base_1 |v_ULTIMATE.start_bubbleSort_#in~numbers.base_1|) (= |v_#length_1| (store |v_#length_2| |v_ULTIMATE.start_main_#t~malloc7.base_2| (* v_ULTIMATE.start_main_~array_size~0_7 4))) (= v_ULTIMATE.start_bubbleSort_~i~0_1 (+ v_ULTIMATE.start_bubbleSort_~array_size_1 (- 1))) (< |v_ULTIMATE.start_main_#t~malloc7.base_2| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_2|, #valid=|v_#valid_4|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_7} OutVars{ULTIMATE.start_main_#t~malloc7.base=|v_ULTIMATE.start_main_#t~malloc7.base_2|, ULTIMATE.start_bubbleSort_#in~array_size=|v_ULTIMATE.start_bubbleSort_#in~array_size_1|, ULTIMATE.start_bubbleSort_~i~0=v_ULTIMATE.start_bubbleSort_~i~0_1, ULTIMATE.start_bubbleSort_#in~numbers.offset=|v_ULTIMATE.start_bubbleSort_#in~numbers.offset_1|, ULTIMATE.start_main_#t~malloc7.offset=|v_ULTIMATE.start_main_#t~malloc7.offset_2|, ULTIMATE.start_bubbleSort_~numbers.base=v_ULTIMATE.start_bubbleSort_~numbers.base_1, ULTIMATE.start_bubbleSort_~temp~0=v_ULTIMATE.start_bubbleSort_~temp~0_1, ULTIMATE.start_bubbleSort_#t~mem4=|v_ULTIMATE.start_bubbleSort_#t~mem4_1|, ULTIMATE.start_bubbleSort_~numbers.offset=v_ULTIMATE.start_bubbleSort_~numbers.offset_1, ULTIMATE.start_bubbleSort_#t~mem5=|v_ULTIMATE.start_bubbleSort_#t~mem5_1|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, ULTIMATE.start_bubbleSort_#t~mem2=|v_ULTIMATE.start_bubbleSort_#t~mem2_1|, ULTIMATE.start_bubbleSort_#t~mem3=|v_ULTIMATE.start_bubbleSort_#t~mem3_1|, ULTIMATE.start_bubbleSort_#t~post1=|v_ULTIMATE.start_bubbleSort_#t~post1_1|, ULTIMATE.start_bubbleSort_#in~numbers.base=|v_ULTIMATE.start_bubbleSort_#in~numbers.base_1|, ULTIMATE.start_bubbleSort_~j~0=v_ULTIMATE.start_bubbleSort_~j~0_1, #valid=|v_#valid_3|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_7, ULTIMATE.start_main_~numbers~0.base=v_ULTIMATE.start_main_~numbers~0.base_2, ULTIMATE.start_main_~numbers~0.offset=v_ULTIMATE.start_main_~numbers~0.offset_2, #length=|v_#length_1|, ULTIMATE.start_bubbleSort_~array_size=v_ULTIMATE.start_bubbleSort_~array_size_1, ULTIMATE.start_bubbleSort_#t~post0=|v_ULTIMATE.start_bubbleSort_#t~post0_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc7.base, ULTIMATE.start_bubbleSort_#in~array_size, ULTIMATE.start_bubbleSort_~i~0, ULTIMATE.start_bubbleSort_#in~numbers.offset, ULTIMATE.start_main_#t~malloc7.offset, ULTIMATE.start_bubbleSort_~numbers.base, ULTIMATE.start_bubbleSort_~temp~0, ULTIMATE.start_bubbleSort_#t~mem4, ULTIMATE.start_bubbleSort_~numbers.offset, ULTIMATE.start_bubbleSort_#t~mem5, ULTIMATE.start_bubbleSort_#t~mem2, ULTIMATE.start_bubbleSort_#t~mem3, ULTIMATE.start_bubbleSort_#t~post1, ULTIMATE.start_bubbleSort_#in~numbers.base, ULTIMATE.start_bubbleSort_~j~0, #valid, ULTIMATE.start_main_~numbers~0.base, ULTIMATE.start_main_~numbers~0.offset, #length, ULTIMATE.start_bubbleSort_~array_size, ULTIMATE.start_bubbleSort_#t~post0] 4#L9-3true [2020-07-01 12:52:40,440 INFO L796 eck$LassoCheckResult]: Loop: 4#L9-3true [68] L9-3-->L10-3: Formula: (and (<= 0 v_ULTIMATE.start_bubbleSort_~i~0_5) (= v_ULTIMATE.start_bubbleSort_~j~0_3 1)) InVars {ULTIMATE.start_bubbleSort_~i~0=v_ULTIMATE.start_bubbleSort_~i~0_5} OutVars{ULTIMATE.start_bubbleSort_~i~0=v_ULTIMATE.start_bubbleSort_~i~0_5, ULTIMATE.start_bubbleSort_~j~0=v_ULTIMATE.start_bubbleSort_~j~0_3} AuxVars[] AssignedVars[ULTIMATE.start_bubbleSort_~j~0] 20#L10-3true [147] L10-3-->L9-3: Formula: (and (< v_ULTIMATE.start_bubbleSort_~i~0_12 v_ULTIMATE.start_bubbleSort_~j~0_20) (= (+ v_ULTIMATE.start_bubbleSort_~i~0_11 1) v_ULTIMATE.start_bubbleSort_~i~0_12)) InVars {ULTIMATE.start_bubbleSort_~i~0=v_ULTIMATE.start_bubbleSort_~i~0_12, ULTIMATE.start_bubbleSort_~j~0=v_ULTIMATE.start_bubbleSort_~j~0_20} OutVars{ULTIMATE.start_bubbleSort_~i~0=v_ULTIMATE.start_bubbleSort_~i~0_11, ULTIMATE.start_bubbleSort_~j~0=v_ULTIMATE.start_bubbleSort_~j~0_20, ULTIMATE.start_bubbleSort_#t~post0=|v_ULTIMATE.start_bubbleSort_#t~post0_4|} AuxVars[] AssignedVars[ULTIMATE.start_bubbleSort_~i~0, ULTIMATE.start_bubbleSort_#t~post0] 4#L9-3true [2020-07-01 12:52:40,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:52:40,441 INFO L82 PathProgramCache]: Analyzing trace with hash 172170, now seen corresponding path program 1 times [2020-07-01 12:52:40,441 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:52:40,442 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220292544] [2020-07-01 12:52:40,442 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:52:40,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:52:40,459 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:52:40,459 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220292544] [2020-07-01 12:52:40,460 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:52:40,460 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-07-01 12:52:40,460 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106678754] [2020-07-01 12:52:40,461 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-01 12:52:40,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:52:40,461 INFO L82 PathProgramCache]: Analyzing trace with hash 3216, now seen corresponding path program 1 times [2020-07-01 12:52:40,461 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:52:40,462 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688814533] [2020-07-01 12:52:40,462 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:52:40,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 12:52:40,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 12:52:40,483 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 12:52:40,512 INFO L210 LassoAnalysis]: Preferences: [2020-07-01 12:52:40,513 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-01 12:52:40,514 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-01 12:52:40,514 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-01 12:52:40,514 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-01 12:52:40,514 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 12:52:40,514 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-01 12:52:40,515 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-01 12:52:40,515 INFO L133 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Loop [2020-07-01 12:52:40,515 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-01 12:52:40,515 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-01 12:52:40,529 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 12:52:40,546 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 12:52:40,596 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-01 12:52:40,596 INFO L404 LassoAnalysis]: Checking for nontermination... 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-07-01 12:52:40,602 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-01 12:52:40,602 INFO L160 nArgumentSynthesizer]: Using integer mode. 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-07-01 12:52:40,640 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-01 12:52:40,640 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-01 12:52:40,679 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-07-01 12:52:40,681 INFO L210 LassoAnalysis]: Preferences: [2020-07-01 12:52:40,681 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-01 12:52:40,682 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-01 12:52:40,682 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-01 12:52:40,682 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-01 12:52:40,682 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 12:52:40,682 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-01 12:52:40,683 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-01 12:52:40,683 INFO L133 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Loop [2020-07-01 12:52:40,683 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-01 12:52:40,683 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-01 12:52:40,684 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 12:52:40,693 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 12:52:40,730 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-01 12:52:40,736 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -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:1024 -smt2 -in -t:12000 [2020-07-01 12:52:40,743 INFO L120 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-07-01 12:52:40,746 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 12:52:40,746 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-01 12:52:40,747 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 12:52:40,747 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 12:52:40,747 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 12:52:40,751 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-01 12:52:40,751 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-01 12:52:40,754 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-01 12:52:40,762 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-07-01 12:52:40,762 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -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:1024 -smt2 -in -t:12000 [2020-07-01 12:52:40,770 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-01 12:52:40,771 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-07-01 12:52:40,772 INFO L510 LassoAnalysis]: Proved termination. [2020-07-01 12:52:40,772 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_bubbleSort_~i~0) = 2*ULTIMATE.start_bubbleSort_~i~0 + 1 Supporting invariants [] [2020-07-01 12:52:40,804 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-07-01 12:52:40,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:52:40,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:52:40,848 INFO L264 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-01 12:52:40,849 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 12:52:40,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:52:40,854 WARN L262 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-01 12:52:40,855 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 12:52:40,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:52:40,883 INFO L98 LoopCannibalizer]: 2 predicates before loop cannibalization 2 predicates after loop cannibalization [2020-07-01 12:52:40,886 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 2 loop predicates [2020-07-01 12:52:40,887 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 25 states. Second operand 3 states. [2020-07-01 12:52:41,062 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 25 states.. Second operand 3 states. Result 70 states and 115 transitions. Complement of second has 4 states. [2020-07-01 12:52:41,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2020-07-01 12:52:41,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-01 12:52:41,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 78 transitions. [2020-07-01 12:52:41,065 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 78 transitions. Stem has 3 letters. Loop has 2 letters. [2020-07-01 12:52:41,066 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-01 12:52:41,066 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 78 transitions. Stem has 5 letters. Loop has 2 letters. [2020-07-01 12:52:41,067 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-01 12:52:41,067 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 78 transitions. Stem has 3 letters. Loop has 4 letters. [2020-07-01 12:52:41,067 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-01 12:52:41,076 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 70 states and 115 transitions. [2020-07-01 12:52:41,080 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 19 [2020-07-01 12:52:41,081 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 70 states to 34 states and 43 transitions. [2020-07-01 12:52:41,082 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2020-07-01 12:52:41,082 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2020-07-01 12:52:41,083 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 43 transitions. [2020-07-01 12:52:41,083 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-01 12:52:41,083 INFO L688 BuchiCegarLoop]: Abstraction has 34 states and 43 transitions. [2020-07-01 12:52:41,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 43 transitions. [2020-07-01 12:52:41,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2020-07-01 12:52:41,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2020-07-01 12:52:41,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 42 transitions. [2020-07-01 12:52:41,087 INFO L711 BuchiCegarLoop]: Abstraction has 33 states and 42 transitions. [2020-07-01 12:52:41,087 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:52:41,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:52:41,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:52:41,088 INFO L87 Difference]: Start difference. First operand 33 states and 42 transitions. Second operand 3 states. [2020-07-01 12:52:41,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:52:41,096 INFO L93 Difference]: Finished difference Result 13 states and 16 transitions. [2020-07-01 12:52:41,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:52:41,099 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 16 transitions. [2020-07-01 12:52:41,100 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2020-07-01 12:52:41,101 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 13 states and 16 transitions. [2020-07-01 12:52:41,101 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2020-07-01 12:52:41,101 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2020-07-01 12:52:41,101 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 16 transitions. [2020-07-01 12:52:41,101 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-01 12:52:41,102 INFO L688 BuchiCegarLoop]: Abstraction has 13 states and 16 transitions. [2020-07-01 12:52:41,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 16 transitions. [2020-07-01 12:52:41,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2020-07-01 12:52:41,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-01 12:52:41,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 16 transitions. [2020-07-01 12:52:41,103 INFO L711 BuchiCegarLoop]: Abstraction has 13 states and 16 transitions. [2020-07-01 12:52:41,103 INFO L591 BuchiCegarLoop]: Abstraction has 13 states and 16 transitions. [2020-07-01 12:52:41,103 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2020-07-01 12:52:41,103 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 16 transitions. [2020-07-01 12:52:41,104 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2020-07-01 12:52:41,104 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 12:52:41,104 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 12:52:41,104 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2020-07-01 12:52:41,105 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-01 12:52:41,105 INFO L794 eck$LassoCheckResult]: Stem: 187#ULTIMATE.startENTRY [145] ULTIMATE.startENTRY-->L22: Formula: (and (= 0 |v_#NULL.base_2|) (= (store |v_#valid_20| 0 0) |v_#valid_19|) (< 0 |v_#StackHeapBarrier_3|) (= 0 |v_#NULL.offset_2|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_3|, #valid=|v_#valid_20|} OutVars{ULTIMATE.start_main_#t~malloc7.base=|v_ULTIMATE.start_main_#t~malloc7.base_5|, #StackHeapBarrier=|v_#StackHeapBarrier_3|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_8, ULTIMATE.start_main_~numbers~0.base=v_ULTIMATE.start_main_~numbers~0.base_3, #valid=|v_#valid_19|, ULTIMATE.start_main_~numbers~0.offset=v_ULTIMATE.start_main_~numbers~0.offset_3, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~nondet6=|v_ULTIMATE.start_main_#t~nondet6_6|, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~malloc7.offset=|v_ULTIMATE.start_main_#t~malloc7.offset_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc7.base, ULTIMATE.start_main_#res, ULTIMATE.start_main_~array_size~0, ULTIMATE.start_main_~numbers~0.base, #valid, ULTIMATE.start_main_~numbers~0.offset, #NULL.offset, ULTIMATE.start_main_#t~nondet6, #NULL.base, ULTIMATE.start_main_#t~malloc7.offset] 188#L22 [94] L22-->L22-2: Formula: (and (= v_ULTIMATE.start_main_~array_size~0_4 1) (< v_ULTIMATE.start_main_~array_size~0_5 1)) InVars {ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_5} OutVars{ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_~array_size~0] 185#L22-2 [119] L22-2-->L9-3: Formula: (and (= v_ULTIMATE.start_main_~numbers~0.offset_2 |v_ULTIMATE.start_main_#t~malloc7.offset_2|) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_#t~malloc7.base_2|) (= 0 (select |v_#valid_4| |v_ULTIMATE.start_main_#t~malloc7.base_2|)) (= |v_ULTIMATE.start_bubbleSort_#in~array_size_1| v_ULTIMATE.start_main_~array_size~0_7) (= 0 |v_ULTIMATE.start_main_#t~malloc7.offset_2|) (= v_ULTIMATE.start_main_~numbers~0.base_2 |v_ULTIMATE.start_main_#t~malloc7.base_2|) (= v_ULTIMATE.start_bubbleSort_~array_size_1 |v_ULTIMATE.start_bubbleSort_#in~array_size_1|) (= |v_ULTIMATE.start_bubbleSort_#in~numbers.offset_1| v_ULTIMATE.start_main_~numbers~0.offset_2) (= v_ULTIMATE.start_bubbleSort_~numbers.offset_1 |v_ULTIMATE.start_bubbleSort_#in~numbers.offset_1|) (= (store |v_#valid_4| |v_ULTIMATE.start_main_#t~malloc7.base_2| 1) |v_#valid_3|) (= |v_ULTIMATE.start_bubbleSort_#in~numbers.base_1| v_ULTIMATE.start_main_~numbers~0.base_2) (= v_ULTIMATE.start_bubbleSort_~numbers.base_1 |v_ULTIMATE.start_bubbleSort_#in~numbers.base_1|) (= |v_#length_1| (store |v_#length_2| |v_ULTIMATE.start_main_#t~malloc7.base_2| (* v_ULTIMATE.start_main_~array_size~0_7 4))) (= v_ULTIMATE.start_bubbleSort_~i~0_1 (+ v_ULTIMATE.start_bubbleSort_~array_size_1 (- 1))) (> |v_ULTIMATE.start_main_#t~malloc7.base_2| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_2|, #valid=|v_#valid_4|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_7} OutVars{ULTIMATE.start_main_#t~malloc7.base=|v_ULTIMATE.start_main_#t~malloc7.base_2|, ULTIMATE.start_bubbleSort_#in~array_size=|v_ULTIMATE.start_bubbleSort_#in~array_size_1|, ULTIMATE.start_bubbleSort_~i~0=v_ULTIMATE.start_bubbleSort_~i~0_1, ULTIMATE.start_bubbleSort_#in~numbers.offset=|v_ULTIMATE.start_bubbleSort_#in~numbers.offset_1|, ULTIMATE.start_main_#t~malloc7.offset=|v_ULTIMATE.start_main_#t~malloc7.offset_2|, ULTIMATE.start_bubbleSort_~numbers.base=v_ULTIMATE.start_bubbleSort_~numbers.base_1, ULTIMATE.start_bubbleSort_~temp~0=v_ULTIMATE.start_bubbleSort_~temp~0_1, ULTIMATE.start_bubbleSort_#t~mem4=|v_ULTIMATE.start_bubbleSort_#t~mem4_1|, ULTIMATE.start_bubbleSort_~numbers.offset=v_ULTIMATE.start_bubbleSort_~numbers.offset_1, ULTIMATE.start_bubbleSort_#t~mem5=|v_ULTIMATE.start_bubbleSort_#t~mem5_1|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, ULTIMATE.start_bubbleSort_#t~mem2=|v_ULTIMATE.start_bubbleSort_#t~mem2_1|, ULTIMATE.start_bubbleSort_#t~mem3=|v_ULTIMATE.start_bubbleSort_#t~mem3_1|, ULTIMATE.start_bubbleSort_#t~post1=|v_ULTIMATE.start_bubbleSort_#t~post1_1|, ULTIMATE.start_bubbleSort_#in~numbers.base=|v_ULTIMATE.start_bubbleSort_#in~numbers.base_1|, ULTIMATE.start_bubbleSort_~j~0=v_ULTIMATE.start_bubbleSort_~j~0_1, #valid=|v_#valid_3|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_7, ULTIMATE.start_main_~numbers~0.base=v_ULTIMATE.start_main_~numbers~0.base_2, ULTIMATE.start_main_~numbers~0.offset=v_ULTIMATE.start_main_~numbers~0.offset_2, #length=|v_#length_1|, ULTIMATE.start_bubbleSort_~array_size=v_ULTIMATE.start_bubbleSort_~array_size_1, ULTIMATE.start_bubbleSort_#t~post0=|v_ULTIMATE.start_bubbleSort_#t~post0_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc7.base, ULTIMATE.start_bubbleSort_#in~array_size, ULTIMATE.start_bubbleSort_~i~0, ULTIMATE.start_bubbleSort_#in~numbers.offset, ULTIMATE.start_main_#t~malloc7.offset, ULTIMATE.start_bubbleSort_~numbers.base, ULTIMATE.start_bubbleSort_~temp~0, ULTIMATE.start_bubbleSort_#t~mem4, ULTIMATE.start_bubbleSort_~numbers.offset, ULTIMATE.start_bubbleSort_#t~mem5, ULTIMATE.start_bubbleSort_#t~mem2, ULTIMATE.start_bubbleSort_#t~mem3, ULTIMATE.start_bubbleSort_#t~post1, ULTIMATE.start_bubbleSort_#in~numbers.base, ULTIMATE.start_bubbleSort_~j~0, #valid, ULTIMATE.start_main_~numbers~0.base, ULTIMATE.start_main_~numbers~0.offset, #length, ULTIMATE.start_bubbleSort_~array_size, ULTIMATE.start_bubbleSort_#t~post0] 179#L9-3 [2020-07-01 12:52:41,105 INFO L796 eck$LassoCheckResult]: Loop: 179#L9-3 [68] L9-3-->L10-3: Formula: (and (<= 0 v_ULTIMATE.start_bubbleSort_~i~0_5) (= v_ULTIMATE.start_bubbleSort_~j~0_3 1)) InVars {ULTIMATE.start_bubbleSort_~i~0=v_ULTIMATE.start_bubbleSort_~i~0_5} OutVars{ULTIMATE.start_bubbleSort_~i~0=v_ULTIMATE.start_bubbleSort_~i~0_5, ULTIMATE.start_bubbleSort_~j~0=v_ULTIMATE.start_bubbleSort_~j~0_3} AuxVars[] AssignedVars[ULTIMATE.start_bubbleSort_~j~0] 180#L10-3 [147] L10-3-->L9-3: Formula: (and (< v_ULTIMATE.start_bubbleSort_~i~0_12 v_ULTIMATE.start_bubbleSort_~j~0_20) (= (+ v_ULTIMATE.start_bubbleSort_~i~0_11 1) v_ULTIMATE.start_bubbleSort_~i~0_12)) InVars {ULTIMATE.start_bubbleSort_~i~0=v_ULTIMATE.start_bubbleSort_~i~0_12, ULTIMATE.start_bubbleSort_~j~0=v_ULTIMATE.start_bubbleSort_~j~0_20} OutVars{ULTIMATE.start_bubbleSort_~i~0=v_ULTIMATE.start_bubbleSort_~i~0_11, ULTIMATE.start_bubbleSort_~j~0=v_ULTIMATE.start_bubbleSort_~j~0_20, ULTIMATE.start_bubbleSort_#t~post0=|v_ULTIMATE.start_bubbleSort_#t~post0_4|} AuxVars[] AssignedVars[ULTIMATE.start_bubbleSort_~i~0, ULTIMATE.start_bubbleSort_#t~post0] 179#L9-3 [2020-07-01 12:52:41,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:52:41,106 INFO L82 PathProgramCache]: Analyzing trace with hash 172169, now seen corresponding path program 1 times [2020-07-01 12:52:41,106 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:52:41,106 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835288742] [2020-07-01 12:52:41,106 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:52:41,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 12:52:41,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 12:52:41,122 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 12:52:41,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:52:41,123 INFO L82 PathProgramCache]: Analyzing trace with hash 3216, now seen corresponding path program 2 times [2020-07-01 12:52:41,123 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:52:41,123 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494986879] [2020-07-01 12:52:41,123 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:52:41,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 12:52:41,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 12:52:41,129 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 12:52:41,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:52:41,130 INFO L82 PathProgramCache]: Analyzing trace with hash 165456664, now seen corresponding path program 1 times [2020-07-01 12:52:41,130 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:52:41,130 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953450532] [2020-07-01 12:52:41,130 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:52:41,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 12:52:41,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 12:52:41,147 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 12:52:41,172 INFO L210 LassoAnalysis]: Preferences: [2020-07-01 12:52:41,172 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-01 12:52:41,172 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-01 12:52:41,172 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-01 12:52:41,173 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-01 12:52:41,173 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 12:52:41,173 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-01 12:52:41,173 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-01 12:52:41,173 INFO L133 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration2_Loop [2020-07-01 12:52:41,173 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-01 12:52:41,173 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-01 12:52:41,174 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 12:52:41,195 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 12:52:41,234 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-01 12:52:41,234 INFO L404 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-07-01 12:52:41,240 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-01 12:52:41,241 INFO L160 nArgumentSynthesizer]: Using integer mode. 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-07-01 12:52:41,277 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-01 12:52:41,278 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-01 12:52:41,315 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-07-01 12:52:41,317 INFO L210 LassoAnalysis]: Preferences: [2020-07-01 12:52:41,317 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-01 12:52:41,318 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-01 12:52:41,318 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-01 12:52:41,318 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-01 12:52:41,318 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 12:52:41,318 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-01 12:52:41,318 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-01 12:52:41,318 INFO L133 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration2_Loop [2020-07-01 12:52:41,318 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-01 12:52:41,319 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-01 12:52:41,319 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 12:52:41,322 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 12:52:41,364 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-01 12:52:41,365 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -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:1024 -smt2 -in -t:12000 [2020-07-01 12:52:41,367 INFO L120 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-07-01 12:52:41,369 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 12:52:41,370 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-01 12:52:41,370 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 12:52:41,370 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 12:52:41,370 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 12:52:41,371 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-01 12:52:41,371 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-01 12:52:41,373 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -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:1024 -smt2 -in -t:12000 [2020-07-01 12:52:41,406 INFO L120 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-07-01 12:52:41,408 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 12:52:41,408 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-01 12:52:41,408 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 12:52:41,409 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 12:52:41,409 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 12:52:41,410 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-01 12:52:41,411 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-01 12:52:41,414 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-01 12:52:41,418 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-07-01 12:52:41,418 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -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:1024 -smt2 -in -t:12000 [2020-07-01 12:52:41,421 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-01 12:52:41,421 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-07-01 12:52:41,421 INFO L510 LassoAnalysis]: Proved termination. [2020-07-01 12:52:41,421 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_bubbleSort_~i~0) = 2*ULTIMATE.start_bubbleSort_~i~0 + 1 Supporting invariants [] [2020-07-01 12:52:41,452 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-07-01 12:52:41,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:52:41,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:52:41,475 INFO L264 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-01 12:52:41,476 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 12:52:41,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:52:41,481 WARN L262 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-01 12:52:41,481 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 12:52:41,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:52:41,501 INFO L98 LoopCannibalizer]: 2 predicates before loop cannibalization 2 predicates after loop cannibalization [2020-07-01 12:52:41,501 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 2 loop predicates [2020-07-01 12:52:41,502 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 13 states and 16 transitions. cyclomatic complexity: 4 Second operand 3 states. [2020-07-01 12:52:41,520 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 13 states and 16 transitions. cyclomatic complexity: 4. Second operand 3 states. Result 24 states and 30 transitions. Complement of second has 4 states. [2020-07-01 12:52:41,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2020-07-01 12:52:41,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-01 12:52:41,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 29 transitions. [2020-07-01 12:52:41,521 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 29 transitions. Stem has 3 letters. Loop has 2 letters. [2020-07-01 12:52:41,521 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-01 12:52:41,521 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 29 transitions. Stem has 5 letters. Loop has 2 letters. [2020-07-01 12:52:41,521 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-01 12:52:41,521 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 29 transitions. Stem has 3 letters. Loop has 4 letters. [2020-07-01 12:52:41,522 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-01 12:52:41,525 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 30 transitions. [2020-07-01 12:52:41,526 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2020-07-01 12:52:41,526 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 24 states and 30 transitions. [2020-07-01 12:52:41,526 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2020-07-01 12:52:41,526 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2020-07-01 12:52:41,526 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 30 transitions. [2020-07-01 12:52:41,527 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-01 12:52:41,527 INFO L688 BuchiCegarLoop]: Abstraction has 24 states and 30 transitions. [2020-07-01 12:52:41,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 30 transitions. [2020-07-01 12:52:41,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2020-07-01 12:52:41,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-07-01 12:52:41,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 29 transitions. [2020-07-01 12:52:41,529 INFO L711 BuchiCegarLoop]: Abstraction has 23 states and 29 transitions. [2020-07-01 12:52:41,529 INFO L591 BuchiCegarLoop]: Abstraction has 23 states and 29 transitions. [2020-07-01 12:52:41,529 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2020-07-01 12:52:41,529 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 29 transitions. [2020-07-01 12:52:41,530 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2020-07-01 12:52:41,530 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 12:52:41,530 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 12:52:41,530 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-07-01 12:52:41,530 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2020-07-01 12:52:41,531 INFO L794 eck$LassoCheckResult]: Stem: 267#ULTIMATE.startENTRY [145] ULTIMATE.startENTRY-->L22: Formula: (and (= 0 |v_#NULL.base_2|) (= (store |v_#valid_20| 0 0) |v_#valid_19|) (< 0 |v_#StackHeapBarrier_3|) (= 0 |v_#NULL.offset_2|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_3|, #valid=|v_#valid_20|} OutVars{ULTIMATE.start_main_#t~malloc7.base=|v_ULTIMATE.start_main_#t~malloc7.base_5|, #StackHeapBarrier=|v_#StackHeapBarrier_3|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_8, ULTIMATE.start_main_~numbers~0.base=v_ULTIMATE.start_main_~numbers~0.base_3, #valid=|v_#valid_19|, ULTIMATE.start_main_~numbers~0.offset=v_ULTIMATE.start_main_~numbers~0.offset_3, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~nondet6=|v_ULTIMATE.start_main_#t~nondet6_6|, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~malloc7.offset=|v_ULTIMATE.start_main_#t~malloc7.offset_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc7.base, ULTIMATE.start_main_#res, ULTIMATE.start_main_~array_size~0, ULTIMATE.start_main_~numbers~0.base, #valid, ULTIMATE.start_main_~numbers~0.offset, #NULL.offset, ULTIMATE.start_main_#t~nondet6, #NULL.base, ULTIMATE.start_main_#t~malloc7.offset] 268#L22 [94] L22-->L22-2: Formula: (and (= v_ULTIMATE.start_main_~array_size~0_4 1) (< v_ULTIMATE.start_main_~array_size~0_5 1)) InVars {ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_5} OutVars{ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_~array_size~0] 264#L22-2 [119] L22-2-->L9-3: Formula: (and (= v_ULTIMATE.start_main_~numbers~0.offset_2 |v_ULTIMATE.start_main_#t~malloc7.offset_2|) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_#t~malloc7.base_2|) (= 0 (select |v_#valid_4| |v_ULTIMATE.start_main_#t~malloc7.base_2|)) (= |v_ULTIMATE.start_bubbleSort_#in~array_size_1| v_ULTIMATE.start_main_~array_size~0_7) (= 0 |v_ULTIMATE.start_main_#t~malloc7.offset_2|) (= v_ULTIMATE.start_main_~numbers~0.base_2 |v_ULTIMATE.start_main_#t~malloc7.base_2|) (= v_ULTIMATE.start_bubbleSort_~array_size_1 |v_ULTIMATE.start_bubbleSort_#in~array_size_1|) (= |v_ULTIMATE.start_bubbleSort_#in~numbers.offset_1| v_ULTIMATE.start_main_~numbers~0.offset_2) (= v_ULTIMATE.start_bubbleSort_~numbers.offset_1 |v_ULTIMATE.start_bubbleSort_#in~numbers.offset_1|) (= (store |v_#valid_4| |v_ULTIMATE.start_main_#t~malloc7.base_2| 1) |v_#valid_3|) (= |v_ULTIMATE.start_bubbleSort_#in~numbers.base_1| v_ULTIMATE.start_main_~numbers~0.base_2) (= v_ULTIMATE.start_bubbleSort_~numbers.base_1 |v_ULTIMATE.start_bubbleSort_#in~numbers.base_1|) (= |v_#length_1| (store |v_#length_2| |v_ULTIMATE.start_main_#t~malloc7.base_2| (* v_ULTIMATE.start_main_~array_size~0_7 4))) (= v_ULTIMATE.start_bubbleSort_~i~0_1 (+ v_ULTIMATE.start_bubbleSort_~array_size_1 (- 1))) (> |v_ULTIMATE.start_main_#t~malloc7.base_2| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_2|, #valid=|v_#valid_4|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_7} OutVars{ULTIMATE.start_main_#t~malloc7.base=|v_ULTIMATE.start_main_#t~malloc7.base_2|, ULTIMATE.start_bubbleSort_#in~array_size=|v_ULTIMATE.start_bubbleSort_#in~array_size_1|, ULTIMATE.start_bubbleSort_~i~0=v_ULTIMATE.start_bubbleSort_~i~0_1, ULTIMATE.start_bubbleSort_#in~numbers.offset=|v_ULTIMATE.start_bubbleSort_#in~numbers.offset_1|, ULTIMATE.start_main_#t~malloc7.offset=|v_ULTIMATE.start_main_#t~malloc7.offset_2|, ULTIMATE.start_bubbleSort_~numbers.base=v_ULTIMATE.start_bubbleSort_~numbers.base_1, ULTIMATE.start_bubbleSort_~temp~0=v_ULTIMATE.start_bubbleSort_~temp~0_1, ULTIMATE.start_bubbleSort_#t~mem4=|v_ULTIMATE.start_bubbleSort_#t~mem4_1|, ULTIMATE.start_bubbleSort_~numbers.offset=v_ULTIMATE.start_bubbleSort_~numbers.offset_1, ULTIMATE.start_bubbleSort_#t~mem5=|v_ULTIMATE.start_bubbleSort_#t~mem5_1|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, ULTIMATE.start_bubbleSort_#t~mem2=|v_ULTIMATE.start_bubbleSort_#t~mem2_1|, ULTIMATE.start_bubbleSort_#t~mem3=|v_ULTIMATE.start_bubbleSort_#t~mem3_1|, ULTIMATE.start_bubbleSort_#t~post1=|v_ULTIMATE.start_bubbleSort_#t~post1_1|, ULTIMATE.start_bubbleSort_#in~numbers.base=|v_ULTIMATE.start_bubbleSort_#in~numbers.base_1|, ULTIMATE.start_bubbleSort_~j~0=v_ULTIMATE.start_bubbleSort_~j~0_1, #valid=|v_#valid_3|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_7, ULTIMATE.start_main_~numbers~0.base=v_ULTIMATE.start_main_~numbers~0.base_2, ULTIMATE.start_main_~numbers~0.offset=v_ULTIMATE.start_main_~numbers~0.offset_2, #length=|v_#length_1|, ULTIMATE.start_bubbleSort_~array_size=v_ULTIMATE.start_bubbleSort_~array_size_1, ULTIMATE.start_bubbleSort_#t~post0=|v_ULTIMATE.start_bubbleSort_#t~post0_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc7.base, ULTIMATE.start_bubbleSort_#in~array_size, ULTIMATE.start_bubbleSort_~i~0, ULTIMATE.start_bubbleSort_#in~numbers.offset, ULTIMATE.start_main_#t~malloc7.offset, ULTIMATE.start_bubbleSort_~numbers.base, ULTIMATE.start_bubbleSort_~temp~0, ULTIMATE.start_bubbleSort_#t~mem4, ULTIMATE.start_bubbleSort_~numbers.offset, ULTIMATE.start_bubbleSort_#t~mem5, ULTIMATE.start_bubbleSort_#t~mem2, ULTIMATE.start_bubbleSort_#t~mem3, ULTIMATE.start_bubbleSort_#t~post1, ULTIMATE.start_bubbleSort_#in~numbers.base, ULTIMATE.start_bubbleSort_~j~0, #valid, ULTIMATE.start_main_~numbers~0.base, ULTIMATE.start_main_~numbers~0.offset, #length, ULTIMATE.start_bubbleSort_~array_size, ULTIMATE.start_bubbleSort_#t~post0] 252#L9-3 [68] L9-3-->L10-3: Formula: (and (<= 0 v_ULTIMATE.start_bubbleSort_~i~0_5) (= v_ULTIMATE.start_bubbleSort_~j~0_3 1)) InVars {ULTIMATE.start_bubbleSort_~i~0=v_ULTIMATE.start_bubbleSort_~i~0_5} OutVars{ULTIMATE.start_bubbleSort_~i~0=v_ULTIMATE.start_bubbleSort_~i~0_5, ULTIMATE.start_bubbleSort_~j~0=v_ULTIMATE.start_bubbleSort_~j~0_3} AuxVars[] AssignedVars[ULTIMATE.start_bubbleSort_~j~0] 254#L10-3 [2020-07-01 12:52:41,531 INFO L796 eck$LassoCheckResult]: Loop: 254#L10-3 [84] L10-3-->L11: Formula: (<= v_ULTIMATE.start_bubbleSort_~j~0_5 v_ULTIMATE.start_bubbleSort_~i~0_7) InVars {ULTIMATE.start_bubbleSort_~i~0=v_ULTIMATE.start_bubbleSort_~i~0_7, ULTIMATE.start_bubbleSort_~j~0=v_ULTIMATE.start_bubbleSort_~j~0_5} OutVars{ULTIMATE.start_bubbleSort_~i~0=v_ULTIMATE.start_bubbleSort_~i~0_7, ULTIMATE.start_bubbleSort_~j~0=v_ULTIMATE.start_bubbleSort_~j~0_5} AuxVars[] AssignedVars[] 256#L11 [90] L11-->L11-1: Formula: (let ((.cse0 (+ v_ULTIMATE.start_bubbleSort_~numbers.offset_3 (* 4 v_ULTIMATE.start_bubbleSort_~j~0_6)))) (and (= 1 (select |v_#valid_5| v_ULTIMATE.start_bubbleSort_~numbers.base_3)) (<= 4 .cse0) (= (select (select |v_#memory_int_1| v_ULTIMATE.start_bubbleSort_~numbers.base_3) (+ v_ULTIMATE.start_bubbleSort_~numbers.offset_3 (* v_ULTIMATE.start_bubbleSort_~j~0_6 4) (- 4))) |v_ULTIMATE.start_bubbleSort_#t~mem2_2|) (<= .cse0 (select |v_#length_3| v_ULTIMATE.start_bubbleSort_~numbers.base_3)))) InVars {ULTIMATE.start_bubbleSort_~numbers.offset=v_ULTIMATE.start_bubbleSort_~numbers.offset_3, ULTIMATE.start_bubbleSort_~j~0=v_ULTIMATE.start_bubbleSort_~j~0_6, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_1|, #length=|v_#length_3|, ULTIMATE.start_bubbleSort_~numbers.base=v_ULTIMATE.start_bubbleSort_~numbers.base_3} OutVars{ULTIMATE.start_bubbleSort_~numbers.offset=v_ULTIMATE.start_bubbleSort_~numbers.offset_3, ULTIMATE.start_bubbleSort_#t~mem2=|v_ULTIMATE.start_bubbleSort_#t~mem2_2|, ULTIMATE.start_bubbleSort_~j~0=v_ULTIMATE.start_bubbleSort_~j~0_6, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_1|, #length=|v_#length_3|, ULTIMATE.start_bubbleSort_~numbers.base=v_ULTIMATE.start_bubbleSort_~numbers.base_3} AuxVars[] AssignedVars[ULTIMATE.start_bubbleSort_#t~mem2] 265#L11-1 [86] L11-1-->L11-2: Formula: (let ((.cse0 (* 4 v_ULTIMATE.start_bubbleSort_~j~0_8))) (and (= (select (select |v_#memory_int_2| v_ULTIMATE.start_bubbleSort_~numbers.base_6) (+ v_ULTIMATE.start_bubbleSort_~numbers.offset_5 (* v_ULTIMATE.start_bubbleSort_~j~0_8 4))) |v_ULTIMATE.start_bubbleSort_#t~mem3_2|) (= 1 (select |v_#valid_7| v_ULTIMATE.start_bubbleSort_~numbers.base_6)) (<= (+ v_ULTIMATE.start_bubbleSort_~numbers.offset_5 .cse0 4) (select |v_#length_5| v_ULTIMATE.start_bubbleSort_~numbers.base_6)) (<= 0 (+ v_ULTIMATE.start_bubbleSort_~numbers.offset_5 .cse0)))) InVars {ULTIMATE.start_bubbleSort_~numbers.offset=v_ULTIMATE.start_bubbleSort_~numbers.offset_5, ULTIMATE.start_bubbleSort_~j~0=v_ULTIMATE.start_bubbleSort_~j~0_8, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_2|, #length=|v_#length_5|, ULTIMATE.start_bubbleSort_~numbers.base=v_ULTIMATE.start_bubbleSort_~numbers.base_6} OutVars{ULTIMATE.start_bubbleSort_~numbers.offset=v_ULTIMATE.start_bubbleSort_~numbers.offset_5, ULTIMATE.start_bubbleSort_#t~mem3=|v_ULTIMATE.start_bubbleSort_#t~mem3_2|, ULTIMATE.start_bubbleSort_~j~0=v_ULTIMATE.start_bubbleSort_~j~0_8, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_2|, #length=|v_#length_5|, ULTIMATE.start_bubbleSort_~numbers.base=v_ULTIMATE.start_bubbleSort_~numbers.base_6} AuxVars[] AssignedVars[ULTIMATE.start_bubbleSort_#t~mem3] 260#L11-2 [110] L11-2-->L10-2: Formula: (>= |v_ULTIMATE.start_bubbleSort_#t~mem3_6| |v_ULTIMATE.start_bubbleSort_#t~mem2_6|) InVars {ULTIMATE.start_bubbleSort_#t~mem2=|v_ULTIMATE.start_bubbleSort_#t~mem2_6|, ULTIMATE.start_bubbleSort_#t~mem3=|v_ULTIMATE.start_bubbleSort_#t~mem3_6|} OutVars{ULTIMATE.start_bubbleSort_#t~mem2=|v_ULTIMATE.start_bubbleSort_#t~mem2_5|, ULTIMATE.start_bubbleSort_#t~mem3=|v_ULTIMATE.start_bubbleSort_#t~mem3_5|} AuxVars[] AssignedVars[ULTIMATE.start_bubbleSort_#t~mem2, ULTIMATE.start_bubbleSort_#t~mem3] 258#L10-2 [85] L10-2-->L10-3: Formula: (= (+ v_ULTIMATE.start_bubbleSort_~j~0_19 1) v_ULTIMATE.start_bubbleSort_~j~0_18) InVars {ULTIMATE.start_bubbleSort_~j~0=v_ULTIMATE.start_bubbleSort_~j~0_19} OutVars{ULTIMATE.start_bubbleSort_#t~post1=|v_ULTIMATE.start_bubbleSort_#t~post1_2|, ULTIMATE.start_bubbleSort_~j~0=v_ULTIMATE.start_bubbleSort_~j~0_18} AuxVars[] AssignedVars[ULTIMATE.start_bubbleSort_#t~post1, ULTIMATE.start_bubbleSort_~j~0] 254#L10-3 [2020-07-01 12:52:41,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:52:41,532 INFO L82 PathProgramCache]: Analyzing trace with hash 5337307, now seen corresponding path program 1 times [2020-07-01 12:52:41,532 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:52:41,532 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900101530] [2020-07-01 12:52:41,532 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:52:41,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 12:52:41,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 12:52:41,546 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 12:52:41,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:52:41,547 INFO L82 PathProgramCache]: Analyzing trace with hash 108972246, now seen corresponding path program 1 times [2020-07-01 12:52:41,547 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:52:41,547 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440748066] [2020-07-01 12:52:41,548 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:52:41,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 12:52:41,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 12:52:41,559 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 12:52:41,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:52:41,560 INFO L82 PathProgramCache]: Analyzing trace with hash 596889660, now seen corresponding path program 1 times [2020-07-01 12:52:41,560 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:52:41,560 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454103199] [2020-07-01 12:52:41,560 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:52:41,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:52:41,612 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:52:41,612 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454103199] [2020-07-01 12:52:41,612 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:52:41,613 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-01 12:52:41,613 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020451807] [2020-07-01 12:52:41,686 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:52:41,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-01 12:52:41,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-07-01 12:52:41,686 INFO L87 Difference]: Start difference. First operand 23 states and 29 transitions. cyclomatic complexity: 8 Second operand 5 states. [2020-07-01 12:52:41,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:52:41,771 INFO L93 Difference]: Finished difference Result 28 states and 35 transitions. [2020-07-01 12:52:41,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-01 12:52:41,774 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 35 transitions. [2020-07-01 12:52:41,775 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2020-07-01 12:52:41,776 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 23 states and 28 transitions. [2020-07-01 12:52:41,776 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2020-07-01 12:52:41,776 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2020-07-01 12:52:41,776 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 28 transitions. [2020-07-01 12:52:41,776 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-01 12:52:41,776 INFO L688 BuchiCegarLoop]: Abstraction has 23 states and 28 transitions. [2020-07-01 12:52:41,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 28 transitions. [2020-07-01 12:52:41,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2020-07-01 12:52:41,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-07-01 12:52:41,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 28 transitions. [2020-07-01 12:52:41,779 INFO L711 BuchiCegarLoop]: Abstraction has 23 states and 28 transitions. [2020-07-01 12:52:41,779 INFO L591 BuchiCegarLoop]: Abstraction has 23 states and 28 transitions. [2020-07-01 12:52:41,779 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2020-07-01 12:52:41,779 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 28 transitions. [2020-07-01 12:52:41,779 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2020-07-01 12:52:41,780 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 12:52:41,780 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 12:52:41,780 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-07-01 12:52:41,780 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2020-07-01 12:52:41,781 INFO L794 eck$LassoCheckResult]: Stem: 332#ULTIMATE.startENTRY [145] ULTIMATE.startENTRY-->L22: Formula: (and (= 0 |v_#NULL.base_2|) (= (store |v_#valid_20| 0 0) |v_#valid_19|) (< 0 |v_#StackHeapBarrier_3|) (= 0 |v_#NULL.offset_2|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_3|, #valid=|v_#valid_20|} OutVars{ULTIMATE.start_main_#t~malloc7.base=|v_ULTIMATE.start_main_#t~malloc7.base_5|, #StackHeapBarrier=|v_#StackHeapBarrier_3|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_8, ULTIMATE.start_main_~numbers~0.base=v_ULTIMATE.start_main_~numbers~0.base_3, #valid=|v_#valid_19|, ULTIMATE.start_main_~numbers~0.offset=v_ULTIMATE.start_main_~numbers~0.offset_3, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~nondet6=|v_ULTIMATE.start_main_#t~nondet6_6|, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~malloc7.offset=|v_ULTIMATE.start_main_#t~malloc7.offset_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc7.base, ULTIMATE.start_main_#res, ULTIMATE.start_main_~array_size~0, ULTIMATE.start_main_~numbers~0.base, #valid, ULTIMATE.start_main_~numbers~0.offset, #NULL.offset, ULTIMATE.start_main_#t~nondet6, #NULL.base, ULTIMATE.start_main_#t~malloc7.offset] 333#L22 [102] L22-->L22-2: Formula: (>= v_ULTIMATE.start_main_~array_size~0_6 1) InVars {ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_6} OutVars{ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_6} AuxVars[] AssignedVars[] 329#L22-2 [119] L22-2-->L9-3: Formula: (and (= v_ULTIMATE.start_main_~numbers~0.offset_2 |v_ULTIMATE.start_main_#t~malloc7.offset_2|) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_#t~malloc7.base_2|) (= 0 (select |v_#valid_4| |v_ULTIMATE.start_main_#t~malloc7.base_2|)) (= |v_ULTIMATE.start_bubbleSort_#in~array_size_1| v_ULTIMATE.start_main_~array_size~0_7) (= 0 |v_ULTIMATE.start_main_#t~malloc7.offset_2|) (= v_ULTIMATE.start_main_~numbers~0.base_2 |v_ULTIMATE.start_main_#t~malloc7.base_2|) (= v_ULTIMATE.start_bubbleSort_~array_size_1 |v_ULTIMATE.start_bubbleSort_#in~array_size_1|) (= |v_ULTIMATE.start_bubbleSort_#in~numbers.offset_1| v_ULTIMATE.start_main_~numbers~0.offset_2) (= v_ULTIMATE.start_bubbleSort_~numbers.offset_1 |v_ULTIMATE.start_bubbleSort_#in~numbers.offset_1|) (= (store |v_#valid_4| |v_ULTIMATE.start_main_#t~malloc7.base_2| 1) |v_#valid_3|) (= |v_ULTIMATE.start_bubbleSort_#in~numbers.base_1| v_ULTIMATE.start_main_~numbers~0.base_2) (= v_ULTIMATE.start_bubbleSort_~numbers.base_1 |v_ULTIMATE.start_bubbleSort_#in~numbers.base_1|) (= |v_#length_1| (store |v_#length_2| |v_ULTIMATE.start_main_#t~malloc7.base_2| (* v_ULTIMATE.start_main_~array_size~0_7 4))) (= v_ULTIMATE.start_bubbleSort_~i~0_1 (+ v_ULTIMATE.start_bubbleSort_~array_size_1 (- 1))) (> |v_ULTIMATE.start_main_#t~malloc7.base_2| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_2|, #valid=|v_#valid_4|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_7} OutVars{ULTIMATE.start_main_#t~malloc7.base=|v_ULTIMATE.start_main_#t~malloc7.base_2|, ULTIMATE.start_bubbleSort_#in~array_size=|v_ULTIMATE.start_bubbleSort_#in~array_size_1|, ULTIMATE.start_bubbleSort_~i~0=v_ULTIMATE.start_bubbleSort_~i~0_1, ULTIMATE.start_bubbleSort_#in~numbers.offset=|v_ULTIMATE.start_bubbleSort_#in~numbers.offset_1|, ULTIMATE.start_main_#t~malloc7.offset=|v_ULTIMATE.start_main_#t~malloc7.offset_2|, ULTIMATE.start_bubbleSort_~numbers.base=v_ULTIMATE.start_bubbleSort_~numbers.base_1, ULTIMATE.start_bubbleSort_~temp~0=v_ULTIMATE.start_bubbleSort_~temp~0_1, ULTIMATE.start_bubbleSort_#t~mem4=|v_ULTIMATE.start_bubbleSort_#t~mem4_1|, ULTIMATE.start_bubbleSort_~numbers.offset=v_ULTIMATE.start_bubbleSort_~numbers.offset_1, ULTIMATE.start_bubbleSort_#t~mem5=|v_ULTIMATE.start_bubbleSort_#t~mem5_1|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, ULTIMATE.start_bubbleSort_#t~mem2=|v_ULTIMATE.start_bubbleSort_#t~mem2_1|, ULTIMATE.start_bubbleSort_#t~mem3=|v_ULTIMATE.start_bubbleSort_#t~mem3_1|, ULTIMATE.start_bubbleSort_#t~post1=|v_ULTIMATE.start_bubbleSort_#t~post1_1|, ULTIMATE.start_bubbleSort_#in~numbers.base=|v_ULTIMATE.start_bubbleSort_#in~numbers.base_1|, ULTIMATE.start_bubbleSort_~j~0=v_ULTIMATE.start_bubbleSort_~j~0_1, #valid=|v_#valid_3|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_7, ULTIMATE.start_main_~numbers~0.base=v_ULTIMATE.start_main_~numbers~0.base_2, ULTIMATE.start_main_~numbers~0.offset=v_ULTIMATE.start_main_~numbers~0.offset_2, #length=|v_#length_1|, ULTIMATE.start_bubbleSort_~array_size=v_ULTIMATE.start_bubbleSort_~array_size_1, ULTIMATE.start_bubbleSort_#t~post0=|v_ULTIMATE.start_bubbleSort_#t~post0_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc7.base, ULTIMATE.start_bubbleSort_#in~array_size, ULTIMATE.start_bubbleSort_~i~0, ULTIMATE.start_bubbleSort_#in~numbers.offset, ULTIMATE.start_main_#t~malloc7.offset, ULTIMATE.start_bubbleSort_~numbers.base, ULTIMATE.start_bubbleSort_~temp~0, ULTIMATE.start_bubbleSort_#t~mem4, ULTIMATE.start_bubbleSort_~numbers.offset, ULTIMATE.start_bubbleSort_#t~mem5, ULTIMATE.start_bubbleSort_#t~mem2, ULTIMATE.start_bubbleSort_#t~mem3, ULTIMATE.start_bubbleSort_#t~post1, ULTIMATE.start_bubbleSort_#in~numbers.base, ULTIMATE.start_bubbleSort_~j~0, #valid, ULTIMATE.start_main_~numbers~0.base, ULTIMATE.start_main_~numbers~0.offset, #length, ULTIMATE.start_bubbleSort_~array_size, ULTIMATE.start_bubbleSort_#t~post0] 317#L9-3 [68] L9-3-->L10-3: Formula: (and (<= 0 v_ULTIMATE.start_bubbleSort_~i~0_5) (= v_ULTIMATE.start_bubbleSort_~j~0_3 1)) InVars {ULTIMATE.start_bubbleSort_~i~0=v_ULTIMATE.start_bubbleSort_~i~0_5} OutVars{ULTIMATE.start_bubbleSort_~i~0=v_ULTIMATE.start_bubbleSort_~i~0_5, ULTIMATE.start_bubbleSort_~j~0=v_ULTIMATE.start_bubbleSort_~j~0_3} AuxVars[] AssignedVars[ULTIMATE.start_bubbleSort_~j~0] 319#L10-3 [2020-07-01 12:52:41,781 INFO L796 eck$LassoCheckResult]: Loop: 319#L10-3 [84] L10-3-->L11: Formula: (<= v_ULTIMATE.start_bubbleSort_~j~0_5 v_ULTIMATE.start_bubbleSort_~i~0_7) InVars {ULTIMATE.start_bubbleSort_~i~0=v_ULTIMATE.start_bubbleSort_~i~0_7, ULTIMATE.start_bubbleSort_~j~0=v_ULTIMATE.start_bubbleSort_~j~0_5} OutVars{ULTIMATE.start_bubbleSort_~i~0=v_ULTIMATE.start_bubbleSort_~i~0_7, ULTIMATE.start_bubbleSort_~j~0=v_ULTIMATE.start_bubbleSort_~j~0_5} AuxVars[] AssignedVars[] 321#L11 [90] L11-->L11-1: Formula: (let ((.cse0 (+ v_ULTIMATE.start_bubbleSort_~numbers.offset_3 (* 4 v_ULTIMATE.start_bubbleSort_~j~0_6)))) (and (= 1 (select |v_#valid_5| v_ULTIMATE.start_bubbleSort_~numbers.base_3)) (<= 4 .cse0) (= (select (select |v_#memory_int_1| v_ULTIMATE.start_bubbleSort_~numbers.base_3) (+ v_ULTIMATE.start_bubbleSort_~numbers.offset_3 (* v_ULTIMATE.start_bubbleSort_~j~0_6 4) (- 4))) |v_ULTIMATE.start_bubbleSort_#t~mem2_2|) (<= .cse0 (select |v_#length_3| v_ULTIMATE.start_bubbleSort_~numbers.base_3)))) InVars {ULTIMATE.start_bubbleSort_~numbers.offset=v_ULTIMATE.start_bubbleSort_~numbers.offset_3, ULTIMATE.start_bubbleSort_~j~0=v_ULTIMATE.start_bubbleSort_~j~0_6, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_1|, #length=|v_#length_3|, ULTIMATE.start_bubbleSort_~numbers.base=v_ULTIMATE.start_bubbleSort_~numbers.base_3} OutVars{ULTIMATE.start_bubbleSort_~numbers.offset=v_ULTIMATE.start_bubbleSort_~numbers.offset_3, ULTIMATE.start_bubbleSort_#t~mem2=|v_ULTIMATE.start_bubbleSort_#t~mem2_2|, ULTIMATE.start_bubbleSort_~j~0=v_ULTIMATE.start_bubbleSort_~j~0_6, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_1|, #length=|v_#length_3|, ULTIMATE.start_bubbleSort_~numbers.base=v_ULTIMATE.start_bubbleSort_~numbers.base_3} AuxVars[] AssignedVars[ULTIMATE.start_bubbleSort_#t~mem2] 330#L11-1 [86] L11-1-->L11-2: Formula: (let ((.cse0 (* 4 v_ULTIMATE.start_bubbleSort_~j~0_8))) (and (= (select (select |v_#memory_int_2| v_ULTIMATE.start_bubbleSort_~numbers.base_6) (+ v_ULTIMATE.start_bubbleSort_~numbers.offset_5 (* v_ULTIMATE.start_bubbleSort_~j~0_8 4))) |v_ULTIMATE.start_bubbleSort_#t~mem3_2|) (= 1 (select |v_#valid_7| v_ULTIMATE.start_bubbleSort_~numbers.base_6)) (<= (+ v_ULTIMATE.start_bubbleSort_~numbers.offset_5 .cse0 4) (select |v_#length_5| v_ULTIMATE.start_bubbleSort_~numbers.base_6)) (<= 0 (+ v_ULTIMATE.start_bubbleSort_~numbers.offset_5 .cse0)))) InVars {ULTIMATE.start_bubbleSort_~numbers.offset=v_ULTIMATE.start_bubbleSort_~numbers.offset_5, ULTIMATE.start_bubbleSort_~j~0=v_ULTIMATE.start_bubbleSort_~j~0_8, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_2|, #length=|v_#length_5|, ULTIMATE.start_bubbleSort_~numbers.base=v_ULTIMATE.start_bubbleSort_~numbers.base_6} OutVars{ULTIMATE.start_bubbleSort_~numbers.offset=v_ULTIMATE.start_bubbleSort_~numbers.offset_5, ULTIMATE.start_bubbleSort_#t~mem3=|v_ULTIMATE.start_bubbleSort_#t~mem3_2|, ULTIMATE.start_bubbleSort_~j~0=v_ULTIMATE.start_bubbleSort_~j~0_8, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_2|, #length=|v_#length_5|, ULTIMATE.start_bubbleSort_~numbers.base=v_ULTIMATE.start_bubbleSort_~numbers.base_6} AuxVars[] AssignedVars[ULTIMATE.start_bubbleSort_#t~mem3] 325#L11-2 [110] L11-2-->L10-2: Formula: (>= |v_ULTIMATE.start_bubbleSort_#t~mem3_6| |v_ULTIMATE.start_bubbleSort_#t~mem2_6|) InVars {ULTIMATE.start_bubbleSort_#t~mem2=|v_ULTIMATE.start_bubbleSort_#t~mem2_6|, ULTIMATE.start_bubbleSort_#t~mem3=|v_ULTIMATE.start_bubbleSort_#t~mem3_6|} OutVars{ULTIMATE.start_bubbleSort_#t~mem2=|v_ULTIMATE.start_bubbleSort_#t~mem2_5|, ULTIMATE.start_bubbleSort_#t~mem3=|v_ULTIMATE.start_bubbleSort_#t~mem3_5|} AuxVars[] AssignedVars[ULTIMATE.start_bubbleSort_#t~mem2, ULTIMATE.start_bubbleSort_#t~mem3] 323#L10-2 [85] L10-2-->L10-3: Formula: (= (+ v_ULTIMATE.start_bubbleSort_~j~0_19 1) v_ULTIMATE.start_bubbleSort_~j~0_18) InVars {ULTIMATE.start_bubbleSort_~j~0=v_ULTIMATE.start_bubbleSort_~j~0_19} OutVars{ULTIMATE.start_bubbleSort_#t~post1=|v_ULTIMATE.start_bubbleSort_#t~post1_2|, ULTIMATE.start_bubbleSort_~j~0=v_ULTIMATE.start_bubbleSort_~j~0_18} AuxVars[] AssignedVars[ULTIMATE.start_bubbleSort_#t~post1, ULTIMATE.start_bubbleSort_~j~0] 319#L10-3 [2020-07-01 12:52:41,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:52:41,781 INFO L82 PathProgramCache]: Analyzing trace with hash 5344995, now seen corresponding path program 1 times [2020-07-01 12:52:41,781 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:52:41,782 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256464781] [2020-07-01 12:52:41,782 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:52:41,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 12:52:41,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 12:52:41,794 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 12:52:41,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:52:41,795 INFO L82 PathProgramCache]: Analyzing trace with hash 108972246, now seen corresponding path program 2 times [2020-07-01 12:52:41,795 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:52:41,795 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270316917] [2020-07-01 12:52:41,795 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:52:41,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 12:52:41,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 12:52:41,804 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 12:52:41,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:52:41,805 INFO L82 PathProgramCache]: Analyzing trace with hash 1654470452, now seen corresponding path program 1 times [2020-07-01 12:52:41,805 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:52:41,805 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203460507] [2020-07-01 12:52:41,805 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:52:41,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 12:52:41,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 12:52:41,826 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 12:52:42,011 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 52 [2020-07-01 12:52:42,067 INFO L210 LassoAnalysis]: Preferences: [2020-07-01 12:52:42,067 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-01 12:52:42,067 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-01 12:52:42,067 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-01 12:52:42,067 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-01 12:52:42,067 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 12:52:42,067 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-01 12:52:42,068 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-01 12:52:42,068 INFO L133 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration4_Lasso [2020-07-01 12:52:42,068 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-01 12:52:42,068 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-01 12:52:42,071 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 12:52:42,074 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 12:52:42,255 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 12:52:42,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-07-01 12:52:42,260 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 12:52:42,262 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 12:52:42,264 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 12:52:42,266 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 12:52:42,268 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 12:52:42,270 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 12:52:42,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-07-01 12:52:42,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-07-01 12:52:42,505 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-01 12:52:42,506 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -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:1024 -smt2 -in -t:12000 [2020-07-01 12:52:42,514 INFO L120 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-07-01 12:52:42,516 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 12:52:42,517 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-01 12:52:42,517 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 12:52:42,517 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 12:52:42,517 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 12:52:42,518 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-01 12:52:42,518 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-01 12:52:42,519 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -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:1024 -smt2 -in -t:12000 [2020-07-01 12:52:42,552 INFO L120 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-07-01 12:52:42,554 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 12:52:42,554 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 12:52:42,554 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 12:52:42,554 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 12:52:42,559 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-01 12:52:42,559 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-01 12:52:42,565 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -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:1024 -smt2 -in -t:12000 [2020-07-01 12:52:42,598 INFO L120 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-07-01 12:52:42,599 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 12:52:42,599 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-01 12:52:42,600 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 12:52:42,600 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 12:52:42,600 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 12:52:42,601 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-01 12:52:42,601 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-01 12:52:42,603 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 12:52:42,636 INFO L120 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-07-01 12:52:42,638 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 12:52:42,638 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 12:52:42,639 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 12:52:42,639 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 12:52:42,643 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-01 12:52:42,643 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-01 12:52:42,651 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 12:52:42,683 INFO L120 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-07-01 12:52:42,685 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 12:52:42,686 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 12:52:42,686 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 12:52:42,686 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 12:52:42,695 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-01 12:52:42,696 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-01 12:52:42,712 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-01 12:52:42,728 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2020-07-01 12:52:42,728 INFO L444 ModelExtractionUtils]: 24 out of 37 variables were initially zero. Simplification set additionally 9 variables to zero. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 12:52:42,733 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-01 12:52:42,736 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-07-01 12:52:42,737 INFO L510 LassoAnalysis]: Proved termination. [2020-07-01 12:52:42,737 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_bubbleSort_~numbers.offset, ULTIMATE.start_bubbleSort_~i~0, ULTIMATE.start_bubbleSort_~j~0) = 1*ULTIMATE.start_bubbleSort_~numbers.offset + 12*ULTIMATE.start_bubbleSort_~i~0 - 8*ULTIMATE.start_bubbleSort_~j~0 Supporting invariants [] [2020-07-01 12:52:42,779 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2020-07-01 12:52:42,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:52:42,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:52:42,802 INFO L264 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-01 12:52:42,802 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 12:52:42,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:52:42,809 INFO L264 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-01 12:52:42,810 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 12:52:42,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:52:42,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:52:42,866 INFO L264 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-01 12:52:42,867 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 12:52:42,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:52:42,972 INFO L264 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-01 12:52:42,972 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 12:52:43,032 INFO L98 LoopCannibalizer]: 3 predicates before loop cannibalization 5 predicates after loop cannibalization [2020-07-01 12:52:43,032 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-07-01 12:52:43,032 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 23 states and 28 transitions. cyclomatic complexity: 7 Second operand 4 states. [2020-07-01 12:52:43,227 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 23 states and 28 transitions. cyclomatic complexity: 7. Second operand 4 states. Result 48 states and 59 transitions. Complement of second has 11 states. [2020-07-01 12:52:43,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 1 stem states 4 non-accepting loop states 2 accepting loop states [2020-07-01 12:52:43,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-01 12:52:43,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 30 transitions. [2020-07-01 12:52:43,229 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 30 transitions. Stem has 4 letters. Loop has 5 letters. [2020-07-01 12:52:43,229 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-01 12:52:43,229 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 30 transitions. Stem has 9 letters. Loop has 5 letters. [2020-07-01 12:52:43,229 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-01 12:52:43,230 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 30 transitions. Stem has 4 letters. Loop has 10 letters. [2020-07-01 12:52:43,230 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-01 12:52:43,233 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 48 states and 59 transitions. [2020-07-01 12:52:43,234 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-01 12:52:43,234 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 48 states to 0 states and 0 transitions. [2020-07-01 12:52:43,235 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-07-01 12:52:43,235 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-07-01 12:52:43,235 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-07-01 12:52:43,235 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-01 12:52:43,235 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-01 12:52:43,235 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-01 12:52:43,235 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-01 12:52:43,235 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2020-07-01 12:52:43,235 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-07-01 12:52:43,236 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-01 12:52:43,236 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-01 12:52:43,242 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.07 12:52:43 BasicIcfg [2020-07-01 12:52:43,242 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-07-01 12:52:43,243 INFO L168 Benchmark]: Toolchain (without parser) took 5402.43 ms. Allocated memory was 649.6 MB in the beginning and 773.8 MB in the end (delta: 124.3 MB). Free memory was 562.7 MB in the beginning and 694.4 MB in the end (delta: -131.7 MB). There was no memory consumed. Max. memory is 50.3 GB. [2020-07-01 12:52:43,243 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 649.6 MB. Free memory is still 584.3 MB. There was no memory consumed. Max. memory is 50.3 GB. [2020-07-01 12:52:43,244 INFO L168 Benchmark]: CACSL2BoogieTranslator took 310.52 ms. Allocated memory was 649.6 MB in the beginning and 684.7 MB in the end (delta: 35.1 MB). Free memory was 562.7 MB in the beginning and 646.7 MB in the end (delta: -84.0 MB). Peak memory consumption was 28.5 MB. Max. memory is 50.3 GB. [2020-07-01 12:52:43,245 INFO L168 Benchmark]: Boogie Procedure Inliner took 41.04 ms. Allocated memory is still 684.7 MB. Free memory was 646.7 MB in the beginning and 644.0 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 50.3 GB. [2020-07-01 12:52:43,245 INFO L168 Benchmark]: Boogie Preprocessor took 25.94 ms. Allocated memory is still 684.7 MB. Free memory was 644.0 MB in the beginning and 642.7 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. [2020-07-01 12:52:43,246 INFO L168 Benchmark]: RCFGBuilder took 326.09 ms. Allocated memory is still 684.7 MB. Free memory was 642.7 MB in the beginning and 619.2 MB in the end (delta: 23.5 MB). Peak memory consumption was 23.5 MB. Max. memory is 50.3 GB. [2020-07-01 12:52:43,246 INFO L168 Benchmark]: BlockEncodingV2 took 110.72 ms. Allocated memory is still 684.7 MB. Free memory was 619.2 MB in the beginning and 609.8 MB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 50.3 GB. [2020-07-01 12:52:43,247 INFO L168 Benchmark]: TraceAbstraction took 1726.50 ms. Allocated memory is still 684.7 MB. Free memory was 609.8 MB in the beginning and 455.1 MB in the end (delta: 154.7 MB). Peak memory consumption was 154.7 MB. Max. memory is 50.3 GB. [2020-07-01 12:52:43,247 INFO L168 Benchmark]: BuchiAutomizer took 2856.26 ms. Allocated memory was 684.7 MB in the beginning and 773.8 MB in the end (delta: 89.1 MB). Free memory was 455.1 MB in the beginning and 694.4 MB in the end (delta: -239.3 MB). There was no memory consumed. Max. memory is 50.3 GB. [2020-07-01 12:52:43,250 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 33 locations, 38 edges - StatisticsResult: Encoded RCFG 25 locations, 41 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 649.6 MB. Free memory is still 584.3 MB. There was no memory consumed. Max. memory is 50.3 GB. * CACSL2BoogieTranslator took 310.52 ms. Allocated memory was 649.6 MB in the beginning and 684.7 MB in the end (delta: 35.1 MB). Free memory was 562.7 MB in the beginning and 646.7 MB in the end (delta: -84.0 MB). Peak memory consumption was 28.5 MB. Max. memory is 50.3 GB. * Boogie Procedure Inliner took 41.04 ms. Allocated memory is still 684.7 MB. Free memory was 646.7 MB in the beginning and 644.0 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 50.3 GB. * Boogie Preprocessor took 25.94 ms. Allocated memory is still 684.7 MB. Free memory was 644.0 MB in the beginning and 642.7 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. * RCFGBuilder took 326.09 ms. Allocated memory is still 684.7 MB. Free memory was 642.7 MB in the beginning and 619.2 MB in the end (delta: 23.5 MB). Peak memory consumption was 23.5 MB. Max. memory is 50.3 GB. * BlockEncodingV2 took 110.72 ms. Allocated memory is still 684.7 MB. Free memory was 619.2 MB in the beginning and 609.8 MB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 50.3 GB. * TraceAbstraction took 1726.50 ms. Allocated memory is still 684.7 MB. Free memory was 609.8 MB in the beginning and 455.1 MB in the end (delta: 154.7 MB). Peak memory consumption was 154.7 MB. Max. memory is 50.3 GB. * BuchiAutomizer took 2856.26 ms. Allocated memory was 684.7 MB in the beginning and 773.8 MB in the end (delta: 89.1 MB). Free memory was 455.1 MB in the beginning and 694.4 MB in the end (delta: -239.3 MB). There was no memory consumed. Max. memory is 50.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 13]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 11]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 13]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 14]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 11]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 12]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 14]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 12]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 13]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 11]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 13]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 11]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 12 specifications checked. All of them hold - InvariantResult [Line: 9]: Loop Invariant [2020-07-01 12:52:43,259 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:52:43,259 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:52:43,260 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:52:43,260 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: (((1 == \valid[numbers] && 0 == numbers) && 1 <= array_size) && i + 4 <= unknown-#length-unknown[numbers]) && 4 * i + 4 <= unknown-#length-unknown[numbers] - InvariantResult [Line: 10]: Loop Invariant [2020-07-01 12:52:43,261 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:52:43,261 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:52:43,261 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:52:43,262 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:52:43,262 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:52:43,263 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:52:43,263 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:52:43,263 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: (((((1 == \valid[numbers] && 0 == numbers) && 2 <= j) && 1 <= array_size) && 4 * i + 4 <= unknown-#length-unknown[numbers]) && i + 4 <= unknown-#length-unknown[numbers]) || (((((1 == \valid[numbers] && 0 == numbers) && 1 <= array_size) && 1 == j) && 4 * i + 4 <= unknown-#length-unknown[numbers]) && i + 4 <= unknown-#length-unknown[numbers]) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 25 locations, 12 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 1.4s, OverallIterations: 5, TraceHistogramMax: 2, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 25 SDtfs, 226 SDslu, 28 SDs, 0 SdLazy, 219 SolverSat, 46 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 31 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=27occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 13 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 2 LocationsWithAnnotation, 2 PreInvPairs, 5 NumberOfFragments, 91 HoareAnnotationTreeSize, 2 FomulaSimplifications, 252 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 2 FomulaSimplificationsInter, 12 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 47 NumberOfCodeBlocks, 47 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 41 ConstructedInterpolants, 0 QuantifiedInterpolants, 1799 SizeOfPredicates, 3 NumberOfNonLiveVariables, 56 ConjunctsInSsa, 7 ConjunctsInUnsatCore, 6 InterpolantComputations, 5 PerfectInterpolantSequences, 2/4 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (2 trivial, 0 deterministic, 3 nondeterministic). One nondeterministic module has affine ranking function 2 * i + 1 and consists of 3 locations. One nondeterministic module has affine ranking function 2 * i + 1 and consists of 3 locations. One nondeterministic module has affine ranking function numbers + 12 * i + -8 * j and consists of 7 locations. 2 modules have a trivial ranking function, the largest among these consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.8s and 5 iterations. TraceHistogramMax:1. Analysis of lassos took 1.8s. Construction of modules took 0.2s. Büchi inclusion checks took 0.6s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 2 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 23 states and ocurred in iteration 2. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 81 SDtfs, 204 SDslu, 70 SDs, 0 SdLazy, 180 SolverSat, 13 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT1 conc1 concLT0 SILN0 SILU0 SILI0 SILT1 lasso1 LassoPreprocessingBenchmarks: Lassos: inital38 mio100 ax100 hnf100 lsp99 ukn98 mio100 lsp93 div100 bol100 ite100 ukn100 eq167 hnf91 smp89 dnf100 smp100 tf107 neg100 sie106 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 15ms VariablesStem: 2 VariablesLoop: 2 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 2 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.1s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! !SESSION 2020-07-01 12:52:34.538 ----------------------------------------------- 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/BenchExec_run_sAZnHz/tmp -i /export/starexec/sandbox/benchmark/theBenchmark.c !ENTRY org.eclipse.core.resources 2 10035 2020-07-01 12:52:43.488 !MESSAGE The workspace will exit with unsaved changes in this session. Received shutdown request... Ultimate: GTK+ Version Check