YES Ultimate: Cannot open display: This is Ultimate 0.1.24-8dc7c08-m [2020-06-22 09:25:52,876 INFO L170 SettingsManager]: Resetting all preferences to default values... [2020-06-22 09:25:52,878 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2020-06-22 09:25:52,889 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-06-22 09:25:52,889 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-06-22 09:25:52,890 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-06-22 09:25:52,892 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-06-22 09:25:52,893 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2020-06-22 09:25:52,894 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-06-22 09:25:52,895 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-06-22 09:25:52,896 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-06-22 09:25:52,896 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-06-22 09:25:52,897 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-06-22 09:25:52,898 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-06-22 09:25:52,899 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-06-22 09:25:52,900 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-06-22 09:25:52,901 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-06-22 09:25:52,902 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-06-22 09:25:52,904 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2020-06-22 09:25:52,905 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-06-22 09:25:52,906 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-06-22 09:25:52,907 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-06-22 09:25:52,909 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-06-22 09:25:52,910 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-06-22 09:25:52,910 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-06-22 09:25:52,911 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-06-22 09:25:52,911 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-06-22 09:25:52,912 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-06-22 09:25:52,912 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-06-22 09:25:52,913 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-06-22 09:25:52,913 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-06-22 09:25:52,914 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2020-06-22 09:25:52,915 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-06-22 09:25:52,915 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2020-06-22 09:25:52,916 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-06-22 09:25:52,916 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-06-22 09:25:52,916 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2020-06-22 09:25:52,917 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2020-06-22 09:25:52,918 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2020-06-22 09:25:52,918 INFO L98 SettingsManager]: Beginning loading settings from /export/starexec/sandbox/solver/bin/./../termcomp2017.epf [2020-06-22 09:25:52,932 INFO L110 SettingsManager]: Loading preferences was successful [2020-06-22 09:25:52,933 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2020-06-22 09:25:52,934 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-06-22 09:25:52,934 INFO L133 SettingsManager]: * Rewrite not-equals=true [2020-06-22 09:25:52,934 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2020-06-22 09:25:52,934 INFO L133 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE [2020-06-22 09:25:52,934 INFO L133 SettingsManager]: * Use SBE=true [2020-06-22 09:25:52,935 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-06-22 09:25:52,935 INFO L133 SettingsManager]: * Use old map elimination=false [2020-06-22 09:25:52,935 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2020-06-22 09:25:52,935 INFO L133 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION [2020-06-22 09:25:52,935 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2020-06-22 09:25:52,935 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-06-22 09:25:52,936 INFO L133 SettingsManager]: * Construct termination proof for TermComp=true [2020-06-22 09:25:52,936 INFO L133 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 09:25:52,936 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-06-22 09:25:52,936 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-06-22 09:25:52,936 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2020-06-22 09:25:52,936 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2020-06-22 09:25:52,937 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-06-22 09:25:52,937 INFO L133 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE [2020-06-22 09:25:52,937 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-06-22 09:25:52,937 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-06-22 09:25:52,937 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-06-22 09:25:52,937 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-06-22 09:25:52,938 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-06-22 09:25:52,938 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-06-22 09:25:52,938 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2020-06-22 09:25:52,938 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-06-22 09:25:52,963 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-06-22 09:25:52,976 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-06-22 09:25:52,980 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-06-22 09:25:52,981 INFO L271 PluginConnector]: Initializing CDTParser... [2020-06-22 09:25:52,981 INFO L276 PluginConnector]: CDTParser initialized [2020-06-22 09:25:52,982 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox/benchmark/theBenchmark.c [2020-06-22 09:25:53,048 INFO L221 CDTParser]: Created temporary CDT project at /export/starexec/sandbox/tmp/69439d1740dd411eaab48e7928ea36cc/FLAGd8cf9f50a [2020-06-22 09:25:53,403 INFO L307 CDTParser]: Found 1 translation units. [2020-06-22 09:25:53,403 INFO L161 CDTParser]: Scanning /export/starexec/sandbox/benchmark/theBenchmark.c [2020-06-22 09:25:53,404 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. [2020-06-22 09:25:53,410 INFO L355 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox/tmp/69439d1740dd411eaab48e7928ea36cc/FLAGd8cf9f50a [2020-06-22 09:25:53,787 INFO L363 CDTParser]: Successfully deleted /export/starexec/sandbox/tmp/69439d1740dd411eaab48e7928ea36cc [2020-06-22 09:25:53,798 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-06-22 09:25:53,800 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. [2020-06-22 09:25:53,801 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-06-22 09:25:53,801 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-06-22 09:25:53,804 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2020-06-22 09:25:53,805 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.06 09:25:53" (1/1) ... [2020-06-22 09:25:53,808 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a014f6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:25:53, skipping insertion in model container [2020-06-22 09:25:53,809 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.06 09:25:53" (1/1) ... [2020-06-22 09:25:53,816 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-06-22 09:25:53,834 INFO L176 MainTranslator]: Built tables and reachable declarations [2020-06-22 09:25:53,993 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-06-22 09:25:54,005 INFO L191 MainTranslator]: Completed pre-run [2020-06-22 09:25:54,117 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-06-22 09:25:54,134 INFO L195 MainTranslator]: Completed translation [2020-06-22 09:25:54,134 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:25:54 WrapperNode [2020-06-22 09:25:54,135 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-06-22 09:25:54,135 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-06-22 09:25:54,136 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-06-22 09:25:54,136 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2020-06-22 09:25:54,144 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:25:54" (1/1) ... [2020-06-22 09:25:54,153 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:25:54" (1/1) ... [2020-06-22 09:25:54,173 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-06-22 09:25:54,174 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-06-22 09:25:54,174 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-06-22 09:25:54,174 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2020-06-22 09:25:54,183 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:25:54" (1/1) ... [2020-06-22 09:25:54,183 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:25:54" (1/1) ... [2020-06-22 09:25:54,185 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:25:54" (1/1) ... [2020-06-22 09:25:54,185 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:25:54" (1/1) ... [2020-06-22 09:25:54,191 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:25:54" (1/1) ... [2020-06-22 09:25:54,195 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:25:54" (1/1) ... [2020-06-22 09:25:54,196 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:25:54" (1/1) ... [2020-06-22 09:25:54,198 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-06-22 09:25:54,199 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-06-22 09:25:54,199 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-06-22 09:25:54,199 INFO L276 PluginConnector]: RCFGBuilder initialized [2020-06-22 09:25:54,200 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:25: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-22 09:25:54,269 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-06-22 09:25:54,270 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-06-22 09:25:54,270 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-06-22 09:25:54,270 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-06-22 09:25:54,270 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-06-22 09:25:54,449 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-06-22 09:25:54,449 INFO L286 CfgBuilder]: Removed 7 assue(true) statements. [2020-06-22 09:25:54,451 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 09:25:54 BoogieIcfgContainer [2020-06-22 09:25:54,451 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-06-22 09:25:54,452 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- [2020-06-22 09:25:54,452 INFO L271 PluginConnector]: Initializing BlockEncodingV2... [2020-06-22 09:25:54,454 INFO L276 PluginConnector]: BlockEncodingV2 initialized [2020-06-22 09:25:54,455 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 09:25:54" (1/1) ... [2020-06-22 09:25:54,471 INFO L313 BlockEncoder]: Initial Icfg 18 locations, 22 edges [2020-06-22 09:25:54,473 INFO L258 BlockEncoder]: Using Remove infeasible edges [2020-06-22 09:25:54,473 INFO L263 BlockEncoder]: Using Maximize final states [2020-06-22 09:25:54,474 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false [2020-06-22 09:25:54,474 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE [2020-06-22 09:25:54,476 INFO L296 BlockEncoder]: Using Remove sink states [2020-06-22 09:25:54,477 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true [2020-06-22 09:25:54,478 INFO L179 BlockEncoder]: Using Rewrite not-equals [2020-06-22 09:25:54,495 INFO L185 BlockEncoder]: Using Use SBE [2020-06-22 09:25:54,515 INFO L200 BlockEncoder]: SBE split 5 edges [2020-06-22 09:25:54,519 INFO L70 emoveInfeasibleEdges]: Removed 1 edges and 0 locations because of local infeasibility [2020-06-22 09:25:54,521 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-06-22 09:25:54,551 INFO L100 BaseMinimizeStates]: Removed 12 edges and 6 locations by large block encoding [2020-06-22 09:25:54,553 INFO L70 RemoveSinkStates]: Removed 3 edges and 2 locations by removing sink states [2020-06-22 09:25:54,555 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-06-22 09:25:54,555 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-06-22 09:25:54,555 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding [2020-06-22 09:25:54,556 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states [2020-06-22 09:25:54,556 INFO L313 BlockEncoder]: Encoded RCFG 10 locations, 17 edges [2020-06-22 09:25:54,557 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 09:25:54 BasicIcfg [2020-06-22 09:25:54,557 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- [2020-06-22 09:25:54,558 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-06-22 09:25:54,558 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-06-22 09:25:54,561 INFO L276 PluginConnector]: TraceAbstraction initialized [2020-06-22 09:25:54,562 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.06 09:25:53" (1/4) ... [2020-06-22 09:25:54,563 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@281cd2dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 09:25:54, skipping insertion in model container [2020-06-22 09:25:54,563 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:25:54" (2/4) ... [2020-06-22 09:25:54,563 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@281cd2dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 09:25:54, skipping insertion in model container [2020-06-22 09:25:54,563 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 09:25:54" (3/4) ... [2020-06-22 09:25:54,564 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@281cd2dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 09:25:54, skipping insertion in model container [2020-06-22 09:25:54,564 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 09:25:54" (4/4) ... [2020-06-22 09:25:54,566 INFO L112 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-06-22 09:25:54,576 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2020-06-22 09:25:54,586 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-06-22 09:25:54,603 INFO L257 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2020-06-22 09:25:54,631 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2020-06-22 09:25:54,632 INFO L382 AbstractCegarLoop]: Interprodecural is true [2020-06-22 09:25:54,632 INFO L383 AbstractCegarLoop]: Hoare is true [2020-06-22 09:25:54,632 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2020-06-22 09:25:54,632 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-06-22 09:25:54,632 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-06-22 09:25:54,633 INFO L387 AbstractCegarLoop]: Difference is false [2020-06-22 09:25:54,633 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-06-22 09:25:54,633 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-06-22 09:25:54,647 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states. [2020-06-22 09:25:54,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-06-22 09:25:54,653 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 09:25:54,654 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-06-22 09:25:54,654 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION]=== [2020-06-22 09:25:54,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:25:54,660 INFO L82 PathProgramCache]: Analyzing trace with hash 1884026968, now seen corresponding path program 1 times [2020-06-22 09:25:54,661 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:25:54,662 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:25:54,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:25:54,713 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:25:54,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:25:54,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:25:54,856 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 09:25:54,858 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 09:25:54,860 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-06-22 09:25:54,863 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-06-22 09:25:54,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-06-22 09:25:54,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-06-22 09:25:54,880 INFO L87 Difference]: Start difference. First operand 10 states. Second operand 5 states. [2020-06-22 09:25:54,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:25:54,989 INFO L93 Difference]: Finished difference Result 10 states and 17 transitions. [2020-06-22 09:25:54,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-06-22 09:25:54,991 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 7 [2020-06-22 09:25:54,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 09:25:55,003 INFO L225 Difference]: With dead ends: 10 [2020-06-22 09:25:55,004 INFO L226 Difference]: Without dead ends: 9 [2020-06-22 09:25:55,007 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-06-22 09:25:55,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2020-06-22 09:25:55,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2020-06-22 09:25:55,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-06-22 09:25:55,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 15 transitions. [2020-06-22 09:25:55,042 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 15 transitions. Word has length 7 [2020-06-22 09:25:55,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 09:25:55,042 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 15 transitions. [2020-06-22 09:25:55,042 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-06-22 09:25:55,043 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 15 transitions. [2020-06-22 09:25:55,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-06-22 09:25:55,043 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 09:25:55,043 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-06-22 09:25:55,044 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION]=== [2020-06-22 09:25:55,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:25:55,044 INFO L82 PathProgramCache]: Analyzing trace with hash 1884026969, now seen corresponding path program 1 times [2020-06-22 09:25:55,044 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:25:55,044 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:25:55,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:25:55,046 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:25:55,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:25:55,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:25:55,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 09:25:55,120 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 09:25:55,120 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-06-22 09:25:55,121 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-06-22 09:25:55,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-06-22 09:25:55,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-06-22 09:25:55,122 INFO L87 Difference]: Start difference. First operand 9 states and 15 transitions. Second operand 6 states. [2020-06-22 09:25:55,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:25:55,229 INFO L93 Difference]: Finished difference Result 12 states and 19 transitions. [2020-06-22 09:25:55,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-06-22 09:25:55,230 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 7 [2020-06-22 09:25:55,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 09:25:55,231 INFO L225 Difference]: With dead ends: 12 [2020-06-22 09:25:55,231 INFO L226 Difference]: Without dead ends: 11 [2020-06-22 09:25:55,232 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2020-06-22 09:25:55,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2020-06-22 09:25:55,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2020-06-22 09:25:55,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-06-22 09:25:55,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 17 transitions. [2020-06-22 09:25:55,236 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 17 transitions. Word has length 7 [2020-06-22 09:25:55,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 09:25:55,236 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 17 transitions. [2020-06-22 09:25:55,236 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-06-22 09:25:55,236 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 17 transitions. [2020-06-22 09:25:55,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-06-22 09:25:55,237 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 09:25:55,237 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 09:25:55,237 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION]=== [2020-06-22 09:25:55,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:25:55,238 INFO L82 PathProgramCache]: Analyzing trace with hash 415158771, now seen corresponding path program 1 times [2020-06-22 09:25:55,238 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:25:55,238 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:25:55,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:25:55,239 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:25:55,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:25:55,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:25:55,356 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 09:25:55,357 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 09:25:55,357 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2020-06-22 09:25:55,370 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:25:55,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:25:55,396 INFO L256 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 28 conjunts are in the unsatisfiable core [2020-06-22 09:25:55,402 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 09:25:55,457 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-06-22 09:25:55,458 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 09:25:55,465 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 09:25:55,466 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-06-22 09:25:55,466 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2020-06-22 09:25:55,590 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 09:25:55,618 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-06-22 09:25:55,618 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2020-06-22 09:25:55,619 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-06-22 09:25:55,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-06-22 09:25:55,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2020-06-22 09:25:55,620 INFO L87 Difference]: Start difference. First operand 11 states and 17 transitions. Second operand 14 states. [2020-06-22 09:25:55,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:25:55,998 INFO L93 Difference]: Finished difference Result 19 states and 26 transitions. [2020-06-22 09:25:55,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-06-22 09:25:55,998 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 10 [2020-06-22 09:25:55,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 09:25:55,999 INFO L225 Difference]: With dead ends: 19 [2020-06-22 09:25:55,999 INFO L226 Difference]: Without dead ends: 18 [2020-06-22 09:25:56,000 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=93, Invalid=369, Unknown=0, NotChecked=0, Total=462 [2020-06-22 09:25:56,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2020-06-22 09:25:56,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 14. [2020-06-22 09:25:56,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-06-22 09:25:56,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 22 transitions. [2020-06-22 09:25:56,004 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 22 transitions. Word has length 10 [2020-06-22 09:25:56,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 09:25:56,004 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 22 transitions. [2020-06-22 09:25:56,004 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-06-22 09:25:56,005 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 22 transitions. [2020-06-22 09:25:56,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-06-22 09:25:56,005 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 09:25:56,005 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 09:25:56,005 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION]=== [2020-06-22 09:25:56,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:25:56,006 INFO L82 PathProgramCache]: Analyzing trace with hash 415158772, now seen corresponding path program 1 times [2020-06-22 09:25:56,006 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:25:56,006 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:25:56,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:25:56,007 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:25:56,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:25:56,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:25:56,070 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 09:25:56,070 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 09:25:56,070 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2020-06-22 09:25:56,081 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:25:56,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:25:56,101 INFO L256 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 09:25:56,102 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 09:25:56,117 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 09:25:56,144 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-06-22 09:25:56,144 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 7 [2020-06-22 09:25:56,145 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-06-22 09:25:56,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-06-22 09:25:56,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-06-22 09:25:56,145 INFO L87 Difference]: Start difference. First operand 14 states and 22 transitions. Second operand 8 states. [2020-06-22 09:25:56,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:25:56,248 INFO L93 Difference]: Finished difference Result 15 states and 22 transitions. [2020-06-22 09:25:56,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-06-22 09:25:56,249 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 10 [2020-06-22 09:25:56,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 09:25:56,249 INFO L225 Difference]: With dead ends: 15 [2020-06-22 09:25:56,249 INFO L226 Difference]: Without dead ends: 14 [2020-06-22 09:25:56,250 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2020-06-22 09:25:56,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2020-06-22 09:25:56,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2020-06-22 09:25:56,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-06-22 09:25:56,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 20 transitions. [2020-06-22 09:25:56,253 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 20 transitions. Word has length 10 [2020-06-22 09:25:56,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 09:25:56,253 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 20 transitions. [2020-06-22 09:25:56,254 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-06-22 09:25:56,254 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 20 transitions. [2020-06-22 09:25:56,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-06-22 09:25:56,254 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 09:25:56,254 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 09:25:56,255 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION]=== [2020-06-22 09:25:56,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:25:56,255 INFO L82 PathProgramCache]: Analyzing trace with hash 415159732, now seen corresponding path program 1 times [2020-06-22 09:25:56,255 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:25:56,255 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:25:56,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:25:56,256 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:25:56,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:25:56,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:25:56,282 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 09:25:56,282 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 09:25:56,282 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-06-22 09:25:56,283 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-06-22 09:25:56,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-06-22 09:25:56,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-06-22 09:25:56,283 INFO L87 Difference]: Start difference. First operand 14 states and 20 transitions. Second operand 4 states. [2020-06-22 09:25:56,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:25:56,309 INFO L93 Difference]: Finished difference Result 21 states and 29 transitions. [2020-06-22 09:25:56,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-06-22 09:25:56,310 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2020-06-22 09:25:56,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 09:25:56,311 INFO L225 Difference]: With dead ends: 21 [2020-06-22 09:25:56,311 INFO L226 Difference]: Without dead ends: 17 [2020-06-22 09:25:56,311 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-06-22 09:25:56,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2020-06-22 09:25:56,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2020-06-22 09:25:56,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-06-22 09:25:56,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 23 transitions. [2020-06-22 09:25:56,315 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 23 transitions. Word has length 10 [2020-06-22 09:25:56,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 09:25:56,315 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 23 transitions. [2020-06-22 09:25:56,316 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-06-22 09:25:56,316 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 23 transitions. [2020-06-22 09:25:56,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-06-22 09:25:56,316 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 09:25:56,316 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 09:25:56,317 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION]=== [2020-06-22 09:25:56,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:25:56,317 INFO L82 PathProgramCache]: Analyzing trace with hash 443788883, now seen corresponding path program 1 times [2020-06-22 09:25:56,317 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:25:56,317 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:25:56,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:25:56,318 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:25:56,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:25:56,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:25:56,347 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-06-22 09:25:56,347 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 09:25:56,348 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-06-22 09:25:56,348 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-06-22 09:25:56,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-06-22 09:25:56,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-06-22 09:25:56,349 INFO L87 Difference]: Start difference. First operand 17 states and 23 transitions. Second operand 4 states. [2020-06-22 09:25:56,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:25:56,387 INFO L93 Difference]: Finished difference Result 23 states and 30 transitions. [2020-06-22 09:25:56,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-06-22 09:25:56,387 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2020-06-22 09:25:56,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 09:25:56,387 INFO L225 Difference]: With dead ends: 23 [2020-06-22 09:25:56,388 INFO L226 Difference]: Without dead ends: 14 [2020-06-22 09:25:56,388 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-06-22 09:25:56,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2020-06-22 09:25:56,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2020-06-22 09:25:56,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-06-22 09:25:56,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 18 transitions. [2020-06-22 09:25:56,391 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 18 transitions. Word has length 10 [2020-06-22 09:25:56,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 09:25:56,391 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 18 transitions. [2020-06-22 09:25:56,391 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-06-22 09:25:56,391 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 18 transitions. [2020-06-22 09:25:56,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-06-22 09:25:56,392 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 09:25:56,392 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1] [2020-06-22 09:25:56,392 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION]=== [2020-06-22 09:25:56,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:25:56,393 INFO L82 PathProgramCache]: Analyzing trace with hash -1510516199, now seen corresponding path program 2 times [2020-06-22 09:25:56,393 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:25:56,393 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:25:56,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:25:56,394 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:25:56,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:25:56,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:25:56,506 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 09:25:56,506 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 09:25:56,506 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2020-06-22 09:25:56,517 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2020-06-22 09:25:56,538 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-06-22 09:25:56,539 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-06-22 09:25:56,540 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 35 conjunts are in the unsatisfiable core [2020-06-22 09:25:56,542 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 09:25:56,550 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-06-22 09:25:56,551 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 09:25:56,557 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 09:25:56,557 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-06-22 09:25:56,558 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2020-06-22 09:25:56,705 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 09:25:56,732 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-06-22 09:25:56,732 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 17 [2020-06-22 09:25:56,732 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-06-22 09:25:56,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-06-22 09:25:56,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2020-06-22 09:25:56,733 INFO L87 Difference]: Start difference. First operand 14 states and 18 transitions. Second operand 18 states. [2020-06-22 09:25:57,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:25:57,143 INFO L93 Difference]: Finished difference Result 21 states and 27 transitions. [2020-06-22 09:25:57,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-06-22 09:25:57,144 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 13 [2020-06-22 09:25:57,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 09:25:57,144 INFO L225 Difference]: With dead ends: 21 [2020-06-22 09:25:57,144 INFO L226 Difference]: Without dead ends: 20 [2020-06-22 09:25:57,145 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=168, Invalid=824, Unknown=0, NotChecked=0, Total=992 [2020-06-22 09:25:57,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2020-06-22 09:25:57,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 14. [2020-06-22 09:25:57,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-06-22 09:25:57,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 18 transitions. [2020-06-22 09:25:57,149 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 18 transitions. Word has length 13 [2020-06-22 09:25:57,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 09:25:57,149 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 18 transitions. [2020-06-22 09:25:57,149 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-06-22 09:25:57,149 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 18 transitions. [2020-06-22 09:25:57,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-06-22 09:25:57,150 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 09:25:57,150 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 09:25:57,150 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION]=== [2020-06-22 09:25:57,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:25:57,150 INFO L82 PathProgramCache]: Analyzing trace with hash -1510515238, now seen corresponding path program 1 times [2020-06-22 09:25:57,150 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:25:57,151 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:25:57,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:25:57,152 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 09:25:57,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:25:57,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:25:57,183 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 09:25:57,184 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 09:25:57,184 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2020-06-22 09:25:57,194 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:25:57,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:25:57,211 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 5 conjunts are in the unsatisfiable core [2020-06-22 09:25:57,212 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 09:25:57,216 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 09:25:57,243 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-06-22 09:25:57,243 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2020-06-22 09:25:57,243 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-06-22 09:25:57,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-06-22 09:25:57,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-06-22 09:25:57,244 INFO L87 Difference]: Start difference. First operand 14 states and 18 transitions. Second operand 5 states. [2020-06-22 09:25:57,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:25:57,270 INFO L93 Difference]: Finished difference Result 17 states and 22 transitions. [2020-06-22 09:25:57,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-06-22 09:25:57,271 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-06-22 09:25:57,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 09:25:57,271 INFO L225 Difference]: With dead ends: 17 [2020-06-22 09:25:57,271 INFO L226 Difference]: Without dead ends: 0 [2020-06-22 09:25:57,272 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-06-22 09:25:57,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-06-22 09:25:57,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-06-22 09:25:57,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-06-22 09:25:57,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-06-22 09:25:57,272 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 13 [2020-06-22 09:25:57,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 09:25:57,273 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 09:25:57,273 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-06-22 09:25:57,273 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-06-22 09:25:57,273 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-06-22 09:25:57,277 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-06-22 09:25:57,412 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. [2020-06-22 09:25:57,412 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. [2020-06-22 09:25:57,412 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-06-22 09:25:57,412 INFO L448 ceAbstractionStarter]: For program point L25-1(lines 25 27) no Hoare annotation was computed. [2020-06-22 09:25:57,412 INFO L448 ceAbstractionStarter]: For program point L22(lines 22 24) no Hoare annotation was computed. [2020-06-22 09:25:57,412 INFO L448 ceAbstractionStarter]: For program point L22-2(lines 18 31) no Hoare annotation was computed. [2020-06-22 09:25:57,412 INFO L448 ceAbstractionStarter]: For program point L12(line 12) no Hoare annotation was computed. [2020-06-22 09:25:57,413 INFO L448 ceAbstractionStarter]: For program point L11-2(lines 11 13) no Hoare annotation was computed. [2020-06-22 09:25:57,413 INFO L448 ceAbstractionStarter]: For program point L8(lines 8 14) no Hoare annotation was computed. [2020-06-22 09:25:57,413 INFO L444 ceAbstractionStarter]: At program point L11-4(lines 11 13) the Hoare annotation is: (let ((.cse0 (<= 1 ULTIMATE.start_cmemset_~n)) (.cse2 (= (select |#valid| ULTIMATE.start_cmemset_~dst.base) 1)) (.cse3 (<= 1 ULTIMATE.start_main_~n~0)) (.cse4 (<= ULTIMATE.start_cmemset_~n (select |#length| ULTIMATE.start_cmemset_~dst.base))) (.cse5 (= 1 (select |#valid| ULTIMATE.start_cmemset_~d~0.base))) (.cse1 (select |#length| ULTIMATE.start_cmemset_~d~0.base)) (.cse6 (= 0 ULTIMATE.start_cmemset_~dst.offset))) (or (and .cse0 (and (<= 1 ULTIMATE.start_cmemset_~d~0.offset) (<= (+ ULTIMATE.start_cmemset_~d~0.offset ULTIMATE.start_cmemset_~n) .cse1) .cse2 .cse3 .cse4 .cse5 .cse6)) (and .cse0 .cse2 .cse3 .cse4 .cse5 (<= ULTIMATE.start_cmemset_~n .cse1) (= ULTIMATE.start_cmemset_~d~0.offset 0) .cse6))) [2020-06-22 09:25:57,414 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2020-06-22 09:25:57,422 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:25:57,423 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:25:57,424 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:25:57,424 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:25:57,430 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:25:57,430 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:25:57,431 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:25:57,431 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:25:57,433 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 09:25:57 BasicIcfg [2020-06-22 09:25:57,433 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-06-22 09:25:57,434 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-06-22 09:25:57,434 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-06-22 09:25:57,437 INFO L276 PluginConnector]: BuchiAutomizer initialized [2020-06-22 09:25:57,438 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 09:25:57,438 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.06 09:25:53" (1/5) ... [2020-06-22 09:25:57,438 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7de88248 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.06 09:25:57, skipping insertion in model container [2020-06-22 09:25:57,439 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 09:25:57,439 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:25:54" (2/5) ... [2020-06-22 09:25:57,439 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7de88248 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.06 09:25:57, skipping insertion in model container [2020-06-22 09:25:57,439 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 09:25:57,439 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 09:25:54" (3/5) ... [2020-06-22 09:25:57,439 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7de88248 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 09:25:57, skipping insertion in model container [2020-06-22 09:25:57,440 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 09:25:57,440 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 09:25:54" (4/5) ... [2020-06-22 09:25:57,440 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7de88248 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 09:25:57, skipping insertion in model container [2020-06-22 09:25:57,440 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 09:25:57,440 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 09:25:57" (5/5) ... [2020-06-22 09:25:57,441 INFO L375 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-06-22 09:25:57,461 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2020-06-22 09:25:57,461 INFO L374 BuchiCegarLoop]: Interprodecural is true [2020-06-22 09:25:57,461 INFO L375 BuchiCegarLoop]: Hoare is true [2020-06-22 09:25:57,461 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-06-22 09:25:57,461 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-06-22 09:25:57,461 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-06-22 09:25:57,462 INFO L379 BuchiCegarLoop]: Difference is false [2020-06-22 09:25:57,462 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-06-22 09:25:57,462 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-06-22 09:25:57,465 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states. [2020-06-22 09:25:57,469 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-06-22 09:25:57,469 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 09:25:57,469 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 09:25:57,473 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-06-22 09:25:57,473 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-06-22 09:25:57,473 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2020-06-22 09:25:57,473 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states. [2020-06-22 09:25:57,474 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-06-22 09:25:57,474 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 09:25:57,474 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 09:25:57,475 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-06-22 09:25:57,475 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-06-22 09:25:57,480 INFO L794 eck$LassoCheckResult]: Stem: 4#ULTIMATE.startENTRYtrue [85] ULTIMATE.startENTRY-->L22: Formula: (and (= (store |v_#valid_10| 0 0) |v_#valid_9|) (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|)) InVars {#valid=|v_#valid_10|} OutVars{ULTIMATE.start_main_#t~ret6.base=|v_ULTIMATE.start_main_#t~ret6.base_4|, ULTIMATE.start_main_~nondetArea~0.offset=v_ULTIMATE.start_main_~nondetArea~0.offset_3, ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_6|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_6|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_6|, ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_5, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_8, ULTIMATE.start_main_#t~ret6.offset=|v_ULTIMATE.start_main_#t~ret6.offset_4|, ULTIMATE.start_main_~nondetArea~0.base=v_ULTIMATE.start_main_~nondetArea~0.base_3, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~malloc5.base=|v_ULTIMATE.start_main_#t~malloc5.base_5|, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, #valid=|v_#valid_9|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_7, ULTIMATE.start_main_#t~malloc5.offset=|v_ULTIMATE.start_main_#t~malloc5.offset_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret6.base, ULTIMATE.start_main_~nondetArea~0.offset, ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~n~0, ULTIMATE.start_main_#t~ret6.offset, ULTIMATE.start_main_~nondetArea~0.base, #NULL.offset, ULTIMATE.start_main_#t~malloc5.base, #NULL.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_~length~0, ULTIMATE.start_main_#t~malloc5.offset] 5#L22true [61] L22-->L22-2: Formula: (and (< v_ULTIMATE.start_main_~length~0_5 1) (= v_ULTIMATE.start_main_~length~0_4 1)) InVars {ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_5} OutVars{ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_~length~0] 11#L22-2true [55] L22-2-->L25-1: Formula: (and (= v_ULTIMATE.start_main_~n~0_4 1) (< v_ULTIMATE.start_main_~n~0_5 1)) InVars {ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_5} OutVars{ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_~n~0] 8#L25-1true [76] L25-1-->L8: Formula: (and (= v_ULTIMATE.start_cmemset_~c_1 |v_ULTIMATE.start_cmemset_#in~c_1|) (= 0 |v_ULTIMATE.start_main_#t~malloc5.offset_4|) (= |v_#valid_5| (store |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc5.base_4| 1)) (= |v_ULTIMATE.start_cmemset_#in~dst.offset_1| v_ULTIMATE.start_main_~nondetArea~0.offset_2) (= |v_ULTIMATE.start_cmemset_#in~c_1| v_ULTIMATE.start_main_~c~0_4) (= v_ULTIMATE.start_cmemset_~n_2 |v_ULTIMATE.start_cmemset_#in~n_1|) (= v_ULTIMATE.start_cmemset_~dst.offset_2 |v_ULTIMATE.start_cmemset_#in~dst.offset_1|) (= v_ULTIMATE.start_main_~nondetArea~0.offset_2 |v_ULTIMATE.start_main_#t~malloc5.offset_4|) (= |v_ULTIMATE.start_cmemset_#in~n_1| v_ULTIMATE.start_main_~n~0_7) (> |v_ULTIMATE.start_main_#t~malloc5.base_4| 0) (= (select |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc5.base_4|) 0) (= v_ULTIMATE.start_cmemset_~dst.base_2 |v_ULTIMATE.start_cmemset_#in~dst.base_1|) (< |v_ULTIMATE.start_main_#t~malloc5.base_4| |v_#StackHeapBarrier_1|) (= (store |v_#length_2| |v_ULTIMATE.start_main_#t~malloc5.base_4| v_ULTIMATE.start_main_~n~0_7) |v_#length_1|) (= v_ULTIMATE.start_main_~nondetArea~0.base_2 |v_ULTIMATE.start_main_#t~malloc5.base_4|) (= |v_ULTIMATE.start_cmemset_#in~dst.base_1| v_ULTIMATE.start_main_~nondetArea~0.base_2)) InVars {ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7, ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_4, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_6|} OutVars{ULTIMATE.start_cmemset_~d~0.offset=v_ULTIMATE.start_cmemset_~d~0.offset_1, ULTIMATE.start_main_~nondetArea~0.offset=v_ULTIMATE.start_main_~nondetArea~0.offset_2, ULTIMATE.start_cmemset_~dst.offset=v_ULTIMATE.start_cmemset_~dst.offset_2, ULTIMATE.start_cmemset_#res.base=|v_ULTIMATE.start_cmemset_#res.base_3|, ULTIMATE.start_main_~nondetArea~0.base=v_ULTIMATE.start_main_~nondetArea~0.base_2, ULTIMATE.start_cmemset_#in~dst.base=|v_ULTIMATE.start_cmemset_#in~dst.base_1|, ULTIMATE.start_cmemset_#t~post1.base=|v_ULTIMATE.start_cmemset_#t~post1.base_1|, ULTIMATE.start_cmemset_#in~dst.offset=|v_ULTIMATE.start_cmemset_#in~dst.offset_1|, #length=|v_#length_1|, ULTIMATE.start_cmemset_#t~post1.offset=|v_ULTIMATE.start_cmemset_#t~post1.offset_1|, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7, ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_4, ULTIMATE.start_main_#t~malloc5.base=|v_ULTIMATE.start_main_#t~malloc5.base_4|, ULTIMATE.start_cmemset_#in~n=|v_ULTIMATE.start_cmemset_#in~n_1|, ULTIMATE.start_cmemset_~d~0.base=v_ULTIMATE.start_cmemset_~d~0.base_1, ULTIMATE.start_cmemset_~dst.base=v_ULTIMATE.start_cmemset_~dst.base_2, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_cmemset_~c=v_ULTIMATE.start_cmemset_~c_1, ULTIMATE.start_cmemset_#res.offset=|v_ULTIMATE.start_cmemset_#res.offset_3|, #valid=|v_#valid_5|, ULTIMATE.start_cmemset_~n=v_ULTIMATE.start_cmemset_~n_2, ULTIMATE.start_cmemset_#t~pre0=|v_ULTIMATE.start_cmemset_#t~pre0_3|, ULTIMATE.start_main_#t~malloc5.offset=|v_ULTIMATE.start_main_#t~malloc5.offset_4|, ULTIMATE.start_cmemset_#in~c=|v_ULTIMATE.start_cmemset_#in~c_1|} AuxVars[] AssignedVars[ULTIMATE.start_cmemset_~d~0.offset, ULTIMATE.start_cmemset_#t~post1.offset, ULTIMATE.start_main_~nondetArea~0.offset, ULTIMATE.start_cmemset_~dst.offset, ULTIMATE.start_cmemset_#res.base, ULTIMATE.start_main_~nondetArea~0.base, ULTIMATE.start_main_#t~malloc5.base, ULTIMATE.start_cmemset_#in~n, ULTIMATE.start_cmemset_~d~0.base, ULTIMATE.start_cmemset_#in~dst.base, ULTIMATE.start_cmemset_~dst.base, ULTIMATE.start_cmemset_~c, ULTIMATE.start_cmemset_#t~post1.base, ULTIMATE.start_cmemset_#res.offset, ULTIMATE.start_cmemset_#in~dst.offset, #valid, #length, ULTIMATE.start_cmemset_~n, ULTIMATE.start_cmemset_#t~pre0, ULTIMATE.start_main_#t~malloc5.offset, ULTIMATE.start_cmemset_#in~c] 9#L8true [78] L8-->L11-4: Formula: (and (< v_ULTIMATE.start_cmemset_~n_4 0) (= v_ULTIMATE.start_cmemset_~d~0.offset_2 v_ULTIMATE.start_cmemset_~dst.offset_4) (= v_ULTIMATE.start_cmemset_~d~0.base_2 v_ULTIMATE.start_cmemset_~dst.base_4)) InVars {ULTIMATE.start_cmemset_~dst.base=v_ULTIMATE.start_cmemset_~dst.base_4, ULTIMATE.start_cmemset_~dst.offset=v_ULTIMATE.start_cmemset_~dst.offset_4, ULTIMATE.start_cmemset_~n=v_ULTIMATE.start_cmemset_~n_4} OutVars{ULTIMATE.start_cmemset_~dst.base=v_ULTIMATE.start_cmemset_~dst.base_4, ULTIMATE.start_cmemset_~d~0.offset=v_ULTIMATE.start_cmemset_~d~0.offset_2, ULTIMATE.start_cmemset_~dst.offset=v_ULTIMATE.start_cmemset_~dst.offset_4, ULTIMATE.start_cmemset_~n=v_ULTIMATE.start_cmemset_~n_4, ULTIMATE.start_cmemset_~d~0.base=v_ULTIMATE.start_cmemset_~d~0.base_2} AuxVars[] AssignedVars[ULTIMATE.start_cmemset_~d~0.offset, ULTIMATE.start_cmemset_~d~0.base] 7#L11-4true [2020-06-22 09:25:57,480 INFO L796 eck$LassoCheckResult]: Loop: 7#L11-4true [47] L11-4-->L12: Formula: (and (= |v_ULTIMATE.start_cmemset_#t~post1.base_2| v_ULTIMATE.start_cmemset_~d~0.base_4) (= v_ULTIMATE.start_cmemset_~d~0.base_3 |v_ULTIMATE.start_cmemset_#t~post1.base_2|) (= v_ULTIMATE.start_cmemset_~d~0.offset_3 (+ |v_ULTIMATE.start_cmemset_#t~post1.offset_2| 1)) (= |v_ULTIMATE.start_cmemset_#t~post1.offset_2| v_ULTIMATE.start_cmemset_~d~0.offset_4)) InVars {ULTIMATE.start_cmemset_~d~0.offset=v_ULTIMATE.start_cmemset_~d~0.offset_4, ULTIMATE.start_cmemset_~d~0.base=v_ULTIMATE.start_cmemset_~d~0.base_4} OutVars{ULTIMATE.start_cmemset_~d~0.offset=v_ULTIMATE.start_cmemset_~d~0.offset_3, ULTIMATE.start_cmemset_#t~post1.offset=|v_ULTIMATE.start_cmemset_#t~post1.offset_2|, ULTIMATE.start_cmemset_#t~post1.base=|v_ULTIMATE.start_cmemset_#t~post1.base_2|, ULTIMATE.start_cmemset_~d~0.base=v_ULTIMATE.start_cmemset_~d~0.base_3} AuxVars[] AssignedVars[ULTIMATE.start_cmemset_~d~0.offset, ULTIMATE.start_cmemset_#t~post1.offset, ULTIMATE.start_cmemset_#t~post1.base, ULTIMATE.start_cmemset_~d~0.base] 6#L12true [90] L12-->L11-2: Formula: (let ((.cse0 (+ v_ULTIMATE.start_cmemset_~n_8 (- 1)))) (and (<= 0 |v_ULTIMATE.start_cmemset_#t~post1.offset_9|) (= 1 (select |v_#valid_18| |v_ULTIMATE.start_cmemset_#t~post1.base_10|)) (= |v_ULTIMATE.start_cmemset_#t~pre0_7| .cse0) (= |v_#memory_int_5| (store |v_#memory_int_6| |v_ULTIMATE.start_cmemset_#t~post1.base_10| (store (select |v_#memory_int_6| |v_ULTIMATE.start_cmemset_#t~post1.base_10|) |v_ULTIMATE.start_cmemset_#t~post1.offset_9| v_ULTIMATE.start_cmemset_~c_5))) (= v_ULTIMATE.start_cmemset_~n_7 .cse0) (<= (+ |v_ULTIMATE.start_cmemset_#t~post1.offset_9| 1) (select |v_#length_6| |v_ULTIMATE.start_cmemset_#t~post1.base_10|)))) InVars {ULTIMATE.start_cmemset_#t~post1.offset=|v_ULTIMATE.start_cmemset_#t~post1.offset_9|, ULTIMATE.start_cmemset_~c=v_ULTIMATE.start_cmemset_~c_5, ULTIMATE.start_cmemset_#t~post1.base=|v_ULTIMATE.start_cmemset_#t~post1.base_10|, #valid=|v_#valid_18|, #memory_int=|v_#memory_int_6|, #length=|v_#length_6|, ULTIMATE.start_cmemset_~n=v_ULTIMATE.start_cmemset_~n_8} OutVars{ULTIMATE.start_cmemset_#t~post1.offset=|v_ULTIMATE.start_cmemset_#t~post1.offset_8|, ULTIMATE.start_cmemset_~c=v_ULTIMATE.start_cmemset_~c_5, ULTIMATE.start_cmemset_#t~post1.base=|v_ULTIMATE.start_cmemset_#t~post1.base_9|, #valid=|v_#valid_18|, #memory_int=|v_#memory_int_5|, #length=|v_#length_6|, ULTIMATE.start_cmemset_~n=v_ULTIMATE.start_cmemset_~n_7, ULTIMATE.start_cmemset_#t~pre0=|v_ULTIMATE.start_cmemset_#t~pre0_7|} AuxVars[] AssignedVars[ULTIMATE.start_cmemset_#t~post1.offset, ULTIMATE.start_cmemset_#t~post1.base, #memory_int, ULTIMATE.start_cmemset_~n, ULTIMATE.start_cmemset_#t~pre0] 10#L11-2true [83] L11-2-->L11-4: Formula: (< 0 |v_ULTIMATE.start_cmemset_#t~pre0_2|) InVars {ULTIMATE.start_cmemset_#t~pre0=|v_ULTIMATE.start_cmemset_#t~pre0_2|} OutVars{ULTIMATE.start_cmemset_#t~pre0=|v_ULTIMATE.start_cmemset_#t~pre0_1|} AuxVars[] AssignedVars[ULTIMATE.start_cmemset_#t~pre0] 7#L11-4true [2020-06-22 09:25:57,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:25:57,481 INFO L82 PathProgramCache]: Analyzing trace with hash 109000976, now seen corresponding path program 1 times [2020-06-22 09:25:57,481 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:25:57,481 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:25:57,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:25:57,482 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:25:57,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:25:57,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:25:57,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 09:25:57,505 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 09:25:57,505 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-06-22 09:25:57,506 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-06-22 09:25:57,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:25:57,506 INFO L82 PathProgramCache]: Analyzing trace with hash 77831, now seen corresponding path program 1 times [2020-06-22 09:25:57,506 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:25:57,506 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:25:57,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:25:57,507 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:25:57,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:25:57,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:25:57,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:25:57,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-06-22 09:25:57,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-06-22 09:25:57,590 INFO L87 Difference]: Start difference. First operand 10 states. Second operand 4 states. [2020-06-22 09:25:57,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:25:57,630 INFO L93 Difference]: Finished difference Result 14 states and 22 transitions. [2020-06-22 09:25:57,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-06-22 09:25:57,633 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 22 transitions. [2020-06-22 09:25:57,634 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-06-22 09:25:57,634 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 10 states and 14 transitions. [2020-06-22 09:25:57,635 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2020-06-22 09:25:57,636 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2020-06-22 09:25:57,636 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 14 transitions. [2020-06-22 09:25:57,637 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 09:25:57,637 INFO L706 BuchiCegarLoop]: Abstraction has 10 states and 14 transitions. [2020-06-22 09:25:57,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 14 transitions. [2020-06-22 09:25:57,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 8. [2020-06-22 09:25:57,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-06-22 09:25:57,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 12 transitions. [2020-06-22 09:25:57,639 INFO L729 BuchiCegarLoop]: Abstraction has 8 states and 12 transitions. [2020-06-22 09:25:57,639 INFO L609 BuchiCegarLoop]: Abstraction has 8 states and 12 transitions. [2020-06-22 09:25:57,639 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2020-06-22 09:25:57,639 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 12 transitions. [2020-06-22 09:25:57,640 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-06-22 09:25:57,640 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 09:25:57,640 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 09:25:57,640 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-06-22 09:25:57,640 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-06-22 09:25:57,641 INFO L794 eck$LassoCheckResult]: Stem: 36#ULTIMATE.startENTRY [85] ULTIMATE.startENTRY-->L22: Formula: (and (= (store |v_#valid_10| 0 0) |v_#valid_9|) (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|)) InVars {#valid=|v_#valid_10|} OutVars{ULTIMATE.start_main_#t~ret6.base=|v_ULTIMATE.start_main_#t~ret6.base_4|, ULTIMATE.start_main_~nondetArea~0.offset=v_ULTIMATE.start_main_~nondetArea~0.offset_3, ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_6|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_6|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_6|, ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_5, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_8, ULTIMATE.start_main_#t~ret6.offset=|v_ULTIMATE.start_main_#t~ret6.offset_4|, ULTIMATE.start_main_~nondetArea~0.base=v_ULTIMATE.start_main_~nondetArea~0.base_3, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~malloc5.base=|v_ULTIMATE.start_main_#t~malloc5.base_5|, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, #valid=|v_#valid_9|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_7, ULTIMATE.start_main_#t~malloc5.offset=|v_ULTIMATE.start_main_#t~malloc5.offset_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret6.base, ULTIMATE.start_main_~nondetArea~0.offset, ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~n~0, ULTIMATE.start_main_#t~ret6.offset, ULTIMATE.start_main_~nondetArea~0.base, #NULL.offset, ULTIMATE.start_main_#t~malloc5.base, #NULL.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_~length~0, ULTIMATE.start_main_#t~malloc5.offset] 37#L22 [61] L22-->L22-2: Formula: (and (< v_ULTIMATE.start_main_~length~0_5 1) (= v_ULTIMATE.start_main_~length~0_4 1)) InVars {ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_5} OutVars{ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_~length~0] 38#L22-2 [55] L22-2-->L25-1: Formula: (and (= v_ULTIMATE.start_main_~n~0_4 1) (< v_ULTIMATE.start_main_~n~0_5 1)) InVars {ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_5} OutVars{ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_~n~0] 42#L25-1 [76] L25-1-->L8: Formula: (and (= v_ULTIMATE.start_cmemset_~c_1 |v_ULTIMATE.start_cmemset_#in~c_1|) (= 0 |v_ULTIMATE.start_main_#t~malloc5.offset_4|) (= |v_#valid_5| (store |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc5.base_4| 1)) (= |v_ULTIMATE.start_cmemset_#in~dst.offset_1| v_ULTIMATE.start_main_~nondetArea~0.offset_2) (= |v_ULTIMATE.start_cmemset_#in~c_1| v_ULTIMATE.start_main_~c~0_4) (= v_ULTIMATE.start_cmemset_~n_2 |v_ULTIMATE.start_cmemset_#in~n_1|) (= v_ULTIMATE.start_cmemset_~dst.offset_2 |v_ULTIMATE.start_cmemset_#in~dst.offset_1|) (= v_ULTIMATE.start_main_~nondetArea~0.offset_2 |v_ULTIMATE.start_main_#t~malloc5.offset_4|) (= |v_ULTIMATE.start_cmemset_#in~n_1| v_ULTIMATE.start_main_~n~0_7) (> |v_ULTIMATE.start_main_#t~malloc5.base_4| 0) (= (select |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc5.base_4|) 0) (= v_ULTIMATE.start_cmemset_~dst.base_2 |v_ULTIMATE.start_cmemset_#in~dst.base_1|) (< |v_ULTIMATE.start_main_#t~malloc5.base_4| |v_#StackHeapBarrier_1|) (= (store |v_#length_2| |v_ULTIMATE.start_main_#t~malloc5.base_4| v_ULTIMATE.start_main_~n~0_7) |v_#length_1|) (= v_ULTIMATE.start_main_~nondetArea~0.base_2 |v_ULTIMATE.start_main_#t~malloc5.base_4|) (= |v_ULTIMATE.start_cmemset_#in~dst.base_1| v_ULTIMATE.start_main_~nondetArea~0.base_2)) InVars {ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7, ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_4, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_6|} OutVars{ULTIMATE.start_cmemset_~d~0.offset=v_ULTIMATE.start_cmemset_~d~0.offset_1, ULTIMATE.start_main_~nondetArea~0.offset=v_ULTIMATE.start_main_~nondetArea~0.offset_2, ULTIMATE.start_cmemset_~dst.offset=v_ULTIMATE.start_cmemset_~dst.offset_2, ULTIMATE.start_cmemset_#res.base=|v_ULTIMATE.start_cmemset_#res.base_3|, ULTIMATE.start_main_~nondetArea~0.base=v_ULTIMATE.start_main_~nondetArea~0.base_2, ULTIMATE.start_cmemset_#in~dst.base=|v_ULTIMATE.start_cmemset_#in~dst.base_1|, ULTIMATE.start_cmemset_#t~post1.base=|v_ULTIMATE.start_cmemset_#t~post1.base_1|, ULTIMATE.start_cmemset_#in~dst.offset=|v_ULTIMATE.start_cmemset_#in~dst.offset_1|, #length=|v_#length_1|, ULTIMATE.start_cmemset_#t~post1.offset=|v_ULTIMATE.start_cmemset_#t~post1.offset_1|, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7, ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_4, ULTIMATE.start_main_#t~malloc5.base=|v_ULTIMATE.start_main_#t~malloc5.base_4|, ULTIMATE.start_cmemset_#in~n=|v_ULTIMATE.start_cmemset_#in~n_1|, ULTIMATE.start_cmemset_~d~0.base=v_ULTIMATE.start_cmemset_~d~0.base_1, ULTIMATE.start_cmemset_~dst.base=v_ULTIMATE.start_cmemset_~dst.base_2, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_cmemset_~c=v_ULTIMATE.start_cmemset_~c_1, ULTIMATE.start_cmemset_#res.offset=|v_ULTIMATE.start_cmemset_#res.offset_3|, #valid=|v_#valid_5|, ULTIMATE.start_cmemset_~n=v_ULTIMATE.start_cmemset_~n_2, ULTIMATE.start_cmemset_#t~pre0=|v_ULTIMATE.start_cmemset_#t~pre0_3|, ULTIMATE.start_main_#t~malloc5.offset=|v_ULTIMATE.start_main_#t~malloc5.offset_4|, ULTIMATE.start_cmemset_#in~c=|v_ULTIMATE.start_cmemset_#in~c_1|} AuxVars[] AssignedVars[ULTIMATE.start_cmemset_~d~0.offset, ULTIMATE.start_cmemset_#t~post1.offset, ULTIMATE.start_main_~nondetArea~0.offset, ULTIMATE.start_cmemset_~dst.offset, ULTIMATE.start_cmemset_#res.base, ULTIMATE.start_main_~nondetArea~0.base, ULTIMATE.start_main_#t~malloc5.base, ULTIMATE.start_cmemset_#in~n, ULTIMATE.start_cmemset_~d~0.base, ULTIMATE.start_cmemset_#in~dst.base, ULTIMATE.start_cmemset_~dst.base, ULTIMATE.start_cmemset_~c, ULTIMATE.start_cmemset_#t~post1.base, ULTIMATE.start_cmemset_#res.offset, ULTIMATE.start_cmemset_#in~dst.offset, #valid, #length, ULTIMATE.start_cmemset_~n, ULTIMATE.start_cmemset_#t~pre0, ULTIMATE.start_main_#t~malloc5.offset, ULTIMATE.start_cmemset_#in~c] 43#L8 [77] L8-->L11-4: Formula: (and (= v_ULTIMATE.start_cmemset_~d~0.offset_2 v_ULTIMATE.start_cmemset_~dst.offset_4) (> v_ULTIMATE.start_cmemset_~n_4 0) (= v_ULTIMATE.start_cmemset_~d~0.base_2 v_ULTIMATE.start_cmemset_~dst.base_4)) InVars {ULTIMATE.start_cmemset_~dst.base=v_ULTIMATE.start_cmemset_~dst.base_4, ULTIMATE.start_cmemset_~dst.offset=v_ULTIMATE.start_cmemset_~dst.offset_4, ULTIMATE.start_cmemset_~n=v_ULTIMATE.start_cmemset_~n_4} OutVars{ULTIMATE.start_cmemset_~dst.base=v_ULTIMATE.start_cmemset_~dst.base_4, ULTIMATE.start_cmemset_~d~0.offset=v_ULTIMATE.start_cmemset_~d~0.offset_2, ULTIMATE.start_cmemset_~dst.offset=v_ULTIMATE.start_cmemset_~dst.offset_4, ULTIMATE.start_cmemset_~n=v_ULTIMATE.start_cmemset_~n_4, ULTIMATE.start_cmemset_~d~0.base=v_ULTIMATE.start_cmemset_~d~0.base_2} AuxVars[] AssignedVars[ULTIMATE.start_cmemset_~d~0.offset, ULTIMATE.start_cmemset_~d~0.base] 41#L11-4 [2020-06-22 09:25:57,641 INFO L796 eck$LassoCheckResult]: Loop: 41#L11-4 [47] L11-4-->L12: Formula: (and (= |v_ULTIMATE.start_cmemset_#t~post1.base_2| v_ULTIMATE.start_cmemset_~d~0.base_4) (= v_ULTIMATE.start_cmemset_~d~0.base_3 |v_ULTIMATE.start_cmemset_#t~post1.base_2|) (= v_ULTIMATE.start_cmemset_~d~0.offset_3 (+ |v_ULTIMATE.start_cmemset_#t~post1.offset_2| 1)) (= |v_ULTIMATE.start_cmemset_#t~post1.offset_2| v_ULTIMATE.start_cmemset_~d~0.offset_4)) InVars {ULTIMATE.start_cmemset_~d~0.offset=v_ULTIMATE.start_cmemset_~d~0.offset_4, ULTIMATE.start_cmemset_~d~0.base=v_ULTIMATE.start_cmemset_~d~0.base_4} OutVars{ULTIMATE.start_cmemset_~d~0.offset=v_ULTIMATE.start_cmemset_~d~0.offset_3, ULTIMATE.start_cmemset_#t~post1.offset=|v_ULTIMATE.start_cmemset_#t~post1.offset_2|, ULTIMATE.start_cmemset_#t~post1.base=|v_ULTIMATE.start_cmemset_#t~post1.base_2|, ULTIMATE.start_cmemset_~d~0.base=v_ULTIMATE.start_cmemset_~d~0.base_3} AuxVars[] AssignedVars[ULTIMATE.start_cmemset_~d~0.offset, ULTIMATE.start_cmemset_#t~post1.offset, ULTIMATE.start_cmemset_#t~post1.base, ULTIMATE.start_cmemset_~d~0.base] 39#L12 [90] L12-->L11-2: Formula: (let ((.cse0 (+ v_ULTIMATE.start_cmemset_~n_8 (- 1)))) (and (<= 0 |v_ULTIMATE.start_cmemset_#t~post1.offset_9|) (= 1 (select |v_#valid_18| |v_ULTIMATE.start_cmemset_#t~post1.base_10|)) (= |v_ULTIMATE.start_cmemset_#t~pre0_7| .cse0) (= |v_#memory_int_5| (store |v_#memory_int_6| |v_ULTIMATE.start_cmemset_#t~post1.base_10| (store (select |v_#memory_int_6| |v_ULTIMATE.start_cmemset_#t~post1.base_10|) |v_ULTIMATE.start_cmemset_#t~post1.offset_9| v_ULTIMATE.start_cmemset_~c_5))) (= v_ULTIMATE.start_cmemset_~n_7 .cse0) (<= (+ |v_ULTIMATE.start_cmemset_#t~post1.offset_9| 1) (select |v_#length_6| |v_ULTIMATE.start_cmemset_#t~post1.base_10|)))) InVars {ULTIMATE.start_cmemset_#t~post1.offset=|v_ULTIMATE.start_cmemset_#t~post1.offset_9|, ULTIMATE.start_cmemset_~c=v_ULTIMATE.start_cmemset_~c_5, ULTIMATE.start_cmemset_#t~post1.base=|v_ULTIMATE.start_cmemset_#t~post1.base_10|, #valid=|v_#valid_18|, #memory_int=|v_#memory_int_6|, #length=|v_#length_6|, ULTIMATE.start_cmemset_~n=v_ULTIMATE.start_cmemset_~n_8} OutVars{ULTIMATE.start_cmemset_#t~post1.offset=|v_ULTIMATE.start_cmemset_#t~post1.offset_8|, ULTIMATE.start_cmemset_~c=v_ULTIMATE.start_cmemset_~c_5, ULTIMATE.start_cmemset_#t~post1.base=|v_ULTIMATE.start_cmemset_#t~post1.base_9|, #valid=|v_#valid_18|, #memory_int=|v_#memory_int_5|, #length=|v_#length_6|, ULTIMATE.start_cmemset_~n=v_ULTIMATE.start_cmemset_~n_7, ULTIMATE.start_cmemset_#t~pre0=|v_ULTIMATE.start_cmemset_#t~pre0_7|} AuxVars[] AssignedVars[ULTIMATE.start_cmemset_#t~post1.offset, ULTIMATE.start_cmemset_#t~post1.base, #memory_int, ULTIMATE.start_cmemset_~n, ULTIMATE.start_cmemset_#t~pre0] 40#L11-2 [83] L11-2-->L11-4: Formula: (< 0 |v_ULTIMATE.start_cmemset_#t~pre0_2|) InVars {ULTIMATE.start_cmemset_#t~pre0=|v_ULTIMATE.start_cmemset_#t~pre0_2|} OutVars{ULTIMATE.start_cmemset_#t~pre0=|v_ULTIMATE.start_cmemset_#t~pre0_1|} AuxVars[] AssignedVars[ULTIMATE.start_cmemset_#t~pre0] 41#L11-4 [2020-06-22 09:25:57,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:25:57,642 INFO L82 PathProgramCache]: Analyzing trace with hash 109000975, now seen corresponding path program 1 times [2020-06-22 09:25:57,642 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:25:57,642 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:25:57,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:25:57,643 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:25:57,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:25:57,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:25:57,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:25:57,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:25:57,655 INFO L82 PathProgramCache]: Analyzing trace with hash 77831, now seen corresponding path program 2 times [2020-06-22 09:25:57,655 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:25:57,656 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:25:57,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:25:57,656 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:25:57,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:25:57,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:25:57,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:25:57,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:25:57,665 INFO L82 PathProgramCache]: Analyzing trace with hash 252818489, now seen corresponding path program 1 times [2020-06-22 09:25:57,665 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:25:57,665 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:25:57,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:25:57,666 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 09:25:57,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:25:57,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:25:57,693 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 09:25:57,694 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 09:25:57,694 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-06-22 09:25:57,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-06-22 09:25:57,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-06-22 09:25:57,748 INFO L87 Difference]: Start difference. First operand 8 states and 12 transitions. cyclomatic complexity: 5 Second operand 5 states. [2020-06-22 09:25:57,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:25:57,791 INFO L93 Difference]: Finished difference Result 13 states and 18 transitions. [2020-06-22 09:25:57,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-06-22 09:25:57,792 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 18 transitions. [2020-06-22 09:25:57,793 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2020-06-22 09:25:57,793 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 13 states and 18 transitions. [2020-06-22 09:25:57,793 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2020-06-22 09:25:57,793 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2020-06-22 09:25:57,794 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 18 transitions. [2020-06-22 09:25:57,794 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 09:25:57,794 INFO L706 BuchiCegarLoop]: Abstraction has 13 states and 18 transitions. [2020-06-22 09:25:57,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 18 transitions. [2020-06-22 09:25:57,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2020-06-22 09:25:57,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-06-22 09:25:57,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 18 transitions. [2020-06-22 09:25:57,796 INFO L729 BuchiCegarLoop]: Abstraction has 13 states and 18 transitions. [2020-06-22 09:25:57,796 INFO L609 BuchiCegarLoop]: Abstraction has 13 states and 18 transitions. [2020-06-22 09:25:57,796 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2020-06-22 09:25:57,796 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 18 transitions. [2020-06-22 09:25:57,796 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2020-06-22 09:25:57,797 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 09:25:57,797 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 09:25:57,797 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-06-22 09:25:57,797 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-06-22 09:25:57,798 INFO L794 eck$LassoCheckResult]: Stem: 71#ULTIMATE.startENTRY [85] ULTIMATE.startENTRY-->L22: Formula: (and (= (store |v_#valid_10| 0 0) |v_#valid_9|) (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|)) InVars {#valid=|v_#valid_10|} OutVars{ULTIMATE.start_main_#t~ret6.base=|v_ULTIMATE.start_main_#t~ret6.base_4|, ULTIMATE.start_main_~nondetArea~0.offset=v_ULTIMATE.start_main_~nondetArea~0.offset_3, ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_6|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_6|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_6|, ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_5, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_8, ULTIMATE.start_main_#t~ret6.offset=|v_ULTIMATE.start_main_#t~ret6.offset_4|, ULTIMATE.start_main_~nondetArea~0.base=v_ULTIMATE.start_main_~nondetArea~0.base_3, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~malloc5.base=|v_ULTIMATE.start_main_#t~malloc5.base_5|, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, #valid=|v_#valid_9|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_7, ULTIMATE.start_main_#t~malloc5.offset=|v_ULTIMATE.start_main_#t~malloc5.offset_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret6.base, ULTIMATE.start_main_~nondetArea~0.offset, ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~n~0, ULTIMATE.start_main_#t~ret6.offset, ULTIMATE.start_main_~nondetArea~0.base, #NULL.offset, ULTIMATE.start_main_#t~malloc5.base, #NULL.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_~length~0, ULTIMATE.start_main_#t~malloc5.offset] 72#L22 [61] L22-->L22-2: Formula: (and (< v_ULTIMATE.start_main_~length~0_5 1) (= v_ULTIMATE.start_main_~length~0_4 1)) InVars {ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_5} OutVars{ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_~length~0] 73#L22-2 [69] L22-2-->L25-1: Formula: (>= v_ULTIMATE.start_main_~n~0_6 1) InVars {ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_6} OutVars{ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_6} AuxVars[] AssignedVars[] 79#L25-1 [76] L25-1-->L8: Formula: (and (= v_ULTIMATE.start_cmemset_~c_1 |v_ULTIMATE.start_cmemset_#in~c_1|) (= 0 |v_ULTIMATE.start_main_#t~malloc5.offset_4|) (= |v_#valid_5| (store |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc5.base_4| 1)) (= |v_ULTIMATE.start_cmemset_#in~dst.offset_1| v_ULTIMATE.start_main_~nondetArea~0.offset_2) (= |v_ULTIMATE.start_cmemset_#in~c_1| v_ULTIMATE.start_main_~c~0_4) (= v_ULTIMATE.start_cmemset_~n_2 |v_ULTIMATE.start_cmemset_#in~n_1|) (= v_ULTIMATE.start_cmemset_~dst.offset_2 |v_ULTIMATE.start_cmemset_#in~dst.offset_1|) (= v_ULTIMATE.start_main_~nondetArea~0.offset_2 |v_ULTIMATE.start_main_#t~malloc5.offset_4|) (= |v_ULTIMATE.start_cmemset_#in~n_1| v_ULTIMATE.start_main_~n~0_7) (> |v_ULTIMATE.start_main_#t~malloc5.base_4| 0) (= (select |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc5.base_4|) 0) (= v_ULTIMATE.start_cmemset_~dst.base_2 |v_ULTIMATE.start_cmemset_#in~dst.base_1|) (< |v_ULTIMATE.start_main_#t~malloc5.base_4| |v_#StackHeapBarrier_1|) (= (store |v_#length_2| |v_ULTIMATE.start_main_#t~malloc5.base_4| v_ULTIMATE.start_main_~n~0_7) |v_#length_1|) (= v_ULTIMATE.start_main_~nondetArea~0.base_2 |v_ULTIMATE.start_main_#t~malloc5.base_4|) (= |v_ULTIMATE.start_cmemset_#in~dst.base_1| v_ULTIMATE.start_main_~nondetArea~0.base_2)) InVars {ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7, ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_4, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_6|} OutVars{ULTIMATE.start_cmemset_~d~0.offset=v_ULTIMATE.start_cmemset_~d~0.offset_1, ULTIMATE.start_main_~nondetArea~0.offset=v_ULTIMATE.start_main_~nondetArea~0.offset_2, ULTIMATE.start_cmemset_~dst.offset=v_ULTIMATE.start_cmemset_~dst.offset_2, ULTIMATE.start_cmemset_#res.base=|v_ULTIMATE.start_cmemset_#res.base_3|, ULTIMATE.start_main_~nondetArea~0.base=v_ULTIMATE.start_main_~nondetArea~0.base_2, ULTIMATE.start_cmemset_#in~dst.base=|v_ULTIMATE.start_cmemset_#in~dst.base_1|, ULTIMATE.start_cmemset_#t~post1.base=|v_ULTIMATE.start_cmemset_#t~post1.base_1|, ULTIMATE.start_cmemset_#in~dst.offset=|v_ULTIMATE.start_cmemset_#in~dst.offset_1|, #length=|v_#length_1|, ULTIMATE.start_cmemset_#t~post1.offset=|v_ULTIMATE.start_cmemset_#t~post1.offset_1|, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7, ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_4, ULTIMATE.start_main_#t~malloc5.base=|v_ULTIMATE.start_main_#t~malloc5.base_4|, ULTIMATE.start_cmemset_#in~n=|v_ULTIMATE.start_cmemset_#in~n_1|, ULTIMATE.start_cmemset_~d~0.base=v_ULTIMATE.start_cmemset_~d~0.base_1, ULTIMATE.start_cmemset_~dst.base=v_ULTIMATE.start_cmemset_~dst.base_2, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_cmemset_~c=v_ULTIMATE.start_cmemset_~c_1, ULTIMATE.start_cmemset_#res.offset=|v_ULTIMATE.start_cmemset_#res.offset_3|, #valid=|v_#valid_5|, ULTIMATE.start_cmemset_~n=v_ULTIMATE.start_cmemset_~n_2, ULTIMATE.start_cmemset_#t~pre0=|v_ULTIMATE.start_cmemset_#t~pre0_3|, ULTIMATE.start_main_#t~malloc5.offset=|v_ULTIMATE.start_main_#t~malloc5.offset_4|, ULTIMATE.start_cmemset_#in~c=|v_ULTIMATE.start_cmemset_#in~c_1|} AuxVars[] AssignedVars[ULTIMATE.start_cmemset_~d~0.offset, ULTIMATE.start_cmemset_#t~post1.offset, ULTIMATE.start_main_~nondetArea~0.offset, ULTIMATE.start_cmemset_~dst.offset, ULTIMATE.start_cmemset_#res.base, ULTIMATE.start_main_~nondetArea~0.base, ULTIMATE.start_main_#t~malloc5.base, ULTIMATE.start_cmemset_#in~n, ULTIMATE.start_cmemset_~d~0.base, ULTIMATE.start_cmemset_#in~dst.base, ULTIMATE.start_cmemset_~dst.base, ULTIMATE.start_cmemset_~c, ULTIMATE.start_cmemset_#t~post1.base, ULTIMATE.start_cmemset_#res.offset, ULTIMATE.start_cmemset_#in~dst.offset, #valid, #length, ULTIMATE.start_cmemset_~n, ULTIMATE.start_cmemset_#t~pre0, ULTIMATE.start_main_#t~malloc5.offset, ULTIMATE.start_cmemset_#in~c] 83#L8 [77] L8-->L11-4: Formula: (and (= v_ULTIMATE.start_cmemset_~d~0.offset_2 v_ULTIMATE.start_cmemset_~dst.offset_4) (> v_ULTIMATE.start_cmemset_~n_4 0) (= v_ULTIMATE.start_cmemset_~d~0.base_2 v_ULTIMATE.start_cmemset_~dst.base_4)) InVars {ULTIMATE.start_cmemset_~dst.base=v_ULTIMATE.start_cmemset_~dst.base_4, ULTIMATE.start_cmemset_~dst.offset=v_ULTIMATE.start_cmemset_~dst.offset_4, ULTIMATE.start_cmemset_~n=v_ULTIMATE.start_cmemset_~n_4} OutVars{ULTIMATE.start_cmemset_~dst.base=v_ULTIMATE.start_cmemset_~dst.base_4, ULTIMATE.start_cmemset_~d~0.offset=v_ULTIMATE.start_cmemset_~d~0.offset_2, ULTIMATE.start_cmemset_~dst.offset=v_ULTIMATE.start_cmemset_~dst.offset_4, ULTIMATE.start_cmemset_~n=v_ULTIMATE.start_cmemset_~n_4, ULTIMATE.start_cmemset_~d~0.base=v_ULTIMATE.start_cmemset_~d~0.base_2} AuxVars[] AssignedVars[ULTIMATE.start_cmemset_~d~0.offset, ULTIMATE.start_cmemset_~d~0.base] 81#L11-4 [2020-06-22 09:25:57,798 INFO L796 eck$LassoCheckResult]: Loop: 81#L11-4 [47] L11-4-->L12: Formula: (and (= |v_ULTIMATE.start_cmemset_#t~post1.base_2| v_ULTIMATE.start_cmemset_~d~0.base_4) (= v_ULTIMATE.start_cmemset_~d~0.base_3 |v_ULTIMATE.start_cmemset_#t~post1.base_2|) (= v_ULTIMATE.start_cmemset_~d~0.offset_3 (+ |v_ULTIMATE.start_cmemset_#t~post1.offset_2| 1)) (= |v_ULTIMATE.start_cmemset_#t~post1.offset_2| v_ULTIMATE.start_cmemset_~d~0.offset_4)) InVars {ULTIMATE.start_cmemset_~d~0.offset=v_ULTIMATE.start_cmemset_~d~0.offset_4, ULTIMATE.start_cmemset_~d~0.base=v_ULTIMATE.start_cmemset_~d~0.base_4} OutVars{ULTIMATE.start_cmemset_~d~0.offset=v_ULTIMATE.start_cmemset_~d~0.offset_3, ULTIMATE.start_cmemset_#t~post1.offset=|v_ULTIMATE.start_cmemset_#t~post1.offset_2|, ULTIMATE.start_cmemset_#t~post1.base=|v_ULTIMATE.start_cmemset_#t~post1.base_2|, ULTIMATE.start_cmemset_~d~0.base=v_ULTIMATE.start_cmemset_~d~0.base_3} AuxVars[] AssignedVars[ULTIMATE.start_cmemset_~d~0.offset, ULTIMATE.start_cmemset_#t~post1.offset, ULTIMATE.start_cmemset_#t~post1.base, ULTIMATE.start_cmemset_~d~0.base] 82#L12 [90] L12-->L11-2: Formula: (let ((.cse0 (+ v_ULTIMATE.start_cmemset_~n_8 (- 1)))) (and (<= 0 |v_ULTIMATE.start_cmemset_#t~post1.offset_9|) (= 1 (select |v_#valid_18| |v_ULTIMATE.start_cmemset_#t~post1.base_10|)) (= |v_ULTIMATE.start_cmemset_#t~pre0_7| .cse0) (= |v_#memory_int_5| (store |v_#memory_int_6| |v_ULTIMATE.start_cmemset_#t~post1.base_10| (store (select |v_#memory_int_6| |v_ULTIMATE.start_cmemset_#t~post1.base_10|) |v_ULTIMATE.start_cmemset_#t~post1.offset_9| v_ULTIMATE.start_cmemset_~c_5))) (= v_ULTIMATE.start_cmemset_~n_7 .cse0) (<= (+ |v_ULTIMATE.start_cmemset_#t~post1.offset_9| 1) (select |v_#length_6| |v_ULTIMATE.start_cmemset_#t~post1.base_10|)))) InVars {ULTIMATE.start_cmemset_#t~post1.offset=|v_ULTIMATE.start_cmemset_#t~post1.offset_9|, ULTIMATE.start_cmemset_~c=v_ULTIMATE.start_cmemset_~c_5, ULTIMATE.start_cmemset_#t~post1.base=|v_ULTIMATE.start_cmemset_#t~post1.base_10|, #valid=|v_#valid_18|, #memory_int=|v_#memory_int_6|, #length=|v_#length_6|, ULTIMATE.start_cmemset_~n=v_ULTIMATE.start_cmemset_~n_8} OutVars{ULTIMATE.start_cmemset_#t~post1.offset=|v_ULTIMATE.start_cmemset_#t~post1.offset_8|, ULTIMATE.start_cmemset_~c=v_ULTIMATE.start_cmemset_~c_5, ULTIMATE.start_cmemset_#t~post1.base=|v_ULTIMATE.start_cmemset_#t~post1.base_9|, #valid=|v_#valid_18|, #memory_int=|v_#memory_int_5|, #length=|v_#length_6|, ULTIMATE.start_cmemset_~n=v_ULTIMATE.start_cmemset_~n_7, ULTIMATE.start_cmemset_#t~pre0=|v_ULTIMATE.start_cmemset_#t~pre0_7|} AuxVars[] AssignedVars[ULTIMATE.start_cmemset_#t~post1.offset, ULTIMATE.start_cmemset_#t~post1.base, #memory_int, ULTIMATE.start_cmemset_~n, ULTIMATE.start_cmemset_#t~pre0] 80#L11-2 [83] L11-2-->L11-4: Formula: (< 0 |v_ULTIMATE.start_cmemset_#t~pre0_2|) InVars {ULTIMATE.start_cmemset_#t~pre0=|v_ULTIMATE.start_cmemset_#t~pre0_2|} OutVars{ULTIMATE.start_cmemset_#t~pre0=|v_ULTIMATE.start_cmemset_#t~pre0_1|} AuxVars[] AssignedVars[ULTIMATE.start_cmemset_#t~pre0] 81#L11-4 [2020-06-22 09:25:57,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:25:57,798 INFO L82 PathProgramCache]: Analyzing trace with hash 109014429, now seen corresponding path program 1 times [2020-06-22 09:25:57,798 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:25:57,798 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:25:57,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:25:57,799 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:25:57,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:25:57,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:25:57,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:25:57,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:25:57,810 INFO L82 PathProgramCache]: Analyzing trace with hash 77831, now seen corresponding path program 3 times [2020-06-22 09:25:57,810 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:25:57,810 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:25:57,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:25:57,811 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:25:57,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:25:57,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:25:57,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:25:57,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:25:57,818 INFO L82 PathProgramCache]: Analyzing trace with hash 653626603, now seen corresponding path program 1 times [2020-06-22 09:25:57,818 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:25:57,818 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:25:57,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:25:57,819 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 09:25:57,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:25:57,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:25:57,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:25:58,013 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 57 [2020-06-22 09:25:58,093 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 09:25:58,095 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 09:25:58,095 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 09:25:58,095 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 09:25:58,095 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 09:25:58,095 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 09:25:58,096 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 09:25:58,096 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 09:25:58,096 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration3_Lasso [2020-06-22 09:25:58,096 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 09:25:58,097 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 09:25:58,114 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:25:58,119 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:25:58,121 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:25:58,122 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:25:58,124 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:25:58,126 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:25:58,128 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:25:58,275 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:25:58,277 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:25:58,279 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:25:58,280 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:25:58,282 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:25:58,283 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:25:58,285 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:25:58,286 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:25:58,536 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 09:25:58,541 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 09:25:58,543 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 09:25:58,545 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:25:58,545 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:25:58,546 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:25:58,546 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:25:58,546 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:25:58,548 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 09:25:58,548 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:25:58,550 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:25:58,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-22 09:25:58,551 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:25:58,551 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:25:58,551 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:25:58,551 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:25:58,551 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:25:58,552 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 09:25:58,552 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:25:58,552 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:25:58,553 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 09:25:58,553 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:25:58,553 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:25:58,553 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:25:58,553 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:25:58,554 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:25:58,554 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 09:25:58,554 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:25:58,555 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:25:58,555 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 09:25:58,555 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:25:58,555 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:25:58,556 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:25:58,556 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:25:58,556 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:25:58,556 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 09:25:58,556 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:25:58,557 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:25:58,557 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 09:25:58,557 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:25:58,558 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:25:58,558 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:25:58,558 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:25:58,560 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 09:25:58,560 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 09:25:58,563 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:25:58,563 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 09:25:58,564 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:25:58,564 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:25:58,564 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:25:58,564 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:25:58,564 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:25:58,565 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 09:25:58,565 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:25:58,565 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:25:58,566 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 09:25:58,566 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:25:58,566 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:25:58,566 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:25:58,566 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:25:58,566 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:25:58,567 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 09:25:58,567 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:25:58,568 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:25:58,568 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 09:25:58,568 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:25:58,569 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:25:58,569 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:25:58,569 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:25:58,588 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 09:25:58,589 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 09:25:58,631 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 09:25:58,665 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-06-22 09:25:58,665 INFO L444 ModelExtractionUtils]: 29 out of 34 variables were initially zero. Simplification set additionally 3 variables to zero. [2020-06-22 09:25:58,668 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 09:25:58,669 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-06-22 09:25:58,670 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 09:25:58,670 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cmemset_~n) = 1*ULTIMATE.start_cmemset_~n Supporting invariants [] [2020-06-22 09:25:58,678 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2020-06-22 09:25:58,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:25:58,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:25:58,707 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 2 conjunts are in the unsatisfiable core [2020-06-22 09:25:58,707 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 09:25:58,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:25:58,716 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 5 conjunts are in the unsatisfiable core [2020-06-22 09:25:58,716 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 09:25:58,727 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 09:25:58,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:25:58,751 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 09:25:58,751 INFO L98 LoopCannibalizer]: 3 predicates before loop cannibalization 3 predicates after loop cannibalization [2020-06-22 09:25:58,755 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2020-06-22 09:25:58,756 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 13 states and 18 transitions. cyclomatic complexity: 7 Second operand 4 states. [2020-06-22 09:25:58,805 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 13 states and 18 transitions. cyclomatic complexity: 7. Second operand 4 states. Result 26 states and 34 transitions. Complement of second has 8 states. [2020-06-22 09:25:58,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2020-06-22 09:25:58,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-06-22 09:25:58,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 19 transitions. [2020-06-22 09:25:58,808 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 19 transitions. Stem has 5 letters. Loop has 3 letters. [2020-06-22 09:25:58,809 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 09:25:58,809 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 19 transitions. Stem has 8 letters. Loop has 3 letters. [2020-06-22 09:25:58,809 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 09:25:58,810 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 19 transitions. Stem has 5 letters. Loop has 6 letters. [2020-06-22 09:25:58,810 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 09:25:58,814 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 34 transitions. [2020-06-22 09:25:58,815 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2020-06-22 09:25:58,816 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 22 states and 29 transitions. [2020-06-22 09:25:58,816 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2020-06-22 09:25:58,816 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2020-06-22 09:25:58,816 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 29 transitions. [2020-06-22 09:25:58,817 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 09:25:58,817 INFO L706 BuchiCegarLoop]: Abstraction has 22 states and 29 transitions. [2020-06-22 09:25:58,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 29 transitions. [2020-06-22 09:25:58,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 15. [2020-06-22 09:25:58,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-06-22 09:25:58,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 22 transitions. [2020-06-22 09:25:58,819 INFO L729 BuchiCegarLoop]: Abstraction has 15 states and 22 transitions. [2020-06-22 09:25:58,819 INFO L609 BuchiCegarLoop]: Abstraction has 15 states and 22 transitions. [2020-06-22 09:25:58,819 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2020-06-22 09:25:58,819 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 22 transitions. [2020-06-22 09:25:58,820 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-06-22 09:25:58,820 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 09:25:58,820 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 09:25:58,820 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-06-22 09:25:58,820 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-06-22 09:25:58,821 INFO L794 eck$LassoCheckResult]: Stem: 174#ULTIMATE.startENTRY [85] ULTIMATE.startENTRY-->L22: Formula: (and (= (store |v_#valid_10| 0 0) |v_#valid_9|) (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|)) InVars {#valid=|v_#valid_10|} OutVars{ULTIMATE.start_main_#t~ret6.base=|v_ULTIMATE.start_main_#t~ret6.base_4|, ULTIMATE.start_main_~nondetArea~0.offset=v_ULTIMATE.start_main_~nondetArea~0.offset_3, ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_6|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_6|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_6|, ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_5, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_8, ULTIMATE.start_main_#t~ret6.offset=|v_ULTIMATE.start_main_#t~ret6.offset_4|, ULTIMATE.start_main_~nondetArea~0.base=v_ULTIMATE.start_main_~nondetArea~0.base_3, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~malloc5.base=|v_ULTIMATE.start_main_#t~malloc5.base_5|, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, #valid=|v_#valid_9|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_7, ULTIMATE.start_main_#t~malloc5.offset=|v_ULTIMATE.start_main_#t~malloc5.offset_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret6.base, ULTIMATE.start_main_~nondetArea~0.offset, ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~n~0, ULTIMATE.start_main_#t~ret6.offset, ULTIMATE.start_main_~nondetArea~0.base, #NULL.offset, ULTIMATE.start_main_#t~malloc5.base, #NULL.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_~length~0, ULTIMATE.start_main_#t~malloc5.offset] 175#L22 [61] L22-->L22-2: Formula: (and (< v_ULTIMATE.start_main_~length~0_5 1) (= v_ULTIMATE.start_main_~length~0_4 1)) InVars {ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_5} OutVars{ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_~length~0] 176#L22-2 [55] L22-2-->L25-1: Formula: (and (= v_ULTIMATE.start_main_~n~0_4 1) (< v_ULTIMATE.start_main_~n~0_5 1)) InVars {ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_5} OutVars{ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_~n~0] 187#L25-1 [76] L25-1-->L8: Formula: (and (= v_ULTIMATE.start_cmemset_~c_1 |v_ULTIMATE.start_cmemset_#in~c_1|) (= 0 |v_ULTIMATE.start_main_#t~malloc5.offset_4|) (= |v_#valid_5| (store |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc5.base_4| 1)) (= |v_ULTIMATE.start_cmemset_#in~dst.offset_1| v_ULTIMATE.start_main_~nondetArea~0.offset_2) (= |v_ULTIMATE.start_cmemset_#in~c_1| v_ULTIMATE.start_main_~c~0_4) (= v_ULTIMATE.start_cmemset_~n_2 |v_ULTIMATE.start_cmemset_#in~n_1|) (= v_ULTIMATE.start_cmemset_~dst.offset_2 |v_ULTIMATE.start_cmemset_#in~dst.offset_1|) (= v_ULTIMATE.start_main_~nondetArea~0.offset_2 |v_ULTIMATE.start_main_#t~malloc5.offset_4|) (= |v_ULTIMATE.start_cmemset_#in~n_1| v_ULTIMATE.start_main_~n~0_7) (> |v_ULTIMATE.start_main_#t~malloc5.base_4| 0) (= (select |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc5.base_4|) 0) (= v_ULTIMATE.start_cmemset_~dst.base_2 |v_ULTIMATE.start_cmemset_#in~dst.base_1|) (< |v_ULTIMATE.start_main_#t~malloc5.base_4| |v_#StackHeapBarrier_1|) (= (store |v_#length_2| |v_ULTIMATE.start_main_#t~malloc5.base_4| v_ULTIMATE.start_main_~n~0_7) |v_#length_1|) (= v_ULTIMATE.start_main_~nondetArea~0.base_2 |v_ULTIMATE.start_main_#t~malloc5.base_4|) (= |v_ULTIMATE.start_cmemset_#in~dst.base_1| v_ULTIMATE.start_main_~nondetArea~0.base_2)) InVars {ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7, ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_4, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_6|} OutVars{ULTIMATE.start_cmemset_~d~0.offset=v_ULTIMATE.start_cmemset_~d~0.offset_1, ULTIMATE.start_main_~nondetArea~0.offset=v_ULTIMATE.start_main_~nondetArea~0.offset_2, ULTIMATE.start_cmemset_~dst.offset=v_ULTIMATE.start_cmemset_~dst.offset_2, ULTIMATE.start_cmemset_#res.base=|v_ULTIMATE.start_cmemset_#res.base_3|, ULTIMATE.start_main_~nondetArea~0.base=v_ULTIMATE.start_main_~nondetArea~0.base_2, ULTIMATE.start_cmemset_#in~dst.base=|v_ULTIMATE.start_cmemset_#in~dst.base_1|, ULTIMATE.start_cmemset_#t~post1.base=|v_ULTIMATE.start_cmemset_#t~post1.base_1|, ULTIMATE.start_cmemset_#in~dst.offset=|v_ULTIMATE.start_cmemset_#in~dst.offset_1|, #length=|v_#length_1|, ULTIMATE.start_cmemset_#t~post1.offset=|v_ULTIMATE.start_cmemset_#t~post1.offset_1|, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7, ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_4, ULTIMATE.start_main_#t~malloc5.base=|v_ULTIMATE.start_main_#t~malloc5.base_4|, ULTIMATE.start_cmemset_#in~n=|v_ULTIMATE.start_cmemset_#in~n_1|, ULTIMATE.start_cmemset_~d~0.base=v_ULTIMATE.start_cmemset_~d~0.base_1, ULTIMATE.start_cmemset_~dst.base=v_ULTIMATE.start_cmemset_~dst.base_2, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_cmemset_~c=v_ULTIMATE.start_cmemset_~c_1, ULTIMATE.start_cmemset_#res.offset=|v_ULTIMATE.start_cmemset_#res.offset_3|, #valid=|v_#valid_5|, ULTIMATE.start_cmemset_~n=v_ULTIMATE.start_cmemset_~n_2, ULTIMATE.start_cmemset_#t~pre0=|v_ULTIMATE.start_cmemset_#t~pre0_3|, ULTIMATE.start_main_#t~malloc5.offset=|v_ULTIMATE.start_main_#t~malloc5.offset_4|, ULTIMATE.start_cmemset_#in~c=|v_ULTIMATE.start_cmemset_#in~c_1|} AuxVars[] AssignedVars[ULTIMATE.start_cmemset_~d~0.offset, ULTIMATE.start_cmemset_#t~post1.offset, ULTIMATE.start_main_~nondetArea~0.offset, ULTIMATE.start_cmemset_~dst.offset, ULTIMATE.start_cmemset_#res.base, ULTIMATE.start_main_~nondetArea~0.base, ULTIMATE.start_main_#t~malloc5.base, ULTIMATE.start_cmemset_#in~n, ULTIMATE.start_cmemset_~d~0.base, ULTIMATE.start_cmemset_#in~dst.base, ULTIMATE.start_cmemset_~dst.base, ULTIMATE.start_cmemset_~c, ULTIMATE.start_cmemset_#t~post1.base, ULTIMATE.start_cmemset_#res.offset, ULTIMATE.start_cmemset_#in~dst.offset, #valid, #length, ULTIMATE.start_cmemset_~n, ULTIMATE.start_cmemset_#t~pre0, ULTIMATE.start_main_#t~malloc5.offset, ULTIMATE.start_cmemset_#in~c] 185#L8 [77] L8-->L11-4: Formula: (and (= v_ULTIMATE.start_cmemset_~d~0.offset_2 v_ULTIMATE.start_cmemset_~dst.offset_4) (> v_ULTIMATE.start_cmemset_~n_4 0) (= v_ULTIMATE.start_cmemset_~d~0.base_2 v_ULTIMATE.start_cmemset_~dst.base_4)) InVars {ULTIMATE.start_cmemset_~dst.base=v_ULTIMATE.start_cmemset_~dst.base_4, ULTIMATE.start_cmemset_~dst.offset=v_ULTIMATE.start_cmemset_~dst.offset_4, ULTIMATE.start_cmemset_~n=v_ULTIMATE.start_cmemset_~n_4} OutVars{ULTIMATE.start_cmemset_~dst.base=v_ULTIMATE.start_cmemset_~dst.base_4, ULTIMATE.start_cmemset_~d~0.offset=v_ULTIMATE.start_cmemset_~d~0.offset_2, ULTIMATE.start_cmemset_~dst.offset=v_ULTIMATE.start_cmemset_~dst.offset_4, ULTIMATE.start_cmemset_~n=v_ULTIMATE.start_cmemset_~n_4, ULTIMATE.start_cmemset_~d~0.base=v_ULTIMATE.start_cmemset_~d~0.base_2} AuxVars[] AssignedVars[ULTIMATE.start_cmemset_~d~0.offset, ULTIMATE.start_cmemset_~d~0.base] 181#L11-4 [2020-06-22 09:25:58,821 INFO L796 eck$LassoCheckResult]: Loop: 181#L11-4 [47] L11-4-->L12: Formula: (and (= |v_ULTIMATE.start_cmemset_#t~post1.base_2| v_ULTIMATE.start_cmemset_~d~0.base_4) (= v_ULTIMATE.start_cmemset_~d~0.base_3 |v_ULTIMATE.start_cmemset_#t~post1.base_2|) (= v_ULTIMATE.start_cmemset_~d~0.offset_3 (+ |v_ULTIMATE.start_cmemset_#t~post1.offset_2| 1)) (= |v_ULTIMATE.start_cmemset_#t~post1.offset_2| v_ULTIMATE.start_cmemset_~d~0.offset_4)) InVars {ULTIMATE.start_cmemset_~d~0.offset=v_ULTIMATE.start_cmemset_~d~0.offset_4, ULTIMATE.start_cmemset_~d~0.base=v_ULTIMATE.start_cmemset_~d~0.base_4} OutVars{ULTIMATE.start_cmemset_~d~0.offset=v_ULTIMATE.start_cmemset_~d~0.offset_3, ULTIMATE.start_cmemset_#t~post1.offset=|v_ULTIMATE.start_cmemset_#t~post1.offset_2|, ULTIMATE.start_cmemset_#t~post1.base=|v_ULTIMATE.start_cmemset_#t~post1.base_2|, ULTIMATE.start_cmemset_~d~0.base=v_ULTIMATE.start_cmemset_~d~0.base_3} AuxVars[] AssignedVars[ULTIMATE.start_cmemset_~d~0.offset, ULTIMATE.start_cmemset_#t~post1.offset, ULTIMATE.start_cmemset_#t~post1.base, ULTIMATE.start_cmemset_~d~0.base] 177#L12 [90] L12-->L11-2: Formula: (let ((.cse0 (+ v_ULTIMATE.start_cmemset_~n_8 (- 1)))) (and (<= 0 |v_ULTIMATE.start_cmemset_#t~post1.offset_9|) (= 1 (select |v_#valid_18| |v_ULTIMATE.start_cmemset_#t~post1.base_10|)) (= |v_ULTIMATE.start_cmemset_#t~pre0_7| .cse0) (= |v_#memory_int_5| (store |v_#memory_int_6| |v_ULTIMATE.start_cmemset_#t~post1.base_10| (store (select |v_#memory_int_6| |v_ULTIMATE.start_cmemset_#t~post1.base_10|) |v_ULTIMATE.start_cmemset_#t~post1.offset_9| v_ULTIMATE.start_cmemset_~c_5))) (= v_ULTIMATE.start_cmemset_~n_7 .cse0) (<= (+ |v_ULTIMATE.start_cmemset_#t~post1.offset_9| 1) (select |v_#length_6| |v_ULTIMATE.start_cmemset_#t~post1.base_10|)))) InVars {ULTIMATE.start_cmemset_#t~post1.offset=|v_ULTIMATE.start_cmemset_#t~post1.offset_9|, ULTIMATE.start_cmemset_~c=v_ULTIMATE.start_cmemset_~c_5, ULTIMATE.start_cmemset_#t~post1.base=|v_ULTIMATE.start_cmemset_#t~post1.base_10|, #valid=|v_#valid_18|, #memory_int=|v_#memory_int_6|, #length=|v_#length_6|, ULTIMATE.start_cmemset_~n=v_ULTIMATE.start_cmemset_~n_8} OutVars{ULTIMATE.start_cmemset_#t~post1.offset=|v_ULTIMATE.start_cmemset_#t~post1.offset_8|, ULTIMATE.start_cmemset_~c=v_ULTIMATE.start_cmemset_~c_5, ULTIMATE.start_cmemset_#t~post1.base=|v_ULTIMATE.start_cmemset_#t~post1.base_9|, #valid=|v_#valid_18|, #memory_int=|v_#memory_int_5|, #length=|v_#length_6|, ULTIMATE.start_cmemset_~n=v_ULTIMATE.start_cmemset_~n_7, ULTIMATE.start_cmemset_#t~pre0=|v_ULTIMATE.start_cmemset_#t~pre0_7|} AuxVars[] AssignedVars[ULTIMATE.start_cmemset_#t~post1.offset, ULTIMATE.start_cmemset_#t~post1.base, #memory_int, ULTIMATE.start_cmemset_~n, ULTIMATE.start_cmemset_#t~pre0] 178#L11-2 [84] L11-2-->L11-4: Formula: (> 0 |v_ULTIMATE.start_cmemset_#t~pre0_2|) InVars {ULTIMATE.start_cmemset_#t~pre0=|v_ULTIMATE.start_cmemset_#t~pre0_2|} OutVars{ULTIMATE.start_cmemset_#t~pre0=|v_ULTIMATE.start_cmemset_#t~pre0_1|} AuxVars[] AssignedVars[ULTIMATE.start_cmemset_#t~pre0] 181#L11-4 [2020-06-22 09:25:58,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:25:58,821 INFO L82 PathProgramCache]: Analyzing trace with hash 109000975, now seen corresponding path program 2 times [2020-06-22 09:25:58,821 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:25:58,822 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:25:58,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:25:58,823 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:25:58,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:25:58,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:25:58,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:25:58,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:25:58,833 INFO L82 PathProgramCache]: Analyzing trace with hash 77832, now seen corresponding path program 1 times [2020-06-22 09:25:58,833 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:25:58,833 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:25:58,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:25:58,834 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 09:25:58,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:25:58,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:25:58,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:25:58,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:25:58,841 INFO L82 PathProgramCache]: Analyzing trace with hash 252818490, now seen corresponding path program 1 times [2020-06-22 09:25:58,841 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:25:58,841 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:25:58,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:25:58,842 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:25:58,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:25:58,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:25:58,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 09:25:58,860 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 09:25:58,861 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-06-22 09:25:58,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-06-22 09:25:58,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-06-22 09:25:58,904 INFO L87 Difference]: Start difference. First operand 15 states and 22 transitions. cyclomatic complexity: 9 Second operand 4 states. [2020-06-22 09:25:58,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:25:58,923 INFO L93 Difference]: Finished difference Result 20 states and 26 transitions. [2020-06-22 09:25:58,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-06-22 09:25:58,926 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 26 transitions. [2020-06-22 09:25:58,927 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-06-22 09:25:58,927 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 15 states and 19 transitions. [2020-06-22 09:25:58,927 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2020-06-22 09:25:58,927 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2020-06-22 09:25:58,927 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 19 transitions. [2020-06-22 09:25:58,928 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 09:25:58,928 INFO L706 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2020-06-22 09:25:58,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 19 transitions. [2020-06-22 09:25:58,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2020-06-22 09:25:58,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-06-22 09:25:58,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 19 transitions. [2020-06-22 09:25:58,929 INFO L729 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2020-06-22 09:25:58,929 INFO L609 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2020-06-22 09:25:58,929 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2020-06-22 09:25:58,929 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 19 transitions. [2020-06-22 09:25:58,930 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-06-22 09:25:58,930 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 09:25:58,930 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 09:25:58,930 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 09:25:58,931 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-06-22 09:25:58,932 INFO L794 eck$LassoCheckResult]: Stem: 218#ULTIMATE.startENTRY [85] ULTIMATE.startENTRY-->L22: Formula: (and (= (store |v_#valid_10| 0 0) |v_#valid_9|) (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|)) InVars {#valid=|v_#valid_10|} OutVars{ULTIMATE.start_main_#t~ret6.base=|v_ULTIMATE.start_main_#t~ret6.base_4|, ULTIMATE.start_main_~nondetArea~0.offset=v_ULTIMATE.start_main_~nondetArea~0.offset_3, ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_6|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_6|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_6|, ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_5, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_8, ULTIMATE.start_main_#t~ret6.offset=|v_ULTIMATE.start_main_#t~ret6.offset_4|, ULTIMATE.start_main_~nondetArea~0.base=v_ULTIMATE.start_main_~nondetArea~0.base_3, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~malloc5.base=|v_ULTIMATE.start_main_#t~malloc5.base_5|, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, #valid=|v_#valid_9|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_7, ULTIMATE.start_main_#t~malloc5.offset=|v_ULTIMATE.start_main_#t~malloc5.offset_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret6.base, ULTIMATE.start_main_~nondetArea~0.offset, ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~n~0, ULTIMATE.start_main_#t~ret6.offset, ULTIMATE.start_main_~nondetArea~0.base, #NULL.offset, ULTIMATE.start_main_#t~malloc5.base, #NULL.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_~length~0, ULTIMATE.start_main_#t~malloc5.offset] 219#L22 [61] L22-->L22-2: Formula: (and (< v_ULTIMATE.start_main_~length~0_5 1) (= v_ULTIMATE.start_main_~length~0_4 1)) InVars {ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_5} OutVars{ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_~length~0] 220#L22-2 [69] L22-2-->L25-1: Formula: (>= v_ULTIMATE.start_main_~n~0_6 1) InVars {ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_6} OutVars{ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_6} AuxVars[] AssignedVars[] 228#L25-1 [76] L25-1-->L8: Formula: (and (= v_ULTIMATE.start_cmemset_~c_1 |v_ULTIMATE.start_cmemset_#in~c_1|) (= 0 |v_ULTIMATE.start_main_#t~malloc5.offset_4|) (= |v_#valid_5| (store |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc5.base_4| 1)) (= |v_ULTIMATE.start_cmemset_#in~dst.offset_1| v_ULTIMATE.start_main_~nondetArea~0.offset_2) (= |v_ULTIMATE.start_cmemset_#in~c_1| v_ULTIMATE.start_main_~c~0_4) (= v_ULTIMATE.start_cmemset_~n_2 |v_ULTIMATE.start_cmemset_#in~n_1|) (= v_ULTIMATE.start_cmemset_~dst.offset_2 |v_ULTIMATE.start_cmemset_#in~dst.offset_1|) (= v_ULTIMATE.start_main_~nondetArea~0.offset_2 |v_ULTIMATE.start_main_#t~malloc5.offset_4|) (= |v_ULTIMATE.start_cmemset_#in~n_1| v_ULTIMATE.start_main_~n~0_7) (> |v_ULTIMATE.start_main_#t~malloc5.base_4| 0) (= (select |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc5.base_4|) 0) (= v_ULTIMATE.start_cmemset_~dst.base_2 |v_ULTIMATE.start_cmemset_#in~dst.base_1|) (< |v_ULTIMATE.start_main_#t~malloc5.base_4| |v_#StackHeapBarrier_1|) (= (store |v_#length_2| |v_ULTIMATE.start_main_#t~malloc5.base_4| v_ULTIMATE.start_main_~n~0_7) |v_#length_1|) (= v_ULTIMATE.start_main_~nondetArea~0.base_2 |v_ULTIMATE.start_main_#t~malloc5.base_4|) (= |v_ULTIMATE.start_cmemset_#in~dst.base_1| v_ULTIMATE.start_main_~nondetArea~0.base_2)) InVars {ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7, ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_4, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_6|} OutVars{ULTIMATE.start_cmemset_~d~0.offset=v_ULTIMATE.start_cmemset_~d~0.offset_1, ULTIMATE.start_main_~nondetArea~0.offset=v_ULTIMATE.start_main_~nondetArea~0.offset_2, ULTIMATE.start_cmemset_~dst.offset=v_ULTIMATE.start_cmemset_~dst.offset_2, ULTIMATE.start_cmemset_#res.base=|v_ULTIMATE.start_cmemset_#res.base_3|, ULTIMATE.start_main_~nondetArea~0.base=v_ULTIMATE.start_main_~nondetArea~0.base_2, ULTIMATE.start_cmemset_#in~dst.base=|v_ULTIMATE.start_cmemset_#in~dst.base_1|, ULTIMATE.start_cmemset_#t~post1.base=|v_ULTIMATE.start_cmemset_#t~post1.base_1|, ULTIMATE.start_cmemset_#in~dst.offset=|v_ULTIMATE.start_cmemset_#in~dst.offset_1|, #length=|v_#length_1|, ULTIMATE.start_cmemset_#t~post1.offset=|v_ULTIMATE.start_cmemset_#t~post1.offset_1|, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7, ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_4, ULTIMATE.start_main_#t~malloc5.base=|v_ULTIMATE.start_main_#t~malloc5.base_4|, ULTIMATE.start_cmemset_#in~n=|v_ULTIMATE.start_cmemset_#in~n_1|, ULTIMATE.start_cmemset_~d~0.base=v_ULTIMATE.start_cmemset_~d~0.base_1, ULTIMATE.start_cmemset_~dst.base=v_ULTIMATE.start_cmemset_~dst.base_2, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_cmemset_~c=v_ULTIMATE.start_cmemset_~c_1, ULTIMATE.start_cmemset_#res.offset=|v_ULTIMATE.start_cmemset_#res.offset_3|, #valid=|v_#valid_5|, ULTIMATE.start_cmemset_~n=v_ULTIMATE.start_cmemset_~n_2, ULTIMATE.start_cmemset_#t~pre0=|v_ULTIMATE.start_cmemset_#t~pre0_3|, ULTIMATE.start_main_#t~malloc5.offset=|v_ULTIMATE.start_main_#t~malloc5.offset_4|, ULTIMATE.start_cmemset_#in~c=|v_ULTIMATE.start_cmemset_#in~c_1|} AuxVars[] AssignedVars[ULTIMATE.start_cmemset_~d~0.offset, ULTIMATE.start_cmemset_#t~post1.offset, ULTIMATE.start_main_~nondetArea~0.offset, ULTIMATE.start_cmemset_~dst.offset, ULTIMATE.start_cmemset_#res.base, ULTIMATE.start_main_~nondetArea~0.base, ULTIMATE.start_main_#t~malloc5.base, ULTIMATE.start_cmemset_#in~n, ULTIMATE.start_cmemset_~d~0.base, ULTIMATE.start_cmemset_#in~dst.base, ULTIMATE.start_cmemset_~dst.base, ULTIMATE.start_cmemset_~c, ULTIMATE.start_cmemset_#t~post1.base, ULTIMATE.start_cmemset_#res.offset, ULTIMATE.start_cmemset_#in~dst.offset, #valid, #length, ULTIMATE.start_cmemset_~n, ULTIMATE.start_cmemset_#t~pre0, ULTIMATE.start_main_#t~malloc5.offset, ULTIMATE.start_cmemset_#in~c] 229#L8 [77] L8-->L11-4: Formula: (and (= v_ULTIMATE.start_cmemset_~d~0.offset_2 v_ULTIMATE.start_cmemset_~dst.offset_4) (> v_ULTIMATE.start_cmemset_~n_4 0) (= v_ULTIMATE.start_cmemset_~d~0.base_2 v_ULTIMATE.start_cmemset_~dst.base_4)) InVars {ULTIMATE.start_cmemset_~dst.base=v_ULTIMATE.start_cmemset_~dst.base_4, ULTIMATE.start_cmemset_~dst.offset=v_ULTIMATE.start_cmemset_~dst.offset_4, ULTIMATE.start_cmemset_~n=v_ULTIMATE.start_cmemset_~n_4} OutVars{ULTIMATE.start_cmemset_~dst.base=v_ULTIMATE.start_cmemset_~dst.base_4, ULTIMATE.start_cmemset_~d~0.offset=v_ULTIMATE.start_cmemset_~d~0.offset_2, ULTIMATE.start_cmemset_~dst.offset=v_ULTIMATE.start_cmemset_~dst.offset_4, ULTIMATE.start_cmemset_~n=v_ULTIMATE.start_cmemset_~n_4, ULTIMATE.start_cmemset_~d~0.base=v_ULTIMATE.start_cmemset_~d~0.base_2} AuxVars[] AssignedVars[ULTIMATE.start_cmemset_~d~0.offset, ULTIMATE.start_cmemset_~d~0.base] 225#L11-4 [47] L11-4-->L12: Formula: (and (= |v_ULTIMATE.start_cmemset_#t~post1.base_2| v_ULTIMATE.start_cmemset_~d~0.base_4) (= v_ULTIMATE.start_cmemset_~d~0.base_3 |v_ULTIMATE.start_cmemset_#t~post1.base_2|) (= v_ULTIMATE.start_cmemset_~d~0.offset_3 (+ |v_ULTIMATE.start_cmemset_#t~post1.offset_2| 1)) (= |v_ULTIMATE.start_cmemset_#t~post1.offset_2| v_ULTIMATE.start_cmemset_~d~0.offset_4)) InVars {ULTIMATE.start_cmemset_~d~0.offset=v_ULTIMATE.start_cmemset_~d~0.offset_4, ULTIMATE.start_cmemset_~d~0.base=v_ULTIMATE.start_cmemset_~d~0.base_4} OutVars{ULTIMATE.start_cmemset_~d~0.offset=v_ULTIMATE.start_cmemset_~d~0.offset_3, ULTIMATE.start_cmemset_#t~post1.offset=|v_ULTIMATE.start_cmemset_#t~post1.offset_2|, ULTIMATE.start_cmemset_#t~post1.base=|v_ULTIMATE.start_cmemset_#t~post1.base_2|, ULTIMATE.start_cmemset_~d~0.base=v_ULTIMATE.start_cmemset_~d~0.base_3} AuxVars[] AssignedVars[ULTIMATE.start_cmemset_~d~0.offset, ULTIMATE.start_cmemset_#t~post1.offset, ULTIMATE.start_cmemset_#t~post1.base, ULTIMATE.start_cmemset_~d~0.base] 226#L12 [90] L12-->L11-2: Formula: (let ((.cse0 (+ v_ULTIMATE.start_cmemset_~n_8 (- 1)))) (and (<= 0 |v_ULTIMATE.start_cmemset_#t~post1.offset_9|) (= 1 (select |v_#valid_18| |v_ULTIMATE.start_cmemset_#t~post1.base_10|)) (= |v_ULTIMATE.start_cmemset_#t~pre0_7| .cse0) (= |v_#memory_int_5| (store |v_#memory_int_6| |v_ULTIMATE.start_cmemset_#t~post1.base_10| (store (select |v_#memory_int_6| |v_ULTIMATE.start_cmemset_#t~post1.base_10|) |v_ULTIMATE.start_cmemset_#t~post1.offset_9| v_ULTIMATE.start_cmemset_~c_5))) (= v_ULTIMATE.start_cmemset_~n_7 .cse0) (<= (+ |v_ULTIMATE.start_cmemset_#t~post1.offset_9| 1) (select |v_#length_6| |v_ULTIMATE.start_cmemset_#t~post1.base_10|)))) InVars {ULTIMATE.start_cmemset_#t~post1.offset=|v_ULTIMATE.start_cmemset_#t~post1.offset_9|, ULTIMATE.start_cmemset_~c=v_ULTIMATE.start_cmemset_~c_5, ULTIMATE.start_cmemset_#t~post1.base=|v_ULTIMATE.start_cmemset_#t~post1.base_10|, #valid=|v_#valid_18|, #memory_int=|v_#memory_int_6|, #length=|v_#length_6|, ULTIMATE.start_cmemset_~n=v_ULTIMATE.start_cmemset_~n_8} OutVars{ULTIMATE.start_cmemset_#t~post1.offset=|v_ULTIMATE.start_cmemset_#t~post1.offset_8|, ULTIMATE.start_cmemset_~c=v_ULTIMATE.start_cmemset_~c_5, ULTIMATE.start_cmemset_#t~post1.base=|v_ULTIMATE.start_cmemset_#t~post1.base_9|, #valid=|v_#valid_18|, #memory_int=|v_#memory_int_5|, #length=|v_#length_6|, ULTIMATE.start_cmemset_~n=v_ULTIMATE.start_cmemset_~n_7, ULTIMATE.start_cmemset_#t~pre0=|v_ULTIMATE.start_cmemset_#t~pre0_7|} AuxVars[] AssignedVars[ULTIMATE.start_cmemset_#t~post1.offset, ULTIMATE.start_cmemset_#t~post1.base, #memory_int, ULTIMATE.start_cmemset_~n, ULTIMATE.start_cmemset_#t~pre0] 231#L11-2 [83] L11-2-->L11-4: Formula: (< 0 |v_ULTIMATE.start_cmemset_#t~pre0_2|) InVars {ULTIMATE.start_cmemset_#t~pre0=|v_ULTIMATE.start_cmemset_#t~pre0_2|} OutVars{ULTIMATE.start_cmemset_#t~pre0=|v_ULTIMATE.start_cmemset_#t~pre0_1|} AuxVars[] AssignedVars[ULTIMATE.start_cmemset_#t~pre0] 232#L11-4 [47] L11-4-->L12: Formula: (and (= |v_ULTIMATE.start_cmemset_#t~post1.base_2| v_ULTIMATE.start_cmemset_~d~0.base_4) (= v_ULTIMATE.start_cmemset_~d~0.base_3 |v_ULTIMATE.start_cmemset_#t~post1.base_2|) (= v_ULTIMATE.start_cmemset_~d~0.offset_3 (+ |v_ULTIMATE.start_cmemset_#t~post1.offset_2| 1)) (= |v_ULTIMATE.start_cmemset_#t~post1.offset_2| v_ULTIMATE.start_cmemset_~d~0.offset_4)) InVars {ULTIMATE.start_cmemset_~d~0.offset=v_ULTIMATE.start_cmemset_~d~0.offset_4, ULTIMATE.start_cmemset_~d~0.base=v_ULTIMATE.start_cmemset_~d~0.base_4} OutVars{ULTIMATE.start_cmemset_~d~0.offset=v_ULTIMATE.start_cmemset_~d~0.offset_3, ULTIMATE.start_cmemset_#t~post1.offset=|v_ULTIMATE.start_cmemset_#t~post1.offset_2|, ULTIMATE.start_cmemset_#t~post1.base=|v_ULTIMATE.start_cmemset_#t~post1.base_2|, ULTIMATE.start_cmemset_~d~0.base=v_ULTIMATE.start_cmemset_~d~0.base_3} AuxVars[] AssignedVars[ULTIMATE.start_cmemset_~d~0.offset, ULTIMATE.start_cmemset_#t~post1.offset, ULTIMATE.start_cmemset_#t~post1.base, ULTIMATE.start_cmemset_~d~0.base] 221#L12 [2020-06-22 09:25:58,932 INFO L796 eck$LassoCheckResult]: Loop: 221#L12 [90] L12-->L11-2: Formula: (let ((.cse0 (+ v_ULTIMATE.start_cmemset_~n_8 (- 1)))) (and (<= 0 |v_ULTIMATE.start_cmemset_#t~post1.offset_9|) (= 1 (select |v_#valid_18| |v_ULTIMATE.start_cmemset_#t~post1.base_10|)) (= |v_ULTIMATE.start_cmemset_#t~pre0_7| .cse0) (= |v_#memory_int_5| (store |v_#memory_int_6| |v_ULTIMATE.start_cmemset_#t~post1.base_10| (store (select |v_#memory_int_6| |v_ULTIMATE.start_cmemset_#t~post1.base_10|) |v_ULTIMATE.start_cmemset_#t~post1.offset_9| v_ULTIMATE.start_cmemset_~c_5))) (= v_ULTIMATE.start_cmemset_~n_7 .cse0) (<= (+ |v_ULTIMATE.start_cmemset_#t~post1.offset_9| 1) (select |v_#length_6| |v_ULTIMATE.start_cmemset_#t~post1.base_10|)))) InVars {ULTIMATE.start_cmemset_#t~post1.offset=|v_ULTIMATE.start_cmemset_#t~post1.offset_9|, ULTIMATE.start_cmemset_~c=v_ULTIMATE.start_cmemset_~c_5, ULTIMATE.start_cmemset_#t~post1.base=|v_ULTIMATE.start_cmemset_#t~post1.base_10|, #valid=|v_#valid_18|, #memory_int=|v_#memory_int_6|, #length=|v_#length_6|, ULTIMATE.start_cmemset_~n=v_ULTIMATE.start_cmemset_~n_8} OutVars{ULTIMATE.start_cmemset_#t~post1.offset=|v_ULTIMATE.start_cmemset_#t~post1.offset_8|, ULTIMATE.start_cmemset_~c=v_ULTIMATE.start_cmemset_~c_5, ULTIMATE.start_cmemset_#t~post1.base=|v_ULTIMATE.start_cmemset_#t~post1.base_9|, #valid=|v_#valid_18|, #memory_int=|v_#memory_int_5|, #length=|v_#length_6|, ULTIMATE.start_cmemset_~n=v_ULTIMATE.start_cmemset_~n_7, ULTIMATE.start_cmemset_#t~pre0=|v_ULTIMATE.start_cmemset_#t~pre0_7|} AuxVars[] AssignedVars[ULTIMATE.start_cmemset_#t~post1.offset, ULTIMATE.start_cmemset_#t~post1.base, #memory_int, ULTIMATE.start_cmemset_~n, ULTIMATE.start_cmemset_#t~pre0] 222#L11-2 [84] L11-2-->L11-4: Formula: (> 0 |v_ULTIMATE.start_cmemset_#t~pre0_2|) InVars {ULTIMATE.start_cmemset_#t~pre0=|v_ULTIMATE.start_cmemset_#t~pre0_2|} OutVars{ULTIMATE.start_cmemset_#t~pre0=|v_ULTIMATE.start_cmemset_#t~pre0_1|} AuxVars[] AssignedVars[ULTIMATE.start_cmemset_#t~pre0] 230#L11-4 [47] L11-4-->L12: Formula: (and (= |v_ULTIMATE.start_cmemset_#t~post1.base_2| v_ULTIMATE.start_cmemset_~d~0.base_4) (= v_ULTIMATE.start_cmemset_~d~0.base_3 |v_ULTIMATE.start_cmemset_#t~post1.base_2|) (= v_ULTIMATE.start_cmemset_~d~0.offset_3 (+ |v_ULTIMATE.start_cmemset_#t~post1.offset_2| 1)) (= |v_ULTIMATE.start_cmemset_#t~post1.offset_2| v_ULTIMATE.start_cmemset_~d~0.offset_4)) InVars {ULTIMATE.start_cmemset_~d~0.offset=v_ULTIMATE.start_cmemset_~d~0.offset_4, ULTIMATE.start_cmemset_~d~0.base=v_ULTIMATE.start_cmemset_~d~0.base_4} OutVars{ULTIMATE.start_cmemset_~d~0.offset=v_ULTIMATE.start_cmemset_~d~0.offset_3, ULTIMATE.start_cmemset_#t~post1.offset=|v_ULTIMATE.start_cmemset_#t~post1.offset_2|, ULTIMATE.start_cmemset_#t~post1.base=|v_ULTIMATE.start_cmemset_#t~post1.base_2|, ULTIMATE.start_cmemset_~d~0.base=v_ULTIMATE.start_cmemset_~d~0.base_3} AuxVars[] AssignedVars[ULTIMATE.start_cmemset_~d~0.offset, ULTIMATE.start_cmemset_#t~post1.offset, ULTIMATE.start_cmemset_#t~post1.base, ULTIMATE.start_cmemset_~d~0.base] 221#L12 [2020-06-22 09:25:58,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:25:58,933 INFO L82 PathProgramCache]: Analyzing trace with hash -1212411740, now seen corresponding path program 2 times [2020-06-22 09:25:58,933 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:25:58,933 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:25:58,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:25:58,934 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:25:58,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:25:58,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:25:58,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:25:58,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:25:58,949 INFO L82 PathProgramCache]: Analyzing trace with hash 118932, now seen corresponding path program 2 times [2020-06-22 09:25:58,949 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:25:58,949 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:25:58,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:25:58,950 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 09:25:58,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:25:58,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:25:58,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:25:58,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:25:58,956 INFO L82 PathProgramCache]: Analyzing trace with hash 1716902161, now seen corresponding path program 1 times [2020-06-22 09:25:58,956 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:25:58,956 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:25:58,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:25:58,957 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 09:25:58,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:25:58,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:25:58,994 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 09:25:58,994 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 09:25:58,994 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2020-06-22 09:25:59,009 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:25:59,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:25:59,045 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 5 conjunts are in the unsatisfiable core [2020-06-22 09:25:59,046 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 09:25:59,050 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 09:25:59,076 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-06-22 09:25:59,076 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2020-06-22 09:25:59,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-06-22 09:25:59,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-06-22 09:25:59,130 INFO L87 Difference]: Start difference. First operand 15 states and 19 transitions. cyclomatic complexity: 6 Second operand 5 states. [2020-06-22 09:25:59,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:25:59,159 INFO L93 Difference]: Finished difference Result 13 states and 15 transitions. [2020-06-22 09:25:59,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-06-22 09:25:59,161 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 15 transitions. [2020-06-22 09:25:59,161 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-06-22 09:25:59,162 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 0 states and 0 transitions. [2020-06-22 09:25:59,162 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-06-22 09:25:59,162 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-06-22 09:25:59,162 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-06-22 09:25:59,162 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 09:25:59,162 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 09:25:59,162 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 09:25:59,162 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 09:25:59,162 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2020-06-22 09:25:59,163 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-06-22 09:25:59,163 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-06-22 09:25:59,163 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-06-22 09:25:59,169 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 09:25:59 BasicIcfg [2020-06-22 09:25:59,169 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-06-22 09:25:59,169 INFO L168 Benchmark]: Toolchain (without parser) took 5370.45 ms. Allocated memory was 514.9 MB in the beginning and 632.8 MB in the end (delta: 118.0 MB). Free memory was 440.0 MB in the beginning and 580.2 MB in the end (delta: -140.2 MB). There was no memory consumed. Max. memory is 50.3 GB. [2020-06-22 09:25:59,170 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 514.9 MB. Free memory is still 459.7 MB. There was no memory consumed. Max. memory is 50.3 GB. [2020-06-22 09:25:59,171 INFO L168 Benchmark]: CACSL2BoogieTranslator took 334.01 ms. Allocated memory was 514.9 MB in the beginning and 554.7 MB in the end (delta: 39.8 MB). Free memory was 439.4 MB in the beginning and 523.3 MB in the end (delta: -83.8 MB). Peak memory consumption was 29.7 MB. Max. memory is 50.3 GB. [2020-06-22 09:25:59,171 INFO L168 Benchmark]: Boogie Procedure Inliner took 38.23 ms. Allocated memory is still 554.7 MB. Free memory was 523.3 MB in the beginning and 521.6 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 50.3 GB. [2020-06-22 09:25:59,172 INFO L168 Benchmark]: Boogie Preprocessor took 24.40 ms. Allocated memory is still 554.7 MB. Free memory was 521.6 MB in the beginning and 520.0 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 50.3 GB. [2020-06-22 09:25:59,172 INFO L168 Benchmark]: RCFGBuilder took 253.00 ms. Allocated memory is still 554.7 MB. Free memory was 520.0 MB in the beginning and 504.0 MB in the end (delta: 16.0 MB). Peak memory consumption was 16.0 MB. Max. memory is 50.3 GB. [2020-06-22 09:25:59,173 INFO L168 Benchmark]: BlockEncodingV2 took 105.04 ms. Allocated memory is still 554.7 MB. Free memory was 504.0 MB in the beginning and 496.9 MB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 50.3 GB. [2020-06-22 09:25:59,173 INFO L168 Benchmark]: TraceAbstraction took 2875.39 ms. Allocated memory was 554.7 MB in the beginning and 593.0 MB in the end (delta: 38.3 MB). Free memory was 496.4 MB in the beginning and 470.9 MB in the end (delta: 25.5 MB). Peak memory consumption was 63.8 MB. Max. memory is 50.3 GB. [2020-06-22 09:25:59,174 INFO L168 Benchmark]: BuchiAutomizer took 1735.14 ms. Allocated memory was 593.0 MB in the beginning and 632.8 MB in the end (delta: 39.8 MB). Free memory was 470.9 MB in the beginning and 580.2 MB in the end (delta: -109.4 MB). There was no memory consumed. Max. memory is 50.3 GB. [2020-06-22 09:25:59,178 INFO L337 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 18 locations, 22 edges - StatisticsResult: Encoded RCFG 10 locations, 17 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 514.9 MB. Free memory is still 459.7 MB. There was no memory consumed. Max. memory is 50.3 GB. * CACSL2BoogieTranslator took 334.01 ms. Allocated memory was 514.9 MB in the beginning and 554.7 MB in the end (delta: 39.8 MB). Free memory was 439.4 MB in the beginning and 523.3 MB in the end (delta: -83.8 MB). Peak memory consumption was 29.7 MB. Max. memory is 50.3 GB. * Boogie Procedure Inliner took 38.23 ms. Allocated memory is still 554.7 MB. Free memory was 523.3 MB in the beginning and 521.6 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 50.3 GB. * Boogie Preprocessor took 24.40 ms. Allocated memory is still 554.7 MB. Free memory was 521.6 MB in the beginning and 520.0 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 50.3 GB. * RCFGBuilder took 253.00 ms. Allocated memory is still 554.7 MB. Free memory was 520.0 MB in the beginning and 504.0 MB in the end (delta: 16.0 MB). Peak memory consumption was 16.0 MB. Max. memory is 50.3 GB. * BlockEncodingV2 took 105.04 ms. Allocated memory is still 554.7 MB. Free memory was 504.0 MB in the beginning and 496.9 MB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 50.3 GB. * TraceAbstraction took 2875.39 ms. Allocated memory was 554.7 MB in the beginning and 593.0 MB in the end (delta: 38.3 MB). Free memory was 496.4 MB in the beginning and 470.9 MB in the end (delta: 25.5 MB). Peak memory consumption was 63.8 MB. Max. memory is 50.3 GB. * BuchiAutomizer took 1735.14 ms. Allocated memory was 593.0 MB in the beginning and 632.8 MB in the end (delta: 39.8 MB). Free memory was 470.9 MB in the beginning and 580.2 MB in the end (delta: -109.4 MB). There was no memory consumed. Max. memory is 50.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * 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: 12]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold - InvariantResult [Line: 11]: Loop Invariant [2020-06-22 09:25:59,187 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:25:59,187 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:25:59,187 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:25:59,187 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:25:59,189 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:25:59,189 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:25:59,189 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:25:59,189 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: (1 <= n && (((((1 <= d && d + n <= unknown-#length-unknown[d]) && \valid[dst] == 1) && 1 <= n) && n <= unknown-#length-unknown[dst]) && 1 == \valid[d]) && 0 == dst) || (((((((1 <= n && \valid[dst] == 1) && 1 <= n) && n <= unknown-#length-unknown[dst]) && 1 == \valid[d]) && n <= unknown-#length-unknown[d]) && d == 0) && 0 == dst) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 10 locations, 2 error locations. SAFE Result, 2.7s OverallTime, 8 OverallIterations, 3 TraceHistogramMax, 1.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 27 SDtfs, 65 SDslu, 229 SDs, 0 SdLazy, 466 SolverSat, 92 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 120 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 247 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=17occurred in iteration=5, 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, 8 MinimizatonAttempts, 10 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 3 NumberOfFragments, 70 HoareAnnotationTreeSize, 1 FomulaSimplifications, 161 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 1 FomulaSimplificationsInter, 139 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 126 NumberOfCodeBlocks, 126 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 114 ConstructedInterpolants, 0 QuantifiedInterpolants, 4581 SizeOfPredicates, 26 NumberOfNonLiveVariables, 312 ConjunctsInSsa, 72 ConjunctsInUnsatCore, 12 InterpolantComputations, 4 PerfectInterpolantSequences, 17/40 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (4 trivial, 0 deterministic, 1 nondeterministic). One nondeterministic module has affine ranking function n and consists of 5 locations. 4 modules have a trivial ranking function, the largest among these consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 1.7s and 6 iterations. TraceHistogramMax:2. Analysis of lassos took 1.3s. Construction of modules took 0.0s. Büchi inclusion checks took 0.1s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 2. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 9 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 15 states and ocurred in iteration 3. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 24 SDtfs, 40 SDslu, 71 SDs, 0 SdLazy, 125 SolverSat, 13 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc3 concLT0 SILN0 SILU1 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital124 mio100 ax100 hnf100 lsp92 ukn93 mio100 lsp55 div100 bol100 ite100 ukn100 eq194 hnf88 smp100 dnf100 smp100 tf100 neg100 sie103 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 5ms 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-22 09:25:50.556 ----------------------------------------------- eclipse.buildId=unknown java.version=1.8.0_242 java.vendor=Oracle Corporation BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox/benchmark/theBenchmark.c Command-line arguments: -os linux -ws gtk -arch x86_64 -consoleLog -data @user.home/.ultimate -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -data /export/starexec/sandbox/tmp -i /export/starexec/sandbox/benchmark/theBenchmark.c !ENTRY org.eclipse.core.resources 2 10035 2020-06-22 09:25:59.414 !MESSAGE The workspace will exit with unsaved changes in this session. Received shutdown request... Ultimate: GTK+ Version Check