java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.trace.refinement.strategy SIFA_TAIPAN --sifa.abstract.domain CompoundDomain --rcfgbuilder.size.of.a.code.block LoopFreeBlock --sifa.call.summarizer TopInputCallSummarizer --sifa.fluid SizeLimitFluid --sifa.simplification.technique SIMPLIFY_QUICK -i ../../../trunk/examples/svcomp/loops/string-1.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-36ac518-m [2019-10-07 13:46:14,297 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-07 13:46:14,299 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-07 13:46:14,317 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-07 13:46:14,318 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-07 13:46:14,320 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-07 13:46:14,321 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-07 13:46:14,333 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-07 13:46:14,335 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-07 13:46:14,337 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-07 13:46:14,338 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-07 13:46:14,340 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-07 13:46:14,340 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-07 13:46:14,343 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-07 13:46:14,346 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-07 13:46:14,347 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-07 13:46:14,349 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-07 13:46:14,350 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-07 13:46:14,352 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-07 13:46:14,358 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-07 13:46:14,362 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-07 13:46:14,363 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-07 13:46:14,364 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-07 13:46:14,364 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-07 13:46:14,368 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-07 13:46:14,369 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-07 13:46:14,369 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-07 13:46:14,370 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-07 13:46:14,372 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-07 13:46:14,373 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-07 13:46:14,373 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-07 13:46:14,375 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-07 13:46:14,376 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-07 13:46:14,377 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-07 13:46:14,378 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-07 13:46:14,378 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-07 13:46:14,379 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-07 13:46:14,379 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-07 13:46:14,379 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-07 13:46:14,381 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-07 13:46:14,384 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-07 13:46:14,385 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-07 13:46:14,403 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-07 13:46:14,404 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-07 13:46:14,405 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-07 13:46:14,405 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-07 13:46:14,406 INFO L138 SettingsManager]: * Use SBE=true [2019-10-07 13:46:14,406 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-07 13:46:14,406 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-07 13:46:14,406 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-07 13:46:14,406 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-07 13:46:14,407 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-07 13:46:14,408 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-07 13:46:14,408 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-07 13:46:14,408 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-07 13:46:14,409 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-07 13:46:14,409 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-07 13:46:14,409 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-07 13:46:14,409 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-07 13:46:14,409 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-07 13:46:14,410 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-07 13:46:14,410 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-07 13:46:14,410 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-07 13:46:14,410 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-07 13:46:14,410 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-07 13:46:14,411 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-07 13:46:14,411 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-07 13:46:14,411 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-07 13:46:14,411 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-07 13:46:14,411 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-07 13:46:14,412 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> SIFA_TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Abstract Domain -> CompoundDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Size of a code block -> LoopFreeBlock Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Call Summarizer -> TopInputCallSummarizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Fluid -> SizeLimitFluid Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Simplification Technique -> SIMPLIFY_QUICK [2019-10-07 13:46:14,671 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-07 13:46:14,684 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-07 13:46:14,687 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-07 13:46:14,688 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-07 13:46:14,689 INFO L275 PluginConnector]: CDTParser initialized [2019-10-07 13:46:14,690 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/string-1.i [2019-10-07 13:46:14,750 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3c59a5a0e/c8a2b2f45e6848dbbc96d1a35ec64103/FLAG8c4eb647b [2019-10-07 13:46:15,174 INFO L306 CDTParser]: Found 1 translation units. [2019-10-07 13:46:15,175 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/string-1.i [2019-10-07 13:46:15,182 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3c59a5a0e/c8a2b2f45e6848dbbc96d1a35ec64103/FLAG8c4eb647b [2019-10-07 13:46:15,584 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3c59a5a0e/c8a2b2f45e6848dbbc96d1a35ec64103 [2019-10-07 13:46:15,595 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-07 13:46:15,596 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-07 13:46:15,598 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-07 13:46:15,598 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-07 13:46:15,602 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-07 13:46:15,603 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 01:46:15" (1/1) ... [2019-10-07 13:46:15,606 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@62c03921 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:46:15, skipping insertion in model container [2019-10-07 13:46:15,606 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 01:46:15" (1/1) ... [2019-10-07 13:46:15,614 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-07 13:46:15,636 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-07 13:46:15,845 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 13:46:15,849 INFO L188 MainTranslator]: Completed pre-run [2019-10-07 13:46:15,873 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 13:46:15,975 INFO L192 MainTranslator]: Completed translation [2019-10-07 13:46:15,976 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:46:15 WrapperNode [2019-10-07 13:46:15,976 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-07 13:46:15,977 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-07 13:46:15,977 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-07 13:46:15,977 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-07 13:46:15,988 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:46:15" (1/1) ... [2019-10-07 13:46:15,989 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:46:15" (1/1) ... [2019-10-07 13:46:15,996 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:46:15" (1/1) ... [2019-10-07 13:46:15,997 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:46:15" (1/1) ... [2019-10-07 13:46:16,006 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:46:15" (1/1) ... [2019-10-07 13:46:16,013 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:46:15" (1/1) ... [2019-10-07 13:46:16,014 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:46:15" (1/1) ... [2019-10-07 13:46:16,017 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-07 13:46:16,018 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-07 13:46:16,018 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-07 13:46:16,018 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-07 13:46:16,019 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:46:15" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-07 13:46:16,080 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-07 13:46:16,081 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-07 13:46:16,081 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-07 13:46:16,081 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-07 13:46:16,081 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-07 13:46:16,081 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-07 13:46:16,082 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-07 13:46:16,082 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-10-07 13:46:16,082 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-07 13:46:16,082 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-07 13:46:16,082 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-07 13:46:16,082 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-07 13:46:16,083 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-07 13:46:16,083 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-07 13:46:16,083 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-07 13:46:16,520 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-07 13:46:16,521 INFO L284 CfgBuilder]: Removed 5 assume(true) statements. [2019-10-07 13:46:16,522 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 01:46:16 BoogieIcfgContainer [2019-10-07 13:46:16,522 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-07 13:46:16,523 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-07 13:46:16,523 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-07 13:46:16,526 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-07 13:46:16,527 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.10 01:46:15" (1/3) ... [2019-10-07 13:46:16,527 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fb390d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 01:46:16, skipping insertion in model container [2019-10-07 13:46:16,528 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:46:15" (2/3) ... [2019-10-07 13:46:16,528 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fb390d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 01:46:16, skipping insertion in model container [2019-10-07 13:46:16,528 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 01:46:16" (3/3) ... [2019-10-07 13:46:16,530 INFO L109 eAbstractionObserver]: Analyzing ICFG string-1.i [2019-10-07 13:46:16,543 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-07 13:46:16,551 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-07 13:46:16,561 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-07 13:46:16,582 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-07 13:46:16,583 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-07 13:46:16,583 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-07 13:46:16,583 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-07 13:46:16,583 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-07 13:46:16,583 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-07 13:46:16,583 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-07 13:46:16,584 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-07 13:46:16,599 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states. [2019-10-07 13:46:16,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-07 13:46:16,604 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:46:16,605 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:46:16,607 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:46:16,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:46:16,613 INFO L82 PathProgramCache]: Analyzing trace with hash 176718902, now seen corresponding path program 1 times [2019-10-07 13:46:16,621 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:46:16,622 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:46:16,622 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:46:16,622 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:46:16,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:46:16,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:46:16,762 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:46:16,763 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:46:16,764 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:46:16,764 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-07 13:46:16,768 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-07 13:46:16,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-07 13:46:16,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-07 13:46:16,787 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 2 states. [2019-10-07 13:46:16,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:46:16,814 INFO L93 Difference]: Finished difference Result 45 states and 60 transitions. [2019-10-07 13:46:16,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-07 13:46:16,816 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 18 [2019-10-07 13:46:16,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:46:16,825 INFO L225 Difference]: With dead ends: 45 [2019-10-07 13:46:16,825 INFO L226 Difference]: Without dead ends: 21 [2019-10-07 13:46:16,829 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-07 13:46:16,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-10-07 13:46:16,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-10-07 13:46:16,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-10-07 13:46:16,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2019-10-07 13:46:16,870 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 18 [2019-10-07 13:46:16,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:46:16,871 INFO L462 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2019-10-07 13:46:16,871 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-07 13:46:16,872 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2019-10-07 13:46:16,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-07 13:46:16,873 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:46:16,873 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:46:16,873 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:46:16,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:46:16,874 INFO L82 PathProgramCache]: Analyzing trace with hash -1184471636, now seen corresponding path program 1 times [2019-10-07 13:46:16,874 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:46:16,875 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:46:16,875 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:46:16,875 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:46:16,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:46:16,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:46:16,940 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:46:16,940 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:46:16,941 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:46:16,941 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 13:46:16,943 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 13:46:16,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 13:46:16,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 13:46:16,944 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 3 states. [2019-10-07 13:46:16,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:46:16,994 INFO L93 Difference]: Finished difference Result 40 states and 50 transitions. [2019-10-07 13:46:16,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 13:46:16,995 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-10-07 13:46:16,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:46:16,998 INFO L225 Difference]: With dead ends: 40 [2019-10-07 13:46:16,998 INFO L226 Difference]: Without dead ends: 25 [2019-10-07 13:46:17,000 INFO L606 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 [2019-10-07 13:46:17,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-10-07 13:46:17,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 23. [2019-10-07 13:46:17,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-10-07 13:46:17,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2019-10-07 13:46:17,008 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 20 [2019-10-07 13:46:17,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:46:17,009 INFO L462 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2019-10-07 13:46:17,009 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 13:46:17,009 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2019-10-07 13:46:17,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-07 13:46:17,010 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:46:17,011 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:46:17,011 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:46:17,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:46:17,012 INFO L82 PathProgramCache]: Analyzing trace with hash -1352731196, now seen corresponding path program 1 times [2019-10-07 13:46:17,012 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:46:17,013 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:46:17,013 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:46:17,014 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:46:17,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:46:17,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:46:17,108 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-07 13:46:17,108 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:46:17,109 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 13:46:17,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 13:46:17,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:46:17,177 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-07 13:46:17,187 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 13:46:17,227 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-07 13:46:17,228 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 13:46:17,276 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-07 13:46:17,277 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 13:46:17,331 INFO L162 IcfgInterpreter]: Started Sifa with 21 locations of interest [2019-10-07 13:46:17,331 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 13:46:17,339 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 13:46:17,347 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 13:46:17,348 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 13:46:17,524 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-07 13:46:18,040 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 21 for LOIs [2019-10-07 13:46:18,070 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-07 13:46:18,085 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 13:46:18,085 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 13:46:18,087 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 186#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-07 13:46:18,088 INFO L193 IcfgInterpreter]: Reachable states at location L55 satisfy 162#(and (or (and (= main_~i~0 main_~j~0) (= (select (select |#memory_int| |main_~#string_B~0.base|) (+ |main_~#string_B~0.offset| main_~nc_B~0)) 0) (<= main_~nc_A~0 main_~nc_B~0) (= (ite (< main_~nc_B~0 (+ main_~j~0 1)) 1 0) main_~found~0) (= main_~j~0 0) (= 0 (select (select |#memory_int| |main_~#string_A~0.base|) (+ main_~nc_A~0 |main_~#string_A~0.offset|))) (= (select (select |#memory_int| |main_~#string_B~0.base|) (+ |main_~#string_B~0.offset| 4)) 0) (= main_~nc_B~0 0) (not (< main_~i~0 main_~nc_A~0)) (= main_~nc_A~0 0)) (and (= main_~i~0 main_~j~0) (= (select (select |#memory_int| |main_~#string_B~0.base|) (+ |main_~#string_B~0.offset| main_~nc_B~0)) 0) (<= main_~nc_A~0 main_~nc_B~0) (not (< main_~j~0 main_~nc_B~0)) (= (ite (< main_~nc_B~0 (+ main_~j~0 1)) 1 0) main_~found~0) (= main_~j~0 0) (= 0 (select (select |#memory_int| |main_~#string_A~0.base|) (+ main_~nc_A~0 |main_~#string_A~0.offset|))) (= (select (select |#memory_int| |main_~#string_B~0.base|) (+ |main_~#string_B~0.offset| 4)) 0) (= main_~nc_B~0 0) (= main_~nc_A~0 0))) (<= 0 main_~j~0) (<= 0 main_~nc_A~0) (<= 0 main_~i~0) (<= 0 main_~nc_B~0) (<= 0 main_~found~0) (<= main_~i~0 0) (<= main_~j~0 0) (<= main_~found~0 1) (<= main_~nc_A~0 0) (<= main_~nc_B~0 0)) [2019-10-07 13:46:18,088 INFO L193 IcfgInterpreter]: Reachable states at location L28-4 satisfy 137#(and (<= 0 main_~nc_A~0) (<= 0 main_~i~0) (<= 5 main_~i~0) (= 0 (select (select |#memory_int| |main_~#string_A~0.base|) (+ main_~nc_A~0 |main_~#string_A~0.offset|))) (= (select (select |#memory_int| |main_~#string_B~0.base|) (+ |main_~#string_B~0.offset| 4)) 0) (not (< main_~i~0 5)) (<= main_~nc_A~0 0) (= main_~nc_A~0 0)) [2019-10-07 13:46:18,089 INFO L193 IcfgInterpreter]: Reachable states at location L25 satisfy 122#(and (= (select (select |#memory_int| |main_~#string_B~0.base|) (+ |main_~#string_B~0.offset| 4)) |main_#t~mem6|) (<= 0 main_~i~0) (<= 5 main_~i~0) (not (< main_~i~0 5))) [2019-10-07 13:46:18,089 INFO L193 IcfgInterpreter]: Reachable states at location L28-3 satisfy 127#(and (<= 0 main_~nc_A~0) (<= 0 main_~i~0) (<= 5 main_~i~0) (= (select (select |#memory_int| |main_~#string_B~0.base|) (+ |main_~#string_B~0.offset| 4)) 0) (not (< main_~i~0 5)) (<= main_~nc_A~0 0) (= main_~nc_A~0 0)) [2019-10-07 13:46:18,089 INFO L193 IcfgInterpreter]: Reachable states at location L19-3 satisfy 68#true [2019-10-07 13:46:18,089 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 13:46:18,090 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 13:46:18,090 INFO L193 IcfgInterpreter]: Reachable states at location L28-1 satisfy 132#(and (<= 0 main_~nc_A~0) (<= 0 main_~i~0) (<= 5 main_~i~0) (= (select (select |#memory_int| |main_~#string_A~0.base|) (+ main_~nc_A~0 |main_~#string_A~0.offset|)) |main_#t~mem7|) (= (select (select |#memory_int| |main_~#string_B~0.base|) (+ |main_~#string_B~0.offset| 4)) 0) (not (< main_~i~0 5)) (<= main_~nc_A~0 0) (= main_~nc_A~0 0)) [2019-10-07 13:46:18,090 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 191#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 13:46:18,091 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 13:46:18,091 INFO L193 IcfgInterpreter]: Reachable states at location L32-4 satisfy 152#(and (<= 0 main_~nc_A~0) (<= 0 main_~i~0) (<= 0 main_~nc_B~0) (= (select (select |#memory_int| |main_~#string_B~0.base|) (+ |main_~#string_B~0.offset| main_~nc_B~0)) 0) (<= 5 main_~i~0) (= 0 (select (select |#memory_int| |main_~#string_A~0.base|) (+ main_~nc_A~0 |main_~#string_A~0.offset|))) (= (select (select |#memory_int| |main_~#string_B~0.base|) (+ |main_~#string_B~0.offset| 4)) 0) (= main_~nc_B~0 0) (not (< main_~i~0 5)) (<= main_~nc_A~0 0) (= main_~nc_A~0 0) (<= main_~nc_B~0 0)) [2019-10-07 13:46:18,091 INFO L193 IcfgInterpreter]: Reachable states at location L41-2 satisfy 157#(and (<= 0 main_~j~0) (<= 0 main_~nc_A~0) (<= 0 main_~i~0) (= (select (select |#memory_int| |main_~#string_B~0.base|) (+ |main_~#string_B~0.offset| 4)) 0) (<= main_~i~0 0) (= main_~i~0 main_~j~0) (<= 0 main_~nc_B~0) (= (select (select |#memory_int| |main_~#string_B~0.base|) (+ |main_~#string_B~0.offset| main_~nc_B~0)) 0) (<= main_~nc_A~0 main_~nc_B~0) (= main_~j~0 0) (= 0 (select (select |#memory_int| |main_~#string_A~0.base|) (+ main_~nc_A~0 |main_~#string_A~0.offset|))) (= main_~nc_B~0 0) (<= main_~j~0 0) (<= main_~nc_A~0 0) (= main_~nc_A~0 0) (<= main_~nc_B~0 0)) [2019-10-07 13:46:18,091 INFO L193 IcfgInterpreter]: Reachable states at location L6 satisfy 177#(and (<= __VERIFIER_assert_~cond 0) (exists ((|v_main_~#string_A~0.offset_BEFORE_CALL_1| Int) (|v_main_~#string_B~0.base_BEFORE_CALL_1| Int) (|v_main_~#string_A~0.base_BEFORE_CALL_1| Int) (|v_main_~#string_B~0.offset_BEFORE_CALL_1| Int)) (and (= 0 (select (select |#memory_int| |v_main_~#string_A~0.base_BEFORE_CALL_1|) |v_main_~#string_A~0.offset_BEFORE_CALL_1|)) (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#string_B~0.base_BEFORE_CALL_1|) (+ |v_main_~#string_B~0.offset_BEFORE_CALL_1| 4)) 0) (= (select (select |#memory_int| |v_main_~#string_B~0.base_BEFORE_CALL_1|) |v_main_~#string_B~0.offset_BEFORE_CALL_1|) 0))) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 13:46:18,092 INFO L193 IcfgInterpreter]: Reachable states at location L32-3 satisfy 142#(and (<= 0 main_~nc_A~0) (<= 0 main_~i~0) (<= 0 main_~nc_B~0) (<= 5 main_~i~0) (= 0 (select (select |#memory_int| |main_~#string_A~0.base|) (+ main_~nc_A~0 |main_~#string_A~0.offset|))) (= (select (select |#memory_int| |main_~#string_B~0.base|) (+ |main_~#string_B~0.offset| 4)) 0) (= main_~nc_B~0 0) (not (< main_~i~0 5)) (<= main_~nc_A~0 0) (= main_~nc_A~0 0) (<= main_~nc_B~0 0)) [2019-10-07 13:46:18,093 INFO L193 IcfgInterpreter]: Reachable states at location L5 satisfy 172#(and (exists ((|v_main_~#string_A~0.offset_BEFORE_CALL_1| Int) (|v_main_~#string_B~0.base_BEFORE_CALL_1| Int) (|v_main_~#string_A~0.base_BEFORE_CALL_1| Int) (|v_main_~#string_B~0.offset_BEFORE_CALL_1| Int)) (and (= 0 (select (select |#memory_int| |v_main_~#string_A~0.base_BEFORE_CALL_1|) |v_main_~#string_A~0.offset_BEFORE_CALL_1|)) (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#string_B~0.base_BEFORE_CALL_1|) (+ |v_main_~#string_B~0.offset_BEFORE_CALL_1| 4)) 0) (= (select (select |#memory_int| |v_main_~#string_B~0.base_BEFORE_CALL_1|) |v_main_~#string_B~0.offset_BEFORE_CALL_1|) 0))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 13:46:18,093 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 167#(exists ((|v_main_~#string_A~0.offset_BEFORE_CALL_1| Int) (|v_main_~#string_B~0.base_BEFORE_CALL_1| Int) (|v_main_~#string_A~0.base_BEFORE_CALL_1| Int) (|v_main_~#string_B~0.offset_BEFORE_CALL_1| Int)) (and (= 0 (select (select |#memory_int| |v_main_~#string_A~0.base_BEFORE_CALL_1|) |v_main_~#string_A~0.offset_BEFORE_CALL_1|)) (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#string_B~0.base_BEFORE_CALL_1|) (+ |v_main_~#string_B~0.offset_BEFORE_CALL_1| 4)) 0) (= (select (select |#memory_int| |v_main_~#string_B~0.base_BEFORE_CALL_1|) |v_main_~#string_B~0.offset_BEFORE_CALL_1|) 0))) [2019-10-07 13:46:18,094 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 182#(and (<= __VERIFIER_assert_~cond 0) (exists ((|v_main_~#string_A~0.offset_BEFORE_CALL_1| Int) (|v_main_~#string_B~0.base_BEFORE_CALL_1| Int) (|v_main_~#string_A~0.base_BEFORE_CALL_1| Int) (|v_main_~#string_B~0.offset_BEFORE_CALL_1| Int)) (and (= 0 (select (select |#memory_int| |v_main_~#string_A~0.base_BEFORE_CALL_1|) |v_main_~#string_A~0.offset_BEFORE_CALL_1|)) (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#string_B~0.base_BEFORE_CALL_1|) (+ |v_main_~#string_B~0.offset_BEFORE_CALL_1| 4)) 0) (= (select (select |#memory_int| |v_main_~#string_B~0.base_BEFORE_CALL_1|) |v_main_~#string_B~0.offset_BEFORE_CALL_1|) 0))) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 13:46:18,094 INFO L193 IcfgInterpreter]: Reachable states at location L23-3 satisfy 117#(<= 0 main_~i~0) [2019-10-07 13:46:18,094 INFO L193 IcfgInterpreter]: Reachable states at location L32-1 satisfy 147#(and (<= 0 main_~nc_A~0) (<= 0 main_~i~0) (= (select (select |#memory_int| |main_~#string_B~0.base|) (+ |main_~#string_B~0.offset| main_~nc_B~0)) |main_#t~mem9|) (<= 0 main_~nc_B~0) (<= 5 main_~i~0) (= 0 (select (select |#memory_int| |main_~#string_A~0.base|) (+ main_~nc_A~0 |main_~#string_A~0.offset|))) (= (select (select |#memory_int| |main_~#string_B~0.base|) (+ |main_~#string_B~0.offset| 4)) 0) (= main_~nc_B~0 0) (not (< main_~i~0 5)) (<= main_~nc_A~0 0) (= main_~nc_A~0 0) (<= main_~nc_B~0 0)) [2019-10-07 13:46:18,094 INFO L193 IcfgInterpreter]: Reachable states at location L21 satisfy 73#(and (= (select (select |#memory_int| |main_~#string_A~0.base|) (+ |main_~#string_A~0.offset| 4)) |main_#t~mem3|) (<= 5 main_~i~0) (not (< main_~i~0 5))) [2019-10-07 13:46:18,840 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 35 [2019-10-07 13:46:18,925 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 3 imperfect interpolant sequences. [2019-10-07 13:46:18,926 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [4, 4, 4] total 24 [2019-10-07 13:46:18,927 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-10-07 13:46:18,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-10-07 13:46:18,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=461, Unknown=0, NotChecked=0, Total=552 [2019-10-07 13:46:18,930 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand 19 states. [2019-10-07 13:46:19,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:46:19,683 INFO L93 Difference]: Finished difference Result 44 states and 53 transitions. [2019-10-07 13:46:19,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-10-07 13:46:19,684 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 22 [2019-10-07 13:46:19,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:46:19,685 INFO L225 Difference]: With dead ends: 44 [2019-10-07 13:46:19,685 INFO L226 Difference]: Without dead ends: 33 [2019-10-07 13:46:19,687 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 46 SyntacticMatches, 2 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 369 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=211, Invalid=1195, Unknown=0, NotChecked=0, Total=1406 [2019-10-07 13:46:19,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-10-07 13:46:19,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 28. [2019-10-07 13:46:19,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-10-07 13:46:19,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 33 transitions. [2019-10-07 13:46:19,694 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 33 transitions. Word has length 22 [2019-10-07 13:46:19,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:46:19,694 INFO L462 AbstractCegarLoop]: Abstraction has 28 states and 33 transitions. [2019-10-07 13:46:19,695 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-10-07 13:46:19,695 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 33 transitions. [2019-10-07 13:46:19,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-10-07 13:46:19,696 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:46:19,696 INFO L385 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:46:19,908 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 13:46:19,909 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:46:19,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:46:19,909 INFO L82 PathProgramCache]: Analyzing trace with hash 1780369353, now seen corresponding path program 1 times [2019-10-07 13:46:19,909 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:46:19,909 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:46:19,910 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:46:19,910 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:46:19,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:46:19,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:46:19,955 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-07 13:46:19,955 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:46:19,955 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 13:46:19,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 13:46:20,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:46:20,019 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-07 13:46:20,022 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 13:46:20,033 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-07 13:46:20,034 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 13:46:20,049 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-07 13:46:20,049 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 13:46:20,051 INFO L162 IcfgInterpreter]: Started Sifa with 21 locations of interest [2019-10-07 13:46:20,051 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 13:46:20,051 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 13:46:20,052 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 13:46:20,052 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 13:46:20,085 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-07 13:46:20,487 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 3 for LOIs [2019-10-07 13:46:20,501 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-07 13:46:20,509 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 13:46:20,510 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 13:46:20,510 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 227#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-07 13:46:20,510 INFO L193 IcfgInterpreter]: Reachable states at location L55 satisfy 198#(and (<= 0 main_~j~0) (<= 0 main_~i~0) (<= 0 main_~found~0) (or (and (<= 0 main_~nc_A~0) (= main_~i~0 main_~j~0) (<= 0 main_~nc_B~0) (<= main_~nc_A~0 main_~nc_B~0) (not (< main_~j~0 main_~nc_B~0)) (= (ite (< main_~nc_B~0 (+ main_~j~0 1)) 1 0) main_~found~0) (= main_~j~0 0) (= main_~nc_A~0 0)) (and (<= 0 main_~nc_A~0) (= main_~i~0 main_~j~0) (<= 0 main_~nc_B~0) (<= main_~nc_A~0 main_~nc_B~0) (= (ite (< main_~nc_B~0 (+ main_~j~0 1)) 1 0) main_~found~0) (= main_~j~0 0) (not (< main_~i~0 main_~nc_A~0)) (= main_~nc_A~0 0))) (<= main_~i~0 0) (<= main_~j~0 0) (<= main_~found~0 1) (<= main_~nc_A~0 0)) [2019-10-07 13:46:20,511 INFO L193 IcfgInterpreter]: Reachable states at location L28-4 satisfy 137#(and (<= 0 main_~nc_A~0) (<= 0 main_~i~0) (<= 5 main_~i~0) (= 0 (select (select |#memory_int| |main_~#string_A~0.base|) (+ main_~nc_A~0 |main_~#string_A~0.offset|))) (= (select (select |#memory_int| |main_~#string_B~0.base|) (+ |main_~#string_B~0.offset| 4)) 0) (not (< main_~i~0 5)) (<= main_~nc_A~0 0) (= main_~nc_A~0 0)) [2019-10-07 13:46:20,511 INFO L193 IcfgInterpreter]: Reachable states at location L25 satisfy 122#(and (= (select (select |#memory_int| |main_~#string_B~0.base|) (+ |main_~#string_B~0.offset| 4)) |main_#t~mem6|) (<= 0 main_~i~0) (<= 5 main_~i~0) (not (< main_~i~0 5))) [2019-10-07 13:46:20,511 INFO L193 IcfgInterpreter]: Reachable states at location L28-3 satisfy 127#(and (<= 0 main_~nc_A~0) (<= 0 main_~i~0) (<= 5 main_~i~0) (= (select (select |#memory_int| |main_~#string_B~0.base|) (+ |main_~#string_B~0.offset| 4)) 0) (not (< main_~i~0 5)) (<= main_~nc_A~0 0) (= main_~nc_A~0 0)) [2019-10-07 13:46:20,512 INFO L193 IcfgInterpreter]: Reachable states at location L19-3 satisfy 68#true [2019-10-07 13:46:20,512 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 13:46:20,512 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 13:46:20,513 INFO L193 IcfgInterpreter]: Reachable states at location L28-1 satisfy 132#(and (<= 0 main_~nc_A~0) (<= 0 main_~i~0) (<= 5 main_~i~0) (= (select (select |#memory_int| |main_~#string_A~0.base|) (+ main_~nc_A~0 |main_~#string_A~0.offset|)) |main_#t~mem7|) (= (select (select |#memory_int| |main_~#string_B~0.base|) (+ |main_~#string_B~0.offset| 4)) 0) (not (< main_~i~0 5)) (<= main_~nc_A~0 0) (= main_~nc_A~0 0)) [2019-10-07 13:46:20,513 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 232#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 13:46:20,513 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 13:46:20,514 INFO L193 IcfgInterpreter]: Reachable states at location L32-4 satisfy 188#(and (<= 0 main_~nc_A~0) (<= 0 main_~nc_B~0) (<= 5 main_~i~0) (<= main_~nc_A~0 0) (= main_~nc_A~0 0)) [2019-10-07 13:46:20,514 INFO L193 IcfgInterpreter]: Reachable states at location L41-2 satisfy 193#(and (<= 0 main_~j~0) (<= 0 main_~nc_A~0) (= main_~i~0 main_~j~0) (<= 0 main_~i~0) (<= 0 main_~nc_B~0) (<= main_~nc_A~0 main_~nc_B~0) (= main_~j~0 0) (<= main_~i~0 0) (<= main_~j~0 0) (<= main_~nc_A~0 0) (= main_~nc_A~0 0)) [2019-10-07 13:46:20,514 INFO L193 IcfgInterpreter]: Reachable states at location L6 satisfy 218#false [2019-10-07 13:46:20,514 INFO L193 IcfgInterpreter]: Reachable states at location L32-3 satisfy 204#(or (and (<= 0 main_~nc_A~0) (<= 5 main_~i~0) (<= 1 main_~nc_B~0) (<= main_~nc_A~0 0) (= main_~nc_A~0 0)) (and (<= 0 main_~nc_A~0) (<= 0 main_~i~0) (<= 0 main_~nc_B~0) (<= 5 main_~i~0) (= 0 (select (select |#memory_int| |main_~#string_A~0.base|) (+ main_~nc_A~0 |main_~#string_A~0.offset|))) (= (select (select |#memory_int| |main_~#string_B~0.base|) (+ |main_~#string_B~0.offset| 4)) 0) (= main_~nc_B~0 0) (not (< main_~i~0 5)) (<= main_~nc_A~0 0) (= main_~nc_A~0 0) (<= main_~nc_B~0 0))) [2019-10-07 13:46:20,515 INFO L193 IcfgInterpreter]: Reachable states at location L5 satisfy 213#(and (= |__VERIFIER_assert_#in~cond| 1) (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 13:46:20,515 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 223#false [2019-10-07 13:46:20,516 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 208#(and (= |__VERIFIER_assert_#in~cond| 1) (<= 1 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1)) [2019-10-07 13:46:20,516 INFO L193 IcfgInterpreter]: Reachable states at location L23-3 satisfy 117#(<= 0 main_~i~0) [2019-10-07 13:46:20,516 INFO L193 IcfgInterpreter]: Reachable states at location L32-1 satisfy 183#(and (<= 0 main_~nc_A~0) (<= 0 main_~nc_B~0) (<= 5 main_~i~0) (<= main_~nc_A~0 0) (= main_~nc_A~0 0)) [2019-10-07 13:46:20,518 INFO L193 IcfgInterpreter]: Reachable states at location L21 satisfy 73#(and (= (select (select |#memory_int| |main_~#string_A~0.base|) (+ |main_~#string_A~0.offset| 4)) |main_#t~mem3|) (<= 5 main_~i~0) (not (< main_~i~0 5))) [2019-10-07 13:46:21,076 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 3 imperfect interpolant sequences. [2019-10-07 13:46:21,076 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [4, 4, 4] total 23 [2019-10-07 13:46:21,077 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-07 13:46:21,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-07 13:46:21,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=425, Unknown=0, NotChecked=0, Total=506 [2019-10-07 13:46:21,078 INFO L87 Difference]: Start difference. First operand 28 states and 33 transitions. Second operand 18 states. [2019-10-07 13:46:21,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:46:21,693 INFO L93 Difference]: Finished difference Result 43 states and 51 transitions. [2019-10-07 13:46:21,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-07 13:46:21,696 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 24 [2019-10-07 13:46:21,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:46:21,697 INFO L225 Difference]: With dead ends: 43 [2019-10-07 13:46:21,700 INFO L226 Difference]: Without dead ends: 27 [2019-10-07 13:46:21,702 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 305 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=178, Invalid=1012, Unknown=0, NotChecked=0, Total=1190 [2019-10-07 13:46:21,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-10-07 13:46:21,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 25. [2019-10-07 13:46:21,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-10-07 13:46:21,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2019-10-07 13:46:21,710 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 24 [2019-10-07 13:46:21,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:46:21,710 INFO L462 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2019-10-07 13:46:21,711 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-07 13:46:21,712 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2019-10-07 13:46:21,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-10-07 13:46:21,713 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:46:21,713 INFO L385 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:46:21,924 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 13:46:21,925 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:46:21,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:46:21,925 INFO L82 PathProgramCache]: Analyzing trace with hash -207415457, now seen corresponding path program 1 times [2019-10-07 13:46:21,926 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:46:21,926 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:46:21,926 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:46:21,926 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:46:21,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:46:21,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:46:21,999 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-07 13:46:22,000 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:46:22,000 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 13:46:22,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 13:46:22,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:46:22,081 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-07 13:46:22,085 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 13:46:22,096 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-07 13:46:22,096 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 13:46:22,127 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-07 13:46:22,127 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 13:46:22,129 INFO L162 IcfgInterpreter]: Started Sifa with 21 locations of interest [2019-10-07 13:46:22,129 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 13:46:22,130 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 13:46:22,130 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 13:46:22,130 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 13:46:22,155 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-07 13:46:22,505 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 12 for LOIs [2019-10-07 13:46:22,516 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-07 13:46:22,525 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 13:46:22,525 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 13:46:22,525 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 227#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-07 13:46:22,525 INFO L193 IcfgInterpreter]: Reachable states at location L55 satisfy 198#(and (<= 0 main_~j~0) (<= 0 main_~i~0) (<= 0 main_~nc_B~0) (<= 0 main_~found~0) (or (and (<= 0 main_~nc_A~0) (= main_~i~0 main_~j~0) (= (select (select |#memory_int| |main_~#string_B~0.base|) (+ |main_~#string_B~0.offset| main_~nc_B~0)) 0) (<= main_~nc_A~0 main_~nc_B~0) (= (ite (< main_~nc_B~0 (+ main_~j~0 1)) 1 0) main_~found~0) (= main_~j~0 0) (= main_~nc_B~0 0) (not (< main_~i~0 main_~nc_A~0))) (and (<= 0 main_~nc_A~0) (= main_~i~0 main_~j~0) (= (select (select |#memory_int| |main_~#string_B~0.base|) (+ |main_~#string_B~0.offset| main_~nc_B~0)) 0) (<= main_~nc_A~0 main_~nc_B~0) (not (< main_~j~0 main_~nc_B~0)) (= (ite (< main_~nc_B~0 (+ main_~j~0 1)) 1 0) main_~found~0) (= main_~j~0 0) (= main_~nc_B~0 0))) (<= main_~i~0 0) (<= main_~j~0 0) (<= main_~found~0 1) (<= main_~nc_A~0 0) (<= main_~nc_B~0 0)) [2019-10-07 13:46:22,526 INFO L193 IcfgInterpreter]: Reachable states at location L28-4 satisfy 173#(and (<= 0 main_~nc_A~0) (<= 5 main_~i~0)) [2019-10-07 13:46:22,526 INFO L193 IcfgInterpreter]: Reachable states at location L25 satisfy 122#(and (= (select (select |#memory_int| |main_~#string_B~0.base|) (+ |main_~#string_B~0.offset| 4)) |main_#t~mem6|) (<= 0 main_~i~0) (<= 5 main_~i~0) (not (< main_~i~0 5))) [2019-10-07 13:46:22,526 INFO L193 IcfgInterpreter]: Reachable states at location L28-3 satisfy 204#(or (and (<= 5 main_~i~0) (<= 1 main_~nc_A~0)) (and (<= 0 main_~nc_A~0) (<= 0 main_~i~0) (<= 5 main_~i~0) (= (select (select |#memory_int| |main_~#string_B~0.base|) (+ |main_~#string_B~0.offset| 4)) 0) (not (< main_~i~0 5)) (<= main_~nc_A~0 0) (= main_~nc_A~0 0))) [2019-10-07 13:46:22,526 INFO L193 IcfgInterpreter]: Reachable states at location L19-3 satisfy 68#true [2019-10-07 13:46:22,526 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 13:46:22,527 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 13:46:22,527 INFO L193 IcfgInterpreter]: Reachable states at location L28-1 satisfy 168#(and (<= 0 main_~nc_A~0) (<= 5 main_~i~0)) [2019-10-07 13:46:22,527 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 232#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 13:46:22,527 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 13:46:22,527 INFO L193 IcfgInterpreter]: Reachable states at location L32-4 satisfy 188#(and (<= 0 main_~nc_A~0) (<= 0 main_~nc_B~0) (<= 5 main_~i~0) (= (select (select |#memory_int| |main_~#string_B~0.base|) (+ |main_~#string_B~0.offset| main_~nc_B~0)) 0) (= main_~nc_B~0 0) (<= main_~nc_B~0 0)) [2019-10-07 13:46:22,528 INFO L193 IcfgInterpreter]: Reachable states at location L41-2 satisfy 193#(and (<= 0 main_~j~0) (<= 0 main_~nc_A~0) (<= 0 main_~i~0) (<= main_~i~0 0) (= main_~i~0 main_~j~0) (<= 0 main_~nc_B~0) (= (select (select |#memory_int| |main_~#string_B~0.base|) (+ |main_~#string_B~0.offset| main_~nc_B~0)) 0) (<= main_~nc_A~0 main_~nc_B~0) (= main_~j~0 0) (= main_~nc_B~0 0) (<= main_~j~0 0) (<= main_~nc_A~0 0) (<= main_~nc_B~0 0)) [2019-10-07 13:46:22,529 INFO L193 IcfgInterpreter]: Reachable states at location L6 satisfy 218#(and (exists ((|v_main_~#string_B~0.base_BEFORE_CALL_2| Int) (|v_main_~#string_B~0.offset_BEFORE_CALL_2| Int)) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#string_B~0.base_BEFORE_CALL_2|) |v_main_~#string_B~0.offset_BEFORE_CALL_2|) 0))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 13:46:22,530 INFO L193 IcfgInterpreter]: Reachable states at location L32-3 satisfy 178#(and (<= 0 main_~nc_A~0) (<= 0 main_~nc_B~0) (<= 5 main_~i~0) (= main_~nc_B~0 0) (<= main_~nc_B~0 0)) [2019-10-07 13:46:22,531 INFO L193 IcfgInterpreter]: Reachable states at location L5 satisfy 213#(and (exists ((|v_main_~#string_B~0.base_BEFORE_CALL_2| Int) (|v_main_~#string_B~0.offset_BEFORE_CALL_2| Int)) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#string_B~0.base_BEFORE_CALL_2|) |v_main_~#string_B~0.offset_BEFORE_CALL_2|) 0))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 13:46:22,531 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 223#(and (exists ((|v_main_~#string_B~0.base_BEFORE_CALL_2| Int) (|v_main_~#string_B~0.offset_BEFORE_CALL_2| Int)) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#string_B~0.base_BEFORE_CALL_2|) |v_main_~#string_B~0.offset_BEFORE_CALL_2|) 0))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 13:46:22,531 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 208#(exists ((|v_main_~#string_B~0.base_BEFORE_CALL_2| Int) (|v_main_~#string_B~0.offset_BEFORE_CALL_2| Int)) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#string_B~0.base_BEFORE_CALL_2|) |v_main_~#string_B~0.offset_BEFORE_CALL_2|) 0))) [2019-10-07 13:46:22,532 INFO L193 IcfgInterpreter]: Reachable states at location L23-3 satisfy 117#(<= 0 main_~i~0) [2019-10-07 13:46:22,532 INFO L193 IcfgInterpreter]: Reachable states at location L32-1 satisfy 183#(and (<= 0 main_~nc_A~0) (= (select (select |#memory_int| |main_~#string_B~0.base|) (+ |main_~#string_B~0.offset| main_~nc_B~0)) |main_#t~mem9|) (<= 0 main_~nc_B~0) (<= 5 main_~i~0) (= main_~nc_B~0 0) (<= main_~nc_B~0 0)) [2019-10-07 13:46:22,532 INFO L193 IcfgInterpreter]: Reachable states at location L21 satisfy 73#(and (= (select (select |#memory_int| |main_~#string_A~0.base|) (+ |main_~#string_A~0.offset| 4)) |main_#t~mem3|) (<= 5 main_~i~0) (not (< main_~i~0 5))) [2019-10-07 13:46:23,002 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 3 imperfect interpolant sequences. [2019-10-07 13:46:23,003 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [4, 4, 4] total 23 [2019-10-07 13:46:23,004 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-07 13:46:23,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-07 13:46:23,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=422, Unknown=0, NotChecked=0, Total=506 [2019-10-07 13:46:23,005 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand 18 states. [2019-10-07 13:46:23,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:46:23,691 INFO L93 Difference]: Finished difference Result 40 states and 47 transitions. [2019-10-07 13:46:23,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-07 13:46:23,691 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 24 [2019-10-07 13:46:23,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:46:23,692 INFO L225 Difference]: With dead ends: 40 [2019-10-07 13:46:23,692 INFO L226 Difference]: Without dead ends: 29 [2019-10-07 13:46:23,693 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 53 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 312 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=186, Invalid=1004, Unknown=0, NotChecked=0, Total=1190 [2019-10-07 13:46:23,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-10-07 13:46:23,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2019-10-07 13:46:23,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-10-07 13:46:23,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2019-10-07 13:46:23,700 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 24 [2019-10-07 13:46:23,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:46:23,700 INFO L462 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2019-10-07 13:46:23,700 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-07 13:46:23,700 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2019-10-07 13:46:23,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-10-07 13:46:23,701 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:46:23,701 INFO L385 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:46:23,905 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 13:46:23,906 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:46:23,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:46:23,907 INFO L82 PathProgramCache]: Analyzing trace with hash -1377800540, now seen corresponding path program 1 times [2019-10-07 13:46:23,907 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:46:23,907 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:46:23,907 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:46:23,908 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:46:23,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:46:23,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:46:23,956 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-10-07 13:46:23,956 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:46:23,957 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 13:46:23,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 13:46:24,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:46:24,025 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-07 13:46:24,027 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 13:46:24,043 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-10-07 13:46:24,044 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 13:46:24,059 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-10-07 13:46:24,060 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 13:46:24,061 INFO L162 IcfgInterpreter]: Started Sifa with 21 locations of interest [2019-10-07 13:46:24,062 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 13:46:24,062 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 13:46:24,062 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 13:46:24,063 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 13:46:24,087 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-07 13:46:24,345 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 3 for LOIs [2019-10-07 13:46:24,352 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-07 13:46:24,355 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 13:46:24,355 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 13:46:24,356 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 268#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-07 13:46:24,356 INFO L193 IcfgInterpreter]: Reachable states at location L55 satisfy 234#(and (<= 0 main_~j~0) (or (and (<= 0 main_~nc_A~0) (= main_~i~0 main_~j~0) (<= main_~nc_A~0 main_~nc_B~0) (not (< main_~j~0 main_~nc_B~0)) (= (ite (< main_~nc_B~0 (+ main_~j~0 1)) 1 0) main_~found~0) (= main_~j~0 0)) (and (<= 0 main_~nc_A~0) (= main_~i~0 main_~j~0) (<= main_~nc_A~0 main_~nc_B~0) (= (ite (< main_~nc_B~0 (+ main_~j~0 1)) 1 0) main_~found~0) (= main_~j~0 0) (not (< main_~i~0 main_~nc_A~0)))) (<= 0 main_~i~0) (<= 0 main_~nc_B~0) (<= 0 main_~found~0) (<= main_~i~0 0) (<= main_~j~0 0) (<= main_~found~0 1) (<= main_~nc_A~0 0)) [2019-10-07 13:46:24,356 INFO L193 IcfgInterpreter]: Reachable states at location L28-4 satisfy 173#(and (<= 0 main_~nc_A~0) (<= 5 main_~i~0)) [2019-10-07 13:46:24,357 INFO L193 IcfgInterpreter]: Reachable states at location L25 satisfy 122#(and (= (select (select |#memory_int| |main_~#string_B~0.base|) (+ |main_~#string_B~0.offset| 4)) |main_#t~mem6|) (<= 0 main_~i~0) (<= 5 main_~i~0) (not (< main_~i~0 5))) [2019-10-07 13:46:24,357 INFO L193 IcfgInterpreter]: Reachable states at location L28-3 satisfy 245#(or (and (<= 5 main_~i~0) (<= 1 main_~nc_A~0)) (and (<= 0 main_~nc_A~0) (<= 0 main_~i~0) (<= 5 main_~i~0) (= (select (select |#memory_int| |main_~#string_B~0.base|) (+ |main_~#string_B~0.offset| 4)) 0) (not (< main_~i~0 5)) (<= main_~nc_A~0 0) (= main_~nc_A~0 0))) [2019-10-07 13:46:24,357 INFO L193 IcfgInterpreter]: Reachable states at location L19-3 satisfy 68#true [2019-10-07 13:46:24,357 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 13:46:24,357 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 13:46:24,358 INFO L193 IcfgInterpreter]: Reachable states at location L28-1 satisfy 168#(and (<= 0 main_~nc_A~0) (<= 5 main_~i~0)) [2019-10-07 13:46:24,358 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 273#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 13:46:24,358 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 13:46:24,358 INFO L193 IcfgInterpreter]: Reachable states at location L32-4 satisfy 224#(and (<= 0 main_~nc_A~0) (<= 0 main_~nc_B~0) (<= 5 main_~i~0)) [2019-10-07 13:46:24,359 INFO L193 IcfgInterpreter]: Reachable states at location L41-2 satisfy 229#(and (<= 0 main_~j~0) (<= 0 main_~nc_A~0) (= main_~i~0 main_~j~0) (<= 0 main_~i~0) (<= 0 main_~nc_B~0) (<= main_~nc_A~0 main_~nc_B~0) (= main_~j~0 0) (<= main_~i~0 0) (<= main_~j~0 0)) [2019-10-07 13:46:24,359 INFO L193 IcfgInterpreter]: Reachable states at location L6 satisfy 259#false [2019-10-07 13:46:24,359 INFO L193 IcfgInterpreter]: Reachable states at location L32-3 satisfy 240#(and (or (= main_~nc_B~0 0) (and (<= 0 main_~nc_A~0) (<= 5 main_~i~0) (<= 1 main_~nc_B~0))) (or (and (<= 0 main_~nc_A~0) (<= 5 main_~i~0) (<= 1 main_~nc_B~0)) (and (<= 0 main_~nc_A~0) (<= 0 main_~nc_B~0) (<= 5 main_~i~0) (<= main_~nc_B~0 0)))) [2019-10-07 13:46:24,359 INFO L193 IcfgInterpreter]: Reachable states at location L5 satisfy 254#(and (= |__VERIFIER_assert_#in~cond| 1) (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 13:46:24,360 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 264#false [2019-10-07 13:46:24,360 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 249#(and (= |__VERIFIER_assert_#in~cond| 1) (<= 1 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1)) [2019-10-07 13:46:24,360 INFO L193 IcfgInterpreter]: Reachable states at location L23-3 satisfy 117#(<= 0 main_~i~0) [2019-10-07 13:46:24,360 INFO L193 IcfgInterpreter]: Reachable states at location L32-1 satisfy 219#(and (<= 0 main_~nc_A~0) (<= 0 main_~nc_B~0) (<= 5 main_~i~0)) [2019-10-07 13:46:24,361 INFO L193 IcfgInterpreter]: Reachable states at location L21 satisfy 73#(and (= (select (select |#memory_int| |main_~#string_A~0.base|) (+ |main_~#string_A~0.offset| 4)) |main_#t~mem3|) (<= 5 main_~i~0) (not (< main_~i~0 5))) [2019-10-07 13:46:24,820 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 3 imperfect interpolant sequences. [2019-10-07 13:46:24,821 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [4, 4, 4] total 21 [2019-10-07 13:46:24,821 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-10-07 13:46:24,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-10-07 13:46:24,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=346, Unknown=0, NotChecked=0, Total=420 [2019-10-07 13:46:24,822 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand 16 states. [2019-10-07 13:46:25,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:46:25,322 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2019-10-07 13:46:25,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-07 13:46:25,325 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 26 [2019-10-07 13:46:25,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:46:25,325 INFO L225 Difference]: With dead ends: 35 [2019-10-07 13:46:25,326 INFO L226 Difference]: Without dead ends: 30 [2019-10-07 13:46:25,327 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 60 SyntacticMatches, 3 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 269 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=154, Invalid=776, Unknown=0, NotChecked=0, Total=930 [2019-10-07 13:46:25,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-10-07 13:46:25,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28. [2019-10-07 13:46:25,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-10-07 13:46:25,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2019-10-07 13:46:25,333 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 26 [2019-10-07 13:46:25,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:46:25,333 INFO L462 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2019-10-07 13:46:25,334 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-10-07 13:46:25,334 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2019-10-07 13:46:25,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-10-07 13:46:25,334 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:46:25,335 INFO L385 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:46:25,538 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 13:46:25,538 INFO L410 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:46:25,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:46:25,539 INFO L82 PathProgramCache]: Analyzing trace with hash 301099668, now seen corresponding path program 1 times [2019-10-07 13:46:25,539 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:46:25,539 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:46:25,539 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:46:25,539 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:46:25,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:46:25,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:46:25,595 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-07 13:46:25,596 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:46:25,596 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 13:46:25,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 13:46:25,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:46:25,683 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-07 13:46:25,685 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 13:46:25,693 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-07 13:46:25,694 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 13:46:25,725 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-07 13:46:25,725 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 13:46:25,727 INFO L162 IcfgInterpreter]: Started Sifa with 21 locations of interest [2019-10-07 13:46:25,727 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 13:46:25,728 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 13:46:25,728 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 13:46:25,728 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 13:46:25,746 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-07 13:46:26,005 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 3 for LOIs [2019-10-07 13:46:26,010 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-07 13:46:26,012 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 13:46:26,013 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 13:46:26,013 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 312#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-07 13:46:26,013 INFO L193 IcfgInterpreter]: Reachable states at location L55 satisfy 278#(and (or (and (= (ite (< main_~nc_B~0 (+ main_~j~0 1)) 1 0) main_~found~0) (not (< main_~j~0 main_~nc_B~0))) (and (= (ite (< main_~nc_B~0 (+ main_~j~0 1)) 1 0) main_~found~0) (not (< main_~i~0 main_~nc_A~0)))) (<= 0 main_~found~0) (<= main_~found~0 1)) [2019-10-07 13:46:26,013 INFO L193 IcfgInterpreter]: Reachable states at location L28-4 satisfy 173#(and (<= 0 main_~nc_A~0) (<= 5 main_~i~0)) [2019-10-07 13:46:26,014 INFO L193 IcfgInterpreter]: Reachable states at location L25 satisfy 122#(and (= (select (select |#memory_int| |main_~#string_B~0.base|) (+ |main_~#string_B~0.offset| 4)) |main_#t~mem6|) (<= 0 main_~i~0) (<= 5 main_~i~0) (not (< main_~i~0 5))) [2019-10-07 13:46:26,014 INFO L193 IcfgInterpreter]: Reachable states at location L28-3 satisfy 289#(or (and (<= 5 main_~i~0) (<= 1 main_~nc_A~0)) (and (<= 0 main_~nc_A~0) (<= 0 main_~i~0) (<= 5 main_~i~0) (= (select (select |#memory_int| |main_~#string_B~0.base|) (+ |main_~#string_B~0.offset| 4)) 0) (not (< main_~i~0 5)) (<= main_~nc_A~0 0) (= main_~nc_A~0 0))) [2019-10-07 13:46:26,014 INFO L193 IcfgInterpreter]: Reachable states at location L19-3 satisfy 68#true [2019-10-07 13:46:26,014 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 13:46:26,014 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= 0 (select |old(#valid)| 0))) [2019-10-07 13:46:26,014 INFO L193 IcfgInterpreter]: Reachable states at location L28-1 satisfy 168#(and (<= 0 main_~nc_A~0) (<= 5 main_~i~0)) [2019-10-07 13:46:26,015 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 317#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 13:46:26,015 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 13:46:26,015 INFO L193 IcfgInterpreter]: Reachable states at location L32-4 satisfy 224#(and (<= 0 main_~nc_A~0) (<= 0 main_~nc_B~0) (<= 5 main_~i~0)) [2019-10-07 13:46:26,015 INFO L193 IcfgInterpreter]: Reachable states at location L41-2 satisfy 273#true [2019-10-07 13:46:26,015 INFO L193 IcfgInterpreter]: Reachable states at location L6 satisfy 303#false [2019-10-07 13:46:26,016 INFO L193 IcfgInterpreter]: Reachable states at location L32-3 satisfy 284#(and (or (= main_~nc_B~0 0) (and (<= 0 main_~nc_A~0) (<= 5 main_~i~0) (<= 1 main_~nc_B~0))) (or (and (<= 0 main_~nc_A~0) (<= 5 main_~i~0) (<= 1 main_~nc_B~0)) (and (<= 0 main_~nc_A~0) (<= 0 main_~nc_B~0) (<= 5 main_~i~0) (<= main_~nc_B~0 0)))) [2019-10-07 13:46:26,016 INFO L193 IcfgInterpreter]: Reachable states at location L5 satisfy 298#(and (= |__VERIFIER_assert_#in~cond| 1) (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 13:46:26,016 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 308#false [2019-10-07 13:46:26,016 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 293#(and (= |__VERIFIER_assert_#in~cond| 1) (<= 1 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1)) [2019-10-07 13:46:26,016 INFO L193 IcfgInterpreter]: Reachable states at location L23-3 satisfy 117#(<= 0 main_~i~0) [2019-10-07 13:46:26,017 INFO L193 IcfgInterpreter]: Reachable states at location L32-1 satisfy 219#(and (<= 0 main_~nc_A~0) (<= 0 main_~nc_B~0) (<= 5 main_~i~0)) [2019-10-07 13:46:26,017 INFO L193 IcfgInterpreter]: Reachable states at location L21 satisfy 73#(and (= (select (select |#memory_int| |main_~#string_A~0.base|) (+ |main_~#string_A~0.offset| 4)) |main_#t~mem3|) (<= 5 main_~i~0) (not (< main_~i~0 5))) [2019-10-07 13:46:26,426 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 3 imperfect interpolant sequences. [2019-10-07 13:46:26,426 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [4, 4, 4] total 20 [2019-10-07 13:46:26,427 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-07 13:46:26,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-07 13:46:26,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=321, Unknown=0, NotChecked=0, Total=380 [2019-10-07 13:46:26,428 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand 15 states. [2019-10-07 13:46:26,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:46:26,920 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2019-10-07 13:46:26,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-07 13:46:26,921 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 27 [2019-10-07 13:46:26,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:46:26,922 INFO L225 Difference]: With dead ends: 28 [2019-10-07 13:46:26,922 INFO L226 Difference]: Without dead ends: 0 [2019-10-07 13:46:26,923 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 64 SyntacticMatches, 3 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=119, Invalid=693, Unknown=0, NotChecked=0, Total=812 [2019-10-07 13:46:26,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-07 13:46:26,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-07 13:46:26,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-07 13:46:26,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-07 13:46:26,924 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 27 [2019-10-07 13:46:26,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:46:26,924 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-07 13:46:26,924 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-07 13:46:26,924 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-07 13:46:26,924 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-07 13:46:27,129 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 13:46:27,135 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-07 13:46:27,606 INFO L439 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |old(#NULL.base)| |#NULL.base|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-07 13:46:27,606 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-10-07 13:46:27,606 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-07 13:46:27,606 INFO L439 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (<= |#NULL.offset| 0) (<= 0 |#NULL.offset|)) [2019-10-07 13:46:27,606 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-10-07 13:46:27,607 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-07 13:46:27,607 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 14 58) no Hoare annotation was computed. [2019-10-07 13:46:27,607 INFO L439 ceAbstractionStarter]: At program point L23-3(lines 23 24) the Hoare annotation is: (or (not (<= |#NULL.offset| 0)) (and (<= 0 main_~i~0) (= 0 (select |#valid| 0))) (not (<= 0 |#NULL.base|)) (not (= 0 (select |old(#valid)| 0))) (not (<= 0 |#NULL.offset|)) (not (<= |#NULL.base| 0))) [2019-10-07 13:46:27,607 INFO L439 ceAbstractionStarter]: At program point L19-3(lines 19 20) the Hoare annotation is: (or (not (<= |#NULL.offset| 0)) (and (<= 0 main_~i~0) (= 0 (select |#valid| 0))) (not (<= 0 |#NULL.base|)) (not (= 0 (select |old(#valid)| 0))) (not (<= 0 |#NULL.offset|)) (not (<= |#NULL.base| 0))) [2019-10-07 13:46:27,607 INFO L443 ceAbstractionStarter]: For program point L32-1(lines 32 33) no Hoare annotation was computed. [2019-10-07 13:46:27,607 INFO L439 ceAbstractionStarter]: At program point L32-3(lines 32 33) the Hoare annotation is: (or (not (<= |#NULL.offset| 0)) (not (<= 0 |#NULL.base|)) (not (= 0 (select |old(#valid)| 0))) (not (<= 0 |#NULL.offset|)) (not (<= |#NULL.base| 0)) (and (let ((.cse0 (<= 5 main_~i~0))) (or (and .cse0 (<= 1 main_~nc_A~0)) (and .cse0 (= (select (select |#memory_int| |main_~#string_B~0.base|) (+ |main_~#string_B~0.offset| 4)) 0) (= main_~nc_A~0 0)))) (= 0 (select |#valid| 0)) (or (= main_~nc_B~0 0) (<= 1 main_~nc_B~0)))) [2019-10-07 13:46:27,607 INFO L443 ceAbstractionStarter]: For program point L32-4(lines 15 58) no Hoare annotation was computed. [2019-10-07 13:46:27,607 INFO L443 ceAbstractionStarter]: For program point L28-1(lines 28 29) no Hoare annotation was computed. [2019-10-07 13:46:27,607 INFO L439 ceAbstractionStarter]: At program point L28-3(lines 28 29) the Hoare annotation is: (or (not (<= |#NULL.offset| 0)) (not (<= 0 |#NULL.base|)) (not (= 0 (select |old(#valid)| 0))) (not (<= 0 |#NULL.offset|)) (not (<= |#NULL.base| 0)) (and (let ((.cse0 (<= 5 main_~i~0))) (or (and .cse0 (<= 1 main_~nc_A~0)) (and .cse0 (= (select (select |#memory_int| |main_~#string_B~0.base|) (+ |main_~#string_B~0.offset| 4)) 0) (= main_~nc_A~0 0)))) (= 0 (select |#valid| 0)))) [2019-10-07 13:46:27,608 INFO L443 ceAbstractionStarter]: For program point L28-4(lines 28 29) no Hoare annotation was computed. [2019-10-07 13:46:27,608 INFO L439 ceAbstractionStarter]: At program point L41-2(lines 39 51) the Hoare annotation is: (or (not (<= |#NULL.offset| 0)) (= 0 (select |#valid| 0)) (not (<= 0 |#NULL.base|)) (not (= 0 (select |old(#valid)| 0))) (not (<= 0 |#NULL.offset|)) (not (<= |#NULL.base| 0))) [2019-10-07 13:46:27,608 INFO L443 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2019-10-07 13:46:27,608 INFO L443 ceAbstractionStarter]: For program point L21(line 21) no Hoare annotation was computed. [2019-10-07 13:46:27,608 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 14 58) no Hoare annotation was computed. [2019-10-07 13:46:27,608 INFO L439 ceAbstractionStarter]: At program point mainENTRY(lines 14 58) the Hoare annotation is: (or (not (<= |#NULL.offset| 0)) (not (<= 0 |#NULL.base|)) (and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|)) (not (= 0 (select |old(#valid)| 0))) (not (<= 0 |#NULL.offset|)) (not (<= |#NULL.base| 0))) [2019-10-07 13:46:27,608 INFO L439 ceAbstractionStarter]: At program point L55(line 55) the Hoare annotation is: (or (not (<= |#NULL.offset| 0)) (not (<= 0 |#NULL.base|)) (not (= 0 (select |old(#valid)| 0))) (not (<= 0 |#NULL.offset|)) (not (<= |#NULL.base| 0)) (and (= 0 (select |#valid| 0)) (let ((.cse0 (= (ite (< main_~nc_B~0 (+ main_~j~0 1)) 1 0) main_~found~0))) (or (and (<= main_~nc_B~0 main_~j~0) .cse0) (and .cse0 (<= main_~nc_A~0 main_~i~0)))))) [2019-10-07 13:46:27,608 INFO L443 ceAbstractionStarter]: For program point L55-1(line 55) no Hoare annotation was computed. [2019-10-07 13:46:27,608 INFO L443 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 6) no Hoare annotation was computed. [2019-10-07 13:46:27,609 INFO L446 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 4 9) the Hoare annotation is: true [2019-10-07 13:46:27,609 INFO L443 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 4 9) no Hoare annotation was computed. [2019-10-07 13:46:27,609 INFO L443 ceAbstractionStarter]: For program point L6(line 6) no Hoare annotation was computed. [2019-10-07 13:46:27,609 INFO L443 ceAbstractionStarter]: For program point L5(lines 5 7) no Hoare annotation was computed. [2019-10-07 13:46:27,609 INFO L443 ceAbstractionStarter]: For program point L5-2(lines 4 9) no Hoare annotation was computed. [2019-10-07 13:46:27,616 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:46:27,617 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:46:27,617 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:46:27,617 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:46:27,621 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:46:27,622 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:46:27,622 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:46:27,622 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:46:27,624 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:46:27,624 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:46:27,624 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:46:27,625 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:46:27,625 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 13:46:27,626 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:46:27,626 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:46:27,626 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:46:27,627 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:46:27,627 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 13:46:27,628 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:46:27,628 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:46:27,628 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:46:27,628 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:46:27,629 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 13:46:27,629 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:46:27,630 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:46:27,630 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:46:27,630 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:46:27,630 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 13:46:27,631 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:46:27,632 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:46:27,632 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:46:27,632 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:46:27,633 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:46:27,633 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:46:27,633 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:46:27,633 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:46:27,634 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:46:27,634 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:46:27,634 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:46:27,635 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:46:27,635 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:46:27,635 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:46:27,636 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:46:27,636 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:46:27,638 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.10 01:46:27 BoogieIcfgContainer [2019-10-07 13:46:27,639 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-07 13:46:27,640 INFO L168 Benchmark]: Toolchain (without parser) took 12044.41 ms. Allocated memory was 139.5 MB in the beginning and 317.2 MB in the end (delta: 177.7 MB). Free memory was 102.8 MB in the beginning and 190.3 MB in the end (delta: -87.5 MB). Peak memory consumption was 90.3 MB. Max. memory is 7.1 GB. [2019-10-07 13:46:27,641 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 139.5 MB. Free memory was 121.5 MB in the beginning and 121.2 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-10-07 13:46:27,641 INFO L168 Benchmark]: CACSL2BoogieTranslator took 378.55 ms. Allocated memory was 139.5 MB in the beginning and 202.9 MB in the end (delta: 63.4 MB). Free memory was 102.4 MB in the beginning and 181.6 MB in the end (delta: -79.2 MB). Peak memory consumption was 23.3 MB. Max. memory is 7.1 GB. [2019-10-07 13:46:27,642 INFO L168 Benchmark]: Boogie Preprocessor took 40.80 ms. Allocated memory is still 202.9 MB. Free memory was 181.6 MB in the beginning and 179.3 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.3 MB. Max. memory is 7.1 GB. [2019-10-07 13:46:27,642 INFO L168 Benchmark]: RCFGBuilder took 504.28 ms. Allocated memory is still 202.9 MB. Free memory was 179.3 MB in the beginning and 156.1 MB in the end (delta: 23.3 MB). Peak memory consumption was 23.3 MB. Max. memory is 7.1 GB. [2019-10-07 13:46:27,642 INFO L168 Benchmark]: TraceAbstraction took 11115.59 ms. Allocated memory was 202.9 MB in the beginning and 317.2 MB in the end (delta: 114.3 MB). Free memory was 155.4 MB in the beginning and 190.3 MB in the end (delta: -34.9 MB). Peak memory consumption was 79.4 MB. Max. memory is 7.1 GB. [2019-10-07 13:46:27,644 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 139.5 MB. Free memory was 121.5 MB in the beginning and 121.2 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 378.55 ms. Allocated memory was 139.5 MB in the beginning and 202.9 MB in the end (delta: 63.4 MB). Free memory was 102.4 MB in the beginning and 181.6 MB in the end (delta: -79.2 MB). Peak memory consumption was 23.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 40.80 ms. Allocated memory is still 202.9 MB. Free memory was 181.6 MB in the beginning and 179.3 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 504.28 ms. Allocated memory is still 202.9 MB. Free memory was 179.3 MB in the beginning and 156.1 MB in the end (delta: 23.3 MB). Peak memory consumption was 23.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 11115.59 ms. Allocated memory was 202.9 MB in the beginning and 317.2 MB in the end (delta: 114.3 MB). Free memory was 155.4 MB in the beginning and 190.3 MB in the end (delta: -34.9 MB). Peak memory consumption was 79.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 6]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 39]: Loop Invariant [2019-10-07 13:46:27,652 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:46:27,652 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:46:27,653 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:46:27,653 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:46:27,653 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:46:27,653 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:46:27,654 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:46:27,654 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL Derived loop invariant: ((((!(#NULL <= 0) || 0 == \valid[0]) || !(0 <= #NULL)) || !(0 == \old(\valid)[0])) || !(0 <= #NULL)) || !(#NULL <= 0) - InvariantResult [Line: 32]: Loop Invariant [2019-10-07 13:46:27,655 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:46:27,655 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:46:27,655 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:46:27,655 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:46:27,656 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 13:46:27,656 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:46:27,656 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:46:27,657 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:46:27,657 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:46:27,657 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int Derived loop invariant: ((((!(#NULL <= 0) || !(0 <= #NULL)) || !(0 == \old(\valid)[0])) || !(0 <= #NULL)) || !(#NULL <= 0)) || ((((5 <= i && 1 <= nc_A) || ((5 <= i && unknown-#memory_int-unknown[string_B][string_B + 4] == 0) && nc_A == 0)) && 0 == \valid[0]) && (nc_B == 0 || 1 <= nc_B)) - InvariantResult [Line: 28]: Loop Invariant [2019-10-07 13:46:27,658 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:46:27,658 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:46:27,658 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:46:27,658 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:46:27,658 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 13:46:27,659 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:46:27,659 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:46:27,659 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:46:27,659 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:46:27,660 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int Derived loop invariant: ((((!(#NULL <= 0) || !(0 <= #NULL)) || !(0 == \old(\valid)[0])) || !(0 <= #NULL)) || !(#NULL <= 0)) || (((5 <= i && 1 <= nc_A) || ((5 <= i && unknown-#memory_int-unknown[string_B][string_B + 4] == 0) && nc_A == 0)) && 0 == \valid[0]) - InvariantResult [Line: 23]: Loop Invariant [2019-10-07 13:46:27,660 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:46:27,660 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:46:27,661 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:46:27,661 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:46:27,661 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:46:27,661 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:46:27,662 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:46:27,662 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL Derived loop invariant: ((((!(#NULL <= 0) || (0 <= i && 0 == \valid[0])) || !(0 <= #NULL)) || !(0 == \old(\valid)[0])) || !(0 <= #NULL)) || !(#NULL <= 0) - InvariantResult [Line: 19]: Loop Invariant [2019-10-07 13:46:27,662 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:46:27,663 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:46:27,663 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:46:27,663 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:46:27,663 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:46:27,663 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:46:27,664 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:46:27,664 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL Derived loop invariant: ((((!(#NULL <= 0) || (0 <= i && 0 == \valid[0])) || !(0 <= #NULL)) || !(0 == \old(\valid)[0])) || !(0 <= #NULL)) || !(#NULL <= 0) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 28 locations, 1 error locations. Result: SAFE, OverallTime: 11.0s, OverallIterations: 7, TraceHistogramMax: 2, AutomataDifference: 3.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.4s, HoareTripleCheckerStatistics: 96 SDtfs, 225 SDslu, 174 SDs, 0 SdLazy, 814 SolverSat, 171 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 451 GetRequests, 282 SyntacticMatches, 10 SemanticMatches, 159 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1486 ImplicationChecksByTransitivity, 4.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=28occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 13 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 11 LocationsWithAnnotation, 20 PreInvPairs, 39 NumberOfFragments, 326 HoareAnnotationTreeSize, 20 FomulaSimplifications, 2621 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 11 FomulaSimplificationsInter, 657 FormulaSimplificationTreeSizeReductionInter, 0.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 284 NumberOfCodeBlocks, 284 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 390 ConstructedInterpolants, 0 QuantifiedInterpolants, 10504 SizeOfPredicates, 5 NumberOfNonLiveVariables, 518 ConjunctsInSsa, 15 ConjunctsInUnsatCore, 17 InterpolantComputations, 2 PerfectInterpolantSequences, 54/69 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: OVERALL_TIME[ms]: 2224, ICFG_INTERPRETER_ENTERED_PROCEDURES: 20, DAG_INTERPRETER_EARLY_EXIT_QUERIES: 228, DAG_INTERPRETER_EARLY_EXITS: 0, TOOLS_POST_APPLICATIONS: 161, TOOLS_POST_TIME[ms]: 797, TOOLS_POST_CALL_APPLICATIONS: 25, TOOLS_POST_CALL_TIME[ms]: 44, TOOLS_POST_RETURN_APPLICATIONS: 10, TOOLS_POST_RETURN_TIME[ms]: 8, TOOLS_QUANTIFIERELIM_APPLICATIONS: 196, TOOLS_QUANTIFIERELIM_TIME[ms]: 800, TOOLS_QUANTIFIERELIM_MAX_TIME[ms]: 78, FLUID_QUERY_TIME[ms]: 12, FLUID_QUERIES: 280, FLUID_YES_ANSWERS: 0, DOMAIN_JOIN_APPLICATIONS: 195, DOMAIN_JOIN_TIME[ms]: 812, DOMAIN_ALPHA_APPLICATIONS: 0, DOMAIN_ALPHA_TIME[ms]: 0, DOMAIN_WIDEN_APPLICATIONS: 35, DOMAIN_WIDEN_TIME[ms]: 225, DOMAIN_ISSUBSETEQ_APPLICATIONS: 52, DOMAIN_ISSUBSETEQ_TIME[ms]: 109, DOMAIN_ISBOTTOM_APPLICATIONS: 11, DOMAIN_ISBOTTOM_TIME[ms]: 12, LOOP_SUMMARIZER_APPLICATIONS: 17, LOOP_SUMMARIZER_CACHE_MISSES: 17, LOOP_SUMMARIZER_OVERALL_TIME[ms]: 1248, LOOP_SUMMARIZER_NEW_COMPUTATION_TIME[ms]: 1247, LOOP_SUMMARIZER_FIXPOINT_ITERATIONS: 52, CALL_SUMMARIZER_APPLICATIONS: 10, CALL_SUMMARIZER_CACHE_MISSES: 5, CALL_SUMMARIZER_OVERALL_TIME[ms]: 104, CALL_SUMMARIZER_NEW_COMPUTATION_TIME[ms]: 104, PROCEDURE_GRAPH_BUILDER_TIME[ms]: 7, PATH_EXPR_TIME[ms]: 7, REGEX_TO_DAG_TIME[ms]: 6, DAG_COMPRESSION_TIME[ms]: 47, DAG_COMPRESSION_PROCESSED_NODES: 1026, DAG_COMPRESSION_RETAINED_NODES: 341, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...