YES Ultimate: Cannot open display: This is Ultimate 0.1.24-8dc7c08-m [2020-06-22 02:06:26,937 INFO L170 SettingsManager]: Resetting all preferences to default values... [2020-06-22 02:06:26,939 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2020-06-22 02:06:26,950 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-06-22 02:06:26,951 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-06-22 02:06:26,952 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-06-22 02:06:26,953 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-06-22 02:06:26,955 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2020-06-22 02:06:26,956 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-06-22 02:06:26,957 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-06-22 02:06:26,958 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-06-22 02:06:26,958 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-06-22 02:06:26,959 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-06-22 02:06:26,960 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-06-22 02:06:26,961 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-06-22 02:06:26,961 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-06-22 02:06:26,962 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-06-22 02:06:26,964 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-06-22 02:06:26,966 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2020-06-22 02:06:26,967 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-06-22 02:06:26,968 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-06-22 02:06:26,969 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-06-22 02:06:26,971 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-06-22 02:06:26,972 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-06-22 02:06:26,972 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-06-22 02:06:26,973 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-06-22 02:06:26,973 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-06-22 02:06:26,974 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-06-22 02:06:26,974 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-06-22 02:06:26,975 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-06-22 02:06:26,975 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-06-22 02:06:26,976 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2020-06-22 02:06:26,977 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-06-22 02:06:26,977 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2020-06-22 02:06:26,978 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-06-22 02:06:26,978 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-06-22 02:06:26,978 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2020-06-22 02:06:26,979 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2020-06-22 02:06:26,980 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2020-06-22 02:06:26,980 INFO L98 SettingsManager]: Beginning loading settings from /export/starexec/sandbox2/solver/bin/./../termcomp2017.epf [2020-06-22 02:06:26,995 INFO L110 SettingsManager]: Loading preferences was successful [2020-06-22 02:06:26,995 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2020-06-22 02:06:26,996 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-06-22 02:06:26,996 INFO L133 SettingsManager]: * Rewrite not-equals=true [2020-06-22 02:06:26,996 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2020-06-22 02:06:26,997 INFO L133 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE [2020-06-22 02:06:26,997 INFO L133 SettingsManager]: * Use SBE=true [2020-06-22 02:06:26,997 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-06-22 02:06:26,997 INFO L133 SettingsManager]: * Use old map elimination=false [2020-06-22 02:06:26,997 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2020-06-22 02:06:26,998 INFO L133 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION [2020-06-22 02:06:26,998 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2020-06-22 02:06:26,998 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-06-22 02:06:26,998 INFO L133 SettingsManager]: * Construct termination proof for TermComp=true [2020-06-22 02:06:26,998 INFO L133 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 02:06:26,998 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-06-22 02:06:26,999 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-06-22 02:06:26,999 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2020-06-22 02:06:26,999 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2020-06-22 02:06:26,999 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-06-22 02:06:26,999 INFO L133 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE [2020-06-22 02:06:27,000 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-06-22 02:06:27,000 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-06-22 02:06:27,000 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-06-22 02:06:27,000 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-06-22 02:06:27,000 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-06-22 02:06:27,001 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-06-22 02:06:27,001 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2020-06-22 02:06:27,001 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-06-22 02:06:27,026 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-06-22 02:06:27,041 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-06-22 02:06:27,045 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-06-22 02:06:27,046 INFO L271 PluginConnector]: Initializing CDTParser... [2020-06-22 02:06:27,046 INFO L276 PluginConnector]: CDTParser initialized [2020-06-22 02:06:27,047 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox2/benchmark/theBenchmark.c [2020-06-22 02:06:27,116 INFO L221 CDTParser]: Created temporary CDT project at /export/starexec/sandbox2/tmp/1cd0a1a6443241f0911c4df4033e9294/FLAG2c188558b [2020-06-22 02:06:27,476 INFO L307 CDTParser]: Found 1 translation units. [2020-06-22 02:06:27,477 INFO L161 CDTParser]: Scanning /export/starexec/sandbox2/benchmark/theBenchmark.c [2020-06-22 02:06:27,477 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. [2020-06-22 02:06:27,484 INFO L355 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox2/tmp/1cd0a1a6443241f0911c4df4033e9294/FLAG2c188558b [2020-06-22 02:06:27,870 INFO L363 CDTParser]: Successfully deleted /export/starexec/sandbox2/tmp/1cd0a1a6443241f0911c4df4033e9294 [2020-06-22 02:06:27,882 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-06-22 02:06:27,883 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. [2020-06-22 02:06:27,884 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-06-22 02:06:27,884 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-06-22 02:06:27,888 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2020-06-22 02:06:27,889 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.06 02:06:27" (1/1) ... [2020-06-22 02:06:27,892 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@74035a41 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 02:06:27, skipping insertion in model container [2020-06-22 02:06:27,892 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.06 02:06:27" (1/1) ... [2020-06-22 02:06:27,899 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-06-22 02:06:27,921 INFO L176 MainTranslator]: Built tables and reachable declarations [2020-06-22 02:06:28,141 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-06-22 02:06:28,153 INFO L191 MainTranslator]: Completed pre-run [2020-06-22 02:06:28,172 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-06-22 02:06:28,188 INFO L195 MainTranslator]: Completed translation [2020-06-22 02:06:28,188 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 02:06:28 WrapperNode [2020-06-22 02:06:28,189 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-06-22 02:06:28,189 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-06-22 02:06:28,190 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-06-22 02:06:28,190 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2020-06-22 02:06:28,199 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 02:06:28" (1/1) ... [2020-06-22 02:06:28,209 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 02:06:28" (1/1) ... [2020-06-22 02:06:28,232 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-06-22 02:06:28,233 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-06-22 02:06:28,233 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-06-22 02:06:28,233 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2020-06-22 02:06:28,242 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 02:06:28" (1/1) ... [2020-06-22 02:06:28,242 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 02:06:28" (1/1) ... [2020-06-22 02:06:28,244 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 02:06:28" (1/1) ... [2020-06-22 02:06:28,245 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 02:06:28" (1/1) ... [2020-06-22 02:06:28,251 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 02:06:28" (1/1) ... [2020-06-22 02:06:28,256 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 02:06:28" (1/1) ... [2020-06-22 02:06:28,257 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 02:06:28" (1/1) ... [2020-06-22 02:06:28,259 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-06-22 02:06:28,260 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-06-22 02:06:28,260 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-06-22 02:06:28,260 INFO L276 PluginConnector]: RCFGBuilder initialized [2020-06-22 02:06:28,261 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 02:06:28" (1/1) ... No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-06-22 02:06:28,327 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-06-22 02:06:28,327 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-06-22 02:06:28,327 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-06-22 02:06:28,328 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-06-22 02:06:28,328 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-06-22 02:06:28,610 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-06-22 02:06:28,610 INFO L286 CfgBuilder]: Removed 11 assue(true) statements. [2020-06-22 02:06:28,612 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 02:06:28 BoogieIcfgContainer [2020-06-22 02:06:28,612 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-06-22 02:06:28,612 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- [2020-06-22 02:06:28,612 INFO L271 PluginConnector]: Initializing BlockEncodingV2... [2020-06-22 02:06:28,615 INFO L276 PluginConnector]: BlockEncodingV2 initialized [2020-06-22 02:06:28,615 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 02:06:28" (1/1) ... [2020-06-22 02:06:28,637 INFO L313 BlockEncoder]: Initial Icfg 47 locations, 55 edges [2020-06-22 02:06:28,638 INFO L258 BlockEncoder]: Using Remove infeasible edges [2020-06-22 02:06:28,639 INFO L263 BlockEncoder]: Using Maximize final states [2020-06-22 02:06:28,640 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false [2020-06-22 02:06:28,640 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE [2020-06-22 02:06:28,642 INFO L296 BlockEncoder]: Using Remove sink states [2020-06-22 02:06:28,643 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true [2020-06-22 02:06:28,643 INFO L179 BlockEncoder]: Using Rewrite not-equals [2020-06-22 02:06:28,671 INFO L185 BlockEncoder]: Using Use SBE [2020-06-22 02:06:28,704 INFO L200 BlockEncoder]: SBE split 22 edges [2020-06-22 02:06:28,709 INFO L70 emoveInfeasibleEdges]: Removed 1 edges and 0 locations because of local infeasibility [2020-06-22 02:06:28,711 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-06-22 02:06:28,749 INFO L100 BaseMinimizeStates]: Removed 18 edges and 9 locations by large block encoding [2020-06-22 02:06:28,752 INFO L70 RemoveSinkStates]: Removed 8 edges and 4 locations by removing sink states [2020-06-22 02:06:28,754 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-06-22 02:06:28,754 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-06-22 02:06:28,754 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding [2020-06-22 02:06:28,755 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states [2020-06-22 02:06:28,755 INFO L313 BlockEncoder]: Encoded RCFG 34 locations, 62 edges [2020-06-22 02:06:28,756 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 02:06:28 BasicIcfg [2020-06-22 02:06:28,756 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- [2020-06-22 02:06:28,757 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-06-22 02:06:28,757 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-06-22 02:06:28,760 INFO L276 PluginConnector]: TraceAbstraction initialized [2020-06-22 02:06:28,761 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.06 02:06:27" (1/4) ... [2020-06-22 02:06:28,761 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d78127f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 02:06:28, skipping insertion in model container [2020-06-22 02:06:28,762 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 02:06:28" (2/4) ... [2020-06-22 02:06:28,762 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d78127f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 02:06:28, skipping insertion in model container [2020-06-22 02:06:28,762 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 02:06:28" (3/4) ... [2020-06-22 02:06:28,763 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d78127f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 02:06:28, skipping insertion in model container [2020-06-22 02:06:28,763 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 02:06:28" (4/4) ... [2020-06-22 02:06:28,764 INFO L112 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-06-22 02:06:28,774 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2020-06-22 02:06:28,782 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 14 error locations. [2020-06-22 02:06:28,799 INFO L257 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2020-06-22 02:06:28,827 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2020-06-22 02:06:28,828 INFO L382 AbstractCegarLoop]: Interprodecural is true [2020-06-22 02:06:28,828 INFO L383 AbstractCegarLoop]: Hoare is true [2020-06-22 02:06:28,829 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2020-06-22 02:06:28,829 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-06-22 02:06:28,829 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-06-22 02:06:28,829 INFO L387 AbstractCegarLoop]: Difference is false [2020-06-22 02:06:28,829 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-06-22 02:06:28,829 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-06-22 02:06:28,844 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states. [2020-06-22 02:06:28,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-06-22 02:06:28,850 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 02:06:28,851 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-06-22 02:06:28,851 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION]=== [2020-06-22 02:06:28,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 02:06:28,857 INFO L82 PathProgramCache]: Analyzing trace with hash 7657052, now seen corresponding path program 1 times [2020-06-22 02:06:28,859 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 02:06:28,859 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 02:06:28,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:06:28,911 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 02:06:28,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:06:28,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 02:06:29,018 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 02:06:29,021 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 02:06:29,021 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 02:06:29,025 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 02:06:29,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 02:06:29,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 02:06:29,042 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 3 states. [2020-06-22 02:06:29,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 02:06:29,173 INFO L93 Difference]: Finished difference Result 34 states and 62 transitions. [2020-06-22 02:06:29,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 02:06:29,175 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-06-22 02:06:29,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 02:06:29,188 INFO L225 Difference]: With dead ends: 34 [2020-06-22 02:06:29,189 INFO L226 Difference]: Without dead ends: 32 [2020-06-22 02:06:29,192 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 02:06:29,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2020-06-22 02:06:29,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2020-06-22 02:06:29,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-06-22 02:06:29,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 58 transitions. [2020-06-22 02:06:29,231 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 58 transitions. Word has length 4 [2020-06-22 02:06:29,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 02:06:29,232 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 58 transitions. [2020-06-22 02:06:29,232 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 02:06:29,232 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 58 transitions. [2020-06-22 02:06:29,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-06-22 02:06:29,232 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 02:06:29,232 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-06-22 02:06:29,233 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION]=== [2020-06-22 02:06:29,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 02:06:29,233 INFO L82 PathProgramCache]: Analyzing trace with hash 7657054, now seen corresponding path program 1 times [2020-06-22 02:06:29,233 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 02:06:29,233 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 02:06:29,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:06:29,235 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 02:06:29,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:06:29,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 02:06:29,267 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 02:06:29,267 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 02:06:29,267 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-06-22 02:06:29,269 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-06-22 02:06:29,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-06-22 02:06:29,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-06-22 02:06:29,270 INFO L87 Difference]: Start difference. First operand 32 states and 58 transitions. Second operand 4 states. [2020-06-22 02:06:29,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 02:06:29,351 INFO L93 Difference]: Finished difference Result 34 states and 58 transitions. [2020-06-22 02:06:29,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-06-22 02:06:29,352 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2020-06-22 02:06:29,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 02:06:29,353 INFO L225 Difference]: With dead ends: 34 [2020-06-22 02:06:29,353 INFO L226 Difference]: Without dead ends: 32 [2020-06-22 02:06:29,354 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 02:06:29,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2020-06-22 02:06:29,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2020-06-22 02:06:29,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-06-22 02:06:29,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 56 transitions. [2020-06-22 02:06:29,360 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 56 transitions. Word has length 4 [2020-06-22 02:06:29,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 02:06:29,360 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 56 transitions. [2020-06-22 02:06:29,360 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-06-22 02:06:29,360 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 56 transitions. [2020-06-22 02:06:29,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-06-22 02:06:29,361 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 02:06:29,361 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-06-22 02:06:29,361 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION]=== [2020-06-22 02:06:29,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 02:06:29,361 INFO L82 PathProgramCache]: Analyzing trace with hash 7657055, now seen corresponding path program 1 times [2020-06-22 02:06:29,362 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 02:06:29,362 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 02:06:29,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:06:29,363 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 02:06:29,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:06:29,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 02:06:29,389 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 02:06:29,390 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 02:06:29,390 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 02:06:29,390 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 02:06:29,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 02:06:29,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 02:06:29,391 INFO L87 Difference]: Start difference. First operand 32 states and 56 transitions. Second operand 3 states. [2020-06-22 02:06:29,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 02:06:29,495 INFO L93 Difference]: Finished difference Result 32 states and 56 transitions. [2020-06-22 02:06:29,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 02:06:29,509 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-06-22 02:06:29,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 02:06:29,510 INFO L225 Difference]: With dead ends: 32 [2020-06-22 02:06:29,510 INFO L226 Difference]: Without dead ends: 30 [2020-06-22 02:06:29,511 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 02:06:29,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2020-06-22 02:06:29,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2020-06-22 02:06:29,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-06-22 02:06:29,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 54 transitions. [2020-06-22 02:06:29,516 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 54 transitions. Word has length 4 [2020-06-22 02:06:29,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 02:06:29,516 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 54 transitions. [2020-06-22 02:06:29,516 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 02:06:29,517 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 54 transitions. [2020-06-22 02:06:29,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-06-22 02:06:29,517 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 02:06:29,517 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 02:06:29,517 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION]=== [2020-06-22 02:06:29,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 02:06:29,518 INFO L82 PathProgramCache]: Analyzing trace with hash 773565417, now seen corresponding path program 1 times [2020-06-22 02:06:29,518 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 02:06:29,518 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 02:06:29,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:06:29,519 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 02:06:29,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:06:29,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 02:06:29,558 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 02:06:29,558 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 02:06:29,558 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-06-22 02:06:29,558 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 02:06:29,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 02:06:29,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 02:06:29,559 INFO L87 Difference]: Start difference. First operand 30 states and 54 transitions. Second operand 3 states. [2020-06-22 02:06:29,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 02:06:29,652 INFO L93 Difference]: Finished difference Result 54 states and 101 transitions. [2020-06-22 02:06:29,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 02:06:29,653 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2020-06-22 02:06:29,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 02:06:29,654 INFO L225 Difference]: With dead ends: 54 [2020-06-22 02:06:29,654 INFO L226 Difference]: Without dead ends: 32 [2020-06-22 02:06:29,654 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 02:06:29,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2020-06-22 02:06:29,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2020-06-22 02:06:29,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-06-22 02:06:29,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 56 transitions. [2020-06-22 02:06:29,660 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 56 transitions. Word has length 11 [2020-06-22 02:06:29,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 02:06:29,660 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 56 transitions. [2020-06-22 02:06:29,660 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 02:06:29,661 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 56 transitions. [2020-06-22 02:06:29,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-06-22 02:06:29,661 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 02:06:29,661 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 02:06:29,661 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION]=== [2020-06-22 02:06:29,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 02:06:29,662 INFO L82 PathProgramCache]: Analyzing trace with hash 773566378, now seen corresponding path program 1 times [2020-06-22 02:06:29,662 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 02:06:29,662 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 02:06:29,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:06:29,663 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 02:06:29,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:06:29,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 02:06:29,708 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 02:06:29,709 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 02:06:29,709 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-06-22 02:06:29,709 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 02:06:29,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 02:06:29,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 02:06:29,710 INFO L87 Difference]: Start difference. First operand 32 states and 56 transitions. Second operand 3 states. [2020-06-22 02:06:29,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 02:06:29,827 INFO L93 Difference]: Finished difference Result 70 states and 122 transitions. [2020-06-22 02:06:29,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 02:06:29,827 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2020-06-22 02:06:29,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 02:06:29,828 INFO L225 Difference]: With dead ends: 70 [2020-06-22 02:06:29,828 INFO L226 Difference]: Without dead ends: 46 [2020-06-22 02:06:29,829 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 02:06:29,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2020-06-22 02:06:29,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 37. [2020-06-22 02:06:29,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2020-06-22 02:06:29,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 68 transitions. [2020-06-22 02:06:29,835 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 68 transitions. Word has length 11 [2020-06-22 02:06:29,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 02:06:29,836 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 68 transitions. [2020-06-22 02:06:29,836 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 02:06:29,836 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 68 transitions. [2020-06-22 02:06:29,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-06-22 02:06:29,836 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 02:06:29,837 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 02:06:29,837 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION]=== [2020-06-22 02:06:29,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 02:06:29,837 INFO L82 PathProgramCache]: Analyzing trace with hash 773596169, now seen corresponding path program 1 times [2020-06-22 02:06:29,837 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 02:06:29,837 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 02:06:29,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:06:29,839 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 02:06:29,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:06:29,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 02:06:29,926 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 02:06:29,926 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 02:06:29,926 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-06-22 02:06:29,927 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-06-22 02:06:29,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-06-22 02:06:29,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-06-22 02:06:29,927 INFO L87 Difference]: Start difference. First operand 37 states and 68 transitions. Second operand 6 states. [2020-06-22 02:06:30,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 02:06:30,263 INFO L93 Difference]: Finished difference Result 124 states and 247 transitions. [2020-06-22 02:06:30,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-06-22 02:06:30,263 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 11 [2020-06-22 02:06:30,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 02:06:30,265 INFO L225 Difference]: With dead ends: 124 [2020-06-22 02:06:30,265 INFO L226 Difference]: Without dead ends: 121 [2020-06-22 02:06:30,266 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2020-06-22 02:06:30,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2020-06-22 02:06:30,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 34. [2020-06-22 02:06:30,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2020-06-22 02:06:30,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 60 transitions. [2020-06-22 02:06:30,274 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 60 transitions. Word has length 11 [2020-06-22 02:06:30,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 02:06:30,275 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 60 transitions. [2020-06-22 02:06:30,275 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-06-22 02:06:30,275 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 60 transitions. [2020-06-22 02:06:30,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-06-22 02:06:30,275 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 02:06:30,276 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 02:06:30,276 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION]=== [2020-06-22 02:06:30,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 02:06:30,276 INFO L82 PathProgramCache]: Analyzing trace with hash 773596171, now seen corresponding path program 1 times [2020-06-22 02:06:30,276 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 02:06:30,276 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 02:06:30,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:06:30,277 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 02:06:30,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:06:30,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 02:06:30,368 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 02:06:30,368 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 02:06:30,369 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-06-22 02:06:30,369 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-06-22 02:06:30,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-06-22 02:06:30,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-06-22 02:06:30,370 INFO L87 Difference]: Start difference. First operand 34 states and 60 transitions. Second operand 7 states. [2020-06-22 02:06:30,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 02:06:30,865 INFO L93 Difference]: Finished difference Result 170 states and 309 transitions. [2020-06-22 02:06:30,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-06-22 02:06:30,865 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2020-06-22 02:06:30,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 02:06:30,867 INFO L225 Difference]: With dead ends: 170 [2020-06-22 02:06:30,867 INFO L226 Difference]: Without dead ends: 167 [2020-06-22 02:06:30,868 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2020-06-22 02:06:30,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2020-06-22 02:06:30,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 53. [2020-06-22 02:06:30,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2020-06-22 02:06:30,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 95 transitions. [2020-06-22 02:06:30,879 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 95 transitions. Word has length 11 [2020-06-22 02:06:30,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 02:06:30,879 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 95 transitions. [2020-06-22 02:06:30,879 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-06-22 02:06:30,879 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 95 transitions. [2020-06-22 02:06:30,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-06-22 02:06:30,880 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 02:06:30,880 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 02:06:30,880 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION]=== [2020-06-22 02:06:30,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 02:06:30,881 INFO L82 PathProgramCache]: Analyzing trace with hash -1033858292, now seen corresponding path program 1 times [2020-06-22 02:06:30,881 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 02:06:30,881 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 02:06:30,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:06:30,882 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 02:06:30,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:06:30,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 02:06:30,957 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 02:06:30,957 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 02:06:30,957 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-06-22 02:06:30,958 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-06-22 02:06:30,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-06-22 02:06:30,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-06-22 02:06:30,958 INFO L87 Difference]: Start difference. First operand 53 states and 95 transitions. Second operand 7 states. [2020-06-22 02:06:31,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 02:06:31,131 INFO L93 Difference]: Finished difference Result 79 states and 142 transitions. [2020-06-22 02:06:31,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-06-22 02:06:31,132 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2020-06-22 02:06:31,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 02:06:31,133 INFO L225 Difference]: With dead ends: 79 [2020-06-22 02:06:31,133 INFO L226 Difference]: Without dead ends: 76 [2020-06-22 02:06:31,134 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2020-06-22 02:06:31,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2020-06-22 02:06:31,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 48. [2020-06-22 02:06:31,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2020-06-22 02:06:31,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 87 transitions. [2020-06-22 02:06:31,141 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 87 transitions. Word has length 11 [2020-06-22 02:06:31,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 02:06:31,141 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 87 transitions. [2020-06-22 02:06:31,141 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-06-22 02:06:31,141 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 87 transitions. [2020-06-22 02:06:31,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-06-22 02:06:31,142 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 02:06:31,142 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 02:06:31,142 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION]=== [2020-06-22 02:06:31,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 02:06:31,143 INFO L82 PathProgramCache]: Analyzing trace with hash -1788325119, now seen corresponding path program 1 times [2020-06-22 02:06:31,143 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 02:06:31,143 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 02:06:31,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:06:31,145 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 02:06:31,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:06:31,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 02:06:31,180 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 02:06:31,180 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 02:06:31,181 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-06-22 02:06:31,181 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-06-22 02:06:31,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-06-22 02:06:31,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-06-22 02:06:31,182 INFO L87 Difference]: Start difference. First operand 48 states and 87 transitions. Second operand 4 states. [2020-06-22 02:06:31,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 02:06:31,272 INFO L93 Difference]: Finished difference Result 59 states and 99 transitions. [2020-06-22 02:06:31,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-06-22 02:06:31,272 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2020-06-22 02:06:31,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 02:06:31,273 INFO L225 Difference]: With dead ends: 59 [2020-06-22 02:06:31,273 INFO L226 Difference]: Without dead ends: 57 [2020-06-22 02:06:31,274 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 02:06:31,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2020-06-22 02:06:31,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 49. [2020-06-22 02:06:31,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2020-06-22 02:06:31,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 89 transitions. [2020-06-22 02:06:31,280 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 89 transitions. Word has length 12 [2020-06-22 02:06:31,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 02:06:31,282 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 89 transitions. [2020-06-22 02:06:31,282 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-06-22 02:06:31,282 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 89 transitions. [2020-06-22 02:06:31,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-06-22 02:06:31,282 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 02:06:31,283 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 02:06:31,283 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION]=== [2020-06-22 02:06:31,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 02:06:31,283 INFO L82 PathProgramCache]: Analyzing trace with hash -1788325122, now seen corresponding path program 1 times [2020-06-22 02:06:31,283 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 02:06:31,283 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 02:06:31,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:06:31,284 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 02:06:31,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:06:31,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 02:06:31,316 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 02:06:31,316 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 02:06:31,316 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 02:06:31,317 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 02:06:31,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 02:06:31,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 02:06:31,317 INFO L87 Difference]: Start difference. First operand 49 states and 89 transitions. Second operand 3 states. [2020-06-22 02:06:31,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 02:06:31,388 INFO L93 Difference]: Finished difference Result 49 states and 89 transitions. [2020-06-22 02:06:31,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 02:06:31,389 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2020-06-22 02:06:31,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 02:06:31,390 INFO L225 Difference]: With dead ends: 49 [2020-06-22 02:06:31,390 INFO L226 Difference]: Without dead ends: 47 [2020-06-22 02:06:31,390 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 02:06:31,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2020-06-22 02:06:31,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2020-06-22 02:06:31,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2020-06-22 02:06:31,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 81 transitions. [2020-06-22 02:06:31,396 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 81 transitions. Word has length 12 [2020-06-22 02:06:31,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 02:06:31,396 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 81 transitions. [2020-06-22 02:06:31,396 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 02:06:31,397 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 81 transitions. [2020-06-22 02:06:31,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-06-22 02:06:31,397 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 02:06:31,397 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 02:06:31,397 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION]=== [2020-06-22 02:06:31,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 02:06:31,398 INFO L82 PathProgramCache]: Analyzing trace with hash -1788325120, now seen corresponding path program 1 times [2020-06-22 02:06:31,398 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 02:06:31,398 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 02:06:31,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:06:31,399 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 02:06:31,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:06:31,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 02:06:31,443 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 02:06:31,444 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 02:06:31,444 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-06-22 02:06:31,444 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-06-22 02:06:31,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-06-22 02:06:31,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-06-22 02:06:31,445 INFO L87 Difference]: Start difference. First operand 47 states and 81 transitions. Second operand 5 states. [2020-06-22 02:06:31,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 02:06:31,610 INFO L93 Difference]: Finished difference Result 97 states and 165 transitions. [2020-06-22 02:06:31,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-06-22 02:06:31,611 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2020-06-22 02:06:31,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 02:06:31,612 INFO L225 Difference]: With dead ends: 97 [2020-06-22 02:06:31,612 INFO L226 Difference]: Without dead ends: 90 [2020-06-22 02:06:31,612 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-06-22 02:06:31,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2020-06-22 02:06:31,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 56. [2020-06-22 02:06:31,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2020-06-22 02:06:31,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 93 transitions. [2020-06-22 02:06:31,619 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 93 transitions. Word has length 12 [2020-06-22 02:06:31,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 02:06:31,619 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 93 transitions. [2020-06-22 02:06:31,620 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-06-22 02:06:31,620 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 93 transitions. [2020-06-22 02:06:31,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-06-22 02:06:31,620 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 02:06:31,620 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 02:06:31,621 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION]=== [2020-06-22 02:06:31,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 02:06:31,621 INFO L82 PathProgramCache]: Analyzing trace with hash 1012066007, now seen corresponding path program 1 times [2020-06-22 02:06:31,621 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 02:06:31,621 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 02:06:31,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:06:31,622 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 02:06:31,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:06:31,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 02:06:31,674 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 02:06:31,674 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 02:06:31,675 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-06-22 02:06:31,675 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-06-22 02:06:31,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-06-22 02:06:31,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-06-22 02:06:31,675 INFO L87 Difference]: Start difference. First operand 56 states and 93 transitions. Second operand 5 states. [2020-06-22 02:06:31,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 02:06:31,772 INFO L93 Difference]: Finished difference Result 62 states and 101 transitions. [2020-06-22 02:06:31,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-06-22 02:06:31,773 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2020-06-22 02:06:31,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 02:06:31,774 INFO L225 Difference]: With dead ends: 62 [2020-06-22 02:06:31,774 INFO L226 Difference]: Without dead ends: 55 [2020-06-22 02:06:31,774 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 02:06:31,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2020-06-22 02:06:31,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 42. [2020-06-22 02:06:31,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-06-22 02:06:31,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 69 transitions. [2020-06-22 02:06:31,779 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 69 transitions. Word has length 12 [2020-06-22 02:06:31,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 02:06:31,779 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 69 transitions. [2020-06-22 02:06:31,780 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-06-22 02:06:31,780 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 69 transitions. [2020-06-22 02:06:31,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-06-22 02:06:31,781 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 02:06:31,781 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 02:06:31,781 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION]=== [2020-06-22 02:06:31,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 02:06:31,781 INFO L82 PathProgramCache]: Analyzing trace with hash 1508406551, now seen corresponding path program 1 times [2020-06-22 02:06:31,782 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 02:06:31,782 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 02:06:31,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:06:31,783 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 02:06:31,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:06:31,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 02:06:31,806 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 02:06:31,807 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 02:06:31,807 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-06-22 02:06:31,807 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 02:06:31,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 02:06:31,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 02:06:31,808 INFO L87 Difference]: Start difference. First operand 42 states and 69 transitions. Second operand 3 states. [2020-06-22 02:06:31,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 02:06:31,866 INFO L93 Difference]: Finished difference Result 70 states and 118 transitions. [2020-06-22 02:06:31,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 02:06:31,866 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2020-06-22 02:06:31,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 02:06:31,867 INFO L225 Difference]: With dead ends: 70 [2020-06-22 02:06:31,867 INFO L226 Difference]: Without dead ends: 46 [2020-06-22 02:06:31,868 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 02:06:31,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2020-06-22 02:06:31,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 44. [2020-06-22 02:06:31,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2020-06-22 02:06:31,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 69 transitions. [2020-06-22 02:06:31,872 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 69 transitions. Word has length 19 [2020-06-22 02:06:31,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 02:06:31,873 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 69 transitions. [2020-06-22 02:06:31,873 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 02:06:31,873 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 69 transitions. [2020-06-22 02:06:31,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-06-22 02:06:31,874 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 02:06:31,874 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 02:06:31,874 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION]=== [2020-06-22 02:06:31,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 02:06:31,874 INFO L82 PathProgramCache]: Analyzing trace with hash 1537035702, now seen corresponding path program 1 times [2020-06-22 02:06:31,874 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 02:06:31,875 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 02:06:31,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:06:31,875 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 02:06:31,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:06:31,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 02:06:31,900 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 02:06:31,900 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 02:06:31,900 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-06-22 02:06:31,901 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 02:06:31,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 02:06:31,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 02:06:31,901 INFO L87 Difference]: Start difference. First operand 44 states and 69 transitions. Second operand 3 states. [2020-06-22 02:06:31,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 02:06:31,958 INFO L93 Difference]: Finished difference Result 72 states and 115 transitions. [2020-06-22 02:06:31,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 02:06:31,959 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2020-06-22 02:06:31,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 02:06:31,960 INFO L225 Difference]: With dead ends: 72 [2020-06-22 02:06:31,960 INFO L226 Difference]: Without dead ends: 42 [2020-06-22 02:06:31,960 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 02:06:31,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2020-06-22 02:06:31,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2020-06-22 02:06:31,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-06-22 02:06:31,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 61 transitions. [2020-06-22 02:06:31,964 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 61 transitions. Word has length 19 [2020-06-22 02:06:31,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 02:06:31,965 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 61 transitions. [2020-06-22 02:06:31,965 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 02:06:31,965 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 61 transitions. [2020-06-22 02:06:31,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-06-22 02:06:31,966 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 02:06:31,966 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 02:06:31,966 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION]=== [2020-06-22 02:06:31,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 02:06:31,966 INFO L82 PathProgramCache]: Analyzing trace with hash -2035200353, now seen corresponding path program 1 times [2020-06-22 02:06:31,966 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 02:06:31,967 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 02:06:31,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:06:31,967 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 02:06:31,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:06:31,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 02:06:32,083 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 02:06:32,083 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 02:06:32,083 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-06-22 02:06:32,084 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-06-22 02:06:32,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-06-22 02:06:32,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2020-06-22 02:06:32,084 INFO L87 Difference]: Start difference. First operand 42 states and 61 transitions. Second operand 9 states. [2020-06-22 02:06:32,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 02:06:32,340 INFO L93 Difference]: Finished difference Result 83 states and 121 transitions. [2020-06-22 02:06:32,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-06-22 02:06:32,341 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2020-06-22 02:06:32,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 02:06:32,342 INFO L225 Difference]: With dead ends: 83 [2020-06-22 02:06:32,342 INFO L226 Difference]: Without dead ends: 44 [2020-06-22 02:06:32,342 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2020-06-22 02:06:32,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2020-06-22 02:06:32,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 42. [2020-06-22 02:06:32,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-06-22 02:06:32,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 60 transitions. [2020-06-22 02:06:32,346 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 60 transitions. Word has length 21 [2020-06-22 02:06:32,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 02:06:32,346 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 60 transitions. [2020-06-22 02:06:32,346 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-06-22 02:06:32,347 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 60 transitions. [2020-06-22 02:06:32,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-06-22 02:06:32,347 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 02:06:32,347 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 02:06:32,348 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION]=== [2020-06-22 02:06:32,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 02:06:32,348 INFO L82 PathProgramCache]: Analyzing trace with hash 1554652328, now seen corresponding path program 1 times [2020-06-22 02:06:32,348 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 02:06:32,348 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 02:06:32,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:06:32,349 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 02:06:32,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:06:32,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 02:06:32,573 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 02:06:32,573 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 02:06:32,574 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox2/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 02:06:32,598 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 02:06:32,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 02:06:32,646 INFO L256 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 25 conjunts are in the unsatisfiable core [2020-06-22 02:06:32,652 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 02:06:32,739 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 02:06:32,740 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 02:06:32,753 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 02:06:32,754 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 02:06:32,755 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:31, output treesize:27 [2020-06-22 02:06:32,803 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-06-22 02:06:32,806 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2020-06-22 02:06:32,806 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 02:06:32,825 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 02:06:32,827 INFO L427 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2020-06-22 02:06:32,827 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:39, output treesize:38 [2020-06-22 02:06:32,878 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-06-22 02:06:32,879 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2020-06-22 02:06:32,880 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 02:06:32,898 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 02:06:32,900 INFO L427 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2020-06-22 02:06:32,900 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:49, output treesize:45 [2020-06-22 02:06:32,975 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-06-22 02:06:32,982 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 02:06:32,983 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 21 [2020-06-22 02:06:32,986 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-06-22 02:06:33,006 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 02:06:33,011 INFO L427 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 02:06:33,011 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:52, output treesize:31 [2020-06-22 02:06:33,116 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 02:06:33,145 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-06-22 02:06:33,145 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2020-06-22 02:06:33,145 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-06-22 02:06:33,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-06-22 02:06:33,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2020-06-22 02:06:33,146 INFO L87 Difference]: Start difference. First operand 42 states and 60 transitions. Second operand 17 states. [2020-06-22 02:06:34,016 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 67 [2020-06-22 02:06:35,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 02:06:35,011 INFO L93 Difference]: Finished difference Result 208 states and 294 transitions. [2020-06-22 02:06:35,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-06-22 02:06:35,024 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 21 [2020-06-22 02:06:35,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 02:06:35,025 INFO L225 Difference]: With dead ends: 208 [2020-06-22 02:06:35,025 INFO L226 Difference]: Without dead ends: 205 [2020-06-22 02:06:35,026 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=252, Invalid=870, Unknown=0, NotChecked=0, Total=1122 [2020-06-22 02:06:35,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2020-06-22 02:06:35,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 68. [2020-06-22 02:06:35,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2020-06-22 02:06:35,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 92 transitions. [2020-06-22 02:06:35,035 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 92 transitions. Word has length 21 [2020-06-22 02:06:35,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 02:06:35,036 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 92 transitions. [2020-06-22 02:06:35,036 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-06-22 02:06:35,036 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 92 transitions. [2020-06-22 02:06:35,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-06-22 02:06:35,037 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 02:06:35,037 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 02:06:35,037 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION]=== [2020-06-22 02:06:35,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 02:06:35,037 INFO L82 PathProgramCache]: Analyzing trace with hash 1554652329, now seen corresponding path program 1 times [2020-06-22 02:06:35,038 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 02:06:35,038 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 02:06:35,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:06:35,039 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 02:06:35,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:06:35,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 02:06:35,085 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 02:06:35,085 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 02:06:35,085 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox2/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 02:06:35,108 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 02:06:35,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 02:06:35,134 INFO L256 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 3 conjunts are in the unsatisfiable core [2020-06-22 02:06:35,136 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 02:06:35,147 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 02:06:35,174 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-06-22 02:06:35,174 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2020-06-22 02:06:35,174 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-06-22 02:06:35,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-06-22 02:06:35,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-06-22 02:06:35,175 INFO L87 Difference]: Start difference. First operand 68 states and 92 transitions. Second operand 7 states. [2020-06-22 02:06:35,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 02:06:35,283 INFO L93 Difference]: Finished difference Result 74 states and 98 transitions. [2020-06-22 02:06:35,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-06-22 02:06:35,284 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2020-06-22 02:06:35,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 02:06:35,285 INFO L225 Difference]: With dead ends: 74 [2020-06-22 02:06:35,285 INFO L226 Difference]: Without dead ends: 71 [2020-06-22 02:06:35,285 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2020-06-22 02:06:35,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2020-06-22 02:06:35,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 63. [2020-06-22 02:06:35,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2020-06-22 02:06:35,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 82 transitions. [2020-06-22 02:06:35,293 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 82 transitions. Word has length 21 [2020-06-22 02:06:35,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 02:06:35,293 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 82 transitions. [2020-06-22 02:06:35,293 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-06-22 02:06:35,294 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 82 transitions. [2020-06-22 02:06:35,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-06-22 02:06:35,294 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 02:06:35,294 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 02:06:35,295 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION]=== [2020-06-22 02:06:35,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 02:06:35,295 INFO L82 PathProgramCache]: Analyzing trace with hash 710180457, now seen corresponding path program 1 times [2020-06-22 02:06:35,295 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 02:06:35,295 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 02:06:35,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:06:35,296 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 02:06:35,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:06:35,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 02:06:35,440 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 02:06:35,440 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 02:06:35,441 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox2/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 02:06:35,456 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 02:06:35,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 02:06:35,485 INFO L256 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 28 conjunts are in the unsatisfiable core [2020-06-22 02:06:35,487 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 02:06:35,494 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 02:06:35,494 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 02:06:35,504 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 02:06:35,505 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 02:06:35,505 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:33, output treesize:29 [2020-06-22 02:06:35,541 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 02:06:35,541 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 11 treesize of output 15 [2020-06-22 02:06:35,542 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 02:06:35,553 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 02:06:35,557 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2020-06-22 02:06:35,557 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-06-22 02:06:35,568 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 02:06:35,568 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-06-22 02:06:35,569 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:40, output treesize:33 [2020-06-22 02:06:35,599 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2020-06-22 02:06:35,600 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 02:06:35,611 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 02:06:35,613 INFO L427 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2020-06-22 02:06:35,613 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:44, output treesize:40 [2020-06-22 02:06:35,677 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 02:06:35,678 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 21 [2020-06-22 02:06:35,679 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-06-22 02:06:35,691 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 02:06:35,693 INFO L427 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2020-06-22 02:06:35,694 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:47, output treesize:27 [2020-06-22 02:06:35,755 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 02:06:35,783 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-06-22 02:06:35,783 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 14 [2020-06-22 02:06:35,783 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-06-22 02:06:35,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-06-22 02:06:35,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2020-06-22 02:06:35,784 INFO L87 Difference]: Start difference. First operand 63 states and 82 transitions. Second operand 15 states. [2020-06-22 02:06:36,107 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 53 [2020-06-22 02:06:36,256 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 58 [2020-06-22 02:06:40,763 WARN L188 SmtUtils]: Spent 4.49 s on a formula simplification. DAG size of input: 59 DAG size of output: 55 [2020-06-22 02:06:41,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 02:06:41,047 INFO L93 Difference]: Finished difference Result 82 states and 105 transitions. [2020-06-22 02:06:41,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-06-22 02:06:41,048 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 21 [2020-06-22 02:06:41,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 02:06:41,048 INFO L225 Difference]: With dead ends: 82 [2020-06-22 02:06:41,048 INFO L226 Difference]: Without dead ends: 80 [2020-06-22 02:06:41,049 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=142, Invalid=364, Unknown=0, NotChecked=0, Total=506 [2020-06-22 02:06:41,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2020-06-22 02:06:41,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 52. [2020-06-22 02:06:41,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2020-06-22 02:06:41,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 69 transitions. [2020-06-22 02:06:41,055 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 69 transitions. Word has length 21 [2020-06-22 02:06:41,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 02:06:41,056 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 69 transitions. [2020-06-22 02:06:41,056 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-06-22 02:06:41,056 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 69 transitions. [2020-06-22 02:06:41,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-06-22 02:06:41,056 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 02:06:41,057 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 02:06:41,057 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION]=== [2020-06-22 02:06:41,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 02:06:41,057 INFO L82 PathProgramCache]: Analyzing trace with hash 949579268, now seen corresponding path program 1 times [2020-06-22 02:06:41,057 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 02:06:41,057 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 02:06:41,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:06:41,058 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 02:06:41,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:06:41,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 02:06:41,094 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 02:06:41,094 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 02:06:41,094 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox2/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 02:06:41,112 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 02:06:41,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 02:06:41,140 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 3 conjunts are in the unsatisfiable core [2020-06-22 02:06:41,142 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 02:06:41,152 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 02:06:41,179 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-06-22 02:06:41,179 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2020-06-22 02:06:41,180 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-06-22 02:06:41,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-06-22 02:06:41,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-06-22 02:06:41,180 INFO L87 Difference]: Start difference. First operand 52 states and 69 transitions. Second operand 6 states. [2020-06-22 02:06:41,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 02:06:41,295 INFO L93 Difference]: Finished difference Result 54 states and 69 transitions. [2020-06-22 02:06:41,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-06-22 02:06:41,295 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2020-06-22 02:06:41,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 02:06:41,296 INFO L225 Difference]: With dead ends: 54 [2020-06-22 02:06:41,296 INFO L226 Difference]: Without dead ends: 52 [2020-06-22 02:06:41,296 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 23 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 02:06:41,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2020-06-22 02:06:41,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2020-06-22 02:06:41,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2020-06-22 02:06:41,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 67 transitions. [2020-06-22 02:06:41,302 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 67 transitions. Word has length 22 [2020-06-22 02:06:41,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 02:06:41,303 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 67 transitions. [2020-06-22 02:06:41,303 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-06-22 02:06:41,303 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 67 transitions. [2020-06-22 02:06:41,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-06-22 02:06:41,303 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 02:06:41,304 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 02:06:41,304 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION]=== [2020-06-22 02:06:41,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 02:06:41,304 INFO L82 PathProgramCache]: Analyzing trace with hash 949579267, now seen corresponding path program 1 times [2020-06-22 02:06:41,304 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 02:06:41,304 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 02:06:41,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:06:41,305 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 02:06:41,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:06:41,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 02:06:41,501 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 02:06:41,501 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 02:06:41,502 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2020-06-22 02:06:41,517 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 02:06:41,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 02:06:41,550 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 26 conjunts are in the unsatisfiable core [2020-06-22 02:06:41,552 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 02:06:41,564 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 02:06:41,564 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 02:06:41,574 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 02:06:41,575 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 02:06:41,575 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:24 [2020-06-22 02:06:41,744 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 02:06:41,745 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 48 [2020-06-22 02:06:41,754 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2020-06-22 02:06:41,808 INFO L497 ElimStorePlain]: treesize reduction 40, result has 48.1 percent of original size [2020-06-22 02:06:41,809 INFO L427 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2020-06-22 02:06:41,810 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:42, output treesize:37 [2020-06-22 02:06:41,934 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 02:06:41,962 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-06-22 02:06:41,963 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 16 [2020-06-22 02:06:41,963 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-06-22 02:06:41,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-06-22 02:06:41,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2020-06-22 02:06:41,964 INFO L87 Difference]: Start difference. First operand 52 states and 67 transitions. Second operand 17 states. [2020-06-22 02:06:43,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 02:06:43,594 INFO L93 Difference]: Finished difference Result 58 states and 72 transitions. [2020-06-22 02:06:43,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-06-22 02:06:43,596 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 22 [2020-06-22 02:06:43,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 02:06:43,596 INFO L225 Difference]: With dead ends: 58 [2020-06-22 02:06:43,597 INFO L226 Difference]: Without dead ends: 47 [2020-06-22 02:06:43,597 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=161, Invalid=489, Unknown=0, NotChecked=0, Total=650 [2020-06-22 02:06:43,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2020-06-22 02:06:43,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 45. [2020-06-22 02:06:43,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2020-06-22 02:06:43,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 53 transitions. [2020-06-22 02:06:43,602 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 53 transitions. Word has length 22 [2020-06-22 02:06:43,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 02:06:43,602 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 53 transitions. [2020-06-22 02:06:43,603 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-06-22 02:06:43,603 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 53 transitions. [2020-06-22 02:06:43,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-06-22 02:06:43,603 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 02:06:43,603 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 02:06:43,603 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION]=== [2020-06-22 02:06:43,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 02:06:43,604 INFO L82 PathProgramCache]: Analyzing trace with hash -2039814404, now seen corresponding path program 2 times [2020-06-22 02:06:43,604 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 02:06:43,604 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 02:06:43,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:06:43,605 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 02:06:43,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:06:43,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 02:06:43,914 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 02:06:43,914 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 02:06:43,915 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2020-06-22 02:06:43,926 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2020-06-22 02:06:43,956 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-06-22 02:06:43,956 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-06-22 02:06:43,957 INFO L256 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 28 conjunts are in the unsatisfiable core [2020-06-22 02:06:43,960 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 02:06:43,964 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 02:06:43,965 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 02:06:43,970 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 02:06:43,970 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-06-22 02:06:43,970 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2020-06-22 02:06:43,990 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 02:06:43,990 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 02:06:43,998 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 02:06:43,998 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 02:06:43,999 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:22 [2020-06-22 02:06:44,027 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-06-22 02:06:44,028 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2020-06-22 02:06:44,028 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 02:06:44,039 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 02:06:44,039 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-06-22 02:06:44,039 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:31, output treesize:30 [2020-06-22 02:06:44,071 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-06-22 02:06:44,072 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 28 [2020-06-22 02:06:44,072 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 02:06:44,083 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 02:06:44,083 INFO L427 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2020-06-22 02:06:44,083 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:41, output treesize:37 [2020-06-22 02:06:44,192 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-06-22 02:06:44,198 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 02:06:44,198 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 23 [2020-06-22 02:06:44,199 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-06-22 02:06:44,214 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 02:06:44,216 INFO L427 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 02:06:44,218 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:51, output treesize:27 [2020-06-22 02:06:44,323 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-06-22 02:06:44,351 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-06-22 02:06:44,351 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 18 [2020-06-22 02:06:44,351 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-06-22 02:06:44,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-06-22 02:06:44,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2020-06-22 02:06:44,352 INFO L87 Difference]: Start difference. First operand 45 states and 53 transitions. Second operand 19 states. [2020-06-22 02:06:46,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 02:06:46,540 INFO L93 Difference]: Finished difference Result 207 states and 243 transitions. [2020-06-22 02:06:46,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2020-06-22 02:06:46,541 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 31 [2020-06-22 02:06:46,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 02:06:46,542 INFO L225 Difference]: With dead ends: 207 [2020-06-22 02:06:46,542 INFO L226 Difference]: Without dead ends: 205 [2020-06-22 02:06:46,543 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 375 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=357, Invalid=1449, Unknown=0, NotChecked=0, Total=1806 [2020-06-22 02:06:46,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2020-06-22 02:06:46,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 119. [2020-06-22 02:06:46,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2020-06-22 02:06:46,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 146 transitions. [2020-06-22 02:06:46,555 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 146 transitions. Word has length 31 [2020-06-22 02:06:46,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 02:06:46,556 INFO L480 AbstractCegarLoop]: Abstraction has 119 states and 146 transitions. [2020-06-22 02:06:46,556 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-06-22 02:06:46,556 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 146 transitions. [2020-06-22 02:06:46,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-06-22 02:06:46,556 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 02:06:46,557 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 02:06:46,557 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION]=== [2020-06-22 02:06:46,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 02:06:46,557 INFO L82 PathProgramCache]: Analyzing trace with hash -1346712707, now seen corresponding path program 2 times [2020-06-22 02:06:46,558 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 02:06:46,558 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 02:06:46,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:06:46,559 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 02:06:46,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:06:46,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 02:06:46,793 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 02:06:46,793 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 02:06:46,793 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2020-06-22 02:06:46,805 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2020-06-22 02:06:46,834 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-06-22 02:06:46,834 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-06-22 02:06:46,836 INFO L256 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 30 conjunts are in the unsatisfiable core [2020-06-22 02:06:46,838 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 02:06:46,843 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 02:06:46,843 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 02:06:46,847 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 02:06:46,847 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-06-22 02:06:46,847 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2020-06-22 02:06:46,865 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 02:06:46,865 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 02:06:46,872 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 02:06:46,873 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 02:06:46,873 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:24 [2020-06-22 02:06:46,899 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-06-22 02:06:46,900 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2020-06-22 02:06:46,900 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 02:06:46,911 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 02:06:46,919 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 02:06:46,919 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 11 treesize of output 15 [2020-06-22 02:06:46,920 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-06-22 02:06:46,928 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 02:06:46,928 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-06-22 02:06:46,929 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:35, output treesize:28 [2020-06-22 02:06:46,958 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 28 [2020-06-22 02:06:46,959 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 02:06:46,968 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 02:06:46,968 INFO L427 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2020-06-22 02:06:46,969 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:39, output treesize:35 [2020-06-22 02:06:47,078 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 02:06:47,079 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 23 [2020-06-22 02:06:47,080 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-06-22 02:06:47,094 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 02:06:47,096 INFO L427 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 02:06:47,096 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:49, output treesize:24 [2020-06-22 02:06:47,172 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-06-22 02:06:47,198 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-06-22 02:06:47,199 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 17 [2020-06-22 02:06:47,199 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-06-22 02:06:47,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-06-22 02:06:47,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2020-06-22 02:06:47,200 INFO L87 Difference]: Start difference. First operand 119 states and 146 transitions. Second operand 18 states. [2020-06-22 02:06:47,683 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 56 [2020-06-22 02:06:48,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 02:06:48,508 INFO L93 Difference]: Finished difference Result 154 states and 186 transitions. [2020-06-22 02:06:48,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-06-22 02:06:48,508 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 31 [2020-06-22 02:06:48,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 02:06:48,509 INFO L225 Difference]: With dead ends: 154 [2020-06-22 02:06:48,509 INFO L226 Difference]: Without dead ends: 152 [2020-06-22 02:06:48,510 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=272, Invalid=720, Unknown=0, NotChecked=0, Total=992 [2020-06-22 02:06:48,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2020-06-22 02:06:48,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 62. [2020-06-22 02:06:48,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2020-06-22 02:06:48,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 75 transitions. [2020-06-22 02:06:48,519 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 75 transitions. Word has length 31 [2020-06-22 02:06:48,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 02:06:48,519 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 75 transitions. [2020-06-22 02:06:48,519 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-06-22 02:06:48,520 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 75 transitions. [2020-06-22 02:06:48,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2020-06-22 02:06:48,520 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 02:06:48,521 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 02:06:48,521 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION]=== [2020-06-22 02:06:48,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 02:06:48,521 INFO L82 PathProgramCache]: Analyzing trace with hash 1190260271, now seen corresponding path program 2 times [2020-06-22 02:06:48,521 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 02:06:48,531 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 02:06:48,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:06:48,532 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 02:06:48,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:06:48,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 02:06:48,843 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 02:06:48,844 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 02:06:48,844 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2020-06-22 02:06:48,855 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2020-06-22 02:06:48,885 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-06-22 02:06:48,885 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-06-22 02:06:48,887 INFO L256 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 29 conjunts are in the unsatisfiable core [2020-06-22 02:06:48,889 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 02:06:48,895 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 02:06:48,895 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 02:06:48,899 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 02:06:48,899 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-06-22 02:06:48,899 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2020-06-22 02:06:48,920 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 02:06:48,921 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 02:06:48,927 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 02:06:48,927 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 02:06:48,927 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:23, output treesize:19 [2020-06-22 02:06:49,089 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 02:06:49,089 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 31 treesize of output 52 [2020-06-22 02:06:49,097 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2020-06-22 02:06:49,155 INFO L497 ElimStorePlain]: treesize reduction 61, result has 40.2 percent of original size [2020-06-22 02:06:49,156 INFO L427 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2020-06-22 02:06:49,157 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:41 [2020-06-22 02:06:49,262 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-06-22 02:06:49,291 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-06-22 02:06:49,291 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 17 [2020-06-22 02:06:49,291 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-06-22 02:06:49,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-06-22 02:06:49,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306 [2020-06-22 02:06:49,292 INFO L87 Difference]: Start difference. First operand 62 states and 75 transitions. Second operand 18 states. [2020-06-22 02:06:51,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 02:06:51,157 INFO L93 Difference]: Finished difference Result 73 states and 85 transitions. [2020-06-22 02:06:51,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2020-06-22 02:06:51,158 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 32 [2020-06-22 02:06:51,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 02:06:51,159 INFO L225 Difference]: With dead ends: 73 [2020-06-22 02:06:51,159 INFO L226 Difference]: Without dead ends: 61 [2020-06-22 02:06:51,160 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 432 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=419, Invalid=1473, Unknown=0, NotChecked=0, Total=1892 [2020-06-22 02:06:51,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2020-06-22 02:06:51,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 55. [2020-06-22 02:06:51,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2020-06-22 02:06:51,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 63 transitions. [2020-06-22 02:06:51,166 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 63 transitions. Word has length 32 [2020-06-22 02:06:51,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 02:06:51,166 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 63 transitions. [2020-06-22 02:06:51,167 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-06-22 02:06:51,167 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 63 transitions. [2020-06-22 02:06:51,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-06-22 02:06:51,167 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 02:06:51,167 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 02:06:51,168 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION]=== [2020-06-22 02:06:51,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 02:06:51,168 INFO L82 PathProgramCache]: Analyzing trace with hash -800067631, now seen corresponding path program 1 times [2020-06-22 02:06:51,168 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 02:06:51,168 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 02:06:51,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:06:51,169 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 02:06:51,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:06:51,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 02:06:51,319 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-06-22 02:06:51,319 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 02:06:51,319 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2020-06-22 02:06:51,332 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 02:06:51,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 02:06:51,365 INFO L256 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 30 conjunts are in the unsatisfiable core [2020-06-22 02:06:51,368 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 02:06:51,372 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 02:06:51,373 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 02:06:51,378 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 02:06:51,378 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-06-22 02:06:51,379 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2020-06-22 02:06:51,386 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 02:06:51,386 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 02:06:51,391 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 02:06:51,391 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 02:06:51,391 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:17 [2020-06-22 02:06:51,396 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-06-22 02:06:51,397 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2020-06-22 02:06:51,398 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 02:06:51,407 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 02:06:51,407 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-06-22 02:06:51,408 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:29, output treesize:28 [2020-06-22 02:06:51,435 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-06-22 02:06:51,436 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2020-06-22 02:06:51,436 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 02:06:51,451 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 02:06:51,451 INFO L427 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2020-06-22 02:06:51,452 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:39, output treesize:35 [2020-06-22 02:06:51,538 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-06-22 02:06:51,557 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 02:06:51,557 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 22 [2020-06-22 02:06:51,558 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-06-22 02:06:51,578 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 02:06:51,579 INFO L427 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 02:06:51,579 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:49, output treesize:25 [2020-06-22 02:06:51,671 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 10 proven. 13 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2020-06-22 02:06:51,700 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-06-22 02:06:51,700 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 16 [2020-06-22 02:06:51,700 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-06-22 02:06:51,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-06-22 02:06:51,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=214, Unknown=0, NotChecked=0, Total=272 [2020-06-22 02:06:51,701 INFO L87 Difference]: Start difference. First operand 55 states and 63 transitions. Second operand 17 states. [2020-06-22 02:06:52,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 02:06:52,444 INFO L93 Difference]: Finished difference Result 203 states and 229 transitions. [2020-06-22 02:06:52,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-06-22 02:06:52,444 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 41 [2020-06-22 02:06:52,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 02:06:52,445 INFO L225 Difference]: With dead ends: 203 [2020-06-22 02:06:52,445 INFO L226 Difference]: Without dead ends: 201 [2020-06-22 02:06:52,446 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=176, Invalid=580, Unknown=0, NotChecked=0, Total=756 [2020-06-22 02:06:52,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2020-06-22 02:06:52,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 102. [2020-06-22 02:06:52,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2020-06-22 02:06:52,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 118 transitions. [2020-06-22 02:06:52,458 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 118 transitions. Word has length 41 [2020-06-22 02:06:52,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 02:06:52,459 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 118 transitions. [2020-06-22 02:06:52,459 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-06-22 02:06:52,459 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 118 transitions. [2020-06-22 02:06:52,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-06-22 02:06:52,459 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 02:06:52,460 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 02:06:52,460 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION]=== [2020-06-22 02:06:52,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 02:06:52,460 INFO L82 PathProgramCache]: Analyzing trace with hash -1722751214, now seen corresponding path program 1 times [2020-06-22 02:06:52,460 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 02:06:52,460 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 02:06:52,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:06:52,461 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 02:06:52,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:06:52,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 02:06:52,621 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-06-22 02:06:52,622 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 02:06:52,622 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2020-06-22 02:06:52,633 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 02:06:52,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 02:06:52,666 INFO L256 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 33 conjunts are in the unsatisfiable core [2020-06-22 02:06:52,669 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 02:06:52,673 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 02:06:52,673 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 02:06:52,677 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 02:06:52,677 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-06-22 02:06:52,677 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2020-06-22 02:06:52,680 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 02:06:52,681 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 02:06:52,685 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 02:06:52,685 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 02:06:52,685 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:17 [2020-06-22 02:06:52,689 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-06-22 02:06:52,690 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2020-06-22 02:06:52,690 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 02:06:52,697 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 02:06:52,705 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 02:06:52,705 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 11 treesize of output 15 [2020-06-22 02:06:52,705 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-06-22 02:06:52,711 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 02:06:52,711 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-06-22 02:06:52,712 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:21 [2020-06-22 02:06:52,739 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2020-06-22 02:06:52,740 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 02:06:52,747 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 02:06:52,747 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 02:06:52,748 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:28 [2020-06-22 02:06:52,823 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 02:06:52,823 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 22 [2020-06-22 02:06:52,824 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-06-22 02:06:52,832 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 02:06:52,833 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 02:06:52,833 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:20 [2020-06-22 02:06:52,874 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 10 proven. 13 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2020-06-22 02:06:52,900 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-06-22 02:06:52,900 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 14 [2020-06-22 02:06:52,901 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-06-22 02:06:52,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-06-22 02:06:52,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2020-06-22 02:06:52,901 INFO L87 Difference]: Start difference. First operand 102 states and 118 transitions. Second operand 15 states. [2020-06-22 02:06:53,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 02:06:53,212 INFO L93 Difference]: Finished difference Result 102 states and 118 transitions. [2020-06-22 02:06:53,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-06-22 02:06:53,213 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 41 [2020-06-22 02:06:53,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 02:06:53,213 INFO L225 Difference]: With dead ends: 102 [2020-06-22 02:06:53,214 INFO L226 Difference]: Without dead ends: 100 [2020-06-22 02:06:53,214 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=110, Invalid=270, Unknown=0, NotChecked=0, Total=380 [2020-06-22 02:06:53,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2020-06-22 02:06:53,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 53. [2020-06-22 02:06:53,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2020-06-22 02:06:53,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 61 transitions. [2020-06-22 02:06:53,221 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 61 transitions. Word has length 41 [2020-06-22 02:06:53,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 02:06:53,221 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 61 transitions. [2020-06-22 02:06:53,221 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-06-22 02:06:53,221 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 61 transitions. [2020-06-22 02:06:53,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2020-06-22 02:06:53,223 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 02:06:53,223 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 02:06:53,223 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION]=== [2020-06-22 02:06:53,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 02:06:53,223 INFO L82 PathProgramCache]: Analyzing trace with hash 967704570, now seen corresponding path program 1 times [2020-06-22 02:06:53,224 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 02:06:53,224 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 02:06:53,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:06:53,224 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 02:06:53,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:06:53,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 02:06:53,372 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-06-22 02:06:53,372 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 02:06:53,372 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2020-06-22 02:06:53,384 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 02:06:53,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 02:06:53,417 INFO L256 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 30 conjunts are in the unsatisfiable core [2020-06-22 02:06:53,420 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 02:06:53,426 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 02:06:53,426 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 02:06:53,430 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 02:06:53,430 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-06-22 02:06:53,430 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2020-06-22 02:06:53,433 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 02:06:53,434 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 02:06:53,435 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 02:06:53,435 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 02:06:53,435 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2020-06-22 02:06:53,520 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 02:06:53,521 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 50 [2020-06-22 02:06:53,528 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-06-22 02:06:53,558 INFO L497 ElimStorePlain]: treesize reduction 25, result has 56.9 percent of original size [2020-06-22 02:06:53,559 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 02:06:53,559 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:33 [2020-06-22 02:06:53,616 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 10 proven. 16 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2020-06-22 02:06:53,644 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-06-22 02:06:53,644 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 14 [2020-06-22 02:06:53,644 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-06-22 02:06:53,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-06-22 02:06:53,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2020-06-22 02:06:53,645 INFO L87 Difference]: Start difference. First operand 53 states and 61 transitions. Second operand 15 states. [2020-06-22 02:06:54,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 02:06:54,043 INFO L93 Difference]: Finished difference Result 53 states and 61 transitions. [2020-06-22 02:06:54,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-06-22 02:06:54,043 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 42 [2020-06-22 02:06:54,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 02:06:54,044 INFO L225 Difference]: With dead ends: 53 [2020-06-22 02:06:54,044 INFO L226 Difference]: Without dead ends: 0 [2020-06-22 02:06:54,044 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=126, Invalid=336, Unknown=0, NotChecked=0, Total=462 [2020-06-22 02:06:54,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-06-22 02:06:54,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-06-22 02:06:54,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-06-22 02:06:54,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-06-22 02:06:54,045 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 42 [2020-06-22 02:06:54,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 02:06:54,045 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 02:06:54,046 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-06-22 02:06:54,046 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-06-22 02:06:54,046 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-06-22 02:06:54,051 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-06-22 02:06:54,090 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2020-06-22 02:06:54,091 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2020-06-22 02:06:54,092 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2020-06-22 02:06:54,097 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2020-06-22 02:06:54,244 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2020-06-22 02:06:54,283 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2020-06-22 02:06:54,286 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2020-06-22 02:06:54,290 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2020-06-22 02:06:54,384 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2020-06-22 02:06:54,388 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2020-06-22 02:06:54,475 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2020-06-22 02:06:54,479 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2020-06-22 02:06:54,479 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2020-06-22 02:06:54,562 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2020-06-22 02:06:54,586 WARN L188 SmtUtils]: Spent 509.00 ms on a formula simplification. DAG size of input: 387 DAG size of output: 328 [2020-06-22 02:07:02,487 WARN L188 SmtUtils]: Spent 7.83 s on a formula simplification. DAG size of input: 317 DAG size of output: 105 [2020-06-22 02:07:02,712 WARN L188 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 51 [2020-06-22 02:07:02,715 INFO L448 ceAbstractionStarter]: For program point L31-1(line 31) no Hoare annotation was computed. [2020-06-22 02:07:02,715 INFO L448 ceAbstractionStarter]: For program point L31-2(line 31) no Hoare annotation was computed. [2020-06-22 02:07:02,715 INFO L448 ceAbstractionStarter]: For program point L31-3(line 31) no Hoare annotation was computed. [2020-06-22 02:07:02,715 INFO L448 ceAbstractionStarter]: For program point L31-4(line 31) no Hoare annotation was computed. [2020-06-22 02:07:02,716 INFO L448 ceAbstractionStarter]: For program point L31-6(lines 31 38) no Hoare annotation was computed. [2020-06-22 02:07:02,716 INFO L444 ceAbstractionStarter]: At program point L31-8(lines 31 38) the Hoare annotation is: (let ((.cse3 (select |#length| |ULTIMATE.start_main_#t~ret13.base|)) (.cse28 (select |#length| ULTIMATE.start_cstrncmp_~s1.base)) (.cse9 (<= 1 ULTIMATE.start___VERIFIER_nondet_String_~length~0)) (.cse10 (= ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset 0)) (.cse14 (= 1 (select |#valid| ULTIMATE.start_cstrncmp_~s1.base))) (.cse15 (= (select |#valid| ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base) 1)) (.cse27 (select |#length| ULTIMATE.start_cstrncmp_~s2.base))) (let ((.cse25 (<= 1 .cse27)) (.cse22 (= 0 ULTIMATE.start_cstrncmp_~s2.offset)) (.cse20 (and .cse9 .cse10 .cse14 .cse15)) (.cse26 (<= 1 .cse28)) (.cse12 (= 1 (select |#valid| ULTIMATE.start_cstrncmp_~s2.base))) (.cse13 (= 0 |ULTIMATE.start_main_#t~ret13.offset|)) (.cse23 (<= 1 .cse3)) (.cse16 (= (select |#length| ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base) ULTIMATE.start___VERIFIER_nondet_String_~length~0)) (.cse17 (= 1 (select |#valid| |ULTIMATE.start_main_#t~ret13.base|))) (.cse24 (= 0 ULTIMATE.start_cstrncmp_~s1.offset)) (.cse21 (select |#memory_int| ULTIMATE.start_cstrncmp_~s2.base))) (let ((.cse0 (exists ((ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset Int) (ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base Int)) (and (not (= ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base ULTIMATE.start_cstrncmp_~s1.base)) (= 0 (select (select |#memory_int| ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base) (+ ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset (select |#length| ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base) (- 1))))))) (.cse6 (exists ((v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18 Int) (v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_25 Int)) (and (<= (+ v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18 v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_25) (select |#length| |ULTIMATE.start_main_#t~ret13.base|)) (= (select (select |#memory_int| |ULTIMATE.start_main_#t~ret13.base|) (+ v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18 v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_25 (- 1))) 0) (<= |ULTIMATE.start_main_#t~ret13.offset| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18) (<= 1 v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_25)))) (.cse8 (<= 1 ULTIMATE.start_cstrncmp_~s1.offset)) (.cse19 (<= 1 ULTIMATE.start_cstrncmp_~s2.offset)) (.cse7 (<= (+ ULTIMATE.start_cstrncmp_~s1.offset 1) .cse28)) (.cse1 (not (= ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base |ULTIMATE.start_main_#t~ret13.base|))) (.cse4 (= (select (select |#memory_int| ULTIMATE.start_cstrncmp_~s1.base) (+ .cse28 (- 1))) 0)) (.cse18 (<= (+ ULTIMATE.start_cstrncmp_~s2.offset 1) .cse27)) (.cse5 (= 0 (select .cse21 (+ .cse27 (- 1))))) (.cse2 (and .cse25 .cse22 .cse20 .cse26 .cse12 .cse13 .cse23 .cse16 .cse17 .cse24)) (.cse11 (<= (+ ULTIMATE.start_cstrncmp_~n 1) 0))) (or (and (and (and .cse0 .cse1 .cse2) (= (select (select |#memory_int| |ULTIMATE.start_main_#t~ret13.base|) (+ .cse3 (- 1))) 0) .cse4) .cse5) (and (and .cse6 .cse7 .cse8 .cse1 (and .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) .cse16 .cse17) .cse18 .cse19) (and (and (and (exists ((v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_20 Int)) (and (<= 0 v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_20) (<= v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_20 0) (= 0 (select (select |#memory_int| |ULTIMATE.start_main_#t~ret13.base|) (+ (select |#length| |ULTIMATE.start_main_#t~ret13.base|) v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_20 (- 1)))))) .cse0 (and (and .cse20 .cse12 .cse13) .cse6 .cse8 .cse19)) .cse7 .cse1 .cse4 .cse17) .cse18 .cse16 .cse5) (and (= 1 ULTIMATE.start___VERIFIER_nondet_String_~length~0) .cse2 (= (select .cse21 ULTIMATE.start_cstrncmp_~s2.offset) 0)) (and .cse22 .cse9 .cse10 .cse11 .cse13 .cse12 .cse23 .cse16 .cse15 .cse24 .cse25 .cse26 .cse14 .cse17))))) [2020-06-22 02:07:02,716 INFO L448 ceAbstractionStarter]: For program point L31-9(lines 31 38) no Hoare annotation was computed. [2020-06-22 02:07:02,716 INFO L448 ceAbstractionStarter]: For program point L40(line 40) no Hoare annotation was computed. [2020-06-22 02:07:02,717 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. [2020-06-22 02:07:02,717 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. [2020-06-22 02:07:02,717 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. [2020-06-22 02:07:02,717 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr3REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. [2020-06-22 02:07:02,717 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr4REQUIRES_VIOLATION(line 31) no Hoare annotation was computed. [2020-06-22 02:07:02,717 INFO L448 ceAbstractionStarter]: For program point L34(line 34) no Hoare annotation was computed. [2020-06-22 02:07:02,717 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr5REQUIRES_VIOLATION(line 31) no Hoare annotation was computed. [2020-06-22 02:07:02,717 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr6REQUIRES_VIOLATION(line 31) no Hoare annotation was computed. [2020-06-22 02:07:02,717 INFO L448 ceAbstractionStarter]: For program point L34-2(line 34) no Hoare annotation was computed. [2020-06-22 02:07:02,717 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr7REQUIRES_VIOLATION(line 31) no Hoare annotation was computed. [2020-06-22 02:07:02,718 INFO L448 ceAbstractionStarter]: For program point L34-3(line 34) no Hoare annotation was computed. [2020-06-22 02:07:02,718 INFO L448 ceAbstractionStarter]: For program point L34-4(lines 34 35) no Hoare annotation was computed. [2020-06-22 02:07:02,718 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr8REQUIRES_VIOLATION(line 34) no Hoare annotation was computed. [2020-06-22 02:07:02,718 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-06-22 02:07:02,718 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr9REQUIRES_VIOLATION(line 34) no Hoare annotation was computed. [2020-06-22 02:07:02,718 INFO L448 ceAbstractionStarter]: For program point L28(lines 28 29) no Hoare annotation was computed. [2020-06-22 02:07:02,718 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr10REQUIRES_VIOLATION(line 39) no Hoare annotation was computed. [2020-06-22 02:07:02,718 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr11REQUIRES_VIOLATION(line 39) no Hoare annotation was computed. [2020-06-22 02:07:02,718 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr12REQUIRES_VIOLATION(line 40) no Hoare annotation was computed. [2020-06-22 02:07:02,718 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr13REQUIRES_VIOLATION(line 40) no Hoare annotation was computed. [2020-06-22 02:07:02,719 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 02:07:02,719 INFO L444 ceAbstractionStarter]: At program point L16-2(line 16) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset 0)) (.cse1 (= 0 |ULTIMATE.start_main_#t~ret13.offset|)) (.cse2 (= (select |#length| ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base) ULTIMATE.start___VERIFIER_nondet_String_~length~0)) (.cse3 (= 1 (select |#valid| |ULTIMATE.start_main_#t~ret13.base|))) (.cse4 (= (select |#valid| ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base) 1))) (or (and (= 1 ULTIMATE.start___VERIFIER_nondet_String_~length~0) .cse0 .cse1 (<= 1 (select |#length| |ULTIMATE.start_main_#t~ret13.base|)) .cse2 .cse3 .cse4) (and (not (= ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base |ULTIMATE.start_main_#t~ret13.base|)) (and (exists ((v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_20 Int)) (and (<= 0 v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_20) (<= v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_20 0) (= 0 (select (select |#memory_int| |ULTIMATE.start_main_#t~ret13.base|) (+ (select |#length| |ULTIMATE.start_main_#t~ret13.base|) v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_20 (- 1)))))) (and (exists ((v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18 Int) (v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_25 Int)) (and (<= (+ v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18 v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_25) (select |#length| |ULTIMATE.start_main_#t~ret13.base|)) (= (select (select |#memory_int| |ULTIMATE.start_main_#t~ret13.base|) (+ v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18 v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_25 (- 1))) 0) (<= |ULTIMATE.start_main_#t~ret13.offset| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18) (<= 1 v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_25))) (and (<= 1 ULTIMATE.start___VERIFIER_nondet_String_~length~0) .cse0 .cse1 .cse2 .cse3 .cse4)))))) [2020-06-22 02:07:02,719 INFO L448 ceAbstractionStarter]: For program point L12(lines 12 14) no Hoare annotation was computed. [2020-06-22 02:07:02,719 INFO L448 ceAbstractionStarter]: For program point L12-2(lines 12 14) no Hoare annotation was computed. [2020-06-22 02:07:02,719 INFO L448 ceAbstractionStarter]: For program point L12-3(lines 12 14) no Hoare annotation was computed. [2020-06-22 02:07:02,719 INFO L448 ceAbstractionStarter]: For program point L12-5(lines 12 14) no Hoare annotation was computed. [2020-06-22 02:07:02,720 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2020-06-22 02:07:02,727 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 02:07:02,734 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 02:07:02,738 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base,QUANTIFIED] [2020-06-22 02:07:02,739 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base,QUANTIFIED] [2020-06-22 02:07:02,739 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 02:07:02,739 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base,QUANTIFIED] [2020-06-22 02:07:02,740 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18,QUANTIFIED] [2020-06-22 02:07:02,740 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_25,QUANTIFIED] [2020-06-22 02:07:02,740 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18,QUANTIFIED] [2020-06-22 02:07:02,741 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_25,QUANTIFIED] [2020-06-22 02:07:02,741 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18,QUANTIFIED] [2020-06-22 02:07:02,741 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_25,QUANTIFIED] [2020-06-22 02:07:02,742 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_20,QUANTIFIED] [2020-06-22 02:07:02,742 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_20,QUANTIFIED] [2020-06-22 02:07:02,742 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_20,QUANTIFIED] [2020-06-22 02:07:02,742 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base,QUANTIFIED] [2020-06-22 02:07:02,743 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base,QUANTIFIED] [2020-06-22 02:07:02,743 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 02:07:02,743 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base,QUANTIFIED] [2020-06-22 02:07:02,743 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18,QUANTIFIED] [2020-06-22 02:07:02,744 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_25,QUANTIFIED] [2020-06-22 02:07:02,744 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18,QUANTIFIED] [2020-06-22 02:07:02,744 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_25,QUANTIFIED] [2020-06-22 02:07:02,744 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18,QUANTIFIED] [2020-06-22 02:07:02,745 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_25,QUANTIFIED] [2020-06-22 02:07:02,748 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 02:07:02,748 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 02:07:02,749 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 02:07:02,749 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 02:07:02,749 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 02:07:02,749 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 02:07:02,750 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 02:07:02,750 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 02:07:02,750 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 02:07:02,750 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 02:07:02,751 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 02:07:02,751 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 02:07:02,751 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 02:07:02,751 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 02:07:02,751 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 02:07:02,752 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 02:07:02,752 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 02:07:02,752 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 02:07:02,752 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 02:07:02,753 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 02:07:02,753 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 02:07:02,753 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 02:07:02,753 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 02:07:02,754 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 02:07:02,754 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 02:07:02,754 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 02:07:02,754 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 02:07:02,755 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 02:07:02,755 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 02:07:02,755 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 02:07:02,755 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 02:07:02,756 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 02:07:02,756 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 02:07:02,756 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 02:07:02,756 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 02:07:02,756 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 02:07:02,757 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 02:07:02,757 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 02:07:02,757 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 02:07:02,762 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base,QUANTIFIED] [2020-06-22 02:07:02,762 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base,QUANTIFIED] [2020-06-22 02:07:02,763 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 02:07:02,763 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base,QUANTIFIED] [2020-06-22 02:07:02,763 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18,QUANTIFIED] [2020-06-22 02:07:02,764 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_25,QUANTIFIED] [2020-06-22 02:07:02,764 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18,QUANTIFIED] [2020-06-22 02:07:02,764 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_25,QUANTIFIED] [2020-06-22 02:07:02,764 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18,QUANTIFIED] [2020-06-22 02:07:02,765 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_25,QUANTIFIED] [2020-06-22 02:07:02,765 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_20,QUANTIFIED] [2020-06-22 02:07:02,765 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_20,QUANTIFIED] [2020-06-22 02:07:02,766 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_20,QUANTIFIED] [2020-06-22 02:07:02,766 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base,QUANTIFIED] [2020-06-22 02:07:02,766 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base,QUANTIFIED] [2020-06-22 02:07:02,766 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 02:07:02,766 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base,QUANTIFIED] [2020-06-22 02:07:02,767 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18,QUANTIFIED] [2020-06-22 02:07:02,767 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_25,QUANTIFIED] [2020-06-22 02:07:02,767 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18,QUANTIFIED] [2020-06-22 02:07:02,768 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_25,QUANTIFIED] [2020-06-22 02:07:02,768 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18,QUANTIFIED] [2020-06-22 02:07:02,768 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_25,QUANTIFIED] [2020-06-22 02:07:02,771 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 02:07:02,771 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 02:07:02,771 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 02:07:02,771 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 02:07:02,772 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 02:07:02,772 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 02:07:02,772 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 02:07:02,772 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 02:07:02,773 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 02:07:02,773 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 02:07:02,773 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 02:07:02,773 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 02:07:02,773 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 02:07:02,774 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 02:07:02,774 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 02:07:02,774 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 02:07:02,775 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 02:07:02,775 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 02:07:02,775 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 02:07:02,775 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 02:07:02,776 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 02:07:02,776 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 02:07:02,776 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 02:07:02,776 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 02:07:02,777 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 02:07:02,777 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 02:07:02,777 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 02:07:02,777 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 02:07:02,777 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 02:07:02,778 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 02:07:02,778 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 02:07:02,778 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 02:07:02,778 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 02:07:02,778 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 02:07:02,779 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 02:07:02,779 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 02:07:02,779 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 02:07:02,779 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 02:07:02,779 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 02:07:02,781 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_20,QUANTIFIED] [2020-06-22 02:07:02,781 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_20,QUANTIFIED] [2020-06-22 02:07:02,781 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_20,QUANTIFIED] [2020-06-22 02:07:02,782 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18,QUANTIFIED] [2020-06-22 02:07:02,782 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_25,QUANTIFIED] [2020-06-22 02:07:02,782 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18,QUANTIFIED] [2020-06-22 02:07:02,782 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_25,QUANTIFIED] [2020-06-22 02:07:02,783 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18,QUANTIFIED] [2020-06-22 02:07:02,783 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_25,QUANTIFIED] [2020-06-22 02:07:02,783 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 02:07:02,784 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 02:07:02,784 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 02:07:02,784 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 02:07:02,784 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 02:07:02,784 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 02:07:02,785 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 02:07:02,785 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_20,QUANTIFIED] [2020-06-22 02:07:02,785 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_20,QUANTIFIED] [2020-06-22 02:07:02,786 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_20,QUANTIFIED] [2020-06-22 02:07:02,786 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18,QUANTIFIED] [2020-06-22 02:07:02,786 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_25,QUANTIFIED] [2020-06-22 02:07:02,786 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18,QUANTIFIED] [2020-06-22 02:07:02,787 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_25,QUANTIFIED] [2020-06-22 02:07:02,787 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18,QUANTIFIED] [2020-06-22 02:07:02,787 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_25,QUANTIFIED] [2020-06-22 02:07:02,788 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 02:07:02,788 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 02:07:02,788 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 02:07:02,788 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 02:07:02,788 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 02:07:02,789 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 02:07:02,789 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 02:07:02,791 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 02:07:02 BasicIcfg [2020-06-22 02:07:02,791 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-06-22 02:07:02,792 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-06-22 02:07:02,792 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-06-22 02:07:02,795 INFO L276 PluginConnector]: BuchiAutomizer initialized [2020-06-22 02:07:02,796 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 02:07:02,796 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.06 02:06:27" (1/5) ... [2020-06-22 02:07:02,797 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@23cef6e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.06 02:07:02, skipping insertion in model container [2020-06-22 02:07:02,797 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 02:07:02,797 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 02:06:28" (2/5) ... [2020-06-22 02:07:02,797 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@23cef6e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.06 02:07:02, skipping insertion in model container [2020-06-22 02:07:02,797 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 02:07:02,797 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 02:06:28" (3/5) ... [2020-06-22 02:07:02,797 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@23cef6e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 02:07:02, skipping insertion in model container [2020-06-22 02:07:02,798 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 02:07:02,798 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 02:06:28" (4/5) ... [2020-06-22 02:07:02,798 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@23cef6e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 02:07:02, skipping insertion in model container [2020-06-22 02:07:02,798 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 02:07:02,798 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 02:07:02" (5/5) ... [2020-06-22 02:07:02,800 INFO L375 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-06-22 02:07:02,821 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2020-06-22 02:07:02,821 INFO L374 BuchiCegarLoop]: Interprodecural is true [2020-06-22 02:07:02,821 INFO L375 BuchiCegarLoop]: Hoare is true [2020-06-22 02:07:02,821 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-06-22 02:07:02,821 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-06-22 02:07:02,821 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-06-22 02:07:02,821 INFO L379 BuchiCegarLoop]: Difference is false [2020-06-22 02:07:02,821 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-06-22 02:07:02,821 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-06-22 02:07:02,825 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states. [2020-06-22 02:07:02,830 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2020-06-22 02:07:02,830 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 02:07:02,830 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 02:07:02,834 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 02:07:02,834 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2020-06-22 02:07:02,834 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2020-06-22 02:07:02,835 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states. [2020-06-22 02:07:02,836 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2020-06-22 02:07:02,836 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 02:07:02,836 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 02:07:02,837 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 02:07:02,837 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2020-06-22 02:07:02,842 INFO L794 eck$LassoCheckResult]: Stem: 31#ULTIMATE.startENTRYtrue [221] ULTIMATE.startENTRY-->L12: Formula: (and (= (store |v_#valid_22| 0 0) |v_#valid_21|) (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|)) InVars {#valid=|v_#valid_22|} OutVars{ULTIMATE.start___VERIFIER_nondet_String_#res.offset=|v_ULTIMATE.start___VERIFIER_nondet_String_#res.offset_7|, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset_5|, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~ret13.base=|v_ULTIMATE.start_main_#t~ret13.base_5|, ULTIMATE.start_main_#t~ret14.base=|v_ULTIMATE.start_main_#t~ret14.base_4|, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~ret16=|v_ULTIMATE.start_main_#t~ret16_4|, ULTIMATE.start_main_#t~ret13.offset=|v_ULTIMATE.start_main_#t~ret13.offset_5|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_11, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, #valid=|v_#valid_21|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_4|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_18, ULTIMATE.start___VERIFIER_nondet_String_#t~nondet0=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~nondet0_8|, ULTIMATE.start___VERIFIER_nondet_String_#res.base=|v_ULTIMATE.start___VERIFIER_nondet_String_#res.base_7|, ULTIMATE.start_main_#t~ret14.offset=|v_ULTIMATE.start_main_#t~ret14.offset_4|, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_5|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_13} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_nondet_String_#res.offset, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset, #NULL.offset, ULTIMATE.start_main_#t~ret13.base, ULTIMATE.start_main_#t~ret14.base, #NULL.base, ULTIMATE.start_main_#t~ret16, ULTIMATE.start_main_#t~ret13.offset, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_#t~nondet15, 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~ret14.offset, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base] 19#L12true [121] 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] 16#L12-2true [175] 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 [223] L16-->L12-3: Formula: (let ((.cse0 (+ v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_14 v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_21))) (and (<= 1 .cse0) (= |v_ULTIMATE.start_main_#t~ret13.offset_6| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_14) (= v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_16 |v_ULTIMATE.start_main_#t~ret13.base_6|) (= (store |v_#memory_int_13| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_16 (store (select |v_#memory_int_13| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_16) (+ v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_14 v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_21 (- 1)) 0)) |v_#memory_int_12|) (= 1 (select |v_#valid_24| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_16)) (<= .cse0 (select |v_#length_20| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_16)))) InVars {ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_14, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_13|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_21, #length=|v_#length_20|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_16} OutVars{ULTIMATE.start___VERIFIER_nondet_String_#res.offset=|v_ULTIMATE.start___VERIFIER_nondet_String_#res.offset_9|, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset_6|, ULTIMATE.start_main_#t~ret13.base=|v_ULTIMATE.start_main_#t~ret13.base_6|, ULTIMATE.start_main_#t~ret13.offset=|v_ULTIMATE.start_main_#t~ret13.offset_6|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_13, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_12|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_20, #length=|v_#length_20|, ULTIMATE.start___VERIFIER_nondet_String_#t~nondet0=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~nondet0_10|, ULTIMATE.start___VERIFIER_nondet_String_#res.base=|v_ULTIMATE.start___VERIFIER_nondet_String_#res.base_9|, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_6|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_15} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_nondet_String_#res.offset, ULTIMATE.start_main_#t~ret13.offset, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset, #memory_int, ULTIMATE.start___VERIFIER_nondet_String_~length~0, ULTIMATE.start___VERIFIER_nondet_String_#t~nondet0, ULTIMATE.start_main_#t~ret13.base, ULTIMATE.start___VERIFIER_nondet_String_#res.base, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base] 30#L12-3true [154] L12-3-->L12-5: Formula: (>= v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_14 1) InVars {ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_14} OutVars{ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_14} AuxVars[] AssignedVars[] 28#L12-5true [181] L12-5-->L16-2: Formula: (and (= v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_7 |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset_4|) (= (store |v_#valid_8| |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_4| 1) |v_#valid_7|) (= (select |v_#valid_8| |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_4|) 0) (= v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_8 |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_4|) (= |v_#length_5| (store |v_#length_6| |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_4| v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_15)) (> 0 |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_4|) (= 0 |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset_4|) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_4|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_15, #length=|v_#length_6|, #valid=|v_#valid_8|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset_4|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_7, #valid=|v_#valid_7|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_15, #length=|v_#length_5|, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_4|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_8} 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] 24#L16-2true [225] L16-2-->L28: Formula: (let ((.cse0 (+ v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_16 v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_23))) (and (= |v_ULTIMATE.start___VERIFIER_nondet_String_#res.base_12| |v_ULTIMATE.start_main_#t~ret14.base_5|) (= |v_ULTIMATE.start_cstrncmp_#in~s1.offset_2| |v_ULTIMATE.start_main_#t~ret13.offset_7|) (= |v_ULTIMATE.start_main_#t~ret14.base_5| |v_ULTIMATE.start_cstrncmp_#in~s2.base_2|) (= |v_ULTIMATE.start_cstrncmp_#in~s2.offset_2| |v_ULTIMATE.start_main_#t~ret14.offset_5|) (= |v_ULTIMATE.start_main_#t~nondet15_5| |v_ULTIMATE.start_cstrncmp_#in~n_2|) (= v_ULTIMATE.start_cstrncmp_~s2.base_11 |v_ULTIMATE.start_cstrncmp_#in~s2.base_2|) (= |v_ULTIMATE.start_cstrncmp_#in~s1.base_2| |v_ULTIMATE.start_main_#t~ret13.base_7|) (<= 1 .cse0) (= |v_ULTIMATE.start___VERIFIER_nondet_String_#res.base_12| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_18) (= v_ULTIMATE.start_cstrncmp_~n_8 |v_ULTIMATE.start_cstrncmp_#in~n_2|) (= v_ULTIMATE.start_cstrncmp_~s2.offset_9 |v_ULTIMATE.start_cstrncmp_#in~s2.offset_2|) (= v_ULTIMATE.start_cstrncmp_~s1.base_14 |v_ULTIMATE.start_cstrncmp_#in~s1.base_2|) (= |v_ULTIMATE.start___VERIFIER_nondet_String_#res.offset_12| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_16) (<= .cse0 (select |v_#length_22| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_18)) (= 1 (select |v_#valid_26| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_18)) (= |v_ULTIMATE.start_cstrncmp_#in~s1.offset_2| v_ULTIMATE.start_cstrncmp_~s1.offset_11) (= |v_ULTIMATE.start_main_#t~ret14.offset_5| |v_ULTIMATE.start___VERIFIER_nondet_String_#res.offset_12|) (= (store |v_#memory_int_17| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_18 (store (select |v_#memory_int_17| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_18) (+ v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_16 v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_23 (- 1)) 0)) |v_#memory_int_16|))) InVars {ULTIMATE.start_main_#t~ret13.offset=|v_ULTIMATE.start_main_#t~ret13.offset_7|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_16, #valid=|v_#valid_26|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_5|, #memory_int=|v_#memory_int_17|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_23, #length=|v_#length_22|, ULTIMATE.start_main_#t~ret13.base=|v_ULTIMATE.start_main_#t~ret13.base_7|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_18} OutVars{ULTIMATE.start_cstrncmp_#t~mem6=|v_ULTIMATE.start_cstrncmp_#t~mem6_6|, ULTIMATE.start_cstrncmp_~s2.base=v_ULTIMATE.start_cstrncmp_~s2.base_11, ULTIMATE.start_cstrncmp_#res=|v_ULTIMATE.start_cstrncmp_#res_6|, ULTIMATE.start_cstrncmp_#t~mem3=|v_ULTIMATE.start_cstrncmp_#t~mem3_6|, ULTIMATE.start_cstrncmp_#t~mem4=|v_ULTIMATE.start_cstrncmp_#t~mem4_6|, ULTIMATE.start_cstrncmp_~s1.base=v_ULTIMATE.start_cstrncmp_~s1.base_14, ULTIMATE.start_cstrncmp_#t~post9.offset=|v_ULTIMATE.start_cstrncmp_#t~post9.offset_4|, ULTIMATE.start_cstrncmp_#t~post8.offset=|v_ULTIMATE.start_cstrncmp_#t~post8.offset_4|, ULTIMATE.start_cstrncmp_#t~post8.base=|v_ULTIMATE.start_cstrncmp_#t~post8.base_4|, ULTIMATE.start_cstrncmp_#t~post9.base=|v_ULTIMATE.start_cstrncmp_#t~post9.base_4|, ULTIMATE.start_cstrncmp_#in~s2.offset=|v_ULTIMATE.start_cstrncmp_#in~s2.offset_2|, ULTIMATE.start_cstrncmp_#t~ite12=|v_ULTIMATE.start_cstrncmp_#t~ite12_6|, #length=|v_#length_22|, ULTIMATE.start_cstrncmp_~n=v_ULTIMATE.start_cstrncmp_~n_8, ULTIMATE.start_main_#t~ret14.offset=|v_ULTIMATE.start_main_#t~ret14.offset_5|, ULTIMATE.start___VERIFIER_nondet_String_#res.base=|v_ULTIMATE.start___VERIFIER_nondet_String_#res.base_12|, ULTIMATE.start_cstrncmp_~s1.offset=v_ULTIMATE.start_cstrncmp_~s1.offset_11, ULTIMATE.start_cstrncmp_#t~post2=|v_ULTIMATE.start_cstrncmp_#t~post2_5|, ULTIMATE.start___VERIFIER_nondet_String_#res.offset=|v_ULTIMATE.start___VERIFIER_nondet_String_#res.offset_12|, ULTIMATE.start_cstrncmp_~uc2~0=v_ULTIMATE.start_cstrncmp_~uc2~0_6, ULTIMATE.start_cstrncmp_#in~n=|v_ULTIMATE.start_cstrncmp_#in~n_2|, ULTIMATE.start_cstrncmp_~uc1~0=v_ULTIMATE.start_cstrncmp_~uc1~0_6, ULTIMATE.start_main_#t~ret13.base=|v_ULTIMATE.start_main_#t~ret13.base_7|, ULTIMATE.start_cstrncmp_#in~s1.offset=|v_ULTIMATE.start_cstrncmp_#in~s1.offset_2|, ULTIMATE.start_cstrncmp_#t~mem11=|v_ULTIMATE.start_cstrncmp_#t~mem11_5|, ULTIMATE.start_main_#t~ret14.base=|v_ULTIMATE.start_main_#t~ret14.base_5|, ULTIMATE.start_cstrncmp_~s2.offset=v_ULTIMATE.start_cstrncmp_~s2.offset_9, ULTIMATE.start_main_#t~ret13.offset=|v_ULTIMATE.start_main_#t~ret13.offset_7|, ULTIMATE.start_cstrncmp_#t~mem10=|v_ULTIMATE.start_cstrncmp_#t~mem10_5|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_16, ULTIMATE.start_cstrncmp_#in~s2.base=|v_ULTIMATE.start_cstrncmp_#in~s2.base_2|, ULTIMATE.start_cstrncmp_#in~s1.base=|v_ULTIMATE.start_cstrncmp_#in~s1.base_2|, #valid=|v_#valid_26|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_5|, #memory_int=|v_#memory_int_16|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_23, ULTIMATE.start_cstrncmp_#t~short5=|v_ULTIMATE.start_cstrncmp_#t~short5_10|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_18, ULTIMATE.start_cstrncmp_#t~short7=|v_ULTIMATE.start_cstrncmp_#t~short7_10|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncmp_#t~mem6, ULTIMATE.start_cstrncmp_~s2.base, ULTIMATE.start_cstrncmp_#res, ULTIMATE.start_cstrncmp_#t~mem3, ULTIMATE.start_cstrncmp_#t~mem4, ULTIMATE.start_cstrncmp_~s1.base, ULTIMATE.start_cstrncmp_#t~post9.offset, ULTIMATE.start_cstrncmp_#t~post8.offset, ULTIMATE.start_cstrncmp_#t~post8.base, ULTIMATE.start_cstrncmp_#t~post9.base, ULTIMATE.start_cstrncmp_#in~s2.offset, ULTIMATE.start_cstrncmp_#t~ite12, ULTIMATE.start_cstrncmp_~n, ULTIMATE.start_main_#t~ret14.offset, ULTIMATE.start___VERIFIER_nondet_String_#res.base, ULTIMATE.start_cstrncmp_~s1.offset, ULTIMATE.start_cstrncmp_#t~post2, ULTIMATE.start___VERIFIER_nondet_String_#res.offset, ULTIMATE.start_cstrncmp_~uc2~0, ULTIMATE.start_cstrncmp_#in~n, ULTIMATE.start_cstrncmp_~uc1~0, ULTIMATE.start_cstrncmp_#in~s1.offset, ULTIMATE.start_cstrncmp_#t~mem11, ULTIMATE.start_main_#t~ret14.base, ULTIMATE.start_cstrncmp_~s2.offset, ULTIMATE.start_cstrncmp_#t~mem10, ULTIMATE.start_cstrncmp_#in~s2.base, ULTIMATE.start_cstrncmp_#in~s1.base, #memory_int, ULTIMATE.start_cstrncmp_#t~short5, ULTIMATE.start_cstrncmp_#t~short7] 27#L28true [187] L28-->L31-8: Formula: (> v_ULTIMATE.start_cstrncmp_~n_4 0) InVars {ULTIMATE.start_cstrncmp_~n=v_ULTIMATE.start_cstrncmp_~n_4} OutVars{ULTIMATE.start_cstrncmp_~n=v_ULTIMATE.start_cstrncmp_~n_4} AuxVars[] AssignedVars[] 20#L31-8true [2020-06-22 02:07:02,843 INFO L796 eck$LassoCheckResult]: Loop: 20#L31-8true [188] L31-8-->L31-1: Formula: (and (= v_ULTIMATE.start_cstrncmp_~n_5 (+ |v_ULTIMATE.start_cstrncmp_#t~post2_2| (- 1))) (not |v_ULTIMATE.start_cstrncmp_#t~short5_2|) (>= 0 |v_ULTIMATE.start_cstrncmp_#t~post2_2|) (= |v_ULTIMATE.start_cstrncmp_#t~post2_2| v_ULTIMATE.start_cstrncmp_~n_6)) InVars {ULTIMATE.start_cstrncmp_~n=v_ULTIMATE.start_cstrncmp_~n_6} OutVars{ULTIMATE.start_cstrncmp_~n=v_ULTIMATE.start_cstrncmp_~n_5, ULTIMATE.start_cstrncmp_#t~short5=|v_ULTIMATE.start_cstrncmp_#t~short5_2|, ULTIMATE.start_cstrncmp_#t~post2=|v_ULTIMATE.start_cstrncmp_#t~post2_2|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncmp_~n, ULTIMATE.start_cstrncmp_#t~short5, ULTIMATE.start_cstrncmp_#t~post2] 13#L31-1true [111] L31-1-->L31-6: Formula: (not |v_ULTIMATE.start_cstrncmp_#t~short5_5|) InVars {ULTIMATE.start_cstrncmp_#t~short5=|v_ULTIMATE.start_cstrncmp_#t~short5_5|} OutVars{ULTIMATE.start_cstrncmp_#t~short5=|v_ULTIMATE.start_cstrncmp_#t~short5_5|} AuxVars[] AssignedVars[] 25#L31-6true [198] L31-6-->L34: Formula: (and |v_ULTIMATE.start_cstrncmp_#t~short5_9| (not |v_ULTIMATE.start_cstrncmp_#t~short7_2|) (> v_ULTIMATE.start_cstrncmp_~n_7 0)) InVars {ULTIMATE.start_cstrncmp_#t~short5=|v_ULTIMATE.start_cstrncmp_#t~short5_9|, ULTIMATE.start_cstrncmp_~n=v_ULTIMATE.start_cstrncmp_~n_7} OutVars{ULTIMATE.start_cstrncmp_#t~mem4=|v_ULTIMATE.start_cstrncmp_#t~mem4_5|, ULTIMATE.start_cstrncmp_#t~mem3=|v_ULTIMATE.start_cstrncmp_#t~mem3_5|, ULTIMATE.start_cstrncmp_~n=v_ULTIMATE.start_cstrncmp_~n_7, ULTIMATE.start_cstrncmp_#t~short5=|v_ULTIMATE.start_cstrncmp_#t~short5_8|, ULTIMATE.start_cstrncmp_#t~post2=|v_ULTIMATE.start_cstrncmp_#t~post2_4|, ULTIMATE.start_cstrncmp_#t~short7=|v_ULTIMATE.start_cstrncmp_#t~short7_2|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncmp_#t~mem4, ULTIMATE.start_cstrncmp_#t~mem3, ULTIMATE.start_cstrncmp_#t~short5, ULTIMATE.start_cstrncmp_#t~post2, ULTIMATE.start_cstrncmp_#t~short7] 21#L34true [125] L34-->L34-4: Formula: |v_ULTIMATE.start_cstrncmp_#t~short7_3| InVars {ULTIMATE.start_cstrncmp_#t~short7=|v_ULTIMATE.start_cstrncmp_#t~short7_3|} OutVars{ULTIMATE.start_cstrncmp_#t~short7=|v_ULTIMATE.start_cstrncmp_#t~short7_3|} AuxVars[] AssignedVars[] 29#L34-4true [144] L34-4-->L31-8: Formula: (and (= v_ULTIMATE.start_cstrncmp_~s1.offset_7 (+ v_ULTIMATE.start_cstrncmp_~s1.offset_8 1)) (= v_ULTIMATE.start_cstrncmp_~s2.offset_5 (+ v_ULTIMATE.start_cstrncmp_~s2.offset_6 1)) (not |v_ULTIMATE.start_cstrncmp_#t~short7_9|) (= v_ULTIMATE.start_cstrncmp_~s1.base_9 v_ULTIMATE.start_cstrncmp_~s1.base_10) (= v_ULTIMATE.start_cstrncmp_~s2.base_7 v_ULTIMATE.start_cstrncmp_~s2.base_6)) InVars {ULTIMATE.start_cstrncmp_~s2.offset=v_ULTIMATE.start_cstrncmp_~s2.offset_6, ULTIMATE.start_cstrncmp_~s2.base=v_ULTIMATE.start_cstrncmp_~s2.base_7, ULTIMATE.start_cstrncmp_~s1.base=v_ULTIMATE.start_cstrncmp_~s1.base_10, ULTIMATE.start_cstrncmp_~s1.offset=v_ULTIMATE.start_cstrncmp_~s1.offset_8, ULTIMATE.start_cstrncmp_#t~short7=|v_ULTIMATE.start_cstrncmp_#t~short7_9|} OutVars{ULTIMATE.start_cstrncmp_~s2.offset=v_ULTIMATE.start_cstrncmp_~s2.offset_5, ULTIMATE.start_cstrncmp_#t~post8.offset=|v_ULTIMATE.start_cstrncmp_#t~post8.offset_2|, ULTIMATE.start_cstrncmp_#t~mem6=|v_ULTIMATE.start_cstrncmp_#t~mem6_5|, ULTIMATE.start_cstrncmp_#t~post9.base=|v_ULTIMATE.start_cstrncmp_#t~post9.base_2|, ULTIMATE.start_cstrncmp_~s2.base=v_ULTIMATE.start_cstrncmp_~s2.base_6, ULTIMATE.start_cstrncmp_#t~post8.base=|v_ULTIMATE.start_cstrncmp_#t~post8.base_2|, ULTIMATE.start_cstrncmp_~s1.base=v_ULTIMATE.start_cstrncmp_~s1.base_9, ULTIMATE.start_cstrncmp_#t~post9.offset=|v_ULTIMATE.start_cstrncmp_#t~post9.offset_2|, ULTIMATE.start_cstrncmp_~s1.offset=v_ULTIMATE.start_cstrncmp_~s1.offset_7, ULTIMATE.start_cstrncmp_#t~short7=|v_ULTIMATE.start_cstrncmp_#t~short7_8|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncmp_~s2.offset, ULTIMATE.start_cstrncmp_#t~post8.offset, ULTIMATE.start_cstrncmp_#t~mem6, ULTIMATE.start_cstrncmp_#t~post9.base, ULTIMATE.start_cstrncmp_~s2.base, ULTIMATE.start_cstrncmp_#t~post8.base, ULTIMATE.start_cstrncmp_~s1.base, ULTIMATE.start_cstrncmp_#t~post9.offset, ULTIMATE.start_cstrncmp_~s1.offset, ULTIMATE.start_cstrncmp_#t~short7] 20#L31-8true [2020-06-22 02:07:02,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 02:07:02,843 INFO L82 PathProgramCache]: Analyzing trace with hash 2041151458, now seen corresponding path program 1 times [2020-06-22 02:07:02,843 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 02:07:02,844 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 02:07:02,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:07:02,845 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 02:07:02,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:07:02,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 02:07:02,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 02:07:02,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 02:07:02,873 INFO L82 PathProgramCache]: Analyzing trace with hash 205752197, now seen corresponding path program 1 times [2020-06-22 02:07:02,873 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 02:07:02,874 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 02:07:02,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:07:02,874 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 02:07:02,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:07:02,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 02:07:02,882 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 02:07:02,882 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 02:07:02,882 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 02:07:02,883 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-06-22 02:07:02,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 02:07:02,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 02:07:02,884 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 3 states. [2020-06-22 02:07:02,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 02:07:02,979 INFO L93 Difference]: Finished difference Result 56 states and 100 transitions. [2020-06-22 02:07:02,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 02:07:02,982 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 56 states and 100 transitions. [2020-06-22 02:07:02,984 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2020-06-22 02:07:02,985 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 56 states to 28 states and 48 transitions. [2020-06-22 02:07:02,986 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2020-06-22 02:07:02,986 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2020-06-22 02:07:02,987 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 48 transitions. [2020-06-22 02:07:02,987 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 02:07:02,987 INFO L706 BuchiCegarLoop]: Abstraction has 28 states and 48 transitions. [2020-06-22 02:07:02,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 48 transitions. [2020-06-22 02:07:02,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2020-06-22 02:07:02,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-06-22 02:07:02,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 48 transitions. [2020-06-22 02:07:02,990 INFO L729 BuchiCegarLoop]: Abstraction has 28 states and 48 transitions. [2020-06-22 02:07:02,990 INFO L609 BuchiCegarLoop]: Abstraction has 28 states and 48 transitions. [2020-06-22 02:07:02,990 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2020-06-22 02:07:02,990 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 48 transitions. [2020-06-22 02:07:02,991 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2020-06-22 02:07:02,991 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 02:07:02,991 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 02:07:02,992 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 02:07:02,992 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2020-06-22 02:07:02,993 INFO L794 eck$LassoCheckResult]: Stem: 117#ULTIMATE.startENTRY [221] ULTIMATE.startENTRY-->L12: Formula: (and (= (store |v_#valid_22| 0 0) |v_#valid_21|) (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|)) InVars {#valid=|v_#valid_22|} OutVars{ULTIMATE.start___VERIFIER_nondet_String_#res.offset=|v_ULTIMATE.start___VERIFIER_nondet_String_#res.offset_7|, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset_5|, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~ret13.base=|v_ULTIMATE.start_main_#t~ret13.base_5|, ULTIMATE.start_main_#t~ret14.base=|v_ULTIMATE.start_main_#t~ret14.base_4|, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~ret16=|v_ULTIMATE.start_main_#t~ret16_4|, ULTIMATE.start_main_#t~ret13.offset=|v_ULTIMATE.start_main_#t~ret13.offset_5|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_11, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, #valid=|v_#valid_21|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_4|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_18, ULTIMATE.start___VERIFIER_nondet_String_#t~nondet0=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~nondet0_8|, ULTIMATE.start___VERIFIER_nondet_String_#res.base=|v_ULTIMATE.start___VERIFIER_nondet_String_#res.base_7|, ULTIMATE.start_main_#t~ret14.offset=|v_ULTIMATE.start_main_#t~ret14.offset_4|, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_5|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_13} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_nondet_String_#res.offset, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset, #NULL.offset, ULTIMATE.start_main_#t~ret13.base, ULTIMATE.start_main_#t~ret14.base, #NULL.base, ULTIMATE.start_main_#t~ret16, ULTIMATE.start_main_#t~ret13.offset, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_#t~nondet15, 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~ret14.offset, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base] 118#L12 [121] 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] 115#L12-2 [175] 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] 99#L16 [223] L16-->L12-3: Formula: (let ((.cse0 (+ v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_14 v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_21))) (and (<= 1 .cse0) (= |v_ULTIMATE.start_main_#t~ret13.offset_6| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_14) (= v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_16 |v_ULTIMATE.start_main_#t~ret13.base_6|) (= (store |v_#memory_int_13| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_16 (store (select |v_#memory_int_13| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_16) (+ v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_14 v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_21 (- 1)) 0)) |v_#memory_int_12|) (= 1 (select |v_#valid_24| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_16)) (<= .cse0 (select |v_#length_20| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_16)))) InVars {ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_14, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_13|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_21, #length=|v_#length_20|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_16} OutVars{ULTIMATE.start___VERIFIER_nondet_String_#res.offset=|v_ULTIMATE.start___VERIFIER_nondet_String_#res.offset_9|, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset_6|, ULTIMATE.start_main_#t~ret13.base=|v_ULTIMATE.start_main_#t~ret13.base_6|, ULTIMATE.start_main_#t~ret13.offset=|v_ULTIMATE.start_main_#t~ret13.offset_6|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_13, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_12|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_20, #length=|v_#length_20|, ULTIMATE.start___VERIFIER_nondet_String_#t~nondet0=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~nondet0_10|, ULTIMATE.start___VERIFIER_nondet_String_#res.base=|v_ULTIMATE.start___VERIFIER_nondet_String_#res.base_9|, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_6|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_15} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_nondet_String_#res.offset, ULTIMATE.start_main_#t~ret13.offset, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset, #memory_int, ULTIMATE.start___VERIFIER_nondet_String_~length~0, ULTIMATE.start___VERIFIER_nondet_String_#t~nondet0, ULTIMATE.start_main_#t~ret13.base, ULTIMATE.start___VERIFIER_nondet_String_#res.base, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base] 100#L12-3 [154] L12-3-->L12-5: Formula: (>= v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_14 1) InVars {ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_14} OutVars{ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_14} AuxVars[] AssignedVars[] 107#L12-5 [181] L12-5-->L16-2: Formula: (and (= v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_7 |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset_4|) (= (store |v_#valid_8| |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_4| 1) |v_#valid_7|) (= (select |v_#valid_8| |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_4|) 0) (= v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_8 |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_4|) (= |v_#length_5| (store |v_#length_6| |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_4| v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_15)) (> 0 |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_4|) (= 0 |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset_4|) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_4|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_15, #length=|v_#length_6|, #valid=|v_#valid_8|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset_4|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_7, #valid=|v_#valid_7|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_15, #length=|v_#length_5|, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_4|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_8} 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] 108#L16-2 [225] L16-2-->L28: Formula: (let ((.cse0 (+ v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_16 v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_23))) (and (= |v_ULTIMATE.start___VERIFIER_nondet_String_#res.base_12| |v_ULTIMATE.start_main_#t~ret14.base_5|) (= |v_ULTIMATE.start_cstrncmp_#in~s1.offset_2| |v_ULTIMATE.start_main_#t~ret13.offset_7|) (= |v_ULTIMATE.start_main_#t~ret14.base_5| |v_ULTIMATE.start_cstrncmp_#in~s2.base_2|) (= |v_ULTIMATE.start_cstrncmp_#in~s2.offset_2| |v_ULTIMATE.start_main_#t~ret14.offset_5|) (= |v_ULTIMATE.start_main_#t~nondet15_5| |v_ULTIMATE.start_cstrncmp_#in~n_2|) (= v_ULTIMATE.start_cstrncmp_~s2.base_11 |v_ULTIMATE.start_cstrncmp_#in~s2.base_2|) (= |v_ULTIMATE.start_cstrncmp_#in~s1.base_2| |v_ULTIMATE.start_main_#t~ret13.base_7|) (<= 1 .cse0) (= |v_ULTIMATE.start___VERIFIER_nondet_String_#res.base_12| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_18) (= v_ULTIMATE.start_cstrncmp_~n_8 |v_ULTIMATE.start_cstrncmp_#in~n_2|) (= v_ULTIMATE.start_cstrncmp_~s2.offset_9 |v_ULTIMATE.start_cstrncmp_#in~s2.offset_2|) (= v_ULTIMATE.start_cstrncmp_~s1.base_14 |v_ULTIMATE.start_cstrncmp_#in~s1.base_2|) (= |v_ULTIMATE.start___VERIFIER_nondet_String_#res.offset_12| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_16) (<= .cse0 (select |v_#length_22| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_18)) (= 1 (select |v_#valid_26| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_18)) (= |v_ULTIMATE.start_cstrncmp_#in~s1.offset_2| v_ULTIMATE.start_cstrncmp_~s1.offset_11) (= |v_ULTIMATE.start_main_#t~ret14.offset_5| |v_ULTIMATE.start___VERIFIER_nondet_String_#res.offset_12|) (= (store |v_#memory_int_17| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_18 (store (select |v_#memory_int_17| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_18) (+ v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_16 v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_23 (- 1)) 0)) |v_#memory_int_16|))) InVars {ULTIMATE.start_main_#t~ret13.offset=|v_ULTIMATE.start_main_#t~ret13.offset_7|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_16, #valid=|v_#valid_26|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_5|, #memory_int=|v_#memory_int_17|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_23, #length=|v_#length_22|, ULTIMATE.start_main_#t~ret13.base=|v_ULTIMATE.start_main_#t~ret13.base_7|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_18} OutVars{ULTIMATE.start_cstrncmp_#t~mem6=|v_ULTIMATE.start_cstrncmp_#t~mem6_6|, ULTIMATE.start_cstrncmp_~s2.base=v_ULTIMATE.start_cstrncmp_~s2.base_11, ULTIMATE.start_cstrncmp_#res=|v_ULTIMATE.start_cstrncmp_#res_6|, ULTIMATE.start_cstrncmp_#t~mem3=|v_ULTIMATE.start_cstrncmp_#t~mem3_6|, ULTIMATE.start_cstrncmp_#t~mem4=|v_ULTIMATE.start_cstrncmp_#t~mem4_6|, ULTIMATE.start_cstrncmp_~s1.base=v_ULTIMATE.start_cstrncmp_~s1.base_14, ULTIMATE.start_cstrncmp_#t~post9.offset=|v_ULTIMATE.start_cstrncmp_#t~post9.offset_4|, ULTIMATE.start_cstrncmp_#t~post8.offset=|v_ULTIMATE.start_cstrncmp_#t~post8.offset_4|, ULTIMATE.start_cstrncmp_#t~post8.base=|v_ULTIMATE.start_cstrncmp_#t~post8.base_4|, ULTIMATE.start_cstrncmp_#t~post9.base=|v_ULTIMATE.start_cstrncmp_#t~post9.base_4|, ULTIMATE.start_cstrncmp_#in~s2.offset=|v_ULTIMATE.start_cstrncmp_#in~s2.offset_2|, ULTIMATE.start_cstrncmp_#t~ite12=|v_ULTIMATE.start_cstrncmp_#t~ite12_6|, #length=|v_#length_22|, ULTIMATE.start_cstrncmp_~n=v_ULTIMATE.start_cstrncmp_~n_8, ULTIMATE.start_main_#t~ret14.offset=|v_ULTIMATE.start_main_#t~ret14.offset_5|, ULTIMATE.start___VERIFIER_nondet_String_#res.base=|v_ULTIMATE.start___VERIFIER_nondet_String_#res.base_12|, ULTIMATE.start_cstrncmp_~s1.offset=v_ULTIMATE.start_cstrncmp_~s1.offset_11, ULTIMATE.start_cstrncmp_#t~post2=|v_ULTIMATE.start_cstrncmp_#t~post2_5|, ULTIMATE.start___VERIFIER_nondet_String_#res.offset=|v_ULTIMATE.start___VERIFIER_nondet_String_#res.offset_12|, ULTIMATE.start_cstrncmp_~uc2~0=v_ULTIMATE.start_cstrncmp_~uc2~0_6, ULTIMATE.start_cstrncmp_#in~n=|v_ULTIMATE.start_cstrncmp_#in~n_2|, ULTIMATE.start_cstrncmp_~uc1~0=v_ULTIMATE.start_cstrncmp_~uc1~0_6, ULTIMATE.start_main_#t~ret13.base=|v_ULTIMATE.start_main_#t~ret13.base_7|, ULTIMATE.start_cstrncmp_#in~s1.offset=|v_ULTIMATE.start_cstrncmp_#in~s1.offset_2|, ULTIMATE.start_cstrncmp_#t~mem11=|v_ULTIMATE.start_cstrncmp_#t~mem11_5|, ULTIMATE.start_main_#t~ret14.base=|v_ULTIMATE.start_main_#t~ret14.base_5|, ULTIMATE.start_cstrncmp_~s2.offset=v_ULTIMATE.start_cstrncmp_~s2.offset_9, ULTIMATE.start_main_#t~ret13.offset=|v_ULTIMATE.start_main_#t~ret13.offset_7|, ULTIMATE.start_cstrncmp_#t~mem10=|v_ULTIMATE.start_cstrncmp_#t~mem10_5|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_16, ULTIMATE.start_cstrncmp_#in~s2.base=|v_ULTIMATE.start_cstrncmp_#in~s2.base_2|, ULTIMATE.start_cstrncmp_#in~s1.base=|v_ULTIMATE.start_cstrncmp_#in~s1.base_2|, #valid=|v_#valid_26|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_5|, #memory_int=|v_#memory_int_16|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_23, ULTIMATE.start_cstrncmp_#t~short5=|v_ULTIMATE.start_cstrncmp_#t~short5_10|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_18, ULTIMATE.start_cstrncmp_#t~short7=|v_ULTIMATE.start_cstrncmp_#t~short7_10|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncmp_#t~mem6, ULTIMATE.start_cstrncmp_~s2.base, ULTIMATE.start_cstrncmp_#res, ULTIMATE.start_cstrncmp_#t~mem3, ULTIMATE.start_cstrncmp_#t~mem4, ULTIMATE.start_cstrncmp_~s1.base, ULTIMATE.start_cstrncmp_#t~post9.offset, ULTIMATE.start_cstrncmp_#t~post8.offset, ULTIMATE.start_cstrncmp_#t~post8.base, ULTIMATE.start_cstrncmp_#t~post9.base, ULTIMATE.start_cstrncmp_#in~s2.offset, ULTIMATE.start_cstrncmp_#t~ite12, ULTIMATE.start_cstrncmp_~n, ULTIMATE.start_main_#t~ret14.offset, ULTIMATE.start___VERIFIER_nondet_String_#res.base, ULTIMATE.start_cstrncmp_~s1.offset, ULTIMATE.start_cstrncmp_#t~post2, ULTIMATE.start___VERIFIER_nondet_String_#res.offset, ULTIMATE.start_cstrncmp_~uc2~0, ULTIMATE.start_cstrncmp_#in~n, ULTIMATE.start_cstrncmp_~uc1~0, ULTIMATE.start_cstrncmp_#in~s1.offset, ULTIMATE.start_cstrncmp_#t~mem11, ULTIMATE.start_main_#t~ret14.base, ULTIMATE.start_cstrncmp_~s2.offset, ULTIMATE.start_cstrncmp_#t~mem10, ULTIMATE.start_cstrncmp_#in~s2.base, ULTIMATE.start_cstrncmp_#in~s1.base, #memory_int, ULTIMATE.start_cstrncmp_#t~short5, ULTIMATE.start_cstrncmp_#t~short7] 104#L28 [186] L28-->L31-8: Formula: (< v_ULTIMATE.start_cstrncmp_~n_4 0) InVars {ULTIMATE.start_cstrncmp_~n=v_ULTIMATE.start_cstrncmp_~n_4} OutVars{ULTIMATE.start_cstrncmp_~n=v_ULTIMATE.start_cstrncmp_~n_4} AuxVars[] AssignedVars[] 105#L31-8 [2020-06-22 02:07:02,993 INFO L796 eck$LassoCheckResult]: Loop: 105#L31-8 [188] L31-8-->L31-1: Formula: (and (= v_ULTIMATE.start_cstrncmp_~n_5 (+ |v_ULTIMATE.start_cstrncmp_#t~post2_2| (- 1))) (not |v_ULTIMATE.start_cstrncmp_#t~short5_2|) (>= 0 |v_ULTIMATE.start_cstrncmp_#t~post2_2|) (= |v_ULTIMATE.start_cstrncmp_#t~post2_2| v_ULTIMATE.start_cstrncmp_~n_6)) InVars {ULTIMATE.start_cstrncmp_~n=v_ULTIMATE.start_cstrncmp_~n_6} OutVars{ULTIMATE.start_cstrncmp_~n=v_ULTIMATE.start_cstrncmp_~n_5, ULTIMATE.start_cstrncmp_#t~short5=|v_ULTIMATE.start_cstrncmp_#t~short5_2|, ULTIMATE.start_cstrncmp_#t~post2=|v_ULTIMATE.start_cstrncmp_#t~post2_2|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncmp_~n, ULTIMATE.start_cstrncmp_#t~short5, ULTIMATE.start_cstrncmp_#t~post2] 112#L31-1 [111] L31-1-->L31-6: Formula: (not |v_ULTIMATE.start_cstrncmp_#t~short5_5|) InVars {ULTIMATE.start_cstrncmp_#t~short5=|v_ULTIMATE.start_cstrncmp_#t~short5_5|} OutVars{ULTIMATE.start_cstrncmp_#t~short5=|v_ULTIMATE.start_cstrncmp_#t~short5_5|} AuxVars[] AssignedVars[] 102#L31-6 [200] L31-6-->L34: Formula: (and (< v_ULTIMATE.start_cstrncmp_~n_7 0) |v_ULTIMATE.start_cstrncmp_#t~short5_9| (not |v_ULTIMATE.start_cstrncmp_#t~short7_2|)) InVars {ULTIMATE.start_cstrncmp_#t~short5=|v_ULTIMATE.start_cstrncmp_#t~short5_9|, ULTIMATE.start_cstrncmp_~n=v_ULTIMATE.start_cstrncmp_~n_7} OutVars{ULTIMATE.start_cstrncmp_#t~mem4=|v_ULTIMATE.start_cstrncmp_#t~mem4_5|, ULTIMATE.start_cstrncmp_#t~mem3=|v_ULTIMATE.start_cstrncmp_#t~mem3_5|, ULTIMATE.start_cstrncmp_~n=v_ULTIMATE.start_cstrncmp_~n_7, ULTIMATE.start_cstrncmp_#t~short5=|v_ULTIMATE.start_cstrncmp_#t~short5_8|, ULTIMATE.start_cstrncmp_#t~post2=|v_ULTIMATE.start_cstrncmp_#t~post2_4|, ULTIMATE.start_cstrncmp_#t~short7=|v_ULTIMATE.start_cstrncmp_#t~short7_2|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncmp_#t~mem4, ULTIMATE.start_cstrncmp_#t~mem3, ULTIMATE.start_cstrncmp_#t~short5, ULTIMATE.start_cstrncmp_#t~post2, ULTIMATE.start_cstrncmp_#t~short7] 119#L34 [125] L34-->L34-4: Formula: |v_ULTIMATE.start_cstrncmp_#t~short7_3| InVars {ULTIMATE.start_cstrncmp_#t~short7=|v_ULTIMATE.start_cstrncmp_#t~short7_3|} OutVars{ULTIMATE.start_cstrncmp_#t~short7=|v_ULTIMATE.start_cstrncmp_#t~short7_3|} AuxVars[] AssignedVars[] 111#L34-4 [144] L34-4-->L31-8: Formula: (and (= v_ULTIMATE.start_cstrncmp_~s1.offset_7 (+ v_ULTIMATE.start_cstrncmp_~s1.offset_8 1)) (= v_ULTIMATE.start_cstrncmp_~s2.offset_5 (+ v_ULTIMATE.start_cstrncmp_~s2.offset_6 1)) (not |v_ULTIMATE.start_cstrncmp_#t~short7_9|) (= v_ULTIMATE.start_cstrncmp_~s1.base_9 v_ULTIMATE.start_cstrncmp_~s1.base_10) (= v_ULTIMATE.start_cstrncmp_~s2.base_7 v_ULTIMATE.start_cstrncmp_~s2.base_6)) InVars {ULTIMATE.start_cstrncmp_~s2.offset=v_ULTIMATE.start_cstrncmp_~s2.offset_6, ULTIMATE.start_cstrncmp_~s2.base=v_ULTIMATE.start_cstrncmp_~s2.base_7, ULTIMATE.start_cstrncmp_~s1.base=v_ULTIMATE.start_cstrncmp_~s1.base_10, ULTIMATE.start_cstrncmp_~s1.offset=v_ULTIMATE.start_cstrncmp_~s1.offset_8, ULTIMATE.start_cstrncmp_#t~short7=|v_ULTIMATE.start_cstrncmp_#t~short7_9|} OutVars{ULTIMATE.start_cstrncmp_~s2.offset=v_ULTIMATE.start_cstrncmp_~s2.offset_5, ULTIMATE.start_cstrncmp_#t~post8.offset=|v_ULTIMATE.start_cstrncmp_#t~post8.offset_2|, ULTIMATE.start_cstrncmp_#t~mem6=|v_ULTIMATE.start_cstrncmp_#t~mem6_5|, ULTIMATE.start_cstrncmp_#t~post9.base=|v_ULTIMATE.start_cstrncmp_#t~post9.base_2|, ULTIMATE.start_cstrncmp_~s2.base=v_ULTIMATE.start_cstrncmp_~s2.base_6, ULTIMATE.start_cstrncmp_#t~post8.base=|v_ULTIMATE.start_cstrncmp_#t~post8.base_2|, ULTIMATE.start_cstrncmp_~s1.base=v_ULTIMATE.start_cstrncmp_~s1.base_9, ULTIMATE.start_cstrncmp_#t~post9.offset=|v_ULTIMATE.start_cstrncmp_#t~post9.offset_2|, ULTIMATE.start_cstrncmp_~s1.offset=v_ULTIMATE.start_cstrncmp_~s1.offset_7, ULTIMATE.start_cstrncmp_#t~short7=|v_ULTIMATE.start_cstrncmp_#t~short7_8|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncmp_~s2.offset, ULTIMATE.start_cstrncmp_#t~post8.offset, ULTIMATE.start_cstrncmp_#t~mem6, ULTIMATE.start_cstrncmp_#t~post9.base, ULTIMATE.start_cstrncmp_~s2.base, ULTIMATE.start_cstrncmp_#t~post8.base, ULTIMATE.start_cstrncmp_~s1.base, ULTIMATE.start_cstrncmp_#t~post9.offset, ULTIMATE.start_cstrncmp_~s1.offset, ULTIMATE.start_cstrncmp_#t~short7] 105#L31-8 [2020-06-22 02:07:02,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 02:07:02,993 INFO L82 PathProgramCache]: Analyzing trace with hash 2041151457, now seen corresponding path program 1 times [2020-06-22 02:07:02,993 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 02:07:02,993 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 02:07:02,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:07:02,994 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 02:07:02,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:07:02,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 02:07:03,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 02:07:03,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 02:07:03,007 INFO L82 PathProgramCache]: Analyzing trace with hash 205754119, now seen corresponding path program 1 times [2020-06-22 02:07:03,007 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 02:07:03,007 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 02:07:03,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:07:03,008 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 02:07:03,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:07:03,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 02:07:03,018 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 02:07:03,018 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 02:07:03,019 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 02:07:03,019 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-06-22 02:07:03,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 02:07:03,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 02:07:03,019 INFO L87 Difference]: Start difference. First operand 28 states and 48 transitions. cyclomatic complexity: 22 Second operand 3 states. [2020-06-22 02:07:03,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 02:07:03,064 INFO L93 Difference]: Finished difference Result 26 states and 41 transitions. [2020-06-22 02:07:03,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 02:07:03,065 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 41 transitions. [2020-06-22 02:07:03,065 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2020-06-22 02:07:03,066 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 18 states and 26 transitions. [2020-06-22 02:07:03,066 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2020-06-22 02:07:03,066 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2020-06-22 02:07:03,066 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 26 transitions. [2020-06-22 02:07:03,066 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 02:07:03,066 INFO L706 BuchiCegarLoop]: Abstraction has 18 states and 26 transitions. [2020-06-22 02:07:03,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 26 transitions. [2020-06-22 02:07:03,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2020-06-22 02:07:03,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-06-22 02:07:03,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 26 transitions. [2020-06-22 02:07:03,068 INFO L729 BuchiCegarLoop]: Abstraction has 18 states and 26 transitions. [2020-06-22 02:07:03,068 INFO L609 BuchiCegarLoop]: Abstraction has 18 states and 26 transitions. [2020-06-22 02:07:03,068 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2020-06-22 02:07:03,068 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 26 transitions. [2020-06-22 02:07:03,069 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2020-06-22 02:07:03,069 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 02:07:03,069 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 02:07:03,069 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 02:07:03,069 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 02:07:03,070 INFO L794 eck$LassoCheckResult]: Stem: 173#ULTIMATE.startENTRY [221] ULTIMATE.startENTRY-->L12: Formula: (and (= (store |v_#valid_22| 0 0) |v_#valid_21|) (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|)) InVars {#valid=|v_#valid_22|} OutVars{ULTIMATE.start___VERIFIER_nondet_String_#res.offset=|v_ULTIMATE.start___VERIFIER_nondet_String_#res.offset_7|, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset_5|, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~ret13.base=|v_ULTIMATE.start_main_#t~ret13.base_5|, ULTIMATE.start_main_#t~ret14.base=|v_ULTIMATE.start_main_#t~ret14.base_4|, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~ret16=|v_ULTIMATE.start_main_#t~ret16_4|, ULTIMATE.start_main_#t~ret13.offset=|v_ULTIMATE.start_main_#t~ret13.offset_5|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_11, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, #valid=|v_#valid_21|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_4|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_18, ULTIMATE.start___VERIFIER_nondet_String_#t~nondet0=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~nondet0_8|, ULTIMATE.start___VERIFIER_nondet_String_#res.base=|v_ULTIMATE.start___VERIFIER_nondet_String_#res.base_7|, ULTIMATE.start_main_#t~ret14.offset=|v_ULTIMATE.start_main_#t~ret14.offset_4|, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_5|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_13} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_nondet_String_#res.offset, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset, #NULL.offset, ULTIMATE.start_main_#t~ret13.base, ULTIMATE.start_main_#t~ret14.base, #NULL.base, ULTIMATE.start_main_#t~ret16, ULTIMATE.start_main_#t~ret13.offset, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_#t~nondet15, 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~ret14.offset, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base] 174#L12 [121] 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] 172#L12-2 [175] 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] 159#L16 [223] L16-->L12-3: Formula: (let ((.cse0 (+ v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_14 v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_21))) (and (<= 1 .cse0) (= |v_ULTIMATE.start_main_#t~ret13.offset_6| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_14) (= v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_16 |v_ULTIMATE.start_main_#t~ret13.base_6|) (= (store |v_#memory_int_13| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_16 (store (select |v_#memory_int_13| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_16) (+ v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_14 v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_21 (- 1)) 0)) |v_#memory_int_12|) (= 1 (select |v_#valid_24| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_16)) (<= .cse0 (select |v_#length_20| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_16)))) InVars {ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_14, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_13|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_21, #length=|v_#length_20|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_16} OutVars{ULTIMATE.start___VERIFIER_nondet_String_#res.offset=|v_ULTIMATE.start___VERIFIER_nondet_String_#res.offset_9|, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset_6|, ULTIMATE.start_main_#t~ret13.base=|v_ULTIMATE.start_main_#t~ret13.base_6|, ULTIMATE.start_main_#t~ret13.offset=|v_ULTIMATE.start_main_#t~ret13.offset_6|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_13, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_12|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_20, #length=|v_#length_20|, ULTIMATE.start___VERIFIER_nondet_String_#t~nondet0=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~nondet0_10|, ULTIMATE.start___VERIFIER_nondet_String_#res.base=|v_ULTIMATE.start___VERIFIER_nondet_String_#res.base_9|, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_6|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_15} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_nondet_String_#res.offset, ULTIMATE.start_main_#t~ret13.offset, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset, #memory_int, ULTIMATE.start___VERIFIER_nondet_String_~length~0, ULTIMATE.start___VERIFIER_nondet_String_#t~nondet0, ULTIMATE.start_main_#t~ret13.base, ULTIMATE.start___VERIFIER_nondet_String_#res.base, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base] 160#L12-3 [154] L12-3-->L12-5: Formula: (>= v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_14 1) InVars {ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_14} OutVars{ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_14} AuxVars[] AssignedVars[] 166#L12-5 [181] L12-5-->L16-2: Formula: (and (= v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_7 |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset_4|) (= (store |v_#valid_8| |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_4| 1) |v_#valid_7|) (= (select |v_#valid_8| |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_4|) 0) (= v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_8 |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_4|) (= |v_#length_5| (store |v_#length_6| |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_4| v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_15)) (> 0 |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_4|) (= 0 |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset_4|) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_4|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_15, #length=|v_#length_6|, #valid=|v_#valid_8|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset_4|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_7, #valid=|v_#valid_7|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_15, #length=|v_#length_5|, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_4|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_8} 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] 167#L16-2 [225] L16-2-->L28: Formula: (let ((.cse0 (+ v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_16 v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_23))) (and (= |v_ULTIMATE.start___VERIFIER_nondet_String_#res.base_12| |v_ULTIMATE.start_main_#t~ret14.base_5|) (= |v_ULTIMATE.start_cstrncmp_#in~s1.offset_2| |v_ULTIMATE.start_main_#t~ret13.offset_7|) (= |v_ULTIMATE.start_main_#t~ret14.base_5| |v_ULTIMATE.start_cstrncmp_#in~s2.base_2|) (= |v_ULTIMATE.start_cstrncmp_#in~s2.offset_2| |v_ULTIMATE.start_main_#t~ret14.offset_5|) (= |v_ULTIMATE.start_main_#t~nondet15_5| |v_ULTIMATE.start_cstrncmp_#in~n_2|) (= v_ULTIMATE.start_cstrncmp_~s2.base_11 |v_ULTIMATE.start_cstrncmp_#in~s2.base_2|) (= |v_ULTIMATE.start_cstrncmp_#in~s1.base_2| |v_ULTIMATE.start_main_#t~ret13.base_7|) (<= 1 .cse0) (= |v_ULTIMATE.start___VERIFIER_nondet_String_#res.base_12| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_18) (= v_ULTIMATE.start_cstrncmp_~n_8 |v_ULTIMATE.start_cstrncmp_#in~n_2|) (= v_ULTIMATE.start_cstrncmp_~s2.offset_9 |v_ULTIMATE.start_cstrncmp_#in~s2.offset_2|) (= v_ULTIMATE.start_cstrncmp_~s1.base_14 |v_ULTIMATE.start_cstrncmp_#in~s1.base_2|) (= |v_ULTIMATE.start___VERIFIER_nondet_String_#res.offset_12| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_16) (<= .cse0 (select |v_#length_22| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_18)) (= 1 (select |v_#valid_26| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_18)) (= |v_ULTIMATE.start_cstrncmp_#in~s1.offset_2| v_ULTIMATE.start_cstrncmp_~s1.offset_11) (= |v_ULTIMATE.start_main_#t~ret14.offset_5| |v_ULTIMATE.start___VERIFIER_nondet_String_#res.offset_12|) (= (store |v_#memory_int_17| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_18 (store (select |v_#memory_int_17| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_18) (+ v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_16 v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_23 (- 1)) 0)) |v_#memory_int_16|))) InVars {ULTIMATE.start_main_#t~ret13.offset=|v_ULTIMATE.start_main_#t~ret13.offset_7|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_16, #valid=|v_#valid_26|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_5|, #memory_int=|v_#memory_int_17|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_23, #length=|v_#length_22|, ULTIMATE.start_main_#t~ret13.base=|v_ULTIMATE.start_main_#t~ret13.base_7|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_18} OutVars{ULTIMATE.start_cstrncmp_#t~mem6=|v_ULTIMATE.start_cstrncmp_#t~mem6_6|, ULTIMATE.start_cstrncmp_~s2.base=v_ULTIMATE.start_cstrncmp_~s2.base_11, ULTIMATE.start_cstrncmp_#res=|v_ULTIMATE.start_cstrncmp_#res_6|, ULTIMATE.start_cstrncmp_#t~mem3=|v_ULTIMATE.start_cstrncmp_#t~mem3_6|, ULTIMATE.start_cstrncmp_#t~mem4=|v_ULTIMATE.start_cstrncmp_#t~mem4_6|, ULTIMATE.start_cstrncmp_~s1.base=v_ULTIMATE.start_cstrncmp_~s1.base_14, ULTIMATE.start_cstrncmp_#t~post9.offset=|v_ULTIMATE.start_cstrncmp_#t~post9.offset_4|, ULTIMATE.start_cstrncmp_#t~post8.offset=|v_ULTIMATE.start_cstrncmp_#t~post8.offset_4|, ULTIMATE.start_cstrncmp_#t~post8.base=|v_ULTIMATE.start_cstrncmp_#t~post8.base_4|, ULTIMATE.start_cstrncmp_#t~post9.base=|v_ULTIMATE.start_cstrncmp_#t~post9.base_4|, ULTIMATE.start_cstrncmp_#in~s2.offset=|v_ULTIMATE.start_cstrncmp_#in~s2.offset_2|, ULTIMATE.start_cstrncmp_#t~ite12=|v_ULTIMATE.start_cstrncmp_#t~ite12_6|, #length=|v_#length_22|, ULTIMATE.start_cstrncmp_~n=v_ULTIMATE.start_cstrncmp_~n_8, ULTIMATE.start_main_#t~ret14.offset=|v_ULTIMATE.start_main_#t~ret14.offset_5|, ULTIMATE.start___VERIFIER_nondet_String_#res.base=|v_ULTIMATE.start___VERIFIER_nondet_String_#res.base_12|, ULTIMATE.start_cstrncmp_~s1.offset=v_ULTIMATE.start_cstrncmp_~s1.offset_11, ULTIMATE.start_cstrncmp_#t~post2=|v_ULTIMATE.start_cstrncmp_#t~post2_5|, ULTIMATE.start___VERIFIER_nondet_String_#res.offset=|v_ULTIMATE.start___VERIFIER_nondet_String_#res.offset_12|, ULTIMATE.start_cstrncmp_~uc2~0=v_ULTIMATE.start_cstrncmp_~uc2~0_6, ULTIMATE.start_cstrncmp_#in~n=|v_ULTIMATE.start_cstrncmp_#in~n_2|, ULTIMATE.start_cstrncmp_~uc1~0=v_ULTIMATE.start_cstrncmp_~uc1~0_6, ULTIMATE.start_main_#t~ret13.base=|v_ULTIMATE.start_main_#t~ret13.base_7|, ULTIMATE.start_cstrncmp_#in~s1.offset=|v_ULTIMATE.start_cstrncmp_#in~s1.offset_2|, ULTIMATE.start_cstrncmp_#t~mem11=|v_ULTIMATE.start_cstrncmp_#t~mem11_5|, ULTIMATE.start_main_#t~ret14.base=|v_ULTIMATE.start_main_#t~ret14.base_5|, ULTIMATE.start_cstrncmp_~s2.offset=v_ULTIMATE.start_cstrncmp_~s2.offset_9, ULTIMATE.start_main_#t~ret13.offset=|v_ULTIMATE.start_main_#t~ret13.offset_7|, ULTIMATE.start_cstrncmp_#t~mem10=|v_ULTIMATE.start_cstrncmp_#t~mem10_5|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_16, ULTIMATE.start_cstrncmp_#in~s2.base=|v_ULTIMATE.start_cstrncmp_#in~s2.base_2|, ULTIMATE.start_cstrncmp_#in~s1.base=|v_ULTIMATE.start_cstrncmp_#in~s1.base_2|, #valid=|v_#valid_26|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_5|, #memory_int=|v_#memory_int_16|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_23, ULTIMATE.start_cstrncmp_#t~short5=|v_ULTIMATE.start_cstrncmp_#t~short5_10|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_18, ULTIMATE.start_cstrncmp_#t~short7=|v_ULTIMATE.start_cstrncmp_#t~short7_10|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncmp_#t~mem6, ULTIMATE.start_cstrncmp_~s2.base, ULTIMATE.start_cstrncmp_#res, ULTIMATE.start_cstrncmp_#t~mem3, ULTIMATE.start_cstrncmp_#t~mem4, ULTIMATE.start_cstrncmp_~s1.base, ULTIMATE.start_cstrncmp_#t~post9.offset, ULTIMATE.start_cstrncmp_#t~post8.offset, ULTIMATE.start_cstrncmp_#t~post8.base, ULTIMATE.start_cstrncmp_#t~post9.base, ULTIMATE.start_cstrncmp_#in~s2.offset, ULTIMATE.start_cstrncmp_#t~ite12, ULTIMATE.start_cstrncmp_~n, ULTIMATE.start_main_#t~ret14.offset, ULTIMATE.start___VERIFIER_nondet_String_#res.base, ULTIMATE.start_cstrncmp_~s1.offset, ULTIMATE.start_cstrncmp_#t~post2, ULTIMATE.start___VERIFIER_nondet_String_#res.offset, ULTIMATE.start_cstrncmp_~uc2~0, ULTIMATE.start_cstrncmp_#in~n, ULTIMATE.start_cstrncmp_~uc1~0, ULTIMATE.start_cstrncmp_#in~s1.offset, ULTIMATE.start_cstrncmp_#t~mem11, ULTIMATE.start_main_#t~ret14.base, ULTIMATE.start_cstrncmp_~s2.offset, ULTIMATE.start_cstrncmp_#t~mem10, ULTIMATE.start_cstrncmp_#in~s2.base, ULTIMATE.start_cstrncmp_#in~s1.base, #memory_int, ULTIMATE.start_cstrncmp_#t~short5, ULTIMATE.start_cstrncmp_#t~short7] 163#L28 [187] L28-->L31-8: Formula: (> v_ULTIMATE.start_cstrncmp_~n_4 0) InVars {ULTIMATE.start_cstrncmp_~n=v_ULTIMATE.start_cstrncmp_~n_4} OutVars{ULTIMATE.start_cstrncmp_~n=v_ULTIMATE.start_cstrncmp_~n_4} AuxVars[] AssignedVars[] 164#L31-8 [2020-06-22 02:07:03,070 INFO L796 eck$LassoCheckResult]: Loop: 164#L31-8 [189] L31-8-->L31-1: Formula: (and (= v_ULTIMATE.start_cstrncmp_~n_5 (+ |v_ULTIMATE.start_cstrncmp_#t~post2_2| (- 1))) |v_ULTIMATE.start_cstrncmp_#t~short5_2| (= |v_ULTIMATE.start_cstrncmp_#t~post2_2| v_ULTIMATE.start_cstrncmp_~n_6) (< 0 |v_ULTIMATE.start_cstrncmp_#t~post2_2|)) InVars {ULTIMATE.start_cstrncmp_~n=v_ULTIMATE.start_cstrncmp_~n_6} OutVars{ULTIMATE.start_cstrncmp_~n=v_ULTIMATE.start_cstrncmp_~n_5, ULTIMATE.start_cstrncmp_#t~short5=|v_ULTIMATE.start_cstrncmp_#t~short5_2|, ULTIMATE.start_cstrncmp_#t~post2=|v_ULTIMATE.start_cstrncmp_#t~post2_2|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncmp_~n, ULTIMATE.start_cstrncmp_#t~short5, ULTIMATE.start_cstrncmp_#t~post2] 169#L31-1 [110] L31-1-->L31-2: Formula: |v_ULTIMATE.start_cstrncmp_#t~short5_3| InVars {ULTIMATE.start_cstrncmp_#t~short5=|v_ULTIMATE.start_cstrncmp_#t~short5_3|} OutVars{ULTIMATE.start_cstrncmp_#t~short5=|v_ULTIMATE.start_cstrncmp_#t~short5_3|} AuxVars[] AssignedVars[] 168#L31-2 [104] L31-2-->L31-3: Formula: (and (= |v_ULTIMATE.start_cstrncmp_#t~mem3_2| (select (select |v_#memory_int_5| v_ULTIMATE.start_cstrncmp_~s1.base_3) v_ULTIMATE.start_cstrncmp_~s1.offset_3)) (<= 0 v_ULTIMATE.start_cstrncmp_~s1.offset_3) (<= (+ v_ULTIMATE.start_cstrncmp_~s1.offset_3 1) (select |v_#length_9| v_ULTIMATE.start_cstrncmp_~s1.base_3)) (= (select |v_#valid_11| v_ULTIMATE.start_cstrncmp_~s1.base_3) 1)) InVars {#memory_int=|v_#memory_int_5|, #length=|v_#length_9|, ULTIMATE.start_cstrncmp_~s1.base=v_ULTIMATE.start_cstrncmp_~s1.base_3, ULTIMATE.start_cstrncmp_~s1.offset=v_ULTIMATE.start_cstrncmp_~s1.offset_3, #valid=|v_#valid_11|} OutVars{ULTIMATE.start_cstrncmp_#t~mem3=|v_ULTIMATE.start_cstrncmp_#t~mem3_2|, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_5|, #length=|v_#length_9|, ULTIMATE.start_cstrncmp_~s1.base=v_ULTIMATE.start_cstrncmp_~s1.base_3, ULTIMATE.start_cstrncmp_~s1.offset=v_ULTIMATE.start_cstrncmp_~s1.offset_3} AuxVars[] AssignedVars[ULTIMATE.start_cstrncmp_#t~mem3] 165#L31-3 [100] L31-3-->L31-4: Formula: (and (= (select |v_#valid_13| v_ULTIMATE.start_cstrncmp_~s2.base_3) 1) (= |v_ULTIMATE.start_cstrncmp_#t~mem4_2| (select (select |v_#memory_int_6| v_ULTIMATE.start_cstrncmp_~s2.base_3) v_ULTIMATE.start_cstrncmp_~s2.offset_3)) (<= (+ v_ULTIMATE.start_cstrncmp_~s2.offset_3 1) (select |v_#length_11| v_ULTIMATE.start_cstrncmp_~s2.base_3)) (<= 0 v_ULTIMATE.start_cstrncmp_~s2.offset_3)) InVars {#memory_int=|v_#memory_int_6|, ULTIMATE.start_cstrncmp_~s2.offset=v_ULTIMATE.start_cstrncmp_~s2.offset_3, #length=|v_#length_11|, ULTIMATE.start_cstrncmp_~s2.base=v_ULTIMATE.start_cstrncmp_~s2.base_3, #valid=|v_#valid_13|} OutVars{ULTIMATE.start_cstrncmp_~s2.offset=v_ULTIMATE.start_cstrncmp_~s2.offset_3, ULTIMATE.start_cstrncmp_~s2.base=v_ULTIMATE.start_cstrncmp_~s2.base_3, ULTIMATE.start_cstrncmp_#t~mem4=|v_ULTIMATE.start_cstrncmp_#t~mem4_2|, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_6|, #length=|v_#length_11|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncmp_#t~mem4] 161#L31-4 [210] L31-4-->L31-6: Formula: (and |v_ULTIMATE.start_cstrncmp_#t~short5_4| (= |v_ULTIMATE.start_cstrncmp_#t~mem4_3| |v_ULTIMATE.start_cstrncmp_#t~mem3_3|)) InVars {ULTIMATE.start_cstrncmp_#t~mem4=|v_ULTIMATE.start_cstrncmp_#t~mem4_3|, ULTIMATE.start_cstrncmp_#t~mem3=|v_ULTIMATE.start_cstrncmp_#t~mem3_3|} OutVars{ULTIMATE.start_cstrncmp_#t~mem4=|v_ULTIMATE.start_cstrncmp_#t~mem4_3|, ULTIMATE.start_cstrncmp_#t~mem3=|v_ULTIMATE.start_cstrncmp_#t~mem3_3|, ULTIMATE.start_cstrncmp_#t~short5=|v_ULTIMATE.start_cstrncmp_#t~short5_4|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncmp_#t~short5] 162#L31-6 [198] L31-6-->L34: Formula: (and |v_ULTIMATE.start_cstrncmp_#t~short5_9| (not |v_ULTIMATE.start_cstrncmp_#t~short7_2|) (> v_ULTIMATE.start_cstrncmp_~n_7 0)) InVars {ULTIMATE.start_cstrncmp_#t~short5=|v_ULTIMATE.start_cstrncmp_#t~short5_9|, ULTIMATE.start_cstrncmp_~n=v_ULTIMATE.start_cstrncmp_~n_7} OutVars{ULTIMATE.start_cstrncmp_#t~mem4=|v_ULTIMATE.start_cstrncmp_#t~mem4_5|, ULTIMATE.start_cstrncmp_#t~mem3=|v_ULTIMATE.start_cstrncmp_#t~mem3_5|, ULTIMATE.start_cstrncmp_~n=v_ULTIMATE.start_cstrncmp_~n_7, ULTIMATE.start_cstrncmp_#t~short5=|v_ULTIMATE.start_cstrncmp_#t~short5_8|, ULTIMATE.start_cstrncmp_#t~post2=|v_ULTIMATE.start_cstrncmp_#t~post2_4|, ULTIMATE.start_cstrncmp_#t~short7=|v_ULTIMATE.start_cstrncmp_#t~short7_2|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncmp_#t~mem4, ULTIMATE.start_cstrncmp_#t~mem3, ULTIMATE.start_cstrncmp_#t~short5, ULTIMATE.start_cstrncmp_#t~post2, ULTIMATE.start_cstrncmp_#t~short7] 176#L34 [125] L34-->L34-4: Formula: |v_ULTIMATE.start_cstrncmp_#t~short7_3| InVars {ULTIMATE.start_cstrncmp_#t~short7=|v_ULTIMATE.start_cstrncmp_#t~short7_3|} OutVars{ULTIMATE.start_cstrncmp_#t~short7=|v_ULTIMATE.start_cstrncmp_#t~short7_3|} AuxVars[] AssignedVars[] 170#L34-4 [144] L34-4-->L31-8: Formula: (and (= v_ULTIMATE.start_cstrncmp_~s1.offset_7 (+ v_ULTIMATE.start_cstrncmp_~s1.offset_8 1)) (= v_ULTIMATE.start_cstrncmp_~s2.offset_5 (+ v_ULTIMATE.start_cstrncmp_~s2.offset_6 1)) (not |v_ULTIMATE.start_cstrncmp_#t~short7_9|) (= v_ULTIMATE.start_cstrncmp_~s1.base_9 v_ULTIMATE.start_cstrncmp_~s1.base_10) (= v_ULTIMATE.start_cstrncmp_~s2.base_7 v_ULTIMATE.start_cstrncmp_~s2.base_6)) InVars {ULTIMATE.start_cstrncmp_~s2.offset=v_ULTIMATE.start_cstrncmp_~s2.offset_6, ULTIMATE.start_cstrncmp_~s2.base=v_ULTIMATE.start_cstrncmp_~s2.base_7, ULTIMATE.start_cstrncmp_~s1.base=v_ULTIMATE.start_cstrncmp_~s1.base_10, ULTIMATE.start_cstrncmp_~s1.offset=v_ULTIMATE.start_cstrncmp_~s1.offset_8, ULTIMATE.start_cstrncmp_#t~short7=|v_ULTIMATE.start_cstrncmp_#t~short7_9|} OutVars{ULTIMATE.start_cstrncmp_~s2.offset=v_ULTIMATE.start_cstrncmp_~s2.offset_5, ULTIMATE.start_cstrncmp_#t~post8.offset=|v_ULTIMATE.start_cstrncmp_#t~post8.offset_2|, ULTIMATE.start_cstrncmp_#t~mem6=|v_ULTIMATE.start_cstrncmp_#t~mem6_5|, ULTIMATE.start_cstrncmp_#t~post9.base=|v_ULTIMATE.start_cstrncmp_#t~post9.base_2|, ULTIMATE.start_cstrncmp_~s2.base=v_ULTIMATE.start_cstrncmp_~s2.base_6, ULTIMATE.start_cstrncmp_#t~post8.base=|v_ULTIMATE.start_cstrncmp_#t~post8.base_2|, ULTIMATE.start_cstrncmp_~s1.base=v_ULTIMATE.start_cstrncmp_~s1.base_9, ULTIMATE.start_cstrncmp_#t~post9.offset=|v_ULTIMATE.start_cstrncmp_#t~post9.offset_2|, ULTIMATE.start_cstrncmp_~s1.offset=v_ULTIMATE.start_cstrncmp_~s1.offset_7, ULTIMATE.start_cstrncmp_#t~short7=|v_ULTIMATE.start_cstrncmp_#t~short7_8|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncmp_~s2.offset, ULTIMATE.start_cstrncmp_#t~post8.offset, ULTIMATE.start_cstrncmp_#t~mem6, ULTIMATE.start_cstrncmp_#t~post9.base, ULTIMATE.start_cstrncmp_~s2.base, ULTIMATE.start_cstrncmp_#t~post8.base, ULTIMATE.start_cstrncmp_~s1.base, ULTIMATE.start_cstrncmp_#t~post9.offset, ULTIMATE.start_cstrncmp_~s1.offset, ULTIMATE.start_cstrncmp_#t~short7] 164#L31-8 [2020-06-22 02:07:03,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 02:07:03,071 INFO L82 PathProgramCache]: Analyzing trace with hash 2041151458, now seen corresponding path program 2 times [2020-06-22 02:07:03,071 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 02:07:03,071 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 02:07:03,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:07:03,072 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 02:07:03,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:07:03,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 02:07:03,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 02:07:03,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 02:07:03,084 INFO L82 PathProgramCache]: Analyzing trace with hash -1211391627, now seen corresponding path program 1 times [2020-06-22 02:07:03,084 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 02:07:03,084 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 02:07:03,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:07:03,085 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 02:07:03,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:07:03,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 02:07:03,092 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 02:07:03,093 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 02:07:03,093 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-06-22 02:07:03,093 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-06-22 02:07:03,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 02:07:03,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 02:07:03,094 INFO L87 Difference]: Start difference. First operand 18 states and 26 transitions. cyclomatic complexity: 9 Second operand 3 states. [2020-06-22 02:07:03,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 02:07:03,127 INFO L93 Difference]: Finished difference Result 20 states and 28 transitions. [2020-06-22 02:07:03,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 02:07:03,127 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 28 transitions. [2020-06-22 02:07:03,128 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2020-06-22 02:07:03,128 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 20 states and 28 transitions. [2020-06-22 02:07:03,128 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2020-06-22 02:07:03,129 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2020-06-22 02:07:03,129 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 28 transitions. [2020-06-22 02:07:03,129 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 02:07:03,129 INFO L706 BuchiCegarLoop]: Abstraction has 20 states and 28 transitions. [2020-06-22 02:07:03,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 28 transitions. [2020-06-22 02:07:03,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2020-06-22 02:07:03,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2020-06-22 02:07:03,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 27 transitions. [2020-06-22 02:07:03,130 INFO L729 BuchiCegarLoop]: Abstraction has 19 states and 27 transitions. [2020-06-22 02:07:03,130 INFO L609 BuchiCegarLoop]: Abstraction has 19 states and 27 transitions. [2020-06-22 02:07:03,130 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2020-06-22 02:07:03,130 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 27 transitions. [2020-06-22 02:07:03,131 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2020-06-22 02:07:03,131 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 02:07:03,131 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 02:07:03,131 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 02:07:03,131 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 02:07:03,132 INFO L794 eck$LassoCheckResult]: Stem: 218#ULTIMATE.startENTRY [221] ULTIMATE.startENTRY-->L12: Formula: (and (= (store |v_#valid_22| 0 0) |v_#valid_21|) (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|)) InVars {#valid=|v_#valid_22|} OutVars{ULTIMATE.start___VERIFIER_nondet_String_#res.offset=|v_ULTIMATE.start___VERIFIER_nondet_String_#res.offset_7|, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset_5|, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~ret13.base=|v_ULTIMATE.start_main_#t~ret13.base_5|, ULTIMATE.start_main_#t~ret14.base=|v_ULTIMATE.start_main_#t~ret14.base_4|, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~ret16=|v_ULTIMATE.start_main_#t~ret16_4|, ULTIMATE.start_main_#t~ret13.offset=|v_ULTIMATE.start_main_#t~ret13.offset_5|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_11, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, #valid=|v_#valid_21|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_4|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_18, ULTIMATE.start___VERIFIER_nondet_String_#t~nondet0=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~nondet0_8|, ULTIMATE.start___VERIFIER_nondet_String_#res.base=|v_ULTIMATE.start___VERIFIER_nondet_String_#res.base_7|, ULTIMATE.start_main_#t~ret14.offset=|v_ULTIMATE.start_main_#t~ret14.offset_4|, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_5|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_13} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_nondet_String_#res.offset, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset, #NULL.offset, ULTIMATE.start_main_#t~ret13.base, ULTIMATE.start_main_#t~ret14.base, #NULL.base, ULTIMATE.start_main_#t~ret16, ULTIMATE.start_main_#t~ret13.offset, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_#t~nondet15, 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~ret14.offset, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base] 219#L12 [121] 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] 216#L12-2 [175] 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] 203#L16 [223] L16-->L12-3: Formula: (let ((.cse0 (+ v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_14 v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_21))) (and (<= 1 .cse0) (= |v_ULTIMATE.start_main_#t~ret13.offset_6| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_14) (= v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_16 |v_ULTIMATE.start_main_#t~ret13.base_6|) (= (store |v_#memory_int_13| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_16 (store (select |v_#memory_int_13| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_16) (+ v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_14 v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_21 (- 1)) 0)) |v_#memory_int_12|) (= 1 (select |v_#valid_24| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_16)) (<= .cse0 (select |v_#length_20| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_16)))) InVars {ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_14, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_13|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_21, #length=|v_#length_20|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_16} OutVars{ULTIMATE.start___VERIFIER_nondet_String_#res.offset=|v_ULTIMATE.start___VERIFIER_nondet_String_#res.offset_9|, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset_6|, ULTIMATE.start_main_#t~ret13.base=|v_ULTIMATE.start_main_#t~ret13.base_6|, ULTIMATE.start_main_#t~ret13.offset=|v_ULTIMATE.start_main_#t~ret13.offset_6|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_13, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_12|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_20, #length=|v_#length_20|, ULTIMATE.start___VERIFIER_nondet_String_#t~nondet0=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~nondet0_10|, ULTIMATE.start___VERIFIER_nondet_String_#res.base=|v_ULTIMATE.start___VERIFIER_nondet_String_#res.base_9|, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_6|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_15} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_nondet_String_#res.offset, ULTIMATE.start_main_#t~ret13.offset, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset, #memory_int, ULTIMATE.start___VERIFIER_nondet_String_~length~0, ULTIMATE.start___VERIFIER_nondet_String_#t~nondet0, ULTIMATE.start_main_#t~ret13.base, ULTIMATE.start___VERIFIER_nondet_String_#res.base, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base] 204#L12-3 [154] L12-3-->L12-5: Formula: (>= v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_14 1) InVars {ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_14} OutVars{ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_14} AuxVars[] AssignedVars[] 210#L12-5 [181] L12-5-->L16-2: Formula: (and (= v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_7 |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset_4|) (= (store |v_#valid_8| |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_4| 1) |v_#valid_7|) (= (select |v_#valid_8| |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_4|) 0) (= v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_8 |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_4|) (= |v_#length_5| (store |v_#length_6| |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_4| v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_15)) (> 0 |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_4|) (= 0 |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset_4|) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_4|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_15, #length=|v_#length_6|, #valid=|v_#valid_8|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset_4|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_7, #valid=|v_#valid_7|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_15, #length=|v_#length_5|, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_4|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_8} 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] 211#L16-2 [225] L16-2-->L28: Formula: (let ((.cse0 (+ v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_16 v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_23))) (and (= |v_ULTIMATE.start___VERIFIER_nondet_String_#res.base_12| |v_ULTIMATE.start_main_#t~ret14.base_5|) (= |v_ULTIMATE.start_cstrncmp_#in~s1.offset_2| |v_ULTIMATE.start_main_#t~ret13.offset_7|) (= |v_ULTIMATE.start_main_#t~ret14.base_5| |v_ULTIMATE.start_cstrncmp_#in~s2.base_2|) (= |v_ULTIMATE.start_cstrncmp_#in~s2.offset_2| |v_ULTIMATE.start_main_#t~ret14.offset_5|) (= |v_ULTIMATE.start_main_#t~nondet15_5| |v_ULTIMATE.start_cstrncmp_#in~n_2|) (= v_ULTIMATE.start_cstrncmp_~s2.base_11 |v_ULTIMATE.start_cstrncmp_#in~s2.base_2|) (= |v_ULTIMATE.start_cstrncmp_#in~s1.base_2| |v_ULTIMATE.start_main_#t~ret13.base_7|) (<= 1 .cse0) (= |v_ULTIMATE.start___VERIFIER_nondet_String_#res.base_12| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_18) (= v_ULTIMATE.start_cstrncmp_~n_8 |v_ULTIMATE.start_cstrncmp_#in~n_2|) (= v_ULTIMATE.start_cstrncmp_~s2.offset_9 |v_ULTIMATE.start_cstrncmp_#in~s2.offset_2|) (= v_ULTIMATE.start_cstrncmp_~s1.base_14 |v_ULTIMATE.start_cstrncmp_#in~s1.base_2|) (= |v_ULTIMATE.start___VERIFIER_nondet_String_#res.offset_12| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_16) (<= .cse0 (select |v_#length_22| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_18)) (= 1 (select |v_#valid_26| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_18)) (= |v_ULTIMATE.start_cstrncmp_#in~s1.offset_2| v_ULTIMATE.start_cstrncmp_~s1.offset_11) (= |v_ULTIMATE.start_main_#t~ret14.offset_5| |v_ULTIMATE.start___VERIFIER_nondet_String_#res.offset_12|) (= (store |v_#memory_int_17| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_18 (store (select |v_#memory_int_17| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_18) (+ v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_16 v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_23 (- 1)) 0)) |v_#memory_int_16|))) InVars {ULTIMATE.start_main_#t~ret13.offset=|v_ULTIMATE.start_main_#t~ret13.offset_7|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_16, #valid=|v_#valid_26|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_5|, #memory_int=|v_#memory_int_17|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_23, #length=|v_#length_22|, ULTIMATE.start_main_#t~ret13.base=|v_ULTIMATE.start_main_#t~ret13.base_7|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_18} OutVars{ULTIMATE.start_cstrncmp_#t~mem6=|v_ULTIMATE.start_cstrncmp_#t~mem6_6|, ULTIMATE.start_cstrncmp_~s2.base=v_ULTIMATE.start_cstrncmp_~s2.base_11, ULTIMATE.start_cstrncmp_#res=|v_ULTIMATE.start_cstrncmp_#res_6|, ULTIMATE.start_cstrncmp_#t~mem3=|v_ULTIMATE.start_cstrncmp_#t~mem3_6|, ULTIMATE.start_cstrncmp_#t~mem4=|v_ULTIMATE.start_cstrncmp_#t~mem4_6|, ULTIMATE.start_cstrncmp_~s1.base=v_ULTIMATE.start_cstrncmp_~s1.base_14, ULTIMATE.start_cstrncmp_#t~post9.offset=|v_ULTIMATE.start_cstrncmp_#t~post9.offset_4|, ULTIMATE.start_cstrncmp_#t~post8.offset=|v_ULTIMATE.start_cstrncmp_#t~post8.offset_4|, ULTIMATE.start_cstrncmp_#t~post8.base=|v_ULTIMATE.start_cstrncmp_#t~post8.base_4|, ULTIMATE.start_cstrncmp_#t~post9.base=|v_ULTIMATE.start_cstrncmp_#t~post9.base_4|, ULTIMATE.start_cstrncmp_#in~s2.offset=|v_ULTIMATE.start_cstrncmp_#in~s2.offset_2|, ULTIMATE.start_cstrncmp_#t~ite12=|v_ULTIMATE.start_cstrncmp_#t~ite12_6|, #length=|v_#length_22|, ULTIMATE.start_cstrncmp_~n=v_ULTIMATE.start_cstrncmp_~n_8, ULTIMATE.start_main_#t~ret14.offset=|v_ULTIMATE.start_main_#t~ret14.offset_5|, ULTIMATE.start___VERIFIER_nondet_String_#res.base=|v_ULTIMATE.start___VERIFIER_nondet_String_#res.base_12|, ULTIMATE.start_cstrncmp_~s1.offset=v_ULTIMATE.start_cstrncmp_~s1.offset_11, ULTIMATE.start_cstrncmp_#t~post2=|v_ULTIMATE.start_cstrncmp_#t~post2_5|, ULTIMATE.start___VERIFIER_nondet_String_#res.offset=|v_ULTIMATE.start___VERIFIER_nondet_String_#res.offset_12|, ULTIMATE.start_cstrncmp_~uc2~0=v_ULTIMATE.start_cstrncmp_~uc2~0_6, ULTIMATE.start_cstrncmp_#in~n=|v_ULTIMATE.start_cstrncmp_#in~n_2|, ULTIMATE.start_cstrncmp_~uc1~0=v_ULTIMATE.start_cstrncmp_~uc1~0_6, ULTIMATE.start_main_#t~ret13.base=|v_ULTIMATE.start_main_#t~ret13.base_7|, ULTIMATE.start_cstrncmp_#in~s1.offset=|v_ULTIMATE.start_cstrncmp_#in~s1.offset_2|, ULTIMATE.start_cstrncmp_#t~mem11=|v_ULTIMATE.start_cstrncmp_#t~mem11_5|, ULTIMATE.start_main_#t~ret14.base=|v_ULTIMATE.start_main_#t~ret14.base_5|, ULTIMATE.start_cstrncmp_~s2.offset=v_ULTIMATE.start_cstrncmp_~s2.offset_9, ULTIMATE.start_main_#t~ret13.offset=|v_ULTIMATE.start_main_#t~ret13.offset_7|, ULTIMATE.start_cstrncmp_#t~mem10=|v_ULTIMATE.start_cstrncmp_#t~mem10_5|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_16, ULTIMATE.start_cstrncmp_#in~s2.base=|v_ULTIMATE.start_cstrncmp_#in~s2.base_2|, ULTIMATE.start_cstrncmp_#in~s1.base=|v_ULTIMATE.start_cstrncmp_#in~s1.base_2|, #valid=|v_#valid_26|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_5|, #memory_int=|v_#memory_int_16|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_23, ULTIMATE.start_cstrncmp_#t~short5=|v_ULTIMATE.start_cstrncmp_#t~short5_10|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_18, ULTIMATE.start_cstrncmp_#t~short7=|v_ULTIMATE.start_cstrncmp_#t~short7_10|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncmp_#t~mem6, ULTIMATE.start_cstrncmp_~s2.base, ULTIMATE.start_cstrncmp_#res, ULTIMATE.start_cstrncmp_#t~mem3, ULTIMATE.start_cstrncmp_#t~mem4, ULTIMATE.start_cstrncmp_~s1.base, ULTIMATE.start_cstrncmp_#t~post9.offset, ULTIMATE.start_cstrncmp_#t~post8.offset, ULTIMATE.start_cstrncmp_#t~post8.base, ULTIMATE.start_cstrncmp_#t~post9.base, ULTIMATE.start_cstrncmp_#in~s2.offset, ULTIMATE.start_cstrncmp_#t~ite12, ULTIMATE.start_cstrncmp_~n, ULTIMATE.start_main_#t~ret14.offset, ULTIMATE.start___VERIFIER_nondet_String_#res.base, ULTIMATE.start_cstrncmp_~s1.offset, ULTIMATE.start_cstrncmp_#t~post2, ULTIMATE.start___VERIFIER_nondet_String_#res.offset, ULTIMATE.start_cstrncmp_~uc2~0, ULTIMATE.start_cstrncmp_#in~n, ULTIMATE.start_cstrncmp_~uc1~0, ULTIMATE.start_cstrncmp_#in~s1.offset, ULTIMATE.start_cstrncmp_#t~mem11, ULTIMATE.start_main_#t~ret14.base, ULTIMATE.start_cstrncmp_~s2.offset, ULTIMATE.start_cstrncmp_#t~mem10, ULTIMATE.start_cstrncmp_#in~s2.base, ULTIMATE.start_cstrncmp_#in~s1.base, #memory_int, ULTIMATE.start_cstrncmp_#t~short5, ULTIMATE.start_cstrncmp_#t~short7] 208#L28 [187] L28-->L31-8: Formula: (> v_ULTIMATE.start_cstrncmp_~n_4 0) InVars {ULTIMATE.start_cstrncmp_~n=v_ULTIMATE.start_cstrncmp_~n_4} OutVars{ULTIMATE.start_cstrncmp_~n=v_ULTIMATE.start_cstrncmp_~n_4} AuxVars[] AssignedVars[] 209#L31-8 [2020-06-22 02:07:03,133 INFO L796 eck$LassoCheckResult]: Loop: 209#L31-8 [189] L31-8-->L31-1: Formula: (and (= v_ULTIMATE.start_cstrncmp_~n_5 (+ |v_ULTIMATE.start_cstrncmp_#t~post2_2| (- 1))) |v_ULTIMATE.start_cstrncmp_#t~short5_2| (= |v_ULTIMATE.start_cstrncmp_#t~post2_2| v_ULTIMATE.start_cstrncmp_~n_6) (< 0 |v_ULTIMATE.start_cstrncmp_#t~post2_2|)) InVars {ULTIMATE.start_cstrncmp_~n=v_ULTIMATE.start_cstrncmp_~n_6} OutVars{ULTIMATE.start_cstrncmp_~n=v_ULTIMATE.start_cstrncmp_~n_5, ULTIMATE.start_cstrncmp_#t~short5=|v_ULTIMATE.start_cstrncmp_#t~short5_2|, ULTIMATE.start_cstrncmp_#t~post2=|v_ULTIMATE.start_cstrncmp_#t~post2_2|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncmp_~n, ULTIMATE.start_cstrncmp_#t~short5, ULTIMATE.start_cstrncmp_#t~post2] 213#L31-1 [110] L31-1-->L31-2: Formula: |v_ULTIMATE.start_cstrncmp_#t~short5_3| InVars {ULTIMATE.start_cstrncmp_#t~short5=|v_ULTIMATE.start_cstrncmp_#t~short5_3|} OutVars{ULTIMATE.start_cstrncmp_#t~short5=|v_ULTIMATE.start_cstrncmp_#t~short5_3|} AuxVars[] AssignedVars[] 212#L31-2 [104] L31-2-->L31-3: Formula: (and (= |v_ULTIMATE.start_cstrncmp_#t~mem3_2| (select (select |v_#memory_int_5| v_ULTIMATE.start_cstrncmp_~s1.base_3) v_ULTIMATE.start_cstrncmp_~s1.offset_3)) (<= 0 v_ULTIMATE.start_cstrncmp_~s1.offset_3) (<= (+ v_ULTIMATE.start_cstrncmp_~s1.offset_3 1) (select |v_#length_9| v_ULTIMATE.start_cstrncmp_~s1.base_3)) (= (select |v_#valid_11| v_ULTIMATE.start_cstrncmp_~s1.base_3) 1)) InVars {#memory_int=|v_#memory_int_5|, #length=|v_#length_9|, ULTIMATE.start_cstrncmp_~s1.base=v_ULTIMATE.start_cstrncmp_~s1.base_3, ULTIMATE.start_cstrncmp_~s1.offset=v_ULTIMATE.start_cstrncmp_~s1.offset_3, #valid=|v_#valid_11|} OutVars{ULTIMATE.start_cstrncmp_#t~mem3=|v_ULTIMATE.start_cstrncmp_#t~mem3_2|, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_5|, #length=|v_#length_9|, ULTIMATE.start_cstrncmp_~s1.base=v_ULTIMATE.start_cstrncmp_~s1.base_3, ULTIMATE.start_cstrncmp_~s1.offset=v_ULTIMATE.start_cstrncmp_~s1.offset_3} AuxVars[] AssignedVars[ULTIMATE.start_cstrncmp_#t~mem3] 207#L31-3 [100] L31-3-->L31-4: Formula: (and (= (select |v_#valid_13| v_ULTIMATE.start_cstrncmp_~s2.base_3) 1) (= |v_ULTIMATE.start_cstrncmp_#t~mem4_2| (select (select |v_#memory_int_6| v_ULTIMATE.start_cstrncmp_~s2.base_3) v_ULTIMATE.start_cstrncmp_~s2.offset_3)) (<= (+ v_ULTIMATE.start_cstrncmp_~s2.offset_3 1) (select |v_#length_11| v_ULTIMATE.start_cstrncmp_~s2.base_3)) (<= 0 v_ULTIMATE.start_cstrncmp_~s2.offset_3)) InVars {#memory_int=|v_#memory_int_6|, ULTIMATE.start_cstrncmp_~s2.offset=v_ULTIMATE.start_cstrncmp_~s2.offset_3, #length=|v_#length_11|, ULTIMATE.start_cstrncmp_~s2.base=v_ULTIMATE.start_cstrncmp_~s2.base_3, #valid=|v_#valid_13|} OutVars{ULTIMATE.start_cstrncmp_~s2.offset=v_ULTIMATE.start_cstrncmp_~s2.offset_3, ULTIMATE.start_cstrncmp_~s2.base=v_ULTIMATE.start_cstrncmp_~s2.base_3, ULTIMATE.start_cstrncmp_#t~mem4=|v_ULTIMATE.start_cstrncmp_#t~mem4_2|, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_6|, #length=|v_#length_11|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncmp_#t~mem4] 205#L31-4 [210] L31-4-->L31-6: Formula: (and |v_ULTIMATE.start_cstrncmp_#t~short5_4| (= |v_ULTIMATE.start_cstrncmp_#t~mem4_3| |v_ULTIMATE.start_cstrncmp_#t~mem3_3|)) InVars {ULTIMATE.start_cstrncmp_#t~mem4=|v_ULTIMATE.start_cstrncmp_#t~mem4_3|, ULTIMATE.start_cstrncmp_#t~mem3=|v_ULTIMATE.start_cstrncmp_#t~mem3_3|} OutVars{ULTIMATE.start_cstrncmp_#t~mem4=|v_ULTIMATE.start_cstrncmp_#t~mem4_3|, ULTIMATE.start_cstrncmp_#t~mem3=|v_ULTIMATE.start_cstrncmp_#t~mem3_3|, ULTIMATE.start_cstrncmp_#t~short5=|v_ULTIMATE.start_cstrncmp_#t~short5_4|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncmp_#t~short5] 206#L31-6 [199] L31-6-->L34: Formula: (and |v_ULTIMATE.start_cstrncmp_#t~short5_9| |v_ULTIMATE.start_cstrncmp_#t~short7_2| (= v_ULTIMATE.start_cstrncmp_~n_7 0)) InVars {ULTIMATE.start_cstrncmp_#t~short5=|v_ULTIMATE.start_cstrncmp_#t~short5_9|, ULTIMATE.start_cstrncmp_~n=v_ULTIMATE.start_cstrncmp_~n_7} OutVars{ULTIMATE.start_cstrncmp_#t~mem4=|v_ULTIMATE.start_cstrncmp_#t~mem4_5|, ULTIMATE.start_cstrncmp_#t~mem3=|v_ULTIMATE.start_cstrncmp_#t~mem3_5|, ULTIMATE.start_cstrncmp_~n=v_ULTIMATE.start_cstrncmp_~n_7, ULTIMATE.start_cstrncmp_#t~short5=|v_ULTIMATE.start_cstrncmp_#t~short5_8|, ULTIMATE.start_cstrncmp_#t~post2=|v_ULTIMATE.start_cstrncmp_#t~post2_4|, ULTIMATE.start_cstrncmp_#t~short7=|v_ULTIMATE.start_cstrncmp_#t~short7_2|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncmp_#t~mem4, ULTIMATE.start_cstrncmp_#t~mem3, ULTIMATE.start_cstrncmp_#t~short5, ULTIMATE.start_cstrncmp_#t~post2, ULTIMATE.start_cstrncmp_#t~short7] 221#L34 [125] L34-->L34-4: Formula: |v_ULTIMATE.start_cstrncmp_#t~short7_3| InVars {ULTIMATE.start_cstrncmp_#t~short7=|v_ULTIMATE.start_cstrncmp_#t~short7_3|} OutVars{ULTIMATE.start_cstrncmp_#t~short7=|v_ULTIMATE.start_cstrncmp_#t~short7_3|} AuxVars[] AssignedVars[] 214#L34-4 [144] L34-4-->L31-8: Formula: (and (= v_ULTIMATE.start_cstrncmp_~s1.offset_7 (+ v_ULTIMATE.start_cstrncmp_~s1.offset_8 1)) (= v_ULTIMATE.start_cstrncmp_~s2.offset_5 (+ v_ULTIMATE.start_cstrncmp_~s2.offset_6 1)) (not |v_ULTIMATE.start_cstrncmp_#t~short7_9|) (= v_ULTIMATE.start_cstrncmp_~s1.base_9 v_ULTIMATE.start_cstrncmp_~s1.base_10) (= v_ULTIMATE.start_cstrncmp_~s2.base_7 v_ULTIMATE.start_cstrncmp_~s2.base_6)) InVars {ULTIMATE.start_cstrncmp_~s2.offset=v_ULTIMATE.start_cstrncmp_~s2.offset_6, ULTIMATE.start_cstrncmp_~s2.base=v_ULTIMATE.start_cstrncmp_~s2.base_7, ULTIMATE.start_cstrncmp_~s1.base=v_ULTIMATE.start_cstrncmp_~s1.base_10, ULTIMATE.start_cstrncmp_~s1.offset=v_ULTIMATE.start_cstrncmp_~s1.offset_8, ULTIMATE.start_cstrncmp_#t~short7=|v_ULTIMATE.start_cstrncmp_#t~short7_9|} OutVars{ULTIMATE.start_cstrncmp_~s2.offset=v_ULTIMATE.start_cstrncmp_~s2.offset_5, ULTIMATE.start_cstrncmp_#t~post8.offset=|v_ULTIMATE.start_cstrncmp_#t~post8.offset_2|, ULTIMATE.start_cstrncmp_#t~mem6=|v_ULTIMATE.start_cstrncmp_#t~mem6_5|, ULTIMATE.start_cstrncmp_#t~post9.base=|v_ULTIMATE.start_cstrncmp_#t~post9.base_2|, ULTIMATE.start_cstrncmp_~s2.base=v_ULTIMATE.start_cstrncmp_~s2.base_6, ULTIMATE.start_cstrncmp_#t~post8.base=|v_ULTIMATE.start_cstrncmp_#t~post8.base_2|, ULTIMATE.start_cstrncmp_~s1.base=v_ULTIMATE.start_cstrncmp_~s1.base_9, ULTIMATE.start_cstrncmp_#t~post9.offset=|v_ULTIMATE.start_cstrncmp_#t~post9.offset_2|, ULTIMATE.start_cstrncmp_~s1.offset=v_ULTIMATE.start_cstrncmp_~s1.offset_7, ULTIMATE.start_cstrncmp_#t~short7=|v_ULTIMATE.start_cstrncmp_#t~short7_8|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncmp_~s2.offset, ULTIMATE.start_cstrncmp_#t~post8.offset, ULTIMATE.start_cstrncmp_#t~mem6, ULTIMATE.start_cstrncmp_#t~post9.base, ULTIMATE.start_cstrncmp_~s2.base, ULTIMATE.start_cstrncmp_#t~post8.base, ULTIMATE.start_cstrncmp_~s1.base, ULTIMATE.start_cstrncmp_#t~post9.offset, ULTIMATE.start_cstrncmp_~s1.offset, ULTIMATE.start_cstrncmp_#t~short7] 209#L31-8 [2020-06-22 02:07:03,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 02:07:03,133 INFO L82 PathProgramCache]: Analyzing trace with hash 2041151458, now seen corresponding path program 3 times [2020-06-22 02:07:03,133 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 02:07:03,133 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 02:07:03,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:07:03,134 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 02:07:03,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:07:03,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 02:07:03,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 02:07:03,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 02:07:03,146 INFO L82 PathProgramCache]: Analyzing trace with hash -1211390666, now seen corresponding path program 1 times [2020-06-22 02:07:03,146 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 02:07:03,146 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 02:07:03,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:07:03,147 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 02:07:03,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:07:03,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 02:07:03,157 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 02:07:03,157 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 02:07:03,158 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 02:07:03,158 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-06-22 02:07:03,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 02:07:03,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 02:07:03,158 INFO L87 Difference]: Start difference. First operand 19 states and 27 transitions. cyclomatic complexity: 9 Second operand 3 states. [2020-06-22 02:07:03,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 02:07:03,189 INFO L93 Difference]: Finished difference Result 20 states and 26 transitions. [2020-06-22 02:07:03,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 02:07:03,190 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 26 transitions. [2020-06-22 02:07:03,190 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2020-06-22 02:07:03,191 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 18 states and 23 transitions. [2020-06-22 02:07:03,191 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2020-06-22 02:07:03,191 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2020-06-22 02:07:03,191 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 23 transitions. [2020-06-22 02:07:03,191 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 02:07:03,191 INFO L706 BuchiCegarLoop]: Abstraction has 18 states and 23 transitions. [2020-06-22 02:07:03,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 23 transitions. [2020-06-22 02:07:03,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2020-06-22 02:07:03,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-06-22 02:07:03,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 23 transitions. [2020-06-22 02:07:03,193 INFO L729 BuchiCegarLoop]: Abstraction has 18 states and 23 transitions. [2020-06-22 02:07:03,193 INFO L609 BuchiCegarLoop]: Abstraction has 18 states and 23 transitions. [2020-06-22 02:07:03,193 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2020-06-22 02:07:03,193 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 23 transitions. [2020-06-22 02:07:03,193 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2020-06-22 02:07:03,193 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 02:07:03,194 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 02:07:03,194 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 02:07:03,194 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 02:07:03,195 INFO L794 eck$LassoCheckResult]: Stem: 262#ULTIMATE.startENTRY [221] ULTIMATE.startENTRY-->L12: Formula: (and (= (store |v_#valid_22| 0 0) |v_#valid_21|) (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|)) InVars {#valid=|v_#valid_22|} OutVars{ULTIMATE.start___VERIFIER_nondet_String_#res.offset=|v_ULTIMATE.start___VERIFIER_nondet_String_#res.offset_7|, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset_5|, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~ret13.base=|v_ULTIMATE.start_main_#t~ret13.base_5|, ULTIMATE.start_main_#t~ret14.base=|v_ULTIMATE.start_main_#t~ret14.base_4|, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~ret16=|v_ULTIMATE.start_main_#t~ret16_4|, ULTIMATE.start_main_#t~ret13.offset=|v_ULTIMATE.start_main_#t~ret13.offset_5|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_11, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, #valid=|v_#valid_21|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_4|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_18, ULTIMATE.start___VERIFIER_nondet_String_#t~nondet0=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~nondet0_8|, ULTIMATE.start___VERIFIER_nondet_String_#res.base=|v_ULTIMATE.start___VERIFIER_nondet_String_#res.base_7|, ULTIMATE.start_main_#t~ret14.offset=|v_ULTIMATE.start_main_#t~ret14.offset_4|, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_5|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_13} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_nondet_String_#res.offset, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset, #NULL.offset, ULTIMATE.start_main_#t~ret13.base, ULTIMATE.start_main_#t~ret14.base, #NULL.base, ULTIMATE.start_main_#t~ret16, ULTIMATE.start_main_#t~ret13.offset, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_#t~nondet15, 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~ret14.offset, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base] 263#L12 [121] 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] 261#L12-2 [175] 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] 248#L16 [223] L16-->L12-3: Formula: (let ((.cse0 (+ v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_14 v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_21))) (and (<= 1 .cse0) (= |v_ULTIMATE.start_main_#t~ret13.offset_6| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_14) (= v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_16 |v_ULTIMATE.start_main_#t~ret13.base_6|) (= (store |v_#memory_int_13| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_16 (store (select |v_#memory_int_13| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_16) (+ v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_14 v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_21 (- 1)) 0)) |v_#memory_int_12|) (= 1 (select |v_#valid_24| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_16)) (<= .cse0 (select |v_#length_20| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_16)))) InVars {ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_14, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_13|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_21, #length=|v_#length_20|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_16} OutVars{ULTIMATE.start___VERIFIER_nondet_String_#res.offset=|v_ULTIMATE.start___VERIFIER_nondet_String_#res.offset_9|, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset_6|, ULTIMATE.start_main_#t~ret13.base=|v_ULTIMATE.start_main_#t~ret13.base_6|, ULTIMATE.start_main_#t~ret13.offset=|v_ULTIMATE.start_main_#t~ret13.offset_6|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_13, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_12|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_20, #length=|v_#length_20|, ULTIMATE.start___VERIFIER_nondet_String_#t~nondet0=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~nondet0_10|, ULTIMATE.start___VERIFIER_nondet_String_#res.base=|v_ULTIMATE.start___VERIFIER_nondet_String_#res.base_9|, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_6|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_15} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_nondet_String_#res.offset, ULTIMATE.start_main_#t~ret13.offset, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset, #memory_int, ULTIMATE.start___VERIFIER_nondet_String_~length~0, ULTIMATE.start___VERIFIER_nondet_String_#t~nondet0, ULTIMATE.start_main_#t~ret13.base, ULTIMATE.start___VERIFIER_nondet_String_#res.base, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base] 249#L12-3 [154] L12-3-->L12-5: Formula: (>= v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_14 1) InVars {ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_14} OutVars{ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_14} AuxVars[] AssignedVars[] 255#L12-5 [181] L12-5-->L16-2: Formula: (and (= v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_7 |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset_4|) (= (store |v_#valid_8| |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_4| 1) |v_#valid_7|) (= (select |v_#valid_8| |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_4|) 0) (= v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_8 |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_4|) (= |v_#length_5| (store |v_#length_6| |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_4| v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_15)) (> 0 |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_4|) (= 0 |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset_4|) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_4|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_15, #length=|v_#length_6|, #valid=|v_#valid_8|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset_4|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_7, #valid=|v_#valid_7|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_15, #length=|v_#length_5|, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_4|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_8} 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] 256#L16-2 [225] L16-2-->L28: Formula: (let ((.cse0 (+ v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_16 v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_23))) (and (= |v_ULTIMATE.start___VERIFIER_nondet_String_#res.base_12| |v_ULTIMATE.start_main_#t~ret14.base_5|) (= |v_ULTIMATE.start_cstrncmp_#in~s1.offset_2| |v_ULTIMATE.start_main_#t~ret13.offset_7|) (= |v_ULTIMATE.start_main_#t~ret14.base_5| |v_ULTIMATE.start_cstrncmp_#in~s2.base_2|) (= |v_ULTIMATE.start_cstrncmp_#in~s2.offset_2| |v_ULTIMATE.start_main_#t~ret14.offset_5|) (= |v_ULTIMATE.start_main_#t~nondet15_5| |v_ULTIMATE.start_cstrncmp_#in~n_2|) (= v_ULTIMATE.start_cstrncmp_~s2.base_11 |v_ULTIMATE.start_cstrncmp_#in~s2.base_2|) (= |v_ULTIMATE.start_cstrncmp_#in~s1.base_2| |v_ULTIMATE.start_main_#t~ret13.base_7|) (<= 1 .cse0) (= |v_ULTIMATE.start___VERIFIER_nondet_String_#res.base_12| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_18) (= v_ULTIMATE.start_cstrncmp_~n_8 |v_ULTIMATE.start_cstrncmp_#in~n_2|) (= v_ULTIMATE.start_cstrncmp_~s2.offset_9 |v_ULTIMATE.start_cstrncmp_#in~s2.offset_2|) (= v_ULTIMATE.start_cstrncmp_~s1.base_14 |v_ULTIMATE.start_cstrncmp_#in~s1.base_2|) (= |v_ULTIMATE.start___VERIFIER_nondet_String_#res.offset_12| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_16) (<= .cse0 (select |v_#length_22| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_18)) (= 1 (select |v_#valid_26| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_18)) (= |v_ULTIMATE.start_cstrncmp_#in~s1.offset_2| v_ULTIMATE.start_cstrncmp_~s1.offset_11) (= |v_ULTIMATE.start_main_#t~ret14.offset_5| |v_ULTIMATE.start___VERIFIER_nondet_String_#res.offset_12|) (= (store |v_#memory_int_17| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_18 (store (select |v_#memory_int_17| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_18) (+ v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_16 v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_23 (- 1)) 0)) |v_#memory_int_16|))) InVars {ULTIMATE.start_main_#t~ret13.offset=|v_ULTIMATE.start_main_#t~ret13.offset_7|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_16, #valid=|v_#valid_26|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_5|, #memory_int=|v_#memory_int_17|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_23, #length=|v_#length_22|, ULTIMATE.start_main_#t~ret13.base=|v_ULTIMATE.start_main_#t~ret13.base_7|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_18} OutVars{ULTIMATE.start_cstrncmp_#t~mem6=|v_ULTIMATE.start_cstrncmp_#t~mem6_6|, ULTIMATE.start_cstrncmp_~s2.base=v_ULTIMATE.start_cstrncmp_~s2.base_11, ULTIMATE.start_cstrncmp_#res=|v_ULTIMATE.start_cstrncmp_#res_6|, ULTIMATE.start_cstrncmp_#t~mem3=|v_ULTIMATE.start_cstrncmp_#t~mem3_6|, ULTIMATE.start_cstrncmp_#t~mem4=|v_ULTIMATE.start_cstrncmp_#t~mem4_6|, ULTIMATE.start_cstrncmp_~s1.base=v_ULTIMATE.start_cstrncmp_~s1.base_14, ULTIMATE.start_cstrncmp_#t~post9.offset=|v_ULTIMATE.start_cstrncmp_#t~post9.offset_4|, ULTIMATE.start_cstrncmp_#t~post8.offset=|v_ULTIMATE.start_cstrncmp_#t~post8.offset_4|, ULTIMATE.start_cstrncmp_#t~post8.base=|v_ULTIMATE.start_cstrncmp_#t~post8.base_4|, ULTIMATE.start_cstrncmp_#t~post9.base=|v_ULTIMATE.start_cstrncmp_#t~post9.base_4|, ULTIMATE.start_cstrncmp_#in~s2.offset=|v_ULTIMATE.start_cstrncmp_#in~s2.offset_2|, ULTIMATE.start_cstrncmp_#t~ite12=|v_ULTIMATE.start_cstrncmp_#t~ite12_6|, #length=|v_#length_22|, ULTIMATE.start_cstrncmp_~n=v_ULTIMATE.start_cstrncmp_~n_8, ULTIMATE.start_main_#t~ret14.offset=|v_ULTIMATE.start_main_#t~ret14.offset_5|, ULTIMATE.start___VERIFIER_nondet_String_#res.base=|v_ULTIMATE.start___VERIFIER_nondet_String_#res.base_12|, ULTIMATE.start_cstrncmp_~s1.offset=v_ULTIMATE.start_cstrncmp_~s1.offset_11, ULTIMATE.start_cstrncmp_#t~post2=|v_ULTIMATE.start_cstrncmp_#t~post2_5|, ULTIMATE.start___VERIFIER_nondet_String_#res.offset=|v_ULTIMATE.start___VERIFIER_nondet_String_#res.offset_12|, ULTIMATE.start_cstrncmp_~uc2~0=v_ULTIMATE.start_cstrncmp_~uc2~0_6, ULTIMATE.start_cstrncmp_#in~n=|v_ULTIMATE.start_cstrncmp_#in~n_2|, ULTIMATE.start_cstrncmp_~uc1~0=v_ULTIMATE.start_cstrncmp_~uc1~0_6, ULTIMATE.start_main_#t~ret13.base=|v_ULTIMATE.start_main_#t~ret13.base_7|, ULTIMATE.start_cstrncmp_#in~s1.offset=|v_ULTIMATE.start_cstrncmp_#in~s1.offset_2|, ULTIMATE.start_cstrncmp_#t~mem11=|v_ULTIMATE.start_cstrncmp_#t~mem11_5|, ULTIMATE.start_main_#t~ret14.base=|v_ULTIMATE.start_main_#t~ret14.base_5|, ULTIMATE.start_cstrncmp_~s2.offset=v_ULTIMATE.start_cstrncmp_~s2.offset_9, ULTIMATE.start_main_#t~ret13.offset=|v_ULTIMATE.start_main_#t~ret13.offset_7|, ULTIMATE.start_cstrncmp_#t~mem10=|v_ULTIMATE.start_cstrncmp_#t~mem10_5|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_16, ULTIMATE.start_cstrncmp_#in~s2.base=|v_ULTIMATE.start_cstrncmp_#in~s2.base_2|, ULTIMATE.start_cstrncmp_#in~s1.base=|v_ULTIMATE.start_cstrncmp_#in~s1.base_2|, #valid=|v_#valid_26|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_5|, #memory_int=|v_#memory_int_16|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_23, ULTIMATE.start_cstrncmp_#t~short5=|v_ULTIMATE.start_cstrncmp_#t~short5_10|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_18, ULTIMATE.start_cstrncmp_#t~short7=|v_ULTIMATE.start_cstrncmp_#t~short7_10|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncmp_#t~mem6, ULTIMATE.start_cstrncmp_~s2.base, ULTIMATE.start_cstrncmp_#res, ULTIMATE.start_cstrncmp_#t~mem3, ULTIMATE.start_cstrncmp_#t~mem4, ULTIMATE.start_cstrncmp_~s1.base, ULTIMATE.start_cstrncmp_#t~post9.offset, ULTIMATE.start_cstrncmp_#t~post8.offset, ULTIMATE.start_cstrncmp_#t~post8.base, ULTIMATE.start_cstrncmp_#t~post9.base, ULTIMATE.start_cstrncmp_#in~s2.offset, ULTIMATE.start_cstrncmp_#t~ite12, ULTIMATE.start_cstrncmp_~n, ULTIMATE.start_main_#t~ret14.offset, ULTIMATE.start___VERIFIER_nondet_String_#res.base, ULTIMATE.start_cstrncmp_~s1.offset, ULTIMATE.start_cstrncmp_#t~post2, ULTIMATE.start___VERIFIER_nondet_String_#res.offset, ULTIMATE.start_cstrncmp_~uc2~0, ULTIMATE.start_cstrncmp_#in~n, ULTIMATE.start_cstrncmp_~uc1~0, ULTIMATE.start_cstrncmp_#in~s1.offset, ULTIMATE.start_cstrncmp_#t~mem11, ULTIMATE.start_main_#t~ret14.base, ULTIMATE.start_cstrncmp_~s2.offset, ULTIMATE.start_cstrncmp_#t~mem10, ULTIMATE.start_cstrncmp_#in~s2.base, ULTIMATE.start_cstrncmp_#in~s1.base, #memory_int, ULTIMATE.start_cstrncmp_#t~short5, ULTIMATE.start_cstrncmp_#t~short7] 252#L28 [187] L28-->L31-8: Formula: (> v_ULTIMATE.start_cstrncmp_~n_4 0) InVars {ULTIMATE.start_cstrncmp_~n=v_ULTIMATE.start_cstrncmp_~n_4} OutVars{ULTIMATE.start_cstrncmp_~n=v_ULTIMATE.start_cstrncmp_~n_4} AuxVars[] AssignedVars[] 253#L31-8 [2020-06-22 02:07:03,195 INFO L796 eck$LassoCheckResult]: Loop: 253#L31-8 [189] L31-8-->L31-1: Formula: (and (= v_ULTIMATE.start_cstrncmp_~n_5 (+ |v_ULTIMATE.start_cstrncmp_#t~post2_2| (- 1))) |v_ULTIMATE.start_cstrncmp_#t~short5_2| (= |v_ULTIMATE.start_cstrncmp_#t~post2_2| v_ULTIMATE.start_cstrncmp_~n_6) (< 0 |v_ULTIMATE.start_cstrncmp_#t~post2_2|)) InVars {ULTIMATE.start_cstrncmp_~n=v_ULTIMATE.start_cstrncmp_~n_6} OutVars{ULTIMATE.start_cstrncmp_~n=v_ULTIMATE.start_cstrncmp_~n_5, ULTIMATE.start_cstrncmp_#t~short5=|v_ULTIMATE.start_cstrncmp_#t~short5_2|, ULTIMATE.start_cstrncmp_#t~post2=|v_ULTIMATE.start_cstrncmp_#t~post2_2|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncmp_~n, ULTIMATE.start_cstrncmp_#t~short5, ULTIMATE.start_cstrncmp_#t~post2] 258#L31-1 [110] L31-1-->L31-2: Formula: |v_ULTIMATE.start_cstrncmp_#t~short5_3| InVars {ULTIMATE.start_cstrncmp_#t~short5=|v_ULTIMATE.start_cstrncmp_#t~short5_3|} OutVars{ULTIMATE.start_cstrncmp_#t~short5=|v_ULTIMATE.start_cstrncmp_#t~short5_3|} AuxVars[] AssignedVars[] 257#L31-2 [104] L31-2-->L31-3: Formula: (and (= |v_ULTIMATE.start_cstrncmp_#t~mem3_2| (select (select |v_#memory_int_5| v_ULTIMATE.start_cstrncmp_~s1.base_3) v_ULTIMATE.start_cstrncmp_~s1.offset_3)) (<= 0 v_ULTIMATE.start_cstrncmp_~s1.offset_3) (<= (+ v_ULTIMATE.start_cstrncmp_~s1.offset_3 1) (select |v_#length_9| v_ULTIMATE.start_cstrncmp_~s1.base_3)) (= (select |v_#valid_11| v_ULTIMATE.start_cstrncmp_~s1.base_3) 1)) InVars {#memory_int=|v_#memory_int_5|, #length=|v_#length_9|, ULTIMATE.start_cstrncmp_~s1.base=v_ULTIMATE.start_cstrncmp_~s1.base_3, ULTIMATE.start_cstrncmp_~s1.offset=v_ULTIMATE.start_cstrncmp_~s1.offset_3, #valid=|v_#valid_11|} OutVars{ULTIMATE.start_cstrncmp_#t~mem3=|v_ULTIMATE.start_cstrncmp_#t~mem3_2|, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_5|, #length=|v_#length_9|, ULTIMATE.start_cstrncmp_~s1.base=v_ULTIMATE.start_cstrncmp_~s1.base_3, ULTIMATE.start_cstrncmp_~s1.offset=v_ULTIMATE.start_cstrncmp_~s1.offset_3} AuxVars[] AssignedVars[ULTIMATE.start_cstrncmp_#t~mem3] 254#L31-3 [100] L31-3-->L31-4: Formula: (and (= (select |v_#valid_13| v_ULTIMATE.start_cstrncmp_~s2.base_3) 1) (= |v_ULTIMATE.start_cstrncmp_#t~mem4_2| (select (select |v_#memory_int_6| v_ULTIMATE.start_cstrncmp_~s2.base_3) v_ULTIMATE.start_cstrncmp_~s2.offset_3)) (<= (+ v_ULTIMATE.start_cstrncmp_~s2.offset_3 1) (select |v_#length_11| v_ULTIMATE.start_cstrncmp_~s2.base_3)) (<= 0 v_ULTIMATE.start_cstrncmp_~s2.offset_3)) InVars {#memory_int=|v_#memory_int_6|, ULTIMATE.start_cstrncmp_~s2.offset=v_ULTIMATE.start_cstrncmp_~s2.offset_3, #length=|v_#length_11|, ULTIMATE.start_cstrncmp_~s2.base=v_ULTIMATE.start_cstrncmp_~s2.base_3, #valid=|v_#valid_13|} OutVars{ULTIMATE.start_cstrncmp_~s2.offset=v_ULTIMATE.start_cstrncmp_~s2.offset_3, ULTIMATE.start_cstrncmp_~s2.base=v_ULTIMATE.start_cstrncmp_~s2.base_3, ULTIMATE.start_cstrncmp_#t~mem4=|v_ULTIMATE.start_cstrncmp_#t~mem4_2|, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_6|, #length=|v_#length_11|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncmp_#t~mem4] 250#L31-4 [210] L31-4-->L31-6: Formula: (and |v_ULTIMATE.start_cstrncmp_#t~short5_4| (= |v_ULTIMATE.start_cstrncmp_#t~mem4_3| |v_ULTIMATE.start_cstrncmp_#t~mem3_3|)) InVars {ULTIMATE.start_cstrncmp_#t~mem4=|v_ULTIMATE.start_cstrncmp_#t~mem4_3|, ULTIMATE.start_cstrncmp_#t~mem3=|v_ULTIMATE.start_cstrncmp_#t~mem3_3|} OutVars{ULTIMATE.start_cstrncmp_#t~mem4=|v_ULTIMATE.start_cstrncmp_#t~mem4_3|, ULTIMATE.start_cstrncmp_#t~mem3=|v_ULTIMATE.start_cstrncmp_#t~mem3_3|, ULTIMATE.start_cstrncmp_#t~short5=|v_ULTIMATE.start_cstrncmp_#t~short5_4|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncmp_#t~short5] 251#L31-6 [198] L31-6-->L34: Formula: (and |v_ULTIMATE.start_cstrncmp_#t~short5_9| (not |v_ULTIMATE.start_cstrncmp_#t~short7_2|) (> v_ULTIMATE.start_cstrncmp_~n_7 0)) InVars {ULTIMATE.start_cstrncmp_#t~short5=|v_ULTIMATE.start_cstrncmp_#t~short5_9|, ULTIMATE.start_cstrncmp_~n=v_ULTIMATE.start_cstrncmp_~n_7} OutVars{ULTIMATE.start_cstrncmp_#t~mem4=|v_ULTIMATE.start_cstrncmp_#t~mem4_5|, ULTIMATE.start_cstrncmp_#t~mem3=|v_ULTIMATE.start_cstrncmp_#t~mem3_5|, ULTIMATE.start_cstrncmp_~n=v_ULTIMATE.start_cstrncmp_~n_7, ULTIMATE.start_cstrncmp_#t~short5=|v_ULTIMATE.start_cstrncmp_#t~short5_8|, ULTIMATE.start_cstrncmp_#t~post2=|v_ULTIMATE.start_cstrncmp_#t~post2_4|, ULTIMATE.start_cstrncmp_#t~short7=|v_ULTIMATE.start_cstrncmp_#t~short7_2|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncmp_#t~mem4, ULTIMATE.start_cstrncmp_#t~mem3, ULTIMATE.start_cstrncmp_#t~short5, ULTIMATE.start_cstrncmp_#t~post2, ULTIMATE.start_cstrncmp_#t~short7] 265#L34 [126] L34-->L34-2: Formula: (not |v_ULTIMATE.start_cstrncmp_#t~short7_4|) InVars {ULTIMATE.start_cstrncmp_#t~short7=|v_ULTIMATE.start_cstrncmp_#t~short7_4|} OutVars{ULTIMATE.start_cstrncmp_#t~short7=|v_ULTIMATE.start_cstrncmp_#t~short7_4|} AuxVars[] AssignedVars[] 264#L34-2 [115] L34-2-->L34-3: Formula: (and (= 1 (select |v_#valid_15| v_ULTIMATE.start_cstrncmp_~s1.base_6)) (<= (+ v_ULTIMATE.start_cstrncmp_~s1.offset_5 1) (select |v_#length_13| v_ULTIMATE.start_cstrncmp_~s1.base_6)) (= |v_ULTIMATE.start_cstrncmp_#t~mem6_2| (select (select |v_#memory_int_7| v_ULTIMATE.start_cstrncmp_~s1.base_6) v_ULTIMATE.start_cstrncmp_~s1.offset_5)) (<= 0 v_ULTIMATE.start_cstrncmp_~s1.offset_5)) InVars {#memory_int=|v_#memory_int_7|, #length=|v_#length_13|, ULTIMATE.start_cstrncmp_~s1.base=v_ULTIMATE.start_cstrncmp_~s1.base_6, ULTIMATE.start_cstrncmp_~s1.offset=v_ULTIMATE.start_cstrncmp_~s1.offset_5, #valid=|v_#valid_15|} OutVars{ULTIMATE.start_cstrncmp_#t~mem6=|v_ULTIMATE.start_cstrncmp_#t~mem6_2|, #valid=|v_#valid_15|, #memory_int=|v_#memory_int_7|, #length=|v_#length_13|, ULTIMATE.start_cstrncmp_~s1.base=v_ULTIMATE.start_cstrncmp_~s1.base_6, ULTIMATE.start_cstrncmp_~s1.offset=v_ULTIMATE.start_cstrncmp_~s1.offset_5} AuxVars[] AssignedVars[ULTIMATE.start_cstrncmp_#t~mem6] 260#L34-3 [218] L34-3-->L34-4: Formula: (and (not |v_ULTIMATE.start_cstrncmp_#t~short7_5|) (> |v_ULTIMATE.start_cstrncmp_#t~mem6_3| 0)) InVars {ULTIMATE.start_cstrncmp_#t~mem6=|v_ULTIMATE.start_cstrncmp_#t~mem6_3|} OutVars{ULTIMATE.start_cstrncmp_#t~mem6=|v_ULTIMATE.start_cstrncmp_#t~mem6_3|, ULTIMATE.start_cstrncmp_#t~short7=|v_ULTIMATE.start_cstrncmp_#t~short7_5|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncmp_#t~short7] 259#L34-4 [144] L34-4-->L31-8: Formula: (and (= v_ULTIMATE.start_cstrncmp_~s1.offset_7 (+ v_ULTIMATE.start_cstrncmp_~s1.offset_8 1)) (= v_ULTIMATE.start_cstrncmp_~s2.offset_5 (+ v_ULTIMATE.start_cstrncmp_~s2.offset_6 1)) (not |v_ULTIMATE.start_cstrncmp_#t~short7_9|) (= v_ULTIMATE.start_cstrncmp_~s1.base_9 v_ULTIMATE.start_cstrncmp_~s1.base_10) (= v_ULTIMATE.start_cstrncmp_~s2.base_7 v_ULTIMATE.start_cstrncmp_~s2.base_6)) InVars {ULTIMATE.start_cstrncmp_~s2.offset=v_ULTIMATE.start_cstrncmp_~s2.offset_6, ULTIMATE.start_cstrncmp_~s2.base=v_ULTIMATE.start_cstrncmp_~s2.base_7, ULTIMATE.start_cstrncmp_~s1.base=v_ULTIMATE.start_cstrncmp_~s1.base_10, ULTIMATE.start_cstrncmp_~s1.offset=v_ULTIMATE.start_cstrncmp_~s1.offset_8, ULTIMATE.start_cstrncmp_#t~short7=|v_ULTIMATE.start_cstrncmp_#t~short7_9|} OutVars{ULTIMATE.start_cstrncmp_~s2.offset=v_ULTIMATE.start_cstrncmp_~s2.offset_5, ULTIMATE.start_cstrncmp_#t~post8.offset=|v_ULTIMATE.start_cstrncmp_#t~post8.offset_2|, ULTIMATE.start_cstrncmp_#t~mem6=|v_ULTIMATE.start_cstrncmp_#t~mem6_5|, ULTIMATE.start_cstrncmp_#t~post9.base=|v_ULTIMATE.start_cstrncmp_#t~post9.base_2|, ULTIMATE.start_cstrncmp_~s2.base=v_ULTIMATE.start_cstrncmp_~s2.base_6, ULTIMATE.start_cstrncmp_#t~post8.base=|v_ULTIMATE.start_cstrncmp_#t~post8.base_2|, ULTIMATE.start_cstrncmp_~s1.base=v_ULTIMATE.start_cstrncmp_~s1.base_9, ULTIMATE.start_cstrncmp_#t~post9.offset=|v_ULTIMATE.start_cstrncmp_#t~post9.offset_2|, ULTIMATE.start_cstrncmp_~s1.offset=v_ULTIMATE.start_cstrncmp_~s1.offset_7, ULTIMATE.start_cstrncmp_#t~short7=|v_ULTIMATE.start_cstrncmp_#t~short7_8|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncmp_~s2.offset, ULTIMATE.start_cstrncmp_#t~post8.offset, ULTIMATE.start_cstrncmp_#t~mem6, ULTIMATE.start_cstrncmp_#t~post9.base, ULTIMATE.start_cstrncmp_~s2.base, ULTIMATE.start_cstrncmp_#t~post8.base, ULTIMATE.start_cstrncmp_~s1.base, ULTIMATE.start_cstrncmp_#t~post9.offset, ULTIMATE.start_cstrncmp_~s1.offset, ULTIMATE.start_cstrncmp_#t~short7] 253#L31-8 [2020-06-22 02:07:03,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 02:07:03,196 INFO L82 PathProgramCache]: Analyzing trace with hash 2041151458, now seen corresponding path program 4 times [2020-06-22 02:07:03,196 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 02:07:03,196 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 02:07:03,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:07:03,197 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 02:07:03,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:07:03,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 02:07:03,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 02:07:03,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 02:07:03,208 INFO L82 PathProgramCache]: Analyzing trace with hash -211207507, now seen corresponding path program 1 times [2020-06-22 02:07:03,208 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 02:07:03,209 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 02:07:03,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:07:03,209 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 02:07:03,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:07:03,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 02:07:03,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 02:07:03,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 02:07:03,218 INFO L82 PathProgramCache]: Analyzing trace with hash 2139166030, now seen corresponding path program 1 times [2020-06-22 02:07:03,218 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 02:07:03,218 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 02:07:03,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:07:03,219 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 02:07:03,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:07:03,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 02:07:03,322 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 02:07:03,322 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 02:07:03,323 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-06-22 02:07:03,431 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 56 [2020-06-22 02:07:03,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-06-22 02:07:03,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-06-22 02:07:03,469 INFO L87 Difference]: Start difference. First operand 18 states and 23 transitions. cyclomatic complexity: 6 Second operand 8 states. [2020-06-22 02:07:03,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 02:07:03,774 INFO L93 Difference]: Finished difference Result 84 states and 95 transitions. [2020-06-22 02:07:03,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-06-22 02:07:03,775 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 84 states and 95 transitions. [2020-06-22 02:07:03,777 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 30 [2020-06-22 02:07:03,777 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 84 states to 47 states and 57 transitions. [2020-06-22 02:07:03,778 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 47 [2020-06-22 02:07:03,778 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 47 [2020-06-22 02:07:03,778 INFO L73 IsDeterministic]: Start isDeterministic. Operand 47 states and 57 transitions. [2020-06-22 02:07:03,779 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 02:07:03,779 INFO L706 BuchiCegarLoop]: Abstraction has 47 states and 57 transitions. [2020-06-22 02:07:03,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states and 57 transitions. [2020-06-22 02:07:03,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 19. [2020-06-22 02:07:03,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2020-06-22 02:07:03,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 24 transitions. [2020-06-22 02:07:03,780 INFO L729 BuchiCegarLoop]: Abstraction has 19 states and 24 transitions. [2020-06-22 02:07:03,780 INFO L609 BuchiCegarLoop]: Abstraction has 19 states and 24 transitions. [2020-06-22 02:07:03,781 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2020-06-22 02:07:03,781 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 24 transitions. [2020-06-22 02:07:03,781 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2020-06-22 02:07:03,781 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 02:07:03,781 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 02:07:03,782 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 02:07:03,782 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 02:07:03,782 INFO L794 eck$LassoCheckResult]: Stem: 393#ULTIMATE.startENTRY [221] ULTIMATE.startENTRY-->L12: Formula: (and (= (store |v_#valid_22| 0 0) |v_#valid_21|) (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|)) InVars {#valid=|v_#valid_22|} OutVars{ULTIMATE.start___VERIFIER_nondet_String_#res.offset=|v_ULTIMATE.start___VERIFIER_nondet_String_#res.offset_7|, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset_5|, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~ret13.base=|v_ULTIMATE.start_main_#t~ret13.base_5|, ULTIMATE.start_main_#t~ret14.base=|v_ULTIMATE.start_main_#t~ret14.base_4|, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~ret16=|v_ULTIMATE.start_main_#t~ret16_4|, ULTIMATE.start_main_#t~ret13.offset=|v_ULTIMATE.start_main_#t~ret13.offset_5|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_11, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, #valid=|v_#valid_21|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_4|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_18, ULTIMATE.start___VERIFIER_nondet_String_#t~nondet0=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~nondet0_8|, ULTIMATE.start___VERIFIER_nondet_String_#res.base=|v_ULTIMATE.start___VERIFIER_nondet_String_#res.base_7|, ULTIMATE.start_main_#t~ret14.offset=|v_ULTIMATE.start_main_#t~ret14.offset_4|, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_5|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_13} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_nondet_String_#res.offset, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset, #NULL.offset, ULTIMATE.start_main_#t~ret13.base, ULTIMATE.start_main_#t~ret14.base, #NULL.base, ULTIMATE.start_main_#t~ret16, ULTIMATE.start_main_#t~ret13.offset, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_#t~nondet15, 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~ret14.offset, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base] 394#L12 [150] 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[] 396#L12-2 [175] 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] 379#L16 [223] L16-->L12-3: Formula: (let ((.cse0 (+ v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_14 v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_21))) (and (<= 1 .cse0) (= |v_ULTIMATE.start_main_#t~ret13.offset_6| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_14) (= v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_16 |v_ULTIMATE.start_main_#t~ret13.base_6|) (= (store |v_#memory_int_13| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_16 (store (select |v_#memory_int_13| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_16) (+ v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_14 v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_21 (- 1)) 0)) |v_#memory_int_12|) (= 1 (select |v_#valid_24| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_16)) (<= .cse0 (select |v_#length_20| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_16)))) InVars {ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_14, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_13|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_21, #length=|v_#length_20|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_16} OutVars{ULTIMATE.start___VERIFIER_nondet_String_#res.offset=|v_ULTIMATE.start___VERIFIER_nondet_String_#res.offset_9|, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset_6|, ULTIMATE.start_main_#t~ret13.base=|v_ULTIMATE.start_main_#t~ret13.base_6|, ULTIMATE.start_main_#t~ret13.offset=|v_ULTIMATE.start_main_#t~ret13.offset_6|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_13, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_12|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_20, #length=|v_#length_20|, ULTIMATE.start___VERIFIER_nondet_String_#t~nondet0=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~nondet0_10|, ULTIMATE.start___VERIFIER_nondet_String_#res.base=|v_ULTIMATE.start___VERIFIER_nondet_String_#res.base_9|, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_6|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_15} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_nondet_String_#res.offset, ULTIMATE.start_main_#t~ret13.offset, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset, #memory_int, ULTIMATE.start___VERIFIER_nondet_String_~length~0, ULTIMATE.start___VERIFIER_nondet_String_#t~nondet0, ULTIMATE.start_main_#t~ret13.base, ULTIMATE.start___VERIFIER_nondet_String_#res.base, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base] 380#L12-3 [154] L12-3-->L12-5: Formula: (>= v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_14 1) InVars {ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_14} OutVars{ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_14} AuxVars[] AssignedVars[] 386#L12-5 [181] L12-5-->L16-2: Formula: (and (= v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_7 |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset_4|) (= (store |v_#valid_8| |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_4| 1) |v_#valid_7|) (= (select |v_#valid_8| |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_4|) 0) (= v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_8 |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_4|) (= |v_#length_5| (store |v_#length_6| |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_4| v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_15)) (> 0 |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_4|) (= 0 |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset_4|) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_4|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_15, #length=|v_#length_6|, #valid=|v_#valid_8|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset_4|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_7, #valid=|v_#valid_7|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_15, #length=|v_#length_5|, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_4|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_8} 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] 387#L16-2 [225] L16-2-->L28: Formula: (let ((.cse0 (+ v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_16 v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_23))) (and (= |v_ULTIMATE.start___VERIFIER_nondet_String_#res.base_12| |v_ULTIMATE.start_main_#t~ret14.base_5|) (= |v_ULTIMATE.start_cstrncmp_#in~s1.offset_2| |v_ULTIMATE.start_main_#t~ret13.offset_7|) (= |v_ULTIMATE.start_main_#t~ret14.base_5| |v_ULTIMATE.start_cstrncmp_#in~s2.base_2|) (= |v_ULTIMATE.start_cstrncmp_#in~s2.offset_2| |v_ULTIMATE.start_main_#t~ret14.offset_5|) (= |v_ULTIMATE.start_main_#t~nondet15_5| |v_ULTIMATE.start_cstrncmp_#in~n_2|) (= v_ULTIMATE.start_cstrncmp_~s2.base_11 |v_ULTIMATE.start_cstrncmp_#in~s2.base_2|) (= |v_ULTIMATE.start_cstrncmp_#in~s1.base_2| |v_ULTIMATE.start_main_#t~ret13.base_7|) (<= 1 .cse0) (= |v_ULTIMATE.start___VERIFIER_nondet_String_#res.base_12| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_18) (= v_ULTIMATE.start_cstrncmp_~n_8 |v_ULTIMATE.start_cstrncmp_#in~n_2|) (= v_ULTIMATE.start_cstrncmp_~s2.offset_9 |v_ULTIMATE.start_cstrncmp_#in~s2.offset_2|) (= v_ULTIMATE.start_cstrncmp_~s1.base_14 |v_ULTIMATE.start_cstrncmp_#in~s1.base_2|) (= |v_ULTIMATE.start___VERIFIER_nondet_String_#res.offset_12| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_16) (<= .cse0 (select |v_#length_22| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_18)) (= 1 (select |v_#valid_26| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_18)) (= |v_ULTIMATE.start_cstrncmp_#in~s1.offset_2| v_ULTIMATE.start_cstrncmp_~s1.offset_11) (= |v_ULTIMATE.start_main_#t~ret14.offset_5| |v_ULTIMATE.start___VERIFIER_nondet_String_#res.offset_12|) (= (store |v_#memory_int_17| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_18 (store (select |v_#memory_int_17| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_18) (+ v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_16 v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_23 (- 1)) 0)) |v_#memory_int_16|))) InVars {ULTIMATE.start_main_#t~ret13.offset=|v_ULTIMATE.start_main_#t~ret13.offset_7|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_16, #valid=|v_#valid_26|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_5|, #memory_int=|v_#memory_int_17|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_23, #length=|v_#length_22|, ULTIMATE.start_main_#t~ret13.base=|v_ULTIMATE.start_main_#t~ret13.base_7|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_18} OutVars{ULTIMATE.start_cstrncmp_#t~mem6=|v_ULTIMATE.start_cstrncmp_#t~mem6_6|, ULTIMATE.start_cstrncmp_~s2.base=v_ULTIMATE.start_cstrncmp_~s2.base_11, ULTIMATE.start_cstrncmp_#res=|v_ULTIMATE.start_cstrncmp_#res_6|, ULTIMATE.start_cstrncmp_#t~mem3=|v_ULTIMATE.start_cstrncmp_#t~mem3_6|, ULTIMATE.start_cstrncmp_#t~mem4=|v_ULTIMATE.start_cstrncmp_#t~mem4_6|, ULTIMATE.start_cstrncmp_~s1.base=v_ULTIMATE.start_cstrncmp_~s1.base_14, ULTIMATE.start_cstrncmp_#t~post9.offset=|v_ULTIMATE.start_cstrncmp_#t~post9.offset_4|, ULTIMATE.start_cstrncmp_#t~post8.offset=|v_ULTIMATE.start_cstrncmp_#t~post8.offset_4|, ULTIMATE.start_cstrncmp_#t~post8.base=|v_ULTIMATE.start_cstrncmp_#t~post8.base_4|, ULTIMATE.start_cstrncmp_#t~post9.base=|v_ULTIMATE.start_cstrncmp_#t~post9.base_4|, ULTIMATE.start_cstrncmp_#in~s2.offset=|v_ULTIMATE.start_cstrncmp_#in~s2.offset_2|, ULTIMATE.start_cstrncmp_#t~ite12=|v_ULTIMATE.start_cstrncmp_#t~ite12_6|, #length=|v_#length_22|, ULTIMATE.start_cstrncmp_~n=v_ULTIMATE.start_cstrncmp_~n_8, ULTIMATE.start_main_#t~ret14.offset=|v_ULTIMATE.start_main_#t~ret14.offset_5|, ULTIMATE.start___VERIFIER_nondet_String_#res.base=|v_ULTIMATE.start___VERIFIER_nondet_String_#res.base_12|, ULTIMATE.start_cstrncmp_~s1.offset=v_ULTIMATE.start_cstrncmp_~s1.offset_11, ULTIMATE.start_cstrncmp_#t~post2=|v_ULTIMATE.start_cstrncmp_#t~post2_5|, ULTIMATE.start___VERIFIER_nondet_String_#res.offset=|v_ULTIMATE.start___VERIFIER_nondet_String_#res.offset_12|, ULTIMATE.start_cstrncmp_~uc2~0=v_ULTIMATE.start_cstrncmp_~uc2~0_6, ULTIMATE.start_cstrncmp_#in~n=|v_ULTIMATE.start_cstrncmp_#in~n_2|, ULTIMATE.start_cstrncmp_~uc1~0=v_ULTIMATE.start_cstrncmp_~uc1~0_6, ULTIMATE.start_main_#t~ret13.base=|v_ULTIMATE.start_main_#t~ret13.base_7|, ULTIMATE.start_cstrncmp_#in~s1.offset=|v_ULTIMATE.start_cstrncmp_#in~s1.offset_2|, ULTIMATE.start_cstrncmp_#t~mem11=|v_ULTIMATE.start_cstrncmp_#t~mem11_5|, ULTIMATE.start_main_#t~ret14.base=|v_ULTIMATE.start_main_#t~ret14.base_5|, ULTIMATE.start_cstrncmp_~s2.offset=v_ULTIMATE.start_cstrncmp_~s2.offset_9, ULTIMATE.start_main_#t~ret13.offset=|v_ULTIMATE.start_main_#t~ret13.offset_7|, ULTIMATE.start_cstrncmp_#t~mem10=|v_ULTIMATE.start_cstrncmp_#t~mem10_5|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_16, ULTIMATE.start_cstrncmp_#in~s2.base=|v_ULTIMATE.start_cstrncmp_#in~s2.base_2|, ULTIMATE.start_cstrncmp_#in~s1.base=|v_ULTIMATE.start_cstrncmp_#in~s1.base_2|, #valid=|v_#valid_26|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_5|, #memory_int=|v_#memory_int_16|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_23, ULTIMATE.start_cstrncmp_#t~short5=|v_ULTIMATE.start_cstrncmp_#t~short5_10|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_18, ULTIMATE.start_cstrncmp_#t~short7=|v_ULTIMATE.start_cstrncmp_#t~short7_10|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncmp_#t~mem6, ULTIMATE.start_cstrncmp_~s2.base, ULTIMATE.start_cstrncmp_#res, ULTIMATE.start_cstrncmp_#t~mem3, ULTIMATE.start_cstrncmp_#t~mem4, ULTIMATE.start_cstrncmp_~s1.base, ULTIMATE.start_cstrncmp_#t~post9.offset, ULTIMATE.start_cstrncmp_#t~post8.offset, ULTIMATE.start_cstrncmp_#t~post8.base, ULTIMATE.start_cstrncmp_#t~post9.base, ULTIMATE.start_cstrncmp_#in~s2.offset, ULTIMATE.start_cstrncmp_#t~ite12, ULTIMATE.start_cstrncmp_~n, ULTIMATE.start_main_#t~ret14.offset, ULTIMATE.start___VERIFIER_nondet_String_#res.base, ULTIMATE.start_cstrncmp_~s1.offset, ULTIMATE.start_cstrncmp_#t~post2, ULTIMATE.start___VERIFIER_nondet_String_#res.offset, ULTIMATE.start_cstrncmp_~uc2~0, ULTIMATE.start_cstrncmp_#in~n, ULTIMATE.start_cstrncmp_~uc1~0, ULTIMATE.start_cstrncmp_#in~s1.offset, ULTIMATE.start_cstrncmp_#t~mem11, ULTIMATE.start_main_#t~ret14.base, ULTIMATE.start_cstrncmp_~s2.offset, ULTIMATE.start_cstrncmp_#t~mem10, ULTIMATE.start_cstrncmp_#in~s2.base, ULTIMATE.start_cstrncmp_#in~s1.base, #memory_int, ULTIMATE.start_cstrncmp_#t~short5, ULTIMATE.start_cstrncmp_#t~short7] 384#L28 [187] L28-->L31-8: Formula: (> v_ULTIMATE.start_cstrncmp_~n_4 0) InVars {ULTIMATE.start_cstrncmp_~n=v_ULTIMATE.start_cstrncmp_~n_4} OutVars{ULTIMATE.start_cstrncmp_~n=v_ULTIMATE.start_cstrncmp_~n_4} AuxVars[] AssignedVars[] 385#L31-8 [2020-06-22 02:07:03,783 INFO L796 eck$LassoCheckResult]: Loop: 385#L31-8 [189] L31-8-->L31-1: Formula: (and (= v_ULTIMATE.start_cstrncmp_~n_5 (+ |v_ULTIMATE.start_cstrncmp_#t~post2_2| (- 1))) |v_ULTIMATE.start_cstrncmp_#t~short5_2| (= |v_ULTIMATE.start_cstrncmp_#t~post2_2| v_ULTIMATE.start_cstrncmp_~n_6) (< 0 |v_ULTIMATE.start_cstrncmp_#t~post2_2|)) InVars {ULTIMATE.start_cstrncmp_~n=v_ULTIMATE.start_cstrncmp_~n_6} OutVars{ULTIMATE.start_cstrncmp_~n=v_ULTIMATE.start_cstrncmp_~n_5, ULTIMATE.start_cstrncmp_#t~short5=|v_ULTIMATE.start_cstrncmp_#t~short5_2|, ULTIMATE.start_cstrncmp_#t~post2=|v_ULTIMATE.start_cstrncmp_#t~post2_2|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncmp_~n, ULTIMATE.start_cstrncmp_#t~short5, ULTIMATE.start_cstrncmp_#t~post2] 389#L31-1 [110] L31-1-->L31-2: Formula: |v_ULTIMATE.start_cstrncmp_#t~short5_3| InVars {ULTIMATE.start_cstrncmp_#t~short5=|v_ULTIMATE.start_cstrncmp_#t~short5_3|} OutVars{ULTIMATE.start_cstrncmp_#t~short5=|v_ULTIMATE.start_cstrncmp_#t~short5_3|} AuxVars[] AssignedVars[] 388#L31-2 [104] L31-2-->L31-3: Formula: (and (= |v_ULTIMATE.start_cstrncmp_#t~mem3_2| (select (select |v_#memory_int_5| v_ULTIMATE.start_cstrncmp_~s1.base_3) v_ULTIMATE.start_cstrncmp_~s1.offset_3)) (<= 0 v_ULTIMATE.start_cstrncmp_~s1.offset_3) (<= (+ v_ULTIMATE.start_cstrncmp_~s1.offset_3 1) (select |v_#length_9| v_ULTIMATE.start_cstrncmp_~s1.base_3)) (= (select |v_#valid_11| v_ULTIMATE.start_cstrncmp_~s1.base_3) 1)) InVars {#memory_int=|v_#memory_int_5|, #length=|v_#length_9|, ULTIMATE.start_cstrncmp_~s1.base=v_ULTIMATE.start_cstrncmp_~s1.base_3, ULTIMATE.start_cstrncmp_~s1.offset=v_ULTIMATE.start_cstrncmp_~s1.offset_3, #valid=|v_#valid_11|} OutVars{ULTIMATE.start_cstrncmp_#t~mem3=|v_ULTIMATE.start_cstrncmp_#t~mem3_2|, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_5|, #length=|v_#length_9|, ULTIMATE.start_cstrncmp_~s1.base=v_ULTIMATE.start_cstrncmp_~s1.base_3, ULTIMATE.start_cstrncmp_~s1.offset=v_ULTIMATE.start_cstrncmp_~s1.offset_3} AuxVars[] AssignedVars[ULTIMATE.start_cstrncmp_#t~mem3] 383#L31-3 [100] L31-3-->L31-4: Formula: (and (= (select |v_#valid_13| v_ULTIMATE.start_cstrncmp_~s2.base_3) 1) (= |v_ULTIMATE.start_cstrncmp_#t~mem4_2| (select (select |v_#memory_int_6| v_ULTIMATE.start_cstrncmp_~s2.base_3) v_ULTIMATE.start_cstrncmp_~s2.offset_3)) (<= (+ v_ULTIMATE.start_cstrncmp_~s2.offset_3 1) (select |v_#length_11| v_ULTIMATE.start_cstrncmp_~s2.base_3)) (<= 0 v_ULTIMATE.start_cstrncmp_~s2.offset_3)) InVars {#memory_int=|v_#memory_int_6|, ULTIMATE.start_cstrncmp_~s2.offset=v_ULTIMATE.start_cstrncmp_~s2.offset_3, #length=|v_#length_11|, ULTIMATE.start_cstrncmp_~s2.base=v_ULTIMATE.start_cstrncmp_~s2.base_3, #valid=|v_#valid_13|} OutVars{ULTIMATE.start_cstrncmp_~s2.offset=v_ULTIMATE.start_cstrncmp_~s2.offset_3, ULTIMATE.start_cstrncmp_~s2.base=v_ULTIMATE.start_cstrncmp_~s2.base_3, ULTIMATE.start_cstrncmp_#t~mem4=|v_ULTIMATE.start_cstrncmp_#t~mem4_2|, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_6|, #length=|v_#length_11|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncmp_#t~mem4] 381#L31-4 [210] L31-4-->L31-6: Formula: (and |v_ULTIMATE.start_cstrncmp_#t~short5_4| (= |v_ULTIMATE.start_cstrncmp_#t~mem4_3| |v_ULTIMATE.start_cstrncmp_#t~mem3_3|)) InVars {ULTIMATE.start_cstrncmp_#t~mem4=|v_ULTIMATE.start_cstrncmp_#t~mem4_3|, ULTIMATE.start_cstrncmp_#t~mem3=|v_ULTIMATE.start_cstrncmp_#t~mem3_3|} OutVars{ULTIMATE.start_cstrncmp_#t~mem4=|v_ULTIMATE.start_cstrncmp_#t~mem4_3|, ULTIMATE.start_cstrncmp_#t~mem3=|v_ULTIMATE.start_cstrncmp_#t~mem3_3|, ULTIMATE.start_cstrncmp_#t~short5=|v_ULTIMATE.start_cstrncmp_#t~short5_4|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncmp_#t~short5] 382#L31-6 [198] L31-6-->L34: Formula: (and |v_ULTIMATE.start_cstrncmp_#t~short5_9| (not |v_ULTIMATE.start_cstrncmp_#t~short7_2|) (> v_ULTIMATE.start_cstrncmp_~n_7 0)) InVars {ULTIMATE.start_cstrncmp_#t~short5=|v_ULTIMATE.start_cstrncmp_#t~short5_9|, ULTIMATE.start_cstrncmp_~n=v_ULTIMATE.start_cstrncmp_~n_7} OutVars{ULTIMATE.start_cstrncmp_#t~mem4=|v_ULTIMATE.start_cstrncmp_#t~mem4_5|, ULTIMATE.start_cstrncmp_#t~mem3=|v_ULTIMATE.start_cstrncmp_#t~mem3_5|, ULTIMATE.start_cstrncmp_~n=v_ULTIMATE.start_cstrncmp_~n_7, ULTIMATE.start_cstrncmp_#t~short5=|v_ULTIMATE.start_cstrncmp_#t~short5_8|, ULTIMATE.start_cstrncmp_#t~post2=|v_ULTIMATE.start_cstrncmp_#t~post2_4|, ULTIMATE.start_cstrncmp_#t~short7=|v_ULTIMATE.start_cstrncmp_#t~short7_2|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncmp_#t~mem4, ULTIMATE.start_cstrncmp_#t~mem3, ULTIMATE.start_cstrncmp_#t~short5, ULTIMATE.start_cstrncmp_#t~post2, ULTIMATE.start_cstrncmp_#t~short7] 397#L34 [126] L34-->L34-2: Formula: (not |v_ULTIMATE.start_cstrncmp_#t~short7_4|) InVars {ULTIMATE.start_cstrncmp_#t~short7=|v_ULTIMATE.start_cstrncmp_#t~short7_4|} OutVars{ULTIMATE.start_cstrncmp_#t~short7=|v_ULTIMATE.start_cstrncmp_#t~short7_4|} AuxVars[] AssignedVars[] 395#L34-2 [115] L34-2-->L34-3: Formula: (and (= 1 (select |v_#valid_15| v_ULTIMATE.start_cstrncmp_~s1.base_6)) (<= (+ v_ULTIMATE.start_cstrncmp_~s1.offset_5 1) (select |v_#length_13| v_ULTIMATE.start_cstrncmp_~s1.base_6)) (= |v_ULTIMATE.start_cstrncmp_#t~mem6_2| (select (select |v_#memory_int_7| v_ULTIMATE.start_cstrncmp_~s1.base_6) v_ULTIMATE.start_cstrncmp_~s1.offset_5)) (<= 0 v_ULTIMATE.start_cstrncmp_~s1.offset_5)) InVars {#memory_int=|v_#memory_int_7|, #length=|v_#length_13|, ULTIMATE.start_cstrncmp_~s1.base=v_ULTIMATE.start_cstrncmp_~s1.base_6, ULTIMATE.start_cstrncmp_~s1.offset=v_ULTIMATE.start_cstrncmp_~s1.offset_5, #valid=|v_#valid_15|} OutVars{ULTIMATE.start_cstrncmp_#t~mem6=|v_ULTIMATE.start_cstrncmp_#t~mem6_2|, #valid=|v_#valid_15|, #memory_int=|v_#memory_int_7|, #length=|v_#length_13|, ULTIMATE.start_cstrncmp_~s1.base=v_ULTIMATE.start_cstrncmp_~s1.base_6, ULTIMATE.start_cstrncmp_~s1.offset=v_ULTIMATE.start_cstrncmp_~s1.offset_5} AuxVars[] AssignedVars[ULTIMATE.start_cstrncmp_#t~mem6] 391#L34-3 [218] L34-3-->L34-4: Formula: (and (not |v_ULTIMATE.start_cstrncmp_#t~short7_5|) (> |v_ULTIMATE.start_cstrncmp_#t~mem6_3| 0)) InVars {ULTIMATE.start_cstrncmp_#t~mem6=|v_ULTIMATE.start_cstrncmp_#t~mem6_3|} OutVars{ULTIMATE.start_cstrncmp_#t~mem6=|v_ULTIMATE.start_cstrncmp_#t~mem6_3|, ULTIMATE.start_cstrncmp_#t~short7=|v_ULTIMATE.start_cstrncmp_#t~short7_5|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncmp_#t~short7] 390#L34-4 [144] L34-4-->L31-8: Formula: (and (= v_ULTIMATE.start_cstrncmp_~s1.offset_7 (+ v_ULTIMATE.start_cstrncmp_~s1.offset_8 1)) (= v_ULTIMATE.start_cstrncmp_~s2.offset_5 (+ v_ULTIMATE.start_cstrncmp_~s2.offset_6 1)) (not |v_ULTIMATE.start_cstrncmp_#t~short7_9|) (= v_ULTIMATE.start_cstrncmp_~s1.base_9 v_ULTIMATE.start_cstrncmp_~s1.base_10) (= v_ULTIMATE.start_cstrncmp_~s2.base_7 v_ULTIMATE.start_cstrncmp_~s2.base_6)) InVars {ULTIMATE.start_cstrncmp_~s2.offset=v_ULTIMATE.start_cstrncmp_~s2.offset_6, ULTIMATE.start_cstrncmp_~s2.base=v_ULTIMATE.start_cstrncmp_~s2.base_7, ULTIMATE.start_cstrncmp_~s1.base=v_ULTIMATE.start_cstrncmp_~s1.base_10, ULTIMATE.start_cstrncmp_~s1.offset=v_ULTIMATE.start_cstrncmp_~s1.offset_8, ULTIMATE.start_cstrncmp_#t~short7=|v_ULTIMATE.start_cstrncmp_#t~short7_9|} OutVars{ULTIMATE.start_cstrncmp_~s2.offset=v_ULTIMATE.start_cstrncmp_~s2.offset_5, ULTIMATE.start_cstrncmp_#t~post8.offset=|v_ULTIMATE.start_cstrncmp_#t~post8.offset_2|, ULTIMATE.start_cstrncmp_#t~mem6=|v_ULTIMATE.start_cstrncmp_#t~mem6_5|, ULTIMATE.start_cstrncmp_#t~post9.base=|v_ULTIMATE.start_cstrncmp_#t~post9.base_2|, ULTIMATE.start_cstrncmp_~s2.base=v_ULTIMATE.start_cstrncmp_~s2.base_6, ULTIMATE.start_cstrncmp_#t~post8.base=|v_ULTIMATE.start_cstrncmp_#t~post8.base_2|, ULTIMATE.start_cstrncmp_~s1.base=v_ULTIMATE.start_cstrncmp_~s1.base_9, ULTIMATE.start_cstrncmp_#t~post9.offset=|v_ULTIMATE.start_cstrncmp_#t~post9.offset_2|, ULTIMATE.start_cstrncmp_~s1.offset=v_ULTIMATE.start_cstrncmp_~s1.offset_7, ULTIMATE.start_cstrncmp_#t~short7=|v_ULTIMATE.start_cstrncmp_#t~short7_8|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncmp_~s2.offset, ULTIMATE.start_cstrncmp_#t~post8.offset, ULTIMATE.start_cstrncmp_#t~mem6, ULTIMATE.start_cstrncmp_#t~post9.base, ULTIMATE.start_cstrncmp_~s2.base, ULTIMATE.start_cstrncmp_#t~post8.base, ULTIMATE.start_cstrncmp_~s1.base, ULTIMATE.start_cstrncmp_#t~post9.offset, ULTIMATE.start_cstrncmp_~s1.offset, ULTIMATE.start_cstrncmp_#t~short7] 385#L31-8 [2020-06-22 02:07:03,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 02:07:03,783 INFO L82 PathProgramCache]: Analyzing trace with hash 2008954431, now seen corresponding path program 1 times [2020-06-22 02:07:03,783 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 02:07:03,784 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 02:07:03,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:07:03,784 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 02:07:03,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:07:03,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 02:07:03,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 02:07:03,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 02:07:03,797 INFO L82 PathProgramCache]: Analyzing trace with hash -211207507, now seen corresponding path program 2 times [2020-06-22 02:07:03,797 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 02:07:03,797 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 02:07:03,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:07:03,798 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 02:07:03,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:07:03,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 02:07:03,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 02:07:03,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 02:07:03,804 INFO L82 PathProgramCache]: Analyzing trace with hash -1564525717, now seen corresponding path program 1 times [2020-06-22 02:07:03,804 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 02:07:03,804 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 02:07:03,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:07:03,805 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 02:07:03,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:07:03,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 02:07:03,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 02:07:03,964 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 56 [2020-06-22 02:07:04,318 WARN L188 SmtUtils]: Spent 321.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 98 [2020-06-22 02:07:04,431 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2020-06-22 02:07:04,443 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 02:07:04,444 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 02:07:04,444 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 02:07:04,444 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 02:07:04,444 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 02:07:04,445 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 02:07:04,445 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 02:07:04,445 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 02:07:04,445 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration6_Lasso [2020-06-22 02:07:04,445 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 02:07:04,445 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 02:07:04,462 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 02:07:04,466 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 02:07:04,468 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 02:07:04,469 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 02:07:04,472 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 02:07:04,473 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 02:07:04,475 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 02:07:04,477 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 02:07:04,478 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 02:07:04,479 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 02:07:04,481 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 02:07:04,482 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 02:07:04,483 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 02:07:04,486 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 02:07:04,487 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 02:07:04,748 WARN L188 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 65 [2020-06-22 02:07:04,872 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 53 [2020-06-22 02:07:04,872 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 02:07:04,874 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 02:07:04,875 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 02:07:04,877 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 02:07:04,885 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 02:07:04,887 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 02:07:04,888 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 02:07:04,890 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 02:07:05,309 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 02:07:05,327 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 02:07:05,330 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 02:07:05,331 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 02:07:05,331 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 02:07:05,332 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 02:07:05,332 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 02:07:05,332 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 02:07:05,334 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 02:07:05,334 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 02:07:05,336 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 02:07:05,336 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 02:07:05,337 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 02:07:05,337 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 02:07:05,337 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 02:07:05,337 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 02:07:05,337 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 02:07:05,338 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 02:07:05,338 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 02:07:05,339 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 02:07:05,339 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 02:07:05,339 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 02:07:05,339 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 02:07:05,340 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 02:07:05,340 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 02:07:05,340 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 02:07:05,340 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 02:07:05,341 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 02:07:05,341 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 02:07:05,341 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 02:07:05,342 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 02:07:05,342 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 02:07:05,342 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 02:07:05,342 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 02:07:05,345 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 02:07:05,345 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 02:07:05,347 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 02:07:05,347 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 02:07:05,348 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 02:07:05,348 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 02:07:05,348 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 02:07:05,348 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 02:07:05,348 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 02:07:05,349 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 02:07:05,349 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 02:07:05,349 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 02:07:05,350 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 02:07:05,350 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 02:07:05,351 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 02:07:05,351 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 02:07:05,351 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 02:07:05,351 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 02:07:05,351 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 02:07:05,352 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 02:07:05,352 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 02:07:05,352 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 02:07:05,353 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 02:07:05,353 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 02:07:05,353 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 02:07:05,353 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 02:07:05,353 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 02:07:05,354 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 02:07:05,354 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 02:07:05,355 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 02:07:05,355 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 02:07:05,355 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 02:07:05,355 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 02:07:05,355 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 02:07:05,356 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 02:07:05,356 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 02:07:05,356 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 02:07:05,356 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 02:07:05,357 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 02:07:05,357 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 02:07:05,357 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 02:07:05,357 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 02:07:05,358 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 02:07:05,358 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 02:07:05,358 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 02:07:05,358 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 02:07:05,358 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 02:07:05,359 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 02:07:05,359 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 02:07:05,359 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 02:07:05,359 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 02:07:05,360 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 02:07:05,360 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 02:07:05,360 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 02:07:05,360 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 02:07:05,360 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 02:07:05,361 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 02:07:05,361 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 02:07:05,362 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 02:07:05,362 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 02:07:05,362 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 02:07:05,362 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 02:07:05,362 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 02:07:05,363 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 02:07:05,363 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 02:07:05,363 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 02:07:05,364 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 02:07:05,364 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 02:07:05,364 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 02:07:05,364 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 02:07:05,364 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 02:07:05,365 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 02:07:05,365 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 02:07:05,365 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 02:07:05,366 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 02:07:05,366 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 02:07:05,366 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 02:07:05,366 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 02:07:05,367 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 02:07:05,367 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 02:07:05,368 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 02:07:05,368 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 02:07:05,370 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 02:07:05,371 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 02:07:05,371 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 02:07:05,371 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 02:07:05,371 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 02:07:05,372 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 02:07:05,372 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 02:07:05,372 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 02:07:05,372 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 02:07:05,373 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 02:07:05,373 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 02:07:05,373 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 02:07:05,373 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 02:07:05,374 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 02:07:05,374 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 02:07:05,374 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 02:07:05,374 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 02:07:05,374 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 02:07:05,376 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 02:07:05,376 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 02:07:05,377 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 02:07:05,377 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 02:07:05,377 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 02:07:05,377 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 02:07:05,381 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 02:07:05,382 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 02:07:05,390 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 02:07:05,390 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 02:07:05,391 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 02:07:05,391 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 02:07:05,391 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 02:07:05,391 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 02:07:05,393 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 02:07:05,393 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 02:07:05,398 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 02:07:05,398 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 02:07:05,399 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 02:07:05,399 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 02:07:05,399 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 02:07:05,399 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 02:07:05,400 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 02:07:05,400 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 02:07:05,402 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 02:07:05,402 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 02:07:05,402 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 02:07:05,402 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 02:07:05,402 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 02:07:05,403 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 02:07:05,403 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 02:07:05,404 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 02:07:05,405 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 02:07:05,406 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 02:07:05,406 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 02:07:05,406 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 02:07:05,406 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 02:07:05,406 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 02:07:05,408 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 02:07:05,408 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 02:07:05,413 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 02:07:05,413 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 02:07:05,413 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 02:07:05,414 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 02:07:05,414 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 02:07:05,414 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 02:07:05,415 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 02:07:05,415 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 02:07:05,417 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 02:07:05,418 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 02:07:05,418 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 02:07:05,437 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 02:07:05,437 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 02:07:05,437 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 02:07:05,440 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 02:07:05,441 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 02:07:05,470 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 02:07:05,496 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2020-06-22 02:07:05,496 INFO L444 ModelExtractionUtils]: 29 out of 34 variables were initially zero. Simplification set additionally 2 variables to zero. [2020-06-22 02:07:05,499 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 02:07:05,500 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-06-22 02:07:05,501 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 02:07:05,501 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrncmp_~s2.offset, v_rep(select #length ULTIMATE.start_main_#t~ret13.base)_1) = -1*ULTIMATE.start_cstrncmp_~s2.offset + 1*v_rep(select #length ULTIMATE.start_main_#t~ret13.base)_1 Supporting invariants [] [2020-06-22 02:07:05,554 INFO L297 tatePredicateManager]: 11 out of 13 supporting invariants were superfluous and have been removed [2020-06-22 02:07:05,559 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 02:07:05,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 02:07:05,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 02:07:05,602 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 32 conjunts are in the unsatisfiable core [2020-06-22 02:07:05,603 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 02:07:05,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 02:07:05,665 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 13 conjunts are in the unsatisfiable core [2020-06-22 02:07:05,666 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 02:07:05,686 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 02:07:05,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 02:07:05,797 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 13 conjunts are in the unsatisfiable core [2020-06-22 02:07:05,797 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 02:07:05,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 02:07:05,848 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 13 conjunts are in the unsatisfiable core [2020-06-22 02:07:05,849 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 02:07:05,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 02:07:05,890 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 13 conjunts are in the unsatisfiable core [2020-06-22 02:07:05,891 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 02:07:05,916 INFO L98 LoopCannibalizer]: 4 predicates before loop cannibalization 5 predicates after loop cannibalization [2020-06-22 02:07:05,920 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.6 stem predicates 5 loop predicates [2020-06-22 02:07:05,922 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 19 states and 24 transitions. cyclomatic complexity: 6 Second operand 8 states. [2020-06-22 02:07:06,125 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 19 states and 24 transitions. cyclomatic complexity: 6. Second operand 8 states. Result 47 states and 55 transitions. Complement of second has 15 states. [2020-06-22 02:07:06,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 6 stem states 2 non-accepting loop states 1 accepting loop states [2020-06-22 02:07:06,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-06-22 02:07:06,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 46 transitions. [2020-06-22 02:07:06,127 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 46 transitions. Stem has 8 letters. Loop has 10 letters. [2020-06-22 02:07:06,128 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 02:07:06,128 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 46 transitions. Stem has 18 letters. Loop has 10 letters. [2020-06-22 02:07:06,129 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 02:07:06,129 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 46 transitions. Stem has 8 letters. Loop has 20 letters. [2020-06-22 02:07:06,130 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 02:07:06,136 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 47 states and 55 transitions. [2020-06-22 02:07:06,137 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-06-22 02:07:06,137 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 47 states to 0 states and 0 transitions. [2020-06-22 02:07:06,137 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-06-22 02:07:06,138 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-06-22 02:07:06,138 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-06-22 02:07:06,138 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 02:07:06,138 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 02:07:06,138 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 02:07:06,138 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 02:07:06,138 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2020-06-22 02:07:06,138 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-06-22 02:07:06,138 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-06-22 02:07:06,138 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-06-22 02:07:06,144 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 02:07:06 BasicIcfg [2020-06-22 02:07:06,144 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-06-22 02:07:06,145 INFO L168 Benchmark]: Toolchain (without parser) took 38262.45 ms. Allocated memory was 649.6 MB in the beginning and 998.2 MB in the end (delta: 348.7 MB). Free memory was 565.3 MB in the beginning and 820.3 MB in the end (delta: -255.0 MB). Peak memory consumption was 93.6 MB. Max. memory is 50.3 GB. [2020-06-22 02:07:06,145 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 02:07:06,145 INFO L168 Benchmark]: CACSL2BoogieTranslator took 304.86 ms. Allocated memory was 649.6 MB in the beginning and 670.0 MB in the end (delta: 20.4 MB). Free memory was 565.3 MB in the beginning and 632.2 MB in the end (delta: -66.9 MB). Peak memory consumption was 28.4 MB. Max. memory is 50.3 GB. [2020-06-22 02:07:06,146 INFO L168 Benchmark]: Boogie Procedure Inliner took 43.01 ms. Allocated memory is still 670.0 MB. Free memory was 632.2 MB in the beginning and 630.8 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. [2020-06-22 02:07:06,146 INFO L168 Benchmark]: Boogie Preprocessor took 26.54 ms. Allocated memory is still 670.0 MB. Free memory was 630.8 MB in the beginning and 628.1 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 50.3 GB. [2020-06-22 02:07:06,147 INFO L168 Benchmark]: RCFGBuilder took 352.33 ms. Allocated memory is still 670.0 MB. Free memory was 628.1 MB in the beginning and 601.7 MB in the end (delta: 26.4 MB). Peak memory consumption was 26.4 MB. Max. memory is 50.3 GB. [2020-06-22 02:07:06,147 INFO L168 Benchmark]: BlockEncodingV2 took 143.99 ms. Allocated memory is still 670.0 MB. Free memory was 601.7 MB in the beginning and 590.9 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 50.3 GB. [2020-06-22 02:07:06,148 INFO L168 Benchmark]: TraceAbstraction took 34033.91 ms. Allocated memory was 670.0 MB in the beginning and 989.9 MB in the end (delta: 319.8 MB). Free memory was 590.9 MB in the beginning and 889.3 MB in the end (delta: -298.4 MB). Peak memory consumption was 515.7 MB. Max. memory is 50.3 GB. [2020-06-22 02:07:06,148 INFO L168 Benchmark]: BuchiAutomizer took 3352.63 ms. Allocated memory was 989.9 MB in the beginning and 998.2 MB in the end (delta: 8.4 MB). Free memory was 889.3 MB in the beginning and 820.3 MB in the end (delta: 69.0 MB). Peak memory consumption was 77.4 MB. Max. memory is 50.3 GB. [2020-06-22 02:07:06,152 INFO L337 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 47 locations, 55 edges - StatisticsResult: Encoded RCFG 34 locations, 62 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 304.86 ms. Allocated memory was 649.6 MB in the beginning and 670.0 MB in the end (delta: 20.4 MB). Free memory was 565.3 MB in the beginning and 632.2 MB in the end (delta: -66.9 MB). Peak memory consumption was 28.4 MB. Max. memory is 50.3 GB. * Boogie Procedure Inliner took 43.01 ms. Allocated memory is still 670.0 MB. Free memory was 632.2 MB in the beginning and 630.8 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. * Boogie Preprocessor took 26.54 ms. Allocated memory is still 670.0 MB. Free memory was 630.8 MB in the beginning and 628.1 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 50.3 GB. * RCFGBuilder took 352.33 ms. Allocated memory is still 670.0 MB. Free memory was 628.1 MB in the beginning and 601.7 MB in the end (delta: 26.4 MB). Peak memory consumption was 26.4 MB. Max. memory is 50.3 GB. * BlockEncodingV2 took 143.99 ms. Allocated memory is still 670.0 MB. Free memory was 601.7 MB in the beginning and 590.9 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 50.3 GB. * TraceAbstraction took 34033.91 ms. Allocated memory was 670.0 MB in the beginning and 989.9 MB in the end (delta: 319.8 MB). Free memory was 590.9 MB in the beginning and 889.3 MB in the end (delta: -298.4 MB). Peak memory consumption was 515.7 MB. Max. memory is 50.3 GB. * BuchiAutomizer took 3352.63 ms. Allocated memory was 989.9 MB in the beginning and 998.2 MB in the end (delta: 8.4 MB). Free memory was 889.3 MB in the beginning and 820.3 MB in the end (delta: 69.0 MB). Peak memory consumption was 77.4 MB. 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_~nondetString~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base,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.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_25,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_25,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_25,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base,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.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_25,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_25,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_25,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base,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.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_25,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_25,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_25,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base,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.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_25,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_25,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_25,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_25,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_25,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_25,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_25,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_25,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_25,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #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 #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 #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 - 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 - 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 - 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 #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 #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 #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 - 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 - 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 #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 #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 40]: 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: 31]: 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: 31]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 34]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 34]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 39]: 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: 39]: 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: 40]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 14 specifications checked. All of them hold - InvariantResult [Line: 16]: Loop Invariant [2020-06-22 02:07:06,163 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 02:07:06,163 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: ((1 <= length && nondetString == 0) && unknown-#length-unknown[nondetString] == length) && \valid[nondetString] == 1 - InvariantResult [Line: 31]: Loop Invariant [2020-06-22 02:07:06,163 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base,QUANTIFIED] [2020-06-22 02:07:06,164 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base,QUANTIFIED] [2020-06-22 02:07:06,164 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 02:07:06,164 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base,QUANTIFIED] [2020-06-22 02:07:06,164 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18,QUANTIFIED] [2020-06-22 02:07:06,165 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_25,QUANTIFIED] [2020-06-22 02:07:06,165 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18,QUANTIFIED] [2020-06-22 02:07:06,165 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_25,QUANTIFIED] [2020-06-22 02:07:06,165 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18,QUANTIFIED] [2020-06-22 02:07:06,165 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_25,QUANTIFIED] [2020-06-22 02:07:06,166 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_20,QUANTIFIED] [2020-06-22 02:07:06,166 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_20,QUANTIFIED] [2020-06-22 02:07:06,166 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_20,QUANTIFIED] [2020-06-22 02:07:06,166 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base,QUANTIFIED] [2020-06-22 02:07:06,167 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base,QUANTIFIED] [2020-06-22 02:07:06,167 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 02:07:06,167 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base,QUANTIFIED] [2020-06-22 02:07:06,167 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18,QUANTIFIED] [2020-06-22 02:07:06,168 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_25,QUANTIFIED] [2020-06-22 02:07:06,168 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18,QUANTIFIED] [2020-06-22 02:07:06,168 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_25,QUANTIFIED] [2020-06-22 02:07:06,168 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18,QUANTIFIED] [2020-06-22 02:07:06,168 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_25,QUANTIFIED] [2020-06-22 02:07:06,170 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 02:07:06,170 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 02:07:06,170 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 02:07:06,170 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 02:07:06,171 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 02:07:06,171 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 02:07:06,171 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 02:07:06,171 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 02:07:06,171 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 02:07:06,172 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 02:07:06,172 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 02:07:06,172 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 02:07:06,172 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 02:07:06,172 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 02:07:06,172 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 02:07:06,173 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 02:07:06,173 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 02:07:06,173 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 02:07:06,173 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 02:07:06,174 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 02:07:06,174 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 02:07:06,174 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 02:07:06,174 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 02:07:06,174 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 02:07:06,175 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 02:07:06,175 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 02:07:06,175 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 02:07:06,175 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 02:07:06,175 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 02:07:06,175 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 02:07:06,176 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 02:07:06,176 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 02:07:06,176 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 02:07:06,176 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 02:07:06,176 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 02:07:06,177 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 02:07:06,177 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 02:07:06,177 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 02:07:06,177 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 02:07:06,178 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base,QUANTIFIED] [2020-06-22 02:07:06,178 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base,QUANTIFIED] [2020-06-22 02:07:06,178 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 02:07:06,179 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base,QUANTIFIED] [2020-06-22 02:07:06,179 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18,QUANTIFIED] [2020-06-22 02:07:06,179 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_25,QUANTIFIED] [2020-06-22 02:07:06,179 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18,QUANTIFIED] [2020-06-22 02:07:06,180 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_25,QUANTIFIED] [2020-06-22 02:07:06,180 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18,QUANTIFIED] [2020-06-22 02:07:06,180 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_25,QUANTIFIED] [2020-06-22 02:07:06,180 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_20,QUANTIFIED] [2020-06-22 02:07:06,181 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_20,QUANTIFIED] [2020-06-22 02:07:06,181 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_20,QUANTIFIED] [2020-06-22 02:07:06,181 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base,QUANTIFIED] [2020-06-22 02:07:06,181 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base,QUANTIFIED] [2020-06-22 02:07:06,182 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 02:07:06,182 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base,QUANTIFIED] [2020-06-22 02:07:06,182 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18,QUANTIFIED] [2020-06-22 02:07:06,182 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_25,QUANTIFIED] [2020-06-22 02:07:06,182 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18,QUANTIFIED] [2020-06-22 02:07:06,183 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_25,QUANTIFIED] [2020-06-22 02:07:06,183 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18,QUANTIFIED] [2020-06-22 02:07:06,183 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_25,QUANTIFIED] [2020-06-22 02:07:06,184 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 02:07:06,185 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 02:07:06,185 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 02:07:06,185 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 02:07:06,185 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 02:07:06,185 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 02:07:06,186 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 02:07:06,186 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 02:07:06,186 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 02:07:06,186 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 02:07:06,186 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 02:07:06,187 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 02:07:06,187 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 02:07:06,187 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 02:07:06,187 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 02:07:06,187 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 02:07:06,188 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 02:07:06,188 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 02:07:06,188 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 02:07:06,188 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 02:07:06,188 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 02:07:06,189 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 02:07:06,189 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 02:07:06,189 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 02:07:06,189 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 02:07:06,189 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 02:07:06,190 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 02:07:06,190 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 02:07:06,190 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 02:07:06,190 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 02:07:06,190 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 02:07:06,190 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 02:07:06,191 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 02:07:06,191 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 02:07:06,191 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 02:07:06,191 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 02:07:06,191 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 02:07:06,192 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 02:07:06,192 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: (((((((((\exists ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset : int, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base : int :: !(ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base == s1) && 0 == unknown-#memory_int-unknown[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base][ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset + unknown-#length-unknown[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base] + -1]) && !(nondetString == __VERIFIER_nondet_String())) && ((((((((1 <= unknown-#length-unknown[s2] && 0 == s2) && ((1 <= length && nondetString == 0) && 1 == \valid[s1]) && \valid[nondetString] == 1) && 1 <= unknown-#length-unknown[s1]) && 1 == \valid[s2]) && 0 == __VERIFIER_nondet_String()) && 1 <= unknown-#length-unknown[__VERIFIER_nondet_String()]) && unknown-#length-unknown[nondetString] == length) && 1 == \valid[__VERIFIER_nondet_String()]) && 0 == s1) && unknown-#memory_int-unknown[__VERIFIER_nondet_String()][unknown-#length-unknown[__VERIFIER_nondet_String()] + -1] == 0) && unknown-#memory_int-unknown[s1][unknown-#length-unknown[s1] + -1] == 0) && 0 == unknown-#memory_int-unknown[s2][unknown-#length-unknown[s2] + -1]) || (((((((((\exists v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18 : int, v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_25 : int :: ((v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18 + v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_25 <= unknown-#length-unknown[__VERIFIER_nondet_String()] && unknown-#memory_int-unknown[__VERIFIER_nondet_String()][v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18 + v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_25 + -1] == 0) && __VERIFIER_nondet_String() <= v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18) && 1 <= v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_25) && s1 + 1 <= unknown-#length-unknown[s1]) && 1 <= s1) && !(nondetString == __VERIFIER_nondet_String())) && (((((1 <= length && nondetString == 0) && n + 1 <= 0) && 1 == \valid[s2]) && 0 == __VERIFIER_nondet_String()) && 1 == \valid[s1]) && \valid[nondetString] == 1) && unknown-#length-unknown[nondetString] == length) && 1 == \valid[__VERIFIER_nondet_String()]) && s2 + 1 <= unknown-#length-unknown[s2]) && 1 <= s2)) || ((((((((((\exists v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_20 : int :: (0 <= v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_20 && v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_20 <= 0) && 0 == unknown-#memory_int-unknown[__VERIFIER_nondet_String()][unknown-#length-unknown[__VERIFIER_nondet_String()] + v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_20 + -1]) && (\exists ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset : int, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base : int :: !(ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base == s1) && 0 == unknown-#memory_int-unknown[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base][ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset + unknown-#length-unknown[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base] + -1])) && (((((((1 <= length && nondetString == 0) && 1 == \valid[s1]) && \valid[nondetString] == 1) && 1 == \valid[s2]) && 0 == __VERIFIER_nondet_String()) && (\exists v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18 : int, v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_25 : int :: ((v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18 + v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_25 <= unknown-#length-unknown[__VERIFIER_nondet_String()] && unknown-#memory_int-unknown[__VERIFIER_nondet_String()][v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18 + v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_25 + -1] == 0) && __VERIFIER_nondet_String() <= v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18) && 1 <= v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_25)) && 1 <= s1) && 1 <= s2) && s1 + 1 <= unknown-#length-unknown[s1]) && !(nondetString == __VERIFIER_nondet_String())) && unknown-#memory_int-unknown[s1][unknown-#length-unknown[s1] + -1] == 0) && 1 == \valid[__VERIFIER_nondet_String()]) && s2 + 1 <= unknown-#length-unknown[s2]) && unknown-#length-unknown[nondetString] == length) && 0 == unknown-#memory_int-unknown[s2][unknown-#length-unknown[s2] + -1])) || ((1 == length && ((((((((1 <= unknown-#length-unknown[s2] && 0 == s2) && ((1 <= length && nondetString == 0) && 1 == \valid[s1]) && \valid[nondetString] == 1) && 1 <= unknown-#length-unknown[s1]) && 1 == \valid[s2]) && 0 == __VERIFIER_nondet_String()) && 1 <= unknown-#length-unknown[__VERIFIER_nondet_String()]) && unknown-#length-unknown[nondetString] == length) && 1 == \valid[__VERIFIER_nondet_String()]) && 0 == s1) && unknown-#memory_int-unknown[s2][s2] == 0)) || (((((((((((((0 == s2 && 1 <= length) && nondetString == 0) && n + 1 <= 0) && 0 == __VERIFIER_nondet_String()) && 1 == \valid[s2]) && 1 <= unknown-#length-unknown[__VERIFIER_nondet_String()]) && unknown-#length-unknown[nondetString] == length) && \valid[nondetString] == 1) && 0 == s1) && 1 <= unknown-#length-unknown[s2]) && 1 <= unknown-#length-unknown[s1]) && 1 == \valid[s1]) && 1 == \valid[__VERIFIER_nondet_String()]) - InvariantResult [Line: 16]: Loop Invariant [2020-06-22 02:07:06,193 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_20,QUANTIFIED] [2020-06-22 02:07:06,193 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_20,QUANTIFIED] [2020-06-22 02:07:06,193 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_20,QUANTIFIED] [2020-06-22 02:07:06,193 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18,QUANTIFIED] [2020-06-22 02:07:06,194 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_25,QUANTIFIED] [2020-06-22 02:07:06,194 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18,QUANTIFIED] [2020-06-22 02:07:06,194 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_25,QUANTIFIED] [2020-06-22 02:07:06,194 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18,QUANTIFIED] [2020-06-22 02:07:06,194 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_25,QUANTIFIED] [2020-06-22 02:07:06,195 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 02:07:06,195 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 02:07:06,195 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 02:07:06,195 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 02:07:06,195 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 02:07:06,195 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 02:07:06,196 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 02:07:06,196 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_20,QUANTIFIED] [2020-06-22 02:07:06,196 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_20,QUANTIFIED] [2020-06-22 02:07:06,196 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_20,QUANTIFIED] [2020-06-22 02:07:06,197 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18,QUANTIFIED] [2020-06-22 02:07:06,197 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_25,QUANTIFIED] [2020-06-22 02:07:06,197 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18,QUANTIFIED] [2020-06-22 02:07:06,197 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_25,QUANTIFIED] [2020-06-22 02:07:06,197 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18,QUANTIFIED] [2020-06-22 02:07:06,197 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_25,QUANTIFIED] [2020-06-22 02:07:06,198 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 02:07:06,198 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 02:07:06,198 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 02:07:06,198 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 02:07:06,198 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 02:07:06,199 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 02:07:06,199 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: ((((((1 == length && nondetString == 0) && 0 == __VERIFIER_nondet_String()) && 1 <= unknown-#length-unknown[__VERIFIER_nondet_String()]) && unknown-#length-unknown[nondetString] == length) && 1 == \valid[__VERIFIER_nondet_String()]) && \valid[nondetString] == 1) || (!(nondetString == __VERIFIER_nondet_String()) && (\exists v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_20 : int :: (0 <= v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_20 && v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_20 <= 0) && 0 == unknown-#memory_int-unknown[__VERIFIER_nondet_String()][unknown-#length-unknown[__VERIFIER_nondet_String()] + v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_20 + -1]) && (\exists v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18 : int, v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_25 : int :: ((v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18 + v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_25 <= unknown-#length-unknown[__VERIFIER_nondet_String()] && unknown-#memory_int-unknown[__VERIFIER_nondet_String()][v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18 + v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_25 + -1] == 0) && __VERIFIER_nondet_String() <= v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18) && 1 <= v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_25) && ((((1 <= length && nondetString == 0) && 0 == __VERIFIER_nondet_String()) && unknown-#length-unknown[nondetString] == length) && 1 == \valid[__VERIFIER_nondet_String()]) && \valid[nondetString] == 1) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 34 locations, 14 error locations. SAFE Result, 33.9s OverallTime, 26 OverallIterations, 4 TraceHistogramMax, 18.2s AutomataDifference, 0.0s DeadEndRemovalTime, 8.6s HoareAnnotationTime, HoareTripleCheckerStatistics: 275 SDtfs, 3568 SDslu, 2325 SDs, 0 SdLazy, 4697 SolverSat, 438 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 628 GetRequests, 296 SyntacticMatches, 3 SemanticMatches, 329 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1610 ImplicationChecksByTransitivity, 15.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=119occurred in iteration=21, 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.1s AutomataMinimizationTime, 26 MinimizatonAttempts, 800 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 14 NumberOfFragments, 610 HoareAnnotationTreeSize, 3 FomulaSimplifications, 1054245 FormulaSimplificationTreeSizeReduction, 0.5s HoareSimplificationTime, 3 FomulaSimplificationsInter, 59332 FormulaSimplificationTreeSizeReductionInter, 8.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 5.3s InterpolantComputationTime, 824 NumberOfCodeBlocks, 824 NumberOfCodeBlocksAsserted, 40 NumberOfCheckSat, 787 ConstructedInterpolants, 157 QuantifiedInterpolants, 350505 SizeOfPredicates, 106 NumberOfNonLiveVariables, 1808 ConjunctsInSsa, 265 ConjunctsInUnsatCore, 37 InterpolantComputations, 17 PerfectInterpolantSequences, 148/383 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available - StatisticsResult: Constructed decomposition of program Your program was decomposed into 6 terminating modules (5 trivial, 0 deterministic, 1 nondeterministic). One nondeterministic module has affine ranking function -1 * s2 + unknown-#length-unknown[__VERIFIER_nondet_String()] and consists of 9 locations. 5 modules have a trivial ranking function, the largest among these consists of 8 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.3s and 7 iterations. TraceHistogramMax:1. Analysis of lassos took 2.1s. Construction of modules took 0.3s. Büchi inclusion checks took 0.7s. Highest rank in rank-based complementation 3. Minimization of det autom 6. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 29 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 28 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 69 SDtfs, 278 SDslu, 275 SDs, 0 SdLazy, 481 SolverSat, 46 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time LassoAnalysisResults: nont0 unkn0 SFLI4 SFLT0 conc1 concLT0 SILN0 SILU0 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital226 mio100 ax100 hnf100 lsp89 ukn84 mio100 lsp42 div100 bol100 ite100 ukn100 eq193 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 02:06:24.630 ----------------------------------------------- eclipse.buildId=unknown java.version=1.8.0_242 java.vendor=Oracle Corporation BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox2/benchmark/theBenchmark.c Command-line arguments: -os linux -ws gtk -arch x86_64 -consoleLog -data @user.home/.ultimate -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -data /export/starexec/sandbox2/tmp -i /export/starexec/sandbox2/benchmark/theBenchmark.c !ENTRY org.eclipse.core.resources 2 10035 2020-06-22 02:07:06.440 !MESSAGE The workspace will exit with unsaved changes in this session. Received shutdown request... Ultimate: GTK+ Version Check