YES Ultimate: Cannot open display: This is Ultimate 0.1.24-8dc7c08-m [2020-06-22 03:51:42,038 INFO L170 SettingsManager]: Resetting all preferences to default values... [2020-06-22 03:51:42,040 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2020-06-22 03:51:42,051 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-06-22 03:51:42,052 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-06-22 03:51:42,053 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-06-22 03:51:42,054 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-06-22 03:51:42,055 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2020-06-22 03:51:42,057 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-06-22 03:51:42,058 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-06-22 03:51:42,058 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-06-22 03:51:42,059 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-06-22 03:51:42,059 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-06-22 03:51:42,060 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-06-22 03:51:42,061 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-06-22 03:51:42,062 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-06-22 03:51:42,063 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-06-22 03:51:42,064 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-06-22 03:51:42,066 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2020-06-22 03:51:42,068 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-06-22 03:51:42,069 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-06-22 03:51:42,070 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-06-22 03:51:42,072 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-06-22 03:51:42,072 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-06-22 03:51:42,072 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-06-22 03:51:42,073 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-06-22 03:51:42,073 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-06-22 03:51:42,074 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-06-22 03:51:42,074 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-06-22 03:51:42,075 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-06-22 03:51:42,076 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-06-22 03:51:42,076 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2020-06-22 03:51:42,077 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-06-22 03:51:42,078 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2020-06-22 03:51:42,078 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-06-22 03:51:42,078 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-06-22 03:51:42,079 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2020-06-22 03:51:42,080 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2020-06-22 03:51:42,080 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2020-06-22 03:51:42,081 INFO L98 SettingsManager]: Beginning loading settings from /export/starexec/sandbox/solver/bin/./../termcomp2017.epf [2020-06-22 03:51:42,095 INFO L110 SettingsManager]: Loading preferences was successful [2020-06-22 03:51:42,095 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2020-06-22 03:51:42,096 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-06-22 03:51:42,096 INFO L133 SettingsManager]: * Rewrite not-equals=true [2020-06-22 03:51:42,096 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2020-06-22 03:51:42,097 INFO L133 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE [2020-06-22 03:51:42,097 INFO L133 SettingsManager]: * Use SBE=true [2020-06-22 03:51:42,097 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-06-22 03:51:42,097 INFO L133 SettingsManager]: * Use old map elimination=false [2020-06-22 03:51:42,097 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2020-06-22 03:51:42,097 INFO L133 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION [2020-06-22 03:51:42,098 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2020-06-22 03:51:42,098 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-06-22 03:51:42,098 INFO L133 SettingsManager]: * Construct termination proof for TermComp=true [2020-06-22 03:51:42,098 INFO L133 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 03:51:42,098 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-06-22 03:51:42,098 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-06-22 03:51:42,098 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2020-06-22 03:51:42,099 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2020-06-22 03:51:42,099 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-06-22 03:51:42,099 INFO L133 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE [2020-06-22 03:51:42,099 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-06-22 03:51:42,099 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-06-22 03:51:42,099 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-06-22 03:51:42,100 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-06-22 03:51:42,100 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-06-22 03:51:42,100 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-06-22 03:51:42,100 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2020-06-22 03:51:42,100 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-06-22 03:51:42,125 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-06-22 03:51:42,138 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-06-22 03:51:42,142 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-06-22 03:51:42,143 INFO L271 PluginConnector]: Initializing CDTParser... [2020-06-22 03:51:42,143 INFO L276 PluginConnector]: CDTParser initialized [2020-06-22 03:51:42,144 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox/benchmark/theBenchmark.c [2020-06-22 03:51:42,204 INFO L221 CDTParser]: Created temporary CDT project at /export/starexec/sandbox/tmp/660782df74f44ff99f38aa6728da9414/FLAGd559c7f0d [2020-06-22 03:51:42,549 INFO L307 CDTParser]: Found 1 translation units. [2020-06-22 03:51:42,549 INFO L161 CDTParser]: Scanning /export/starexec/sandbox/benchmark/theBenchmark.c [2020-06-22 03:51:42,550 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. [2020-06-22 03:51:42,557 INFO L355 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox/tmp/660782df74f44ff99f38aa6728da9414/FLAGd559c7f0d [2020-06-22 03:51:42,949 INFO L363 CDTParser]: Successfully deleted /export/starexec/sandbox/tmp/660782df74f44ff99f38aa6728da9414 [2020-06-22 03:51:42,960 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-06-22 03:51:42,962 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. [2020-06-22 03:51:42,963 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-06-22 03:51:42,963 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-06-22 03:51:42,967 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2020-06-22 03:51:42,968 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.06 03:51:42" (1/1) ... [2020-06-22 03:51:42,971 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5274bda and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 03:51:42, skipping insertion in model container [2020-06-22 03:51:42,971 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.06 03:51:42" (1/1) ... [2020-06-22 03:51:42,979 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-06-22 03:51:42,997 INFO L176 MainTranslator]: Built tables and reachable declarations [2020-06-22 03:51:43,165 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-06-22 03:51:43,234 INFO L191 MainTranslator]: Completed pre-run [2020-06-22 03:51:43,253 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-06-22 03:51:43,269 INFO L195 MainTranslator]: Completed translation [2020-06-22 03:51:43,270 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 03:51:43 WrapperNode [2020-06-22 03:51:43,270 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-06-22 03:51:43,271 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-06-22 03:51:43,271 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-06-22 03:51:43,271 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2020-06-22 03:51:43,280 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 03:51:43" (1/1) ... [2020-06-22 03:51:43,289 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 03:51:43" (1/1) ... [2020-06-22 03:51:43,310 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-06-22 03:51:43,311 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-06-22 03:51:43,311 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-06-22 03:51:43,311 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2020-06-22 03:51:43,320 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 03:51:43" (1/1) ... [2020-06-22 03:51:43,320 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 03:51:43" (1/1) ... [2020-06-22 03:51:43,322 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 03:51:43" (1/1) ... [2020-06-22 03:51:43,322 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 03:51:43" (1/1) ... [2020-06-22 03:51:43,328 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 03:51:43" (1/1) ... [2020-06-22 03:51:43,332 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 03:51:43" (1/1) ... [2020-06-22 03:51:43,333 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 03:51:43" (1/1) ... [2020-06-22 03:51:43,335 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-06-22 03:51:43,336 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-06-22 03:51:43,336 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-06-22 03:51:43,336 INFO L276 PluginConnector]: RCFGBuilder initialized [2020-06-22 03:51:43,337 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 03:51:43" (1/1) ... No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-06-22 03:51:43,411 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-06-22 03:51:43,412 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-06-22 03:51:43,412 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-06-22 03:51:43,412 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-06-22 03:51:43,412 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-06-22 03:51:43,648 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-06-22 03:51:43,649 INFO L286 CfgBuilder]: Removed 9 assue(true) statements. [2020-06-22 03:51:43,650 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 03:51:43 BoogieIcfgContainer [2020-06-22 03:51:43,650 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-06-22 03:51:43,651 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- [2020-06-22 03:51:43,651 INFO L271 PluginConnector]: Initializing BlockEncodingV2... [2020-06-22 03:51:43,653 INFO L276 PluginConnector]: BlockEncodingV2 initialized [2020-06-22 03:51:43,653 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 03:51:43" (1/1) ... [2020-06-22 03:51:43,669 INFO L313 BlockEncoder]: Initial Icfg 28 locations, 32 edges [2020-06-22 03:51:43,670 INFO L258 BlockEncoder]: Using Remove infeasible edges [2020-06-22 03:51:43,671 INFO L263 BlockEncoder]: Using Maximize final states [2020-06-22 03:51:43,672 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false [2020-06-22 03:51:43,672 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE [2020-06-22 03:51:43,674 INFO L296 BlockEncoder]: Using Remove sink states [2020-06-22 03:51:43,674 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true [2020-06-22 03:51:43,675 INFO L179 BlockEncoder]: Using Rewrite not-equals [2020-06-22 03:51:43,697 INFO L185 BlockEncoder]: Using Use SBE [2020-06-22 03:51:43,728 INFO L200 BlockEncoder]: SBE split 12 edges [2020-06-22 03:51:43,733 INFO L70 emoveInfeasibleEdges]: Removed 1 edges and 0 locations because of local infeasibility [2020-06-22 03:51:43,735 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-06-22 03:51:43,765 INFO L100 BaseMinimizeStates]: Removed 12 edges and 6 locations by large block encoding [2020-06-22 03:51:43,767 INFO L70 RemoveSinkStates]: Removed 5 edges and 3 locations by removing sink states [2020-06-22 03:51:43,769 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-06-22 03:51:43,769 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-06-22 03:51:43,769 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding [2020-06-22 03:51:43,770 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states [2020-06-22 03:51:43,770 INFO L313 BlockEncoder]: Encoded RCFG 19 locations, 42 edges [2020-06-22 03:51:43,771 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 03:51:43 BasicIcfg [2020-06-22 03:51:43,771 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- [2020-06-22 03:51:43,772 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-06-22 03:51:43,772 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-06-22 03:51:43,775 INFO L276 PluginConnector]: TraceAbstraction initialized [2020-06-22 03:51:43,776 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.06 03:51:42" (1/4) ... [2020-06-22 03:51:43,776 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2314217 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 03:51:43, skipping insertion in model container [2020-06-22 03:51:43,776 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 03:51:43" (2/4) ... [2020-06-22 03:51:43,777 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2314217 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 03:51:43, skipping insertion in model container [2020-06-22 03:51:43,777 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 03:51:43" (3/4) ... [2020-06-22 03:51:43,777 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2314217 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 03:51:43, skipping insertion in model container [2020-06-22 03:51:43,778 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 03:51:43" (4/4) ... [2020-06-22 03:51:43,779 INFO L112 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-06-22 03:51:43,789 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2020-06-22 03:51:43,797 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 8 error locations. [2020-06-22 03:51:43,813 INFO L257 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2020-06-22 03:51:43,842 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2020-06-22 03:51:43,843 INFO L382 AbstractCegarLoop]: Interprodecural is true [2020-06-22 03:51:43,843 INFO L383 AbstractCegarLoop]: Hoare is true [2020-06-22 03:51:43,843 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2020-06-22 03:51:43,843 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-06-22 03:51:43,843 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-06-22 03:51:43,843 INFO L387 AbstractCegarLoop]: Difference is false [2020-06-22 03:51:43,843 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-06-22 03:51:43,844 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-06-22 03:51:43,858 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2020-06-22 03:51:43,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-06-22 03:51:43,864 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 03:51:43,865 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-06-22 03:51:43,865 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION]=== [2020-06-22 03:51:43,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 03:51:43,871 INFO L82 PathProgramCache]: Analyzing trace with hash 5063892, now seen corresponding path program 1 times [2020-06-22 03:51:43,873 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 03:51:43,873 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 03:51:43,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 03:51:43,925 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 03:51:43,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 03:51:43,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:51:44,033 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 03:51:44,036 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 03:51:44,036 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 03:51:44,040 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 03:51:44,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 03:51:44,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 03:51:44,057 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 3 states. [2020-06-22 03:51:44,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 03:51:44,172 INFO L93 Difference]: Finished difference Result 32 states and 74 transitions. [2020-06-22 03:51:44,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 03:51:44,174 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-06-22 03:51:44,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 03:51:44,187 INFO L225 Difference]: With dead ends: 32 [2020-06-22 03:51:44,187 INFO L226 Difference]: Without dead ends: 18 [2020-06-22 03:51:44,191 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 03:51:44,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2020-06-22 03:51:44,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2020-06-22 03:51:44,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-06-22 03:51:44,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 38 transitions. [2020-06-22 03:51:44,230 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 38 transitions. Word has length 4 [2020-06-22 03:51:44,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 03:51:44,230 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 38 transitions. [2020-06-22 03:51:44,230 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 03:51:44,231 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 38 transitions. [2020-06-22 03:51:44,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-06-22 03:51:44,231 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 03:51:44,231 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-06-22 03:51:44,231 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION]=== [2020-06-22 03:51:44,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 03:51:44,232 INFO L82 PathProgramCache]: Analyzing trace with hash 5063894, now seen corresponding path program 1 times [2020-06-22 03:51:44,232 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 03:51:44,232 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 03:51:44,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 03:51:44,233 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 03:51:44,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 03:51:44,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:51:44,273 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 03:51:44,274 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 03:51:44,274 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-06-22 03:51:44,276 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-06-22 03:51:44,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-06-22 03:51:44,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-06-22 03:51:44,277 INFO L87 Difference]: Start difference. First operand 18 states and 38 transitions. Second operand 4 states. [2020-06-22 03:51:44,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 03:51:44,364 INFO L93 Difference]: Finished difference Result 19 states and 38 transitions. [2020-06-22 03:51:44,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-06-22 03:51:44,365 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2020-06-22 03:51:44,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 03:51:44,366 INFO L225 Difference]: With dead ends: 19 [2020-06-22 03:51:44,366 INFO L226 Difference]: Without dead ends: 18 [2020-06-22 03:51:44,367 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-06-22 03:51:44,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2020-06-22 03:51:44,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2020-06-22 03:51:44,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-06-22 03:51:44,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 37 transitions. [2020-06-22 03:51:44,371 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 37 transitions. Word has length 4 [2020-06-22 03:51:44,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 03:51:44,371 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 37 transitions. [2020-06-22 03:51:44,372 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-06-22 03:51:44,372 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 37 transitions. [2020-06-22 03:51:44,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-06-22 03:51:44,372 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 03:51:44,372 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-06-22 03:51:44,372 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION]=== [2020-06-22 03:51:44,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 03:51:44,373 INFO L82 PathProgramCache]: Analyzing trace with hash 5063895, now seen corresponding path program 1 times [2020-06-22 03:51:44,373 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 03:51:44,373 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 03:51:44,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 03:51:44,374 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 03:51:44,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 03:51:44,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:51:44,400 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 03:51:44,400 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 03:51:44,401 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 03:51:44,401 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 03:51:44,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 03:51:44,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 03:51:44,402 INFO L87 Difference]: Start difference. First operand 18 states and 37 transitions. Second operand 3 states. [2020-06-22 03:51:44,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 03:51:44,456 INFO L93 Difference]: Finished difference Result 18 states and 37 transitions. [2020-06-22 03:51:44,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 03:51:44,456 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-06-22 03:51:44,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 03:51:44,457 INFO L225 Difference]: With dead ends: 18 [2020-06-22 03:51:44,457 INFO L226 Difference]: Without dead ends: 17 [2020-06-22 03:51:44,458 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 03:51:44,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2020-06-22 03:51:44,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2020-06-22 03:51:44,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-06-22 03:51:44,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 36 transitions. [2020-06-22 03:51:44,461 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 36 transitions. Word has length 4 [2020-06-22 03:51:44,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 03:51:44,462 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 36 transitions. [2020-06-22 03:51:44,462 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 03:51:44,462 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 36 transitions. [2020-06-22 03:51:44,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-06-22 03:51:44,462 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 03:51:44,463 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-06-22 03:51:44,463 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION]=== [2020-06-22 03:51:44,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 03:51:44,463 INFO L82 PathProgramCache]: Analyzing trace with hash 156981814, now seen corresponding path program 1 times [2020-06-22 03:51:44,463 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 03:51:44,463 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 03:51:44,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 03:51:44,465 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 03:51:44,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 03:51:44,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:51:44,492 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 03:51:44,493 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 03:51:44,493 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 03:51:44,493 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 03:51:44,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 03:51:44,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 03:51:44,494 INFO L87 Difference]: Start difference. First operand 17 states and 36 transitions. Second operand 3 states. [2020-06-22 03:51:44,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 03:51:44,542 INFO L93 Difference]: Finished difference Result 17 states and 36 transitions. [2020-06-22 03:51:44,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 03:51:44,542 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-06-22 03:51:44,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 03:51:44,543 INFO L225 Difference]: With dead ends: 17 [2020-06-22 03:51:44,543 INFO L226 Difference]: Without dead ends: 14 [2020-06-22 03:51:44,544 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 03:51:44,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2020-06-22 03:51:44,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2020-06-22 03:51:44,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-06-22 03:51:44,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 30 transitions. [2020-06-22 03:51:44,547 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 30 transitions. Word has length 5 [2020-06-22 03:51:44,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 03:51:44,548 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 30 transitions. [2020-06-22 03:51:44,548 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 03:51:44,548 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 30 transitions. [2020-06-22 03:51:44,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-06-22 03:51:44,548 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 03:51:44,548 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-06-22 03:51:44,549 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION]=== [2020-06-22 03:51:44,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 03:51:44,549 INFO L82 PathProgramCache]: Analyzing trace with hash 156981816, now seen corresponding path program 1 times [2020-06-22 03:51:44,549 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 03:51:44,549 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 03:51:44,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 03:51:44,550 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 03:51:44,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 03:51:44,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:51:44,583 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 03:51:44,584 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 03:51:44,584 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-06-22 03:51:44,584 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-06-22 03:51:44,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-06-22 03:51:44,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-06-22 03:51:44,585 INFO L87 Difference]: Start difference. First operand 14 states and 30 transitions. Second operand 4 states. [2020-06-22 03:51:44,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 03:51:44,691 INFO L93 Difference]: Finished difference Result 27 states and 54 transitions. [2020-06-22 03:51:44,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-06-22 03:51:44,691 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2020-06-22 03:51:44,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 03:51:44,692 INFO L225 Difference]: With dead ends: 27 [2020-06-22 03:51:44,692 INFO L226 Difference]: Without dead ends: 24 [2020-06-22 03:51:44,693 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-06-22 03:51:44,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2020-06-22 03:51:44,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 21. [2020-06-22 03:51:44,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-06-22 03:51:44,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 51 transitions. [2020-06-22 03:51:44,699 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 51 transitions. Word has length 5 [2020-06-22 03:51:44,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 03:51:44,699 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 51 transitions. [2020-06-22 03:51:44,699 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-06-22 03:51:44,700 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 51 transitions. [2020-06-22 03:51:44,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-06-22 03:51:44,700 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 03:51:44,700 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-06-22 03:51:44,700 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION]=== [2020-06-22 03:51:44,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 03:51:44,701 INFO L82 PathProgramCache]: Analyzing trace with hash 156981817, now seen corresponding path program 1 times [2020-06-22 03:51:44,701 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 03:51:44,701 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 03:51:44,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 03:51:44,702 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 03:51:44,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 03:51:44,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:51:44,750 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 03:51:44,750 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 03:51:44,750 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-06-22 03:51:44,751 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-06-22 03:51:44,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-06-22 03:51:44,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-06-22 03:51:44,751 INFO L87 Difference]: Start difference. First operand 21 states and 51 transitions. Second operand 5 states. [2020-06-22 03:51:44,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 03:51:44,880 INFO L93 Difference]: Finished difference Result 24 states and 51 transitions. [2020-06-22 03:51:44,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-06-22 03:51:44,881 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2020-06-22 03:51:44,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 03:51:44,882 INFO L225 Difference]: With dead ends: 24 [2020-06-22 03:51:44,882 INFO L226 Difference]: Without dead ends: 20 [2020-06-22 03:51:44,882 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-06-22 03:51:44,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2020-06-22 03:51:44,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2020-06-22 03:51:44,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-06-22 03:51:44,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 47 transitions. [2020-06-22 03:51:44,887 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 47 transitions. Word has length 5 [2020-06-22 03:51:44,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 03:51:44,887 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 47 transitions. [2020-06-22 03:51:44,887 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-06-22 03:51:44,887 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 47 transitions. [2020-06-22 03:51:44,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-06-22 03:51:44,888 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 03:51:44,888 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 03:51:44,888 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION]=== [2020-06-22 03:51:44,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 03:51:44,888 INFO L82 PathProgramCache]: Analyzing trace with hash -648955393, now seen corresponding path program 1 times [2020-06-22 03:51:44,889 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 03:51:44,889 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 03:51:44,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 03:51:44,890 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 03:51:44,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 03:51:44,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:51:44,917 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 03:51:44,918 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 03:51:44,918 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-06-22 03:51:44,918 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 03:51:44,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 03:51:44,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 03:51:44,919 INFO L87 Difference]: Start difference. First operand 20 states and 47 transitions. Second operand 3 states. [2020-06-22 03:51:44,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 03:51:44,987 INFO L93 Difference]: Finished difference Result 35 states and 79 transitions. [2020-06-22 03:51:44,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 03:51:44,988 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2020-06-22 03:51:44,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 03:51:44,988 INFO L225 Difference]: With dead ends: 35 [2020-06-22 03:51:44,988 INFO L226 Difference]: Without dead ends: 24 [2020-06-22 03:51:44,989 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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 03:51:44,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2020-06-22 03:51:44,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 22. [2020-06-22 03:51:44,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2020-06-22 03:51:44,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 49 transitions. [2020-06-22 03:51:44,994 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 49 transitions. Word has length 9 [2020-06-22 03:51:44,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 03:51:44,994 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 49 transitions. [2020-06-22 03:51:44,994 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 03:51:44,994 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 49 transitions. [2020-06-22 03:51:44,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-06-22 03:51:44,995 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 03:51:44,995 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 03:51:44,995 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION]=== [2020-06-22 03:51:44,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 03:51:44,995 INFO L82 PathProgramCache]: Analyzing trace with hash -648925602, now seen corresponding path program 1 times [2020-06-22 03:51:44,996 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 03:51:44,996 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 03:51:44,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 03:51:44,997 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 03:51:44,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 03:51:45,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:51:45,025 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 03:51:45,025 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 03:51:45,026 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-06-22 03:51:45,026 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 03:51:45,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 03:51:45,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 03:51:45,026 INFO L87 Difference]: Start difference. First operand 22 states and 49 transitions. Second operand 3 states. [2020-06-22 03:51:45,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 03:51:45,091 INFO L93 Difference]: Finished difference Result 37 states and 86 transitions. [2020-06-22 03:51:45,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 03:51:45,092 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2020-06-22 03:51:45,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 03:51:45,092 INFO L225 Difference]: With dead ends: 37 [2020-06-22 03:51:45,092 INFO L226 Difference]: Without dead ends: 21 [2020-06-22 03:51:45,093 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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 03:51:45,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2020-06-22 03:51:45,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2020-06-22 03:51:45,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-06-22 03:51:45,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 42 transitions. [2020-06-22 03:51:45,096 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 42 transitions. Word has length 9 [2020-06-22 03:51:45,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 03:51:45,097 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 42 transitions. [2020-06-22 03:51:45,097 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 03:51:45,097 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 42 transitions. [2020-06-22 03:51:45,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-06-22 03:51:45,097 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 03:51:45,098 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 03:51:45,098 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION]=== [2020-06-22 03:51:45,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 03:51:45,098 INFO L82 PathProgramCache]: Analyzing trace with hash -877373307, now seen corresponding path program 1 times [2020-06-22 03:51:45,098 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 03:51:45,098 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 03:51:45,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 03:51:45,100 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 03:51:45,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 03:51:45,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:51:45,139 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 03:51:45,140 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 03:51:45,140 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2020-06-22 03:51:45,151 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 03:51:45,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:51:45,176 INFO L256 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 3 conjunts are in the unsatisfiable core [2020-06-22 03:51:45,181 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:51:45,204 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 03:51:45,231 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-06-22 03:51:45,232 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2020-06-22 03:51:45,232 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-06-22 03:51:45,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-06-22 03:51:45,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-06-22 03:51:45,233 INFO L87 Difference]: Start difference. First operand 21 states and 42 transitions. Second operand 6 states. [2020-06-22 03:51:45,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 03:51:45,330 INFO L93 Difference]: Finished difference Result 25 states and 43 transitions. [2020-06-22 03:51:45,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-06-22 03:51:45,330 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 11 [2020-06-22 03:51:45,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 03:51:45,331 INFO L225 Difference]: With dead ends: 25 [2020-06-22 03:51:45,331 INFO L226 Difference]: Without dead ends: 22 [2020-06-22 03:51:45,331 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2020-06-22 03:51:45,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2020-06-22 03:51:45,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2020-06-22 03:51:45,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-06-22 03:51:45,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 39 transitions. [2020-06-22 03:51:45,335 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 39 transitions. Word has length 11 [2020-06-22 03:51:45,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 03:51:45,336 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 39 transitions. [2020-06-22 03:51:45,336 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-06-22 03:51:45,337 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 39 transitions. [2020-06-22 03:51:45,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-06-22 03:51:45,337 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 03:51:45,337 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 03:51:45,337 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION]=== [2020-06-22 03:51:45,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 03:51:45,338 INFO L82 PathProgramCache]: Analyzing trace with hash -877373306, now seen corresponding path program 1 times [2020-06-22 03:51:45,338 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 03:51:45,338 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 03:51:45,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 03:51:45,339 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 03:51:45,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 03:51:45,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:51:45,490 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 03:51:45,491 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 03:51:45,491 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2020-06-22 03:51:45,504 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 03:51:45,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:51:45,525 INFO L256 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 23 conjunts are in the unsatisfiable core [2020-06-22 03:51:45,526 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:51:45,573 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2020-06-22 03:51:45,573 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 03:51:45,586 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 03:51:45,587 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-06-22 03:51:45,587 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:24 [2020-06-22 03:51:45,625 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 03:51:45,627 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 18 [2020-06-22 03:51:45,631 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-06-22 03:51:45,644 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 03:51:45,649 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2020-06-22 03:51:45,650 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:31, output treesize:27 [2020-06-22 03:51:45,702 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 03:51:45,729 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-06-22 03:51:45,730 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 10 [2020-06-22 03:51:45,730 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-06-22 03:51:45,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-06-22 03:51:45,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2020-06-22 03:51:45,731 INFO L87 Difference]: Start difference. First operand 21 states and 39 transitions. Second operand 11 states. [2020-06-22 03:51:46,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 03:51:46,193 INFO L93 Difference]: Finished difference Result 29 states and 56 transitions. [2020-06-22 03:51:46,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-06-22 03:51:46,193 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2020-06-22 03:51:46,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 03:51:46,194 INFO L225 Difference]: With dead ends: 29 [2020-06-22 03:51:46,194 INFO L226 Difference]: Without dead ends: 22 [2020-06-22 03:51:46,195 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=76, Invalid=164, Unknown=0, NotChecked=0, Total=240 [2020-06-22 03:51:46,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2020-06-22 03:51:46,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 18. [2020-06-22 03:51:46,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-06-22 03:51:46,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 34 transitions. [2020-06-22 03:51:46,199 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 34 transitions. Word has length 11 [2020-06-22 03:51:46,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 03:51:46,199 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 34 transitions. [2020-06-22 03:51:46,199 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-06-22 03:51:46,199 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 34 transitions. [2020-06-22 03:51:46,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-06-22 03:51:46,200 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 03:51:46,200 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2020-06-22 03:51:46,200 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION]=== [2020-06-22 03:51:46,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 03:51:46,200 INFO L82 PathProgramCache]: Analyzing trace with hash -1005147885, now seen corresponding path program 2 times [2020-06-22 03:51:46,200 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 03:51:46,201 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 03:51:46,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 03:51:46,202 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 03:51:46,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 03:51:46,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:51:46,464 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 03:51:46,464 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 03:51:46,464 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2020-06-22 03:51:46,476 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2020-06-22 03:51:46,497 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-06-22 03:51:46,498 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-06-22 03:51:46,499 INFO L256 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 24 conjunts are in the unsatisfiable core [2020-06-22 03:51:46,501 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:51:46,506 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-06-22 03:51:46,507 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 03:51:46,511 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 03:51:46,511 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-06-22 03:51:46,511 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2020-06-22 03:51:46,528 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2020-06-22 03:51:46,529 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 03:51:46,534 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 03:51:46,535 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-06-22 03:51:46,535 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:23, output treesize:19 [2020-06-22 03:51:46,572 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 03:51:46,572 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 20 [2020-06-22 03:51:46,573 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-06-22 03:51:46,583 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 03:51:46,585 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 03:51:46,585 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:33, output treesize:24 [2020-06-22 03:51:46,631 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-06-22 03:51:46,658 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-06-22 03:51:46,658 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 11 [2020-06-22 03:51:46,658 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-06-22 03:51:46,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-06-22 03:51:46,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2020-06-22 03:51:46,659 INFO L87 Difference]: Start difference. First operand 18 states and 34 transitions. Second operand 12 states. [2020-06-22 03:51:47,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 03:51:47,193 INFO L93 Difference]: Finished difference Result 34 states and 69 transitions. [2020-06-22 03:51:47,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-06-22 03:51:47,193 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 17 [2020-06-22 03:51:47,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 03:51:47,194 INFO L225 Difference]: With dead ends: 34 [2020-06-22 03:51:47,194 INFO L226 Difference]: Without dead ends: 33 [2020-06-22 03:51:47,195 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=161, Invalid=391, Unknown=0, NotChecked=0, Total=552 [2020-06-22 03:51:47,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2020-06-22 03:51:47,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 24. [2020-06-22 03:51:47,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2020-06-22 03:51:47,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 47 transitions. [2020-06-22 03:51:47,200 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 47 transitions. Word has length 17 [2020-06-22 03:51:47,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 03:51:47,200 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 47 transitions. [2020-06-22 03:51:47,200 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-06-22 03:51:47,200 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 47 transitions. [2020-06-22 03:51:47,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-06-22 03:51:47,201 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 03:51:47,201 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1] [2020-06-22 03:51:47,201 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION]=== [2020-06-22 03:51:47,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 03:51:47,201 INFO L82 PathProgramCache]: Analyzing trace with hash -2085270242, now seen corresponding path program 1 times [2020-06-22 03:51:47,202 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 03:51:47,202 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 03:51:47,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 03:51:47,203 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 03:51:47,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 03:51:47,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:51:47,323 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-06-22 03:51:47,323 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 03:51:47,323 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2020-06-22 03:51:47,334 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 03:51:47,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:51:47,355 INFO L256 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 29 conjunts are in the unsatisfiable core [2020-06-22 03:51:47,357 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:51:47,363 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-06-22 03:51:47,363 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 03:51:47,368 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 03:51:47,368 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-06-22 03:51:47,369 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2020-06-22 03:51:47,374 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2020-06-22 03:51:47,374 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 03:51:47,376 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 03:51:47,376 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 03:51:47,376 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2020-06-22 03:51:47,390 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 03:51:47,391 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 19 [2020-06-22 03:51:47,392 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-06-22 03:51:47,400 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 03:51:47,400 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 03:51:47,400 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:20 [2020-06-22 03:51:47,431 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-06-22 03:51:47,458 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-06-22 03:51:47,458 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 8 [2020-06-22 03:51:47,458 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-06-22 03:51:47,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-06-22 03:51:47,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-06-22 03:51:47,459 INFO L87 Difference]: Start difference. First operand 24 states and 47 transitions. Second operand 9 states. [2020-06-22 03:51:47,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 03:51:47,557 INFO L93 Difference]: Finished difference Result 24 states and 47 transitions. [2020-06-22 03:51:47,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-06-22 03:51:47,558 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 23 [2020-06-22 03:51:47,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 03:51:47,558 INFO L225 Difference]: With dead ends: 24 [2020-06-22 03:51:47,558 INFO L226 Difference]: Without dead ends: 0 [2020-06-22 03:51:47,559 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 23 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2020-06-22 03:51:47,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-06-22 03:51:47,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-06-22 03:51:47,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-06-22 03:51:47,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-06-22 03:51:47,560 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 23 [2020-06-22 03:51:47,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 03:51:47,560 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 03:51:47,560 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-06-22 03:51:47,560 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-06-22 03:51:47,560 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-06-22 03:51:47,565 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-06-22 03:51:47,703 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 43 [2020-06-22 03:51:47,714 INFO L448 ceAbstractionStarter]: For program point L29-1(line 29) no Hoare annotation was computed. [2020-06-22 03:51:47,714 INFO L448 ceAbstractionStarter]: For program point L29-2(line 29) no Hoare annotation was computed. [2020-06-22 03:51:47,714 INFO L448 ceAbstractionStarter]: For program point L29-3(line 29) no Hoare annotation was computed. [2020-06-22 03:51:47,714 INFO L448 ceAbstractionStarter]: For program point L29-4(line 29) no Hoare annotation was computed. [2020-06-22 03:51:47,714 INFO L448 ceAbstractionStarter]: For program point L29-6(lines 29 30) no Hoare annotation was computed. [2020-06-22 03:51:47,715 INFO L444 ceAbstractionStarter]: At program point L29-8(lines 29 30) the Hoare annotation is: (let ((.cse0 (= 1 (select |#valid| ULTIMATE.start_cstrchr_~s.base))) (.cse1 (<= 1 ULTIMATE.start___VERIFIER_nondet_String_~length~0)) (.cse2 (= ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset 0)) (.cse3 (= (select |#length| ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base) ULTIMATE.start___VERIFIER_nondet_String_~length~0)) (.cse4 (exists ((ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset Int)) (and (= (select (select |#memory_int| ULTIMATE.start_cstrchr_~s.base) (+ ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset (select |#length| ULTIMATE.start_cstrchr_~s.base) (- 1))) 0) (<= ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset 0) (<= 0 ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset)))) (.cse5 (= (select |#valid| ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base) 1))) (or (and .cse0 .cse1 .cse2 .cse3 (exists ((ULTIMATE.start___VERIFIER_nondet_String_~length~0 Int) (ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset Int)) (and (= (select (select |#memory_int| ULTIMATE.start_cstrchr_~s.base) (+ ULTIMATE.start___VERIFIER_nondet_String_~length~0 ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset (- 1))) 0) (<= 1 ULTIMATE.start___VERIFIER_nondet_String_~length~0) (<= (+ ULTIMATE.start___VERIFIER_nondet_String_~length~0 ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset) (select |#length| ULTIMATE.start_cstrchr_~s.base)) (<= ULTIMATE.start_cstrchr_~s.offset ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset))) (= 0 ULTIMATE.start_cstrchr_~s.offset) .cse4 .cse5) (and (<= 1 ULTIMATE.start_cstrchr_~s.offset) (<= (+ ULTIMATE.start_cstrchr_~s.offset 1) (select |#length| ULTIMATE.start_cstrchr_~s.base)) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5))) [2020-06-22 03:51:47,715 INFO L448 ceAbstractionStarter]: For program point L29-9(lines 29 30) no Hoare annotation was computed. [2020-06-22 03:51:47,715 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr4REQUIRES_VIOLATION(line 29) no Hoare annotation was computed. [2020-06-22 03:51:47,715 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr5REQUIRES_VIOLATION(line 29) no Hoare annotation was computed. [2020-06-22 03:51:47,715 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr6REQUIRES_VIOLATION(line 31) no Hoare annotation was computed. [2020-06-22 03:51:47,715 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr7REQUIRES_VIOLATION(line 31) no Hoare annotation was computed. [2020-06-22 03:51:47,715 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-06-22 03:51:47,716 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. [2020-06-22 03:51:47,716 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. [2020-06-22 03:51:47,716 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2REQUIRES_VIOLATION(line 29) no Hoare annotation was computed. [2020-06-22 03:51:47,716 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr3REQUIRES_VIOLATION(line 29) no Hoare annotation was computed. [2020-06-22 03:51:47,716 INFO L444 ceAbstractionStarter]: At program point L16(line 16) the Hoare annotation is: (and (<= 1 ULTIMATE.start___VERIFIER_nondet_String_~length~0) (= ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset 0) (= (select |#length| ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base) ULTIMATE.start___VERIFIER_nondet_String_~length~0) (= (select |#valid| ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base) 1)) [2020-06-22 03:51:47,716 INFO L448 ceAbstractionStarter]: For program point L12(lines 12 14) no Hoare annotation was computed. [2020-06-22 03:51:47,716 INFO L448 ceAbstractionStarter]: For program point L12-2(lines 12 14) no Hoare annotation was computed. [2020-06-22 03:51:47,717 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2020-06-22 03:51:47,725 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~length~0,QUANTIFIED] [2020-06-22 03:51:47,726 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] [2020-06-22 03:51:47,726 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~length~0,QUANTIFIED] [2020-06-22 03:51:47,726 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~length~0,QUANTIFIED] [2020-06-22 03:51:47,726 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] [2020-06-22 03:51:47,726 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] [2020-06-22 03:51:47,727 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] [2020-06-22 03:51:47,727 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] [2020-06-22 03:51:47,727 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] [2020-06-22 03:51:47,728 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] [2020-06-22 03:51:47,728 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] [2020-06-22 03:51:47,728 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] [2020-06-22 03:51:47,731 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 03:51:47,731 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 03:51:47,731 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 03:51:47,731 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 03:51:47,732 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 03:51:47,732 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 03:51:47,732 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 03:51:47,732 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 03:51:47,733 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 03:51:47,740 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~length~0,QUANTIFIED] [2020-06-22 03:51:47,740 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] [2020-06-22 03:51:47,740 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~length~0,QUANTIFIED] [2020-06-22 03:51:47,740 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~length~0,QUANTIFIED] [2020-06-22 03:51:47,741 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] [2020-06-22 03:51:47,741 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] [2020-06-22 03:51:47,741 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] [2020-06-22 03:51:47,741 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] [2020-06-22 03:51:47,741 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] [2020-06-22 03:51:47,742 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] [2020-06-22 03:51:47,742 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] [2020-06-22 03:51:47,742 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] [2020-06-22 03:51:47,743 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 03:51:47,743 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 03:51:47,743 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 03:51:47,744 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 03:51:47,744 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 03:51:47,745 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 03:51:47,745 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 03:51:47,745 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 03:51:47,745 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 03:51:47,747 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 03:51:47,748 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 03:51:47,749 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 03:51:47 BasicIcfg [2020-06-22 03:51:47,749 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-06-22 03:51:47,750 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-06-22 03:51:47,750 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-06-22 03:51:47,754 INFO L276 PluginConnector]: BuchiAutomizer initialized [2020-06-22 03:51:47,754 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 03:51:47,754 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.06 03:51:42" (1/5) ... [2020-06-22 03:51:47,755 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@48479fc4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.06 03:51:47, skipping insertion in model container [2020-06-22 03:51:47,755 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 03:51:47,755 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 03:51:43" (2/5) ... [2020-06-22 03:51:47,756 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@48479fc4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.06 03:51:47, skipping insertion in model container [2020-06-22 03:51:47,756 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 03:51:47,756 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 03:51:43" (3/5) ... [2020-06-22 03:51:47,757 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@48479fc4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 03:51:47, skipping insertion in model container [2020-06-22 03:51:47,757 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 03:51:47,757 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 03:51:43" (4/5) ... [2020-06-22 03:51:47,757 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@48479fc4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 03:51:47, skipping insertion in model container [2020-06-22 03:51:47,757 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 03:51:47,757 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 03:51:47" (5/5) ... [2020-06-22 03:51:47,759 INFO L375 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-06-22 03:51:47,780 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2020-06-22 03:51:47,780 INFO L374 BuchiCegarLoop]: Interprodecural is true [2020-06-22 03:51:47,780 INFO L375 BuchiCegarLoop]: Hoare is true [2020-06-22 03:51:47,780 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-06-22 03:51:47,780 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-06-22 03:51:47,781 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-06-22 03:51:47,781 INFO L379 BuchiCegarLoop]: Difference is false [2020-06-22 03:51:47,781 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-06-22 03:51:47,781 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-06-22 03:51:47,785 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states. [2020-06-22 03:51:47,790 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2020-06-22 03:51:47,790 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 03:51:47,790 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 03:51:47,794 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-06-22 03:51:47,794 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-06-22 03:51:47,795 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2020-06-22 03:51:47,795 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states. [2020-06-22 03:51:47,796 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2020-06-22 03:51:47,796 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 03:51:47,796 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 03:51:47,796 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-06-22 03:51:47,797 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-06-22 03:51:47,802 INFO L794 eck$LassoCheckResult]: Stem: 16#ULTIMATE.startENTRYtrue [136] ULTIMATE.startENTRY-->L12: Formula: (and (= |v_#valid_13| (store |v_#valid_14| 0 0)) (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|)) InVars {#valid=|v_#valid_14|} OutVars{ULTIMATE.start___VERIFIER_nondet_String_#res.offset=|v_ULTIMATE.start___VERIFIER_nondet_String_#res.offset_4|, ULTIMATE.start_main_#t~ret8.base=|v_ULTIMATE.start_main_#t~ret8.base_4|, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset_3|, ULTIMATE.start_main_#t~nondet9=|v_ULTIMATE.start_main_#t~nondet9_4|, #NULL.offset=|v_#NULL.offset_2|, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~ret10.base=|v_ULTIMATE.start_main_#t~ret10.base_4|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_6, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, #valid=|v_#valid_13|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_10, ULTIMATE.start___VERIFIER_nondet_String_#t~nondet0=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~nondet0_6|, ULTIMATE.start___VERIFIER_nondet_String_#res.base=|v_ULTIMATE.start___VERIFIER_nondet_String_#res.base_4|, ULTIMATE.start_main_#t~ret8.offset=|v_ULTIMATE.start_main_#t~ret8.offset_4|, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_3|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_7, ULTIMATE.start_main_#t~ret10.offset=|v_ULTIMATE.start_main_#t~ret10.offset_4|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_nondet_String_#res.offset, ULTIMATE.start_main_#t~ret8.base, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset, ULTIMATE.start_main_#t~nondet9, #NULL.offset, #NULL.base, ULTIMATE.start_main_#t~ret10.base, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset, ULTIMATE.start_main_#res, #valid, ULTIMATE.start___VERIFIER_nondet_String_~length~0, ULTIMATE.start___VERIFIER_nondet_String_#t~nondet0, ULTIMATE.start___VERIFIER_nondet_String_#res.base, ULTIMATE.start_main_#t~ret8.offset, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base, ULTIMATE.start_main_#t~ret10.offset] 17#L12true [75] L12-->L12-2: Formula: (and (< v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_5 1) (= v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_4 1)) InVars {ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_5} OutVars{ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_4} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_nondet_String_~length~0] 14#L12-2true [103] L12-2-->L16: Formula: (and (= (store |v_#length_2| |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_2| v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_7) |v_#length_1|) (= v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_2 |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_2|) (< 0 |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_2|) (= (select |v_#valid_4| |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_2|) 0) (= v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_2 |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset_2|) (= 0 |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset_2|) (= |v_#valid_3| (store |v_#valid_4| |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_2| 1)) (< |v_#StackHeapBarrier_1| |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_2|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_7, #length=|v_#length_2|, #valid=|v_#valid_4|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset_2|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_2, #valid=|v_#valid_3|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_7, #length=|v_#length_1|, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_2|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_2} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset, #valid, #length, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base] 4#L16true [138] L16-->L29-8: Formula: (let ((.cse0 (+ v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_8 v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_12))) (and (= |v_ULTIMATE.start_main_#t~ret8.offset_5| |v_ULTIMATE.start___VERIFIER_nondet_String_#res.offset_6|) (= |v_ULTIMATE.start_cstrchr_#in~c_2| |v_ULTIMATE.start_main_#t~nondet9_5|) (<= 1 .cse0) (= |v_ULTIMATE.start_cstrchr_#in~s.base_2| v_ULTIMATE.start_cstrchr_~s.base_15) (<= .cse0 (select |v_#length_12| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_9)) (= v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_9 |v_ULTIMATE.start___VERIFIER_nondet_String_#res.base_6|) (= |v_ULTIMATE.start_main_#t~ret8.base_5| |v_ULTIMATE.start___VERIFIER_nondet_String_#res.base_6|) (= |v_ULTIMATE.start_cstrchr_#in~c_2| v_ULTIMATE.start_cstrchr_~c_6) (= |v_ULTIMATE.start___VERIFIER_nondet_String_#res.offset_6| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_8) (= |v_ULTIMATE.start_cstrchr_#in~s.offset_2| |v_ULTIMATE.start_main_#t~ret8.offset_5|) (= |v_#memory_int_8| (store |v_#memory_int_9| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_9 (store (select |v_#memory_int_9| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_9) (+ v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_8 v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_12 (- 1)) 0))) (= |v_ULTIMATE.start_main_#t~ret8.base_5| |v_ULTIMATE.start_cstrchr_#in~s.base_2|) (= 1 (select |v_#valid_16| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_9)) (= |v_ULTIMATE.start_cstrchr_#in~s.offset_2| v_ULTIMATE.start_cstrchr_~s.offset_12))) InVars {ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_8, #valid=|v_#valid_16|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_#t~nondet9=|v_ULTIMATE.start_main_#t~nondet9_5|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_12, #length=|v_#length_12|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_9} OutVars{ULTIMATE.start_cstrchr_~s.offset=v_ULTIMATE.start_cstrchr_~s.offset_12, ULTIMATE.start_cstrchr_#res.offset=|v_ULTIMATE.start_cstrchr_#res.offset_4|, ULTIMATE.start_cstrchr_#t~ite7.offset=|v_ULTIMATE.start_cstrchr_#t~ite7.offset_6|, ULTIMATE.start_cstrchr_~s.base=v_ULTIMATE.start_cstrchr_~s.base_15, ULTIMATE.start_cstrchr_#t~post5.base=|v_ULTIMATE.start_cstrchr_#t~post5.base_4|, ULTIMATE.start_main_#t~nondet9=|v_ULTIMATE.start_main_#t~nondet9_5|, ULTIMATE.start_cstrchr_#t~ite7.base=|v_ULTIMATE.start_cstrchr_#t~ite7.base_6|, ULTIMATE.start_cstrchr_#in~s.offset=|v_ULTIMATE.start_cstrchr_#in~s.offset_2|, ULTIMATE.start_cstrchr_#t~mem3=|v_ULTIMATE.start_cstrchr_#t~mem3_6|, ULTIMATE.start_cstrchr_#t~mem2=|v_ULTIMATE.start_cstrchr_#t~mem2_6|, ULTIMATE.start_cstrchr_#t~mem6=|v_ULTIMATE.start_cstrchr_#t~mem6_6|, #length=|v_#length_12|, ULTIMATE.start_cstrchr_~c=v_ULTIMATE.start_cstrchr_~c_6, ULTIMATE.start___VERIFIER_nondet_String_#res.base=|v_ULTIMATE.start___VERIFIER_nondet_String_#res.base_6|, ULTIMATE.start___VERIFIER_nondet_String_#res.offset=|v_ULTIMATE.start___VERIFIER_nondet_String_#res.offset_6|, ULTIMATE.start_main_#t~ret8.base=|v_ULTIMATE.start_main_#t~ret8.base_5|, ULTIMATE.start_cstrchr_#res.base=|v_ULTIMATE.start_cstrchr_#res.base_4|, ULTIMATE.start_cstrchr_#in~c=|v_ULTIMATE.start_cstrchr_#in~c_2|, ULTIMATE.start_cstrchr_#t~short4=|v_ULTIMATE.start_cstrchr_#t~short4_10|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_8, #valid=|v_#valid_16|, #memory_int=|v_#memory_int_8|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_12, ULTIMATE.start_cstrchr_#in~s.base=|v_ULTIMATE.start_cstrchr_#in~s.base_2|, ULTIMATE.start_cstrchr_#t~post5.offset=|v_ULTIMATE.start_cstrchr_#t~post5.offset_4|, ULTIMATE.start_main_#t~ret8.offset=|v_ULTIMATE.start_main_#t~ret8.offset_5|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_9} AuxVars[] AssignedVars[ULTIMATE.start_cstrchr_~s.offset, ULTIMATE.start_cstrchr_#res.offset, ULTIMATE.start___VERIFIER_nondet_String_#res.offset, ULTIMATE.start_main_#t~ret8.base, ULTIMATE.start_cstrchr_#t~ite7.offset, ULTIMATE.start_cstrchr_#res.base, ULTIMATE.start_cstrchr_~s.base, ULTIMATE.start_cstrchr_#t~post5.base, ULTIMATE.start_cstrchr_#t~ite7.base, ULTIMATE.start_cstrchr_#in~s.offset, ULTIMATE.start_cstrchr_#in~c, ULTIMATE.start_cstrchr_#t~mem3, ULTIMATE.start_cstrchr_#t~mem2, ULTIMATE.start_cstrchr_#t~short4, ULTIMATE.start_cstrchr_#t~mem6, #memory_int, ULTIMATE.start_cstrchr_~c, ULTIMATE.start___VERIFIER_nondet_String_#res.base, ULTIMATE.start_cstrchr_#in~s.base, ULTIMATE.start_cstrchr_#t~post5.offset, ULTIMATE.start_main_#t~ret8.offset] 15#L29-8true [2020-06-22 03:51:47,803 INFO L796 eck$LassoCheckResult]: Loop: 15#L29-8true [72] L29-8-->L29-1: Formula: (and (<= 0 v_ULTIMATE.start_cstrchr_~s.offset_3) (= (select |v_#valid_7| v_ULTIMATE.start_cstrchr_~s.base_3) 1) (<= (+ v_ULTIMATE.start_cstrchr_~s.offset_3 1) (select |v_#length_5| v_ULTIMATE.start_cstrchr_~s.base_3)) (= (select (select |v_#memory_int_3| v_ULTIMATE.start_cstrchr_~s.base_3) v_ULTIMATE.start_cstrchr_~s.offset_3) |v_ULTIMATE.start_cstrchr_#t~mem2_2|)) InVars {ULTIMATE.start_cstrchr_~s.offset=v_ULTIMATE.start_cstrchr_~s.offset_3, #memory_int=|v_#memory_int_3|, ULTIMATE.start_cstrchr_~s.base=v_ULTIMATE.start_cstrchr_~s.base_3, #length=|v_#length_5|, #valid=|v_#valid_7|} OutVars{ULTIMATE.start_cstrchr_~s.offset=v_ULTIMATE.start_cstrchr_~s.offset_3, ULTIMATE.start_cstrchr_#t~mem2=|v_ULTIMATE.start_cstrchr_#t~mem2_2|, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_3|, ULTIMATE.start_cstrchr_~s.base=v_ULTIMATE.start_cstrchr_~s.base_3, #length=|v_#length_5|} AuxVars[] AssignedVars[ULTIMATE.start_cstrchr_#t~mem2] 9#L29-1true [116] L29-1-->L29-2: Formula: (and |v_ULTIMATE.start_cstrchr_#t~short4_2| (< 0 |v_ULTIMATE.start_cstrchr_#t~mem2_3|)) InVars {ULTIMATE.start_cstrchr_#t~mem2=|v_ULTIMATE.start_cstrchr_#t~mem2_3|} OutVars{ULTIMATE.start_cstrchr_#t~short4=|v_ULTIMATE.start_cstrchr_#t~short4_2|, ULTIMATE.start_cstrchr_#t~mem2=|v_ULTIMATE.start_cstrchr_#t~mem2_3|} AuxVars[] AssignedVars[ULTIMATE.start_cstrchr_#t~short4] 6#L29-2true [65] L29-2-->L29-6: Formula: (not |v_ULTIMATE.start_cstrchr_#t~short4_5|) InVars {ULTIMATE.start_cstrchr_#t~short4=|v_ULTIMATE.start_cstrchr_#t~short4_5|} OutVars{ULTIMATE.start_cstrchr_#t~short4=|v_ULTIMATE.start_cstrchr_#t~short4_5|} AuxVars[] AssignedVars[] 19#L29-6true [78] L29-6-->L29-8: Formula: (and (= v_ULTIMATE.start_cstrchr_~s.offset_7 (+ v_ULTIMATE.start_cstrchr_~s.offset_8 1)) (= v_ULTIMATE.start_cstrchr_~s.base_9 v_ULTIMATE.start_cstrchr_~s.base_10) |v_ULTIMATE.start_cstrchr_#t~short4_9|) InVars {ULTIMATE.start_cstrchr_~s.offset=v_ULTIMATE.start_cstrchr_~s.offset_8, ULTIMATE.start_cstrchr_~s.base=v_ULTIMATE.start_cstrchr_~s.base_10, ULTIMATE.start_cstrchr_#t~short4=|v_ULTIMATE.start_cstrchr_#t~short4_9|} OutVars{ULTIMATE.start_cstrchr_~s.offset=v_ULTIMATE.start_cstrchr_~s.offset_7, ULTIMATE.start_cstrchr_#t~mem3=|v_ULTIMATE.start_cstrchr_#t~mem3_5|, ULTIMATE.start_cstrchr_#t~mem2=|v_ULTIMATE.start_cstrchr_#t~mem2_5|, ULTIMATE.start_cstrchr_#t~short4=|v_ULTIMATE.start_cstrchr_#t~short4_8|, ULTIMATE.start_cstrchr_#t~post5.base=|v_ULTIMATE.start_cstrchr_#t~post5.base_2|, ULTIMATE.start_cstrchr_~s.base=v_ULTIMATE.start_cstrchr_~s.base_9, ULTIMATE.start_cstrchr_#t~post5.offset=|v_ULTIMATE.start_cstrchr_#t~post5.offset_2|} AuxVars[] AssignedVars[ULTIMATE.start_cstrchr_~s.offset, ULTIMATE.start_cstrchr_#t~mem3, ULTIMATE.start_cstrchr_#t~mem2, ULTIMATE.start_cstrchr_#t~short4, ULTIMATE.start_cstrchr_#t~post5.base, ULTIMATE.start_cstrchr_~s.base, ULTIMATE.start_cstrchr_#t~post5.offset] 15#L29-8true [2020-06-22 03:51:47,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 03:51:47,804 INFO L82 PathProgramCache]: Analyzing trace with hash 5050503, now seen corresponding path program 1 times [2020-06-22 03:51:47,804 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 03:51:47,804 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 03:51:47,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 03:51:47,805 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 03:51:47,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 03:51:47,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 03:51:47,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 03:51:47,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 03:51:47,835 INFO L82 PathProgramCache]: Analyzing trace with hash 3182042, now seen corresponding path program 1 times [2020-06-22 03:51:47,835 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 03:51:47,836 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 03:51:47,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 03:51:47,836 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 03:51:47,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 03:51:47,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:51:47,844 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 03:51:47,845 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 03:51:47,845 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-06-22 03:51:47,845 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-06-22 03:51:47,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 03:51:47,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 03:51:47,847 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 3 states. [2020-06-22 03:51:47,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 03:51:47,910 INFO L93 Difference]: Finished difference Result 21 states and 42 transitions. [2020-06-22 03:51:47,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 03:51:47,913 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 42 transitions. [2020-06-22 03:51:47,914 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2020-06-22 03:51:47,915 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 12 states and 25 transitions. [2020-06-22 03:51:47,916 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2020-06-22 03:51:47,916 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2020-06-22 03:51:47,916 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 25 transitions. [2020-06-22 03:51:47,917 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 03:51:47,917 INFO L706 BuchiCegarLoop]: Abstraction has 12 states and 25 transitions. [2020-06-22 03:51:47,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 25 transitions. [2020-06-22 03:51:47,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 11. [2020-06-22 03:51:47,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-06-22 03:51:47,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 24 transitions. [2020-06-22 03:51:47,920 INFO L729 BuchiCegarLoop]: Abstraction has 11 states and 24 transitions. [2020-06-22 03:51:47,920 INFO L609 BuchiCegarLoop]: Abstraction has 11 states and 24 transitions. [2020-06-22 03:51:47,920 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2020-06-22 03:51:47,920 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 24 transitions. [2020-06-22 03:51:47,921 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2020-06-22 03:51:47,921 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 03:51:47,921 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 03:51:47,921 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-06-22 03:51:47,921 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-06-22 03:51:47,922 INFO L794 eck$LassoCheckResult]: Stem: 55#ULTIMATE.startENTRY [136] ULTIMATE.startENTRY-->L12: Formula: (and (= |v_#valid_13| (store |v_#valid_14| 0 0)) (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|)) InVars {#valid=|v_#valid_14|} OutVars{ULTIMATE.start___VERIFIER_nondet_String_#res.offset=|v_ULTIMATE.start___VERIFIER_nondet_String_#res.offset_4|, ULTIMATE.start_main_#t~ret8.base=|v_ULTIMATE.start_main_#t~ret8.base_4|, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset_3|, ULTIMATE.start_main_#t~nondet9=|v_ULTIMATE.start_main_#t~nondet9_4|, #NULL.offset=|v_#NULL.offset_2|, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~ret10.base=|v_ULTIMATE.start_main_#t~ret10.base_4|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_6, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, #valid=|v_#valid_13|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_10, ULTIMATE.start___VERIFIER_nondet_String_#t~nondet0=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~nondet0_6|, ULTIMATE.start___VERIFIER_nondet_String_#res.base=|v_ULTIMATE.start___VERIFIER_nondet_String_#res.base_4|, ULTIMATE.start_main_#t~ret8.offset=|v_ULTIMATE.start_main_#t~ret8.offset_4|, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_3|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_7, ULTIMATE.start_main_#t~ret10.offset=|v_ULTIMATE.start_main_#t~ret10.offset_4|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_nondet_String_#res.offset, ULTIMATE.start_main_#t~ret8.base, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset, ULTIMATE.start_main_#t~nondet9, #NULL.offset, #NULL.base, ULTIMATE.start_main_#t~ret10.base, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset, ULTIMATE.start_main_#res, #valid, ULTIMATE.start___VERIFIER_nondet_String_~length~0, ULTIMATE.start___VERIFIER_nondet_String_#t~nondet0, ULTIMATE.start___VERIFIER_nondet_String_#res.base, ULTIMATE.start_main_#t~ret8.offset, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base, ULTIMATE.start_main_#t~ret10.offset] 56#L12 [75] L12-->L12-2: Formula: (and (< v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_5 1) (= v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_4 1)) InVars {ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_5} OutVars{ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_4} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_nondet_String_~length~0] 51#L12-2 [103] L12-2-->L16: Formula: (and (= (store |v_#length_2| |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_2| v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_7) |v_#length_1|) (= v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_2 |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_2|) (< 0 |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_2|) (= (select |v_#valid_4| |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_2|) 0) (= v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_2 |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset_2|) (= 0 |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset_2|) (= |v_#valid_3| (store |v_#valid_4| |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_2| 1)) (< |v_#StackHeapBarrier_1| |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_2|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_7, #length=|v_#length_2|, #valid=|v_#valid_4|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset_2|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_2, #valid=|v_#valid_3|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_7, #length=|v_#length_1|, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_2|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_2} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset, #valid, #length, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base] 52#L16 [138] L16-->L29-8: Formula: (let ((.cse0 (+ v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_8 v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_12))) (and (= |v_ULTIMATE.start_main_#t~ret8.offset_5| |v_ULTIMATE.start___VERIFIER_nondet_String_#res.offset_6|) (= |v_ULTIMATE.start_cstrchr_#in~c_2| |v_ULTIMATE.start_main_#t~nondet9_5|) (<= 1 .cse0) (= |v_ULTIMATE.start_cstrchr_#in~s.base_2| v_ULTIMATE.start_cstrchr_~s.base_15) (<= .cse0 (select |v_#length_12| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_9)) (= v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_9 |v_ULTIMATE.start___VERIFIER_nondet_String_#res.base_6|) (= |v_ULTIMATE.start_main_#t~ret8.base_5| |v_ULTIMATE.start___VERIFIER_nondet_String_#res.base_6|) (= |v_ULTIMATE.start_cstrchr_#in~c_2| v_ULTIMATE.start_cstrchr_~c_6) (= |v_ULTIMATE.start___VERIFIER_nondet_String_#res.offset_6| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_8) (= |v_ULTIMATE.start_cstrchr_#in~s.offset_2| |v_ULTIMATE.start_main_#t~ret8.offset_5|) (= |v_#memory_int_8| (store |v_#memory_int_9| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_9 (store (select |v_#memory_int_9| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_9) (+ v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_8 v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_12 (- 1)) 0))) (= |v_ULTIMATE.start_main_#t~ret8.base_5| |v_ULTIMATE.start_cstrchr_#in~s.base_2|) (= 1 (select |v_#valid_16| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_9)) (= |v_ULTIMATE.start_cstrchr_#in~s.offset_2| v_ULTIMATE.start_cstrchr_~s.offset_12))) InVars {ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_8, #valid=|v_#valid_16|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_#t~nondet9=|v_ULTIMATE.start_main_#t~nondet9_5|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_12, #length=|v_#length_12|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_9} OutVars{ULTIMATE.start_cstrchr_~s.offset=v_ULTIMATE.start_cstrchr_~s.offset_12, ULTIMATE.start_cstrchr_#res.offset=|v_ULTIMATE.start_cstrchr_#res.offset_4|, ULTIMATE.start_cstrchr_#t~ite7.offset=|v_ULTIMATE.start_cstrchr_#t~ite7.offset_6|, ULTIMATE.start_cstrchr_~s.base=v_ULTIMATE.start_cstrchr_~s.base_15, ULTIMATE.start_cstrchr_#t~post5.base=|v_ULTIMATE.start_cstrchr_#t~post5.base_4|, ULTIMATE.start_main_#t~nondet9=|v_ULTIMATE.start_main_#t~nondet9_5|, ULTIMATE.start_cstrchr_#t~ite7.base=|v_ULTIMATE.start_cstrchr_#t~ite7.base_6|, ULTIMATE.start_cstrchr_#in~s.offset=|v_ULTIMATE.start_cstrchr_#in~s.offset_2|, ULTIMATE.start_cstrchr_#t~mem3=|v_ULTIMATE.start_cstrchr_#t~mem3_6|, ULTIMATE.start_cstrchr_#t~mem2=|v_ULTIMATE.start_cstrchr_#t~mem2_6|, ULTIMATE.start_cstrchr_#t~mem6=|v_ULTIMATE.start_cstrchr_#t~mem6_6|, #length=|v_#length_12|, ULTIMATE.start_cstrchr_~c=v_ULTIMATE.start_cstrchr_~c_6, ULTIMATE.start___VERIFIER_nondet_String_#res.base=|v_ULTIMATE.start___VERIFIER_nondet_String_#res.base_6|, ULTIMATE.start___VERIFIER_nondet_String_#res.offset=|v_ULTIMATE.start___VERIFIER_nondet_String_#res.offset_6|, ULTIMATE.start_main_#t~ret8.base=|v_ULTIMATE.start_main_#t~ret8.base_5|, ULTIMATE.start_cstrchr_#res.base=|v_ULTIMATE.start_cstrchr_#res.base_4|, ULTIMATE.start_cstrchr_#in~c=|v_ULTIMATE.start_cstrchr_#in~c_2|, ULTIMATE.start_cstrchr_#t~short4=|v_ULTIMATE.start_cstrchr_#t~short4_10|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_8, #valid=|v_#valid_16|, #memory_int=|v_#memory_int_8|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_12, ULTIMATE.start_cstrchr_#in~s.base=|v_ULTIMATE.start_cstrchr_#in~s.base_2|, ULTIMATE.start_cstrchr_#t~post5.offset=|v_ULTIMATE.start_cstrchr_#t~post5.offset_4|, ULTIMATE.start_main_#t~ret8.offset=|v_ULTIMATE.start_main_#t~ret8.offset_5|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_9} AuxVars[] AssignedVars[ULTIMATE.start_cstrchr_~s.offset, ULTIMATE.start_cstrchr_#res.offset, ULTIMATE.start___VERIFIER_nondet_String_#res.offset, ULTIMATE.start_main_#t~ret8.base, ULTIMATE.start_cstrchr_#t~ite7.offset, ULTIMATE.start_cstrchr_#res.base, ULTIMATE.start_cstrchr_~s.base, ULTIMATE.start_cstrchr_#t~post5.base, ULTIMATE.start_cstrchr_#t~ite7.base, ULTIMATE.start_cstrchr_#in~s.offset, ULTIMATE.start_cstrchr_#in~c, ULTIMATE.start_cstrchr_#t~mem3, ULTIMATE.start_cstrchr_#t~mem2, ULTIMATE.start_cstrchr_#t~short4, ULTIMATE.start_cstrchr_#t~mem6, #memory_int, ULTIMATE.start_cstrchr_~c, ULTIMATE.start___VERIFIER_nondet_String_#res.base, ULTIMATE.start_cstrchr_#in~s.base, ULTIMATE.start_cstrchr_#t~post5.offset, ULTIMATE.start_main_#t~ret8.offset] 53#L29-8 [2020-06-22 03:51:47,922 INFO L796 eck$LassoCheckResult]: Loop: 53#L29-8 [72] L29-8-->L29-1: Formula: (and (<= 0 v_ULTIMATE.start_cstrchr_~s.offset_3) (= (select |v_#valid_7| v_ULTIMATE.start_cstrchr_~s.base_3) 1) (<= (+ v_ULTIMATE.start_cstrchr_~s.offset_3 1) (select |v_#length_5| v_ULTIMATE.start_cstrchr_~s.base_3)) (= (select (select |v_#memory_int_3| v_ULTIMATE.start_cstrchr_~s.base_3) v_ULTIMATE.start_cstrchr_~s.offset_3) |v_ULTIMATE.start_cstrchr_#t~mem2_2|)) InVars {ULTIMATE.start_cstrchr_~s.offset=v_ULTIMATE.start_cstrchr_~s.offset_3, #memory_int=|v_#memory_int_3|, ULTIMATE.start_cstrchr_~s.base=v_ULTIMATE.start_cstrchr_~s.base_3, #length=|v_#length_5|, #valid=|v_#valid_7|} OutVars{ULTIMATE.start_cstrchr_~s.offset=v_ULTIMATE.start_cstrchr_~s.offset_3, ULTIMATE.start_cstrchr_#t~mem2=|v_ULTIMATE.start_cstrchr_#t~mem2_2|, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_3|, ULTIMATE.start_cstrchr_~s.base=v_ULTIMATE.start_cstrchr_~s.base_3, #length=|v_#length_5|} AuxVars[] AssignedVars[ULTIMATE.start_cstrchr_#t~mem2] 54#L29-1 [117] L29-1-->L29-2: Formula: (and (= 0 |v_ULTIMATE.start_cstrchr_#t~mem2_3|) (not |v_ULTIMATE.start_cstrchr_#t~short4_2|)) InVars {ULTIMATE.start_cstrchr_#t~mem2=|v_ULTIMATE.start_cstrchr_#t~mem2_3|} OutVars{ULTIMATE.start_cstrchr_#t~short4=|v_ULTIMATE.start_cstrchr_#t~short4_2|, ULTIMATE.start_cstrchr_#t~mem2=|v_ULTIMATE.start_cstrchr_#t~mem2_3|} AuxVars[] AssignedVars[ULTIMATE.start_cstrchr_#t~short4] 58#L29-2 [65] L29-2-->L29-6: Formula: (not |v_ULTIMATE.start_cstrchr_#t~short4_5|) InVars {ULTIMATE.start_cstrchr_#t~short4=|v_ULTIMATE.start_cstrchr_#t~short4_5|} OutVars{ULTIMATE.start_cstrchr_#t~short4=|v_ULTIMATE.start_cstrchr_#t~short4_5|} AuxVars[] AssignedVars[] 59#L29-6 [78] L29-6-->L29-8: Formula: (and (= v_ULTIMATE.start_cstrchr_~s.offset_7 (+ v_ULTIMATE.start_cstrchr_~s.offset_8 1)) (= v_ULTIMATE.start_cstrchr_~s.base_9 v_ULTIMATE.start_cstrchr_~s.base_10) |v_ULTIMATE.start_cstrchr_#t~short4_9|) InVars {ULTIMATE.start_cstrchr_~s.offset=v_ULTIMATE.start_cstrchr_~s.offset_8, ULTIMATE.start_cstrchr_~s.base=v_ULTIMATE.start_cstrchr_~s.base_10, ULTIMATE.start_cstrchr_#t~short4=|v_ULTIMATE.start_cstrchr_#t~short4_9|} OutVars{ULTIMATE.start_cstrchr_~s.offset=v_ULTIMATE.start_cstrchr_~s.offset_7, ULTIMATE.start_cstrchr_#t~mem3=|v_ULTIMATE.start_cstrchr_#t~mem3_5|, ULTIMATE.start_cstrchr_#t~mem2=|v_ULTIMATE.start_cstrchr_#t~mem2_5|, ULTIMATE.start_cstrchr_#t~short4=|v_ULTIMATE.start_cstrchr_#t~short4_8|, ULTIMATE.start_cstrchr_#t~post5.base=|v_ULTIMATE.start_cstrchr_#t~post5.base_2|, ULTIMATE.start_cstrchr_~s.base=v_ULTIMATE.start_cstrchr_~s.base_9, ULTIMATE.start_cstrchr_#t~post5.offset=|v_ULTIMATE.start_cstrchr_#t~post5.offset_2|} AuxVars[] AssignedVars[ULTIMATE.start_cstrchr_~s.offset, ULTIMATE.start_cstrchr_#t~mem3, ULTIMATE.start_cstrchr_#t~mem2, ULTIMATE.start_cstrchr_#t~short4, ULTIMATE.start_cstrchr_#t~post5.base, ULTIMATE.start_cstrchr_~s.base, ULTIMATE.start_cstrchr_#t~post5.offset] 53#L29-8 [2020-06-22 03:51:47,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 03:51:47,923 INFO L82 PathProgramCache]: Analyzing trace with hash 5050503, now seen corresponding path program 2 times [2020-06-22 03:51:47,923 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 03:51:47,923 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 03:51:47,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 03:51:47,924 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 03:51:47,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 03:51:47,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 03:51:47,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 03:51:47,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 03:51:47,937 INFO L82 PathProgramCache]: Analyzing trace with hash 3183003, now seen corresponding path program 1 times [2020-06-22 03:51:47,937 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 03:51:47,937 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 03:51:47,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 03:51:47,938 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 03:51:47,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 03:51:47,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:51:47,945 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 03:51:47,945 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 03:51:47,945 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 03:51:47,945 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-06-22 03:51:47,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 03:51:47,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 03:51:47,946 INFO L87 Difference]: Start difference. First operand 11 states and 24 transitions. cyclomatic complexity: 14 Second operand 3 states. [2020-06-22 03:51:47,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 03:51:47,983 INFO L93 Difference]: Finished difference Result 12 states and 23 transitions. [2020-06-22 03:51:47,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 03:51:47,984 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 23 transitions. [2020-06-22 03:51:47,984 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2020-06-22 03:51:47,985 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 10 states and 19 transitions. [2020-06-22 03:51:47,985 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2020-06-22 03:51:47,985 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2020-06-22 03:51:47,985 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 19 transitions. [2020-06-22 03:51:47,985 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 03:51:47,985 INFO L706 BuchiCegarLoop]: Abstraction has 10 states and 19 transitions. [2020-06-22 03:51:47,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 19 transitions. [2020-06-22 03:51:47,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2020-06-22 03:51:47,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-06-22 03:51:47,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 19 transitions. [2020-06-22 03:51:47,987 INFO L729 BuchiCegarLoop]: Abstraction has 10 states and 19 transitions. [2020-06-22 03:51:47,987 INFO L609 BuchiCegarLoop]: Abstraction has 10 states and 19 transitions. [2020-06-22 03:51:47,987 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2020-06-22 03:51:47,987 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 19 transitions. [2020-06-22 03:51:47,988 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2020-06-22 03:51:47,988 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 03:51:47,988 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 03:51:47,989 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-06-22 03:51:47,989 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2020-06-22 03:51:47,989 INFO L794 eck$LassoCheckResult]: Stem: 84#ULTIMATE.startENTRY [136] ULTIMATE.startENTRY-->L12: Formula: (and (= |v_#valid_13| (store |v_#valid_14| 0 0)) (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|)) InVars {#valid=|v_#valid_14|} OutVars{ULTIMATE.start___VERIFIER_nondet_String_#res.offset=|v_ULTIMATE.start___VERIFIER_nondet_String_#res.offset_4|, ULTIMATE.start_main_#t~ret8.base=|v_ULTIMATE.start_main_#t~ret8.base_4|, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset_3|, ULTIMATE.start_main_#t~nondet9=|v_ULTIMATE.start_main_#t~nondet9_4|, #NULL.offset=|v_#NULL.offset_2|, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~ret10.base=|v_ULTIMATE.start_main_#t~ret10.base_4|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_6, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, #valid=|v_#valid_13|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_10, ULTIMATE.start___VERIFIER_nondet_String_#t~nondet0=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~nondet0_6|, ULTIMATE.start___VERIFIER_nondet_String_#res.base=|v_ULTIMATE.start___VERIFIER_nondet_String_#res.base_4|, ULTIMATE.start_main_#t~ret8.offset=|v_ULTIMATE.start_main_#t~ret8.offset_4|, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_3|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_7, ULTIMATE.start_main_#t~ret10.offset=|v_ULTIMATE.start_main_#t~ret10.offset_4|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_nondet_String_#res.offset, ULTIMATE.start_main_#t~ret8.base, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset, ULTIMATE.start_main_#t~nondet9, #NULL.offset, #NULL.base, ULTIMATE.start_main_#t~ret10.base, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset, ULTIMATE.start_main_#res, #valid, ULTIMATE.start___VERIFIER_nondet_String_~length~0, ULTIMATE.start___VERIFIER_nondet_String_#t~nondet0, ULTIMATE.start___VERIFIER_nondet_String_#res.base, ULTIMATE.start_main_#t~ret8.offset, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base, ULTIMATE.start_main_#t~ret10.offset] 85#L12 [75] L12-->L12-2: Formula: (and (< v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_5 1) (= v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_4 1)) InVars {ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_5} OutVars{ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_4} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_nondet_String_~length~0] 78#L12-2 [103] L12-2-->L16: Formula: (and (= (store |v_#length_2| |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_2| v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_7) |v_#length_1|) (= v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_2 |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_2|) (< 0 |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_2|) (= (select |v_#valid_4| |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_2|) 0) (= v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_2 |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset_2|) (= 0 |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset_2|) (= |v_#valid_3| (store |v_#valid_4| |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_2| 1)) (< |v_#StackHeapBarrier_1| |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_2|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_7, #length=|v_#length_2|, #valid=|v_#valid_4|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset_2|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_2, #valid=|v_#valid_3|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_7, #length=|v_#length_1|, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_2|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_2} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset, #valid, #length, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base] 79#L16 [138] L16-->L29-8: Formula: (let ((.cse0 (+ v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_8 v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_12))) (and (= |v_ULTIMATE.start_main_#t~ret8.offset_5| |v_ULTIMATE.start___VERIFIER_nondet_String_#res.offset_6|) (= |v_ULTIMATE.start_cstrchr_#in~c_2| |v_ULTIMATE.start_main_#t~nondet9_5|) (<= 1 .cse0) (= |v_ULTIMATE.start_cstrchr_#in~s.base_2| v_ULTIMATE.start_cstrchr_~s.base_15) (<= .cse0 (select |v_#length_12| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_9)) (= v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_9 |v_ULTIMATE.start___VERIFIER_nondet_String_#res.base_6|) (= |v_ULTIMATE.start_main_#t~ret8.base_5| |v_ULTIMATE.start___VERIFIER_nondet_String_#res.base_6|) (= |v_ULTIMATE.start_cstrchr_#in~c_2| v_ULTIMATE.start_cstrchr_~c_6) (= |v_ULTIMATE.start___VERIFIER_nondet_String_#res.offset_6| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_8) (= |v_ULTIMATE.start_cstrchr_#in~s.offset_2| |v_ULTIMATE.start_main_#t~ret8.offset_5|) (= |v_#memory_int_8| (store |v_#memory_int_9| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_9 (store (select |v_#memory_int_9| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_9) (+ v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_8 v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_12 (- 1)) 0))) (= |v_ULTIMATE.start_main_#t~ret8.base_5| |v_ULTIMATE.start_cstrchr_#in~s.base_2|) (= 1 (select |v_#valid_16| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_9)) (= |v_ULTIMATE.start_cstrchr_#in~s.offset_2| v_ULTIMATE.start_cstrchr_~s.offset_12))) InVars {ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_8, #valid=|v_#valid_16|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_#t~nondet9=|v_ULTIMATE.start_main_#t~nondet9_5|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_12, #length=|v_#length_12|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_9} OutVars{ULTIMATE.start_cstrchr_~s.offset=v_ULTIMATE.start_cstrchr_~s.offset_12, ULTIMATE.start_cstrchr_#res.offset=|v_ULTIMATE.start_cstrchr_#res.offset_4|, ULTIMATE.start_cstrchr_#t~ite7.offset=|v_ULTIMATE.start_cstrchr_#t~ite7.offset_6|, ULTIMATE.start_cstrchr_~s.base=v_ULTIMATE.start_cstrchr_~s.base_15, ULTIMATE.start_cstrchr_#t~post5.base=|v_ULTIMATE.start_cstrchr_#t~post5.base_4|, ULTIMATE.start_main_#t~nondet9=|v_ULTIMATE.start_main_#t~nondet9_5|, ULTIMATE.start_cstrchr_#t~ite7.base=|v_ULTIMATE.start_cstrchr_#t~ite7.base_6|, ULTIMATE.start_cstrchr_#in~s.offset=|v_ULTIMATE.start_cstrchr_#in~s.offset_2|, ULTIMATE.start_cstrchr_#t~mem3=|v_ULTIMATE.start_cstrchr_#t~mem3_6|, ULTIMATE.start_cstrchr_#t~mem2=|v_ULTIMATE.start_cstrchr_#t~mem2_6|, ULTIMATE.start_cstrchr_#t~mem6=|v_ULTIMATE.start_cstrchr_#t~mem6_6|, #length=|v_#length_12|, ULTIMATE.start_cstrchr_~c=v_ULTIMATE.start_cstrchr_~c_6, ULTIMATE.start___VERIFIER_nondet_String_#res.base=|v_ULTIMATE.start___VERIFIER_nondet_String_#res.base_6|, ULTIMATE.start___VERIFIER_nondet_String_#res.offset=|v_ULTIMATE.start___VERIFIER_nondet_String_#res.offset_6|, ULTIMATE.start_main_#t~ret8.base=|v_ULTIMATE.start_main_#t~ret8.base_5|, ULTIMATE.start_cstrchr_#res.base=|v_ULTIMATE.start_cstrchr_#res.base_4|, ULTIMATE.start_cstrchr_#in~c=|v_ULTIMATE.start_cstrchr_#in~c_2|, ULTIMATE.start_cstrchr_#t~short4=|v_ULTIMATE.start_cstrchr_#t~short4_10|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_8, #valid=|v_#valid_16|, #memory_int=|v_#memory_int_8|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_12, ULTIMATE.start_cstrchr_#in~s.base=|v_ULTIMATE.start_cstrchr_#in~s.base_2|, ULTIMATE.start_cstrchr_#t~post5.offset=|v_ULTIMATE.start_cstrchr_#t~post5.offset_4|, ULTIMATE.start_main_#t~ret8.offset=|v_ULTIMATE.start_main_#t~ret8.offset_5|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_9} AuxVars[] AssignedVars[ULTIMATE.start_cstrchr_~s.offset, ULTIMATE.start_cstrchr_#res.offset, ULTIMATE.start___VERIFIER_nondet_String_#res.offset, ULTIMATE.start_main_#t~ret8.base, ULTIMATE.start_cstrchr_#t~ite7.offset, ULTIMATE.start_cstrchr_#res.base, ULTIMATE.start_cstrchr_~s.base, ULTIMATE.start_cstrchr_#t~post5.base, ULTIMATE.start_cstrchr_#t~ite7.base, ULTIMATE.start_cstrchr_#in~s.offset, ULTIMATE.start_cstrchr_#in~c, ULTIMATE.start_cstrchr_#t~mem3, ULTIMATE.start_cstrchr_#t~mem2, ULTIMATE.start_cstrchr_#t~short4, ULTIMATE.start_cstrchr_#t~mem6, #memory_int, ULTIMATE.start_cstrchr_~c, ULTIMATE.start___VERIFIER_nondet_String_#res.base, ULTIMATE.start_cstrchr_#in~s.base, ULTIMATE.start_cstrchr_#t~post5.offset, ULTIMATE.start_main_#t~ret8.offset] 82#L29-8 [2020-06-22 03:51:47,998 INFO L796 eck$LassoCheckResult]: Loop: 82#L29-8 [72] L29-8-->L29-1: Formula: (and (<= 0 v_ULTIMATE.start_cstrchr_~s.offset_3) (= (select |v_#valid_7| v_ULTIMATE.start_cstrchr_~s.base_3) 1) (<= (+ v_ULTIMATE.start_cstrchr_~s.offset_3 1) (select |v_#length_5| v_ULTIMATE.start_cstrchr_~s.base_3)) (= (select (select |v_#memory_int_3| v_ULTIMATE.start_cstrchr_~s.base_3) v_ULTIMATE.start_cstrchr_~s.offset_3) |v_ULTIMATE.start_cstrchr_#t~mem2_2|)) InVars {ULTIMATE.start_cstrchr_~s.offset=v_ULTIMATE.start_cstrchr_~s.offset_3, #memory_int=|v_#memory_int_3|, ULTIMATE.start_cstrchr_~s.base=v_ULTIMATE.start_cstrchr_~s.base_3, #length=|v_#length_5|, #valid=|v_#valid_7|} OutVars{ULTIMATE.start_cstrchr_~s.offset=v_ULTIMATE.start_cstrchr_~s.offset_3, ULTIMATE.start_cstrchr_#t~mem2=|v_ULTIMATE.start_cstrchr_#t~mem2_2|, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_3|, ULTIMATE.start_cstrchr_~s.base=v_ULTIMATE.start_cstrchr_~s.base_3, #length=|v_#length_5|} AuxVars[] AssignedVars[ULTIMATE.start_cstrchr_#t~mem2] 83#L29-1 [116] L29-1-->L29-2: Formula: (and |v_ULTIMATE.start_cstrchr_#t~short4_2| (< 0 |v_ULTIMATE.start_cstrchr_#t~mem2_3|)) InVars {ULTIMATE.start_cstrchr_#t~mem2=|v_ULTIMATE.start_cstrchr_#t~mem2_3|} OutVars{ULTIMATE.start_cstrchr_#t~short4=|v_ULTIMATE.start_cstrchr_#t~short4_2|, ULTIMATE.start_cstrchr_#t~mem2=|v_ULTIMATE.start_cstrchr_#t~mem2_3|} AuxVars[] AssignedVars[ULTIMATE.start_cstrchr_#t~short4] 86#L29-2 [64] L29-2-->L29-3: Formula: |v_ULTIMATE.start_cstrchr_#t~short4_3| InVars {ULTIMATE.start_cstrchr_#t~short4=|v_ULTIMATE.start_cstrchr_#t~short4_3|} OutVars{ULTIMATE.start_cstrchr_#t~short4=|v_ULTIMATE.start_cstrchr_#t~short4_3|} AuxVars[] AssignedVars[] 80#L29-3 [58] L29-3-->L29-4: Formula: (and (= (select (select |v_#memory_int_4| v_ULTIMATE.start_cstrchr_~s.base_6) v_ULTIMATE.start_cstrchr_~s.offset_5) |v_ULTIMATE.start_cstrchr_#t~mem3_2|) (<= (+ v_ULTIMATE.start_cstrchr_~s.offset_5 1) (select |v_#length_7| v_ULTIMATE.start_cstrchr_~s.base_6)) (<= 0 v_ULTIMATE.start_cstrchr_~s.offset_5) (= (select |v_#valid_9| v_ULTIMATE.start_cstrchr_~s.base_6) 1)) InVars {ULTIMATE.start_cstrchr_~s.offset=v_ULTIMATE.start_cstrchr_~s.offset_5, #memory_int=|v_#memory_int_4|, ULTIMATE.start_cstrchr_~s.base=v_ULTIMATE.start_cstrchr_~s.base_6, #length=|v_#length_7|, #valid=|v_#valid_9|} OutVars{ULTIMATE.start_cstrchr_#t~mem3=|v_ULTIMATE.start_cstrchr_#t~mem3_2|, ULTIMATE.start_cstrchr_~s.offset=v_ULTIMATE.start_cstrchr_~s.offset_5, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_4|, ULTIMATE.start_cstrchr_~s.base=v_ULTIMATE.start_cstrchr_~s.base_6, #length=|v_#length_7|} AuxVars[] AssignedVars[ULTIMATE.start_cstrchr_#t~mem3] 81#L29-4 [129] L29-4-->L29-6: Formula: (let ((.cse0 (mod v_ULTIMATE.start_cstrchr_~c_3 256))) (and (> .cse0 |v_ULTIMATE.start_cstrchr_#t~mem3_3|) |v_ULTIMATE.start_cstrchr_#t~short4_4| (<= .cse0 127))) InVars {ULTIMATE.start_cstrchr_#t~mem3=|v_ULTIMATE.start_cstrchr_#t~mem3_3|, ULTIMATE.start_cstrchr_~c=v_ULTIMATE.start_cstrchr_~c_3} OutVars{ULTIMATE.start_cstrchr_#t~mem3=|v_ULTIMATE.start_cstrchr_#t~mem3_3|, ULTIMATE.start_cstrchr_#t~short4=|v_ULTIMATE.start_cstrchr_#t~short4_4|, ULTIMATE.start_cstrchr_~c=v_ULTIMATE.start_cstrchr_~c_3} AuxVars[] AssignedVars[ULTIMATE.start_cstrchr_#t~short4] 87#L29-6 [78] L29-6-->L29-8: Formula: (and (= v_ULTIMATE.start_cstrchr_~s.offset_7 (+ v_ULTIMATE.start_cstrchr_~s.offset_8 1)) (= v_ULTIMATE.start_cstrchr_~s.base_9 v_ULTIMATE.start_cstrchr_~s.base_10) |v_ULTIMATE.start_cstrchr_#t~short4_9|) InVars {ULTIMATE.start_cstrchr_~s.offset=v_ULTIMATE.start_cstrchr_~s.offset_8, ULTIMATE.start_cstrchr_~s.base=v_ULTIMATE.start_cstrchr_~s.base_10, ULTIMATE.start_cstrchr_#t~short4=|v_ULTIMATE.start_cstrchr_#t~short4_9|} OutVars{ULTIMATE.start_cstrchr_~s.offset=v_ULTIMATE.start_cstrchr_~s.offset_7, ULTIMATE.start_cstrchr_#t~mem3=|v_ULTIMATE.start_cstrchr_#t~mem3_5|, ULTIMATE.start_cstrchr_#t~mem2=|v_ULTIMATE.start_cstrchr_#t~mem2_5|, ULTIMATE.start_cstrchr_#t~short4=|v_ULTIMATE.start_cstrchr_#t~short4_8|, ULTIMATE.start_cstrchr_#t~post5.base=|v_ULTIMATE.start_cstrchr_#t~post5.base_2|, ULTIMATE.start_cstrchr_~s.base=v_ULTIMATE.start_cstrchr_~s.base_9, ULTIMATE.start_cstrchr_#t~post5.offset=|v_ULTIMATE.start_cstrchr_#t~post5.offset_2|} AuxVars[] AssignedVars[ULTIMATE.start_cstrchr_~s.offset, ULTIMATE.start_cstrchr_#t~mem3, ULTIMATE.start_cstrchr_#t~mem2, ULTIMATE.start_cstrchr_#t~short4, ULTIMATE.start_cstrchr_#t~post5.base, ULTIMATE.start_cstrchr_~s.base, ULTIMATE.start_cstrchr_#t~post5.offset] 82#L29-8 [2020-06-22 03:51:47,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 03:51:47,999 INFO L82 PathProgramCache]: Analyzing trace with hash 5050503, now seen corresponding path program 3 times [2020-06-22 03:51:48,000 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 03:51:48,000 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 03:51:48,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 03:51:48,001 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 03:51:48,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 03:51:48,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 03:51:48,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 03:51:48,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 03:51:48,014 INFO L82 PathProgramCache]: Analyzing trace with hash -1237069868, now seen corresponding path program 1 times [2020-06-22 03:51:48,014 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 03:51:48,014 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 03:51:48,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 03:51:48,015 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 03:51:48,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 03:51:48,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 03:51:48,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 03:51:48,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 03:51:48,023 INFO L82 PathProgramCache]: Analyzing trace with hash -1660427302, now seen corresponding path program 1 times [2020-06-22 03:51:48,023 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 03:51:48,023 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 03:51:48,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 03:51:48,024 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 03:51:48,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 03:51:48,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:51:48,090 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 03:51:48,090 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 03:51:48,090 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-06-22 03:51:48,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-06-22 03:51:48,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-06-22 03:51:48,132 INFO L87 Difference]: Start difference. First operand 10 states and 19 transitions. cyclomatic complexity: 10 Second operand 6 states. [2020-06-22 03:51:48,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 03:51:48,203 INFO L93 Difference]: Finished difference Result 14 states and 23 transitions. [2020-06-22 03:51:48,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-06-22 03:51:48,204 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 23 transitions. [2020-06-22 03:51:48,204 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2020-06-22 03:51:48,205 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 10 states and 18 transitions. [2020-06-22 03:51:48,205 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2020-06-22 03:51:48,205 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2020-06-22 03:51:48,205 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 18 transitions. [2020-06-22 03:51:48,205 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 03:51:48,205 INFO L706 BuchiCegarLoop]: Abstraction has 10 states and 18 transitions. [2020-06-22 03:51:48,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 18 transitions. [2020-06-22 03:51:48,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2020-06-22 03:51:48,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-06-22 03:51:48,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 18 transitions. [2020-06-22 03:51:48,207 INFO L729 BuchiCegarLoop]: Abstraction has 10 states and 18 transitions. [2020-06-22 03:51:48,207 INFO L609 BuchiCegarLoop]: Abstraction has 10 states and 18 transitions. [2020-06-22 03:51:48,207 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2020-06-22 03:51:48,207 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 18 transitions. [2020-06-22 03:51:48,207 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2020-06-22 03:51:48,208 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 03:51:48,208 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 03:51:48,208 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-06-22 03:51:48,208 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2020-06-22 03:51:48,209 INFO L794 eck$LassoCheckResult]: Stem: 123#ULTIMATE.startENTRY [136] ULTIMATE.startENTRY-->L12: Formula: (and (= |v_#valid_13| (store |v_#valid_14| 0 0)) (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|)) InVars {#valid=|v_#valid_14|} OutVars{ULTIMATE.start___VERIFIER_nondet_String_#res.offset=|v_ULTIMATE.start___VERIFIER_nondet_String_#res.offset_4|, ULTIMATE.start_main_#t~ret8.base=|v_ULTIMATE.start_main_#t~ret8.base_4|, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset_3|, ULTIMATE.start_main_#t~nondet9=|v_ULTIMATE.start_main_#t~nondet9_4|, #NULL.offset=|v_#NULL.offset_2|, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~ret10.base=|v_ULTIMATE.start_main_#t~ret10.base_4|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_6, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, #valid=|v_#valid_13|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_10, ULTIMATE.start___VERIFIER_nondet_String_#t~nondet0=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~nondet0_6|, ULTIMATE.start___VERIFIER_nondet_String_#res.base=|v_ULTIMATE.start___VERIFIER_nondet_String_#res.base_4|, ULTIMATE.start_main_#t~ret8.offset=|v_ULTIMATE.start_main_#t~ret8.offset_4|, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_3|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_7, ULTIMATE.start_main_#t~ret10.offset=|v_ULTIMATE.start_main_#t~ret10.offset_4|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_nondet_String_#res.offset, ULTIMATE.start_main_#t~ret8.base, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset, ULTIMATE.start_main_#t~nondet9, #NULL.offset, #NULL.base, ULTIMATE.start_main_#t~ret10.base, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset, ULTIMATE.start_main_#res, #valid, ULTIMATE.start___VERIFIER_nondet_String_~length~0, ULTIMATE.start___VERIFIER_nondet_String_#t~nondet0, ULTIMATE.start___VERIFIER_nondet_String_#res.base, ULTIMATE.start_main_#t~ret8.offset, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base, ULTIMATE.start_main_#t~ret10.offset] 124#L12 [89] L12-->L12-2: Formula: (>= v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_6 1) InVars {ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_6} OutVars{ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_6} AuxVars[] AssignedVars[] 119#L12-2 [103] L12-2-->L16: Formula: (and (= (store |v_#length_2| |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_2| v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_7) |v_#length_1|) (= v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_2 |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_2|) (< 0 |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_2|) (= (select |v_#valid_4| |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_2|) 0) (= v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_2 |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset_2|) (= 0 |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset_2|) (= |v_#valid_3| (store |v_#valid_4| |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_2| 1)) (< |v_#StackHeapBarrier_1| |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_2|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_7, #length=|v_#length_2|, #valid=|v_#valid_4|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset_2|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_2, #valid=|v_#valid_3|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_7, #length=|v_#length_1|, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_2|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_2} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset, #valid, #length, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base] 120#L16 [138] L16-->L29-8: Formula: (let ((.cse0 (+ v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_8 v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_12))) (and (= |v_ULTIMATE.start_main_#t~ret8.offset_5| |v_ULTIMATE.start___VERIFIER_nondet_String_#res.offset_6|) (= |v_ULTIMATE.start_cstrchr_#in~c_2| |v_ULTIMATE.start_main_#t~nondet9_5|) (<= 1 .cse0) (= |v_ULTIMATE.start_cstrchr_#in~s.base_2| v_ULTIMATE.start_cstrchr_~s.base_15) (<= .cse0 (select |v_#length_12| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_9)) (= v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_9 |v_ULTIMATE.start___VERIFIER_nondet_String_#res.base_6|) (= |v_ULTIMATE.start_main_#t~ret8.base_5| |v_ULTIMATE.start___VERIFIER_nondet_String_#res.base_6|) (= |v_ULTIMATE.start_cstrchr_#in~c_2| v_ULTIMATE.start_cstrchr_~c_6) (= |v_ULTIMATE.start___VERIFIER_nondet_String_#res.offset_6| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_8) (= |v_ULTIMATE.start_cstrchr_#in~s.offset_2| |v_ULTIMATE.start_main_#t~ret8.offset_5|) (= |v_#memory_int_8| (store |v_#memory_int_9| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_9 (store (select |v_#memory_int_9| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_9) (+ v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_8 v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_12 (- 1)) 0))) (= |v_ULTIMATE.start_main_#t~ret8.base_5| |v_ULTIMATE.start_cstrchr_#in~s.base_2|) (= 1 (select |v_#valid_16| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_9)) (= |v_ULTIMATE.start_cstrchr_#in~s.offset_2| v_ULTIMATE.start_cstrchr_~s.offset_12))) InVars {ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_8, #valid=|v_#valid_16|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_#t~nondet9=|v_ULTIMATE.start_main_#t~nondet9_5|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_12, #length=|v_#length_12|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_9} OutVars{ULTIMATE.start_cstrchr_~s.offset=v_ULTIMATE.start_cstrchr_~s.offset_12, ULTIMATE.start_cstrchr_#res.offset=|v_ULTIMATE.start_cstrchr_#res.offset_4|, ULTIMATE.start_cstrchr_#t~ite7.offset=|v_ULTIMATE.start_cstrchr_#t~ite7.offset_6|, ULTIMATE.start_cstrchr_~s.base=v_ULTIMATE.start_cstrchr_~s.base_15, ULTIMATE.start_cstrchr_#t~post5.base=|v_ULTIMATE.start_cstrchr_#t~post5.base_4|, ULTIMATE.start_main_#t~nondet9=|v_ULTIMATE.start_main_#t~nondet9_5|, ULTIMATE.start_cstrchr_#t~ite7.base=|v_ULTIMATE.start_cstrchr_#t~ite7.base_6|, ULTIMATE.start_cstrchr_#in~s.offset=|v_ULTIMATE.start_cstrchr_#in~s.offset_2|, ULTIMATE.start_cstrchr_#t~mem3=|v_ULTIMATE.start_cstrchr_#t~mem3_6|, ULTIMATE.start_cstrchr_#t~mem2=|v_ULTIMATE.start_cstrchr_#t~mem2_6|, ULTIMATE.start_cstrchr_#t~mem6=|v_ULTIMATE.start_cstrchr_#t~mem6_6|, #length=|v_#length_12|, ULTIMATE.start_cstrchr_~c=v_ULTIMATE.start_cstrchr_~c_6, ULTIMATE.start___VERIFIER_nondet_String_#res.base=|v_ULTIMATE.start___VERIFIER_nondet_String_#res.base_6|, ULTIMATE.start___VERIFIER_nondet_String_#res.offset=|v_ULTIMATE.start___VERIFIER_nondet_String_#res.offset_6|, ULTIMATE.start_main_#t~ret8.base=|v_ULTIMATE.start_main_#t~ret8.base_5|, ULTIMATE.start_cstrchr_#res.base=|v_ULTIMATE.start_cstrchr_#res.base_4|, ULTIMATE.start_cstrchr_#in~c=|v_ULTIMATE.start_cstrchr_#in~c_2|, ULTIMATE.start_cstrchr_#t~short4=|v_ULTIMATE.start_cstrchr_#t~short4_10|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_8, #valid=|v_#valid_16|, #memory_int=|v_#memory_int_8|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_12, ULTIMATE.start_cstrchr_#in~s.base=|v_ULTIMATE.start_cstrchr_#in~s.base_2|, ULTIMATE.start_cstrchr_#t~post5.offset=|v_ULTIMATE.start_cstrchr_#t~post5.offset_4|, ULTIMATE.start_main_#t~ret8.offset=|v_ULTIMATE.start_main_#t~ret8.offset_5|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_9} AuxVars[] AssignedVars[ULTIMATE.start_cstrchr_~s.offset, ULTIMATE.start_cstrchr_#res.offset, ULTIMATE.start___VERIFIER_nondet_String_#res.offset, ULTIMATE.start_main_#t~ret8.base, ULTIMATE.start_cstrchr_#t~ite7.offset, ULTIMATE.start_cstrchr_#res.base, ULTIMATE.start_cstrchr_~s.base, ULTIMATE.start_cstrchr_#t~post5.base, ULTIMATE.start_cstrchr_#t~ite7.base, ULTIMATE.start_cstrchr_#in~s.offset, ULTIMATE.start_cstrchr_#in~c, ULTIMATE.start_cstrchr_#t~mem3, ULTIMATE.start_cstrchr_#t~mem2, ULTIMATE.start_cstrchr_#t~short4, ULTIMATE.start_cstrchr_#t~mem6, #memory_int, ULTIMATE.start_cstrchr_~c, ULTIMATE.start___VERIFIER_nondet_String_#res.base, ULTIMATE.start_cstrchr_#in~s.base, ULTIMATE.start_cstrchr_#t~post5.offset, ULTIMATE.start_main_#t~ret8.offset] 121#L29-8 [2020-06-22 03:51:48,209 INFO L796 eck$LassoCheckResult]: Loop: 121#L29-8 [72] L29-8-->L29-1: Formula: (and (<= 0 v_ULTIMATE.start_cstrchr_~s.offset_3) (= (select |v_#valid_7| v_ULTIMATE.start_cstrchr_~s.base_3) 1) (<= (+ v_ULTIMATE.start_cstrchr_~s.offset_3 1) (select |v_#length_5| v_ULTIMATE.start_cstrchr_~s.base_3)) (= (select (select |v_#memory_int_3| v_ULTIMATE.start_cstrchr_~s.base_3) v_ULTIMATE.start_cstrchr_~s.offset_3) |v_ULTIMATE.start_cstrchr_#t~mem2_2|)) InVars {ULTIMATE.start_cstrchr_~s.offset=v_ULTIMATE.start_cstrchr_~s.offset_3, #memory_int=|v_#memory_int_3|, ULTIMATE.start_cstrchr_~s.base=v_ULTIMATE.start_cstrchr_~s.base_3, #length=|v_#length_5|, #valid=|v_#valid_7|} OutVars{ULTIMATE.start_cstrchr_~s.offset=v_ULTIMATE.start_cstrchr_~s.offset_3, ULTIMATE.start_cstrchr_#t~mem2=|v_ULTIMATE.start_cstrchr_#t~mem2_2|, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_3|, ULTIMATE.start_cstrchr_~s.base=v_ULTIMATE.start_cstrchr_~s.base_3, #length=|v_#length_5|} AuxVars[] AssignedVars[ULTIMATE.start_cstrchr_#t~mem2] 122#L29-1 [116] L29-1-->L29-2: Formula: (and |v_ULTIMATE.start_cstrchr_#t~short4_2| (< 0 |v_ULTIMATE.start_cstrchr_#t~mem2_3|)) InVars {ULTIMATE.start_cstrchr_#t~mem2=|v_ULTIMATE.start_cstrchr_#t~mem2_3|} OutVars{ULTIMATE.start_cstrchr_#t~short4=|v_ULTIMATE.start_cstrchr_#t~short4_2|, ULTIMATE.start_cstrchr_#t~mem2=|v_ULTIMATE.start_cstrchr_#t~mem2_3|} AuxVars[] AssignedVars[ULTIMATE.start_cstrchr_#t~short4] 125#L29-2 [64] L29-2-->L29-3: Formula: |v_ULTIMATE.start_cstrchr_#t~short4_3| InVars {ULTIMATE.start_cstrchr_#t~short4=|v_ULTIMATE.start_cstrchr_#t~short4_3|} OutVars{ULTIMATE.start_cstrchr_#t~short4=|v_ULTIMATE.start_cstrchr_#t~short4_3|} AuxVars[] AssignedVars[] 117#L29-3 [58] L29-3-->L29-4: Formula: (and (= (select (select |v_#memory_int_4| v_ULTIMATE.start_cstrchr_~s.base_6) v_ULTIMATE.start_cstrchr_~s.offset_5) |v_ULTIMATE.start_cstrchr_#t~mem3_2|) (<= (+ v_ULTIMATE.start_cstrchr_~s.offset_5 1) (select |v_#length_7| v_ULTIMATE.start_cstrchr_~s.base_6)) (<= 0 v_ULTIMATE.start_cstrchr_~s.offset_5) (= (select |v_#valid_9| v_ULTIMATE.start_cstrchr_~s.base_6) 1)) InVars {ULTIMATE.start_cstrchr_~s.offset=v_ULTIMATE.start_cstrchr_~s.offset_5, #memory_int=|v_#memory_int_4|, ULTIMATE.start_cstrchr_~s.base=v_ULTIMATE.start_cstrchr_~s.base_6, #length=|v_#length_7|, #valid=|v_#valid_9|} OutVars{ULTIMATE.start_cstrchr_#t~mem3=|v_ULTIMATE.start_cstrchr_#t~mem3_2|, ULTIMATE.start_cstrchr_~s.offset=v_ULTIMATE.start_cstrchr_~s.offset_5, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_4|, ULTIMATE.start_cstrchr_~s.base=v_ULTIMATE.start_cstrchr_~s.base_6, #length=|v_#length_7|} AuxVars[] AssignedVars[ULTIMATE.start_cstrchr_#t~mem3] 118#L29-4 [129] L29-4-->L29-6: Formula: (let ((.cse0 (mod v_ULTIMATE.start_cstrchr_~c_3 256))) (and (> .cse0 |v_ULTIMATE.start_cstrchr_#t~mem3_3|) |v_ULTIMATE.start_cstrchr_#t~short4_4| (<= .cse0 127))) InVars {ULTIMATE.start_cstrchr_#t~mem3=|v_ULTIMATE.start_cstrchr_#t~mem3_3|, ULTIMATE.start_cstrchr_~c=v_ULTIMATE.start_cstrchr_~c_3} OutVars{ULTIMATE.start_cstrchr_#t~mem3=|v_ULTIMATE.start_cstrchr_#t~mem3_3|, ULTIMATE.start_cstrchr_#t~short4=|v_ULTIMATE.start_cstrchr_#t~short4_4|, ULTIMATE.start_cstrchr_~c=v_ULTIMATE.start_cstrchr_~c_3} AuxVars[] AssignedVars[ULTIMATE.start_cstrchr_#t~short4] 126#L29-6 [78] L29-6-->L29-8: Formula: (and (= v_ULTIMATE.start_cstrchr_~s.offset_7 (+ v_ULTIMATE.start_cstrchr_~s.offset_8 1)) (= v_ULTIMATE.start_cstrchr_~s.base_9 v_ULTIMATE.start_cstrchr_~s.base_10) |v_ULTIMATE.start_cstrchr_#t~short4_9|) InVars {ULTIMATE.start_cstrchr_~s.offset=v_ULTIMATE.start_cstrchr_~s.offset_8, ULTIMATE.start_cstrchr_~s.base=v_ULTIMATE.start_cstrchr_~s.base_10, ULTIMATE.start_cstrchr_#t~short4=|v_ULTIMATE.start_cstrchr_#t~short4_9|} OutVars{ULTIMATE.start_cstrchr_~s.offset=v_ULTIMATE.start_cstrchr_~s.offset_7, ULTIMATE.start_cstrchr_#t~mem3=|v_ULTIMATE.start_cstrchr_#t~mem3_5|, ULTIMATE.start_cstrchr_#t~mem2=|v_ULTIMATE.start_cstrchr_#t~mem2_5|, ULTIMATE.start_cstrchr_#t~short4=|v_ULTIMATE.start_cstrchr_#t~short4_8|, ULTIMATE.start_cstrchr_#t~post5.base=|v_ULTIMATE.start_cstrchr_#t~post5.base_2|, ULTIMATE.start_cstrchr_~s.base=v_ULTIMATE.start_cstrchr_~s.base_9, ULTIMATE.start_cstrchr_#t~post5.offset=|v_ULTIMATE.start_cstrchr_#t~post5.offset_2|} AuxVars[] AssignedVars[ULTIMATE.start_cstrchr_~s.offset, ULTIMATE.start_cstrchr_#t~mem3, ULTIMATE.start_cstrchr_#t~mem2, ULTIMATE.start_cstrchr_#t~short4, ULTIMATE.start_cstrchr_#t~post5.base, ULTIMATE.start_cstrchr_~s.base, ULTIMATE.start_cstrchr_#t~post5.offset] 121#L29-8 [2020-06-22 03:51:48,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 03:51:48,209 INFO L82 PathProgramCache]: Analyzing trace with hash 5063957, now seen corresponding path program 1 times [2020-06-22 03:51:48,209 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 03:51:48,210 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 03:51:48,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 03:51:48,211 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 03:51:48,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 03:51:48,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 03:51:48,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 03:51:48,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 03:51:48,221 INFO L82 PathProgramCache]: Analyzing trace with hash -1237069868, now seen corresponding path program 2 times [2020-06-22 03:51:48,221 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 03:51:48,221 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 03:51:48,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 03:51:48,222 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 03:51:48,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 03:51:48,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 03:51:48,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 03:51:48,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 03:51:48,229 INFO L82 PathProgramCache]: Analyzing trace with hash -1194986008, now seen corresponding path program 1 times [2020-06-22 03:51:48,229 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 03:51:48,229 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 03:51:48,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 03:51:48,230 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 03:51:48,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 03:51:48,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 03:51:48,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 03:51:48,412 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 61 [2020-06-22 03:51:48,486 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 03:51:48,487 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 03:51:48,487 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 03:51:48,487 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 03:51:48,487 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 03:51:48,487 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 03:51:48,488 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 03:51:48,488 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 03:51:48,488 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration4_Lasso [2020-06-22 03:51:48,488 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 03:51:48,488 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 03:51:48,503 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 03:51:48,508 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 03:51:48,510 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 03:51:48,512 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 03:51:48,514 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 03:51:48,515 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 03:51:48,517 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 03:51:48,518 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 03:51:48,691 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 03:51:48,693 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 03:51:48,695 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 03:51:48,696 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 03:51:48,698 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 03:51:48,699 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 03:51:48,701 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 03:51:48,702 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 03:51:48,704 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 03:51:48,985 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 03:51:48,991 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 03:51:48,993 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 03:51:48,994 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 03:51:48,995 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 03:51:48,995 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 03:51:48,995 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 03:51:48,995 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 03:51:48,997 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 03:51:48,998 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 03:51:49,000 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 03:51:49,000 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 03:51:49,001 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 03:51:49,001 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 03:51:49,001 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 03:51:49,001 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 03:51:49,003 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 03:51:49,003 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 03:51:49,006 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 03:51:49,006 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 03:51:49,007 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 03:51:49,007 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 03:51:49,007 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 03:51:49,007 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 03:51:49,007 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 03:51:49,008 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 03:51:49,008 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 03:51:49,008 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 03:51:49,009 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 03:51:49,009 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 03:51:49,009 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 03:51:49,009 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 03:51:49,009 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 03:51:49,010 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 03:51:49,010 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 03:51:49,010 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 03:51:49,011 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 03:51:49,011 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 03:51:49,011 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 03:51:49,011 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 03:51:49,012 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 03:51:49,012 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 03:51:49,012 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 03:51:49,012 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 03:51:49,012 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 03:51:49,013 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 03:51:49,013 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 03:51:49,013 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 03:51:49,014 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 03:51:49,014 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 03:51:49,014 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 03:51:49,014 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 03:51:49,014 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 03:51:49,015 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 03:51:49,015 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 03:51:49,015 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 03:51:49,016 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 03:51:49,016 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 03:51:49,016 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 03:51:49,016 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 03:51:49,016 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 03:51:49,017 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 03:51:49,017 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 03:51:49,017 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 03:51:49,018 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 03:51:49,018 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 03:51:49,018 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 03:51:49,018 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 03:51:49,018 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 03:51:49,023 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 03:51:49,024 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 03:51:49,034 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 03:51:49,035 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 03:51:49,035 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 03:51:49,036 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 03:51:49,036 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 03:51:49,036 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 03:51:49,041 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 03:51:49,041 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 03:51:49,065 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 03:51:49,091 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2020-06-22 03:51:49,091 INFO L444 ModelExtractionUtils]: 24 out of 31 variables were initially zero. Simplification set additionally 4 variables to zero. [2020-06-22 03:51:49,094 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 03:51:49,095 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-06-22 03:51:49,095 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 03:51:49,096 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrchr_~s.offset, v_rep(select #length ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base)_1) = -1*ULTIMATE.start_cstrchr_~s.offset + 1*v_rep(select #length ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base)_1 Supporting invariants [] [2020-06-22 03:51:49,109 INFO L297 tatePredicateManager]: 3 out of 4 supporting invariants were superfluous and have been removed [2020-06-22 03:51:49,112 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 03:51:49,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 03:51:49,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:51:49,152 INFO L256 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 12 conjunts are in the unsatisfiable core [2020-06-22 03:51:49,153 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:51:49,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:51:49,175 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 03:51:49,176 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:51:49,193 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 03:51:49,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 03:51:49,241 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 03:51:49,242 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 03:51:49,300 INFO L98 LoopCannibalizer]: 3 predicates before loop cannibalization 4 predicates after loop cannibalization [2020-06-22 03:51:49,304 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 4 loop predicates [2020-06-22 03:51:49,305 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 10 states and 18 transitions. cyclomatic complexity: 9 Second operand 4 states. [2020-06-22 03:51:49,391 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 10 states and 18 transitions. cyclomatic complexity: 9. Second operand 4 states. Result 16 states and 32 transitions. Complement of second has 5 states. [2020-06-22 03:51:49,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2020-06-22 03:51:49,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-06-22 03:51:49,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 32 transitions. [2020-06-22 03:51:49,394 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 32 transitions. Stem has 4 letters. Loop has 6 letters. [2020-06-22 03:51:49,395 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 03:51:49,395 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 32 transitions. Stem has 10 letters. Loop has 6 letters. [2020-06-22 03:51:49,395 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 03:51:49,395 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 32 transitions. Stem has 4 letters. Loop has 12 letters. [2020-06-22 03:51:49,396 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 03:51:49,401 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 32 transitions. [2020-06-22 03:51:49,402 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-06-22 03:51:49,403 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 0 states and 0 transitions. [2020-06-22 03:51:49,403 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-06-22 03:51:49,403 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-06-22 03:51:49,403 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-06-22 03:51:49,403 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 03:51:49,403 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 03:51:49,403 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 03:51:49,403 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 03:51:49,403 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2020-06-22 03:51:49,403 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-06-22 03:51:49,404 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-06-22 03:51:49,404 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-06-22 03:51:49,410 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 03:51:49 BasicIcfg [2020-06-22 03:51:49,410 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-06-22 03:51:49,410 INFO L168 Benchmark]: Toolchain (without parser) took 6449.77 ms. Allocated memory was 649.6 MB in the beginning and 767.6 MB in the end (delta: 118.0 MB). Free memory was 564.3 MB in the beginning and 452.4 MB in the end (delta: 111.9 MB). Peak memory consumption was 229.9 MB. Max. memory is 50.3 GB. [2020-06-22 03:51:49,411 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 649.6 MB. Free memory is still 585.8 MB. There was no memory consumed. Max. memory is 50.3 GB. [2020-06-22 03:51:49,412 INFO L168 Benchmark]: CACSL2BoogieTranslator took 307.44 ms. Allocated memory was 649.6 MB in the beginning and 672.1 MB in the end (delta: 22.5 MB). Free memory was 564.3 MB in the beginning and 635.5 MB in the end (delta: -71.3 MB). Peak memory consumption was 30.2 MB. Max. memory is 50.3 GB. [2020-06-22 03:51:49,412 INFO L168 Benchmark]: Boogie Procedure Inliner took 39.69 ms. Allocated memory is still 672.1 MB. Free memory was 635.5 MB in the beginning and 632.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 50.3 GB. [2020-06-22 03:51:49,413 INFO L168 Benchmark]: Boogie Preprocessor took 24.96 ms. Allocated memory is still 672.1 MB. Free memory was 632.9 MB in the beginning and 631.5 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. [2020-06-22 03:51:49,413 INFO L168 Benchmark]: RCFGBuilder took 314.42 ms. Allocated memory is still 672.1 MB. Free memory was 631.5 MB in the beginning and 611.8 MB in the end (delta: 19.7 MB). Peak memory consumption was 19.7 MB. Max. memory is 50.3 GB. [2020-06-22 03:51:49,414 INFO L168 Benchmark]: BlockEncodingV2 took 120.48 ms. Allocated memory is still 672.1 MB. Free memory was 611.8 MB in the beginning and 602.4 MB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 50.3 GB. [2020-06-22 03:51:49,414 INFO L168 Benchmark]: TraceAbstraction took 3977.54 ms. Allocated memory was 672.1 MB in the beginning and 742.4 MB in the end (delta: 70.3 MB). Free memory was 602.4 MB in the beginning and 390.8 MB in the end (delta: 211.6 MB). Peak memory consumption was 281.8 MB. Max. memory is 50.3 GB. [2020-06-22 03:51:49,415 INFO L168 Benchmark]: BuchiAutomizer took 1660.01 ms. Allocated memory was 742.4 MB in the beginning and 767.6 MB in the end (delta: 25.2 MB). Free memory was 386.8 MB in the beginning and 452.4 MB in the end (delta: -65.6 MB). There was no memory consumed. Max. memory is 50.3 GB. [2020-06-22 03:51:49,419 INFO L337 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 28 locations, 32 edges - StatisticsResult: Encoded RCFG 19 locations, 42 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 649.6 MB. Free memory is still 585.8 MB. There was no memory consumed. Max. memory is 50.3 GB. * CACSL2BoogieTranslator took 307.44 ms. Allocated memory was 649.6 MB in the beginning and 672.1 MB in the end (delta: 22.5 MB). Free memory was 564.3 MB in the beginning and 635.5 MB in the end (delta: -71.3 MB). Peak memory consumption was 30.2 MB. Max. memory is 50.3 GB. * Boogie Procedure Inliner took 39.69 ms. Allocated memory is still 672.1 MB. Free memory was 635.5 MB in the beginning and 632.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 50.3 GB. * Boogie Preprocessor took 24.96 ms. Allocated memory is still 672.1 MB. Free memory was 632.9 MB in the beginning and 631.5 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. * RCFGBuilder took 314.42 ms. Allocated memory is still 672.1 MB. Free memory was 631.5 MB in the beginning and 611.8 MB in the end (delta: 19.7 MB). Peak memory consumption was 19.7 MB. Max. memory is 50.3 GB. * BlockEncodingV2 took 120.48 ms. Allocated memory is still 672.1 MB. Free memory was 611.8 MB in the beginning and 602.4 MB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 50.3 GB. * TraceAbstraction took 3977.54 ms. Allocated memory was 672.1 MB in the beginning and 742.4 MB in the end (delta: 70.3 MB). Free memory was 602.4 MB in the beginning and 390.8 MB in the end (delta: 211.6 MB). Peak memory consumption was 281.8 MB. Max. memory is 50.3 GB. * BuchiAutomizer took 1660.01 ms. Allocated memory was 742.4 MB in the beginning and 767.6 MB in the end (delta: 25.2 MB). Free memory was 386.8 MB in the beginning and 452.4 MB in the end (delta: -65.6 MB). There was no memory consumed. Max. memory is 50.3 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~length~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~length~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~length~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~length~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~length~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~length~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - 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 #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - 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 #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 29]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 31]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 29]: 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: 31]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 29]: 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: 29]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 8 specifications checked. All of them hold - InvariantResult [Line: 29]: Loop Invariant [2020-06-22 03:51:49,428 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~length~0,QUANTIFIED] [2020-06-22 03:51:49,429 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] [2020-06-22 03:51:49,429 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~length~0,QUANTIFIED] [2020-06-22 03:51:49,429 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~length~0,QUANTIFIED] [2020-06-22 03:51:49,429 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] [2020-06-22 03:51:49,429 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] [2020-06-22 03:51:49,430 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] [2020-06-22 03:51:49,430 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] [2020-06-22 03:51:49,430 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] [2020-06-22 03:51:49,430 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] [2020-06-22 03:51:49,430 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] [2020-06-22 03:51:49,431 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] [2020-06-22 03:51:49,431 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 03:51:49,432 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 03:51:49,432 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 03:51:49,432 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 03:51:49,432 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 03:51:49,432 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 03:51:49,433 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 03:51:49,433 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 03:51:49,433 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 03:51:49,434 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~length~0,QUANTIFIED] [2020-06-22 03:51:49,434 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] [2020-06-22 03:51:49,434 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~length~0,QUANTIFIED] [2020-06-22 03:51:49,434 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~length~0,QUANTIFIED] [2020-06-22 03:51:49,434 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] [2020-06-22 03:51:49,435 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] [2020-06-22 03:51:49,435 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] [2020-06-22 03:51:49,435 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] [2020-06-22 03:51:49,435 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] [2020-06-22 03:51:49,435 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] [2020-06-22 03:51:49,436 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] [2020-06-22 03:51:49,436 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] [2020-06-22 03:51:49,436 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 03:51:49,437 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 03:51:49,437 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 03:51:49,437 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 03:51:49,437 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 03:51:49,437 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 03:51:49,438 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 03:51:49,438 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 03:51:49,438 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: (((((((1 == \valid[s] && 1 <= length) && nondetString == 0) && unknown-#length-unknown[nondetString] == length) && (\exists ULTIMATE.start___VERIFIER_nondet_String_~length~0 : int, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset : int :: ((unknown-#memory_int-unknown[s][ULTIMATE.start___VERIFIER_nondet_String_~length~0 + ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset + -1] == 0 && 1 <= ULTIMATE.start___VERIFIER_nondet_String_~length~0) && ULTIMATE.start___VERIFIER_nondet_String_~length~0 + ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset <= unknown-#length-unknown[s]) && s <= ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset)) && 0 == s) && (\exists ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset : int :: (unknown-#memory_int-unknown[s][ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset + unknown-#length-unknown[s] + -1] == 0 && ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset <= 0) && 0 <= ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset)) && \valid[nondetString] == 1) || (((((((1 <= s && s + 1 <= unknown-#length-unknown[s]) && 1 == \valid[s]) && 1 <= length) && nondetString == 0) && unknown-#length-unknown[nondetString] == length) && (\exists ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset : int :: (unknown-#memory_int-unknown[s][ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset + unknown-#length-unknown[s] + -1] == 0 && ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset <= 0) && 0 <= ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset)) && \valid[nondetString] == 1) - InvariantResult [Line: 16]: Loop Invariant [2020-06-22 03:51:49,439 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 03:51:49,439 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: ((1 <= length && nondetString == 0) && unknown-#length-unknown[nondetString] == length) && \valid[nondetString] == 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 19 locations, 8 error locations. SAFE Result, 3.8s OverallTime, 12 OverallIterations, 3 TraceHistogramMax, 1.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 69 SDtfs, 909 SDslu, 246 SDs, 0 SdLazy, 648 SolverSat, 79 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 137 GetRequests, 66 SyntacticMatches, 5 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=24occurred in iteration=11, 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, 12 MinimizatonAttempts, 19 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 2 LocationsWithAnnotation, 2 PreInvPairs, 5 NumberOfFragments, 140 HoareAnnotationTreeSize, 2 FomulaSimplifications, 140 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 2 FomulaSimplificationsInter, 34 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 169 NumberOfCodeBlocks, 169 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 153 ConstructedInterpolants, 8 QuantifiedInterpolants, 19651 SizeOfPredicates, 32 NumberOfNonLiveVariables, 345 ConjunctsInSsa, 79 ConjunctsInUnsatCore, 16 InterpolantComputations, 9 PerfectInterpolantSequences, 18/64 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available - StatisticsResult: Constructed decomposition of program Your program was decomposed into 4 terminating modules (3 trivial, 0 deterministic, 1 nondeterministic). One nondeterministic module has affine ranking function -1 * s + unknown-#length-unknown[malloc(length * sizeof(char))] and consists of 4 locations. 3 modules have a trivial ranking function, the largest among these consists of 6 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 1.6s and 5 iterations. TraceHistogramMax:1. Analysis of lassos took 1.1s. Construction of modules took 0.1s. Büchi inclusion checks took 0.3s. Highest rank in rank-based complementation 3. Minimization of det autom 4. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 11 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 28 SDtfs, 77 SDslu, 87 SDs, 0 SdLazy, 202 SolverSat, 23 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI2 SFLT0 conc1 concLT0 SILN0 SILU0 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital137 mio100 ax100 hnf100 lsp95 ukn90 mio100 lsp40 div120 bol100 ite100 ukn100 eq162 hnf88 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 5ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! !SESSION 2020-06-22 03:51:39.750 ----------------------------------------------- eclipse.buildId=unknown java.version=1.8.0_242 java.vendor=Oracle Corporation BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox/benchmark/theBenchmark.c Command-line arguments: -os linux -ws gtk -arch x86_64 -consoleLog -data @user.home/.ultimate -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -data /export/starexec/sandbox/tmp -i /export/starexec/sandbox/benchmark/theBenchmark.c !ENTRY org.eclipse.core.resources 2 10035 2020-06-22 03:51:49.673 !MESSAGE The workspace will exit with unsaved changes in this session. Received shutdown request... Ultimate: GTK+ Version Check