YES Ultimate: Cannot open display: This is Ultimate 0.1.24-8dc7c08-m [2020-06-22 09:18:40,162 INFO L170 SettingsManager]: Resetting all preferences to default values... [2020-06-22 09:18:40,164 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2020-06-22 09:18:40,175 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-06-22 09:18:40,176 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-06-22 09:18:40,176 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-06-22 09:18:40,178 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-06-22 09:18:40,179 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2020-06-22 09:18:40,181 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-06-22 09:18:40,181 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-06-22 09:18:40,182 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-06-22 09:18:40,182 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-06-22 09:18:40,183 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-06-22 09:18:40,184 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-06-22 09:18:40,185 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-06-22 09:18:40,186 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-06-22 09:18:40,187 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-06-22 09:18:40,188 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-06-22 09:18:40,190 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2020-06-22 09:18:40,191 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-06-22 09:18:40,192 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-06-22 09:18:40,193 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-06-22 09:18:40,195 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-06-22 09:18:40,196 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-06-22 09:18:40,196 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-06-22 09:18:40,197 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-06-22 09:18:40,197 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-06-22 09:18:40,198 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-06-22 09:18:40,198 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-06-22 09:18:40,199 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-06-22 09:18:40,199 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-06-22 09:18:40,200 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2020-06-22 09:18:40,201 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-06-22 09:18:40,201 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2020-06-22 09:18:40,202 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-06-22 09:18:40,202 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-06-22 09:18:40,202 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2020-06-22 09:18:40,203 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2020-06-22 09:18:40,203 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2020-06-22 09:18:40,204 INFO L98 SettingsManager]: Beginning loading settings from /export/starexec/sandbox2/solver/bin/./../termcomp2017.epf [2020-06-22 09:18:40,218 INFO L110 SettingsManager]: Loading preferences was successful [2020-06-22 09:18:40,218 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2020-06-22 09:18:40,219 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-06-22 09:18:40,219 INFO L133 SettingsManager]: * Rewrite not-equals=true [2020-06-22 09:18:40,219 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2020-06-22 09:18:40,219 INFO L133 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE [2020-06-22 09:18:40,220 INFO L133 SettingsManager]: * Use SBE=true [2020-06-22 09:18:40,220 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-06-22 09:18:40,220 INFO L133 SettingsManager]: * Use old map elimination=false [2020-06-22 09:18:40,220 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2020-06-22 09:18:40,220 INFO L133 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION [2020-06-22 09:18:40,220 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2020-06-22 09:18:40,221 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-06-22 09:18:40,221 INFO L133 SettingsManager]: * Construct termination proof for TermComp=true [2020-06-22 09:18:40,221 INFO L133 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 09:18:40,221 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-06-22 09:18:40,221 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-06-22 09:18:40,221 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2020-06-22 09:18:40,222 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2020-06-22 09:18:40,222 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-06-22 09:18:40,222 INFO L133 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE [2020-06-22 09:18:40,222 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-06-22 09:18:40,222 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-06-22 09:18:40,222 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-06-22 09:18:40,223 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-06-22 09:18:40,223 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-06-22 09:18:40,223 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-06-22 09:18:40,223 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2020-06-22 09:18:40,223 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-06-22 09:18:40,248 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-06-22 09:18:40,261 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-06-22 09:18:40,265 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-06-22 09:18:40,266 INFO L271 PluginConnector]: Initializing CDTParser... [2020-06-22 09:18:40,266 INFO L276 PluginConnector]: CDTParser initialized [2020-06-22 09:18:40,267 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox2/benchmark/theBenchmark.c [2020-06-22 09:18:40,330 INFO L221 CDTParser]: Created temporary CDT project at /export/starexec/sandbox2/tmp/c13df6f999374b55a2d6ee3126864721/FLAG9891ef81b [2020-06-22 09:18:40,675 INFO L307 CDTParser]: Found 1 translation units. [2020-06-22 09:18:40,675 INFO L161 CDTParser]: Scanning /export/starexec/sandbox2/benchmark/theBenchmark.c [2020-06-22 09:18:40,676 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. [2020-06-22 09:18:40,682 INFO L355 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox2/tmp/c13df6f999374b55a2d6ee3126864721/FLAG9891ef81b [2020-06-22 09:18:41,081 INFO L363 CDTParser]: Successfully deleted /export/starexec/sandbox2/tmp/c13df6f999374b55a2d6ee3126864721 [2020-06-22 09:18:41,093 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-06-22 09:18:41,094 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. [2020-06-22 09:18:41,095 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-06-22 09:18:41,095 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-06-22 09:18:41,099 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2020-06-22 09:18:41,100 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.06 09:18:41" (1/1) ... [2020-06-22 09:18:41,103 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30ff858d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:18:41, skipping insertion in model container [2020-06-22 09:18:41,103 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.06 09:18:41" (1/1) ... [2020-06-22 09:18:41,111 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-06-22 09:18:41,128 INFO L176 MainTranslator]: Built tables and reachable declarations [2020-06-22 09:18:41,287 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-06-22 09:18:41,352 INFO L191 MainTranslator]: Completed pre-run [2020-06-22 09:18:41,370 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-06-22 09:18:41,386 INFO L195 MainTranslator]: Completed translation [2020-06-22 09:18:41,386 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:18:41 WrapperNode [2020-06-22 09:18:41,386 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-06-22 09:18:41,387 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-06-22 09:18:41,387 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-06-22 09:18:41,387 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2020-06-22 09:18:41,396 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:18:41" (1/1) ... [2020-06-22 09:18:41,405 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:18:41" (1/1) ... [2020-06-22 09:18:41,427 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-06-22 09:18:41,427 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-06-22 09:18:41,427 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-06-22 09:18:41,428 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2020-06-22 09:18:41,437 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:18:41" (1/1) ... [2020-06-22 09:18:41,437 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:18:41" (1/1) ... [2020-06-22 09:18:41,439 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:18:41" (1/1) ... [2020-06-22 09:18:41,439 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:18:41" (1/1) ... [2020-06-22 09:18:41,443 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:18:41" (1/1) ... [2020-06-22 09:18:41,447 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:18:41" (1/1) ... [2020-06-22 09:18:41,448 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:18:41" (1/1) ... [2020-06-22 09:18:41,450 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-06-22 09:18:41,451 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-06-22 09:18:41,451 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-06-22 09:18:41,451 INFO L276 PluginConnector]: RCFGBuilder initialized [2020-06-22 09:18:41,452 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:18:41" (1/1) ... No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-06-22 09:18:41,519 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-06-22 09:18:41,519 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-06-22 09:18:41,519 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-06-22 09:18:41,519 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-06-22 09:18:41,519 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-06-22 09:18:41,519 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-06-22 09:18:41,792 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-06-22 09:18:41,792 INFO L286 CfgBuilder]: Removed 7 assue(true) statements. [2020-06-22 09:18:41,793 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 09:18:41 BoogieIcfgContainer [2020-06-22 09:18:41,794 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-06-22 09:18:41,794 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- [2020-06-22 09:18:41,794 INFO L271 PluginConnector]: Initializing BlockEncodingV2... [2020-06-22 09:18:41,796 INFO L276 PluginConnector]: BlockEncodingV2 initialized [2020-06-22 09:18:41,797 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 09:18:41" (1/1) ... [2020-06-22 09:18:41,815 INFO L313 BlockEncoder]: Initial Icfg 47 locations, 48 edges [2020-06-22 09:18:41,816 INFO L258 BlockEncoder]: Using Remove infeasible edges [2020-06-22 09:18:41,817 INFO L263 BlockEncoder]: Using Maximize final states [2020-06-22 09:18:41,817 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false [2020-06-22 09:18:41,818 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE [2020-06-22 09:18:41,819 INFO L296 BlockEncoder]: Using Remove sink states [2020-06-22 09:18:41,820 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true [2020-06-22 09:18:41,820 INFO L179 BlockEncoder]: Using Rewrite not-equals [2020-06-22 09:18:41,847 INFO L185 BlockEncoder]: Using Use SBE [2020-06-22 09:18:41,884 INFO L200 BlockEncoder]: SBE split 25 edges [2020-06-22 09:18:41,889 INFO L70 emoveInfeasibleEdges]: Removed 1 edges and 0 locations because of local infeasibility [2020-06-22 09:18:41,891 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-06-22 09:18:41,935 INFO L100 BaseMinimizeStates]: Removed 14 edges and 7 locations by large block encoding [2020-06-22 09:18:41,938 INFO L70 RemoveSinkStates]: Removed 1 edges and 1 locations by removing sink states [2020-06-22 09:18:41,940 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-06-22 09:18:41,940 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-06-22 09:18:41,940 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding [2020-06-22 09:18:41,941 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states [2020-06-22 09:18:41,942 INFO L313 BlockEncoder]: Encoded RCFG 39 locations, 70 edges [2020-06-22 09:18:41,942 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 09:18:41 BasicIcfg [2020-06-22 09:18:41,942 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- [2020-06-22 09:18:41,943 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-06-22 09:18:41,943 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-06-22 09:18:41,946 INFO L276 PluginConnector]: TraceAbstraction initialized [2020-06-22 09:18:41,947 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.06 09:18:41" (1/4) ... [2020-06-22 09:18:41,948 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@be87aa1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 09:18:41, skipping insertion in model container [2020-06-22 09:18:41,948 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:18:41" (2/4) ... [2020-06-22 09:18:41,948 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@be87aa1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 09:18:41, skipping insertion in model container [2020-06-22 09:18:41,948 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 09:18:41" (3/4) ... [2020-06-22 09:18:41,949 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@be87aa1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 09:18:41, skipping insertion in model container [2020-06-22 09:18:41,949 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 09:18:41" (4/4) ... [2020-06-22 09:18:41,950 INFO L112 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-06-22 09:18:41,960 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2020-06-22 09:18:41,968 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 24 error locations. [2020-06-22 09:18:41,985 INFO L257 AbstractCegarLoop]: Starting to check reachability of 24 error locations. [2020-06-22 09:18:42,014 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2020-06-22 09:18:42,015 INFO L382 AbstractCegarLoop]: Interprodecural is true [2020-06-22 09:18:42,015 INFO L383 AbstractCegarLoop]: Hoare is true [2020-06-22 09:18:42,015 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2020-06-22 09:18:42,015 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-06-22 09:18:42,015 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-06-22 09:18:42,015 INFO L387 AbstractCegarLoop]: Difference is false [2020-06-22 09:18:42,015 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-06-22 09:18:42,016 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-06-22 09:18:42,031 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states. [2020-06-22 09:18:42,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-06-22 09:18:42,037 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 09:18:42,038 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-06-22 09:18:42,038 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION]=== [2020-06-22 09:18:42,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:18:42,043 INFO L82 PathProgramCache]: Analyzing trace with hash 124423, now seen corresponding path program 1 times [2020-06-22 09:18:42,045 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:18:42,046 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:18:42,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:18:42,098 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:18:42,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:18:42,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:18:42,205 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:18:42,208 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 09:18:42,208 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 09:18:42,211 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 09:18:42,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 09:18:42,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 09:18:42,228 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 3 states. [2020-06-22 09:18:42,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:18:42,390 INFO L93 Difference]: Finished difference Result 43 states and 70 transitions. [2020-06-22 09:18:42,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 09:18:42,392 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-06-22 09:18:42,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 09:18:42,406 INFO L225 Difference]: With dead ends: 43 [2020-06-22 09:18:42,406 INFO L226 Difference]: Without dead ends: 39 [2020-06-22 09:18:42,409 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 09:18:42,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2020-06-22 09:18:42,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2020-06-22 09:18:42,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-06-22 09:18:42,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 66 transitions. [2020-06-22 09:18:42,450 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 66 transitions. Word has length 3 [2020-06-22 09:18:42,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 09:18:42,451 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 66 transitions. [2020-06-22 09:18:42,451 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 09:18:42,451 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 66 transitions. [2020-06-22 09:18:42,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-06-22 09:18:42,452 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 09:18:42,452 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-06-22 09:18:42,452 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION]=== [2020-06-22 09:18:42,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:18:42,453 INFO L82 PathProgramCache]: Analyzing trace with hash 124424, now seen corresponding path program 1 times [2020-06-22 09:18:42,453 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:18:42,453 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:18:42,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:18:42,454 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:18:42,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:18:42,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:18:42,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:18:42,504 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 09:18:42,504 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 09:18:42,506 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 09:18:42,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 09:18:42,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 09:18:42,507 INFO L87 Difference]: Start difference. First operand 39 states and 66 transitions. Second operand 3 states. [2020-06-22 09:18:42,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:18:42,628 INFO L93 Difference]: Finished difference Result 39 states and 66 transitions. [2020-06-22 09:18:42,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 09:18:42,629 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-06-22 09:18:42,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 09:18:42,630 INFO L225 Difference]: With dead ends: 39 [2020-06-22 09:18:42,630 INFO L226 Difference]: Without dead ends: 35 [2020-06-22 09:18:42,631 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 09:18:42,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2020-06-22 09:18:42,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2020-06-22 09:18:42,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2020-06-22 09:18:42,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 62 transitions. [2020-06-22 09:18:42,637 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 62 transitions. Word has length 3 [2020-06-22 09:18:42,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 09:18:42,637 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 62 transitions. [2020-06-22 09:18:42,637 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 09:18:42,637 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 62 transitions. [2020-06-22 09:18:42,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-06-22 09:18:42,638 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 09:18:42,638 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-06-22 09:18:42,638 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION]=== [2020-06-22 09:18:42,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:18:42,639 INFO L82 PathProgramCache]: Analyzing trace with hash 124421, now seen corresponding path program 1 times [2020-06-22 09:18:42,639 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:18:42,639 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:18:42,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:18:42,640 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:18:42,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:18:42,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:18:42,670 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:18:42,670 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 09:18:42,670 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 09:18:42,670 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 09:18:42,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 09:18:42,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 09:18:42,671 INFO L87 Difference]: Start difference. First operand 35 states and 62 transitions. Second operand 3 states. [2020-06-22 09:18:42,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:18:42,777 INFO L93 Difference]: Finished difference Result 35 states and 62 transitions. [2020-06-22 09:18:42,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 09:18:42,778 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-06-22 09:18:42,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 09:18:42,779 INFO L225 Difference]: With dead ends: 35 [2020-06-22 09:18:42,779 INFO L226 Difference]: Without dead ends: 31 [2020-06-22 09:18:42,779 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 09:18:42,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2020-06-22 09:18:42,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2020-06-22 09:18:42,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-06-22 09:18:42,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 54 transitions. [2020-06-22 09:18:42,784 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 54 transitions. Word has length 3 [2020-06-22 09:18:42,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 09:18:42,784 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 54 transitions. [2020-06-22 09:18:42,784 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 09:18:42,784 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 54 transitions. [2020-06-22 09:18:42,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-06-22 09:18:42,785 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 09:18:42,785 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-06-22 09:18:42,785 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION]=== [2020-06-22 09:18:42,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:18:42,786 INFO L82 PathProgramCache]: Analyzing trace with hash 3855027, now seen corresponding path program 1 times [2020-06-22 09:18:42,786 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:18:42,786 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:18:42,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:18:42,787 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:18:42,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:18:42,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:18:42,819 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:18:42,819 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 09:18:42,819 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 09:18:42,819 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 09:18:42,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 09:18:42,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 09:18:42,820 INFO L87 Difference]: Start difference. First operand 31 states and 54 transitions. Second operand 3 states. [2020-06-22 09:18:42,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:18:42,918 INFO L93 Difference]: Finished difference Result 31 states and 54 transitions. [2020-06-22 09:18:42,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 09:18:42,919 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-06-22 09:18:42,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 09:18:42,920 INFO L225 Difference]: With dead ends: 31 [2020-06-22 09:18:42,920 INFO L226 Difference]: Without dead ends: 27 [2020-06-22 09:18:42,921 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 09:18:42,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2020-06-22 09:18:42,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2020-06-22 09:18:42,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-06-22 09:18:42,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 46 transitions. [2020-06-22 09:18:42,925 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 46 transitions. Word has length 4 [2020-06-22 09:18:42,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 09:18:42,925 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 46 transitions. [2020-06-22 09:18:42,925 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 09:18:42,925 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 46 transitions. [2020-06-22 09:18:42,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-06-22 09:18:42,926 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 09:18:42,926 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-06-22 09:18:42,926 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION]=== [2020-06-22 09:18:42,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:18:42,927 INFO L82 PathProgramCache]: Analyzing trace with hash 3855029, now seen corresponding path program 1 times [2020-06-22 09:18:42,927 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:18:42,927 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:18:42,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:18:42,928 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:18:42,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:18:42,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:18:42,951 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:18:42,952 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 09:18:42,952 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 09:18:42,952 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 09:18:42,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 09:18:42,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 09:18:42,953 INFO L87 Difference]: Start difference. First operand 27 states and 46 transitions. Second operand 3 states. [2020-06-22 09:18:43,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:18:43,024 INFO L93 Difference]: Finished difference Result 31 states and 46 transitions. [2020-06-22 09:18:43,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 09:18:43,024 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-06-22 09:18:43,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 09:18:43,025 INFO L225 Difference]: With dead ends: 31 [2020-06-22 09:18:43,025 INFO L226 Difference]: Without dead ends: 27 [2020-06-22 09:18:43,026 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 09:18:43,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2020-06-22 09:18:43,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2020-06-22 09:18:43,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-06-22 09:18:43,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 42 transitions. [2020-06-22 09:18:43,030 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 42 transitions. Word has length 4 [2020-06-22 09:18:43,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 09:18:43,030 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 42 transitions. [2020-06-22 09:18:43,030 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 09:18:43,030 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 42 transitions. [2020-06-22 09:18:43,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-06-22 09:18:43,031 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 09:18:43,031 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-06-22 09:18:43,031 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION]=== [2020-06-22 09:18:43,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:18:43,031 INFO L82 PathProgramCache]: Analyzing trace with hash 3855030, now seen corresponding path program 1 times [2020-06-22 09:18:43,031 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:18:43,032 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:18:43,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:18:43,033 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:18:43,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:18:43,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:18:43,071 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:18:43,071 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 09:18:43,072 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 09:18:43,072 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 09:18:43,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 09:18:43,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 09:18:43,073 INFO L87 Difference]: Start difference. First operand 27 states and 42 transitions. Second operand 3 states. [2020-06-22 09:18:43,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:18:43,160 INFO L93 Difference]: Finished difference Result 27 states and 42 transitions. [2020-06-22 09:18:43,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 09:18:43,161 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-06-22 09:18:43,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 09:18:43,161 INFO L225 Difference]: With dead ends: 27 [2020-06-22 09:18:43,161 INFO L226 Difference]: Without dead ends: 23 [2020-06-22 09:18:43,162 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 09:18:43,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2020-06-22 09:18:43,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2020-06-22 09:18:43,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-06-22 09:18:43,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 38 transitions. [2020-06-22 09:18:43,165 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 38 transitions. Word has length 4 [2020-06-22 09:18:43,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 09:18:43,165 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 38 transitions. [2020-06-22 09:18:43,166 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 09:18:43,166 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 38 transitions. [2020-06-22 09:18:43,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-06-22 09:18:43,167 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 09:18:43,167 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-06-22 09:18:43,167 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION]=== [2020-06-22 09:18:43,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:18:43,167 INFO L82 PathProgramCache]: Analyzing trace with hash 119504158, now seen corresponding path program 1 times [2020-06-22 09:18:43,167 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:18:43,167 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:18:43,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:18:43,168 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:18:43,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:18:43,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:18:43,199 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:18:43,199 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 09:18:43,199 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 09:18:43,199 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 09:18:43,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 09:18:43,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 09:18:43,200 INFO L87 Difference]: Start difference. First operand 23 states and 38 transitions. Second operand 3 states. [2020-06-22 09:18:43,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:18:43,269 INFO L93 Difference]: Finished difference Result 23 states and 38 transitions. [2020-06-22 09:18:43,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 09:18:43,270 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-06-22 09:18:43,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 09:18:43,270 INFO L225 Difference]: With dead ends: 23 [2020-06-22 09:18:43,270 INFO L226 Difference]: Without dead ends: 19 [2020-06-22 09:18:43,271 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 09:18:43,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2020-06-22 09:18:43,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2020-06-22 09:18:43,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2020-06-22 09:18:43,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 30 transitions. [2020-06-22 09:18:43,274 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 30 transitions. Word has length 5 [2020-06-22 09:18:43,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 09:18:43,274 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 30 transitions. [2020-06-22 09:18:43,274 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 09:18:43,275 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 30 transitions. [2020-06-22 09:18:43,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-06-22 09:18:43,275 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 09:18:43,275 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-06-22 09:18:43,275 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION]=== [2020-06-22 09:18:43,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:18:43,276 INFO L82 PathProgramCache]: Analyzing trace with hash 119504160, now seen corresponding path program 1 times [2020-06-22 09:18:43,276 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:18:43,276 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:18:43,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:18:43,277 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:18:43,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:18:43,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:18:43,297 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:18:43,297 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 09:18:43,298 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 09:18:43,298 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 09:18:43,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 09:18:43,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 09:18:43,298 INFO L87 Difference]: Start difference. First operand 19 states and 30 transitions. Second operand 3 states. [2020-06-22 09:18:43,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:18:43,339 INFO L93 Difference]: Finished difference Result 23 states and 30 transitions. [2020-06-22 09:18:43,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 09:18:43,339 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-06-22 09:18:43,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 09:18:43,340 INFO L225 Difference]: With dead ends: 23 [2020-06-22 09:18:43,340 INFO L226 Difference]: Without dead ends: 19 [2020-06-22 09:18:43,341 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 09:18:43,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2020-06-22 09:18:43,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2020-06-22 09:18:43,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2020-06-22 09:18:43,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 26 transitions. [2020-06-22 09:18:43,344 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 26 transitions. Word has length 5 [2020-06-22 09:18:43,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 09:18:43,344 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 26 transitions. [2020-06-22 09:18:43,344 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 09:18:43,344 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 26 transitions. [2020-06-22 09:18:43,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-06-22 09:18:43,344 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 09:18:43,345 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-06-22 09:18:43,345 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION]=== [2020-06-22 09:18:43,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:18:43,345 INFO L82 PathProgramCache]: Analyzing trace with hash 119504161, now seen corresponding path program 1 times [2020-06-22 09:18:43,345 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:18:43,345 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:18:43,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:18:43,346 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:18:43,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:18:43,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:18:43,372 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:18:43,373 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 09:18:43,373 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 09:18:43,373 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 09:18:43,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 09:18:43,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 09:18:43,374 INFO L87 Difference]: Start difference. First operand 19 states and 26 transitions. Second operand 3 states. [2020-06-22 09:18:43,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:18:43,422 INFO L93 Difference]: Finished difference Result 19 states and 26 transitions. [2020-06-22 09:18:43,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 09:18:43,423 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-06-22 09:18:43,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 09:18:43,423 INFO L225 Difference]: With dead ends: 19 [2020-06-22 09:18:43,423 INFO L226 Difference]: Without dead ends: 0 [2020-06-22 09:18:43,424 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 09:18:43,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-06-22 09:18:43,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-06-22 09:18:43,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-06-22 09:18:43,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-06-22 09:18:43,424 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 5 [2020-06-22 09:18:43,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 09:18:43,425 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 09:18:43,425 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 09:18:43,425 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-06-22 09:18:43,425 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-06-22 09:18:43,430 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-06-22 09:18:43,460 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr10REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. [2020-06-22 09:18:43,461 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr11REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. [2020-06-22 09:18:43,461 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr8REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. [2020-06-22 09:18:43,461 INFO L448 ceAbstractionStarter]: For program point L15(line 15) no Hoare annotation was computed. [2020-06-22 09:18:43,461 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr9REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. [2020-06-22 09:18:43,461 INFO L448 ceAbstractionStarter]: For program point L15-1(line 15) no Hoare annotation was computed. [2020-06-22 09:18:43,461 INFO L448 ceAbstractionStarter]: For program point L13(line 13) no Hoare annotation was computed. [2020-06-22 09:18:43,461 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr14REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-06-22 09:18:43,461 INFO L448 ceAbstractionStarter]: For program point L13-1(lines 13 17) no Hoare annotation was computed. [2020-06-22 09:18:43,461 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr15REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-06-22 09:18:43,462 INFO L448 ceAbstractionStarter]: For program point L11(line 11) no Hoare annotation was computed. [2020-06-22 09:18:43,462 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr12REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. [2020-06-22 09:18:43,462 INFO L444 ceAbstractionStarter]: At program point L13-3(lines 12 17) the Hoare annotation is: (and (= 4 (select |#length| ULTIMATE.start_test_fun_~x_ref~0.base)) (= 0 ULTIMATE.start_test_fun_~c~0.offset) (= (select |#length| ULTIMATE.start_test_fun_~y_ref~0.base) 4) (= ULTIMATE.start_test_fun_~x_ref~0.offset 0) (= (select |#valid| ULTIMATE.start_test_fun_~y_ref~0.base) 1) (= 1 (select |#valid| ULTIMATE.start_test_fun_~x_ref~0.base)) (= ULTIMATE.start_test_fun_~y_ref~0.offset 0) (= 4 (select |#length| ULTIMATE.start_test_fun_~c~0.base)) (= 1 (select |#valid| ULTIMATE.start_test_fun_~c~0.base))) [2020-06-22 09:18:43,462 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr13REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. [2020-06-22 09:18:43,463 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. [2020-06-22 09:18:43,463 INFO L448 ceAbstractionStarter]: For program point L13-4(lines 13 17) no Hoare annotation was computed. [2020-06-22 09:18:43,463 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr3REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. [2020-06-22 09:18:43,463 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0REQUIRES_VIOLATION(line 10) no Hoare annotation was computed. [2020-06-22 09:18:43,463 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1REQUIRES_VIOLATION(line 10) no Hoare annotation was computed. [2020-06-22 09:18:43,463 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr6REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. [2020-06-22 09:18:43,463 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr7REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. [2020-06-22 09:18:43,464 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr4REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. [2020-06-22 09:18:43,464 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr5REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. [2020-06-22 09:18:43,464 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2020-06-22 09:18:43,464 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-06-22 09:18:43,464 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr18REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. [2020-06-22 09:18:43,464 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr19REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. [2020-06-22 09:18:43,464 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr16REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-06-22 09:18:43,464 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr17REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-06-22 09:18:43,465 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr22REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. [2020-06-22 09:18:43,465 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr23REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. [2020-06-22 09:18:43,465 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr20REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. [2020-06-22 09:18:43,465 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr21REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. [2020-06-22 09:18:43,465 INFO L448 ceAbstractionStarter]: For program point L16(line 16) no Hoare annotation was computed. [2020-06-22 09:18:43,465 INFO L448 ceAbstractionStarter]: For program point L16-1(line 16) no Hoare annotation was computed. [2020-06-22 09:18:43,465 INFO L448 ceAbstractionStarter]: For program point L14(line 14) no Hoare annotation was computed. [2020-06-22 09:18:43,465 INFO L448 ceAbstractionStarter]: For program point L14-1(line 14) no Hoare annotation was computed. [2020-06-22 09:18:43,465 INFO L448 ceAbstractionStarter]: For program point L10(line 10) no Hoare annotation was computed. [2020-06-22 09:18:43,465 INFO L448 ceAbstractionStarter]: For program point L10-1(line 10) no Hoare annotation was computed. [2020-06-22 09:18:43,466 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2020-06-22 09:18:43,474 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:18:43,475 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:18:43,476 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:18:43,481 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:18:43,482 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:18:43,482 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:18:43,485 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 09:18:43 BasicIcfg [2020-06-22 09:18:43,485 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-06-22 09:18:43,485 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-06-22 09:18:43,485 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-06-22 09:18:43,489 INFO L276 PluginConnector]: BuchiAutomizer initialized [2020-06-22 09:18:43,489 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 09:18:43,489 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.06 09:18:41" (1/5) ... [2020-06-22 09:18:43,490 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@487cba45 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.06 09:18:43, skipping insertion in model container [2020-06-22 09:18:43,490 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 09:18:43,490 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:18:41" (2/5) ... [2020-06-22 09:18:43,490 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@487cba45 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.06 09:18:43, skipping insertion in model container [2020-06-22 09:18:43,491 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 09:18:43,491 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 09:18:41" (3/5) ... [2020-06-22 09:18:43,491 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@487cba45 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 09:18:43, skipping insertion in model container [2020-06-22 09:18:43,491 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 09:18:43,491 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 09:18:41" (4/5) ... [2020-06-22 09:18:43,492 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@487cba45 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 09:18:43, skipping insertion in model container [2020-06-22 09:18:43,492 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 09:18:43,492 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 09:18:43" (5/5) ... [2020-06-22 09:18:43,493 INFO L375 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-06-22 09:18:43,514 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2020-06-22 09:18:43,514 INFO L374 BuchiCegarLoop]: Interprodecural is true [2020-06-22 09:18:43,514 INFO L375 BuchiCegarLoop]: Hoare is true [2020-06-22 09:18:43,515 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-06-22 09:18:43,515 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-06-22 09:18:43,515 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-06-22 09:18:43,515 INFO L379 BuchiCegarLoop]: Difference is false [2020-06-22 09:18:43,515 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-06-22 09:18:43,515 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-06-22 09:18:43,519 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states. [2020-06-22 09:18:43,525 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2020-06-22 09:18:43,525 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 09:18:43,525 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 09:18:43,529 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-06-22 09:18:43,529 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 09:18:43,530 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2020-06-22 09:18:43,530 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states. [2020-06-22 09:18:43,532 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2020-06-22 09:18:43,532 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 09:18:43,532 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 09:18:43,532 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-06-22 09:18:43,533 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 09:18:43,538 INFO L794 eck$LassoCheckResult]: Stem: 33#ULTIMATE.startENTRYtrue [94] ULTIMATE.startENTRY-->L-1: Formula: (and (= |v_#NULL.offset_1| 0) (= |v_#NULL.base_1| 0) (= |v_#valid_1| (store |v_#valid_2| 0 0))) InVars {#valid=|v_#valid_2|} OutVars{#NULL.offset=|v_#NULL.offset_1|, #NULL.base=|v_#NULL.base_1|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid, #NULL.offset, #NULL.base] 14#L-1true [141] L-1-->L10: Formula: (let ((.cse1 (store |v_#valid_6| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 1))) (let ((.cse0 (store .cse1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 1))) (and (< |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (< |v_ULTIMATE.start_test_fun_#t~malloc2.base_1| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_test_fun_#t~malloc0.offset_1| 0) (= |v_ULTIMATE.start_test_fun_#t~malloc1.offset_1| 0) (= (select |v_#valid_6| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1|) 0) (> |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 0) (> |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 0) (= v_ULTIMATE.start_test_fun_~y_ref~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc1.offset_1|) (< 0 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|) (= |v_#length_1| (store (store (store |v_#length_4| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 4) |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 4) |v_ULTIMATE.start_test_fun_#t~malloc2.base_1| 4)) (= v_ULTIMATE.start_test_fun_~c~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|) (= v_ULTIMATE.start_test_fun_~x_ref~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc0.offset_1|) (= (store .cse0 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1| 1) |v_#valid_3|) (= v_ULTIMATE.start_test_fun_~y_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|) (= 0 (select .cse1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|)) (= |v_ULTIMATE.start_test_fun_#in~y_1| |v_ULTIMATE.start_main_#t~nondet10_1|) (= v_ULTIMATE.start_test_fun_~x_1 |v_ULTIMATE.start_test_fun_#in~x_1|) (= 0 (select .cse0 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|)) (= |v_ULTIMATE.start_test_fun_#t~malloc2.offset_1| 0) (= v_ULTIMATE.start_test_fun_~x_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc0.base_1|) (= v_ULTIMATE.start_test_fun_~c~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc2.offset_1|) (< |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_test_fun_#in~x_1| |v_ULTIMATE.start_main_#t~nondet9_1|) (= v_ULTIMATE.start_test_fun_~y_1 |v_ULTIMATE.start_test_fun_#in~y_1|)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_4|, #valid=|v_#valid_6|} OutVars{ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_1, ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_1, ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_1|, ULTIMATE.start_main_#t~nondet9=|v_ULTIMATE.start_main_#t~nondet9_1|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_1, ULTIMATE.start_test_fun_#t~malloc1.offset=|v_ULTIMATE.start_test_fun_#t~malloc1.offset_1|, ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_1|, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_1|, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_1|, ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_1|, ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_1|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_1|, ULTIMATE.start_test_fun_#res=|v_ULTIMATE.start_test_fun_#res_1|, #length=|v_#length_1|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_1, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_1, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_1, ULTIMATE.start_test_fun_#t~malloc0.offset=|v_ULTIMATE.start_test_fun_#t~malloc0.offset_1|, ULTIMATE.start_test_fun_#in~y=|v_ULTIMATE.start_test_fun_#in~y_1|, ULTIMATE.start_test_fun_#in~x=|v_ULTIMATE.start_test_fun_#in~x_1|, ULTIMATE.start_test_fun_#t~malloc1.base=|v_ULTIMATE.start_test_fun_#t~malloc1.base_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_test_fun_#t~malloc2.base=|v_ULTIMATE.start_test_fun_#t~malloc2.base_1|, ULTIMATE.start_test_fun_#t~malloc2.offset=|v_ULTIMATE.start_test_fun_#t~malloc2.offset_1|, ULTIMATE.start_test_fun_#t~malloc0.base=|v_ULTIMATE.start_test_fun_#t~malloc0.base_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_#t~ret11=|v_ULTIMATE.start_main_#t~ret11_1|, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_1, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_1} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_~y, ULTIMATE.start_test_fun_~x, ULTIMATE.start_main_#t~nondet10, ULTIMATE.start_main_#t~nondet9, ULTIMATE.start_test_fun_~x_ref~0.offset, ULTIMATE.start_test_fun_#t~malloc1.offset, ULTIMATE.start_test_fun_#t~mem8, ULTIMATE.start_test_fun_#t~mem6, ULTIMATE.start_test_fun_#t~mem7, ULTIMATE.start_test_fun_#t~mem4, ULTIMATE.start_test_fun_#t~mem5, ULTIMATE.start_test_fun_#t~mem3, ULTIMATE.start_test_fun_#res, #length, ULTIMATE.start_test_fun_~y_ref~0.base, ULTIMATE.start_test_fun_~x_ref~0.base, ULTIMATE.start_test_fun_~c~0.offset, ULTIMATE.start_test_fun_#t~malloc0.offset, ULTIMATE.start_test_fun_#in~y, ULTIMATE.start_test_fun_#in~x, ULTIMATE.start_test_fun_#t~malloc1.base, ULTIMATE.start_test_fun_#t~malloc2.base, ULTIMATE.start_test_fun_#t~malloc2.offset, ULTIMATE.start_test_fun_#t~malloc0.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_#t~ret11, ULTIMATE.start_test_fun_~y_ref~0.offset, ULTIMATE.start_test_fun_~c~0.base] 16#L10true [72] L10-->L10-1: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_3 4) (select |v_#length_5| v_ULTIMATE.start_test_fun_~x_ref~0.base_3)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_3) (= (select |v_#valid_7| v_ULTIMATE.start_test_fun_~x_ref~0.base_3) 1) (= (store |v_#memory_int_2| v_ULTIMATE.start_test_fun_~x_ref~0.base_3 (store (select |v_#memory_int_2| v_ULTIMATE.start_test_fun_~x_ref~0.base_3) v_ULTIMATE.start_test_fun_~x_ref~0.offset_3 v_ULTIMATE.start_test_fun_~x_3)) |v_#memory_int_1|)) InVars {ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_3, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_3, #length=|v_#length_5|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_3} OutVars{ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_3, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_3, #length=|v_#length_5|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_3} AuxVars[] AssignedVars[#memory_int] 28#L10-1true [87] L10-1-->L11: Formula: (and (= |v_#memory_int_3| (store |v_#memory_int_4| v_ULTIMATE.start_test_fun_~y_ref~0.base_3 (store (select |v_#memory_int_4| v_ULTIMATE.start_test_fun_~y_ref~0.base_3) v_ULTIMATE.start_test_fun_~y_ref~0.offset_3 v_ULTIMATE.start_test_fun_~y_3))) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_3 4) (select |v_#length_7| v_ULTIMATE.start_test_fun_~y_ref~0.base_3)) (= 1 (select |v_#valid_9| v_ULTIMATE.start_test_fun_~y_ref~0.base_3)) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_3)) InVars {ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_3, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_4|, #length=|v_#length_7|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_3, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_3} OutVars{ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_3, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_3|, #length=|v_#length_7|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_3, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_3} AuxVars[] AssignedVars[#memory_int] 34#L11true [95] L11-->L13-3: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_3) (= 1 (select |v_#valid_11| v_ULTIMATE.start_test_fun_~c~0.base_3)) (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_3 4) (select |v_#length_9| v_ULTIMATE.start_test_fun_~c~0.base_3)) (= (store |v_#memory_int_6| v_ULTIMATE.start_test_fun_~c~0.base_3 (store (select |v_#memory_int_6| v_ULTIMATE.start_test_fun_~c~0.base_3) v_ULTIMATE.start_test_fun_~c~0.offset_3 0)) |v_#memory_int_5|)) InVars {#memory_int=|v_#memory_int_6|, #length=|v_#length_9|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_3, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_3, #valid=|v_#valid_11|} OutVars{#memory_int=|v_#memory_int_5|, #length=|v_#length_9|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_3, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_3, #valid=|v_#valid_11|} AuxVars[] AssignedVars[#memory_int] 30#L13-3true [2020-06-22 09:18:43,539 INFO L796 eck$LassoCheckResult]: Loop: 30#L13-3true [91] L13-3-->L13: Formula: (and (= |v_ULTIMATE.start_test_fun_#t~mem3_2| (select (select |v_#memory_int_7| v_ULTIMATE.start_test_fun_~x_ref~0.base_6) v_ULTIMATE.start_test_fun_~x_ref~0.offset_5)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_5) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_5 4) (select |v_#length_11| v_ULTIMATE.start_test_fun_~x_ref~0.base_6)) (= 1 (select |v_#valid_13| v_ULTIMATE.start_test_fun_~x_ref~0.base_6))) InVars {#memory_int=|v_#memory_int_7|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_5, #length=|v_#length_11|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_6, #valid=|v_#valid_13|} OutVars{ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_2|, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_5, #length=|v_#length_11|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem3] 38#L13true [101] L13-->L13-1: Formula: (and (= (select (select |v_#memory_int_8| v_ULTIMATE.start_test_fun_~y_ref~0.base_6) v_ULTIMATE.start_test_fun_~y_ref~0.offset_5) |v_ULTIMATE.start_test_fun_#t~mem4_2|) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_5) (= (select |v_#valid_15| v_ULTIMATE.start_test_fun_~y_ref~0.base_6) 1) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_5 4) (select |v_#length_13| v_ULTIMATE.start_test_fun_~y_ref~0.base_6))) InVars {#memory_int=|v_#memory_int_8|, #length=|v_#length_13|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_6, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_5, #valid=|v_#valid_15|} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_2|, #valid=|v_#valid_15|, #memory_int=|v_#memory_int_8|, #length=|v_#length_13|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_6, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_5} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem4] 35#L13-1true [100] L13-1-->L14: Formula: (< |v_ULTIMATE.start_test_fun_#t~mem4_6| |v_ULTIMATE.start_test_fun_#t~mem3_6|) InVars {ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_6|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_6|} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_5|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_5|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem4, ULTIMATE.start_test_fun_#t~mem3] 22#L14true [80] L14-->L14-1: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_7 4) (select |v_#length_15| v_ULTIMATE.start_test_fun_~x_ref~0.base_9)) (= |v_ULTIMATE.start_test_fun_#t~mem5_2| (select (select |v_#memory_int_9| v_ULTIMATE.start_test_fun_~x_ref~0.base_9) v_ULTIMATE.start_test_fun_~x_ref~0.offset_7)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_7) (= (select |v_#valid_17| v_ULTIMATE.start_test_fun_~x_ref~0.base_9) 1)) InVars {#memory_int=|v_#memory_int_9|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_7, #length=|v_#length_15|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_9, #valid=|v_#valid_17|} OutVars{ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_2|, #valid=|v_#valid_17|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_7, #length=|v_#length_15|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_9} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem5] 19#L14-1true [191] L14-1-->L15: Formula: (and (= (store |v_#memory_int_21| v_ULTIMATE.start_test_fun_~x_ref~0.base_15 (store (select |v_#memory_int_21| v_ULTIMATE.start_test_fun_~x_ref~0.base_15) v_ULTIMATE.start_test_fun_~x_ref~0.offset_11 (+ |v_ULTIMATE.start_test_fun_#t~mem5_6| 1))) |v_#memory_int_20|) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_11 4) (select |v_#length_30| v_ULTIMATE.start_test_fun_~x_ref~0.base_15)) (= 1 (select |v_#valid_37| v_ULTIMATE.start_test_fun_~x_ref~0.base_15)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_11)) InVars {ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_6|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_21|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_11, #length=|v_#length_30|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_15} OutVars{ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_5|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_20|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_11, #length=|v_#length_30|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_15} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem5, #memory_int] 23#L15true [84] L15-->L15-1: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_7 4) (select |v_#length_19| v_ULTIMATE.start_test_fun_~y_ref~0.base_9)) (= (select |v_#valid_21| v_ULTIMATE.start_test_fun_~y_ref~0.base_9) 1) (= (select (select |v_#memory_int_12| v_ULTIMATE.start_test_fun_~y_ref~0.base_9) v_ULTIMATE.start_test_fun_~y_ref~0.offset_7) |v_ULTIMATE.start_test_fun_#t~mem6_2|) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_7)) InVars {#memory_int=|v_#memory_int_12|, #length=|v_#length_19|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_9, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_7, #valid=|v_#valid_21|} OutVars{#valid=|v_#valid_21|, #memory_int=|v_#memory_int_12|, #length=|v_#length_19|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_9, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_2|, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_7} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem6] 39#L15-1true [195] L15-1-->L16: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_11) (= (select |v_#valid_44| v_ULTIMATE.start_test_fun_~y_ref~0.base_15) 1) (= (store |v_#memory_int_26| v_ULTIMATE.start_test_fun_~y_ref~0.base_15 (store (select |v_#memory_int_26| v_ULTIMATE.start_test_fun_~y_ref~0.base_15) v_ULTIMATE.start_test_fun_~y_ref~0.offset_11 (+ |v_ULTIMATE.start_test_fun_#t~mem6_6| 2))) |v_#memory_int_25|) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_11 4) (select |v_#length_34| v_ULTIMATE.start_test_fun_~y_ref~0.base_15))) InVars {#valid=|v_#valid_44|, #memory_int=|v_#memory_int_26|, #length=|v_#length_34|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_15, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_6|, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_11} OutVars{#valid=|v_#valid_44|, #memory_int=|v_#memory_int_25|, #length=|v_#length_34|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_15, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_5|, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_11} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_test_fun_#t~mem6] 7#L16true [63] L16-->L16-1: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_5 4) (select |v_#length_23| v_ULTIMATE.start_test_fun_~c~0.base_6)) (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_5) (= 1 (select |v_#valid_25| v_ULTIMATE.start_test_fun_~c~0.base_6)) (= |v_ULTIMATE.start_test_fun_#t~mem7_2| (select (select |v_#memory_int_15| v_ULTIMATE.start_test_fun_~c~0.base_6) v_ULTIMATE.start_test_fun_~c~0.offset_5))) InVars {#memory_int=|v_#memory_int_15|, #length=|v_#length_23|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_5, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_6, #valid=|v_#valid_25|} OutVars{ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_5, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_15|, #length=|v_#length_23|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_6, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_2|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem7] 3#L16-1true [196] L16-1-->L13-3: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_15 4) (select |v_#length_35| v_ULTIMATE.start_test_fun_~c~0.base_19)) (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_15) (= 1 (select |v_#valid_45| v_ULTIMATE.start_test_fun_~c~0.base_19)) (= (store |v_#memory_int_28| v_ULTIMATE.start_test_fun_~c~0.base_19 (store (select |v_#memory_int_28| v_ULTIMATE.start_test_fun_~c~0.base_19) v_ULTIMATE.start_test_fun_~c~0.offset_15 (+ |v_ULTIMATE.start_test_fun_#t~mem7_6| 1))) |v_#memory_int_27|)) InVars {ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_15, #valid=|v_#valid_45|, #memory_int=|v_#memory_int_28|, #length=|v_#length_35|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_19, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_6|} OutVars{ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_15, #valid=|v_#valid_45|, #memory_int=|v_#memory_int_27|, #length=|v_#length_35|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_19, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_5|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_test_fun_#t~mem7] 30#L13-3true [2020-06-22 09:18:43,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:18:43,540 INFO L82 PathProgramCache]: Analyzing trace with hash 119712640, now seen corresponding path program 1 times [2020-06-22 09:18:43,541 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:18:43,541 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:18:43,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:18:43,542 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:18:43,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:18:43,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:18:43,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:18:43,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:18:43,591 INFO L82 PathProgramCache]: Analyzing trace with hash -510456228, now seen corresponding path program 1 times [2020-06-22 09:18:43,591 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:18:43,591 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:18:43,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:18:43,592 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:18:43,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:18:43,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:18:43,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:18:43,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:18:43,613 INFO L82 PathProgramCache]: Analyzing trace with hash -5250627, now seen corresponding path program 1 times [2020-06-22 09:18:43,613 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:18:43,613 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:18:43,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:18:43,614 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:18:43,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:18:43,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:18:43,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:18:44,222 WARN L188 SmtUtils]: Spent 402.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 92 [2020-06-22 09:18:44,391 WARN L188 SmtUtils]: Spent 166.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2020-06-22 09:18:44,404 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 09:18:44,406 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 09:18:44,406 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 09:18:44,406 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 09:18:44,406 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 09:18:44,406 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 09:18:44,406 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 09:18:44,406 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 09:18:44,407 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Lasso [2020-06-22 09:18:44,407 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 09:18:44,407 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 09:18:44,429 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:18:44,435 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:18:44,439 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:18:44,442 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:18:44,444 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:18:44,812 WARN L188 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 74 [2020-06-22 09:18:44,924 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 60 [2020-06-22 09:18:44,924 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:18:44,927 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:18:44,928 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:18:44,930 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:18:44,932 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:18:44,934 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:18:44,936 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:18:44,938 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:18:45,372 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 09:18:45,377 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 09:18:45,389 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:18:45,390 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:18:45,391 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:18:45,391 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:18:45,391 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:18:45,391 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:18:45,393 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 09:18:45,394 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:18:45,395 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:18:45,396 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:18:45,396 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:18:45,397 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:18:45,397 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:18:45,397 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:18:45,399 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 09:18:45,400 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 09:18:45,402 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:18:45,403 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:18:45,403 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:18:45,404 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:18:45,404 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:18:45,404 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:18:45,406 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 09:18:45,407 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 09:18:45,410 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:18:45,410 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:18:45,411 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:18:45,411 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:18:45,411 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:18:45,411 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:18:45,411 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:18:45,412 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 09:18:45,412 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:18:45,412 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:18:45,413 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:18:45,413 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:18:45,413 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:18:45,414 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:18:45,414 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:18:45,418 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 09:18:45,418 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 09:18:45,437 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:18:45,438 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:18:45,438 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:18:45,439 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:18:45,439 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:18:45,439 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:18:45,441 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 09:18:45,441 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 09:18:45,450 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:18:45,450 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:18:45,451 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:18:45,451 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:18:45,451 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:18:45,451 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:18:45,456 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 09:18:45,457 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 09:18:45,482 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:18:45,482 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:18:45,483 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:18:45,483 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:18:45,483 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:18:45,483 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:18:45,485 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 09:18:45,485 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 09:18:45,492 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:18:45,492 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:18:45,493 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:18:45,493 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:18:45,493 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:18:45,493 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:18:45,495 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 09:18:45,495 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 09:18:45,502 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:18:45,503 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:18:45,503 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:18:45,503 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:18:45,503 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:18:45,504 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:18:45,505 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 09:18:45,505 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 09:18:45,507 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:18:45,507 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:18:45,507 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:18:45,508 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:18:45,508 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:18:45,508 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:18:45,509 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 09:18:45,510 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 09:18:45,516 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:18:45,516 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:18:45,517 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:18:45,517 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:18:45,517 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:18:45,517 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:18:45,520 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 09:18:45,520 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 09:18:45,540 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 09:18:45,564 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2020-06-22 09:18:45,564 INFO L444 ModelExtractionUtils]: 21 out of 28 variables were initially zero. Simplification set additionally 4 variables to zero. [2020-06-22 09:18:45,566 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 09:18:45,568 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-06-22 09:18:45,568 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 09:18:45,569 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_1, v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_1) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_1 - 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_1 Supporting invariants [] [2020-06-22 09:18:45,661 INFO L297 tatePredicateManager]: 23 out of 24 supporting invariants were superfluous and have been removed [2020-06-22 09:18:45,665 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:18:45,666 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:18:45,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:18:45,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:18:45,715 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 09:18:45,717 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 09:18:45,764 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2020-06-22 09:18:45,765 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 09:18:45,771 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 09:18:45,771 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:18:45,772 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:6 [2020-06-22 09:18:45,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:18:45,785 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 12 conjunts are in the unsatisfiable core [2020-06-22 09:18:45,787 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 09:18:45,925 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 09:18:45,925 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 68 [2020-06-22 09:18:45,937 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 09:18:45,980 INFO L497 ElimStorePlain]: treesize reduction 37, result has 48.6 percent of original size [2020-06-22 09:18:45,981 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 09:18:45,981 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:51, output treesize:30 [2020-06-22 09:18:46,044 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 37 [2020-06-22 09:18:46,045 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 09:18:46,055 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 09:18:46,055 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 37 [2020-06-22 09:18:46,056 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-06-22 09:18:46,079 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 09:18:46,080 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2020-06-22 09:18:46,080 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:93, output treesize:55 [2020-06-22 09:18:46,156 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:18:46,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:18:46,346 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 09:18:46,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:18:46,356 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 09:18:46,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:18:46,367 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 12 conjunts are in the unsatisfiable core [2020-06-22 09:18:46,368 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 09:18:46,423 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 09:18:46,424 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 63 [2020-06-22 09:18:46,431 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 09:18:46,477 INFO L497 ElimStorePlain]: treesize reduction 47, result has 42.0 percent of original size [2020-06-22 09:18:46,478 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 09:18:46,478 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:31 [2020-06-22 09:18:46,619 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 09:18:46,620 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 88 [2020-06-22 09:18:46,633 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 09:18:46,655 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 26 [2020-06-22 09:18:46,656 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-06-22 09:18:46,746 INFO L497 ElimStorePlain]: treesize reduction 84, result has 49.1 percent of original size [2020-06-22 09:18:46,748 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2020-06-22 09:18:46,749 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:75, output treesize:64 [2020-06-22 09:18:51,234 WARN L188 SmtUtils]: Spent 3.52 s on a formula simplification that was a NOOP. DAG size: 39 [2020-06-22 09:18:56,132 WARN L860 $PredicateComparison]: unable to prove that (or (= c_ULTIMATE.start_test_fun_~y_ref~0.offset c_ULTIMATE.start_test_fun_~x_ref~0.offset) (exists ((ULTIMATE.start_test_fun_~c~0.offset Int)) (not (and (= c_ULTIMATE.start_test_fun_~y_ref~0.offset ULTIMATE.start_test_fun_~c~0.offset) (= c_ULTIMATE.start_test_fun_~y_ref~0.base c_ULTIMATE.start_test_fun_~c~0.base)))) (<= (+ (select (select |c_#memory_int| c_ULTIMATE.start_test_fun_~x_ref~0.base) c_ULTIMATE.start_test_fun_~x_ref~0.offset) 3) (+ (select (select |c_#memory_int| c_ULTIMATE.start_test_fun_~c~0.base) c_ULTIMATE.start_test_fun_~y_ref~0.offset) c_oldRank0))) is different from true [2020-06-22 09:18:57,108 WARN L860 $PredicateComparison]: unable to prove that (or (exists ((ULTIMATE.start_test_fun_~c~0.offset Int)) (not (and (= c_ULTIMATE.start_test_fun_~y_ref~0.offset ULTIMATE.start_test_fun_~c~0.offset) (= c_ULTIMATE.start_test_fun_~y_ref~0.base c_ULTIMATE.start_test_fun_~c~0.base)))) (<= 0 c_oldRank0) (<= (+ (select (select |c_#memory_int| c_ULTIMATE.start_test_fun_~x_ref~0.base) c_ULTIMATE.start_test_fun_~x_ref~0.offset) 3) (+ (select (select |c_#memory_int| c_ULTIMATE.start_test_fun_~c~0.base) c_ULTIMATE.start_test_fun_~y_ref~0.offset) c_oldRank0))) is different from true [2020-06-22 09:18:58,155 WARN L860 $PredicateComparison]: unable to prove that (or (exists ((ULTIMATE.start_test_fun_~c~0.offset Int)) (not (and (= c_ULTIMATE.start_test_fun_~y_ref~0.offset ULTIMATE.start_test_fun_~c~0.offset) (= c_ULTIMATE.start_test_fun_~y_ref~0.base c_ULTIMATE.start_test_fun_~c~0.base)))) (= c_ULTIMATE.start_test_fun_~x_ref~0.base c_ULTIMATE.start_test_fun_~y_ref~0.base) (<= (+ (select (select |c_#memory_int| c_ULTIMATE.start_test_fun_~x_ref~0.base) c_ULTIMATE.start_test_fun_~x_ref~0.offset) 3) (+ (select (select |c_#memory_int| c_ULTIMATE.start_test_fun_~c~0.base) c_ULTIMATE.start_test_fun_~y_ref~0.offset) c_oldRank0))) is different from true [2020-06-22 09:18:58,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:18:58,195 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 09:18:58,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:18:58,206 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 12 conjunts are in the unsatisfiable core [2020-06-22 09:18:58,207 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 09:18:58,308 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 09:18:58,309 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 82 [2020-06-22 09:18:58,319 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 09:18:58,378 INFO L497 ElimStorePlain]: treesize reduction 96, result has 35.6 percent of original size [2020-06-22 09:18:58,379 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-06-22 09:18:58,380 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:38, output treesize:47 [2020-06-22 09:19:08,461 WARN L188 SmtUtils]: Spent 3.54 s on a formula simplification that was a NOOP. DAG size: 31 [2020-06-22 09:19:08,498 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 09:19:08,498 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 68 [2020-06-22 09:19:08,504 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 09:19:08,546 INFO L497 ElimStorePlain]: treesize reduction 37, result has 48.6 percent of original size [2020-06-22 09:19:08,547 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 09:19:08,547 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:51, output treesize:30 [2020-06-22 09:19:09,551 WARN L860 $PredicateComparison]: unable to prove that (or (exists ((ULTIMATE.start_test_fun_~c~0.offset Int)) (not (and (= c_ULTIMATE.start_test_fun_~y_ref~0.offset ULTIMATE.start_test_fun_~c~0.offset) (= c_ULTIMATE.start_test_fun_~y_ref~0.base c_ULTIMATE.start_test_fun_~c~0.base)))) (<= (+ (select (select |c_#memory_int| c_ULTIMATE.start_test_fun_~x_ref~0.base) c_ULTIMATE.start_test_fun_~x_ref~0.offset) 1) (+ (select (select |c_#memory_int| c_ULTIMATE.start_test_fun_~c~0.base) c_ULTIMATE.start_test_fun_~y_ref~0.offset) c_oldRank0))) is different from true [2020-06-22 09:19:09,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:19:09,565 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 09:19:09,565 INFO L98 LoopCannibalizer]: 12 predicates before loop cannibalization 29 predicates after loop cannibalization [2020-06-22 09:19:09,569 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 29 loop predicates [2020-06-22 09:19:09,570 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 39 states. Second operand 11 states. [2020-06-22 09:19:15,691 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 39 states.. Second operand 11 states. Result 85 states and 147 transitions. Complement of second has 26 states. [2020-06-22 09:19:15,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 15 states 2 stem states 11 non-accepting loop states 2 accepting loop states [2020-06-22 09:19:15,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-06-22 09:19:15,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 133 transitions. [2020-06-22 09:19:15,694 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 133 transitions. Stem has 5 letters. Loop has 9 letters. [2020-06-22 09:19:15,695 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 09:19:15,695 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 133 transitions. Stem has 14 letters. Loop has 9 letters. [2020-06-22 09:19:15,696 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 09:19:15,696 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 133 transitions. Stem has 5 letters. Loop has 18 letters. [2020-06-22 09:19:15,697 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 09:19:15,708 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 85 states and 147 transitions. [2020-06-22 09:19:15,712 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-06-22 09:19:15,712 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 85 states to 0 states and 0 transitions. [2020-06-22 09:19:15,713 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-06-22 09:19:15,713 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-06-22 09:19:15,714 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-06-22 09:19:15,714 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 09:19:15,714 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 09:19:15,714 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 09:19:15,714 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 09:19:15,714 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2020-06-22 09:19:15,715 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-06-22 09:19:15,715 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-06-22 09:19:15,715 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-06-22 09:19:15,721 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 09:19:15 BasicIcfg [2020-06-22 09:19:15,721 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-06-22 09:19:15,721 INFO L168 Benchmark]: Toolchain (without parser) took 34627.96 ms. Allocated memory was 649.6 MB in the beginning and 839.4 MB in the end (delta: 189.8 MB). Free memory was 559.9 MB in the beginning and 525.0 MB in the end (delta: 34.9 MB). Peak memory consumption was 224.7 MB. Max. memory is 50.3 GB. [2020-06-22 09:19:15,722 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 649.6 MB. Free memory is still 580.4 MB. There was no memory consumed. Max. memory is 50.3 GB. [2020-06-22 09:19:15,722 INFO L168 Benchmark]: CACSL2BoogieTranslator took 291.42 ms. Allocated memory was 649.6 MB in the beginning and 676.9 MB in the end (delta: 27.3 MB). Free memory was 559.9 MB in the beginning and 640.9 MB in the end (delta: -81.0 MB). Peak memory consumption was 29.2 MB. Max. memory is 50.3 GB. [2020-06-22 09:19:15,723 INFO L168 Benchmark]: Boogie Procedure Inliner took 39.86 ms. Allocated memory is still 676.9 MB. Free memory was 640.9 MB in the beginning and 639.8 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 50.3 GB. [2020-06-22 09:19:15,724 INFO L168 Benchmark]: Boogie Preprocessor took 22.99 ms. Allocated memory is still 676.9 MB. Free memory was 639.8 MB in the beginning and 637.6 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 50.3 GB. [2020-06-22 09:19:15,724 INFO L168 Benchmark]: RCFGBuilder took 343.14 ms. Allocated memory is still 676.9 MB. Free memory was 637.6 MB in the beginning and 613.2 MB in the end (delta: 24.5 MB). Peak memory consumption was 24.5 MB. Max. memory is 50.3 GB. [2020-06-22 09:19:15,725 INFO L168 Benchmark]: BlockEncodingV2 took 148.28 ms. Allocated memory is still 676.9 MB. Free memory was 613.2 MB in the beginning and 602.4 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 50.3 GB. [2020-06-22 09:19:15,725 INFO L168 Benchmark]: TraceAbstraction took 1541.68 ms. Allocated memory is still 676.9 MB. Free memory was 602.4 MB in the beginning and 430.0 MB in the end (delta: 172.4 MB). Peak memory consumption was 172.4 MB. Max. memory is 50.3 GB. [2020-06-22 09:19:15,726 INFO L168 Benchmark]: BuchiAutomizer took 32235.45 ms. Allocated memory was 676.9 MB in the beginning and 839.4 MB in the end (delta: 162.5 MB). Free memory was 430.0 MB in the beginning and 525.0 MB in the end (delta: -95.1 MB). Peak memory consumption was 67.5 MB. Max. memory is 50.3 GB. [2020-06-22 09:19:15,730 INFO L337 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 47 locations, 48 edges - StatisticsResult: Encoded RCFG 39 locations, 70 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 649.6 MB. Free memory is still 580.4 MB. There was no memory consumed. Max. memory is 50.3 GB. * CACSL2BoogieTranslator took 291.42 ms. Allocated memory was 649.6 MB in the beginning and 676.9 MB in the end (delta: 27.3 MB). Free memory was 559.9 MB in the beginning and 640.9 MB in the end (delta: -81.0 MB). Peak memory consumption was 29.2 MB. Max. memory is 50.3 GB. * Boogie Procedure Inliner took 39.86 ms. Allocated memory is still 676.9 MB. Free memory was 640.9 MB in the beginning and 639.8 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 50.3 GB. * Boogie Preprocessor took 22.99 ms. Allocated memory is still 676.9 MB. Free memory was 639.8 MB in the beginning and 637.6 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 50.3 GB. * RCFGBuilder took 343.14 ms. Allocated memory is still 676.9 MB. Free memory was 637.6 MB in the beginning and 613.2 MB in the end (delta: 24.5 MB). Peak memory consumption was 24.5 MB. Max. memory is 50.3 GB. * BlockEncodingV2 took 148.28 ms. Allocated memory is still 676.9 MB. Free memory was 613.2 MB in the beginning and 602.4 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 50.3 GB. * TraceAbstraction took 1541.68 ms. Allocated memory is still 676.9 MB. Free memory was 602.4 MB in the beginning and 430.0 MB in the end (delta: 172.4 MB). Peak memory consumption was 172.4 MB. Max. memory is 50.3 GB. * BuchiAutomizer took 32235.45 ms. Allocated memory was 676.9 MB in the beginning and 839.4 MB in the end (delta: 162.5 MB). Free memory was 430.0 MB in the beginning and 525.0 MB in the end (delta: -95.1 MB). Peak memory consumption was 67.5 MB. 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 #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 11]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 18]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 10]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 14]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 18]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 14]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 10]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 14]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 13]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 13]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 13]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 15]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 13]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 12]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 15]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 15]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 12]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 11]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 15]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 14]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 24 specifications checked. All of them hold - InvariantResult [Line: 12]: Loop Invariant [2020-06-22 09:19:15,739 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:19:15,739 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:19:15,739 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:19:15,740 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:19:15,740 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:19:15,741 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: (((((((4 == unknown-#length-unknown[x_ref] && 0 == c) && unknown-#length-unknown[y_ref] == 4) && x_ref == 0) && \valid[y_ref] == 1) && 1 == \valid[x_ref]) && y_ref == 0) && 4 == unknown-#length-unknown[c]) && 1 == \valid[c] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 39 locations, 24 error locations. SAFE Result, 1.4s OverallTime, 9 OverallIterations, 1 TraceHistogramMax, 0.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 40 SDtfs, 296 SDslu, 6 SDs, 0 SdLazy, 349 SolverSat, 102 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 18 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=39occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 9 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 1 NumberOfFragments, 40 HoareAnnotationTreeSize, 1 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 1 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 36 NumberOfCodeBlocks, 36 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 27 ConstructedInterpolants, 0 QuantifiedInterpolants, 367 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available - StatisticsResult: Constructed decomposition of program Your program was decomposed into 1 terminating modules (0 trivial, 0 deterministic, 1 nondeterministic). One nondeterministic module has affine ranking function unknown-#memory_int-unknown[x_ref][x_ref] + -1 * unknown-#memory_int-unknown[y_ref][y_ref] and consists of 15 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 32.2s and 2 iterations. TraceHistogramMax:1. Analysis of lassos took 2.1s. Construction of modules took 0.7s. Büchi inclusion checks took 29.3s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 0. Automata minimization No data available. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 0 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 6 SDtfs, 289 SDslu, 56 SDs, 0 SdLazy, 1208 SolverSat, 30 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital446 mio100 ax100 hnf100 lsp97 ukn42 mio100 lsp39 div100 bol100 ite100 ukn100 eq182 hnf88 smp97 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 6ms 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:18:37.882 ----------------------------------------------- eclipse.buildId=unknown java.version=1.8.0_242 java.vendor=Oracle Corporation BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox2/benchmark/theBenchmark.c Command-line arguments: -os linux -ws gtk -arch x86_64 -consoleLog -data @user.home/.ultimate -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -data /export/starexec/sandbox2/tmp -i /export/starexec/sandbox2/benchmark/theBenchmark.c !ENTRY org.eclipse.core.resources 2 10035 2020-06-22 09:19:15.967 !MESSAGE The workspace will exit with unsaved changes in this session. Received shutdown request... Ultimate: GTK+ Version Check