YES Ultimate: Cannot open display: This is Ultimate 0.1.24-8dc7c08-m [2020-06-21 22:29:53,646 INFO L170 SettingsManager]: Resetting all preferences to default values... [2020-06-21 22:29:53,648 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2020-06-21 22:29:53,659 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-06-21 22:29:53,659 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-06-21 22:29:53,660 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-06-21 22:29:53,661 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-06-21 22:29:53,663 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2020-06-21 22:29:53,665 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-06-21 22:29:53,665 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-06-21 22:29:53,666 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-06-21 22:29:53,666 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-06-21 22:29:53,667 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-06-21 22:29:53,668 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-06-21 22:29:53,669 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-06-21 22:29:53,670 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-06-21 22:29:53,671 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-06-21 22:29:53,672 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-06-21 22:29:53,674 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2020-06-21 22:29:53,676 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-06-21 22:29:53,677 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-06-21 22:29:53,678 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-06-21 22:29:53,680 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-06-21 22:29:53,680 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-06-21 22:29:53,680 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-06-21 22:29:53,681 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-06-21 22:29:53,682 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-06-21 22:29:53,682 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-06-21 22:29:53,683 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-06-21 22:29:53,683 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-06-21 22:29:53,684 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-06-21 22:29:53,685 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2020-06-21 22:29:53,686 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-06-21 22:29:53,686 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2020-06-21 22:29:53,686 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-06-21 22:29:53,687 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-06-21 22:29:53,687 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2020-06-21 22:29:53,688 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2020-06-21 22:29:53,688 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2020-06-21 22:29:53,689 INFO L98 SettingsManager]: Beginning loading settings from /export/starexec/sandbox/solver/bin/./../termcomp2017.epf [2020-06-21 22:29:53,703 INFO L110 SettingsManager]: Loading preferences was successful [2020-06-21 22:29:53,703 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2020-06-21 22:29:53,704 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-06-21 22:29:53,705 INFO L133 SettingsManager]: * Rewrite not-equals=true [2020-06-21 22:29:53,705 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2020-06-21 22:29:53,705 INFO L133 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE [2020-06-21 22:29:53,705 INFO L133 SettingsManager]: * Use SBE=true [2020-06-21 22:29:53,705 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-06-21 22:29:53,705 INFO L133 SettingsManager]: * Use old map elimination=false [2020-06-21 22:29:53,706 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2020-06-21 22:29:53,706 INFO L133 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION [2020-06-21 22:29:53,706 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2020-06-21 22:29:53,706 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-06-21 22:29:53,706 INFO L133 SettingsManager]: * Construct termination proof for TermComp=true [2020-06-21 22:29:53,706 INFO L133 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-21 22:29:53,707 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-06-21 22:29:53,707 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-06-21 22:29:53,707 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2020-06-21 22:29:53,707 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2020-06-21 22:29:53,707 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-06-21 22:29:53,707 INFO L133 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE [2020-06-21 22:29:53,708 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-06-21 22:29:53,708 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-06-21 22:29:53,708 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-06-21 22:29:53,708 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-06-21 22:29:53,708 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-06-21 22:29:53,709 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-06-21 22:29:53,709 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2020-06-21 22:29:53,709 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-06-21 22:29:53,734 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-06-21 22:29:53,747 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-06-21 22:29:53,750 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-06-21 22:29:53,752 INFO L271 PluginConnector]: Initializing CDTParser... [2020-06-21 22:29:53,752 INFO L276 PluginConnector]: CDTParser initialized [2020-06-21 22:29:53,753 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox/benchmark/theBenchmark.c [2020-06-21 22:29:53,821 INFO L221 CDTParser]: Created temporary CDT project at /export/starexec/sandbox/tmp/ba488ca382734306ae202469acd0f55b/FLAG474380bfb [2020-06-21 22:29:54,165 INFO L307 CDTParser]: Found 1 translation units. [2020-06-21 22:29:54,166 INFO L161 CDTParser]: Scanning /export/starexec/sandbox/benchmark/theBenchmark.c [2020-06-21 22:29:54,166 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. [2020-06-21 22:29:54,173 INFO L355 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox/tmp/ba488ca382734306ae202469acd0f55b/FLAG474380bfb [2020-06-21 22:29:54,612 INFO L363 CDTParser]: Successfully deleted /export/starexec/sandbox/tmp/ba488ca382734306ae202469acd0f55b [2020-06-21 22:29:54,624 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-06-21 22:29:54,625 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. [2020-06-21 22:29:54,626 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-06-21 22:29:54,626 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-06-21 22:29:54,630 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2020-06-21 22:29:54,631 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.06 10:29:54" (1/1) ... [2020-06-21 22:29:54,634 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7bfeae03 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.06 10:29:54, skipping insertion in model container [2020-06-21 22:29:54,634 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.06 10:29:54" (1/1) ... [2020-06-21 22:29:54,641 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-06-21 22:29:54,658 INFO L176 MainTranslator]: Built tables and reachable declarations [2020-06-21 22:29:54,811 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-06-21 22:29:54,878 INFO L191 MainTranslator]: Completed pre-run [2020-06-21 22:29:54,893 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-06-21 22:29:54,909 INFO L195 MainTranslator]: Completed translation [2020-06-21 22:29:54,909 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.06 10:29:54 WrapperNode [2020-06-21 22:29:54,909 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-06-21 22:29:54,910 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-06-21 22:29:54,910 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-06-21 22:29:54,910 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2020-06-21 22:29:54,919 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.06 10:29:54" (1/1) ... [2020-06-21 22:29:54,927 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.06 10:29:54" (1/1) ... [2020-06-21 22:29:54,946 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-06-21 22:29:54,946 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-06-21 22:29:54,946 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-06-21 22:29:54,947 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2020-06-21 22:29:54,956 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.06 10:29:54" (1/1) ... [2020-06-21 22:29:54,956 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.06 10:29:54" (1/1) ... [2020-06-21 22:29:54,957 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.06 10:29:54" (1/1) ... [2020-06-21 22:29:54,958 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.06 10:29:54" (1/1) ... [2020-06-21 22:29:54,961 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.06 10:29:54" (1/1) ... [2020-06-21 22:29:54,965 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.06 10:29:54" (1/1) ... [2020-06-21 22:29:54,966 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.06 10:29:54" (1/1) ... [2020-06-21 22:29:54,967 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-06-21 22:29:54,967 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-06-21 22:29:54,968 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-06-21 22:29:54,968 INFO L276 PluginConnector]: RCFGBuilder initialized [2020-06-21 22:29:54,968 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.06 10:29:54" (1/1) ... No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-06-21 22:29:55,032 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-06-21 22:29:55,032 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-06-21 22:29:55,032 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-06-21 22:29:55,032 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-06-21 22:29:55,032 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-06-21 22:29:55,205 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-06-21 22:29:55,206 INFO L286 CfgBuilder]: Removed 5 assue(true) statements. [2020-06-21 22:29:55,207 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.06 10:29:55 BoogieIcfgContainer [2020-06-21 22:29:55,207 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-06-21 22:29:55,208 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- [2020-06-21 22:29:55,208 INFO L271 PluginConnector]: Initializing BlockEncodingV2... [2020-06-21 22:29:55,210 INFO L276 PluginConnector]: BlockEncodingV2 initialized [2020-06-21 22:29:55,211 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.06 10:29:55" (1/1) ... [2020-06-21 22:29:55,226 INFO L313 BlockEncoder]: Initial Icfg 18 locations, 19 edges [2020-06-21 22:29:55,227 INFO L258 BlockEncoder]: Using Remove infeasible edges [2020-06-21 22:29:55,228 INFO L263 BlockEncoder]: Using Maximize final states [2020-06-21 22:29:55,228 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false [2020-06-21 22:29:55,229 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE [2020-06-21 22:29:55,231 INFO L296 BlockEncoder]: Using Remove sink states [2020-06-21 22:29:55,232 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true [2020-06-21 22:29:55,232 INFO L179 BlockEncoder]: Using Rewrite not-equals [2020-06-21 22:29:55,249 INFO L185 BlockEncoder]: Using Use SBE [2020-06-21 22:29:55,267 INFO L200 BlockEncoder]: SBE split 7 edges [2020-06-21 22:29:55,272 INFO L70 emoveInfeasibleEdges]: Removed 1 edges and 0 locations because of local infeasibility [2020-06-21 22:29:55,273 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-06-21 22:29:55,293 INFO L100 BaseMinimizeStates]: Removed 10 edges and 5 locations by large block encoding [2020-06-21 22:29:55,296 INFO L70 RemoveSinkStates]: Removed 1 edges and 1 locations by removing sink states [2020-06-21 22:29:55,297 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-06-21 22:29:55,297 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-06-21 22:29:55,303 INFO L100 BaseMinimizeStates]: Removed 2 edges and 1 locations by large block encoding [2020-06-21 22:29:55,303 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states [2020-06-21 22:29:55,304 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-06-21 22:29:55,304 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-06-21 22:29:55,304 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding [2020-06-21 22:29:55,305 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states [2020-06-21 22:29:55,305 INFO L313 BlockEncoder]: Encoded RCFG 11 locations, 18 edges [2020-06-21 22:29:55,306 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 21.06 10:29:55 BasicIcfg [2020-06-21 22:29:55,306 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- [2020-06-21 22:29:55,307 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-06-21 22:29:55,307 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-06-21 22:29:55,310 INFO L276 PluginConnector]: TraceAbstraction initialized [2020-06-21 22:29:55,311 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.06 10:29:54" (1/4) ... [2020-06-21 22:29:55,312 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51d03a5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.06 10:29:55, skipping insertion in model container [2020-06-21 22:29:55,312 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.06 10:29:54" (2/4) ... [2020-06-21 22:29:55,312 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51d03a5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.06 10:29:55, skipping insertion in model container [2020-06-21 22:29:55,313 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.06 10:29:55" (3/4) ... [2020-06-21 22:29:55,313 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51d03a5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.06 10:29:55, skipping insertion in model container [2020-06-21 22:29:55,313 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 21.06 10:29:55" (4/4) ... [2020-06-21 22:29:55,315 INFO L112 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-06-21 22:29:55,326 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2020-06-21 22:29:55,335 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2020-06-21 22:29:55,354 INFO L257 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-06-21 22:29:55,383 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2020-06-21 22:29:55,383 INFO L382 AbstractCegarLoop]: Interprodecural is true [2020-06-21 22:29:55,384 INFO L383 AbstractCegarLoop]: Hoare is true [2020-06-21 22:29:55,384 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2020-06-21 22:29:55,384 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-06-21 22:29:55,384 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-06-21 22:29:55,384 INFO L387 AbstractCegarLoop]: Difference is false [2020-06-21 22:29:55,384 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-06-21 22:29:55,385 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-06-21 22:29:55,399 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states. [2020-06-21 22:29:55,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-06-21 22:29:55,406 INFO L394 BasicCegarLoop]: Found error trace [2020-06-21 22:29:55,407 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-06-21 22:29:55,407 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-06-21 22:29:55,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-21 22:29:55,413 INFO L82 PathProgramCache]: Analyzing trace with hash 68135, now seen corresponding path program 1 times [2020-06-21 22:29:55,415 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-21 22:29:55,415 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-21 22:29:55,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-21 22:29:55,467 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-21 22:29:55,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-21 22:29:55,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-21 22:29:55,568 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-21 22:29:55,571 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-21 22:29:55,571 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-21 22:29:55,575 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-21 22:29:55,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-21 22:29:55,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-21 22:29:55,593 INFO L87 Difference]: Start difference. First operand 11 states. Second operand 3 states. [2020-06-21 22:29:55,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-21 22:29:55,655 INFO L93 Difference]: Finished difference Result 11 states and 18 transitions. [2020-06-21 22:29:55,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-21 22:29:55,657 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-06-21 22:29:55,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-21 22:29:55,668 INFO L225 Difference]: With dead ends: 11 [2020-06-21 22:29:55,669 INFO L226 Difference]: Without dead ends: 8 [2020-06-21 22:29:55,672 INFO L631 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-06-21 22:29:55,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2020-06-21 22:29:55,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2020-06-21 22:29:55,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-06-21 22:29:55,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 12 transitions. [2020-06-21 22:29:55,706 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 12 transitions. Word has length 3 [2020-06-21 22:29:55,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-21 22:29:55,707 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 12 transitions. [2020-06-21 22:29:55,707 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-21 22:29:55,707 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 12 transitions. [2020-06-21 22:29:55,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-06-21 22:29:55,707 INFO L394 BasicCegarLoop]: Found error trace [2020-06-21 22:29:55,707 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-06-21 22:29:55,708 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-06-21 22:29:55,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-21 22:29:55,708 INFO L82 PathProgramCache]: Analyzing trace with hash 68137, now seen corresponding path program 1 times [2020-06-21 22:29:55,708 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-21 22:29:55,708 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-21 22:29:55,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-21 22:29:55,710 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-21 22:29:55,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-21 22:29:55,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-21 22:29:55,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-21 22:29:55,746 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-21 22:29:55,746 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-21 22:29:55,747 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-21 22:29:55,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-21 22:29:55,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-21 22:29:55,748 INFO L87 Difference]: Start difference. First operand 8 states and 12 transitions. Second operand 3 states. [2020-06-21 22:29:55,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-21 22:29:55,771 INFO L93 Difference]: Finished difference Result 8 states and 12 transitions. [2020-06-21 22:29:55,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-21 22:29:55,771 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-06-21 22:29:55,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-21 22:29:55,772 INFO L225 Difference]: With dead ends: 8 [2020-06-21 22:29:55,772 INFO L226 Difference]: Without dead ends: 0 [2020-06-21 22:29:55,773 INFO L631 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-06-21 22:29:55,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-06-21 22:29:55,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-06-21 22:29:55,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-06-21 22:29:55,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-06-21 22:29:55,774 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 3 [2020-06-21 22:29:55,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-21 22:29:55,774 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-21 22:29:55,774 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-21 22:29:55,775 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-06-21 22:29:55,775 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-06-21 22:29:55,779 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-06-21 22:29:55,797 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2020-06-21 22:29:55,797 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-06-21 22:29:55,797 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr4REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. [2020-06-21 22:29:55,797 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr5REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. [2020-06-21 22:29:55,797 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. [2020-06-21 22:29:55,797 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr3REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. [2020-06-21 22:29:55,797 INFO L448 ceAbstractionStarter]: For program point L13(line 13) no Hoare annotation was computed. [2020-06-21 22:29:55,798 INFO L448 ceAbstractionStarter]: For program point L13-2(line 13) no Hoare annotation was computed. [2020-06-21 22:29:55,798 INFO L444 ceAbstractionStarter]: At program point L12-3(lines 12 14) the Hoare annotation is: (and (= 0 ULTIMATE.start_main_~p~0.offset) (= 1 (select |#valid| ULTIMATE.start_main_~p~0.base)) (= 4 (select |#length| ULTIMATE.start_main_~p~0.base))) [2020-06-21 22:29:55,798 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. [2020-06-21 22:29:55,798 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. [2020-06-21 22:29:55,799 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2020-06-21 22:29:55,806 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-21 22:29:55,812 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-21 22:29:55,814 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.06 10:29:55 BasicIcfg [2020-06-21 22:29:55,814 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-06-21 22:29:55,814 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-06-21 22:29:55,815 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-06-21 22:29:55,818 INFO L276 PluginConnector]: BuchiAutomizer initialized [2020-06-21 22:29:55,818 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-21 22:29:55,818 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 21.06 10:29:54" (1/5) ... [2020-06-21 22:29:55,819 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1379d21b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.06 10:29:55, skipping insertion in model container [2020-06-21 22:29:55,819 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-21 22:29:55,819 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.06 10:29:54" (2/5) ... [2020-06-21 22:29:55,820 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1379d21b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.06 10:29:55, skipping insertion in model container [2020-06-21 22:29:55,820 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-21 22:29:55,820 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.06 10:29:55" (3/5) ... [2020-06-21 22:29:55,820 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1379d21b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 21.06 10:29:55, skipping insertion in model container [2020-06-21 22:29:55,820 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-21 22:29:55,820 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 21.06 10:29:55" (4/5) ... [2020-06-21 22:29:55,821 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1379d21b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 21.06 10:29:55, skipping insertion in model container [2020-06-21 22:29:55,821 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-21 22:29:55,821 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.06 10:29:55" (5/5) ... [2020-06-21 22:29:55,822 INFO L375 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-06-21 22:29:55,844 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2020-06-21 22:29:55,846 INFO L374 BuchiCegarLoop]: Interprodecural is true [2020-06-21 22:29:55,846 INFO L375 BuchiCegarLoop]: Hoare is true [2020-06-21 22:29:55,846 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-06-21 22:29:55,846 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-06-21 22:29:55,846 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-06-21 22:29:55,846 INFO L379 BuchiCegarLoop]: Difference is false [2020-06-21 22:29:55,846 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-06-21 22:29:55,847 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-06-21 22:29:55,850 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states. [2020-06-21 22:29:55,855 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-06-21 22:29:55,855 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-21 22:29:55,855 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-21 22:29:55,859 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-06-21 22:29:55,859 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-06-21 22:29:55,859 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2020-06-21 22:29:55,860 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states. [2020-06-21 22:29:55,861 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-06-21 22:29:55,861 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-21 22:29:55,861 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-21 22:29:55,861 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-06-21 22:29:55,861 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-06-21 22:29:55,866 INFO L794 eck$LassoCheckResult]: Stem: 5#ULTIMATE.startENTRYtrue [38] ULTIMATE.startENTRY-->L-1: Formula: (and (= |v_#NULL.offset_1| 0) (= |v_#NULL.base_1| 0) (= |v_#valid_1| (store |v_#valid_2| 0 0))) InVars {#valid=|v_#valid_2|} OutVars{#NULL.offset=|v_#NULL.offset_1|, #NULL.base=|v_#NULL.base_1|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid, #NULL.offset, #NULL.base] 3#L-1true [58] L-1-->L12-3: Formula: (and (< |v_ULTIMATE.start_main_#t~malloc0.base_1| 0) (= 0 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= (select |v_#valid_4| |v_ULTIMATE.start_main_#t~malloc0.base_1|) 0) (< |v_#StackHeapBarrier_1| |v_ULTIMATE.start_main_#t~malloc0.base_1|) (= (store |v_#length_2| |v_ULTIMATE.start_main_#t~malloc0.base_1| 4) |v_#length_1|) (= v_ULTIMATE.start_main_~p~0.base_1 |v_ULTIMATE.start_main_#t~malloc0.base_1|) (= v_ULTIMATE.start_main_~p~0.offset_1 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= |v_#valid_3| (store |v_#valid_4| |v_ULTIMATE.start_main_#t~malloc0.base_1| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_4|} OutVars{ULTIMATE.start_main_#t~malloc0.base=|v_ULTIMATE.start_main_#t~malloc0.base_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_~p~0.base=v_ULTIMATE.start_main_~p~0.base_1, ULTIMATE.start_main_#t~post3=|v_ULTIMATE.start_main_#t~post3_1|, ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_1|, ULTIMATE.start_main_#t~mem1=|v_ULTIMATE.start_main_#t~mem1_1|, #length=|v_#length_1|, ULTIMATE.start_main_#t~malloc0.offset=|v_ULTIMATE.start_main_#t~malloc0.offset_1|, ULTIMATE.start_main_~p~0.offset=v_ULTIMATE.start_main_~p~0.offset_1} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc0.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_~p~0.base, ULTIMATE.start_main_#t~post3, ULTIMATE.start_main_#t~mem2, ULTIMATE.start_main_#t~mem1, #length, ULTIMATE.start_main_#t~malloc0.offset, ULTIMATE.start_main_~p~0.offset] 12#L12-3true [2020-06-21 22:29:55,867 INFO L796 eck$LassoCheckResult]: Loop: 12#L12-3true [76] L12-3-->L13: Formula: (and (<= 0 v_ULTIMATE.start_main_~p~0.offset_12) (<= (+ v_ULTIMATE.start_main_~p~0.offset_12 4) (select |v_#length_11| v_ULTIMATE.start_main_~p~0.base_15)) (<= 0 (select (select |v_#memory_int_8| v_ULTIMATE.start_main_~p~0.base_15) v_ULTIMATE.start_main_~p~0.offset_12)) (= (select |v_#valid_13| v_ULTIMATE.start_main_~p~0.base_15) 1)) InVars {#valid=|v_#valid_13|, ULTIMATE.start_main_~p~0.base=v_ULTIMATE.start_main_~p~0.base_15, #memory_int=|v_#memory_int_8|, #length=|v_#length_11|, ULTIMATE.start_main_~p~0.offset=v_ULTIMATE.start_main_~p~0.offset_12} OutVars{#valid=|v_#valid_13|, ULTIMATE.start_main_~p~0.base=v_ULTIMATE.start_main_~p~0.base_15, #memory_int=|v_#memory_int_8|, ULTIMATE.start_main_#t~mem1=|v_ULTIMATE.start_main_#t~mem1_13|, #length=|v_#length_11|, ULTIMATE.start_main_~p~0.offset=v_ULTIMATE.start_main_~p~0.offset_12} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem1] 10#L13true [72] L13-->L13-2: Formula: (and (= 1 (select |v_#valid_11| v_ULTIMATE.start_main_~p~0.base_13)) (<= (+ v_ULTIMATE.start_main_~p~0.offset_10 4) (select |v_#length_9| v_ULTIMATE.start_main_~p~0.base_13)) (<= 0 v_ULTIMATE.start_main_~p~0.offset_10) (= |v_ULTIMATE.start_main_#t~post3_5| |v_ULTIMATE.start_main_#t~mem2_5|) (= (select (select |v_#memory_int_5| v_ULTIMATE.start_main_~p~0.base_13) v_ULTIMATE.start_main_~p~0.offset_10) |v_ULTIMATE.start_main_#t~mem2_5|)) InVars {#valid=|v_#valid_11|, ULTIMATE.start_main_~p~0.base=v_ULTIMATE.start_main_~p~0.base_13, #memory_int=|v_#memory_int_5|, #length=|v_#length_9|, ULTIMATE.start_main_~p~0.offset=v_ULTIMATE.start_main_~p~0.offset_10} OutVars{#valid=|v_#valid_11|, ULTIMATE.start_main_#t~post3=|v_ULTIMATE.start_main_#t~post3_5|, ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_5|, ULTIMATE.start_main_~p~0.base=v_ULTIMATE.start_main_~p~0.base_13, #memory_int=|v_#memory_int_5|, #length=|v_#length_9|, ULTIMATE.start_main_~p~0.offset=v_ULTIMATE.start_main_~p~0.offset_10} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post3, ULTIMATE.start_main_#t~mem2] 6#L13-2true [75] L13-2-->L12-3: Formula: (and (<= (+ v_ULTIMATE.start_main_~p~0.offset_11 4) (select |v_#length_10| v_ULTIMATE.start_main_~p~0.base_14)) (= 1 (select |v_#valid_12| v_ULTIMATE.start_main_~p~0.base_14)) (<= 0 v_ULTIMATE.start_main_~p~0.offset_11) (= |v_#memory_int_6| (store |v_#memory_int_7| v_ULTIMATE.start_main_~p~0.base_14 (store (select |v_#memory_int_7| v_ULTIMATE.start_main_~p~0.base_14) v_ULTIMATE.start_main_~p~0.offset_11 (+ |v_ULTIMATE.start_main_#t~post3_7| (- 1)))))) InVars {#valid=|v_#valid_12|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_main_#t~post3=|v_ULTIMATE.start_main_#t~post3_7|, ULTIMATE.start_main_~p~0.base=v_ULTIMATE.start_main_~p~0.base_14, #length=|v_#length_10|, ULTIMATE.start_main_~p~0.offset=v_ULTIMATE.start_main_~p~0.offset_11} OutVars{#valid=|v_#valid_12|, ULTIMATE.start_main_#t~post3=|v_ULTIMATE.start_main_#t~post3_6|, ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_6|, #memory_int=|v_#memory_int_6|, ULTIMATE.start_main_~p~0.base=v_ULTIMATE.start_main_~p~0.base_14, #length=|v_#length_10|, ULTIMATE.start_main_~p~0.offset=v_ULTIMATE.start_main_~p~0.offset_11} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post3, ULTIMATE.start_main_#t~mem2, #memory_int] 12#L12-3true [2020-06-21 22:29:55,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-21 22:29:55,868 INFO L82 PathProgramCache]: Analyzing trace with hash 2197, now seen corresponding path program 1 times [2020-06-21 22:29:55,868 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-21 22:29:55,868 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-21 22:29:55,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-21 22:29:55,870 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-21 22:29:55,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-21 22:29:55,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-21 22:29:55,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-21 22:29:55,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-21 22:29:55,901 INFO L82 PathProgramCache]: Analyzing trace with hash 105134, now seen corresponding path program 1 times [2020-06-21 22:29:55,901 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-21 22:29:55,901 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-21 22:29:55,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-21 22:29:55,902 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-21 22:29:55,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-21 22:29:55,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-21 22:29:55,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-21 22:29:55,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-21 22:29:55,916 INFO L82 PathProgramCache]: Analyzing trace with hash 65526170, now seen corresponding path program 1 times [2020-06-21 22:29:55,916 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-21 22:29:55,917 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-21 22:29:55,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-21 22:29:55,918 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-21 22:29:55,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-21 22:29:55,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-21 22:29:55,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-21 22:29:56,057 INFO L216 LassoAnalysis]: Preferences: [2020-06-21 22:29:56,058 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-21 22:29:56,058 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-21 22:29:56,058 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-21 22:29:56,059 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-21 22:29:56,059 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-21 22:29:56,059 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-21 22:29:56,059 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-21 22:29:56,059 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Lasso [2020-06-21 22:29:56,059 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-21 22:29:56,060 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-21 22:29:56,081 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-21 22:29:56,097 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-21 22:29:56,101 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-21 22:29:56,106 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-21 22:29:56,112 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-21 22:29:56,231 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-21 22:29:56,236 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-21 22:29:56,446 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-21 22:29:56,451 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-21 22:29:56,454 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-21 22:29:56,455 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-21 22:29:56,456 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-21 22:29:56,456 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-21 22:29:56,456 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-21 22:29:56,457 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-21 22:29:56,459 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-21 22:29:56,459 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-21 22:29:56,462 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-21 22:29:56,462 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-21 22:29:56,463 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-21 22:29:56,463 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-21 22:29:56,463 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-21 22:29:56,463 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-21 22:29:56,463 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-21 22:29:56,464 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-21 22:29:56,464 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-21 22:29:56,465 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-21 22:29:56,466 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-21 22:29:56,466 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-21 22:29:56,466 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-21 22:29:56,467 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-21 22:29:56,467 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-21 22:29:56,467 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-21 22:29:56,467 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-21 22:29:56,468 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-21 22:29:56,469 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-21 22:29:56,469 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-21 22:29:56,470 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-21 22:29:56,470 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-21 22:29:56,470 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-21 22:29:56,471 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-21 22:29:56,474 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-21 22:29:56,474 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-21 22:29:56,479 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-21 22:29:56,479 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-21 22:29:56,480 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-21 22:29:56,480 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-21 22:29:56,480 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-21 22:29:56,480 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-21 22:29:56,485 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-21 22:29:56,485 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-21 22:29:56,508 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-21 22:29:56,509 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-21 22:29:56,509 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-21 22:29:56,510 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-21 22:29:56,510 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-21 22:29:56,510 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-21 22:29:56,513 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-21 22:29:56,513 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-21 22:29:56,525 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-21 22:29:56,526 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-21 22:29:56,526 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-21 22:29:56,527 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-21 22:29:56,527 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-21 22:29:56,527 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-21 22:29:56,529 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-21 22:29:56,529 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-21 22:29:56,532 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-21 22:29:56,533 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-21 22:29:56,533 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-21 22:29:56,534 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-21 22:29:56,534 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-21 22:29:56,534 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-21 22:29:56,536 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-21 22:29:56,536 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-21 22:29:56,549 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-21 22:29:56,550 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-21 22:29:56,550 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-21 22:29:56,550 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-21 22:29:56,551 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-21 22:29:56,551 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-21 22:29:56,551 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-21 22:29:56,552 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-21 22:29:56,552 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-21 22:29:56,555 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-21 22:29:56,560 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-06-21 22:29:56,560 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2020-06-21 22:29:56,563 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-21 22:29:56,563 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-06-21 22:29:56,563 INFO L518 LassoAnalysis]: Proved termination. [2020-06-21 22:29:56,564 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~p~0.base) ULTIMATE.start_main_~p~0.offset)_1) = 2*v_rep(select (select #memory_int ULTIMATE.start_main_~p~0.base) ULTIMATE.start_main_~p~0.offset)_1 + 1 Supporting invariants [] [2020-06-21 22:29:56,575 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2020-06-21 22:29:56,578 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-21 22:29:56,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-21 22:29:56,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-21 22:29:56,607 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 2 conjunts are in the unsatisfiable core [2020-06-21 22:29:56,609 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-21 22:29:56,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-21 22:29:56,623 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 6 conjunts are in the unsatisfiable core [2020-06-21 22:29:56,624 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-21 22:29:56,666 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-21 22:29:56,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-21 22:29:56,706 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-21 22:29:56,706 INFO L98 LoopCannibalizer]: 3 predicates before loop cannibalization 3 predicates after loop cannibalization [2020-06-21 22:29:56,709 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2020-06-21 22:29:56,710 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 11 states. Second operand 4 states. [2020-06-21 22:29:56,815 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 11 states.. Second operand 4 states. Result 29 states and 57 transitions. Complement of second has 8 states. [2020-06-21 22:29:56,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2020-06-21 22:29:56,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-06-21 22:29:56,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 34 transitions. [2020-06-21 22:29:56,818 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 34 transitions. Stem has 2 letters. Loop has 3 letters. [2020-06-21 22:29:56,820 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-21 22:29:56,820 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 34 transitions. Stem has 5 letters. Loop has 3 letters. [2020-06-21 22:29:56,820 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-21 22:29:56,820 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 34 transitions. Stem has 2 letters. Loop has 6 letters. [2020-06-21 22:29:56,821 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-21 22:29:56,827 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 57 transitions. [2020-06-21 22:29:56,830 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-06-21 22:29:56,830 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 5 states and 5 transitions. [2020-06-21 22:29:56,831 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2020-06-21 22:29:56,832 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2020-06-21 22:29:56,832 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 5 transitions. [2020-06-21 22:29:56,833 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-21 22:29:56,833 INFO L706 BuchiCegarLoop]: Abstraction has 5 states and 5 transitions. [2020-06-21 22:29:56,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states and 5 transitions. [2020-06-21 22:29:56,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2020-06-21 22:29:56,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-06-21 22:29:56,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2020-06-21 22:29:56,835 INFO L729 BuchiCegarLoop]: Abstraction has 5 states and 5 transitions. [2020-06-21 22:29:56,835 INFO L609 BuchiCegarLoop]: Abstraction has 5 states and 5 transitions. [2020-06-21 22:29:56,835 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2020-06-21 22:29:56,836 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5 states and 5 transitions. [2020-06-21 22:29:56,836 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-06-21 22:29:56,836 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-21 22:29:56,836 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-21 22:29:56,836 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-06-21 22:29:56,836 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-06-21 22:29:56,837 INFO L794 eck$LassoCheckResult]: Stem: 101#ULTIMATE.startENTRY [38] ULTIMATE.startENTRY-->L-1: Formula: (and (= |v_#NULL.offset_1| 0) (= |v_#NULL.base_1| 0) (= |v_#valid_1| (store |v_#valid_2| 0 0))) InVars {#valid=|v_#valid_2|} OutVars{#NULL.offset=|v_#NULL.offset_1|, #NULL.base=|v_#NULL.base_1|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid, #NULL.offset, #NULL.base] 99#L-1 [57] L-1-->L12-3: Formula: (and (= 0 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= (select |v_#valid_4| |v_ULTIMATE.start_main_#t~malloc0.base_1|) 0) (< |v_#StackHeapBarrier_1| |v_ULTIMATE.start_main_#t~malloc0.base_1|) (= (store |v_#length_2| |v_ULTIMATE.start_main_#t~malloc0.base_1| 4) |v_#length_1|) (= v_ULTIMATE.start_main_~p~0.base_1 |v_ULTIMATE.start_main_#t~malloc0.base_1|) (= v_ULTIMATE.start_main_~p~0.offset_1 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (> |v_ULTIMATE.start_main_#t~malloc0.base_1| 0) (= |v_#valid_3| (store |v_#valid_4| |v_ULTIMATE.start_main_#t~malloc0.base_1| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_4|} OutVars{ULTIMATE.start_main_#t~malloc0.base=|v_ULTIMATE.start_main_#t~malloc0.base_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_~p~0.base=v_ULTIMATE.start_main_~p~0.base_1, ULTIMATE.start_main_#t~post3=|v_ULTIMATE.start_main_#t~post3_1|, ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_1|, ULTIMATE.start_main_#t~mem1=|v_ULTIMATE.start_main_#t~mem1_1|, #length=|v_#length_1|, ULTIMATE.start_main_#t~malloc0.offset=|v_ULTIMATE.start_main_#t~malloc0.offset_1|, ULTIMATE.start_main_~p~0.offset=v_ULTIMATE.start_main_~p~0.offset_1} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc0.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_~p~0.base, ULTIMATE.start_main_#t~post3, ULTIMATE.start_main_#t~mem2, ULTIMATE.start_main_#t~mem1, #length, ULTIMATE.start_main_#t~malloc0.offset, ULTIMATE.start_main_~p~0.offset] 100#L12-3 [2020-06-21 22:29:56,837 INFO L796 eck$LassoCheckResult]: Loop: 100#L12-3 [76] L12-3-->L13: Formula: (and (<= 0 v_ULTIMATE.start_main_~p~0.offset_12) (<= (+ v_ULTIMATE.start_main_~p~0.offset_12 4) (select |v_#length_11| v_ULTIMATE.start_main_~p~0.base_15)) (<= 0 (select (select |v_#memory_int_8| v_ULTIMATE.start_main_~p~0.base_15) v_ULTIMATE.start_main_~p~0.offset_12)) (= (select |v_#valid_13| v_ULTIMATE.start_main_~p~0.base_15) 1)) InVars {#valid=|v_#valid_13|, ULTIMATE.start_main_~p~0.base=v_ULTIMATE.start_main_~p~0.base_15, #memory_int=|v_#memory_int_8|, #length=|v_#length_11|, ULTIMATE.start_main_~p~0.offset=v_ULTIMATE.start_main_~p~0.offset_12} OutVars{#valid=|v_#valid_13|, ULTIMATE.start_main_~p~0.base=v_ULTIMATE.start_main_~p~0.base_15, #memory_int=|v_#memory_int_8|, ULTIMATE.start_main_#t~mem1=|v_ULTIMATE.start_main_#t~mem1_13|, #length=|v_#length_11|, ULTIMATE.start_main_~p~0.offset=v_ULTIMATE.start_main_~p~0.offset_12} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem1] 103#L13 [72] L13-->L13-2: Formula: (and (= 1 (select |v_#valid_11| v_ULTIMATE.start_main_~p~0.base_13)) (<= (+ v_ULTIMATE.start_main_~p~0.offset_10 4) (select |v_#length_9| v_ULTIMATE.start_main_~p~0.base_13)) (<= 0 v_ULTIMATE.start_main_~p~0.offset_10) (= |v_ULTIMATE.start_main_#t~post3_5| |v_ULTIMATE.start_main_#t~mem2_5|) (= (select (select |v_#memory_int_5| v_ULTIMATE.start_main_~p~0.base_13) v_ULTIMATE.start_main_~p~0.offset_10) |v_ULTIMATE.start_main_#t~mem2_5|)) InVars {#valid=|v_#valid_11|, ULTIMATE.start_main_~p~0.base=v_ULTIMATE.start_main_~p~0.base_13, #memory_int=|v_#memory_int_5|, #length=|v_#length_9|, ULTIMATE.start_main_~p~0.offset=v_ULTIMATE.start_main_~p~0.offset_10} OutVars{#valid=|v_#valid_11|, ULTIMATE.start_main_#t~post3=|v_ULTIMATE.start_main_#t~post3_5|, ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_5|, ULTIMATE.start_main_~p~0.base=v_ULTIMATE.start_main_~p~0.base_13, #memory_int=|v_#memory_int_5|, #length=|v_#length_9|, ULTIMATE.start_main_~p~0.offset=v_ULTIMATE.start_main_~p~0.offset_10} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post3, ULTIMATE.start_main_#t~mem2] 102#L13-2 [75] L13-2-->L12-3: Formula: (and (<= (+ v_ULTIMATE.start_main_~p~0.offset_11 4) (select |v_#length_10| v_ULTIMATE.start_main_~p~0.base_14)) (= 1 (select |v_#valid_12| v_ULTIMATE.start_main_~p~0.base_14)) (<= 0 v_ULTIMATE.start_main_~p~0.offset_11) (= |v_#memory_int_6| (store |v_#memory_int_7| v_ULTIMATE.start_main_~p~0.base_14 (store (select |v_#memory_int_7| v_ULTIMATE.start_main_~p~0.base_14) v_ULTIMATE.start_main_~p~0.offset_11 (+ |v_ULTIMATE.start_main_#t~post3_7| (- 1)))))) InVars {#valid=|v_#valid_12|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_main_#t~post3=|v_ULTIMATE.start_main_#t~post3_7|, ULTIMATE.start_main_~p~0.base=v_ULTIMATE.start_main_~p~0.base_14, #length=|v_#length_10|, ULTIMATE.start_main_~p~0.offset=v_ULTIMATE.start_main_~p~0.offset_11} OutVars{#valid=|v_#valid_12|, ULTIMATE.start_main_#t~post3=|v_ULTIMATE.start_main_#t~post3_6|, ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_6|, #memory_int=|v_#memory_int_6|, ULTIMATE.start_main_~p~0.base=v_ULTIMATE.start_main_~p~0.base_14, #length=|v_#length_10|, ULTIMATE.start_main_~p~0.offset=v_ULTIMATE.start_main_~p~0.offset_11} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post3, ULTIMATE.start_main_#t~mem2, #memory_int] 100#L12-3 [2020-06-21 22:29:56,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-21 22:29:56,838 INFO L82 PathProgramCache]: Analyzing trace with hash 2196, now seen corresponding path program 1 times [2020-06-21 22:29:56,838 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-21 22:29:56,838 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-21 22:29:56,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-21 22:29:56,839 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-21 22:29:56,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-21 22:29:56,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-21 22:29:56,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-21 22:29:56,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-21 22:29:56,850 INFO L82 PathProgramCache]: Analyzing trace with hash 105134, now seen corresponding path program 2 times [2020-06-21 22:29:56,850 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-21 22:29:56,850 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-21 22:29:56,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-21 22:29:56,851 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-21 22:29:56,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-21 22:29:56,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-21 22:29:56,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-21 22:29:56,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-21 22:29:56,861 INFO L82 PathProgramCache]: Analyzing trace with hash 65496379, now seen corresponding path program 1 times [2020-06-21 22:29:56,862 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-21 22:29:56,862 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-21 22:29:56,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-21 22:29:56,863 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-21 22:29:56,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-21 22:29:56,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-21 22:29:56,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-21 22:29:56,967 INFO L216 LassoAnalysis]: Preferences: [2020-06-21 22:29:56,968 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-21 22:29:56,968 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-21 22:29:56,968 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-21 22:29:56,968 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-21 22:29:56,968 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-21 22:29:56,968 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-21 22:29:56,968 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-21 22:29:56,968 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration2_Lasso [2020-06-21 22:29:56,969 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-21 22:29:56,969 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-21 22:29:56,971 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-21 22:29:56,975 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-21 22:29:57,051 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-21 22:29:57,054 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-21 22:29:57,056 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-21 22:29:57,058 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-21 22:29:57,061 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-21 22:29:57,196 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-21 22:29:57,196 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-21 22:29:57,197 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-21 22:29:57,198 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-21 22:29:57,198 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-21 22:29:57,198 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-21 22:29:57,198 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-21 22:29:57,198 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-21 22:29:57,199 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-21 22:29:57,199 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-21 22:29:57,200 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-21 22:29:57,200 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-21 22:29:57,200 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-21 22:29:57,201 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-21 22:29:57,201 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-21 22:29:57,201 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-21 22:29:57,201 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-21 22:29:57,202 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-21 22:29:57,202 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-21 22:29:57,205 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-21 22:29:57,207 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-06-21 22:29:57,207 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2020-06-21 22:29:57,208 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-21 22:29:57,208 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-06-21 22:29:57,208 INFO L518 LassoAnalysis]: Proved termination. [2020-06-21 22:29:57,208 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~p~0.base) ULTIMATE.start_main_~p~0.offset)_2) = 2*v_rep(select (select #memory_int ULTIMATE.start_main_~p~0.base) ULTIMATE.start_main_~p~0.offset)_2 + 1 Supporting invariants [] [2020-06-21 22:29:57,214 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2020-06-21 22:29:57,215 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-21 22:29:57,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-21 22:29:57,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-21 22:29:57,234 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 2 conjunts are in the unsatisfiable core [2020-06-21 22:29:57,234 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-21 22:29:57,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-21 22:29:57,241 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 6 conjunts are in the unsatisfiable core [2020-06-21 22:29:57,242 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-21 22:29:57,272 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-21 22:29:57,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-21 22:29:57,338 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-21 22:29:57,338 INFO L98 LoopCannibalizer]: 3 predicates before loop cannibalization 3 predicates after loop cannibalization [2020-06-21 22:29:57,339 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2020-06-21 22:29:57,339 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 5 states and 5 transitions. cyclomatic complexity: 1 Second operand 4 states. [2020-06-21 22:29:57,355 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 5 states and 5 transitions. cyclomatic complexity: 1. Second operand 4 states. Result 8 states and 9 transitions. Complement of second has 6 states. [2020-06-21 22:29:57,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-06-21 22:29:57,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-06-21 22:29:57,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 9 transitions. [2020-06-21 22:29:57,357 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 2 letters. Loop has 3 letters. [2020-06-21 22:29:57,357 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-21 22:29:57,357 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 5 letters. Loop has 3 letters. [2020-06-21 22:29:57,357 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-21 22:29:57,357 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 2 letters. Loop has 6 letters. [2020-06-21 22:29:57,358 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-21 22:29:57,359 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 8 states and 9 transitions. [2020-06-21 22:29:57,360 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-06-21 22:29:57,360 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 8 states to 0 states and 0 transitions. [2020-06-21 22:29:57,360 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-06-21 22:29:57,360 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-06-21 22:29:57,360 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-06-21 22:29:57,361 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-21 22:29:57,361 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-21 22:29:57,361 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-21 22:29:57,361 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-21 22:29:57,361 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2020-06-21 22:29:57,361 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-06-21 22:29:57,361 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-06-21 22:29:57,361 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-06-21 22:29:57,367 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 21.06 10:29:57 BasicIcfg [2020-06-21 22:29:57,367 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-06-21 22:29:57,368 INFO L168 Benchmark]: Toolchain (without parser) took 2743.54 ms. Allocated memory was 649.6 MB in the beginning and 749.2 MB in the end (delta: 99.6 MB). Free memory was 558.8 MB in the beginning and 694.4 MB in the end (delta: -135.6 MB). There was no memory consumed. Max. memory is 50.3 GB. [2020-06-21 22:29:57,369 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 649.6 MB. Free memory is still 580.4 MB. There was no memory consumed. Max. memory is 50.3 GB. [2020-06-21 22:29:57,370 INFO L168 Benchmark]: CACSL2BoogieTranslator took 283.57 ms. Allocated memory was 649.6 MB in the beginning and 666.4 MB in the end (delta: 16.8 MB). Free memory was 558.8 MB in the beginning and 631.0 MB in the end (delta: -72.2 MB). Peak memory consumption was 28.8 MB. Max. memory is 50.3 GB. [2020-06-21 22:29:57,371 INFO L168 Benchmark]: Boogie Procedure Inliner took 36.02 ms. Allocated memory is still 666.4 MB. Free memory was 631.0 MB in the beginning and 629.6 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. [2020-06-21 22:29:57,371 INFO L168 Benchmark]: Boogie Preprocessor took 20.79 ms. Allocated memory is still 666.4 MB. Free memory was 629.6 MB in the beginning and 628.3 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. [2020-06-21 22:29:57,372 INFO L168 Benchmark]: RCFGBuilder took 240.00 ms. Allocated memory is still 666.4 MB. Free memory was 628.3 MB in the beginning and 611.5 MB in the end (delta: 16.7 MB). Peak memory consumption was 16.7 MB. Max. memory is 50.3 GB. [2020-06-21 22:29:57,373 INFO L168 Benchmark]: BlockEncodingV2 took 98.22 ms. Allocated memory is still 666.4 MB. Free memory was 611.5 MB in the beginning and 603.5 MB in the end (delta: 8.1 MB). Peak memory consumption was 8.1 MB. Max. memory is 50.3 GB. [2020-06-21 22:29:57,373 INFO L168 Benchmark]: TraceAbstraction took 506.87 ms. Allocated memory is still 666.4 MB. Free memory was 603.5 MB in the beginning and 564.3 MB in the end (delta: 39.1 MB). Peak memory consumption was 39.1 MB. Max. memory is 50.3 GB. [2020-06-21 22:29:57,374 INFO L168 Benchmark]: BuchiAutomizer took 1552.74 ms. Allocated memory was 666.4 MB in the beginning and 749.2 MB in the end (delta: 82.8 MB). Free memory was 564.3 MB in the beginning and 694.4 MB in the end (delta: -130.1 MB). There was no memory consumed. Max. memory is 50.3 GB. [2020-06-21 22:29:57,378 INFO L337 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 18 locations, 19 edges - StatisticsResult: Encoded RCFG 11 locations, 18 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 649.6 MB. Free memory is still 580.4 MB. There was no memory consumed. Max. memory is 50.3 GB. * CACSL2BoogieTranslator took 283.57 ms. Allocated memory was 649.6 MB in the beginning and 666.4 MB in the end (delta: 16.8 MB). Free memory was 558.8 MB in the beginning and 631.0 MB in the end (delta: -72.2 MB). Peak memory consumption was 28.8 MB. Max. memory is 50.3 GB. * Boogie Procedure Inliner took 36.02 ms. Allocated memory is still 666.4 MB. Free memory was 631.0 MB in the beginning and 629.6 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. * Boogie Preprocessor took 20.79 ms. Allocated memory is still 666.4 MB. Free memory was 629.6 MB in the beginning and 628.3 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. * RCFGBuilder took 240.00 ms. Allocated memory is still 666.4 MB. Free memory was 628.3 MB in the beginning and 611.5 MB in the end (delta: 16.7 MB). Peak memory consumption was 16.7 MB. Max. memory is 50.3 GB. * BlockEncodingV2 took 98.22 ms. Allocated memory is still 666.4 MB. Free memory was 611.5 MB in the beginning and 603.5 MB in the end (delta: 8.1 MB). Peak memory consumption was 8.1 MB. Max. memory is 50.3 GB. * TraceAbstraction took 506.87 ms. Allocated memory is still 666.4 MB. Free memory was 603.5 MB in the beginning and 564.3 MB in the end (delta: 39.1 MB). Peak memory consumption was 39.1 MB. Max. memory is 50.3 GB. * BuchiAutomizer took 1552.74 ms. Allocated memory was 666.4 MB in the beginning and 749.2 MB in the end (delta: 82.8 MB). Free memory was 564.3 MB in the beginning and 694.4 MB in the end (delta: -130.1 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 #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - 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: 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: 13]: 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 - AllSpecificationsHoldResult: All specifications hold 6 specifications checked. All of them hold - InvariantResult [Line: 12]: Loop Invariant [2020-06-21 22:29:57,387 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-21 22:29:57,388 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: (0 == p && 1 == \valid[p]) && 4 == unknown-#length-unknown[p] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 11 locations, 6 error locations. SAFE Result, 0.4s OverallTime, 2 OverallIterations, 1 TraceHistogramMax, 0.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2 SDtfs, 12 SDslu, 1 SDs, 0 SdLazy, 17 SolverSat, 12 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=11occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 1 NumberOfFragments, 14 HoareAnnotationTreeSize, 1 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 1 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 6 NumberOfCodeBlocks, 6 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 4 ConstructedInterpolants, 0 QuantifiedInterpolants, 32 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available - StatisticsResult: Constructed decomposition of program Your program was decomposed into 2 terminating modules (0 trivial, 0 deterministic, 2 nondeterministic). One nondeterministic module has affine ranking function 2 * unknown-#memory_int-unknown[p][p] + 1 and consists of 5 locations. One nondeterministic module has affine ranking function 2 * unknown-#memory_int-unknown[p][p] + 1 and consists of 4 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 1.5s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 1.0s. Construction of modules took 0.0s. Büchi inclusion checks took 0.3s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 5 states and ocurred in iteration 1. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 8 SDtfs, 53 SDslu, 0 SDs, 0 SdLazy, 71 SolverSat, 6 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital85 mio100 ax100 hnf100 lsp92 ukn75 mio100 lsp41 div100 bol100 ite100 ukn100 eq179 hnf88 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 9ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! !SESSION 2020-06-21 22:29:51.340 ----------------------------------------------- eclipse.buildId=unknown java.version=1.8.0_242 java.vendor=Oracle Corporation BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox/benchmark/theBenchmark.c Command-line arguments: -os linux -ws gtk -arch x86_64 -consoleLog -data @user.home/.ultimate -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -data /export/starexec/sandbox/tmp -i /export/starexec/sandbox/benchmark/theBenchmark.c !ENTRY org.eclipse.core.resources 2 10035 2020-06-21 22:29:57.616 !MESSAGE The workspace will exit with unsaved changes in this session. Received shutdown request... Ultimate: GTK+ Version Check