java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline_WitnessPrinter.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loops/string_true-unreach-call_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 13:04:25,651 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 13:04:25,653 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 13:04:25,664 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 13:04:25,665 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 13:04:25,666 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 13:04:25,667 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 13:04:25,669 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 13:04:25,671 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 13:04:25,672 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 13:04:25,673 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 13:04:25,673 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 13:04:25,674 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 13:04:25,675 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 13:04:25,676 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 13:04:25,677 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 13:04:25,678 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 13:04:25,682 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 13:04:25,687 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 13:04:25,689 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 13:04:25,690 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 13:04:25,691 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 13:04:25,694 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 13:04:25,694 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 13:04:25,695 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 13:04:25,696 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 13:04:25,697 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 13:04:25,697 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 13:04:25,698 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 13:04:25,705 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 13:04:25,705 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 13:04:25,706 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 13:04:25,706 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 13:04:25,706 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 13:04:25,707 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 13:04:25,708 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 13:04:25,708 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-23 13:04:25,732 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 13:04:25,732 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 13:04:25,733 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 13:04:25,733 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 13:04:25,733 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 13:04:25,734 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 13:04:25,734 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 13:04:25,734 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 13:04:25,734 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 13:04:25,735 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 13:04:25,735 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 13:04:25,735 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 13:04:25,735 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 13:04:25,735 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 13:04:25,735 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 13:04:25,736 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 13:04:25,736 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 13:04:25,736 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 13:04:25,736 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 13:04:25,736 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 13:04:25,737 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 13:04:25,737 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 13:04:25,737 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 13:04:25,737 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 13:04:25,737 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 13:04:25,738 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 13:04:25,738 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 13:04:25,738 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 13:04:25,738 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 13:04:25,738 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 13:04:25,739 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 13:04:25,783 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 13:04:25,800 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 13:04:25,805 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 13:04:25,806 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 13:04:25,807 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 13:04:25,807 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/string_true-unreach-call_true-termination.i [2018-11-23 13:04:25,872 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/da137a9f5/9b875067a7084e0bb534f61787025291/FLAGa21561f22 [2018-11-23 13:04:26,393 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 13:04:26,393 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/string_true-unreach-call_true-termination.i [2018-11-23 13:04:26,401 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/da137a9f5/9b875067a7084e0bb534f61787025291/FLAGa21561f22 [2018-11-23 13:04:26,741 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/da137a9f5/9b875067a7084e0bb534f61787025291 [2018-11-23 13:04:26,751 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 13:04:26,752 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 13:04:26,753 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 13:04:26,754 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 13:04:26,758 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 13:04:26,759 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:04:26" (1/1) ... [2018-11-23 13:04:26,762 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5623b179 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:04:26, skipping insertion in model container [2018-11-23 13:04:26,763 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:04:26" (1/1) ... [2018-11-23 13:04:26,773 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 13:04:26,800 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 13:04:27,031 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:04:27,036 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 13:04:27,073 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:04:27,105 INFO L195 MainTranslator]: Completed translation [2018-11-23 13:04:27,106 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:04:27 WrapperNode [2018-11-23 13:04:27,106 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 13:04:27,107 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 13:04:27,107 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 13:04:27,107 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 13:04:27,118 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:04:27" (1/1) ... [2018-11-23 13:04:27,129 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:04:27" (1/1) ... [2018-11-23 13:04:27,137 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 13:04:27,138 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 13:04:27,138 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 13:04:27,138 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 13:04:27,152 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:04:27" (1/1) ... [2018-11-23 13:04:27,152 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:04:27" (1/1) ... [2018-11-23 13:04:27,155 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:04:27" (1/1) ... [2018-11-23 13:04:27,155 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:04:27" (1/1) ... [2018-11-23 13:04:27,170 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:04:27" (1/1) ... [2018-11-23 13:04:27,185 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:04:27" (1/1) ... [2018-11-23 13:04:27,187 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:04:27" (1/1) ... [2018-11-23 13:04:27,192 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 13:04:27,193 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 13:04:27,193 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 13:04:27,194 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 13:04:27,198 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:04:27" (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 [2018-11-23 13:04:27,338 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 13:04:27,338 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 13:04:27,338 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 13:04:27,339 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 13:04:27,339 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 13:04:27,339 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 13:04:27,339 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 13:04:27,339 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 13:04:27,339 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 13:04:27,341 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 13:04:27,341 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 13:04:27,341 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 13:04:28,236 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 13:04:28,236 INFO L280 CfgBuilder]: Removed 5 assue(true) statements. [2018-11-23 13:04:28,237 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:04:28 BoogieIcfgContainer [2018-11-23 13:04:28,237 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 13:04:28,238 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 13:04:28,238 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 13:04:28,242 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 13:04:28,242 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 01:04:26" (1/3) ... [2018-11-23 13:04:28,243 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c7d6519 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:04:28, skipping insertion in model container [2018-11-23 13:04:28,243 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:04:27" (2/3) ... [2018-11-23 13:04:28,244 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c7d6519 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:04:28, skipping insertion in model container [2018-11-23 13:04:28,244 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:04:28" (3/3) ... [2018-11-23 13:04:28,246 INFO L112 eAbstractionObserver]: Analyzing ICFG string_true-unreach-call_true-termination.i [2018-11-23 13:04:28,256 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 13:04:28,266 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 13:04:28,285 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 13:04:28,316 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 13:04:28,317 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 13:04:28,317 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 13:04:28,318 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 13:04:28,318 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 13:04:28,318 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 13:04:28,318 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 13:04:28,318 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 13:04:28,319 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 13:04:28,338 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states. [2018-11-23 13:04:28,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 13:04:28,346 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:04:28,347 INFO L402 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] [2018-11-23 13:04:28,349 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:04:28,354 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:04:28,355 INFO L82 PathProgramCache]: Analyzing trace with hash -99599224, now seen corresponding path program 1 times [2018-11-23 13:04:28,356 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:04:28,357 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:04:28,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:04:28,405 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:04:28,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:04:28,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:04:28,516 INFO L256 TraceCheckUtils]: 0: Hoare triple {38#true} call ULTIMATE.init(); {38#true} is VALID [2018-11-23 13:04:28,520 INFO L273 TraceCheckUtils]: 1: Hoare triple {38#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {38#true} is VALID [2018-11-23 13:04:28,522 INFO L273 TraceCheckUtils]: 2: Hoare triple {38#true} assume true; {38#true} is VALID [2018-11-23 13:04:28,523 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {38#true} {38#true} #107#return; {38#true} is VALID [2018-11-23 13:04:28,523 INFO L256 TraceCheckUtils]: 4: Hoare triple {38#true} call #t~ret15 := main(); {38#true} is VALID [2018-11-23 13:04:28,523 INFO L273 TraceCheckUtils]: 5: Hoare triple {38#true} call ~#string_A~0.base, ~#string_A~0.offset := #Ultimate.alloc(5);call ~#string_B~0.base, ~#string_B~0.offset := #Ultimate.alloc(5);havoc ~i~0;havoc ~j~0;havoc ~nc_A~0;havoc ~nc_B~0;~found~0 := 0;~i~0 := 0; {38#true} is VALID [2018-11-23 13:04:28,524 INFO L273 TraceCheckUtils]: 6: Hoare triple {38#true} assume !true; {39#false} is VALID [2018-11-23 13:04:28,525 INFO L273 TraceCheckUtils]: 7: Hoare triple {39#false} call #t~mem3 := read~int(~#string_A~0.base, 4 + ~#string_A~0.offset, 1); {39#false} is VALID [2018-11-23 13:04:28,525 INFO L273 TraceCheckUtils]: 8: Hoare triple {39#false} assume !!(0 == #t~mem3);havoc #t~mem3;~i~0 := 0; {39#false} is VALID [2018-11-23 13:04:28,525 INFO L273 TraceCheckUtils]: 9: Hoare triple {39#false} assume !true; {39#false} is VALID [2018-11-23 13:04:28,526 INFO L273 TraceCheckUtils]: 10: Hoare triple {39#false} call #t~mem6 := read~int(~#string_B~0.base, 4 + ~#string_B~0.offset, 1); {39#false} is VALID [2018-11-23 13:04:28,526 INFO L273 TraceCheckUtils]: 11: Hoare triple {39#false} assume !!(0 == #t~mem6);havoc #t~mem6;~nc_A~0 := 0; {39#false} is VALID [2018-11-23 13:04:28,526 INFO L273 TraceCheckUtils]: 12: Hoare triple {39#false} assume !true; {39#false} is VALID [2018-11-23 13:04:28,527 INFO L273 TraceCheckUtils]: 13: Hoare triple {39#false} ~nc_B~0 := 0; {39#false} is VALID [2018-11-23 13:04:28,527 INFO L273 TraceCheckUtils]: 14: Hoare triple {39#false} assume !true; {39#false} is VALID [2018-11-23 13:04:28,527 INFO L273 TraceCheckUtils]: 15: Hoare triple {39#false} assume !!(~nc_B~0 >= ~nc_A~0);~j~0 := 0;~i~0 := ~j~0; {39#false} is VALID [2018-11-23 13:04:28,528 INFO L273 TraceCheckUtils]: 16: Hoare triple {39#false} assume !true; {39#false} is VALID [2018-11-23 13:04:28,528 INFO L273 TraceCheckUtils]: 17: Hoare triple {39#false} ~found~0 := (if ~j~0 > ~nc_B~0 - 1 then 1 else 0); {39#false} is VALID [2018-11-23 13:04:28,528 INFO L256 TraceCheckUtils]: 18: Hoare triple {39#false} call __VERIFIER_assert((if 0 == ~found~0 || 1 == ~found~0 then 1 else 0)); {39#false} is VALID [2018-11-23 13:04:28,529 INFO L273 TraceCheckUtils]: 19: Hoare triple {39#false} ~cond := #in~cond; {39#false} is VALID [2018-11-23 13:04:28,529 INFO L273 TraceCheckUtils]: 20: Hoare triple {39#false} assume 0 == ~cond; {39#false} is VALID [2018-11-23 13:04:28,529 INFO L273 TraceCheckUtils]: 21: Hoare triple {39#false} assume !false; {39#false} is VALID [2018-11-23 13:04:28,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:04:28,536 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:04:28,537 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 13:04:28,542 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 22 [2018-11-23 13:04:28,545 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:04:28,549 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 13:04:28,737 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:04:28,738 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 13:04:28,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 13:04:28,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 13:04:28,751 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 2 states. [2018-11-23 13:04:28,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:04:28,904 INFO L93 Difference]: Finished difference Result 62 states and 89 transitions. [2018-11-23 13:04:28,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 13:04:28,904 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 22 [2018-11-23 13:04:28,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:04:28,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 13:04:28,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 89 transitions. [2018-11-23 13:04:28,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 13:04:28,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 89 transitions. [2018-11-23 13:04:28,922 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 89 transitions. [2018-11-23 13:04:29,178 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 89 edges. 89 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:04:29,190 INFO L225 Difference]: With dead ends: 62 [2018-11-23 13:04:29,190 INFO L226 Difference]: Without dead ends: 28 [2018-11-23 13:04:29,194 INFO L631 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 [2018-11-23 13:04:29,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-11-23 13:04:29,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-11-23 13:04:29,254 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:04:29,254 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand 28 states. [2018-11-23 13:04:29,255 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 28 states. [2018-11-23 13:04:29,255 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 28 states. [2018-11-23 13:04:29,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:04:29,260 INFO L93 Difference]: Finished difference Result 28 states and 33 transitions. [2018-11-23 13:04:29,260 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 33 transitions. [2018-11-23 13:04:29,261 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:04:29,261 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:04:29,261 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 28 states. [2018-11-23 13:04:29,262 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 28 states. [2018-11-23 13:04:29,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:04:29,266 INFO L93 Difference]: Finished difference Result 28 states and 33 transitions. [2018-11-23 13:04:29,266 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 33 transitions. [2018-11-23 13:04:29,267 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:04:29,267 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:04:29,267 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:04:29,268 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:04:29,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-23 13:04:29,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 33 transitions. [2018-11-23 13:04:29,273 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 33 transitions. Word has length 22 [2018-11-23 13:04:29,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:04:29,273 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 33 transitions. [2018-11-23 13:04:29,273 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 13:04:29,273 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 33 transitions. [2018-11-23 13:04:29,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-23 13:04:29,274 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:04:29,275 INFO L402 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, 1, 1] [2018-11-23 13:04:29,275 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:04:29,275 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:04:29,276 INFO L82 PathProgramCache]: Analyzing trace with hash 930552028, now seen corresponding path program 1 times [2018-11-23 13:04:29,276 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:04:29,276 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:04:29,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:04:29,277 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:04:29,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:04:29,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:04:29,349 INFO L256 TraceCheckUtils]: 0: Hoare triple {216#true} call ULTIMATE.init(); {216#true} is VALID [2018-11-23 13:04:29,350 INFO L273 TraceCheckUtils]: 1: Hoare triple {216#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {216#true} is VALID [2018-11-23 13:04:29,350 INFO L273 TraceCheckUtils]: 2: Hoare triple {216#true} assume true; {216#true} is VALID [2018-11-23 13:04:29,350 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {216#true} {216#true} #107#return; {216#true} is VALID [2018-11-23 13:04:29,351 INFO L256 TraceCheckUtils]: 4: Hoare triple {216#true} call #t~ret15 := main(); {216#true} is VALID [2018-11-23 13:04:29,353 INFO L273 TraceCheckUtils]: 5: Hoare triple {216#true} call ~#string_A~0.base, ~#string_A~0.offset := #Ultimate.alloc(5);call ~#string_B~0.base, ~#string_B~0.offset := #Ultimate.alloc(5);havoc ~i~0;havoc ~j~0;havoc ~nc_A~0;havoc ~nc_B~0;~found~0 := 0;~i~0 := 0; {218#(= main_~i~0 0)} is VALID [2018-11-23 13:04:29,353 INFO L273 TraceCheckUtils]: 6: Hoare triple {218#(= main_~i~0 0)} assume !(~i~0 < 5); {217#false} is VALID [2018-11-23 13:04:29,354 INFO L273 TraceCheckUtils]: 7: Hoare triple {217#false} call #t~mem3 := read~int(~#string_A~0.base, 4 + ~#string_A~0.offset, 1); {217#false} is VALID [2018-11-23 13:04:29,354 INFO L273 TraceCheckUtils]: 8: Hoare triple {217#false} assume !!(0 == #t~mem3);havoc #t~mem3;~i~0 := 0; {217#false} is VALID [2018-11-23 13:04:29,354 INFO L273 TraceCheckUtils]: 9: Hoare triple {217#false} assume !(~i~0 < 5); {217#false} is VALID [2018-11-23 13:04:29,355 INFO L273 TraceCheckUtils]: 10: Hoare triple {217#false} call #t~mem6 := read~int(~#string_B~0.base, 4 + ~#string_B~0.offset, 1); {217#false} is VALID [2018-11-23 13:04:29,355 INFO L273 TraceCheckUtils]: 11: Hoare triple {217#false} assume !!(0 == #t~mem6);havoc #t~mem6;~nc_A~0 := 0; {217#false} is VALID [2018-11-23 13:04:29,355 INFO L273 TraceCheckUtils]: 12: Hoare triple {217#false} call #t~mem7 := read~int(~#string_A~0.base, ~#string_A~0.offset + ~nc_A~0, 1); {217#false} is VALID [2018-11-23 13:04:29,355 INFO L273 TraceCheckUtils]: 13: Hoare triple {217#false} assume !(0 != #t~mem7);havoc #t~mem7; {217#false} is VALID [2018-11-23 13:04:29,356 INFO L273 TraceCheckUtils]: 14: Hoare triple {217#false} ~nc_B~0 := 0; {217#false} is VALID [2018-11-23 13:04:29,356 INFO L273 TraceCheckUtils]: 15: Hoare triple {217#false} call #t~mem9 := read~int(~#string_B~0.base, ~#string_B~0.offset + ~nc_B~0, 1); {217#false} is VALID [2018-11-23 13:04:29,356 INFO L273 TraceCheckUtils]: 16: Hoare triple {217#false} assume !(0 != #t~mem9);havoc #t~mem9; {217#false} is VALID [2018-11-23 13:04:29,356 INFO L273 TraceCheckUtils]: 17: Hoare triple {217#false} assume !!(~nc_B~0 >= ~nc_A~0);~j~0 := 0;~i~0 := ~j~0; {217#false} is VALID [2018-11-23 13:04:29,357 INFO L273 TraceCheckUtils]: 18: Hoare triple {217#false} assume !(~i~0 < ~nc_A~0 && ~j~0 < ~nc_B~0); {217#false} is VALID [2018-11-23 13:04:29,357 INFO L273 TraceCheckUtils]: 19: Hoare triple {217#false} ~found~0 := (if ~j~0 > ~nc_B~0 - 1 then 1 else 0); {217#false} is VALID [2018-11-23 13:04:29,357 INFO L256 TraceCheckUtils]: 20: Hoare triple {217#false} call __VERIFIER_assert((if 0 == ~found~0 || 1 == ~found~0 then 1 else 0)); {217#false} is VALID [2018-11-23 13:04:29,357 INFO L273 TraceCheckUtils]: 21: Hoare triple {217#false} ~cond := #in~cond; {217#false} is VALID [2018-11-23 13:04:29,358 INFO L273 TraceCheckUtils]: 22: Hoare triple {217#false} assume 0 == ~cond; {217#false} is VALID [2018-11-23 13:04:29,358 INFO L273 TraceCheckUtils]: 23: Hoare triple {217#false} assume !false; {217#false} is VALID [2018-11-23 13:04:29,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:04:29,361 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:04:29,361 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 13:04:29,362 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-23 13:04:29,363 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:04:29,363 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 13:04:29,622 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:04:29,622 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 13:04:29,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 13:04:29,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 13:04:29,623 INFO L87 Difference]: Start difference. First operand 28 states and 33 transitions. Second operand 3 states. [2018-11-23 13:04:30,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:04:30,018 INFO L93 Difference]: Finished difference Result 56 states and 69 transitions. [2018-11-23 13:04:30,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 13:04:30,018 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-23 13:04:30,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:04:30,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 13:04:30,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 69 transitions. [2018-11-23 13:04:30,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 13:04:30,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 69 transitions. [2018-11-23 13:04:30,025 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 69 transitions. [2018-11-23 13:04:30,214 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:04:30,218 INFO L225 Difference]: With dead ends: 56 [2018-11-23 13:04:30,218 INFO L226 Difference]: Without dead ends: 36 [2018-11-23 13:04:30,219 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 13:04:30,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-11-23 13:04:30,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 30. [2018-11-23 13:04:30,240 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:04:30,240 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand 30 states. [2018-11-23 13:04:30,240 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 30 states. [2018-11-23 13:04:30,240 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 30 states. [2018-11-23 13:04:30,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:04:30,244 INFO L93 Difference]: Finished difference Result 36 states and 43 transitions. [2018-11-23 13:04:30,244 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 43 transitions. [2018-11-23 13:04:30,245 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:04:30,245 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:04:30,245 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 36 states. [2018-11-23 13:04:30,246 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 36 states. [2018-11-23 13:04:30,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:04:30,249 INFO L93 Difference]: Finished difference Result 36 states and 43 transitions. [2018-11-23 13:04:30,249 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 43 transitions. [2018-11-23 13:04:30,250 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:04:30,250 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:04:30,250 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:04:30,250 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:04:30,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-23 13:04:30,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 35 transitions. [2018-11-23 13:04:30,253 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 35 transitions. Word has length 24 [2018-11-23 13:04:30,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:04:30,254 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 35 transitions. [2018-11-23 13:04:30,254 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 13:04:30,254 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2018-11-23 13:04:30,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-23 13:04:30,255 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:04:30,255 INFO L402 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, 1, 1, 1, 1, 1, 1] [2018-11-23 13:04:30,255 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:04:30,256 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:04:30,256 INFO L82 PathProgramCache]: Analyzing trace with hash 1358146588, now seen corresponding path program 1 times [2018-11-23 13:04:30,256 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:04:30,256 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:04:30,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:04:30,257 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:04:30,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:04:30,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:04:30,374 INFO L256 TraceCheckUtils]: 0: Hoare triple {413#true} call ULTIMATE.init(); {413#true} is VALID [2018-11-23 13:04:30,375 INFO L273 TraceCheckUtils]: 1: Hoare triple {413#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {413#true} is VALID [2018-11-23 13:04:30,375 INFO L273 TraceCheckUtils]: 2: Hoare triple {413#true} assume true; {413#true} is VALID [2018-11-23 13:04:30,375 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {413#true} {413#true} #107#return; {413#true} is VALID [2018-11-23 13:04:30,376 INFO L256 TraceCheckUtils]: 4: Hoare triple {413#true} call #t~ret15 := main(); {413#true} is VALID [2018-11-23 13:04:30,379 INFO L273 TraceCheckUtils]: 5: Hoare triple {413#true} call ~#string_A~0.base, ~#string_A~0.offset := #Ultimate.alloc(5);call ~#string_B~0.base, ~#string_B~0.offset := #Ultimate.alloc(5);havoc ~i~0;havoc ~j~0;havoc ~nc_A~0;havoc ~nc_B~0;~found~0 := 0;~i~0 := 0; {415#(= main_~i~0 0)} is VALID [2018-11-23 13:04:30,380 INFO L273 TraceCheckUtils]: 6: Hoare triple {415#(= main_~i~0 0)} assume !!(~i~0 < 5);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#string_A~0.base, ~#string_A~0.offset + ~i~0, 1);havoc #t~nondet2; {415#(= main_~i~0 0)} is VALID [2018-11-23 13:04:30,381 INFO L273 TraceCheckUtils]: 7: Hoare triple {415#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {416#(<= main_~i~0 1)} is VALID [2018-11-23 13:04:30,382 INFO L273 TraceCheckUtils]: 8: Hoare triple {416#(<= main_~i~0 1)} assume !(~i~0 < 5); {414#false} is VALID [2018-11-23 13:04:30,382 INFO L273 TraceCheckUtils]: 9: Hoare triple {414#false} call #t~mem3 := read~int(~#string_A~0.base, 4 + ~#string_A~0.offset, 1); {414#false} is VALID [2018-11-23 13:04:30,383 INFO L273 TraceCheckUtils]: 10: Hoare triple {414#false} assume !!(0 == #t~mem3);havoc #t~mem3;~i~0 := 0; {414#false} is VALID [2018-11-23 13:04:30,383 INFO L273 TraceCheckUtils]: 11: Hoare triple {414#false} assume !!(~i~0 < 5);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#string_B~0.base, ~#string_B~0.offset + ~i~0, 1);havoc #t~nondet5; {414#false} is VALID [2018-11-23 13:04:30,383 INFO L273 TraceCheckUtils]: 12: Hoare triple {414#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {414#false} is VALID [2018-11-23 13:04:30,384 INFO L273 TraceCheckUtils]: 13: Hoare triple {414#false} assume !(~i~0 < 5); {414#false} is VALID [2018-11-23 13:04:30,384 INFO L273 TraceCheckUtils]: 14: Hoare triple {414#false} call #t~mem6 := read~int(~#string_B~0.base, 4 + ~#string_B~0.offset, 1); {414#false} is VALID [2018-11-23 13:04:30,384 INFO L273 TraceCheckUtils]: 15: Hoare triple {414#false} assume !!(0 == #t~mem6);havoc #t~mem6;~nc_A~0 := 0; {414#false} is VALID [2018-11-23 13:04:30,385 INFO L273 TraceCheckUtils]: 16: Hoare triple {414#false} call #t~mem7 := read~int(~#string_A~0.base, ~#string_A~0.offset + ~nc_A~0, 1); {414#false} is VALID [2018-11-23 13:04:30,385 INFO L273 TraceCheckUtils]: 17: Hoare triple {414#false} assume !(0 != #t~mem7);havoc #t~mem7; {414#false} is VALID [2018-11-23 13:04:30,386 INFO L273 TraceCheckUtils]: 18: Hoare triple {414#false} ~nc_B~0 := 0; {414#false} is VALID [2018-11-23 13:04:30,386 INFO L273 TraceCheckUtils]: 19: Hoare triple {414#false} call #t~mem9 := read~int(~#string_B~0.base, ~#string_B~0.offset + ~nc_B~0, 1); {414#false} is VALID [2018-11-23 13:04:30,387 INFO L273 TraceCheckUtils]: 20: Hoare triple {414#false} assume !(0 != #t~mem9);havoc #t~mem9; {414#false} is VALID [2018-11-23 13:04:30,387 INFO L273 TraceCheckUtils]: 21: Hoare triple {414#false} assume !!(~nc_B~0 >= ~nc_A~0);~j~0 := 0;~i~0 := ~j~0; {414#false} is VALID [2018-11-23 13:04:30,387 INFO L273 TraceCheckUtils]: 22: Hoare triple {414#false} assume !(~i~0 < ~nc_A~0 && ~j~0 < ~nc_B~0); {414#false} is VALID [2018-11-23 13:04:30,388 INFO L273 TraceCheckUtils]: 23: Hoare triple {414#false} ~found~0 := (if ~j~0 > ~nc_B~0 - 1 then 1 else 0); {414#false} is VALID [2018-11-23 13:04:30,388 INFO L256 TraceCheckUtils]: 24: Hoare triple {414#false} call __VERIFIER_assert((if 0 == ~found~0 || 1 == ~found~0 then 1 else 0)); {414#false} is VALID [2018-11-23 13:04:30,388 INFO L273 TraceCheckUtils]: 25: Hoare triple {414#false} ~cond := #in~cond; {414#false} is VALID [2018-11-23 13:04:30,389 INFO L273 TraceCheckUtils]: 26: Hoare triple {414#false} assume 0 == ~cond; {414#false} is VALID [2018-11-23 13:04:30,389 INFO L273 TraceCheckUtils]: 27: Hoare triple {414#false} assume !false; {414#false} is VALID [2018-11-23 13:04:30,391 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 13:04:30,391 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:04:30,391 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:04:30,404 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:04:30,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:04:30,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:04:30,467 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:04:30,808 INFO L256 TraceCheckUtils]: 0: Hoare triple {413#true} call ULTIMATE.init(); {413#true} is VALID [2018-11-23 13:04:30,808 INFO L273 TraceCheckUtils]: 1: Hoare triple {413#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {413#true} is VALID [2018-11-23 13:04:30,809 INFO L273 TraceCheckUtils]: 2: Hoare triple {413#true} assume true; {413#true} is VALID [2018-11-23 13:04:30,809 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {413#true} {413#true} #107#return; {413#true} is VALID [2018-11-23 13:04:30,809 INFO L256 TraceCheckUtils]: 4: Hoare triple {413#true} call #t~ret15 := main(); {413#true} is VALID [2018-11-23 13:04:30,813 INFO L273 TraceCheckUtils]: 5: Hoare triple {413#true} call ~#string_A~0.base, ~#string_A~0.offset := #Ultimate.alloc(5);call ~#string_B~0.base, ~#string_B~0.offset := #Ultimate.alloc(5);havoc ~i~0;havoc ~j~0;havoc ~nc_A~0;havoc ~nc_B~0;~found~0 := 0;~i~0 := 0; {435#(<= main_~i~0 0)} is VALID [2018-11-23 13:04:30,814 INFO L273 TraceCheckUtils]: 6: Hoare triple {435#(<= main_~i~0 0)} assume !!(~i~0 < 5);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#string_A~0.base, ~#string_A~0.offset + ~i~0, 1);havoc #t~nondet2; {435#(<= main_~i~0 0)} is VALID [2018-11-23 13:04:30,814 INFO L273 TraceCheckUtils]: 7: Hoare triple {435#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {416#(<= main_~i~0 1)} is VALID [2018-11-23 13:04:30,815 INFO L273 TraceCheckUtils]: 8: Hoare triple {416#(<= main_~i~0 1)} assume !(~i~0 < 5); {414#false} is VALID [2018-11-23 13:04:30,815 INFO L273 TraceCheckUtils]: 9: Hoare triple {414#false} call #t~mem3 := read~int(~#string_A~0.base, 4 + ~#string_A~0.offset, 1); {414#false} is VALID [2018-11-23 13:04:30,816 INFO L273 TraceCheckUtils]: 10: Hoare triple {414#false} assume !!(0 == #t~mem3);havoc #t~mem3;~i~0 := 0; {414#false} is VALID [2018-11-23 13:04:30,816 INFO L273 TraceCheckUtils]: 11: Hoare triple {414#false} assume !!(~i~0 < 5);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#string_B~0.base, ~#string_B~0.offset + ~i~0, 1);havoc #t~nondet5; {414#false} is VALID [2018-11-23 13:04:30,816 INFO L273 TraceCheckUtils]: 12: Hoare triple {414#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {414#false} is VALID [2018-11-23 13:04:30,817 INFO L273 TraceCheckUtils]: 13: Hoare triple {414#false} assume !(~i~0 < 5); {414#false} is VALID [2018-11-23 13:04:30,817 INFO L273 TraceCheckUtils]: 14: Hoare triple {414#false} call #t~mem6 := read~int(~#string_B~0.base, 4 + ~#string_B~0.offset, 1); {414#false} is VALID [2018-11-23 13:04:30,817 INFO L273 TraceCheckUtils]: 15: Hoare triple {414#false} assume !!(0 == #t~mem6);havoc #t~mem6;~nc_A~0 := 0; {414#false} is VALID [2018-11-23 13:04:30,818 INFO L273 TraceCheckUtils]: 16: Hoare triple {414#false} call #t~mem7 := read~int(~#string_A~0.base, ~#string_A~0.offset + ~nc_A~0, 1); {414#false} is VALID [2018-11-23 13:04:30,818 INFO L273 TraceCheckUtils]: 17: Hoare triple {414#false} assume !(0 != #t~mem7);havoc #t~mem7; {414#false} is VALID [2018-11-23 13:04:30,818 INFO L273 TraceCheckUtils]: 18: Hoare triple {414#false} ~nc_B~0 := 0; {414#false} is VALID [2018-11-23 13:04:30,819 INFO L273 TraceCheckUtils]: 19: Hoare triple {414#false} call #t~mem9 := read~int(~#string_B~0.base, ~#string_B~0.offset + ~nc_B~0, 1); {414#false} is VALID [2018-11-23 13:04:30,819 INFO L273 TraceCheckUtils]: 20: Hoare triple {414#false} assume !(0 != #t~mem9);havoc #t~mem9; {414#false} is VALID [2018-11-23 13:04:30,820 INFO L273 TraceCheckUtils]: 21: Hoare triple {414#false} assume !!(~nc_B~0 >= ~nc_A~0);~j~0 := 0;~i~0 := ~j~0; {414#false} is VALID [2018-11-23 13:04:30,820 INFO L273 TraceCheckUtils]: 22: Hoare triple {414#false} assume !(~i~0 < ~nc_A~0 && ~j~0 < ~nc_B~0); {414#false} is VALID [2018-11-23 13:04:30,820 INFO L273 TraceCheckUtils]: 23: Hoare triple {414#false} ~found~0 := (if ~j~0 > ~nc_B~0 - 1 then 1 else 0); {414#false} is VALID [2018-11-23 13:04:30,821 INFO L256 TraceCheckUtils]: 24: Hoare triple {414#false} call __VERIFIER_assert((if 0 == ~found~0 || 1 == ~found~0 then 1 else 0)); {414#false} is VALID [2018-11-23 13:04:30,821 INFO L273 TraceCheckUtils]: 25: Hoare triple {414#false} ~cond := #in~cond; {414#false} is VALID [2018-11-23 13:04:30,821 INFO L273 TraceCheckUtils]: 26: Hoare triple {414#false} assume 0 == ~cond; {414#false} is VALID [2018-11-23 13:04:30,822 INFO L273 TraceCheckUtils]: 27: Hoare triple {414#false} assume !false; {414#false} is VALID [2018-11-23 13:04:30,824 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 13:04:30,843 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:04:30,843 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-11-23 13:04:30,844 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2018-11-23 13:04:30,844 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:04:30,844 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 13:04:30,917 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:04:30,917 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 13:04:30,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 13:04:30,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-23 13:04:30,918 INFO L87 Difference]: Start difference. First operand 30 states and 35 transitions. Second operand 5 states. [2018-11-23 13:04:31,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:04:31,254 INFO L93 Difference]: Finished difference Result 65 states and 80 transitions. [2018-11-23 13:04:31,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 13:04:31,254 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2018-11-23 13:04:31,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:04:31,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 13:04:31,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 79 transitions. [2018-11-23 13:04:31,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 13:04:31,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 79 transitions. [2018-11-23 13:04:31,262 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 79 transitions. [2018-11-23 13:04:31,408 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:04:31,410 INFO L225 Difference]: With dead ends: 65 [2018-11-23 13:04:31,410 INFO L226 Difference]: Without dead ends: 44 [2018-11-23 13:04:31,411 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-23 13:04:31,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-11-23 13:04:31,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 34. [2018-11-23 13:04:31,425 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:04:31,426 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand 34 states. [2018-11-23 13:04:31,426 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 34 states. [2018-11-23 13:04:31,426 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 34 states. [2018-11-23 13:04:31,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:04:31,429 INFO L93 Difference]: Finished difference Result 44 states and 53 transitions. [2018-11-23 13:04:31,430 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 53 transitions. [2018-11-23 13:04:31,430 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:04:31,431 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:04:31,431 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 44 states. [2018-11-23 13:04:31,431 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 44 states. [2018-11-23 13:04:31,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:04:31,434 INFO L93 Difference]: Finished difference Result 44 states and 53 transitions. [2018-11-23 13:04:31,435 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 53 transitions. [2018-11-23 13:04:31,435 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:04:31,435 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:04:31,436 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:04:31,436 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:04:31,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-23 13:04:31,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 39 transitions. [2018-11-23 13:04:31,438 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 39 transitions. Word has length 28 [2018-11-23 13:04:31,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:04:31,439 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 39 transitions. [2018-11-23 13:04:31,439 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 13:04:31,439 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 39 transitions. [2018-11-23 13:04:31,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-23 13:04:31,440 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:04:31,440 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 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, 1] [2018-11-23 13:04:31,441 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:04:31,441 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:04:31,441 INFO L82 PathProgramCache]: Analyzing trace with hash -1752396196, now seen corresponding path program 2 times [2018-11-23 13:04:31,441 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:04:31,441 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:04:31,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:04:31,443 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:04:31,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:04:31,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:04:31,569 INFO L256 TraceCheckUtils]: 0: Hoare triple {729#true} call ULTIMATE.init(); {729#true} is VALID [2018-11-23 13:04:31,569 INFO L273 TraceCheckUtils]: 1: Hoare triple {729#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {729#true} is VALID [2018-11-23 13:04:31,570 INFO L273 TraceCheckUtils]: 2: Hoare triple {729#true} assume true; {729#true} is VALID [2018-11-23 13:04:31,570 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {729#true} {729#true} #107#return; {729#true} is VALID [2018-11-23 13:04:31,570 INFO L256 TraceCheckUtils]: 4: Hoare triple {729#true} call #t~ret15 := main(); {729#true} is VALID [2018-11-23 13:04:31,575 INFO L273 TraceCheckUtils]: 5: Hoare triple {729#true} call ~#string_A~0.base, ~#string_A~0.offset := #Ultimate.alloc(5);call ~#string_B~0.base, ~#string_B~0.offset := #Ultimate.alloc(5);havoc ~i~0;havoc ~j~0;havoc ~nc_A~0;havoc ~nc_B~0;~found~0 := 0;~i~0 := 0; {731#(= main_~i~0 0)} is VALID [2018-11-23 13:04:31,576 INFO L273 TraceCheckUtils]: 6: Hoare triple {731#(= main_~i~0 0)} assume !!(~i~0 < 5);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#string_A~0.base, ~#string_A~0.offset + ~i~0, 1);havoc #t~nondet2; {731#(= main_~i~0 0)} is VALID [2018-11-23 13:04:31,576 INFO L273 TraceCheckUtils]: 7: Hoare triple {731#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {732#(<= main_~i~0 1)} is VALID [2018-11-23 13:04:31,578 INFO L273 TraceCheckUtils]: 8: Hoare triple {732#(<= main_~i~0 1)} assume !!(~i~0 < 5);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#string_A~0.base, ~#string_A~0.offset + ~i~0, 1);havoc #t~nondet2; {732#(<= main_~i~0 1)} is VALID [2018-11-23 13:04:31,580 INFO L273 TraceCheckUtils]: 9: Hoare triple {732#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {733#(<= main_~i~0 2)} is VALID [2018-11-23 13:04:31,581 INFO L273 TraceCheckUtils]: 10: Hoare triple {733#(<= main_~i~0 2)} assume !(~i~0 < 5); {730#false} is VALID [2018-11-23 13:04:31,581 INFO L273 TraceCheckUtils]: 11: Hoare triple {730#false} call #t~mem3 := read~int(~#string_A~0.base, 4 + ~#string_A~0.offset, 1); {730#false} is VALID [2018-11-23 13:04:31,581 INFO L273 TraceCheckUtils]: 12: Hoare triple {730#false} assume !!(0 == #t~mem3);havoc #t~mem3;~i~0 := 0; {730#false} is VALID [2018-11-23 13:04:31,582 INFO L273 TraceCheckUtils]: 13: Hoare triple {730#false} assume !!(~i~0 < 5);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#string_B~0.base, ~#string_B~0.offset + ~i~0, 1);havoc #t~nondet5; {730#false} is VALID [2018-11-23 13:04:31,582 INFO L273 TraceCheckUtils]: 14: Hoare triple {730#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {730#false} is VALID [2018-11-23 13:04:31,582 INFO L273 TraceCheckUtils]: 15: Hoare triple {730#false} assume !!(~i~0 < 5);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#string_B~0.base, ~#string_B~0.offset + ~i~0, 1);havoc #t~nondet5; {730#false} is VALID [2018-11-23 13:04:31,582 INFO L273 TraceCheckUtils]: 16: Hoare triple {730#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {730#false} is VALID [2018-11-23 13:04:31,583 INFO L273 TraceCheckUtils]: 17: Hoare triple {730#false} assume !(~i~0 < 5); {730#false} is VALID [2018-11-23 13:04:31,583 INFO L273 TraceCheckUtils]: 18: Hoare triple {730#false} call #t~mem6 := read~int(~#string_B~0.base, 4 + ~#string_B~0.offset, 1); {730#false} is VALID [2018-11-23 13:04:31,584 INFO L273 TraceCheckUtils]: 19: Hoare triple {730#false} assume !!(0 == #t~mem6);havoc #t~mem6;~nc_A~0 := 0; {730#false} is VALID [2018-11-23 13:04:31,584 INFO L273 TraceCheckUtils]: 20: Hoare triple {730#false} call #t~mem7 := read~int(~#string_A~0.base, ~#string_A~0.offset + ~nc_A~0, 1); {730#false} is VALID [2018-11-23 13:04:31,584 INFO L273 TraceCheckUtils]: 21: Hoare triple {730#false} assume !(0 != #t~mem7);havoc #t~mem7; {730#false} is VALID [2018-11-23 13:04:31,584 INFO L273 TraceCheckUtils]: 22: Hoare triple {730#false} ~nc_B~0 := 0; {730#false} is VALID [2018-11-23 13:04:31,585 INFO L273 TraceCheckUtils]: 23: Hoare triple {730#false} call #t~mem9 := read~int(~#string_B~0.base, ~#string_B~0.offset + ~nc_B~0, 1); {730#false} is VALID [2018-11-23 13:04:31,585 INFO L273 TraceCheckUtils]: 24: Hoare triple {730#false} assume !(0 != #t~mem9);havoc #t~mem9; {730#false} is VALID [2018-11-23 13:04:31,585 INFO L273 TraceCheckUtils]: 25: Hoare triple {730#false} assume !!(~nc_B~0 >= ~nc_A~0);~j~0 := 0;~i~0 := ~j~0; {730#false} is VALID [2018-11-23 13:04:31,586 INFO L273 TraceCheckUtils]: 26: Hoare triple {730#false} assume !(~i~0 < ~nc_A~0 && ~j~0 < ~nc_B~0); {730#false} is VALID [2018-11-23 13:04:31,586 INFO L273 TraceCheckUtils]: 27: Hoare triple {730#false} ~found~0 := (if ~j~0 > ~nc_B~0 - 1 then 1 else 0); {730#false} is VALID [2018-11-23 13:04:31,586 INFO L256 TraceCheckUtils]: 28: Hoare triple {730#false} call __VERIFIER_assert((if 0 == ~found~0 || 1 == ~found~0 then 1 else 0)); {730#false} is VALID [2018-11-23 13:04:31,587 INFO L273 TraceCheckUtils]: 29: Hoare triple {730#false} ~cond := #in~cond; {730#false} is VALID [2018-11-23 13:04:31,587 INFO L273 TraceCheckUtils]: 30: Hoare triple {730#false} assume 0 == ~cond; {730#false} is VALID [2018-11-23 13:04:31,587 INFO L273 TraceCheckUtils]: 31: Hoare triple {730#false} assume !false; {730#false} is VALID [2018-11-23 13:04:31,589 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-23 13:04:31,590 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:04:31,590 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:04:31,605 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 13:04:31,637 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-11-23 13:04:31,638 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:04:31,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:04:31,670 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:04:31,851 INFO L256 TraceCheckUtils]: 0: Hoare triple {729#true} call ULTIMATE.init(); {729#true} is VALID [2018-11-23 13:04:31,852 INFO L273 TraceCheckUtils]: 1: Hoare triple {729#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {729#true} is VALID [2018-11-23 13:04:31,852 INFO L273 TraceCheckUtils]: 2: Hoare triple {729#true} assume true; {729#true} is VALID [2018-11-23 13:04:31,852 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {729#true} {729#true} #107#return; {729#true} is VALID [2018-11-23 13:04:31,852 INFO L256 TraceCheckUtils]: 4: Hoare triple {729#true} call #t~ret15 := main(); {729#true} is VALID [2018-11-23 13:04:31,853 INFO L273 TraceCheckUtils]: 5: Hoare triple {729#true} call ~#string_A~0.base, ~#string_A~0.offset := #Ultimate.alloc(5);call ~#string_B~0.base, ~#string_B~0.offset := #Ultimate.alloc(5);havoc ~i~0;havoc ~j~0;havoc ~nc_A~0;havoc ~nc_B~0;~found~0 := 0;~i~0 := 0; {729#true} is VALID [2018-11-23 13:04:31,853 INFO L273 TraceCheckUtils]: 6: Hoare triple {729#true} assume !!(~i~0 < 5);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#string_A~0.base, ~#string_A~0.offset + ~i~0, 1);havoc #t~nondet2; {729#true} is VALID [2018-11-23 13:04:31,853 INFO L273 TraceCheckUtils]: 7: Hoare triple {729#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {729#true} is VALID [2018-11-23 13:04:31,854 INFO L273 TraceCheckUtils]: 8: Hoare triple {729#true} assume !!(~i~0 < 5);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#string_A~0.base, ~#string_A~0.offset + ~i~0, 1);havoc #t~nondet2; {729#true} is VALID [2018-11-23 13:04:31,854 INFO L273 TraceCheckUtils]: 9: Hoare triple {729#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {729#true} is VALID [2018-11-23 13:04:31,854 INFO L273 TraceCheckUtils]: 10: Hoare triple {729#true} assume !(~i~0 < 5); {729#true} is VALID [2018-11-23 13:04:31,854 INFO L273 TraceCheckUtils]: 11: Hoare triple {729#true} call #t~mem3 := read~int(~#string_A~0.base, 4 + ~#string_A~0.offset, 1); {729#true} is VALID [2018-11-23 13:04:31,855 INFO L273 TraceCheckUtils]: 12: Hoare triple {729#true} assume !!(0 == #t~mem3);havoc #t~mem3;~i~0 := 0; {729#true} is VALID [2018-11-23 13:04:31,855 INFO L273 TraceCheckUtils]: 13: Hoare triple {729#true} assume !!(~i~0 < 5);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#string_B~0.base, ~#string_B~0.offset + ~i~0, 1);havoc #t~nondet5; {729#true} is VALID [2018-11-23 13:04:31,855 INFO L273 TraceCheckUtils]: 14: Hoare triple {729#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {729#true} is VALID [2018-11-23 13:04:31,856 INFO L273 TraceCheckUtils]: 15: Hoare triple {729#true} assume !!(~i~0 < 5);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#string_B~0.base, ~#string_B~0.offset + ~i~0, 1);havoc #t~nondet5; {729#true} is VALID [2018-11-23 13:04:31,856 INFO L273 TraceCheckUtils]: 16: Hoare triple {729#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {729#true} is VALID [2018-11-23 13:04:31,856 INFO L273 TraceCheckUtils]: 17: Hoare triple {729#true} assume !(~i~0 < 5); {729#true} is VALID [2018-11-23 13:04:31,856 INFO L273 TraceCheckUtils]: 18: Hoare triple {729#true} call #t~mem6 := read~int(~#string_B~0.base, 4 + ~#string_B~0.offset, 1); {729#true} is VALID [2018-11-23 13:04:31,857 INFO L273 TraceCheckUtils]: 19: Hoare triple {729#true} assume !!(0 == #t~mem6);havoc #t~mem6;~nc_A~0 := 0; {729#true} is VALID [2018-11-23 13:04:31,857 INFO L273 TraceCheckUtils]: 20: Hoare triple {729#true} call #t~mem7 := read~int(~#string_A~0.base, ~#string_A~0.offset + ~nc_A~0, 1); {729#true} is VALID [2018-11-23 13:04:31,857 INFO L273 TraceCheckUtils]: 21: Hoare triple {729#true} assume !(0 != #t~mem7);havoc #t~mem7; {729#true} is VALID [2018-11-23 13:04:31,858 INFO L273 TraceCheckUtils]: 22: Hoare triple {729#true} ~nc_B~0 := 0; {803#(<= main_~nc_B~0 0)} is VALID [2018-11-23 13:04:31,860 INFO L273 TraceCheckUtils]: 23: Hoare triple {803#(<= main_~nc_B~0 0)} call #t~mem9 := read~int(~#string_B~0.base, ~#string_B~0.offset + ~nc_B~0, 1); {803#(<= main_~nc_B~0 0)} is VALID [2018-11-23 13:04:31,863 INFO L273 TraceCheckUtils]: 24: Hoare triple {803#(<= main_~nc_B~0 0)} assume !(0 != #t~mem9);havoc #t~mem9; {803#(<= main_~nc_B~0 0)} is VALID [2018-11-23 13:04:31,863 INFO L273 TraceCheckUtils]: 25: Hoare triple {803#(<= main_~nc_B~0 0)} assume !!(~nc_B~0 >= ~nc_A~0);~j~0 := 0;~i~0 := ~j~0; {813#(and (<= 0 main_~j~0) (<= main_~nc_B~0 0))} is VALID [2018-11-23 13:04:31,864 INFO L273 TraceCheckUtils]: 26: Hoare triple {813#(and (<= 0 main_~j~0) (<= main_~nc_B~0 0))} assume !(~i~0 < ~nc_A~0 && ~j~0 < ~nc_B~0); {813#(and (<= 0 main_~j~0) (<= main_~nc_B~0 0))} is VALID [2018-11-23 13:04:31,865 INFO L273 TraceCheckUtils]: 27: Hoare triple {813#(and (<= 0 main_~j~0) (<= main_~nc_B~0 0))} ~found~0 := (if ~j~0 > ~nc_B~0 - 1 then 1 else 0); {820#(= 1 main_~found~0)} is VALID [2018-11-23 13:04:31,866 INFO L256 TraceCheckUtils]: 28: Hoare triple {820#(= 1 main_~found~0)} call __VERIFIER_assert((if 0 == ~found~0 || 1 == ~found~0 then 1 else 0)); {824#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 13:04:31,866 INFO L273 TraceCheckUtils]: 29: Hoare triple {824#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {828#(= 1 __VERIFIER_assert_~cond)} is VALID [2018-11-23 13:04:31,867 INFO L273 TraceCheckUtils]: 30: Hoare triple {828#(= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {730#false} is VALID [2018-11-23 13:04:31,868 INFO L273 TraceCheckUtils]: 31: Hoare triple {730#false} assume !false; {730#false} is VALID [2018-11-23 13:04:31,871 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-23 13:04:31,890 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-23 13:04:31,890 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [5] total 10 [2018-11-23 13:04:31,891 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 32 [2018-11-23 13:04:31,891 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:04:31,892 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2018-11-23 13:04:31,969 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:04:31,970 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-23 13:04:31,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 13:04:31,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-11-23 13:04:31,971 INFO L87 Difference]: Start difference. First operand 34 states and 39 transitions. Second operand 10 states. [2018-11-23 13:04:32,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:04:32,604 INFO L93 Difference]: Finished difference Result 83 states and 102 transitions. [2018-11-23 13:04:32,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 13:04:32,605 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 32 [2018-11-23 13:04:32,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:04:32,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 13:04:32,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 99 transitions. [2018-11-23 13:04:32,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 13:04:32,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 99 transitions. [2018-11-23 13:04:32,613 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 99 transitions. [2018-11-23 13:04:32,779 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 99 edges. 99 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:04:32,782 INFO L225 Difference]: With dead ends: 83 [2018-11-23 13:04:32,782 INFO L226 Difference]: Without dead ends: 54 [2018-11-23 13:04:32,783 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2018-11-23 13:04:32,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-11-23 13:04:32,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 40. [2018-11-23 13:04:32,829 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:04:32,829 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 states. Second operand 40 states. [2018-11-23 13:04:32,829 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand 40 states. [2018-11-23 13:04:32,829 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 40 states. [2018-11-23 13:04:32,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:04:32,834 INFO L93 Difference]: Finished difference Result 54 states and 65 transitions. [2018-11-23 13:04:32,834 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 65 transitions. [2018-11-23 13:04:32,835 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:04:32,835 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:04:32,835 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 54 states. [2018-11-23 13:04:32,835 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 54 states. [2018-11-23 13:04:32,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:04:32,839 INFO L93 Difference]: Finished difference Result 54 states and 65 transitions. [2018-11-23 13:04:32,839 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 65 transitions. [2018-11-23 13:04:32,839 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:04:32,840 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:04:32,840 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:04:32,840 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:04:32,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-23 13:04:32,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 45 transitions. [2018-11-23 13:04:32,842 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 45 transitions. Word has length 32 [2018-11-23 13:04:32,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:04:32,843 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 45 transitions. [2018-11-23 13:04:32,843 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-23 13:04:32,843 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 45 transitions. [2018-11-23 13:04:32,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-23 13:04:32,844 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:04:32,844 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:04:32,845 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:04:32,845 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:04:32,845 INFO L82 PathProgramCache]: Analyzing trace with hash 515659703, now seen corresponding path program 1 times [2018-11-23 13:04:32,845 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:04:32,846 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:04:32,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:04:32,847 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:04:32,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:04:32,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:04:33,005 INFO L256 TraceCheckUtils]: 0: Hoare triple {1124#true} call ULTIMATE.init(); {1124#true} is VALID [2018-11-23 13:04:33,006 INFO L273 TraceCheckUtils]: 1: Hoare triple {1124#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1124#true} is VALID [2018-11-23 13:04:33,006 INFO L273 TraceCheckUtils]: 2: Hoare triple {1124#true} assume true; {1124#true} is VALID [2018-11-23 13:04:33,007 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1124#true} {1124#true} #107#return; {1124#true} is VALID [2018-11-23 13:04:33,007 INFO L256 TraceCheckUtils]: 4: Hoare triple {1124#true} call #t~ret15 := main(); {1124#true} is VALID [2018-11-23 13:04:33,008 INFO L273 TraceCheckUtils]: 5: Hoare triple {1124#true} call ~#string_A~0.base, ~#string_A~0.offset := #Ultimate.alloc(5);call ~#string_B~0.base, ~#string_B~0.offset := #Ultimate.alloc(5);havoc ~i~0;havoc ~j~0;havoc ~nc_A~0;havoc ~nc_B~0;~found~0 := 0;~i~0 := 0; {1126#(= main_~i~0 0)} is VALID [2018-11-23 13:04:33,010 INFO L273 TraceCheckUtils]: 6: Hoare triple {1126#(= main_~i~0 0)} assume !!(~i~0 < 5);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#string_A~0.base, ~#string_A~0.offset + ~i~0, 1);havoc #t~nondet2; {1126#(= main_~i~0 0)} is VALID [2018-11-23 13:04:33,010 INFO L273 TraceCheckUtils]: 7: Hoare triple {1126#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1127#(<= main_~i~0 1)} is VALID [2018-11-23 13:04:33,012 INFO L273 TraceCheckUtils]: 8: Hoare triple {1127#(<= main_~i~0 1)} assume !!(~i~0 < 5);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#string_A~0.base, ~#string_A~0.offset + ~i~0, 1);havoc #t~nondet2; {1127#(<= main_~i~0 1)} is VALID [2018-11-23 13:04:33,013 INFO L273 TraceCheckUtils]: 9: Hoare triple {1127#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1128#(<= main_~i~0 2)} is VALID [2018-11-23 13:04:33,014 INFO L273 TraceCheckUtils]: 10: Hoare triple {1128#(<= main_~i~0 2)} assume !!(~i~0 < 5);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#string_A~0.base, ~#string_A~0.offset + ~i~0, 1);havoc #t~nondet2; {1128#(<= main_~i~0 2)} is VALID [2018-11-23 13:04:33,015 INFO L273 TraceCheckUtils]: 11: Hoare triple {1128#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1129#(<= main_~i~0 3)} is VALID [2018-11-23 13:04:33,016 INFO L273 TraceCheckUtils]: 12: Hoare triple {1129#(<= main_~i~0 3)} assume !(~i~0 < 5); {1125#false} is VALID [2018-11-23 13:04:33,016 INFO L273 TraceCheckUtils]: 13: Hoare triple {1125#false} call #t~mem3 := read~int(~#string_A~0.base, 4 + ~#string_A~0.offset, 1); {1125#false} is VALID [2018-11-23 13:04:33,017 INFO L273 TraceCheckUtils]: 14: Hoare triple {1125#false} assume !!(0 == #t~mem3);havoc #t~mem3;~i~0 := 0; {1125#false} is VALID [2018-11-23 13:04:33,017 INFO L273 TraceCheckUtils]: 15: Hoare triple {1125#false} assume !!(~i~0 < 5);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#string_B~0.base, ~#string_B~0.offset + ~i~0, 1);havoc #t~nondet5; {1125#false} is VALID [2018-11-23 13:04:33,017 INFO L273 TraceCheckUtils]: 16: Hoare triple {1125#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1125#false} is VALID [2018-11-23 13:04:33,018 INFO L273 TraceCheckUtils]: 17: Hoare triple {1125#false} assume !!(~i~0 < 5);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#string_B~0.base, ~#string_B~0.offset + ~i~0, 1);havoc #t~nondet5; {1125#false} is VALID [2018-11-23 13:04:33,018 INFO L273 TraceCheckUtils]: 18: Hoare triple {1125#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1125#false} is VALID [2018-11-23 13:04:33,018 INFO L273 TraceCheckUtils]: 19: Hoare triple {1125#false} assume !!(~i~0 < 5);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#string_B~0.base, ~#string_B~0.offset + ~i~0, 1);havoc #t~nondet5; {1125#false} is VALID [2018-11-23 13:04:33,019 INFO L273 TraceCheckUtils]: 20: Hoare triple {1125#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1125#false} is VALID [2018-11-23 13:04:33,019 INFO L273 TraceCheckUtils]: 21: Hoare triple {1125#false} assume !(~i~0 < 5); {1125#false} is VALID [2018-11-23 13:04:33,019 INFO L273 TraceCheckUtils]: 22: Hoare triple {1125#false} call #t~mem6 := read~int(~#string_B~0.base, 4 + ~#string_B~0.offset, 1); {1125#false} is VALID [2018-11-23 13:04:33,020 INFO L273 TraceCheckUtils]: 23: Hoare triple {1125#false} assume !!(0 == #t~mem6);havoc #t~mem6;~nc_A~0 := 0; {1125#false} is VALID [2018-11-23 13:04:33,020 INFO L273 TraceCheckUtils]: 24: Hoare triple {1125#false} call #t~mem7 := read~int(~#string_A~0.base, ~#string_A~0.offset + ~nc_A~0, 1); {1125#false} is VALID [2018-11-23 13:04:33,020 INFO L273 TraceCheckUtils]: 25: Hoare triple {1125#false} assume !(0 != #t~mem7);havoc #t~mem7; {1125#false} is VALID [2018-11-23 13:04:33,020 INFO L273 TraceCheckUtils]: 26: Hoare triple {1125#false} ~nc_B~0 := 0; {1125#false} is VALID [2018-11-23 13:04:33,021 INFO L273 TraceCheckUtils]: 27: Hoare triple {1125#false} call #t~mem9 := read~int(~#string_B~0.base, ~#string_B~0.offset + ~nc_B~0, 1); {1125#false} is VALID [2018-11-23 13:04:33,021 INFO L273 TraceCheckUtils]: 28: Hoare triple {1125#false} assume !!(0 != #t~mem9);havoc #t~mem9;#t~post10 := ~nc_B~0;~nc_B~0 := 1 + #t~post10;havoc #t~post10; {1125#false} is VALID [2018-11-23 13:04:33,021 INFO L273 TraceCheckUtils]: 29: Hoare triple {1125#false} call #t~mem9 := read~int(~#string_B~0.base, ~#string_B~0.offset + ~nc_B~0, 1); {1125#false} is VALID [2018-11-23 13:04:33,022 INFO L273 TraceCheckUtils]: 30: Hoare triple {1125#false} assume !(0 != #t~mem9);havoc #t~mem9; {1125#false} is VALID [2018-11-23 13:04:33,022 INFO L273 TraceCheckUtils]: 31: Hoare triple {1125#false} assume !!(~nc_B~0 >= ~nc_A~0);~j~0 := 0;~i~0 := ~j~0; {1125#false} is VALID [2018-11-23 13:04:33,022 INFO L273 TraceCheckUtils]: 32: Hoare triple {1125#false} assume !(~i~0 < ~nc_A~0 && ~j~0 < ~nc_B~0); {1125#false} is VALID [2018-11-23 13:04:33,022 INFO L273 TraceCheckUtils]: 33: Hoare triple {1125#false} ~found~0 := (if ~j~0 > ~nc_B~0 - 1 then 1 else 0); {1125#false} is VALID [2018-11-23 13:04:33,023 INFO L256 TraceCheckUtils]: 34: Hoare triple {1125#false} call __VERIFIER_assert((if 0 == ~found~0 || 1 == ~found~0 then 1 else 0)); {1125#false} is VALID [2018-11-23 13:04:33,023 INFO L273 TraceCheckUtils]: 35: Hoare triple {1125#false} ~cond := #in~cond; {1125#false} is VALID [2018-11-23 13:04:33,023 INFO L273 TraceCheckUtils]: 36: Hoare triple {1125#false} assume 0 == ~cond; {1125#false} is VALID [2018-11-23 13:04:33,024 INFO L273 TraceCheckUtils]: 37: Hoare triple {1125#false} assume !false; {1125#false} is VALID [2018-11-23 13:04:33,026 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-23 13:04:33,026 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:04:33,026 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:04:33,043 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:04:33,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:04:33,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:04:33,084 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:04:33,226 INFO L256 TraceCheckUtils]: 0: Hoare triple {1124#true} call ULTIMATE.init(); {1124#true} is VALID [2018-11-23 13:04:33,227 INFO L273 TraceCheckUtils]: 1: Hoare triple {1124#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1124#true} is VALID [2018-11-23 13:04:33,227 INFO L273 TraceCheckUtils]: 2: Hoare triple {1124#true} assume true; {1124#true} is VALID [2018-11-23 13:04:33,228 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1124#true} {1124#true} #107#return; {1124#true} is VALID [2018-11-23 13:04:33,228 INFO L256 TraceCheckUtils]: 4: Hoare triple {1124#true} call #t~ret15 := main(); {1124#true} is VALID [2018-11-23 13:04:33,229 INFO L273 TraceCheckUtils]: 5: Hoare triple {1124#true} call ~#string_A~0.base, ~#string_A~0.offset := #Ultimate.alloc(5);call ~#string_B~0.base, ~#string_B~0.offset := #Ultimate.alloc(5);havoc ~i~0;havoc ~j~0;havoc ~nc_A~0;havoc ~nc_B~0;~found~0 := 0;~i~0 := 0; {1148#(<= main_~i~0 0)} is VALID [2018-11-23 13:04:33,246 INFO L273 TraceCheckUtils]: 6: Hoare triple {1148#(<= main_~i~0 0)} assume !!(~i~0 < 5);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#string_A~0.base, ~#string_A~0.offset + ~i~0, 1);havoc #t~nondet2; {1148#(<= main_~i~0 0)} is VALID [2018-11-23 13:04:33,261 INFO L273 TraceCheckUtils]: 7: Hoare triple {1148#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1127#(<= main_~i~0 1)} is VALID [2018-11-23 13:04:33,267 INFO L273 TraceCheckUtils]: 8: Hoare triple {1127#(<= main_~i~0 1)} assume !!(~i~0 < 5);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#string_A~0.base, ~#string_A~0.offset + ~i~0, 1);havoc #t~nondet2; {1127#(<= main_~i~0 1)} is VALID [2018-11-23 13:04:33,269 INFO L273 TraceCheckUtils]: 9: Hoare triple {1127#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1128#(<= main_~i~0 2)} is VALID [2018-11-23 13:04:33,269 INFO L273 TraceCheckUtils]: 10: Hoare triple {1128#(<= main_~i~0 2)} assume !!(~i~0 < 5);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#string_A~0.base, ~#string_A~0.offset + ~i~0, 1);havoc #t~nondet2; {1128#(<= main_~i~0 2)} is VALID [2018-11-23 13:04:33,270 INFO L273 TraceCheckUtils]: 11: Hoare triple {1128#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1129#(<= main_~i~0 3)} is VALID [2018-11-23 13:04:33,270 INFO L273 TraceCheckUtils]: 12: Hoare triple {1129#(<= main_~i~0 3)} assume !(~i~0 < 5); {1125#false} is VALID [2018-11-23 13:04:33,271 INFO L273 TraceCheckUtils]: 13: Hoare triple {1125#false} call #t~mem3 := read~int(~#string_A~0.base, 4 + ~#string_A~0.offset, 1); {1125#false} is VALID [2018-11-23 13:04:33,271 INFO L273 TraceCheckUtils]: 14: Hoare triple {1125#false} assume !!(0 == #t~mem3);havoc #t~mem3;~i~0 := 0; {1125#false} is VALID [2018-11-23 13:04:33,271 INFO L273 TraceCheckUtils]: 15: Hoare triple {1125#false} assume !!(~i~0 < 5);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#string_B~0.base, ~#string_B~0.offset + ~i~0, 1);havoc #t~nondet5; {1125#false} is VALID [2018-11-23 13:04:33,272 INFO L273 TraceCheckUtils]: 16: Hoare triple {1125#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1125#false} is VALID [2018-11-23 13:04:33,272 INFO L273 TraceCheckUtils]: 17: Hoare triple {1125#false} assume !!(~i~0 < 5);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#string_B~0.base, ~#string_B~0.offset + ~i~0, 1);havoc #t~nondet5; {1125#false} is VALID [2018-11-23 13:04:33,273 INFO L273 TraceCheckUtils]: 18: Hoare triple {1125#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1125#false} is VALID [2018-11-23 13:04:33,273 INFO L273 TraceCheckUtils]: 19: Hoare triple {1125#false} assume !!(~i~0 < 5);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#string_B~0.base, ~#string_B~0.offset + ~i~0, 1);havoc #t~nondet5; {1125#false} is VALID [2018-11-23 13:04:33,273 INFO L273 TraceCheckUtils]: 20: Hoare triple {1125#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1125#false} is VALID [2018-11-23 13:04:33,274 INFO L273 TraceCheckUtils]: 21: Hoare triple {1125#false} assume !(~i~0 < 5); {1125#false} is VALID [2018-11-23 13:04:33,274 INFO L273 TraceCheckUtils]: 22: Hoare triple {1125#false} call #t~mem6 := read~int(~#string_B~0.base, 4 + ~#string_B~0.offset, 1); {1125#false} is VALID [2018-11-23 13:04:33,275 INFO L273 TraceCheckUtils]: 23: Hoare triple {1125#false} assume !!(0 == #t~mem6);havoc #t~mem6;~nc_A~0 := 0; {1125#false} is VALID [2018-11-23 13:04:33,275 INFO L273 TraceCheckUtils]: 24: Hoare triple {1125#false} call #t~mem7 := read~int(~#string_A~0.base, ~#string_A~0.offset + ~nc_A~0, 1); {1125#false} is VALID [2018-11-23 13:04:33,275 INFO L273 TraceCheckUtils]: 25: Hoare triple {1125#false} assume !(0 != #t~mem7);havoc #t~mem7; {1125#false} is VALID [2018-11-23 13:04:33,275 INFO L273 TraceCheckUtils]: 26: Hoare triple {1125#false} ~nc_B~0 := 0; {1125#false} is VALID [2018-11-23 13:04:33,275 INFO L273 TraceCheckUtils]: 27: Hoare triple {1125#false} call #t~mem9 := read~int(~#string_B~0.base, ~#string_B~0.offset + ~nc_B~0, 1); {1125#false} is VALID [2018-11-23 13:04:33,276 INFO L273 TraceCheckUtils]: 28: Hoare triple {1125#false} assume !!(0 != #t~mem9);havoc #t~mem9;#t~post10 := ~nc_B~0;~nc_B~0 := 1 + #t~post10;havoc #t~post10; {1125#false} is VALID [2018-11-23 13:04:33,276 INFO L273 TraceCheckUtils]: 29: Hoare triple {1125#false} call #t~mem9 := read~int(~#string_B~0.base, ~#string_B~0.offset + ~nc_B~0, 1); {1125#false} is VALID [2018-11-23 13:04:33,276 INFO L273 TraceCheckUtils]: 30: Hoare triple {1125#false} assume !(0 != #t~mem9);havoc #t~mem9; {1125#false} is VALID [2018-11-23 13:04:33,277 INFO L273 TraceCheckUtils]: 31: Hoare triple {1125#false} assume !!(~nc_B~0 >= ~nc_A~0);~j~0 := 0;~i~0 := ~j~0; {1125#false} is VALID [2018-11-23 13:04:33,277 INFO L273 TraceCheckUtils]: 32: Hoare triple {1125#false} assume !(~i~0 < ~nc_A~0 && ~j~0 < ~nc_B~0); {1125#false} is VALID [2018-11-23 13:04:33,277 INFO L273 TraceCheckUtils]: 33: Hoare triple {1125#false} ~found~0 := (if ~j~0 > ~nc_B~0 - 1 then 1 else 0); {1125#false} is VALID [2018-11-23 13:04:33,277 INFO L256 TraceCheckUtils]: 34: Hoare triple {1125#false} call __VERIFIER_assert((if 0 == ~found~0 || 1 == ~found~0 then 1 else 0)); {1125#false} is VALID [2018-11-23 13:04:33,277 INFO L273 TraceCheckUtils]: 35: Hoare triple {1125#false} ~cond := #in~cond; {1125#false} is VALID [2018-11-23 13:04:33,278 INFO L273 TraceCheckUtils]: 36: Hoare triple {1125#false} assume 0 == ~cond; {1125#false} is VALID [2018-11-23 13:04:33,278 INFO L273 TraceCheckUtils]: 37: Hoare triple {1125#false} assume !false; {1125#false} is VALID [2018-11-23 13:04:33,280 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-23 13:04:33,300 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:04:33,301 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-11-23 13:04:33,301 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 38 [2018-11-23 13:04:33,301 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:04:33,302 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-23 13:04:33,345 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:04:33,345 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 13:04:33,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 13:04:33,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-23 13:04:33,347 INFO L87 Difference]: Start difference. First operand 40 states and 45 transitions. Second operand 7 states. [2018-11-23 13:04:33,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:04:33,674 INFO L93 Difference]: Finished difference Result 89 states and 108 transitions. [2018-11-23 13:04:33,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 13:04:33,674 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 38 [2018-11-23 13:04:33,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:04:33,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 13:04:33,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 99 transitions. [2018-11-23 13:04:33,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 13:04:33,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 99 transitions. [2018-11-23 13:04:33,680 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 99 transitions. [2018-11-23 13:04:33,908 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 99 edges. 99 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:04:33,911 INFO L225 Difference]: With dead ends: 89 [2018-11-23 13:04:33,911 INFO L226 Difference]: Without dead ends: 62 [2018-11-23 13:04:33,911 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-23 13:04:33,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-11-23 13:04:33,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 44. [2018-11-23 13:04:33,931 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:04:33,931 INFO L82 GeneralOperation]: Start isEquivalent. First operand 62 states. Second operand 44 states. [2018-11-23 13:04:33,932 INFO L74 IsIncluded]: Start isIncluded. First operand 62 states. Second operand 44 states. [2018-11-23 13:04:33,932 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 44 states. [2018-11-23 13:04:33,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:04:33,936 INFO L93 Difference]: Finished difference Result 62 states and 75 transitions. [2018-11-23 13:04:33,936 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 75 transitions. [2018-11-23 13:04:33,937 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:04:33,937 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:04:33,937 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 62 states. [2018-11-23 13:04:33,937 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 62 states. [2018-11-23 13:04:33,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:04:33,941 INFO L93 Difference]: Finished difference Result 62 states and 75 transitions. [2018-11-23 13:04:33,941 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 75 transitions. [2018-11-23 13:04:33,942 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:04:33,942 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:04:33,942 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:04:33,942 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:04:33,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-23 13:04:33,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 49 transitions. [2018-11-23 13:04:33,944 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 49 transitions. Word has length 38 [2018-11-23 13:04:33,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:04:33,945 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 49 transitions. [2018-11-23 13:04:33,945 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 13:04:33,945 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 49 transitions. [2018-11-23 13:04:33,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-23 13:04:33,946 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:04:33,946 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:04:33,947 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:04:33,947 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:04:33,947 INFO L82 PathProgramCache]: Analyzing trace with hash -1489958921, now seen corresponding path program 2 times [2018-11-23 13:04:33,947 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:04:33,947 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:04:33,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:04:33,948 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:04:33,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:04:33,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:04:34,169 INFO L256 TraceCheckUtils]: 0: Hoare triple {1559#true} call ULTIMATE.init(); {1559#true} is VALID [2018-11-23 13:04:34,169 INFO L273 TraceCheckUtils]: 1: Hoare triple {1559#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1559#true} is VALID [2018-11-23 13:04:34,169 INFO L273 TraceCheckUtils]: 2: Hoare triple {1559#true} assume true; {1559#true} is VALID [2018-11-23 13:04:34,169 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1559#true} {1559#true} #107#return; {1559#true} is VALID [2018-11-23 13:04:34,170 INFO L256 TraceCheckUtils]: 4: Hoare triple {1559#true} call #t~ret15 := main(); {1559#true} is VALID [2018-11-23 13:04:34,170 INFO L273 TraceCheckUtils]: 5: Hoare triple {1559#true} call ~#string_A~0.base, ~#string_A~0.offset := #Ultimate.alloc(5);call ~#string_B~0.base, ~#string_B~0.offset := #Ultimate.alloc(5);havoc ~i~0;havoc ~j~0;havoc ~nc_A~0;havoc ~nc_B~0;~found~0 := 0;~i~0 := 0; {1561#(= main_~i~0 0)} is VALID [2018-11-23 13:04:34,171 INFO L273 TraceCheckUtils]: 6: Hoare triple {1561#(= main_~i~0 0)} assume !!(~i~0 < 5);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#string_A~0.base, ~#string_A~0.offset + ~i~0, 1);havoc #t~nondet2; {1561#(= main_~i~0 0)} is VALID [2018-11-23 13:04:34,177 INFO L273 TraceCheckUtils]: 7: Hoare triple {1561#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1562#(<= main_~i~0 1)} is VALID [2018-11-23 13:04:34,177 INFO L273 TraceCheckUtils]: 8: Hoare triple {1562#(<= main_~i~0 1)} assume !!(~i~0 < 5);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#string_A~0.base, ~#string_A~0.offset + ~i~0, 1);havoc #t~nondet2; {1562#(<= main_~i~0 1)} is VALID [2018-11-23 13:04:34,179 INFO L273 TraceCheckUtils]: 9: Hoare triple {1562#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1563#(<= main_~i~0 2)} is VALID [2018-11-23 13:04:34,179 INFO L273 TraceCheckUtils]: 10: Hoare triple {1563#(<= main_~i~0 2)} assume !!(~i~0 < 5);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#string_A~0.base, ~#string_A~0.offset + ~i~0, 1);havoc #t~nondet2; {1563#(<= main_~i~0 2)} is VALID [2018-11-23 13:04:34,183 INFO L273 TraceCheckUtils]: 11: Hoare triple {1563#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1564#(<= main_~i~0 3)} is VALID [2018-11-23 13:04:34,186 INFO L273 TraceCheckUtils]: 12: Hoare triple {1564#(<= main_~i~0 3)} assume !!(~i~0 < 5);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#string_A~0.base, ~#string_A~0.offset + ~i~0, 1);havoc #t~nondet2; {1564#(<= main_~i~0 3)} is VALID [2018-11-23 13:04:34,190 INFO L273 TraceCheckUtils]: 13: Hoare triple {1564#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1565#(<= main_~i~0 4)} is VALID [2018-11-23 13:04:34,191 INFO L273 TraceCheckUtils]: 14: Hoare triple {1565#(<= main_~i~0 4)} assume !(~i~0 < 5); {1560#false} is VALID [2018-11-23 13:04:34,191 INFO L273 TraceCheckUtils]: 15: Hoare triple {1560#false} call #t~mem3 := read~int(~#string_A~0.base, 4 + ~#string_A~0.offset, 1); {1560#false} is VALID [2018-11-23 13:04:34,192 INFO L273 TraceCheckUtils]: 16: Hoare triple {1560#false} assume !!(0 == #t~mem3);havoc #t~mem3;~i~0 := 0; {1560#false} is VALID [2018-11-23 13:04:34,192 INFO L273 TraceCheckUtils]: 17: Hoare triple {1560#false} assume !!(~i~0 < 5);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#string_B~0.base, ~#string_B~0.offset + ~i~0, 1);havoc #t~nondet5; {1560#false} is VALID [2018-11-23 13:04:34,192 INFO L273 TraceCheckUtils]: 18: Hoare triple {1560#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1560#false} is VALID [2018-11-23 13:04:34,193 INFO L273 TraceCheckUtils]: 19: Hoare triple {1560#false} assume !!(~i~0 < 5);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#string_B~0.base, ~#string_B~0.offset + ~i~0, 1);havoc #t~nondet5; {1560#false} is VALID [2018-11-23 13:04:34,193 INFO L273 TraceCheckUtils]: 20: Hoare triple {1560#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1560#false} is VALID [2018-11-23 13:04:34,193 INFO L273 TraceCheckUtils]: 21: Hoare triple {1560#false} assume !!(~i~0 < 5);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#string_B~0.base, ~#string_B~0.offset + ~i~0, 1);havoc #t~nondet5; {1560#false} is VALID [2018-11-23 13:04:34,194 INFO L273 TraceCheckUtils]: 22: Hoare triple {1560#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1560#false} is VALID [2018-11-23 13:04:34,194 INFO L273 TraceCheckUtils]: 23: Hoare triple {1560#false} assume !!(~i~0 < 5);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#string_B~0.base, ~#string_B~0.offset + ~i~0, 1);havoc #t~nondet5; {1560#false} is VALID [2018-11-23 13:04:34,194 INFO L273 TraceCheckUtils]: 24: Hoare triple {1560#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1560#false} is VALID [2018-11-23 13:04:34,194 INFO L273 TraceCheckUtils]: 25: Hoare triple {1560#false} assume !(~i~0 < 5); {1560#false} is VALID [2018-11-23 13:04:34,194 INFO L273 TraceCheckUtils]: 26: Hoare triple {1560#false} call #t~mem6 := read~int(~#string_B~0.base, 4 + ~#string_B~0.offset, 1); {1560#false} is VALID [2018-11-23 13:04:34,195 INFO L273 TraceCheckUtils]: 27: Hoare triple {1560#false} assume !!(0 == #t~mem6);havoc #t~mem6;~nc_A~0 := 0; {1560#false} is VALID [2018-11-23 13:04:34,195 INFO L273 TraceCheckUtils]: 28: Hoare triple {1560#false} call #t~mem7 := read~int(~#string_A~0.base, ~#string_A~0.offset + ~nc_A~0, 1); {1560#false} is VALID [2018-11-23 13:04:34,195 INFO L273 TraceCheckUtils]: 29: Hoare triple {1560#false} assume !(0 != #t~mem7);havoc #t~mem7; {1560#false} is VALID [2018-11-23 13:04:34,195 INFO L273 TraceCheckUtils]: 30: Hoare triple {1560#false} ~nc_B~0 := 0; {1560#false} is VALID [2018-11-23 13:04:34,195 INFO L273 TraceCheckUtils]: 31: Hoare triple {1560#false} call #t~mem9 := read~int(~#string_B~0.base, ~#string_B~0.offset + ~nc_B~0, 1); {1560#false} is VALID [2018-11-23 13:04:34,196 INFO L273 TraceCheckUtils]: 32: Hoare triple {1560#false} assume !!(0 != #t~mem9);havoc #t~mem9;#t~post10 := ~nc_B~0;~nc_B~0 := 1 + #t~post10;havoc #t~post10; {1560#false} is VALID [2018-11-23 13:04:34,196 INFO L273 TraceCheckUtils]: 33: Hoare triple {1560#false} call #t~mem9 := read~int(~#string_B~0.base, ~#string_B~0.offset + ~nc_B~0, 1); {1560#false} is VALID [2018-11-23 13:04:34,196 INFO L273 TraceCheckUtils]: 34: Hoare triple {1560#false} assume !(0 != #t~mem9);havoc #t~mem9; {1560#false} is VALID [2018-11-23 13:04:34,196 INFO L273 TraceCheckUtils]: 35: Hoare triple {1560#false} assume !!(~nc_B~0 >= ~nc_A~0);~j~0 := 0;~i~0 := ~j~0; {1560#false} is VALID [2018-11-23 13:04:34,197 INFO L273 TraceCheckUtils]: 36: Hoare triple {1560#false} assume !(~i~0 < ~nc_A~0 && ~j~0 < ~nc_B~0); {1560#false} is VALID [2018-11-23 13:04:34,197 INFO L273 TraceCheckUtils]: 37: Hoare triple {1560#false} ~found~0 := (if ~j~0 > ~nc_B~0 - 1 then 1 else 0); {1560#false} is VALID [2018-11-23 13:04:34,197 INFO L256 TraceCheckUtils]: 38: Hoare triple {1560#false} call __VERIFIER_assert((if 0 == ~found~0 || 1 == ~found~0 then 1 else 0)); {1560#false} is VALID [2018-11-23 13:04:34,198 INFO L273 TraceCheckUtils]: 39: Hoare triple {1560#false} ~cond := #in~cond; {1560#false} is VALID [2018-11-23 13:04:34,198 INFO L273 TraceCheckUtils]: 40: Hoare triple {1560#false} assume 0 == ~cond; {1560#false} is VALID [2018-11-23 13:04:34,198 INFO L273 TraceCheckUtils]: 41: Hoare triple {1560#false} assume !false; {1560#false} is VALID [2018-11-23 13:04:34,200 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-23 13:04:34,201 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:04:34,201 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:04:34,215 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 13:04:34,246 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-11-23 13:04:34,246 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:04:34,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:04:34,281 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:04:34,426 INFO L256 TraceCheckUtils]: 0: Hoare triple {1559#true} call ULTIMATE.init(); {1559#true} is VALID [2018-11-23 13:04:34,426 INFO L273 TraceCheckUtils]: 1: Hoare triple {1559#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1559#true} is VALID [2018-11-23 13:04:34,426 INFO L273 TraceCheckUtils]: 2: Hoare triple {1559#true} assume true; {1559#true} is VALID [2018-11-23 13:04:34,427 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1559#true} {1559#true} #107#return; {1559#true} is VALID [2018-11-23 13:04:34,427 INFO L256 TraceCheckUtils]: 4: Hoare triple {1559#true} call #t~ret15 := main(); {1559#true} is VALID [2018-11-23 13:04:34,427 INFO L273 TraceCheckUtils]: 5: Hoare triple {1559#true} call ~#string_A~0.base, ~#string_A~0.offset := #Ultimate.alloc(5);call ~#string_B~0.base, ~#string_B~0.offset := #Ultimate.alloc(5);havoc ~i~0;havoc ~j~0;havoc ~nc_A~0;havoc ~nc_B~0;~found~0 := 0;~i~0 := 0; {1559#true} is VALID [2018-11-23 13:04:34,428 INFO L273 TraceCheckUtils]: 6: Hoare triple {1559#true} assume !!(~i~0 < 5);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#string_A~0.base, ~#string_A~0.offset + ~i~0, 1);havoc #t~nondet2; {1559#true} is VALID [2018-11-23 13:04:34,428 INFO L273 TraceCheckUtils]: 7: Hoare triple {1559#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1559#true} is VALID [2018-11-23 13:04:34,428 INFO L273 TraceCheckUtils]: 8: Hoare triple {1559#true} assume !!(~i~0 < 5);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#string_A~0.base, ~#string_A~0.offset + ~i~0, 1);havoc #t~nondet2; {1559#true} is VALID [2018-11-23 13:04:34,429 INFO L273 TraceCheckUtils]: 9: Hoare triple {1559#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1559#true} is VALID [2018-11-23 13:04:34,429 INFO L273 TraceCheckUtils]: 10: Hoare triple {1559#true} assume !!(~i~0 < 5);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#string_A~0.base, ~#string_A~0.offset + ~i~0, 1);havoc #t~nondet2; {1559#true} is VALID [2018-11-23 13:04:34,429 INFO L273 TraceCheckUtils]: 11: Hoare triple {1559#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1559#true} is VALID [2018-11-23 13:04:34,429 INFO L273 TraceCheckUtils]: 12: Hoare triple {1559#true} assume !!(~i~0 < 5);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#string_A~0.base, ~#string_A~0.offset + ~i~0, 1);havoc #t~nondet2; {1559#true} is VALID [2018-11-23 13:04:34,430 INFO L273 TraceCheckUtils]: 13: Hoare triple {1559#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1559#true} is VALID [2018-11-23 13:04:34,430 INFO L273 TraceCheckUtils]: 14: Hoare triple {1559#true} assume !(~i~0 < 5); {1559#true} is VALID [2018-11-23 13:04:34,430 INFO L273 TraceCheckUtils]: 15: Hoare triple {1559#true} call #t~mem3 := read~int(~#string_A~0.base, 4 + ~#string_A~0.offset, 1); {1559#true} is VALID [2018-11-23 13:04:34,431 INFO L273 TraceCheckUtils]: 16: Hoare triple {1559#true} assume !!(0 == #t~mem3);havoc #t~mem3;~i~0 := 0; {1559#true} is VALID [2018-11-23 13:04:34,431 INFO L273 TraceCheckUtils]: 17: Hoare triple {1559#true} assume !!(~i~0 < 5);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#string_B~0.base, ~#string_B~0.offset + ~i~0, 1);havoc #t~nondet5; {1559#true} is VALID [2018-11-23 13:04:34,431 INFO L273 TraceCheckUtils]: 18: Hoare triple {1559#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1559#true} is VALID [2018-11-23 13:04:34,431 INFO L273 TraceCheckUtils]: 19: Hoare triple {1559#true} assume !!(~i~0 < 5);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#string_B~0.base, ~#string_B~0.offset + ~i~0, 1);havoc #t~nondet5; {1559#true} is VALID [2018-11-23 13:04:34,432 INFO L273 TraceCheckUtils]: 20: Hoare triple {1559#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1559#true} is VALID [2018-11-23 13:04:34,432 INFO L273 TraceCheckUtils]: 21: Hoare triple {1559#true} assume !!(~i~0 < 5);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#string_B~0.base, ~#string_B~0.offset + ~i~0, 1);havoc #t~nondet5; {1559#true} is VALID [2018-11-23 13:04:34,432 INFO L273 TraceCheckUtils]: 22: Hoare triple {1559#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1559#true} is VALID [2018-11-23 13:04:34,432 INFO L273 TraceCheckUtils]: 23: Hoare triple {1559#true} assume !!(~i~0 < 5);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#string_B~0.base, ~#string_B~0.offset + ~i~0, 1);havoc #t~nondet5; {1559#true} is VALID [2018-11-23 13:04:34,433 INFO L273 TraceCheckUtils]: 24: Hoare triple {1559#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1559#true} is VALID [2018-11-23 13:04:34,433 INFO L273 TraceCheckUtils]: 25: Hoare triple {1559#true} assume !(~i~0 < 5); {1559#true} is VALID [2018-11-23 13:04:34,433 INFO L273 TraceCheckUtils]: 26: Hoare triple {1559#true} call #t~mem6 := read~int(~#string_B~0.base, 4 + ~#string_B~0.offset, 1); {1559#true} is VALID [2018-11-23 13:04:34,433 INFO L273 TraceCheckUtils]: 27: Hoare triple {1559#true} assume !!(0 == #t~mem6);havoc #t~mem6;~nc_A~0 := 0; {1559#true} is VALID [2018-11-23 13:04:34,434 INFO L273 TraceCheckUtils]: 28: Hoare triple {1559#true} call #t~mem7 := read~int(~#string_A~0.base, ~#string_A~0.offset + ~nc_A~0, 1); {1559#true} is VALID [2018-11-23 13:04:34,434 INFO L273 TraceCheckUtils]: 29: Hoare triple {1559#true} assume !(0 != #t~mem7);havoc #t~mem7; {1559#true} is VALID [2018-11-23 13:04:34,434 INFO L273 TraceCheckUtils]: 30: Hoare triple {1559#true} ~nc_B~0 := 0; {1559#true} is VALID [2018-11-23 13:04:34,434 INFO L273 TraceCheckUtils]: 31: Hoare triple {1559#true} call #t~mem9 := read~int(~#string_B~0.base, ~#string_B~0.offset + ~nc_B~0, 1); {1559#true} is VALID [2018-11-23 13:04:34,435 INFO L273 TraceCheckUtils]: 32: Hoare triple {1559#true} assume !!(0 != #t~mem9);havoc #t~mem9;#t~post10 := ~nc_B~0;~nc_B~0 := 1 + #t~post10;havoc #t~post10; {1559#true} is VALID [2018-11-23 13:04:34,435 INFO L273 TraceCheckUtils]: 33: Hoare triple {1559#true} call #t~mem9 := read~int(~#string_B~0.base, ~#string_B~0.offset + ~nc_B~0, 1); {1559#true} is VALID [2018-11-23 13:04:34,435 INFO L273 TraceCheckUtils]: 34: Hoare triple {1559#true} assume !(0 != #t~mem9);havoc #t~mem9; {1559#true} is VALID [2018-11-23 13:04:34,435 INFO L273 TraceCheckUtils]: 35: Hoare triple {1559#true} assume !!(~nc_B~0 >= ~nc_A~0);~j~0 := 0;~i~0 := ~j~0; {1559#true} is VALID [2018-11-23 13:04:34,436 INFO L273 TraceCheckUtils]: 36: Hoare triple {1559#true} assume !(~i~0 < ~nc_A~0 && ~j~0 < ~nc_B~0); {1559#true} is VALID [2018-11-23 13:04:34,437 INFO L273 TraceCheckUtils]: 37: Hoare triple {1559#true} ~found~0 := (if ~j~0 > ~nc_B~0 - 1 then 1 else 0); {1680#(or (= 0 main_~found~0) (= 1 main_~found~0))} is VALID [2018-11-23 13:04:34,438 INFO L256 TraceCheckUtils]: 38: Hoare triple {1680#(or (= 0 main_~found~0) (= 1 main_~found~0))} call __VERIFIER_assert((if 0 == ~found~0 || 1 == ~found~0 then 1 else 0)); {1684#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 13:04:34,440 INFO L273 TraceCheckUtils]: 39: Hoare triple {1684#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {1688#(= 1 __VERIFIER_assert_~cond)} is VALID [2018-11-23 13:04:34,441 INFO L273 TraceCheckUtils]: 40: Hoare triple {1688#(= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1560#false} is VALID [2018-11-23 13:04:34,441 INFO L273 TraceCheckUtils]: 41: Hoare triple {1560#false} assume !false; {1560#false} is VALID [2018-11-23 13:04:34,443 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2018-11-23 13:04:34,462 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-23 13:04:34,462 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 10 [2018-11-23 13:04:34,463 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 42 [2018-11-23 13:04:34,463 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:04:34,463 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2018-11-23 13:04:34,585 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:04:34,586 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-23 13:04:34,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 13:04:34,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-11-23 13:04:34,587 INFO L87 Difference]: Start difference. First operand 44 states and 49 transitions. Second operand 10 states. [2018-11-23 13:04:34,758 WARN L180 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-11-23 13:04:35,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:04:35,813 INFO L93 Difference]: Finished difference Result 95 states and 117 transitions. [2018-11-23 13:04:35,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 13:04:35,813 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 42 [2018-11-23 13:04:35,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:04:35,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 13:04:35,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 106 transitions. [2018-11-23 13:04:35,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 13:04:35,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 106 transitions. [2018-11-23 13:04:35,819 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 106 transitions. [2018-11-23 13:04:36,119 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 106 edges. 106 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:04:36,120 INFO L225 Difference]: With dead ends: 95 [2018-11-23 13:04:36,120 INFO L226 Difference]: Without dead ends: 0 [2018-11-23 13:04:36,121 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2018-11-23 13:04:36,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-23 13:04:36,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-23 13:04:36,122 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:04:36,122 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2018-11-23 13:04:36,122 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-23 13:04:36,122 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-23 13:04:36,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:04:36,123 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-23 13:04:36,123 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 13:04:36,123 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:04:36,123 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:04:36,123 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-23 13:04:36,123 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-23 13:04:36,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:04:36,124 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-23 13:04:36,124 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 13:04:36,124 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:04:36,124 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:04:36,124 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:04:36,124 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:04:36,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-23 13:04:36,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-23 13:04:36,124 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 42 [2018-11-23 13:04:36,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:04:36,125 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 13:04:36,125 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-23 13:04:36,125 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 13:04:36,125 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:04:36,129 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-23 13:04:36,306 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-23 13:04:36,307 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2018-11-23 13:04:36,307 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-23 13:04:36,307 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-23 13:04:36,307 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-23 13:04:36,307 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-23 13:04:36,307 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-23 13:04:36,307 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 14 58) no Hoare annotation was computed. [2018-11-23 13:04:36,307 INFO L448 ceAbstractionStarter]: For program point L23-2(lines 23 24) no Hoare annotation was computed. [2018-11-23 13:04:36,307 INFO L444 ceAbstractionStarter]: At program point L23-3(lines 23 24) the Hoare annotation is: (or (= 0 main_~found~0) (= 1 main_~found~0)) [2018-11-23 13:04:36,307 INFO L448 ceAbstractionStarter]: For program point L23-4(lines 23 24) no Hoare annotation was computed. [2018-11-23 13:04:36,307 INFO L448 ceAbstractionStarter]: For program point L19-2(lines 19 20) no Hoare annotation was computed. [2018-11-23 13:04:36,307 INFO L444 ceAbstractionStarter]: At program point L19-3(lines 19 20) the Hoare annotation is: (or (= 0 main_~found~0) (= 1 main_~found~0)) [2018-11-23 13:04:36,308 INFO L448 ceAbstractionStarter]: For program point L19-4(lines 19 20) no Hoare annotation was computed. [2018-11-23 13:04:36,308 INFO L448 ceAbstractionStarter]: For program point L32-1(lines 32 33) no Hoare annotation was computed. [2018-11-23 13:04:36,308 INFO L444 ceAbstractionStarter]: At program point L32-3(lines 32 33) the Hoare annotation is: (or (= 0 main_~found~0) (= 1 main_~found~0)) [2018-11-23 13:04:36,308 INFO L448 ceAbstractionStarter]: For program point L32-4(lines 15 58) no Hoare annotation was computed. [2018-11-23 13:04:36,308 INFO L448 ceAbstractionStarter]: For program point L28-1(lines 28 29) no Hoare annotation was computed. [2018-11-23 13:04:36,308 INFO L444 ceAbstractionStarter]: At program point L28-3(lines 28 29) the Hoare annotation is: (or (= 0 main_~found~0) (= 1 main_~found~0)) [2018-11-23 13:04:36,308 INFO L448 ceAbstractionStarter]: For program point L28-4(lines 28 29) no Hoare annotation was computed. [2018-11-23 13:04:36,308 INFO L448 ceAbstractionStarter]: For program point L41(lines 41 50) no Hoare annotation was computed. [2018-11-23 13:04:36,309 INFO L444 ceAbstractionStarter]: At program point L41-2(lines 39 51) the Hoare annotation is: (or (= 0 main_~found~0) (and (<= 0 main_~j~0) (<= main_~nc_B~0 0) (= main_~i~0 0)) (= 1 main_~found~0)) [2018-11-23 13:04:36,309 INFO L448 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2018-11-23 13:04:36,309 INFO L448 ceAbstractionStarter]: For program point L21(line 21) no Hoare annotation was computed. [2018-11-23 13:04:36,309 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 14 58) no Hoare annotation was computed. [2018-11-23 13:04:36,309 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 14 58) the Hoare annotation is: true [2018-11-23 13:04:36,309 INFO L444 ceAbstractionStarter]: At program point L55(line 55) the Hoare annotation is: (or (= 0 main_~found~0) (= 1 main_~found~0)) [2018-11-23 13:04:36,309 INFO L448 ceAbstractionStarter]: For program point L55-1(line 55) no Hoare annotation was computed. [2018-11-23 13:04:36,309 INFO L448 ceAbstractionStarter]: For program point L39-2(lines 39 51) no Hoare annotation was computed. [2018-11-23 13:04:36,310 INFO L451 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 4 9) the Hoare annotation is: true [2018-11-23 13:04:36,310 INFO L448 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 4 9) no Hoare annotation was computed. [2018-11-23 13:04:36,310 INFO L448 ceAbstractionStarter]: For program point L6(line 6) no Hoare annotation was computed. [2018-11-23 13:04:36,310 INFO L448 ceAbstractionStarter]: For program point L5(lines 5 7) no Hoare annotation was computed. [2018-11-23 13:04:36,310 INFO L448 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 6) no Hoare annotation was computed. [2018-11-23 13:04:36,310 INFO L448 ceAbstractionStarter]: For program point L5-2(lines 4 9) no Hoare annotation was computed. [2018-11-23 13:04:36,312 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2018-11-23 13:04:36,316 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2018-11-23 13:04:36,316 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2018-11-23 13:04:36,316 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-23 13:04:36,316 WARN L170 areAnnotationChecker]: L19-4 has no Hoare annotation [2018-11-23 13:04:36,316 WARN L170 areAnnotationChecker]: L19-4 has no Hoare annotation [2018-11-23 13:04:36,316 WARN L170 areAnnotationChecker]: L19-2 has no Hoare annotation [2018-11-23 13:04:36,316 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2018-11-23 13:04:36,316 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2018-11-23 13:04:36,316 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-23 13:04:36,316 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-23 13:04:36,316 WARN L170 areAnnotationChecker]: L19-4 has no Hoare annotation [2018-11-23 13:04:36,317 WARN L170 areAnnotationChecker]: L19-2 has no Hoare annotation [2018-11-23 13:04:36,317 WARN L170 areAnnotationChecker]: L6 has no Hoare annotation [2018-11-23 13:04:36,317 WARN L170 areAnnotationChecker]: L6 has no Hoare annotation [2018-11-23 13:04:36,317 WARN L170 areAnnotationChecker]: L5-2 has no Hoare annotation [2018-11-23 13:04:36,317 WARN L170 areAnnotationChecker]: L21 has no Hoare annotation [2018-11-23 13:04:36,317 WARN L170 areAnnotationChecker]: L21 has no Hoare annotation [2018-11-23 13:04:36,317 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2018-11-23 13:04:36,317 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-23 13:04:36,317 WARN L170 areAnnotationChecker]: L23-4 has no Hoare annotation [2018-11-23 13:04:36,317 WARN L170 areAnnotationChecker]: L23-4 has no Hoare annotation [2018-11-23 13:04:36,317 WARN L170 areAnnotationChecker]: L23-2 has no Hoare annotation [2018-11-23 13:04:36,317 WARN L170 areAnnotationChecker]: L55-1 has no Hoare annotation [2018-11-23 13:04:36,317 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2018-11-23 13:04:36,318 WARN L170 areAnnotationChecker]: L23-4 has no Hoare annotation [2018-11-23 13:04:36,318 WARN L170 areAnnotationChecker]: L23-2 has no Hoare annotation [2018-11-23 13:04:36,318 WARN L170 areAnnotationChecker]: L25 has no Hoare annotation [2018-11-23 13:04:36,318 WARN L170 areAnnotationChecker]: L25 has no Hoare annotation [2018-11-23 13:04:36,318 WARN L170 areAnnotationChecker]: L28-4 has no Hoare annotation [2018-11-23 13:04:36,318 WARN L170 areAnnotationChecker]: L28-1 has no Hoare annotation [2018-11-23 13:04:36,318 WARN L170 areAnnotationChecker]: L28-4 has no Hoare annotation [2018-11-23 13:04:36,318 WARN L170 areAnnotationChecker]: L28-1 has no Hoare annotation [2018-11-23 13:04:36,318 WARN L170 areAnnotationChecker]: L28-1 has no Hoare annotation [2018-11-23 13:04:36,318 WARN L170 areAnnotationChecker]: L32-4 has no Hoare annotation [2018-11-23 13:04:36,318 WARN L170 areAnnotationChecker]: L32-1 has no Hoare annotation [2018-11-23 13:04:36,319 WARN L170 areAnnotationChecker]: L32-4 has no Hoare annotation [2018-11-23 13:04:36,319 WARN L170 areAnnotationChecker]: L32-4 has no Hoare annotation [2018-11-23 13:04:36,319 WARN L170 areAnnotationChecker]: L32-1 has no Hoare annotation [2018-11-23 13:04:36,319 WARN L170 areAnnotationChecker]: L32-1 has no Hoare annotation [2018-11-23 13:04:36,319 WARN L170 areAnnotationChecker]: L39-2 has no Hoare annotation [2018-11-23 13:04:36,319 WARN L170 areAnnotationChecker]: L39-2 has no Hoare annotation [2018-11-23 13:04:36,319 WARN L170 areAnnotationChecker]: L41 has no Hoare annotation [2018-11-23 13:04:36,319 WARN L170 areAnnotationChecker]: L39-2 has no Hoare annotation [2018-11-23 13:04:36,319 WARN L170 areAnnotationChecker]: L41 has no Hoare annotation [2018-11-23 13:04:36,319 WARN L170 areAnnotationChecker]: L41 has no Hoare annotation [2018-11-23 13:04:36,319 WARN L170 areAnnotationChecker]: L55-1 has no Hoare annotation [2018-11-23 13:04:36,319 INFO L163 areAnnotationChecker]: CFG has 4 edges. 4 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2018-11-23 13:04:36,330 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 01:04:36 BoogieIcfgContainer [2018-11-23 13:04:36,330 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 13:04:36,330 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 13:04:36,330 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 13:04:36,331 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 13:04:36,331 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:04:28" (3/4) ... [2018-11-23 13:04:36,335 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-23 13:04:36,342 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-23 13:04:36,343 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-23 13:04:36,343 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2018-11-23 13:04:36,349 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 24 nodes and edges [2018-11-23 13:04:36,349 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2018-11-23 13:04:36,349 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2018-11-23 13:04:36,350 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-23 13:04:36,427 INFO L145 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/loops/string_true-unreach-call_true-termination.i-witness.graphml [2018-11-23 13:04:36,427 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 13:04:36,429 INFO L168 Benchmark]: Toolchain (without parser) took 9677.30 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 859.8 MB). Free memory was 1.4 GB in the beginning and 2.3 GB in the end (delta: -858.4 MB). Peak memory consumption was 1.5 MB. Max. memory is 7.1 GB. [2018-11-23 13:04:36,430 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 13:04:36,430 INFO L168 Benchmark]: CACSL2BoogieTranslator took 353.10 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-11-23 13:04:36,430 INFO L168 Benchmark]: Boogie Procedure Inliner took 30.70 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 13:04:36,431 INFO L168 Benchmark]: Boogie Preprocessor took 54.74 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 13:04:36,431 INFO L168 Benchmark]: RCFGBuilder took 1044.09 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 734.5 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -768.5 MB). Peak memory consumption was 15.0 MB. Max. memory is 7.1 GB. [2018-11-23 13:04:36,432 INFO L168 Benchmark]: TraceAbstraction took 8091.82 ms. Allocated memory was 2.3 GB in the beginning and 2.4 GB in the end (delta: 125.3 MB). Free memory was 2.2 GB in the beginning and 2.3 GB in the end (delta: -114.9 MB). Peak memory consumption was 10.4 MB. Max. memory is 7.1 GB. [2018-11-23 13:04:36,434 INFO L168 Benchmark]: Witness Printer took 96.98 ms. Allocated memory is still 2.4 GB. Free memory was 2.3 GB in the beginning and 2.3 GB in the end (delta: 14.5 MB). Peak memory consumption was 14.5 MB. Max. memory is 7.1 GB. [2018-11-23 13:04:36,438 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - GenericResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 353.10 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 30.70 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 54.74 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 1044.09 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 734.5 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -768.5 MB). Peak memory consumption was 15.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 8091.82 ms. Allocated memory was 2.3 GB in the beginning and 2.4 GB in the end (delta: 125.3 MB). Free memory was 2.2 GB in the beginning and 2.3 GB in the end (delta: -114.9 MB). Peak memory consumption was 10.4 MB. Max. memory is 7.1 GB. * Witness Printer took 96.98 ms. Allocated memory is still 2.4 GB. Free memory was 2.3 GB in the beginning and 2.3 GB in the end (delta: 14.5 MB). Peak memory consumption was 14.5 MB. Max. memory is 7.1 GB. * 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 Derived loop invariant: (0 == found || ((0 <= j && nc_B <= 0) && i == 0)) || 1 == found - InvariantResult [Line: 32]: Loop Invariant Derived loop invariant: 0 == found || 1 == found - InvariantResult [Line: 28]: Loop Invariant Derived loop invariant: 0 == found || 1 == found - InvariantResult [Line: 23]: Loop Invariant Derived loop invariant: 0 == found || 1 == found - InvariantResult [Line: 19]: Loop Invariant Derived loop invariant: 0 == found || 1 == found - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 35 locations, 1 error locations. SAFE Result, 8.0s OverallTime, 6 OverallIterations, 4 TraceHistogramMax, 4.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 160 SDtfs, 125 SDslu, 389 SDs, 0 SdLazy, 305 SolverSat, 62 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 177 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=44occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 6 MinimizatonAttempts, 48 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 11 LocationsWithAnnotation, 23 PreInvPairs, 51 NumberOfFragments, 57 HoareAnnotationTreeSize, 23 FomulaSimplifications, 244 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 11 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 326 NumberOfCodeBlocks, 300 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 316 ConstructedInterpolants, 0 QuantifiedInterpolants, 14058 SizeOfPredicates, 10 NumberOfNonLiveVariables, 389 ConjunctsInSsa, 26 ConjunctsInUnsatCore, 10 InterpolantComputations, 4 PerfectInterpolantSequences, 88/128 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...