YES Ultimate: Cannot open display: This is Ultimate 0.1.24-8dc7c08-m [2020-06-22 09:22:11,005 INFO L170 SettingsManager]: Resetting all preferences to default values... [2020-06-22 09:22:11,007 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2020-06-22 09:22:11,018 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-06-22 09:22:11,019 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-06-22 09:22:11,019 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-06-22 09:22:11,021 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-06-22 09:22:11,022 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2020-06-22 09:22:11,024 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-06-22 09:22:11,024 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-06-22 09:22:11,025 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-06-22 09:22:11,026 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-06-22 09:22:11,026 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-06-22 09:22:11,027 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-06-22 09:22:11,028 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-06-22 09:22:11,029 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-06-22 09:22:11,030 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-06-22 09:22:11,032 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-06-22 09:22:11,033 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2020-06-22 09:22:11,035 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-06-22 09:22:11,036 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-06-22 09:22:11,037 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-06-22 09:22:11,039 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-06-22 09:22:11,039 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-06-22 09:22:11,039 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-06-22 09:22:11,040 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-06-22 09:22:11,040 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-06-22 09:22:11,041 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-06-22 09:22:11,041 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-06-22 09:22:11,042 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-06-22 09:22:11,043 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-06-22 09:22:11,043 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2020-06-22 09:22:11,044 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-06-22 09:22:11,045 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2020-06-22 09:22:11,045 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-06-22 09:22:11,045 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-06-22 09:22:11,046 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2020-06-22 09:22:11,046 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2020-06-22 09:22:11,047 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2020-06-22 09:22:11,047 INFO L98 SettingsManager]: Beginning loading settings from /export/starexec/sandbox2/solver/bin/./../termcomp2017.epf [2020-06-22 09:22:11,061 INFO L110 SettingsManager]: Loading preferences was successful [2020-06-22 09:22:11,062 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2020-06-22 09:22:11,063 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-06-22 09:22:11,063 INFO L133 SettingsManager]: * Rewrite not-equals=true [2020-06-22 09:22:11,063 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2020-06-22 09:22:11,063 INFO L133 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE [2020-06-22 09:22:11,063 INFO L133 SettingsManager]: * Use SBE=true [2020-06-22 09:22:11,063 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-06-22 09:22:11,064 INFO L133 SettingsManager]: * Use old map elimination=false [2020-06-22 09:22:11,064 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2020-06-22 09:22:11,064 INFO L133 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION [2020-06-22 09:22:11,064 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2020-06-22 09:22:11,064 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-06-22 09:22:11,064 INFO L133 SettingsManager]: * Construct termination proof for TermComp=true [2020-06-22 09:22:11,065 INFO L133 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 09:22:11,065 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-06-22 09:22:11,065 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-06-22 09:22:11,065 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2020-06-22 09:22:11,065 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2020-06-22 09:22:11,065 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-06-22 09:22:11,066 INFO L133 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE [2020-06-22 09:22:11,066 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-06-22 09:22:11,066 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-06-22 09:22:11,066 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-06-22 09:22:11,066 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-06-22 09:22:11,066 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-06-22 09:22:11,067 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-06-22 09:22:11,067 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2020-06-22 09:22:11,067 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-06-22 09:22:11,093 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-06-22 09:22:11,105 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-06-22 09:22:11,109 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-06-22 09:22:11,110 INFO L271 PluginConnector]: Initializing CDTParser... [2020-06-22 09:22:11,111 INFO L276 PluginConnector]: CDTParser initialized [2020-06-22 09:22:11,111 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox2/benchmark/theBenchmark.c [2020-06-22 09:22:11,214 INFO L221 CDTParser]: Created temporary CDT project at /export/starexec/sandbox2/tmp/dc431c9f0bc9406e953752de71846fae/FLAG35273a577 [2020-06-22 09:22:11,558 INFO L307 CDTParser]: Found 1 translation units. [2020-06-22 09:22:11,558 INFO L161 CDTParser]: Scanning /export/starexec/sandbox2/benchmark/theBenchmark.c [2020-06-22 09:22:11,559 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. [2020-06-22 09:22:11,565 INFO L355 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox2/tmp/dc431c9f0bc9406e953752de71846fae/FLAG35273a577 [2020-06-22 09:22:11,958 INFO L363 CDTParser]: Successfully deleted /export/starexec/sandbox2/tmp/dc431c9f0bc9406e953752de71846fae [2020-06-22 09:22:11,970 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-06-22 09:22:11,971 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. [2020-06-22 09:22:11,972 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-06-22 09:22:11,972 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-06-22 09:22:11,976 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2020-06-22 09:22:11,977 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.06 09:22:11" (1/1) ... [2020-06-22 09:22:11,980 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f4cc914 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:22:11, skipping insertion in model container [2020-06-22 09:22:11,980 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.06 09:22:11" (1/1) ... [2020-06-22 09:22:11,988 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-06-22 09:22:12,007 INFO L176 MainTranslator]: Built tables and reachable declarations [2020-06-22 09:22:12,176 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-06-22 09:22:12,190 INFO L191 MainTranslator]: Completed pre-run [2020-06-22 09:22:12,263 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-06-22 09:22:12,279 INFO L195 MainTranslator]: Completed translation [2020-06-22 09:22:12,280 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:22:12 WrapperNode [2020-06-22 09:22:12,280 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-06-22 09:22:12,281 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-06-22 09:22:12,281 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-06-22 09:22:12,281 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2020-06-22 09:22:12,290 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:22:12" (1/1) ... [2020-06-22 09:22:12,298 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:22:12" (1/1) ... [2020-06-22 09:22:12,320 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-06-22 09:22:12,321 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-06-22 09:22:12,321 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-06-22 09:22:12,321 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2020-06-22 09:22:12,330 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:22:12" (1/1) ... [2020-06-22 09:22:12,330 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:22:12" (1/1) ... [2020-06-22 09:22:12,332 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:22:12" (1/1) ... [2020-06-22 09:22:12,332 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:22:12" (1/1) ... [2020-06-22 09:22:12,336 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:22:12" (1/1) ... [2020-06-22 09:22:12,341 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:22:12" (1/1) ... [2020-06-22 09:22:12,342 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:22:12" (1/1) ... [2020-06-22 09:22:12,344 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-06-22 09:22:12,344 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-06-22 09:22:12,344 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-06-22 09:22:12,345 INFO L276 PluginConnector]: RCFGBuilder initialized [2020-06-22 09:22:12,345 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:22:12" (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:22:12,414 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-06-22 09:22:12,414 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-06-22 09:22:12,414 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-06-22 09:22:12,415 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-06-22 09:22:12,415 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-06-22 09:22:12,415 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-06-22 09:22:12,686 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-06-22 09:22:12,686 INFO L286 CfgBuilder]: Removed 7 assue(true) statements. [2020-06-22 09:22:12,687 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 09:22:12 BoogieIcfgContainer [2020-06-22 09:22:12,688 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-06-22 09:22:12,688 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- [2020-06-22 09:22:12,688 INFO L271 PluginConnector]: Initializing BlockEncodingV2... [2020-06-22 09:22:12,690 INFO L276 PluginConnector]: BlockEncodingV2 initialized [2020-06-22 09:22:12,691 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 09:22:12" (1/1) ... [2020-06-22 09:22:12,708 INFO L313 BlockEncoder]: Initial Icfg 47 locations, 48 edges [2020-06-22 09:22:12,709 INFO L258 BlockEncoder]: Using Remove infeasible edges [2020-06-22 09:22:12,710 INFO L263 BlockEncoder]: Using Maximize final states [2020-06-22 09:22:12,711 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false [2020-06-22 09:22:12,711 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE [2020-06-22 09:22:12,713 INFO L296 BlockEncoder]: Using Remove sink states [2020-06-22 09:22:12,714 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true [2020-06-22 09:22:12,714 INFO L179 BlockEncoder]: Using Rewrite not-equals [2020-06-22 09:22:12,740 INFO L185 BlockEncoder]: Using Use SBE [2020-06-22 09:22:12,777 INFO L200 BlockEncoder]: SBE split 25 edges [2020-06-22 09:22:12,782 INFO L70 emoveInfeasibleEdges]: Removed 1 edges and 0 locations because of local infeasibility [2020-06-22 09:22:12,784 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-06-22 09:22:12,824 INFO L100 BaseMinimizeStates]: Removed 14 edges and 7 locations by large block encoding [2020-06-22 09:22:12,826 INFO L70 RemoveSinkStates]: Removed 1 edges and 1 locations by removing sink states [2020-06-22 09:22:12,828 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-06-22 09:22:12,828 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-06-22 09:22:12,829 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding [2020-06-22 09:22:12,829 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states [2020-06-22 09:22:12,830 INFO L313 BlockEncoder]: Encoded RCFG 39 locations, 70 edges [2020-06-22 09:22:12,830 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 09:22:12 BasicIcfg [2020-06-22 09:22:12,830 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- [2020-06-22 09:22:12,831 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-06-22 09:22:12,832 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-06-22 09:22:12,835 INFO L276 PluginConnector]: TraceAbstraction initialized [2020-06-22 09:22:12,835 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.06 09:22:11" (1/4) ... [2020-06-22 09:22:12,836 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f1082f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 09:22:12, skipping insertion in model container [2020-06-22 09:22:12,836 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:22:12" (2/4) ... [2020-06-22 09:22:12,836 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f1082f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 09:22:12, skipping insertion in model container [2020-06-22 09:22:12,837 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 09:22:12" (3/4) ... [2020-06-22 09:22:12,837 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f1082f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 09:22:12, skipping insertion in model container [2020-06-22 09:22:12,837 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 09:22:12" (4/4) ... [2020-06-22 09:22:12,839 INFO L112 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-06-22 09:22:12,849 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2020-06-22 09:22:12,857 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 24 error locations. [2020-06-22 09:22:12,873 INFO L257 AbstractCegarLoop]: Starting to check reachability of 24 error locations. [2020-06-22 09:22:12,901 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2020-06-22 09:22:12,902 INFO L382 AbstractCegarLoop]: Interprodecural is true [2020-06-22 09:22:12,902 INFO L383 AbstractCegarLoop]: Hoare is true [2020-06-22 09:22:12,902 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2020-06-22 09:22:12,903 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-06-22 09:22:12,903 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-06-22 09:22:12,903 INFO L387 AbstractCegarLoop]: Difference is false [2020-06-22 09:22:12,903 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-06-22 09:22:12,903 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-06-22 09:22:12,918 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states. [2020-06-22 09:22:12,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-06-22 09:22:12,924 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 09:22:12,925 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-06-22 09:22:12,925 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION]=== [2020-06-22 09:22:12,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:22:12,931 INFO L82 PathProgramCache]: Analyzing trace with hash 124423, now seen corresponding path program 1 times [2020-06-22 09:22:12,932 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:22:12,933 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:22:12,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:22:12,985 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:22:12,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:22:13,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:22:13,094 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:22:13,096 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 09:22:13,097 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 09:22:13,100 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 09:22:13,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 09:22:13,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 09:22:13,117 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 3 states. [2020-06-22 09:22:13,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:22:13,274 INFO L93 Difference]: Finished difference Result 43 states and 70 transitions. [2020-06-22 09:22:13,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 09:22:13,276 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-06-22 09:22:13,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 09:22:13,290 INFO L225 Difference]: With dead ends: 43 [2020-06-22 09:22:13,291 INFO L226 Difference]: Without dead ends: 39 [2020-06-22 09:22:13,294 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:22:13,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2020-06-22 09:22:13,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2020-06-22 09:22:13,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-06-22 09:22:13,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 66 transitions. [2020-06-22 09:22:13,337 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 66 transitions. Word has length 3 [2020-06-22 09:22:13,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 09:22:13,338 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 66 transitions. [2020-06-22 09:22:13,339 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 09:22:13,339 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 66 transitions. [2020-06-22 09:22:13,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-06-22 09:22:13,339 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 09:22:13,339 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-06-22 09:22:13,340 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION]=== [2020-06-22 09:22:13,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:22:13,340 INFO L82 PathProgramCache]: Analyzing trace with hash 124424, now seen corresponding path program 1 times [2020-06-22 09:22:13,340 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:22:13,340 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:22:13,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:22:13,342 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:22:13,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:22:13,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:22:13,393 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:22:13,394 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 09:22:13,394 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 09:22:13,396 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 09:22:13,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 09:22:13,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 09:22:13,396 INFO L87 Difference]: Start difference. First operand 39 states and 66 transitions. Second operand 3 states. [2020-06-22 09:22:13,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:22:13,507 INFO L93 Difference]: Finished difference Result 39 states and 66 transitions. [2020-06-22 09:22:13,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 09:22:13,508 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-06-22 09:22:13,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 09:22:13,509 INFO L225 Difference]: With dead ends: 39 [2020-06-22 09:22:13,509 INFO L226 Difference]: Without dead ends: 35 [2020-06-22 09:22:13,510 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:22:13,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2020-06-22 09:22:13,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2020-06-22 09:22:13,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2020-06-22 09:22:13,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 62 transitions. [2020-06-22 09:22:13,515 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 62 transitions. Word has length 3 [2020-06-22 09:22:13,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 09:22:13,516 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 62 transitions. [2020-06-22 09:22:13,516 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 09:22:13,516 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 62 transitions. [2020-06-22 09:22:13,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-06-22 09:22:13,516 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 09:22:13,517 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-06-22 09:22:13,517 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION]=== [2020-06-22 09:22:13,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:22:13,517 INFO L82 PathProgramCache]: Analyzing trace with hash 124421, now seen corresponding path program 1 times [2020-06-22 09:22:13,517 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:22:13,518 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:22:13,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:22:13,519 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:22:13,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:22:13,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:22:13,550 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:22:13,551 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 09:22:13,551 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 09:22:13,551 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 09:22:13,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 09:22:13,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 09:22:13,552 INFO L87 Difference]: Start difference. First operand 35 states and 62 transitions. Second operand 3 states. [2020-06-22 09:22:13,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:22:13,664 INFO L93 Difference]: Finished difference Result 35 states and 62 transitions. [2020-06-22 09:22:13,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 09:22:13,665 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-06-22 09:22:13,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 09:22:13,666 INFO L225 Difference]: With dead ends: 35 [2020-06-22 09:22:13,666 INFO L226 Difference]: Without dead ends: 31 [2020-06-22 09:22:13,666 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:22:13,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2020-06-22 09:22:13,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2020-06-22 09:22:13,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-06-22 09:22:13,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 54 transitions. [2020-06-22 09:22:13,671 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 54 transitions. Word has length 3 [2020-06-22 09:22:13,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 09:22:13,671 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 54 transitions. [2020-06-22 09:22:13,671 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 09:22:13,671 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 54 transitions. [2020-06-22 09:22:13,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-06-22 09:22:13,672 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 09:22:13,672 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-06-22 09:22:13,672 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION]=== [2020-06-22 09:22:13,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:22:13,672 INFO L82 PathProgramCache]: Analyzing trace with hash 3855027, now seen corresponding path program 1 times [2020-06-22 09:22:13,673 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:22:13,673 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:22:13,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:22:13,674 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:22:13,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:22:13,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:22:13,710 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:22:13,710 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 09:22:13,710 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 09:22:13,711 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 09:22:13,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 09:22:13,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 09:22:13,711 INFO L87 Difference]: Start difference. First operand 31 states and 54 transitions. Second operand 3 states. [2020-06-22 09:22:13,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:22:13,827 INFO L93 Difference]: Finished difference Result 31 states and 54 transitions. [2020-06-22 09:22:13,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 09:22:13,828 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-06-22 09:22:13,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 09:22:13,828 INFO L225 Difference]: With dead ends: 31 [2020-06-22 09:22:13,828 INFO L226 Difference]: Without dead ends: 27 [2020-06-22 09:22:13,829 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:22:13,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2020-06-22 09:22:13,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2020-06-22 09:22:13,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-06-22 09:22:13,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 46 transitions. [2020-06-22 09:22:13,833 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 46 transitions. Word has length 4 [2020-06-22 09:22:13,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 09:22:13,833 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 46 transitions. [2020-06-22 09:22:13,833 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 09:22:13,833 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 46 transitions. [2020-06-22 09:22:13,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-06-22 09:22:13,834 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 09:22:13,834 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-06-22 09:22:13,834 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION]=== [2020-06-22 09:22:13,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:22:13,834 INFO L82 PathProgramCache]: Analyzing trace with hash 3855029, now seen corresponding path program 1 times [2020-06-22 09:22:13,835 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:22:13,835 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:22:13,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:22:13,836 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:22:13,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:22:13,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:22:13,873 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:22:13,873 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 09:22:13,873 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 09:22:13,874 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 09:22:13,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 09:22:13,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 09:22:13,874 INFO L87 Difference]: Start difference. First operand 27 states and 46 transitions. Second operand 3 states. [2020-06-22 09:22:13,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:22:13,966 INFO L93 Difference]: Finished difference Result 31 states and 46 transitions. [2020-06-22 09:22:13,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 09:22:13,967 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-06-22 09:22:13,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 09:22:13,967 INFO L225 Difference]: With dead ends: 31 [2020-06-22 09:22:13,968 INFO L226 Difference]: Without dead ends: 27 [2020-06-22 09:22:13,968 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:22:13,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2020-06-22 09:22:13,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2020-06-22 09:22:13,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-06-22 09:22:13,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 42 transitions. [2020-06-22 09:22:13,972 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 42 transitions. Word has length 4 [2020-06-22 09:22:13,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 09:22:13,972 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 42 transitions. [2020-06-22 09:22:13,972 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 09:22:13,972 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 42 transitions. [2020-06-22 09:22:13,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-06-22 09:22:13,973 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 09:22:13,973 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-06-22 09:22:13,973 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION]=== [2020-06-22 09:22:13,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:22:13,973 INFO L82 PathProgramCache]: Analyzing trace with hash 3855030, now seen corresponding path program 1 times [2020-06-22 09:22:13,973 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:22:13,974 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:22:13,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:22:13,975 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:22:13,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:22:13,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:22:14,013 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:22:14,014 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 09:22:14,014 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 09:22:14,014 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 09:22:14,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 09:22:14,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 09:22:14,015 INFO L87 Difference]: Start difference. First operand 27 states and 42 transitions. Second operand 3 states. [2020-06-22 09:22:14,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:22:14,084 INFO L93 Difference]: Finished difference Result 27 states and 42 transitions. [2020-06-22 09:22:14,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 09:22:14,084 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-06-22 09:22:14,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 09:22:14,085 INFO L225 Difference]: With dead ends: 27 [2020-06-22 09:22:14,085 INFO L226 Difference]: Without dead ends: 23 [2020-06-22 09:22:14,085 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:22:14,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2020-06-22 09:22:14,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2020-06-22 09:22:14,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-06-22 09:22:14,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 38 transitions. [2020-06-22 09:22:14,088 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 38 transitions. Word has length 4 [2020-06-22 09:22:14,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 09:22:14,089 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 38 transitions. [2020-06-22 09:22:14,089 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 09:22:14,089 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 38 transitions. [2020-06-22 09:22:14,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-06-22 09:22:14,089 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 09:22:14,090 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-06-22 09:22:14,090 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION]=== [2020-06-22 09:22:14,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:22:14,090 INFO L82 PathProgramCache]: Analyzing trace with hash 119504158, now seen corresponding path program 1 times [2020-06-22 09:22:14,090 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:22:14,090 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:22:14,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:22:14,091 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:22:14,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:22:14,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:22:14,118 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:22:14,118 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 09:22:14,118 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 09:22:14,118 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 09:22:14,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 09:22:14,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 09:22:14,119 INFO L87 Difference]: Start difference. First operand 23 states and 38 transitions. Second operand 3 states. [2020-06-22 09:22:14,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:22:14,186 INFO L93 Difference]: Finished difference Result 23 states and 38 transitions. [2020-06-22 09:22:14,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 09:22:14,187 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-06-22 09:22:14,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 09:22:14,187 INFO L225 Difference]: With dead ends: 23 [2020-06-22 09:22:14,187 INFO L226 Difference]: Without dead ends: 19 [2020-06-22 09:22:14,188 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:22:14,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2020-06-22 09:22:14,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2020-06-22 09:22:14,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2020-06-22 09:22:14,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 30 transitions. [2020-06-22 09:22:14,191 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 30 transitions. Word has length 5 [2020-06-22 09:22:14,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 09:22:14,191 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 30 transitions. [2020-06-22 09:22:14,191 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 09:22:14,191 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 30 transitions. [2020-06-22 09:22:14,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-06-22 09:22:14,192 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 09:22:14,192 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-06-22 09:22:14,192 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION]=== [2020-06-22 09:22:14,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:22:14,192 INFO L82 PathProgramCache]: Analyzing trace with hash 119504160, now seen corresponding path program 1 times [2020-06-22 09:22:14,192 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:22:14,193 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:22:14,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:22:14,194 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:22:14,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:22:14,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:22:14,218 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:22:14,218 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 09:22:14,233 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 09:22:14,234 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 09:22:14,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 09:22:14,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 09:22:14,234 INFO L87 Difference]: Start difference. First operand 19 states and 30 transitions. Second operand 3 states. [2020-06-22 09:22:14,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:22:14,273 INFO L93 Difference]: Finished difference Result 23 states and 30 transitions. [2020-06-22 09:22:14,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 09:22:14,273 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-06-22 09:22:14,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 09:22:14,274 INFO L225 Difference]: With dead ends: 23 [2020-06-22 09:22:14,274 INFO L226 Difference]: Without dead ends: 19 [2020-06-22 09:22:14,274 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:22:14,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2020-06-22 09:22:14,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2020-06-22 09:22:14,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2020-06-22 09:22:14,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 26 transitions. [2020-06-22 09:22:14,277 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 26 transitions. Word has length 5 [2020-06-22 09:22:14,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 09:22:14,277 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 26 transitions. [2020-06-22 09:22:14,278 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 09:22:14,278 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 26 transitions. [2020-06-22 09:22:14,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-06-22 09:22:14,278 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 09:22:14,278 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-06-22 09:22:14,278 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION]=== [2020-06-22 09:22:14,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:22:14,279 INFO L82 PathProgramCache]: Analyzing trace with hash 119504161, now seen corresponding path program 1 times [2020-06-22 09:22:14,279 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:22:14,279 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:22:14,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:22:14,280 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:22:14,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:22:14,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:22:14,308 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:22:14,308 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 09:22:14,308 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 09:22:14,309 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 09:22:14,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 09:22:14,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 09:22:14,310 INFO L87 Difference]: Start difference. First operand 19 states and 26 transitions. Second operand 3 states. [2020-06-22 09:22:14,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:22:14,357 INFO L93 Difference]: Finished difference Result 19 states and 26 transitions. [2020-06-22 09:22:14,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 09:22:14,358 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-06-22 09:22:14,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 09:22:14,358 INFO L225 Difference]: With dead ends: 19 [2020-06-22 09:22:14,358 INFO L226 Difference]: Without dead ends: 0 [2020-06-22 09:22:14,359 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:22:14,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-06-22 09:22:14,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-06-22 09:22:14,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-06-22 09:22:14,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-06-22 09:22:14,360 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 5 [2020-06-22 09:22:14,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 09:22:14,360 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 09:22:14,360 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 09:22:14,360 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-06-22 09:22:14,360 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-06-22 09:22:14,365 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-06-22 09:22:14,394 INFO L448 ceAbstractionStarter]: For program point L15(line 15) no Hoare annotation was computed. [2020-06-22 09:22:14,394 INFO L448 ceAbstractionStarter]: For program point L15-1(line 15) no Hoare annotation was computed. [2020-06-22 09:22:14,394 INFO L448 ceAbstractionStarter]: For program point L13(line 13) no Hoare annotation was computed. [2020-06-22 09:22:14,394 INFO L448 ceAbstractionStarter]: For program point L13-1(lines 13 17) no Hoare annotation was computed. [2020-06-22 09:22:14,394 INFO L448 ceAbstractionStarter]: For program point L11(line 11) no Hoare annotation was computed. [2020-06-22 09:22:14,395 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)) (= (select |#length| ULTIMATE.start_test_fun_~y_ref~0.base) 4) (= ULTIMATE.start_test_fun_~x_ref~0.offset 0) (= 1 (select |#valid| ULTIMATE.start_test_fun_~tmp_ref~0.base)) (= (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_~tmp_ref~0.base)) (= ULTIMATE.start_test_fun_~tmp_ref~0.offset 0)) [2020-06-22 09:22:14,395 INFO L448 ceAbstractionStarter]: For program point L13-4(lines 13 17) no Hoare annotation was computed. [2020-06-22 09:22:14,395 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr10REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. [2020-06-22 09:22:14,395 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr11REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. [2020-06-22 09:22:14,395 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr12REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. [2020-06-22 09:22:14,395 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr13REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. [2020-06-22 09:22:14,396 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr14REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-06-22 09:22:14,396 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr15REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-06-22 09:22:14,396 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr16REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-06-22 09:22:14,396 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr17REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-06-22 09:22:14,396 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2020-06-22 09:22:14,396 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr18REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. [2020-06-22 09:22:14,396 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr19REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. [2020-06-22 09:22:14,396 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-06-22 09:22:14,396 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr20REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. [2020-06-22 09:22:14,397 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr21REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. [2020-06-22 09:22:14,397 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr22REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. [2020-06-22 09:22:14,397 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr9REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. [2020-06-22 09:22:14,397 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr23REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. [2020-06-22 09:22:14,397 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr8REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. [2020-06-22 09:22:14,397 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr7REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. [2020-06-22 09:22:14,397 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr6REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. [2020-06-22 09:22:14,397 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr5REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. [2020-06-22 09:22:14,397 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr4REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. [2020-06-22 09:22:14,398 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr3REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. [2020-06-22 09:22:14,398 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. [2020-06-22 09:22:14,398 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1REQUIRES_VIOLATION(line 10) no Hoare annotation was computed. [2020-06-22 09:22:14,398 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0REQUIRES_VIOLATION(line 10) no Hoare annotation was computed. [2020-06-22 09:22:14,398 INFO L448 ceAbstractionStarter]: For program point L16(line 16) no Hoare annotation was computed. [2020-06-22 09:22:14,398 INFO L448 ceAbstractionStarter]: For program point L16-1(line 16) no Hoare annotation was computed. [2020-06-22 09:22:14,398 INFO L448 ceAbstractionStarter]: For program point L14(line 14) no Hoare annotation was computed. [2020-06-22 09:22:14,398 INFO L448 ceAbstractionStarter]: For program point L14-1(line 14) no Hoare annotation was computed. [2020-06-22 09:22:14,398 INFO L448 ceAbstractionStarter]: For program point L10(line 10) no Hoare annotation was computed. [2020-06-22 09:22:14,398 INFO L448 ceAbstractionStarter]: For program point L10-1(line 10) no Hoare annotation was computed. [2020-06-22 09:22:14,399 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2020-06-22 09:22:14,407 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:22:14,409 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:22:14,409 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:22:14,415 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:22:14,415 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:22:14,416 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:22:14,418 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 09:22:14 BasicIcfg [2020-06-22 09:22:14,418 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-06-22 09:22:14,419 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-06-22 09:22:14,419 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-06-22 09:22:14,422 INFO L276 PluginConnector]: BuchiAutomizer initialized [2020-06-22 09:22:14,422 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 09:22:14,423 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.06 09:22:11" (1/5) ... [2020-06-22 09:22:14,423 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@64821aa9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.06 09:22:14, skipping insertion in model container [2020-06-22 09:22:14,423 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 09:22:14,423 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:22:12" (2/5) ... [2020-06-22 09:22:14,424 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@64821aa9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.06 09:22:14, skipping insertion in model container [2020-06-22 09:22:14,424 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 09:22:14,424 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 09:22:12" (3/5) ... [2020-06-22 09:22:14,424 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@64821aa9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 09:22:14, skipping insertion in model container [2020-06-22 09:22:14,424 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 09:22:14,424 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 09:22:12" (4/5) ... [2020-06-22 09:22:14,425 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@64821aa9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 09:22:14, skipping insertion in model container [2020-06-22 09:22:14,425 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 09:22:14,425 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 09:22:14" (5/5) ... [2020-06-22 09:22:14,426 INFO L375 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-06-22 09:22:14,446 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2020-06-22 09:22:14,446 INFO L374 BuchiCegarLoop]: Interprodecural is true [2020-06-22 09:22:14,446 INFO L375 BuchiCegarLoop]: Hoare is true [2020-06-22 09:22:14,446 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-06-22 09:22:14,446 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-06-22 09:22:14,446 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-06-22 09:22:14,447 INFO L379 BuchiCegarLoop]: Difference is false [2020-06-22 09:22:14,447 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-06-22 09:22:14,447 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-06-22 09:22:14,450 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states. [2020-06-22 09:22:14,456 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2020-06-22 09:22:14,456 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 09:22:14,456 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 09:22:14,461 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-06-22 09:22:14,461 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 09:22:14,461 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2020-06-22 09:22:14,461 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states. [2020-06-22 09:22:14,463 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2020-06-22 09:22:14,463 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 09:22:14,463 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 09:22:14,464 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-06-22 09:22:14,464 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 09:22:14,469 INFO L794 eck$LassoCheckResult]: Stem: 30#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] 11#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~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_~tmp_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|) (> |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|) (= |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_~x_ref~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc0.offset_1|) (= v_ULTIMATE.start_test_fun_~tmp_ref~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc2.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|) (= |v_ULTIMATE.start_test_fun_#in~y_1| |v_ULTIMATE.start_main_#t~nondet10_1|) (< |v_ULTIMATE.start_test_fun_#t~malloc0.base_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_~y_1 |v_ULTIMATE.start_test_fun_#in~y_1|) (< |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (> 0 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|) (= 0 (select .cse1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|)) (= |v_ULTIMATE.start_test_fun_#in~tmp_1| |v_ULTIMATE.start_main_#t~nondet11_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_~tmp_1 |v_ULTIMATE.start_test_fun_#in~tmp_1|) (= |v_ULTIMATE.start_test_fun_#t~malloc2.offset_1| 0) (< |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|)))) 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_~tmp_ref~0.base=v_ULTIMATE.start_test_fun_~tmp_ref~0.base_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_test_fun_~tmp_ref~0.offset=v_ULTIMATE.start_test_fun_~tmp_ref~0.offset_1, ULTIMATE.start_main_#t~nondet11=|v_ULTIMATE.start_main_#t~nondet11_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_~tmp=v_ULTIMATE.start_test_fun_~tmp_1, ULTIMATE.start_test_fun_#in~tmp=|v_ULTIMATE.start_test_fun_#in~tmp_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_main_#t~ret12=|v_ULTIMATE.start_main_#t~ret12_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_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_1} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_~y, ULTIMATE.start_test_fun_~tmp_ref~0.base, ULTIMATE.start_test_fun_~x, ULTIMATE.start_main_#t~nondet10, ULTIMATE.start_test_fun_~tmp_ref~0.offset, ULTIMATE.start_main_#t~nondet11, 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_~tmp, ULTIMATE.start_test_fun_#in~tmp, 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_main_#t~ret12, ULTIMATE.start_test_fun_#t~malloc0.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_test_fun_~y_ref~0.offset] 13#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] 27#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] 31#L11true [95] L11-->L13-3: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~tmp_ref~0.offset_3 4) (select |v_#length_9| v_ULTIMATE.start_test_fun_~tmp_ref~0.base_3)) (= |v_#memory_int_5| (store |v_#memory_int_6| v_ULTIMATE.start_test_fun_~tmp_ref~0.base_3 (store (select |v_#memory_int_6| v_ULTIMATE.start_test_fun_~tmp_ref~0.base_3) v_ULTIMATE.start_test_fun_~tmp_ref~0.offset_3 v_ULTIMATE.start_test_fun_~tmp_3))) (<= 0 v_ULTIMATE.start_test_fun_~tmp_ref~0.offset_3) (= (select |v_#valid_11| v_ULTIMATE.start_test_fun_~tmp_ref~0.base_3) 1)) InVars {ULTIMATE.start_test_fun_~tmp_ref~0.base=v_ULTIMATE.start_test_fun_~tmp_ref~0.base_3, ULTIMATE.start_test_fun_~tmp=v_ULTIMATE.start_test_fun_~tmp_3, ULTIMATE.start_test_fun_~tmp_ref~0.offset=v_ULTIMATE.start_test_fun_~tmp_ref~0.offset_3, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_6|, #length=|v_#length_9|} OutVars{ULTIMATE.start_test_fun_~tmp_ref~0.base=v_ULTIMATE.start_test_fun_~tmp_ref~0.base_3, ULTIMATE.start_test_fun_~tmp=v_ULTIMATE.start_test_fun_~tmp_3, ULTIMATE.start_test_fun_~tmp_ref~0.offset=v_ULTIMATE.start_test_fun_~tmp_ref~0.offset_3, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_5|, #length=|v_#length_9|} AuxVars[] AssignedVars[#memory_int] 28#L13-3true [2020-06-22 09:22:14,470 INFO L796 eck$LassoCheckResult]: Loop: 28#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] 37#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] 34#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] 19#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] 17#L14-1true [191] L14-1-->L15: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~tmp_ref~0.offset_12) (= (store |v_#memory_int_21| v_ULTIMATE.start_test_fun_~tmp_ref~0.base_16 (store (select |v_#memory_int_21| v_ULTIMATE.start_test_fun_~tmp_ref~0.base_16) v_ULTIMATE.start_test_fun_~tmp_ref~0.offset_12 |v_ULTIMATE.start_test_fun_#t~mem5_6|)) |v_#memory_int_20|) (= 1 (select |v_#valid_37| v_ULTIMATE.start_test_fun_~tmp_ref~0.base_16)) (<= (+ v_ULTIMATE.start_test_fun_~tmp_ref~0.offset_12 4) (select |v_#length_30| v_ULTIMATE.start_test_fun_~tmp_ref~0.base_16))) InVars {ULTIMATE.start_test_fun_~tmp_ref~0.base=v_ULTIMATE.start_test_fun_~tmp_ref~0.base_16, ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_6|, ULTIMATE.start_test_fun_~tmp_ref~0.offset=v_ULTIMATE.start_test_fun_~tmp_ref~0.offset_12, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_21|, #length=|v_#length_30|} OutVars{ULTIMATE.start_test_fun_~tmp_ref~0.base=v_ULTIMATE.start_test_fun_~tmp_ref~0.base_16, ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_5|, ULTIMATE.start_test_fun_~tmp_ref~0.offset=v_ULTIMATE.start_test_fun_~tmp_ref~0.offset_12, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_20|, #length=|v_#length_30|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem5, #memory_int] 22#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] 40#L15-1true [195] L15-1-->L16: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_11) (= (select |v_#valid_44| v_ULTIMATE.start_test_fun_~x_ref~0.base_15) 1) (= (store |v_#memory_int_26| v_ULTIMATE.start_test_fun_~x_ref~0.base_15 (store (select |v_#memory_int_26| 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~mem6_6|)) |v_#memory_int_25|) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_11 4) (select |v_#length_34| v_ULTIMATE.start_test_fun_~x_ref~0.base_15))) InVars {#valid=|v_#valid_44|, #memory_int=|v_#memory_int_26|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_11, #length=|v_#length_34|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_15, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_6|} OutVars{#valid=|v_#valid_44|, #memory_int=|v_#memory_int_25|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_11, #length=|v_#length_34|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_15, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_5|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_test_fun_#t~mem6] 5#L16true [63] L16-->L16-1: Formula: (and (= 1 (select |v_#valid_25| v_ULTIMATE.start_test_fun_~tmp_ref~0.base_9)) (= |v_ULTIMATE.start_test_fun_#t~mem7_2| (select (select |v_#memory_int_15| v_ULTIMATE.start_test_fun_~tmp_ref~0.base_9) v_ULTIMATE.start_test_fun_~tmp_ref~0.offset_7)) (<= 0 v_ULTIMATE.start_test_fun_~tmp_ref~0.offset_7) (<= (+ v_ULTIMATE.start_test_fun_~tmp_ref~0.offset_7 4) (select |v_#length_23| v_ULTIMATE.start_test_fun_~tmp_ref~0.base_9))) InVars {ULTIMATE.start_test_fun_~tmp_ref~0.base=v_ULTIMATE.start_test_fun_~tmp_ref~0.base_9, #memory_int=|v_#memory_int_15|, #length=|v_#length_23|, ULTIMATE.start_test_fun_~tmp_ref~0.offset=v_ULTIMATE.start_test_fun_~tmp_ref~0.offset_7, #valid=|v_#valid_25|} OutVars{ULTIMATE.start_test_fun_~tmp_ref~0.base=v_ULTIMATE.start_test_fun_~tmp_ref~0.base_9, ULTIMATE.start_test_fun_~tmp_ref~0.offset=v_ULTIMATE.start_test_fun_~tmp_ref~0.offset_7, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_15|, #length=|v_#length_23|, 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 (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_11) (= 1 (select |v_#valid_45| v_ULTIMATE.start_test_fun_~y_ref~0.base_15)) (= (store |v_#memory_int_28| v_ULTIMATE.start_test_fun_~y_ref~0.base_15 (store (select |v_#memory_int_28| 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~mem7_6|)) |v_#memory_int_27|) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_11 4) (select |v_#length_35| v_ULTIMATE.start_test_fun_~y_ref~0.base_15))) InVars {#valid=|v_#valid_45|, #memory_int=|v_#memory_int_28|, #length=|v_#length_35|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_15, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_11, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_6|} OutVars{#valid=|v_#valid_45|, #memory_int=|v_#memory_int_27|, #length=|v_#length_35|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_15, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_11, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_5|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_test_fun_#t~mem7] 28#L13-3true [2020-06-22 09:22:14,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:22:14,471 INFO L82 PathProgramCache]: Analyzing trace with hash 119712640, now seen corresponding path program 1 times [2020-06-22 09:22:14,472 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:22:14,472 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:22:14,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:22:14,473 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:22:14,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:22:14,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:22:14,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:22:14,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:22:14,516 INFO L82 PathProgramCache]: Analyzing trace with hash -510456228, now seen corresponding path program 1 times [2020-06-22 09:22:14,516 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:22:14,516 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:22:14,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:22:14,517 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:22:14,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:22:14,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:22:14,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:22:14,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:22:14,540 INFO L82 PathProgramCache]: Analyzing trace with hash -5250627, now seen corresponding path program 1 times [2020-06-22 09:22:14,541 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:22:14,541 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:22:14,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:22:14,542 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:22:14,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:22:14,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:22:14,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:22:15,112 WARN L188 SmtUtils]: Spent 394.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 95 [2020-06-22 09:22:15,294 WARN L188 SmtUtils]: Spent 179.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2020-06-22 09:22:15,308 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 09:22:15,309 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 09:22:15,310 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 09:22:15,310 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 09:22:15,310 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 09:22:15,310 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 09:22:15,310 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 09:22:15,310 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 09:22:15,310 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Lasso [2020-06-22 09:22:15,311 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 09:22:15,311 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 09:22:15,332 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:22:15,338 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:22:15,343 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:22:15,347 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:22:15,349 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:22:15,351 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:22:15,353 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:22:15,355 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:22:15,358 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:22:15,360 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:22:15,362 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:22:15,710 WARN L188 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 75 [2020-06-22 09:22:15,820 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:22:15,822 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:22:15,824 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:22:16,273 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 09:22:16,279 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 09:22:16,281 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:22:16,282 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:22:16,283 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:22:16,283 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:22:16,283 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:22:16,284 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:22:16,286 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 09:22:16,286 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:22:16,287 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:22:16,288 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:22:16,288 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:22:16,289 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:22:16,289 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:22:16,289 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:22:16,291 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 09:22:16,291 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 09:22:16,294 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:22:16,294 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:22:16,295 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:22:16,295 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:22:16,295 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:22:16,295 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:22:16,297 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 09:22:16,297 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 09:22:16,300 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:22:16,300 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:22:16,301 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:22:16,301 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:22:16,301 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:22:16,301 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:22:16,301 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:22:16,302 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 09:22:16,302 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:22:16,303 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:22:16,303 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:22:16,303 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:22:16,303 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:22:16,304 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:22:16,304 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:22:16,306 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 09:22:16,307 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 09:22:16,309 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:22:16,309 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:22:16,310 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:22:16,310 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:22:16,310 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:22:16,310 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:22:16,312 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 09:22:16,312 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 09:22:16,314 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:22:16,314 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:22:16,315 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:22:16,315 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:22:16,315 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:22:16,315 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:22:16,315 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:22:16,316 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 09:22:16,316 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:22:16,316 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:22:16,317 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:22:16,317 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:22:16,317 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:22:16,317 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:22:16,317 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:22:16,318 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:22:16,318 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 09:22:16,318 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:22:16,319 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:22:16,319 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:22:16,319 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:22:16,320 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:22:16,320 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:22:16,320 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:22:16,320 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:22:16,320 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 09:22:16,321 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:22:16,321 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:22:16,322 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:22:16,322 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:22:16,322 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:22:16,322 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:22:16,322 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:22:16,322 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:22:16,323 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 09:22:16,323 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:22:16,324 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:22:16,324 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:22:16,324 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:22:16,324 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:22:16,325 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:22:16,325 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:22:16,327 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 09:22:16,327 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 09:22:16,337 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:22:16,338 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:22:16,338 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:22:16,339 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:22:16,339 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:22:16,339 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:22:16,341 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 09:22:16,341 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 09:22:16,348 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:22:16,349 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:22:16,349 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:22:16,349 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:22:16,350 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:22:16,350 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:22:16,351 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 09:22:16,351 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 09:22:16,353 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:22:16,354 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:22:16,354 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:22:16,355 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:22:16,355 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:22:16,355 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:22:16,359 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 09:22:16,359 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 09:22:16,383 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:22:16,384 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:22:16,384 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:22:16,385 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:22:16,385 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:22:16,385 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:22:16,388 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 09:22:16,388 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 09:22:16,394 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:22:16,395 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:22:16,395 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:22:16,395 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:22:16,395 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:22:16,395 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:22:16,397 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 09:22:16,397 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 09:22:16,403 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:22:16,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:22:16,404 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:22:16,404 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:22:16,404 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:22:16,404 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:22:16,405 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 09:22:16,405 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 09:22:16,410 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:22:16,411 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:22:16,411 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:22:16,412 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:22:16,412 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:22:16,412 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:22:16,414 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 09:22:16,415 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 09:22:16,434 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 09:22:16,449 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-06-22 09:22:16,449 INFO L444 ModelExtractionUtils]: 37 out of 40 variables were initially zero. Simplification set additionally 0 variables to zero. [2020-06-22 09:22:16,452 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 09:22:16,453 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-06-22 09:22:16,453 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 09:22:16,454 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_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 + 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_1 Supporting invariants [] [2020-06-22 09:22:16,543 INFO L297 tatePredicateManager]: 24 out of 24 supporting invariants were superfluous and have been removed [2020-06-22 09:22:16,546 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:22:16,546 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:22:16,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:22:16,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:22:16,586 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 2 conjunts are in the unsatisfiable core [2020-06-22 09:22:16,587 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 09:22:16,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:22:16,610 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 14 conjunts are in the unsatisfiable core [2020-06-22 09:22:16,611 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 09:22:16,796 INFO L340 Elim1Store]: treesize reduction 24, result has 68.0 percent of original size [2020-06-22 09:22:16,797 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 68 [2020-06-22 09:22:16,805 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 09:22:16,846 INFO L497 ElimStorePlain]: treesize reduction 20, result has 74.4 percent of original size [2020-06-22 09:22:16,847 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 09:22:16,847 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:42, output treesize:58 [2020-06-22 09:22:16,942 INFO L172 IndexEqualityManager]: detected equality via solver [2020-06-22 09:22:16,945 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 09:22:16,945 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 31 [2020-06-22 09:22:16,946 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 09:22:16,991 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 09:22:16,991 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 57 treesize of output 87 [2020-06-22 09:22:16,996 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-06-22 09:22:17,007 INFO L172 IndexEqualityManager]: detected equality via solver [2020-06-22 09:22:17,009 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 31 [2020-06-22 09:22:17,010 INFO L427 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-06-22 09:22:17,057 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 09:22:17,057 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 4 case distinctions, treesize of input 57 treesize of output 87 [2020-06-22 09:22:17,064 INFO L427 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-06-22 09:22:17,205 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 39 [2020-06-22 09:22:17,206 INFO L497 ElimStorePlain]: treesize reduction 76, result has 67.7 percent of original size [2020-06-22 09:22:17,206 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2020-06-22 09:22:17,207 INFO L217 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:195, output treesize:159 [2020-06-22 09:22:17,474 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 36 [2020-06-22 09:22:17,475 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:22:19,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:22:19,167 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 09:22:19,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:22:19,177 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 09:22:19,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:22:19,187 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 09:22:19,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:22:19,198 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 09:22:19,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:22:19,209 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 09:22:19,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:22:19,219 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 09:22:19,231 INFO L98 LoopCannibalizer]: 47 predicates before loop cannibalization 47 predicates after loop cannibalization [2020-06-22 09:22:19,235 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 47 loop predicates [2020-06-22 09:22:19,236 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 39 states. Second operand 10 states. [2020-06-22 09:22:22,208 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 39 states.. Second operand 10 states. Result 121 states and 207 transitions. Complement of second has 35 states. [2020-06-22 09:22:22,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 19 states 1 stem states 16 non-accepting loop states 2 accepting loop states [2020-06-22 09:22:22,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-06-22 09:22:22,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 163 transitions. [2020-06-22 09:22:22,211 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 163 transitions. Stem has 5 letters. Loop has 9 letters. [2020-06-22 09:22:22,212 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 09:22:22,213 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-06-22 09:22:22,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:22:22,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:22:22,237 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 2 conjunts are in the unsatisfiable core [2020-06-22 09:22:22,238 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 09:22:22,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:22:22,250 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 14 conjunts are in the unsatisfiable core [2020-06-22 09:22:22,251 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 09:22:22,395 INFO L340 Elim1Store]: treesize reduction 24, result has 68.0 percent of original size [2020-06-22 09:22:22,396 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 68 [2020-06-22 09:22:22,401 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 09:22:22,443 INFO L497 ElimStorePlain]: treesize reduction 20, result has 74.4 percent of original size [2020-06-22 09:22:22,443 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 09:22:22,444 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:42, output treesize:58 [2020-06-22 09:22:22,547 INFO L172 IndexEqualityManager]: detected equality via solver [2020-06-22 09:22:22,549 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 31 [2020-06-22 09:22:22,550 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 09:22:22,558 INFO L172 IndexEqualityManager]: detected equality via solver [2020-06-22 09:22:22,560 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 09:22:22,560 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 31 [2020-06-22 09:22:22,561 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-06-22 09:22:22,600 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 09:22:22,601 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 57 treesize of output 87 [2020-06-22 09:22:22,605 INFO L427 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-06-22 09:22:22,638 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 09:22:22,638 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 4 case distinctions, treesize of input 57 treesize of output 87 [2020-06-22 09:22:22,642 INFO L427 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-06-22 09:22:22,752 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 38 [2020-06-22 09:22:22,753 INFO L497 ElimStorePlain]: treesize reduction 56, result has 74.0 percent of original size [2020-06-22 09:22:22,753 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2020-06-22 09:22:22,753 INFO L217 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:195, output treesize:159 [2020-06-22 09:22:22,936 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:22:22,936 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and with honda bouncer for loop.1 stem predicates 9 loop predicates [2020-06-22 09:22:22,936 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 39 states. Second operand 10 states. [2020-06-22 09:22:23,541 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 46 [2020-06-22 09:22:23,576 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 39 states.. Second operand 10 states. Result 67 states and 125 transitions. Complement of second has 20 states. [2020-06-22 09:22:23,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 11 states 1 stem states 9 non-accepting loop states 1 accepting loop states [2020-06-22 09:22:23,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-06-22 09:22:23,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 117 transitions. [2020-06-22 09:22:23,577 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 117 transitions. Stem has 5 letters. Loop has 9 letters. [2020-06-22 09:22:23,578 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 09:22:23,578 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 117 transitions. Stem has 14 letters. Loop has 9 letters. [2020-06-22 09:22:23,579 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 09:22:23,579 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 117 transitions. Stem has 5 letters. Loop has 18 letters. [2020-06-22 09:22:23,580 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 09:22:23,591 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 67 states and 125 transitions. [2020-06-22 09:22:23,594 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-06-22 09:22:23,595 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 67 states to 0 states and 0 transitions. [2020-06-22 09:22:23,596 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-06-22 09:22:23,596 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-06-22 09:22:23,596 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-06-22 09:22:23,597 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 09:22:23,597 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 09:22:23,597 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 09:22:23,597 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 09:22:23,597 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2020-06-22 09:22:23,597 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-06-22 09:22:23,597 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-06-22 09:22:23,597 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-06-22 09:22:23,603 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 09:22:23 BasicIcfg [2020-06-22 09:22:23,603 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-06-22 09:22:23,604 INFO L168 Benchmark]: Toolchain (without parser) took 11633.45 ms. Allocated memory was 514.9 MB in the beginning and 723.5 MB in the end (delta: 208.7 MB). Free memory was 439.5 MB in the beginning and 619.1 MB in the end (delta: -179.6 MB). Peak memory consumption was 29.1 MB. Max. memory is 50.3 GB. [2020-06-22 09:22:23,605 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 514.9 MB. Free memory is still 459.6 MB. There was no memory consumed. Max. memory is 50.3 GB. [2020-06-22 09:22:23,605 INFO L168 Benchmark]: CACSL2BoogieTranslator took 307.98 ms. Allocated memory was 514.9 MB in the beginning and 553.6 MB in the end (delta: 38.8 MB). Free memory was 438.9 MB in the beginning and 522.7 MB in the end (delta: -83.7 MB). Peak memory consumption was 29.6 MB. Max. memory is 50.3 GB. [2020-06-22 09:22:23,606 INFO L168 Benchmark]: Boogie Procedure Inliner took 39.75 ms. Allocated memory is still 553.6 MB. Free memory was 522.7 MB in the beginning and 520.5 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:22:23,606 INFO L168 Benchmark]: Boogie Preprocessor took 23.38 ms. Allocated memory is still 553.6 MB. Free memory was 520.5 MB in the beginning and 519.4 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:22:23,606 INFO L168 Benchmark]: RCFGBuilder took 343.51 ms. Allocated memory is still 553.6 MB. Free memory was 518.9 MB in the beginning and 496.8 MB in the end (delta: 22.1 MB). Peak memory consumption was 22.1 MB. Max. memory is 50.3 GB. [2020-06-22 09:22:23,607 INFO L168 Benchmark]: BlockEncodingV2 took 142.45 ms. Allocated memory is still 553.6 MB. Free memory was 496.8 MB in the beginning and 485.4 MB in the end (delta: 11.4 MB). Peak memory consumption was 11.4 MB. Max. memory is 50.3 GB. [2020-06-22 09:22:23,608 INFO L168 Benchmark]: TraceAbstraction took 1586.63 ms. Allocated memory was 553.6 MB in the beginning and 585.1 MB in the end (delta: 31.5 MB). Free memory was 484.8 MB in the beginning and 465.5 MB in the end (delta: 19.4 MB). Peak memory consumption was 50.8 MB. Max. memory is 50.3 GB. [2020-06-22 09:22:23,608 INFO L168 Benchmark]: BuchiAutomizer took 9184.71 ms. Allocated memory was 585.1 MB in the beginning and 723.5 MB in the end (delta: 138.4 MB). Free memory was 465.5 MB in the beginning and 619.1 MB in the end (delta: -153.6 MB). There was no memory consumed. Max. memory is 50.3 GB. [2020-06-22 09:22:23,612 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 514.9 MB. Free memory is still 459.6 MB. There was no memory consumed. Max. memory is 50.3 GB. * CACSL2BoogieTranslator took 307.98 ms. Allocated memory was 514.9 MB in the beginning and 553.6 MB in the end (delta: 38.8 MB). Free memory was 438.9 MB in the beginning and 522.7 MB in the end (delta: -83.7 MB). Peak memory consumption was 29.6 MB. Max. memory is 50.3 GB. * Boogie Procedure Inliner took 39.75 ms. Allocated memory is still 553.6 MB. Free memory was 522.7 MB in the beginning and 520.5 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 50.3 GB. * Boogie Preprocessor took 23.38 ms. Allocated memory is still 553.6 MB. Free memory was 520.5 MB in the beginning and 519.4 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 50.3 GB. * RCFGBuilder took 343.51 ms. Allocated memory is still 553.6 MB. Free memory was 518.9 MB in the beginning and 496.8 MB in the end (delta: 22.1 MB). Peak memory consumption was 22.1 MB. Max. memory is 50.3 GB. * BlockEncodingV2 took 142.45 ms. Allocated memory is still 553.6 MB. Free memory was 496.8 MB in the beginning and 485.4 MB in the end (delta: 11.4 MB). Peak memory consumption was 11.4 MB. Max. memory is 50.3 GB. * TraceAbstraction took 1586.63 ms. Allocated memory was 553.6 MB in the beginning and 585.1 MB in the end (delta: 31.5 MB). Free memory was 484.8 MB in the beginning and 465.5 MB in the end (delta: 19.4 MB). Peak memory consumption was 50.8 MB. Max. memory is 50.3 GB. * BuchiAutomizer took 9184.71 ms. Allocated memory was 585.1 MB in the beginning and 723.5 MB in the end (delta: 138.4 MB). Free memory was 465.5 MB in the beginning and 619.1 MB in the end (delta: -153.6 MB). There was no memory consumed. Max. memory is 50.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #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: 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: 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: 14]: 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: 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: 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: 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: 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: 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: 12]: 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: 15]: 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: 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 - AllSpecificationsHoldResult: All specifications hold 24 specifications checked. All of them hold - InvariantResult [Line: 12]: Loop Invariant [2020-06-22 09:22:23,621 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:22:23,622 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:22:23,622 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:22:23,623 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:22:23,623 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:22:23,623 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: (((((((4 == unknown-#length-unknown[x_ref] && unknown-#length-unknown[y_ref] == 4) && x_ref == 0) && 1 == \valid[tmp_ref]) && \valid[y_ref] == 1) && 1 == \valid[x_ref]) && y_ref == 0) && 4 == unknown-#length-unknown[tmp_ref]) && tmp_ref == 0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 39 locations, 24 error locations. SAFE Result, 1.5s 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.1s 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 -1 * unknown-#memory_int-unknown[y_ref][y_ref] + unknown-#memory_int-unknown[x_ref][x_ref] and consists of 11 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 9.1s and 2 iterations. TraceHistogramMax:1. Analysis of lassos took 2.0s. Construction of modules took 1.8s. Büchi inclusion checks took 5.1s. 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 [0, 1, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 26 SDtfs, 1011 SDslu, 182 SDs, 0 SdLazy, 2744 SolverSat, 99 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.8s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital420 mio100 ax100 hnf100 lsp97 ukn43 mio100 lsp39 div100 bol100 ite100 ukn100 eq179 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:22:08.643 ----------------------------------------------- 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:22:23.849 !MESSAGE The workspace will exit with unsaved changes in this session. Received shutdown request... Ultimate: GTK+ Version Check