/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loops/string-2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-267fbe0 [2020-07-17 22:50:22,361 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-17 22:50:22,363 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-17 22:50:22,377 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-17 22:50:22,377 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-17 22:50:22,379 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-17 22:50:22,380 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-17 22:50:22,382 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-17 22:50:22,384 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-17 22:50:22,385 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-17 22:50:22,386 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-17 22:50:22,387 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-17 22:50:22,388 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-17 22:50:22,389 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-17 22:50:22,390 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-17 22:50:22,391 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-17 22:50:22,392 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-17 22:50:22,393 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-17 22:50:22,395 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-17 22:50:22,397 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-17 22:50:22,398 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-17 22:50:22,399 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-17 22:50:22,401 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-17 22:50:22,401 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-17 22:50:22,404 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-17 22:50:22,404 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-17 22:50:22,404 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-17 22:50:22,405 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-17 22:50:22,406 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-17 22:50:22,407 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-17 22:50:22,407 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-17 22:50:22,408 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-17 22:50:22,409 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-17 22:50:22,410 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-17 22:50:22,411 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-17 22:50:22,411 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-17 22:50:22,412 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-17 22:50:22,412 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-17 22:50:22,412 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-17 22:50:22,413 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-17 22:50:22,414 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-17 22:50:22,415 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-07-17 22:50:22,430 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-17 22:50:22,430 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-17 22:50:22,431 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-17 22:50:22,432 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-17 22:50:22,432 INFO L138 SettingsManager]: * Use SBE=true [2020-07-17 22:50:22,432 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-17 22:50:22,432 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-17 22:50:22,432 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-17 22:50:22,433 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-17 22:50:22,433 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-17 22:50:22,433 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-17 22:50:22,433 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-17 22:50:22,433 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-17 22:50:22,434 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-17 22:50:22,434 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-17 22:50:22,434 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-17 22:50:22,434 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-17 22:50:22,434 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-17 22:50:22,435 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-17 22:50:22,435 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-17 22:50:22,435 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-17 22:50:22,435 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-17 22:50:22,436 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-17 22:50:22,436 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-17 22:50:22,436 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-17 22:50:22,436 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-17 22:50:22,436 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-17 22:50:22,437 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-17 22:50:22,437 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-17 22:50:22,437 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-17 22:50:22,736 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-17 22:50:22,748 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-17 22:50:22,751 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-17 22:50:22,753 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-17 22:50:22,753 INFO L275 PluginConnector]: CDTParser initialized [2020-07-17 22:50:22,754 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/string-2.i [2020-07-17 22:50:22,845 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/82c8745a7/b724f597806640e8a9af5f43960bd92c/FLAGa56d3a53d [2020-07-17 22:50:23,339 INFO L306 CDTParser]: Found 1 translation units. [2020-07-17 22:50:23,340 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/string-2.i [2020-07-17 22:50:23,346 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/82c8745a7/b724f597806640e8a9af5f43960bd92c/FLAGa56d3a53d [2020-07-17 22:50:23,830 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/82c8745a7/b724f597806640e8a9af5f43960bd92c [2020-07-17 22:50:23,845 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-17 22:50:23,850 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-17 22:50:23,851 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-17 22:50:23,851 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-17 22:50:23,855 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-17 22:50:23,857 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.07 10:50:23" (1/1) ... [2020-07-17 22:50:23,860 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@df6c900 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:50:23, skipping insertion in model container [2020-07-17 22:50:23,861 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.07 10:50:23" (1/1) ... [2020-07-17 22:50:23,870 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-17 22:50:23,891 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-17 22:50:24,125 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-17 22:50:24,131 INFO L203 MainTranslator]: Completed pre-run [2020-07-17 22:50:24,161 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-17 22:50:24,277 INFO L208 MainTranslator]: Completed translation [2020-07-17 22:50:24,277 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:50:24 WrapperNode [2020-07-17 22:50:24,277 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-17 22:50:24,278 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-17 22:50:24,278 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-17 22:50:24,279 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-17 22:50:24,294 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:50:24" (1/1) ... [2020-07-17 22:50:24,296 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:50:24" (1/1) ... [2020-07-17 22:50:24,322 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:50:24" (1/1) ... [2020-07-17 22:50:24,323 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:50:24" (1/1) ... [2020-07-17 22:50:24,353 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:50:24" (1/1) ... [2020-07-17 22:50:24,361 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:50:24" (1/1) ... [2020-07-17 22:50:24,363 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:50:24" (1/1) ... [2020-07-17 22:50:24,366 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-17 22:50:24,367 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-17 22:50:24,367 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-17 22:50:24,367 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-17 22:50:24,369 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:50:24" (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 [2020-07-17 22:50:24,432 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-17 22:50:24,432 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-17 22:50:24,432 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-07-17 22:50:24,432 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-17 22:50:24,433 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-17 22:50:24,434 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-17 22:50:24,434 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-17 22:50:24,434 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-07-17 22:50:24,434 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-17 22:50:24,434 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2020-07-17 22:50:24,435 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-17 22:50:24,435 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-17 22:50:24,435 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-17 22:50:24,436 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-17 22:50:24,436 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-17 22:50:24,437 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-17 22:50:24,437 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-17 22:50:24,939 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-17 22:50:24,939 INFO L295 CfgBuilder]: Removed 5 assume(true) statements. [2020-07-17 22:50:24,944 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.07 10:50:24 BoogieIcfgContainer [2020-07-17 22:50:24,944 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-17 22:50:24,945 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-17 22:50:24,945 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-17 22:50:24,949 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-17 22:50:24,949 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.07 10:50:23" (1/3) ... [2020-07-17 22:50:24,950 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28a455c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.07 10:50:24, skipping insertion in model container [2020-07-17 22:50:24,950 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:50:24" (2/3) ... [2020-07-17 22:50:24,951 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28a455c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.07 10:50:24, skipping insertion in model container [2020-07-17 22:50:24,951 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.07 10:50:24" (3/3) ... [2020-07-17 22:50:24,953 INFO L109 eAbstractionObserver]: Analyzing ICFG string-2.i [2020-07-17 22:50:24,964 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-17 22:50:24,972 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-17 22:50:24,988 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-17 22:50:25,012 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-17 22:50:25,012 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-17 22:50:25,012 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-17 22:50:25,012 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-17 22:50:25,013 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-17 22:50:25,013 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-17 22:50:25,013 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-17 22:50:25,013 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-17 22:50:25,032 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states. [2020-07-17 22:50:25,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-07-17 22:50:25,038 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:50:25,039 INFO L422 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] [2020-07-17 22:50:25,040 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:50:25,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:50:25,046 INFO L82 PathProgramCache]: Analyzing trace with hash -522531256, now seen corresponding path program 1 times [2020-07-17 22:50:25,054 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:50:25,055 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674763197] [2020-07-17 22:50:25,055 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:50:25,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:50:25,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:50:25,298 INFO L280 TraceCheckUtils]: 0: Hoare triple {44#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {38#true} is VALID [2020-07-17 22:50:25,299 INFO L280 TraceCheckUtils]: 1: Hoare triple {38#true} assume true; {38#true} is VALID [2020-07-17 22:50:25,299 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {38#true} {38#true} #115#return; {38#true} is VALID [2020-07-17 22:50:25,304 INFO L263 TraceCheckUtils]: 0: Hoare triple {38#true} call ULTIMATE.init(); {44#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-17 22:50:25,305 INFO L280 TraceCheckUtils]: 1: Hoare triple {44#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {38#true} is VALID [2020-07-17 22:50:25,305 INFO L280 TraceCheckUtils]: 2: Hoare triple {38#true} assume true; {38#true} is VALID [2020-07-17 22:50:25,306 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {38#true} {38#true} #115#return; {38#true} is VALID [2020-07-17 22:50:25,306 INFO L263 TraceCheckUtils]: 4: Hoare triple {38#true} call #t~ret14 := main(); {38#true} is VALID [2020-07-17 22:50:25,308 INFO L280 TraceCheckUtils]: 5: Hoare triple {38#true} call ~#string_A~0.base, ~#string_A~0.offset := #Ultimate.allocOnStack(5);call ~#string_B~0.base, ~#string_B~0.offset := #Ultimate.allocOnStack(5);havoc ~i~0;havoc ~j~0;havoc ~nc_A~0;havoc ~nc_B~0;~found~0 := 0;~i~0 := 0; {43#(= 0 main_~i~0)} is VALID [2020-07-17 22:50:25,310 INFO L280 TraceCheckUtils]: 6: Hoare triple {43#(= 0 main_~i~0)} assume !(~i~0 < 5); {39#false} is VALID [2020-07-17 22:50:25,310 INFO L280 TraceCheckUtils]: 7: Hoare triple {39#false} call #t~mem2 := read~int(~#string_A~0.base, 4 + ~#string_A~0.offset, 1); {39#false} is VALID [2020-07-17 22:50:25,311 INFO L280 TraceCheckUtils]: 8: Hoare triple {39#false} assume !!(0 == #t~mem2);havoc #t~mem2;~i~0 := 0; {39#false} is VALID [2020-07-17 22:50:25,311 INFO L280 TraceCheckUtils]: 9: Hoare triple {39#false} assume !(~i~0 < 5); {39#false} is VALID [2020-07-17 22:50:25,311 INFO L280 TraceCheckUtils]: 10: Hoare triple {39#false} call #t~mem5 := read~int(~#string_B~0.base, 4 + ~#string_B~0.offset, 1); {39#false} is VALID [2020-07-17 22:50:25,312 INFO L280 TraceCheckUtils]: 11: Hoare triple {39#false} assume !!(0 == #t~mem5);havoc #t~mem5;~nc_A~0 := 0; {39#false} is VALID [2020-07-17 22:50:25,312 INFO L280 TraceCheckUtils]: 12: Hoare triple {39#false} assume !true; {39#false} is VALID [2020-07-17 22:50:25,313 INFO L280 TraceCheckUtils]: 13: Hoare triple {39#false} ~nc_B~0 := 0; {39#false} is VALID [2020-07-17 22:50:25,313 INFO L280 TraceCheckUtils]: 14: Hoare triple {39#false} assume !true; {39#false} is VALID [2020-07-17 22:50:25,314 INFO L280 TraceCheckUtils]: 15: Hoare triple {39#false} assume !!(~nc_B~0 >= ~nc_A~0);~j~0 := 0;~i~0 := ~j~0; {39#false} is VALID [2020-07-17 22:50:25,314 INFO L280 TraceCheckUtils]: 16: Hoare triple {39#false} assume !true; {39#false} is VALID [2020-07-17 22:50:25,315 INFO L280 TraceCheckUtils]: 17: Hoare triple {39#false} ~found~0 := ~shiftLeft((if ~j~0 > ~nc_B~0 - 1 then 1 else 0), ~i~0); {39#false} is VALID [2020-07-17 22:50:25,315 INFO L263 TraceCheckUtils]: 18: Hoare triple {39#false} call __VERIFIER_assert((if 0 == ~found~0 || 1 == ~found~0 then 1 else 0)); {39#false} is VALID [2020-07-17 22:50:25,315 INFO L280 TraceCheckUtils]: 19: Hoare triple {39#false} ~cond := #in~cond; {39#false} is VALID [2020-07-17 22:50:25,316 INFO L280 TraceCheckUtils]: 20: Hoare triple {39#false} assume 0 == ~cond; {39#false} is VALID [2020-07-17 22:50:25,316 INFO L280 TraceCheckUtils]: 21: Hoare triple {39#false} assume !false; {39#false} is VALID [2020-07-17 22:50:25,320 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:50:25,321 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674763197] [2020-07-17 22:50:25,322 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:50:25,322 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-17 22:50:25,323 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306480176] [2020-07-17 22:50:25,331 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2020-07-17 22:50:25,335 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:50:25,339 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-17 22:50:25,386 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:50:25,387 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-17 22:50:25,387 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:50:25,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-17 22:50:25,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-17 22:50:25,401 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 4 states. [2020-07-17 22:50:25,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:50:25,800 INFO L93 Difference]: Finished difference Result 73 states and 109 transitions. [2020-07-17 22:50:25,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-17 22:50:25,801 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2020-07-17 22:50:25,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:50:25,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-17 22:50:25,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 109 transitions. [2020-07-17 22:50:25,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-17 22:50:25,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 109 transitions. [2020-07-17 22:50:25,823 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 109 transitions. [2020-07-17 22:50:25,953 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 109 edges. 109 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:50:25,967 INFO L225 Difference]: With dead ends: 73 [2020-07-17 22:50:25,968 INFO L226 Difference]: Without dead ends: 36 [2020-07-17 22:50:25,972 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-17 22:50:25,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2020-07-17 22:50:26,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 30. [2020-07-17 22:50:26,026 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:50:26,027 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand 30 states. [2020-07-17 22:50:26,027 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 30 states. [2020-07-17 22:50:26,028 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 30 states. [2020-07-17 22:50:26,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:50:26,033 INFO L93 Difference]: Finished difference Result 36 states and 43 transitions. [2020-07-17 22:50:26,034 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 43 transitions. [2020-07-17 22:50:26,034 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:50:26,035 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:50:26,035 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 36 states. [2020-07-17 22:50:26,035 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 36 states. [2020-07-17 22:50:26,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:50:26,040 INFO L93 Difference]: Finished difference Result 36 states and 43 transitions. [2020-07-17 22:50:26,040 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 43 transitions. [2020-07-17 22:50:26,041 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:50:26,041 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:50:26,041 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:50:26,041 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:50:26,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-07-17 22:50:26,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 35 transitions. [2020-07-17 22:50:26,046 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 35 transitions. Word has length 22 [2020-07-17 22:50:26,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:50:26,046 INFO L479 AbstractCegarLoop]: Abstraction has 30 states and 35 transitions. [2020-07-17 22:50:26,046 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-17 22:50:26,047 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2020-07-17 22:50:26,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-07-17 22:50:26,048 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:50:26,048 INFO L422 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] [2020-07-17 22:50:26,049 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-17 22:50:26,049 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:50:26,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:50:26,049 INFO L82 PathProgramCache]: Analyzing trace with hash -1816798436, now seen corresponding path program 1 times [2020-07-17 22:50:26,050 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:50:26,050 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007198897] [2020-07-17 22:50:26,050 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:50:26,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:50:26,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:50:26,131 INFO L280 TraceCheckUtils]: 0: Hoare triple {263#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {256#true} is VALID [2020-07-17 22:50:26,132 INFO L280 TraceCheckUtils]: 1: Hoare triple {256#true} assume true; {256#true} is VALID [2020-07-17 22:50:26,132 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {256#true} {256#true} #115#return; {256#true} is VALID [2020-07-17 22:50:26,133 INFO L263 TraceCheckUtils]: 0: Hoare triple {256#true} call ULTIMATE.init(); {263#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-17 22:50:26,133 INFO L280 TraceCheckUtils]: 1: Hoare triple {263#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {256#true} is VALID [2020-07-17 22:50:26,134 INFO L280 TraceCheckUtils]: 2: Hoare triple {256#true} assume true; {256#true} is VALID [2020-07-17 22:50:26,134 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {256#true} {256#true} #115#return; {256#true} is VALID [2020-07-17 22:50:26,134 INFO L263 TraceCheckUtils]: 4: Hoare triple {256#true} call #t~ret14 := main(); {256#true} is VALID [2020-07-17 22:50:26,135 INFO L280 TraceCheckUtils]: 5: Hoare triple {256#true} call ~#string_A~0.base, ~#string_A~0.offset := #Ultimate.allocOnStack(5);call ~#string_B~0.base, ~#string_B~0.offset := #Ultimate.allocOnStack(5);havoc ~i~0;havoc ~j~0;havoc ~nc_A~0;havoc ~nc_B~0;~found~0 := 0;~i~0 := 0; {261#(= 0 main_~i~0)} is VALID [2020-07-17 22:50:26,136 INFO L280 TraceCheckUtils]: 6: Hoare triple {261#(= 0 main_~i~0)} assume !!(~i~0 < 5);assume -128 <= #t~nondet1 && #t~nondet1 <= 127;call write~int(#t~nondet1, ~#string_A~0.base, ~#string_A~0.offset + ~i~0, 1);havoc #t~nondet1; {261#(= 0 main_~i~0)} is VALID [2020-07-17 22:50:26,137 INFO L280 TraceCheckUtils]: 7: Hoare triple {261#(= 0 main_~i~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {262#(<= main_~i~0 1)} is VALID [2020-07-17 22:50:26,138 INFO L280 TraceCheckUtils]: 8: Hoare triple {262#(<= main_~i~0 1)} assume !(~i~0 < 5); {257#false} is VALID [2020-07-17 22:50:26,138 INFO L280 TraceCheckUtils]: 9: Hoare triple {257#false} call #t~mem2 := read~int(~#string_A~0.base, 4 + ~#string_A~0.offset, 1); {257#false} is VALID [2020-07-17 22:50:26,139 INFO L280 TraceCheckUtils]: 10: Hoare triple {257#false} assume !!(0 == #t~mem2);havoc #t~mem2;~i~0 := 0; {257#false} is VALID [2020-07-17 22:50:26,139 INFO L280 TraceCheckUtils]: 11: Hoare triple {257#false} assume !!(~i~0 < 5);assume -128 <= #t~nondet4 && #t~nondet4 <= 127;call write~int(#t~nondet4, ~#string_B~0.base, ~#string_B~0.offset + ~i~0, 1);havoc #t~nondet4; {257#false} is VALID [2020-07-17 22:50:26,139 INFO L280 TraceCheckUtils]: 12: Hoare triple {257#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {257#false} is VALID [2020-07-17 22:50:26,140 INFO L280 TraceCheckUtils]: 13: Hoare triple {257#false} assume !(~i~0 < 5); {257#false} is VALID [2020-07-17 22:50:26,140 INFO L280 TraceCheckUtils]: 14: Hoare triple {257#false} call #t~mem5 := read~int(~#string_B~0.base, 4 + ~#string_B~0.offset, 1); {257#false} is VALID [2020-07-17 22:50:26,140 INFO L280 TraceCheckUtils]: 15: Hoare triple {257#false} assume !!(0 == #t~mem5);havoc #t~mem5;~nc_A~0 := 0; {257#false} is VALID [2020-07-17 22:50:26,140 INFO L280 TraceCheckUtils]: 16: Hoare triple {257#false} call #t~mem6 := read~int(~#string_A~0.base, ~#string_A~0.offset + ~nc_A~0, 1); {257#false} is VALID [2020-07-17 22:50:26,141 INFO L280 TraceCheckUtils]: 17: Hoare triple {257#false} assume !(0 != #t~mem6);havoc #t~mem6; {257#false} is VALID [2020-07-17 22:50:26,141 INFO L280 TraceCheckUtils]: 18: Hoare triple {257#false} ~nc_B~0 := 0; {257#false} is VALID [2020-07-17 22:50:26,141 INFO L280 TraceCheckUtils]: 19: Hoare triple {257#false} call #t~mem8 := read~int(~#string_B~0.base, ~#string_B~0.offset + ~nc_B~0, 1); {257#false} is VALID [2020-07-17 22:50:26,142 INFO L280 TraceCheckUtils]: 20: Hoare triple {257#false} assume !(0 != #t~mem8);havoc #t~mem8; {257#false} is VALID [2020-07-17 22:50:26,142 INFO L280 TraceCheckUtils]: 21: Hoare triple {257#false} assume !!(~nc_B~0 >= ~nc_A~0);~j~0 := 0;~i~0 := ~j~0; {257#false} is VALID [2020-07-17 22:50:26,142 INFO L280 TraceCheckUtils]: 22: Hoare triple {257#false} assume !(~i~0 < ~nc_A~0 && ~j~0 < ~nc_B~0); {257#false} is VALID [2020-07-17 22:50:26,143 INFO L280 TraceCheckUtils]: 23: Hoare triple {257#false} ~found~0 := ~shiftLeft((if ~j~0 > ~nc_B~0 - 1 then 1 else 0), ~i~0); {257#false} is VALID [2020-07-17 22:50:26,143 INFO L263 TraceCheckUtils]: 24: Hoare triple {257#false} call __VERIFIER_assert((if 0 == ~found~0 || 1 == ~found~0 then 1 else 0)); {257#false} is VALID [2020-07-17 22:50:26,143 INFO L280 TraceCheckUtils]: 25: Hoare triple {257#false} ~cond := #in~cond; {257#false} is VALID [2020-07-17 22:50:26,144 INFO L280 TraceCheckUtils]: 26: Hoare triple {257#false} assume 0 == ~cond; {257#false} is VALID [2020-07-17 22:50:26,144 INFO L280 TraceCheckUtils]: 27: Hoare triple {257#false} assume !false; {257#false} is VALID [2020-07-17 22:50:26,147 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-17 22:50:26,148 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007198897] [2020-07-17 22:50:26,148 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1408149470] [2020-07-17 22:50:26,148 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:50:26,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:50:26,218 INFO L264 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-17 22:50:26,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:50:26,237 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:50:26,324 INFO L263 TraceCheckUtils]: 0: Hoare triple {256#true} call ULTIMATE.init(); {256#true} is VALID [2020-07-17 22:50:26,325 INFO L280 TraceCheckUtils]: 1: Hoare triple {256#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {256#true} is VALID [2020-07-17 22:50:26,325 INFO L280 TraceCheckUtils]: 2: Hoare triple {256#true} assume true; {256#true} is VALID [2020-07-17 22:50:26,325 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {256#true} {256#true} #115#return; {256#true} is VALID [2020-07-17 22:50:26,326 INFO L263 TraceCheckUtils]: 4: Hoare triple {256#true} call #t~ret14 := main(); {256#true} is VALID [2020-07-17 22:50:26,328 INFO L280 TraceCheckUtils]: 5: Hoare triple {256#true} call ~#string_A~0.base, ~#string_A~0.offset := #Ultimate.allocOnStack(5);call ~#string_B~0.base, ~#string_B~0.offset := #Ultimate.allocOnStack(5);havoc ~i~0;havoc ~j~0;havoc ~nc_A~0;havoc ~nc_B~0;~found~0 := 0;~i~0 := 0; {282#(<= main_~i~0 0)} is VALID [2020-07-17 22:50:26,328 INFO L280 TraceCheckUtils]: 6: Hoare triple {282#(<= main_~i~0 0)} assume !!(~i~0 < 5);assume -128 <= #t~nondet1 && #t~nondet1 <= 127;call write~int(#t~nondet1, ~#string_A~0.base, ~#string_A~0.offset + ~i~0, 1);havoc #t~nondet1; {282#(<= main_~i~0 0)} is VALID [2020-07-17 22:50:26,330 INFO L280 TraceCheckUtils]: 7: Hoare triple {282#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {262#(<= main_~i~0 1)} is VALID [2020-07-17 22:50:26,331 INFO L280 TraceCheckUtils]: 8: Hoare triple {262#(<= main_~i~0 1)} assume !(~i~0 < 5); {257#false} is VALID [2020-07-17 22:50:26,331 INFO L280 TraceCheckUtils]: 9: Hoare triple {257#false} call #t~mem2 := read~int(~#string_A~0.base, 4 + ~#string_A~0.offset, 1); {257#false} is VALID [2020-07-17 22:50:26,331 INFO L280 TraceCheckUtils]: 10: Hoare triple {257#false} assume !!(0 == #t~mem2);havoc #t~mem2;~i~0 := 0; {257#false} is VALID [2020-07-17 22:50:26,332 INFO L280 TraceCheckUtils]: 11: Hoare triple {257#false} assume !!(~i~0 < 5);assume -128 <= #t~nondet4 && #t~nondet4 <= 127;call write~int(#t~nondet4, ~#string_B~0.base, ~#string_B~0.offset + ~i~0, 1);havoc #t~nondet4; {257#false} is VALID [2020-07-17 22:50:26,332 INFO L280 TraceCheckUtils]: 12: Hoare triple {257#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {257#false} is VALID [2020-07-17 22:50:26,332 INFO L280 TraceCheckUtils]: 13: Hoare triple {257#false} assume !(~i~0 < 5); {257#false} is VALID [2020-07-17 22:50:26,333 INFO L280 TraceCheckUtils]: 14: Hoare triple {257#false} call #t~mem5 := read~int(~#string_B~0.base, 4 + ~#string_B~0.offset, 1); {257#false} is VALID [2020-07-17 22:50:26,333 INFO L280 TraceCheckUtils]: 15: Hoare triple {257#false} assume !!(0 == #t~mem5);havoc #t~mem5;~nc_A~0 := 0; {257#false} is VALID [2020-07-17 22:50:26,333 INFO L280 TraceCheckUtils]: 16: Hoare triple {257#false} call #t~mem6 := read~int(~#string_A~0.base, ~#string_A~0.offset + ~nc_A~0, 1); {257#false} is VALID [2020-07-17 22:50:26,334 INFO L280 TraceCheckUtils]: 17: Hoare triple {257#false} assume !(0 != #t~mem6);havoc #t~mem6; {257#false} is VALID [2020-07-17 22:50:26,334 INFO L280 TraceCheckUtils]: 18: Hoare triple {257#false} ~nc_B~0 := 0; {257#false} is VALID [2020-07-17 22:50:26,334 INFO L280 TraceCheckUtils]: 19: Hoare triple {257#false} call #t~mem8 := read~int(~#string_B~0.base, ~#string_B~0.offset + ~nc_B~0, 1); {257#false} is VALID [2020-07-17 22:50:26,334 INFO L280 TraceCheckUtils]: 20: Hoare triple {257#false} assume !(0 != #t~mem8);havoc #t~mem8; {257#false} is VALID [2020-07-17 22:50:26,335 INFO L280 TraceCheckUtils]: 21: Hoare triple {257#false} assume !!(~nc_B~0 >= ~nc_A~0);~j~0 := 0;~i~0 := ~j~0; {257#false} is VALID [2020-07-17 22:50:26,335 INFO L280 TraceCheckUtils]: 22: Hoare triple {257#false} assume !(~i~0 < ~nc_A~0 && ~j~0 < ~nc_B~0); {257#false} is VALID [2020-07-17 22:50:26,335 INFO L280 TraceCheckUtils]: 23: Hoare triple {257#false} ~found~0 := ~shiftLeft((if ~j~0 > ~nc_B~0 - 1 then 1 else 0), ~i~0); {257#false} is VALID [2020-07-17 22:50:26,336 INFO L263 TraceCheckUtils]: 24: Hoare triple {257#false} call __VERIFIER_assert((if 0 == ~found~0 || 1 == ~found~0 then 1 else 0)); {257#false} is VALID [2020-07-17 22:50:26,336 INFO L280 TraceCheckUtils]: 25: Hoare triple {257#false} ~cond := #in~cond; {257#false} is VALID [2020-07-17 22:50:26,336 INFO L280 TraceCheckUtils]: 26: Hoare triple {257#false} assume 0 == ~cond; {257#false} is VALID [2020-07-17 22:50:26,337 INFO L280 TraceCheckUtils]: 27: Hoare triple {257#false} assume !false; {257#false} is VALID [2020-07-17 22:50:26,338 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-17 22:50:26,339 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-17 22:50:26,339 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 6 [2020-07-17 22:50:26,340 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066185036] [2020-07-17 22:50:26,341 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2020-07-17 22:50:26,342 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:50:26,343 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-17 22:50:26,382 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:50:26,383 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-17 22:50:26,383 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:50:26,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-17 22:50:26,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-07-17 22:50:26,384 INFO L87 Difference]: Start difference. First operand 30 states and 35 transitions. Second operand 6 states. [2020-07-17 22:50:26,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:50:26,713 INFO L93 Difference]: Finished difference Result 65 states and 80 transitions. [2020-07-17 22:50:26,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-17 22:50:26,714 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2020-07-17 22:50:26,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:50:26,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-17 22:50:26,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 79 transitions. [2020-07-17 22:50:26,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-17 22:50:26,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 79 transitions. [2020-07-17 22:50:26,733 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 79 transitions. [2020-07-17 22:50:26,874 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:50:26,878 INFO L225 Difference]: With dead ends: 65 [2020-07-17 22:50:26,878 INFO L226 Difference]: Without dead ends: 44 [2020-07-17 22:50:26,880 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-07-17 22:50:26,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2020-07-17 22:50:26,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 34. [2020-07-17 22:50:26,908 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:50:26,909 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand 34 states. [2020-07-17 22:50:26,909 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 34 states. [2020-07-17 22:50:26,909 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 34 states. [2020-07-17 22:50:26,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:50:26,915 INFO L93 Difference]: Finished difference Result 44 states and 53 transitions. [2020-07-17 22:50:26,915 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 53 transitions. [2020-07-17 22:50:26,916 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:50:26,916 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:50:26,916 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 44 states. [2020-07-17 22:50:26,917 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 44 states. [2020-07-17 22:50:26,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:50:26,926 INFO L93 Difference]: Finished difference Result 44 states and 53 transitions. [2020-07-17 22:50:26,927 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 53 transitions. [2020-07-17 22:50:26,928 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:50:26,928 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:50:26,928 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:50:26,928 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:50:26,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2020-07-17 22:50:26,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 39 transitions. [2020-07-17 22:50:26,932 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 39 transitions. Word has length 28 [2020-07-17 22:50:26,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:50:26,932 INFO L479 AbstractCegarLoop]: Abstraction has 34 states and 39 transitions. [2020-07-17 22:50:26,936 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-17 22:50:26,936 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 39 transitions. [2020-07-17 22:50:26,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2020-07-17 22:50:26,937 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:50:26,939 INFO L422 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] [2020-07-17 22:50:27,153 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2020-07-17 22:50:27,153 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:50:27,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:50:27,154 INFO L82 PathProgramCache]: Analyzing trace with hash 1067646812, now seen corresponding path program 2 times [2020-07-17 22:50:27,154 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:50:27,155 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396978368] [2020-07-17 22:50:27,155 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:50:27,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:50:27,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:50:27,271 INFO L280 TraceCheckUtils]: 0: Hoare triple {584#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {576#true} is VALID [2020-07-17 22:50:27,271 INFO L280 TraceCheckUtils]: 1: Hoare triple {576#true} assume true; {576#true} is VALID [2020-07-17 22:50:27,271 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {576#true} {576#true} #115#return; {576#true} is VALID [2020-07-17 22:50:27,273 INFO L263 TraceCheckUtils]: 0: Hoare triple {576#true} call ULTIMATE.init(); {584#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-17 22:50:27,273 INFO L280 TraceCheckUtils]: 1: Hoare triple {584#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {576#true} is VALID [2020-07-17 22:50:27,273 INFO L280 TraceCheckUtils]: 2: Hoare triple {576#true} assume true; {576#true} is VALID [2020-07-17 22:50:27,274 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {576#true} {576#true} #115#return; {576#true} is VALID [2020-07-17 22:50:27,274 INFO L263 TraceCheckUtils]: 4: Hoare triple {576#true} call #t~ret14 := main(); {576#true} is VALID [2020-07-17 22:50:27,275 INFO L280 TraceCheckUtils]: 5: Hoare triple {576#true} call ~#string_A~0.base, ~#string_A~0.offset := #Ultimate.allocOnStack(5);call ~#string_B~0.base, ~#string_B~0.offset := #Ultimate.allocOnStack(5);havoc ~i~0;havoc ~j~0;havoc ~nc_A~0;havoc ~nc_B~0;~found~0 := 0;~i~0 := 0; {581#(= 0 main_~i~0)} is VALID [2020-07-17 22:50:27,276 INFO L280 TraceCheckUtils]: 6: Hoare triple {581#(= 0 main_~i~0)} assume !!(~i~0 < 5);assume -128 <= #t~nondet1 && #t~nondet1 <= 127;call write~int(#t~nondet1, ~#string_A~0.base, ~#string_A~0.offset + ~i~0, 1);havoc #t~nondet1; {581#(= 0 main_~i~0)} is VALID [2020-07-17 22:50:27,277 INFO L280 TraceCheckUtils]: 7: Hoare triple {581#(= 0 main_~i~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {582#(<= main_~i~0 1)} is VALID [2020-07-17 22:50:27,277 INFO L280 TraceCheckUtils]: 8: Hoare triple {582#(<= main_~i~0 1)} assume !!(~i~0 < 5);assume -128 <= #t~nondet1 && #t~nondet1 <= 127;call write~int(#t~nondet1, ~#string_A~0.base, ~#string_A~0.offset + ~i~0, 1);havoc #t~nondet1; {582#(<= main_~i~0 1)} is VALID [2020-07-17 22:50:27,278 INFO L280 TraceCheckUtils]: 9: Hoare triple {582#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {583#(<= main_~i~0 2)} is VALID [2020-07-17 22:50:27,279 INFO L280 TraceCheckUtils]: 10: Hoare triple {583#(<= main_~i~0 2)} assume !(~i~0 < 5); {577#false} is VALID [2020-07-17 22:50:27,279 INFO L280 TraceCheckUtils]: 11: Hoare triple {577#false} call #t~mem2 := read~int(~#string_A~0.base, 4 + ~#string_A~0.offset, 1); {577#false} is VALID [2020-07-17 22:50:27,280 INFO L280 TraceCheckUtils]: 12: Hoare triple {577#false} assume !!(0 == #t~mem2);havoc #t~mem2;~i~0 := 0; {577#false} is VALID [2020-07-17 22:50:27,280 INFO L280 TraceCheckUtils]: 13: Hoare triple {577#false} assume !!(~i~0 < 5);assume -128 <= #t~nondet4 && #t~nondet4 <= 127;call write~int(#t~nondet4, ~#string_B~0.base, ~#string_B~0.offset + ~i~0, 1);havoc #t~nondet4; {577#false} is VALID [2020-07-17 22:50:27,280 INFO L280 TraceCheckUtils]: 14: Hoare triple {577#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {577#false} is VALID [2020-07-17 22:50:27,280 INFO L280 TraceCheckUtils]: 15: Hoare triple {577#false} assume !!(~i~0 < 5);assume -128 <= #t~nondet4 && #t~nondet4 <= 127;call write~int(#t~nondet4, ~#string_B~0.base, ~#string_B~0.offset + ~i~0, 1);havoc #t~nondet4; {577#false} is VALID [2020-07-17 22:50:27,281 INFO L280 TraceCheckUtils]: 16: Hoare triple {577#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {577#false} is VALID [2020-07-17 22:50:27,281 INFO L280 TraceCheckUtils]: 17: Hoare triple {577#false} assume !(~i~0 < 5); {577#false} is VALID [2020-07-17 22:50:27,281 INFO L280 TraceCheckUtils]: 18: Hoare triple {577#false} call #t~mem5 := read~int(~#string_B~0.base, 4 + ~#string_B~0.offset, 1); {577#false} is VALID [2020-07-17 22:50:27,282 INFO L280 TraceCheckUtils]: 19: Hoare triple {577#false} assume !!(0 == #t~mem5);havoc #t~mem5;~nc_A~0 := 0; {577#false} is VALID [2020-07-17 22:50:27,282 INFO L280 TraceCheckUtils]: 20: Hoare triple {577#false} call #t~mem6 := read~int(~#string_A~0.base, ~#string_A~0.offset + ~nc_A~0, 1); {577#false} is VALID [2020-07-17 22:50:27,282 INFO L280 TraceCheckUtils]: 21: Hoare triple {577#false} assume !(0 != #t~mem6);havoc #t~mem6; {577#false} is VALID [2020-07-17 22:50:27,283 INFO L280 TraceCheckUtils]: 22: Hoare triple {577#false} ~nc_B~0 := 0; {577#false} is VALID [2020-07-17 22:50:27,283 INFO L280 TraceCheckUtils]: 23: Hoare triple {577#false} call #t~mem8 := read~int(~#string_B~0.base, ~#string_B~0.offset + ~nc_B~0, 1); {577#false} is VALID [2020-07-17 22:50:27,283 INFO L280 TraceCheckUtils]: 24: Hoare triple {577#false} assume !(0 != #t~mem8);havoc #t~mem8; {577#false} is VALID [2020-07-17 22:50:27,283 INFO L280 TraceCheckUtils]: 25: Hoare triple {577#false} assume !!(~nc_B~0 >= ~nc_A~0);~j~0 := 0;~i~0 := ~j~0; {577#false} is VALID [2020-07-17 22:50:27,284 INFO L280 TraceCheckUtils]: 26: Hoare triple {577#false} assume !(~i~0 < ~nc_A~0 && ~j~0 < ~nc_B~0); {577#false} is VALID [2020-07-17 22:50:27,284 INFO L280 TraceCheckUtils]: 27: Hoare triple {577#false} ~found~0 := ~shiftLeft((if ~j~0 > ~nc_B~0 - 1 then 1 else 0), ~i~0); {577#false} is VALID [2020-07-17 22:50:27,284 INFO L263 TraceCheckUtils]: 28: Hoare triple {577#false} call __VERIFIER_assert((if 0 == ~found~0 || 1 == ~found~0 then 1 else 0)); {577#false} is VALID [2020-07-17 22:50:27,284 INFO L280 TraceCheckUtils]: 29: Hoare triple {577#false} ~cond := #in~cond; {577#false} is VALID [2020-07-17 22:50:27,285 INFO L280 TraceCheckUtils]: 30: Hoare triple {577#false} assume 0 == ~cond; {577#false} is VALID [2020-07-17 22:50:27,285 INFO L280 TraceCheckUtils]: 31: Hoare triple {577#false} assume !false; {577#false} is VALID [2020-07-17 22:50:27,287 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-07-17 22:50:27,287 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396978368] [2020-07-17 22:50:27,287 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [678082851] [2020-07-17 22:50:27,288 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:50:27,332 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-17 22:50:27,333 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-17 22:50:27,334 INFO L264 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-17 22:50:27,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:50:27,348 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:50:27,407 INFO L263 TraceCheckUtils]: 0: Hoare triple {576#true} call ULTIMATE.init(); {576#true} is VALID [2020-07-17 22:50:27,407 INFO L280 TraceCheckUtils]: 1: Hoare triple {576#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {576#true} is VALID [2020-07-17 22:50:27,407 INFO L280 TraceCheckUtils]: 2: Hoare triple {576#true} assume true; {576#true} is VALID [2020-07-17 22:50:27,408 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {576#true} {576#true} #115#return; {576#true} is VALID [2020-07-17 22:50:27,408 INFO L263 TraceCheckUtils]: 4: Hoare triple {576#true} call #t~ret14 := main(); {576#true} is VALID [2020-07-17 22:50:27,409 INFO L280 TraceCheckUtils]: 5: Hoare triple {576#true} call ~#string_A~0.base, ~#string_A~0.offset := #Ultimate.allocOnStack(5);call ~#string_B~0.base, ~#string_B~0.offset := #Ultimate.allocOnStack(5);havoc ~i~0;havoc ~j~0;havoc ~nc_A~0;havoc ~nc_B~0;~found~0 := 0;~i~0 := 0; {603#(<= main_~i~0 0)} is VALID [2020-07-17 22:50:27,410 INFO L280 TraceCheckUtils]: 6: Hoare triple {603#(<= main_~i~0 0)} assume !!(~i~0 < 5);assume -128 <= #t~nondet1 && #t~nondet1 <= 127;call write~int(#t~nondet1, ~#string_A~0.base, ~#string_A~0.offset + ~i~0, 1);havoc #t~nondet1; {603#(<= main_~i~0 0)} is VALID [2020-07-17 22:50:27,411 INFO L280 TraceCheckUtils]: 7: Hoare triple {603#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {582#(<= main_~i~0 1)} is VALID [2020-07-17 22:50:27,412 INFO L280 TraceCheckUtils]: 8: Hoare triple {582#(<= main_~i~0 1)} assume !!(~i~0 < 5);assume -128 <= #t~nondet1 && #t~nondet1 <= 127;call write~int(#t~nondet1, ~#string_A~0.base, ~#string_A~0.offset + ~i~0, 1);havoc #t~nondet1; {582#(<= main_~i~0 1)} is VALID [2020-07-17 22:50:27,413 INFO L280 TraceCheckUtils]: 9: Hoare triple {582#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {583#(<= main_~i~0 2)} is VALID [2020-07-17 22:50:27,414 INFO L280 TraceCheckUtils]: 10: Hoare triple {583#(<= main_~i~0 2)} assume !(~i~0 < 5); {577#false} is VALID [2020-07-17 22:50:27,414 INFO L280 TraceCheckUtils]: 11: Hoare triple {577#false} call #t~mem2 := read~int(~#string_A~0.base, 4 + ~#string_A~0.offset, 1); {577#false} is VALID [2020-07-17 22:50:27,415 INFO L280 TraceCheckUtils]: 12: Hoare triple {577#false} assume !!(0 == #t~mem2);havoc #t~mem2;~i~0 := 0; {577#false} is VALID [2020-07-17 22:50:27,415 INFO L280 TraceCheckUtils]: 13: Hoare triple {577#false} assume !!(~i~0 < 5);assume -128 <= #t~nondet4 && #t~nondet4 <= 127;call write~int(#t~nondet4, ~#string_B~0.base, ~#string_B~0.offset + ~i~0, 1);havoc #t~nondet4; {577#false} is VALID [2020-07-17 22:50:27,415 INFO L280 TraceCheckUtils]: 14: Hoare triple {577#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {577#false} is VALID [2020-07-17 22:50:27,415 INFO L280 TraceCheckUtils]: 15: Hoare triple {577#false} assume !!(~i~0 < 5);assume -128 <= #t~nondet4 && #t~nondet4 <= 127;call write~int(#t~nondet4, ~#string_B~0.base, ~#string_B~0.offset + ~i~0, 1);havoc #t~nondet4; {577#false} is VALID [2020-07-17 22:50:27,416 INFO L280 TraceCheckUtils]: 16: Hoare triple {577#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {577#false} is VALID [2020-07-17 22:50:27,416 INFO L280 TraceCheckUtils]: 17: Hoare triple {577#false} assume !(~i~0 < 5); {577#false} is VALID [2020-07-17 22:50:27,416 INFO L280 TraceCheckUtils]: 18: Hoare triple {577#false} call #t~mem5 := read~int(~#string_B~0.base, 4 + ~#string_B~0.offset, 1); {577#false} is VALID [2020-07-17 22:50:27,416 INFO L280 TraceCheckUtils]: 19: Hoare triple {577#false} assume !!(0 == #t~mem5);havoc #t~mem5;~nc_A~0 := 0; {577#false} is VALID [2020-07-17 22:50:27,417 INFO L280 TraceCheckUtils]: 20: Hoare triple {577#false} call #t~mem6 := read~int(~#string_A~0.base, ~#string_A~0.offset + ~nc_A~0, 1); {577#false} is VALID [2020-07-17 22:50:27,417 INFO L280 TraceCheckUtils]: 21: Hoare triple {577#false} assume !(0 != #t~mem6);havoc #t~mem6; {577#false} is VALID [2020-07-17 22:50:27,417 INFO L280 TraceCheckUtils]: 22: Hoare triple {577#false} ~nc_B~0 := 0; {577#false} is VALID [2020-07-17 22:50:27,418 INFO L280 TraceCheckUtils]: 23: Hoare triple {577#false} call #t~mem8 := read~int(~#string_B~0.base, ~#string_B~0.offset + ~nc_B~0, 1); {577#false} is VALID [2020-07-17 22:50:27,418 INFO L280 TraceCheckUtils]: 24: Hoare triple {577#false} assume !(0 != #t~mem8);havoc #t~mem8; {577#false} is VALID [2020-07-17 22:50:27,418 INFO L280 TraceCheckUtils]: 25: Hoare triple {577#false} assume !!(~nc_B~0 >= ~nc_A~0);~j~0 := 0;~i~0 := ~j~0; {577#false} is VALID [2020-07-17 22:50:27,419 INFO L280 TraceCheckUtils]: 26: Hoare triple {577#false} assume !(~i~0 < ~nc_A~0 && ~j~0 < ~nc_B~0); {577#false} is VALID [2020-07-17 22:50:27,419 INFO L280 TraceCheckUtils]: 27: Hoare triple {577#false} ~found~0 := ~shiftLeft((if ~j~0 > ~nc_B~0 - 1 then 1 else 0), ~i~0); {577#false} is VALID [2020-07-17 22:50:27,419 INFO L263 TraceCheckUtils]: 28: Hoare triple {577#false} call __VERIFIER_assert((if 0 == ~found~0 || 1 == ~found~0 then 1 else 0)); {577#false} is VALID [2020-07-17 22:50:27,419 INFO L280 TraceCheckUtils]: 29: Hoare triple {577#false} ~cond := #in~cond; {577#false} is VALID [2020-07-17 22:50:27,420 INFO L280 TraceCheckUtils]: 30: Hoare triple {577#false} assume 0 == ~cond; {577#false} is VALID [2020-07-17 22:50:27,420 INFO L280 TraceCheckUtils]: 31: Hoare triple {577#false} assume !false; {577#false} is VALID [2020-07-17 22:50:27,421 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-07-17 22:50:27,422 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-17 22:50:27,422 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 7 [2020-07-17 22:50:27,422 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942751204] [2020-07-17 22:50:27,423 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 32 [2020-07-17 22:50:27,424 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:50:27,424 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-17 22:50:27,465 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:50:27,466 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-17 22:50:27,466 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:50:27,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-17 22:50:27,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-07-17 22:50:27,467 INFO L87 Difference]: Start difference. First operand 34 states and 39 transitions. Second operand 7 states. [2020-07-17 22:50:27,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:50:27,771 INFO L93 Difference]: Finished difference Result 75 states and 92 transitions. [2020-07-17 22:50:27,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-17 22:50:27,771 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 32 [2020-07-17 22:50:27,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:50:27,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-17 22:50:27,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 89 transitions. [2020-07-17 22:50:27,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-17 22:50:27,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 89 transitions. [2020-07-17 22:50:27,779 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 89 transitions. [2020-07-17 22:50:27,884 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 89 edges. 89 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:50:27,886 INFO L225 Difference]: With dead ends: 75 [2020-07-17 22:50:27,886 INFO L226 Difference]: Without dead ends: 52 [2020-07-17 22:50:27,887 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-07-17 22:50:27,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2020-07-17 22:50:27,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 38. [2020-07-17 22:50:27,932 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:50:27,932 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand 38 states. [2020-07-17 22:50:27,932 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand 38 states. [2020-07-17 22:50:27,932 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 38 states. [2020-07-17 22:50:27,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:50:27,939 INFO L93 Difference]: Finished difference Result 52 states and 63 transitions. [2020-07-17 22:50:27,939 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 63 transitions. [2020-07-17 22:50:27,940 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:50:27,940 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:50:27,940 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 52 states. [2020-07-17 22:50:27,940 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 52 states. [2020-07-17 22:50:27,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:50:27,944 INFO L93 Difference]: Finished difference Result 52 states and 63 transitions. [2020-07-17 22:50:27,944 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 63 transitions. [2020-07-17 22:50:27,945 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:50:27,945 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:50:27,945 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:50:27,945 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:50:27,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2020-07-17 22:50:27,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 43 transitions. [2020-07-17 22:50:27,947 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 43 transitions. Word has length 32 [2020-07-17 22:50:27,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:50:27,948 INFO L479 AbstractCegarLoop]: Abstraction has 38 states and 43 transitions. [2020-07-17 22:50:27,948 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-17 22:50:27,948 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 43 transitions. [2020-07-17 22:50:27,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-07-17 22:50:27,949 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:50:27,950 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:50:28,162 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:50:28,163 INFO L427 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:50:28,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:50:28,164 INFO L82 PathProgramCache]: Analyzing trace with hash -1245957476, now seen corresponding path program 3 times [2020-07-17 22:50:28,165 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:50:28,165 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710337375] [2020-07-17 22:50:28,166 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:50:28,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:50:28,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:50:28,264 INFO L280 TraceCheckUtils]: 0: Hoare triple {955#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {946#true} is VALID [2020-07-17 22:50:28,265 INFO L280 TraceCheckUtils]: 1: Hoare triple {946#true} assume true; {946#true} is VALID [2020-07-17 22:50:28,265 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {946#true} {946#true} #115#return; {946#true} is VALID [2020-07-17 22:50:28,266 INFO L263 TraceCheckUtils]: 0: Hoare triple {946#true} call ULTIMATE.init(); {955#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-17 22:50:28,266 INFO L280 TraceCheckUtils]: 1: Hoare triple {955#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {946#true} is VALID [2020-07-17 22:50:28,266 INFO L280 TraceCheckUtils]: 2: Hoare triple {946#true} assume true; {946#true} is VALID [2020-07-17 22:50:28,267 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {946#true} {946#true} #115#return; {946#true} is VALID [2020-07-17 22:50:28,267 INFO L263 TraceCheckUtils]: 4: Hoare triple {946#true} call #t~ret14 := main(); {946#true} is VALID [2020-07-17 22:50:28,268 INFO L280 TraceCheckUtils]: 5: Hoare triple {946#true} call ~#string_A~0.base, ~#string_A~0.offset := #Ultimate.allocOnStack(5);call ~#string_B~0.base, ~#string_B~0.offset := #Ultimate.allocOnStack(5);havoc ~i~0;havoc ~j~0;havoc ~nc_A~0;havoc ~nc_B~0;~found~0 := 0;~i~0 := 0; {951#(= 0 main_~i~0)} is VALID [2020-07-17 22:50:28,269 INFO L280 TraceCheckUtils]: 6: Hoare triple {951#(= 0 main_~i~0)} assume !!(~i~0 < 5);assume -128 <= #t~nondet1 && #t~nondet1 <= 127;call write~int(#t~nondet1, ~#string_A~0.base, ~#string_A~0.offset + ~i~0, 1);havoc #t~nondet1; {951#(= 0 main_~i~0)} is VALID [2020-07-17 22:50:28,269 INFO L280 TraceCheckUtils]: 7: Hoare triple {951#(= 0 main_~i~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {952#(<= main_~i~0 1)} is VALID [2020-07-17 22:50:28,270 INFO L280 TraceCheckUtils]: 8: Hoare triple {952#(<= main_~i~0 1)} assume !!(~i~0 < 5);assume -128 <= #t~nondet1 && #t~nondet1 <= 127;call write~int(#t~nondet1, ~#string_A~0.base, ~#string_A~0.offset + ~i~0, 1);havoc #t~nondet1; {952#(<= main_~i~0 1)} is VALID [2020-07-17 22:50:28,271 INFO L280 TraceCheckUtils]: 9: Hoare triple {952#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {953#(<= main_~i~0 2)} is VALID [2020-07-17 22:50:28,272 INFO L280 TraceCheckUtils]: 10: Hoare triple {953#(<= main_~i~0 2)} assume !!(~i~0 < 5);assume -128 <= #t~nondet1 && #t~nondet1 <= 127;call write~int(#t~nondet1, ~#string_A~0.base, ~#string_A~0.offset + ~i~0, 1);havoc #t~nondet1; {953#(<= main_~i~0 2)} is VALID [2020-07-17 22:50:28,272 INFO L280 TraceCheckUtils]: 11: Hoare triple {953#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {954#(<= main_~i~0 3)} is VALID [2020-07-17 22:50:28,273 INFO L280 TraceCheckUtils]: 12: Hoare triple {954#(<= main_~i~0 3)} assume !(~i~0 < 5); {947#false} is VALID [2020-07-17 22:50:28,274 INFO L280 TraceCheckUtils]: 13: Hoare triple {947#false} call #t~mem2 := read~int(~#string_A~0.base, 4 + ~#string_A~0.offset, 1); {947#false} is VALID [2020-07-17 22:50:28,274 INFO L280 TraceCheckUtils]: 14: Hoare triple {947#false} assume !!(0 == #t~mem2);havoc #t~mem2;~i~0 := 0; {947#false} is VALID [2020-07-17 22:50:28,274 INFO L280 TraceCheckUtils]: 15: Hoare triple {947#false} assume !!(~i~0 < 5);assume -128 <= #t~nondet4 && #t~nondet4 <= 127;call write~int(#t~nondet4, ~#string_B~0.base, ~#string_B~0.offset + ~i~0, 1);havoc #t~nondet4; {947#false} is VALID [2020-07-17 22:50:28,274 INFO L280 TraceCheckUtils]: 16: Hoare triple {947#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {947#false} is VALID [2020-07-17 22:50:28,275 INFO L280 TraceCheckUtils]: 17: Hoare triple {947#false} assume !!(~i~0 < 5);assume -128 <= #t~nondet4 && #t~nondet4 <= 127;call write~int(#t~nondet4, ~#string_B~0.base, ~#string_B~0.offset + ~i~0, 1);havoc #t~nondet4; {947#false} is VALID [2020-07-17 22:50:28,275 INFO L280 TraceCheckUtils]: 18: Hoare triple {947#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {947#false} is VALID [2020-07-17 22:50:28,275 INFO L280 TraceCheckUtils]: 19: Hoare triple {947#false} assume !!(~i~0 < 5);assume -128 <= #t~nondet4 && #t~nondet4 <= 127;call write~int(#t~nondet4, ~#string_B~0.base, ~#string_B~0.offset + ~i~0, 1);havoc #t~nondet4; {947#false} is VALID [2020-07-17 22:50:28,275 INFO L280 TraceCheckUtils]: 20: Hoare triple {947#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {947#false} is VALID [2020-07-17 22:50:28,276 INFO L280 TraceCheckUtils]: 21: Hoare triple {947#false} assume !(~i~0 < 5); {947#false} is VALID [2020-07-17 22:50:28,276 INFO L280 TraceCheckUtils]: 22: Hoare triple {947#false} call #t~mem5 := read~int(~#string_B~0.base, 4 + ~#string_B~0.offset, 1); {947#false} is VALID [2020-07-17 22:50:28,276 INFO L280 TraceCheckUtils]: 23: Hoare triple {947#false} assume !!(0 == #t~mem5);havoc #t~mem5;~nc_A~0 := 0; {947#false} is VALID [2020-07-17 22:50:28,276 INFO L280 TraceCheckUtils]: 24: Hoare triple {947#false} call #t~mem6 := read~int(~#string_A~0.base, ~#string_A~0.offset + ~nc_A~0, 1); {947#false} is VALID [2020-07-17 22:50:28,277 INFO L280 TraceCheckUtils]: 25: Hoare triple {947#false} assume !(0 != #t~mem6);havoc #t~mem6; {947#false} is VALID [2020-07-17 22:50:28,277 INFO L280 TraceCheckUtils]: 26: Hoare triple {947#false} ~nc_B~0 := 0; {947#false} is VALID [2020-07-17 22:50:28,277 INFO L280 TraceCheckUtils]: 27: Hoare triple {947#false} call #t~mem8 := read~int(~#string_B~0.base, ~#string_B~0.offset + ~nc_B~0, 1); {947#false} is VALID [2020-07-17 22:50:28,277 INFO L280 TraceCheckUtils]: 28: Hoare triple {947#false} assume !(0 != #t~mem8);havoc #t~mem8; {947#false} is VALID [2020-07-17 22:50:28,278 INFO L280 TraceCheckUtils]: 29: Hoare triple {947#false} assume !!(~nc_B~0 >= ~nc_A~0);~j~0 := 0;~i~0 := ~j~0; {947#false} is VALID [2020-07-17 22:50:28,278 INFO L280 TraceCheckUtils]: 30: Hoare triple {947#false} assume !(~i~0 < ~nc_A~0 && ~j~0 < ~nc_B~0); {947#false} is VALID [2020-07-17 22:50:28,278 INFO L280 TraceCheckUtils]: 31: Hoare triple {947#false} ~found~0 := ~shiftLeft((if ~j~0 > ~nc_B~0 - 1 then 1 else 0), ~i~0); {947#false} is VALID [2020-07-17 22:50:28,278 INFO L263 TraceCheckUtils]: 32: Hoare triple {947#false} call __VERIFIER_assert((if 0 == ~found~0 || 1 == ~found~0 then 1 else 0)); {947#false} is VALID [2020-07-17 22:50:28,279 INFO L280 TraceCheckUtils]: 33: Hoare triple {947#false} ~cond := #in~cond; {947#false} is VALID [2020-07-17 22:50:28,279 INFO L280 TraceCheckUtils]: 34: Hoare triple {947#false} assume 0 == ~cond; {947#false} is VALID [2020-07-17 22:50:28,279 INFO L280 TraceCheckUtils]: 35: Hoare triple {947#false} assume !false; {947#false} is VALID [2020-07-17 22:50:28,280 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2020-07-17 22:50:28,281 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710337375] [2020-07-17 22:50:28,281 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1874005966] [2020-07-17 22:50:28,281 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:50:28,336 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2020-07-17 22:50:28,337 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-17 22:50:28,338 INFO L264 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-17 22:50:28,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:50:28,351 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:50:28,415 INFO L263 TraceCheckUtils]: 0: Hoare triple {946#true} call ULTIMATE.init(); {946#true} is VALID [2020-07-17 22:50:28,416 INFO L280 TraceCheckUtils]: 1: Hoare triple {946#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {946#true} is VALID [2020-07-17 22:50:28,416 INFO L280 TraceCheckUtils]: 2: Hoare triple {946#true} assume true; {946#true} is VALID [2020-07-17 22:50:28,416 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {946#true} {946#true} #115#return; {946#true} is VALID [2020-07-17 22:50:28,416 INFO L263 TraceCheckUtils]: 4: Hoare triple {946#true} call #t~ret14 := main(); {946#true} is VALID [2020-07-17 22:50:28,417 INFO L280 TraceCheckUtils]: 5: Hoare triple {946#true} call ~#string_A~0.base, ~#string_A~0.offset := #Ultimate.allocOnStack(5);call ~#string_B~0.base, ~#string_B~0.offset := #Ultimate.allocOnStack(5);havoc ~i~0;havoc ~j~0;havoc ~nc_A~0;havoc ~nc_B~0;~found~0 := 0;~i~0 := 0; {946#true} is VALID [2020-07-17 22:50:28,417 INFO L280 TraceCheckUtils]: 6: Hoare triple {946#true} assume !!(~i~0 < 5);assume -128 <= #t~nondet1 && #t~nondet1 <= 127;call write~int(#t~nondet1, ~#string_A~0.base, ~#string_A~0.offset + ~i~0, 1);havoc #t~nondet1; {946#true} is VALID [2020-07-17 22:50:28,417 INFO L280 TraceCheckUtils]: 7: Hoare triple {946#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {946#true} is VALID [2020-07-17 22:50:28,418 INFO L280 TraceCheckUtils]: 8: Hoare triple {946#true} assume !!(~i~0 < 5);assume -128 <= #t~nondet1 && #t~nondet1 <= 127;call write~int(#t~nondet1, ~#string_A~0.base, ~#string_A~0.offset + ~i~0, 1);havoc #t~nondet1; {946#true} is VALID [2020-07-17 22:50:28,418 INFO L280 TraceCheckUtils]: 9: Hoare triple {946#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {946#true} is VALID [2020-07-17 22:50:28,418 INFO L280 TraceCheckUtils]: 10: Hoare triple {946#true} assume !!(~i~0 < 5);assume -128 <= #t~nondet1 && #t~nondet1 <= 127;call write~int(#t~nondet1, ~#string_A~0.base, ~#string_A~0.offset + ~i~0, 1);havoc #t~nondet1; {946#true} is VALID [2020-07-17 22:50:28,418 INFO L280 TraceCheckUtils]: 11: Hoare triple {946#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {946#true} is VALID [2020-07-17 22:50:28,419 INFO L280 TraceCheckUtils]: 12: Hoare triple {946#true} assume !(~i~0 < 5); {946#true} is VALID [2020-07-17 22:50:28,419 INFO L280 TraceCheckUtils]: 13: Hoare triple {946#true} call #t~mem2 := read~int(~#string_A~0.base, 4 + ~#string_A~0.offset, 1); {946#true} is VALID [2020-07-17 22:50:28,420 INFO L280 TraceCheckUtils]: 14: Hoare triple {946#true} assume !!(0 == #t~mem2);havoc #t~mem2;~i~0 := 0; {1001#(<= main_~i~0 0)} is VALID [2020-07-17 22:50:28,420 INFO L280 TraceCheckUtils]: 15: Hoare triple {1001#(<= main_~i~0 0)} assume !!(~i~0 < 5);assume -128 <= #t~nondet4 && #t~nondet4 <= 127;call write~int(#t~nondet4, ~#string_B~0.base, ~#string_B~0.offset + ~i~0, 1);havoc #t~nondet4; {1001#(<= main_~i~0 0)} is VALID [2020-07-17 22:50:28,421 INFO L280 TraceCheckUtils]: 16: Hoare triple {1001#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {952#(<= main_~i~0 1)} is VALID [2020-07-17 22:50:28,422 INFO L280 TraceCheckUtils]: 17: Hoare triple {952#(<= main_~i~0 1)} assume !!(~i~0 < 5);assume -128 <= #t~nondet4 && #t~nondet4 <= 127;call write~int(#t~nondet4, ~#string_B~0.base, ~#string_B~0.offset + ~i~0, 1);havoc #t~nondet4; {952#(<= main_~i~0 1)} is VALID [2020-07-17 22:50:28,423 INFO L280 TraceCheckUtils]: 18: Hoare triple {952#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {953#(<= main_~i~0 2)} is VALID [2020-07-17 22:50:28,423 INFO L280 TraceCheckUtils]: 19: Hoare triple {953#(<= main_~i~0 2)} assume !!(~i~0 < 5);assume -128 <= #t~nondet4 && #t~nondet4 <= 127;call write~int(#t~nondet4, ~#string_B~0.base, ~#string_B~0.offset + ~i~0, 1);havoc #t~nondet4; {953#(<= main_~i~0 2)} is VALID [2020-07-17 22:50:28,424 INFO L280 TraceCheckUtils]: 20: Hoare triple {953#(<= main_~i~0 2)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {954#(<= main_~i~0 3)} is VALID [2020-07-17 22:50:28,425 INFO L280 TraceCheckUtils]: 21: Hoare triple {954#(<= main_~i~0 3)} assume !(~i~0 < 5); {947#false} is VALID [2020-07-17 22:50:28,425 INFO L280 TraceCheckUtils]: 22: Hoare triple {947#false} call #t~mem5 := read~int(~#string_B~0.base, 4 + ~#string_B~0.offset, 1); {947#false} is VALID [2020-07-17 22:50:28,426 INFO L280 TraceCheckUtils]: 23: Hoare triple {947#false} assume !!(0 == #t~mem5);havoc #t~mem5;~nc_A~0 := 0; {947#false} is VALID [2020-07-17 22:50:28,426 INFO L280 TraceCheckUtils]: 24: Hoare triple {947#false} call #t~mem6 := read~int(~#string_A~0.base, ~#string_A~0.offset + ~nc_A~0, 1); {947#false} is VALID [2020-07-17 22:50:28,426 INFO L280 TraceCheckUtils]: 25: Hoare triple {947#false} assume !(0 != #t~mem6);havoc #t~mem6; {947#false} is VALID [2020-07-17 22:50:28,426 INFO L280 TraceCheckUtils]: 26: Hoare triple {947#false} ~nc_B~0 := 0; {947#false} is VALID [2020-07-17 22:50:28,427 INFO L280 TraceCheckUtils]: 27: Hoare triple {947#false} call #t~mem8 := read~int(~#string_B~0.base, ~#string_B~0.offset + ~nc_B~0, 1); {947#false} is VALID [2020-07-17 22:50:28,427 INFO L280 TraceCheckUtils]: 28: Hoare triple {947#false} assume !(0 != #t~mem8);havoc #t~mem8; {947#false} is VALID [2020-07-17 22:50:28,427 INFO L280 TraceCheckUtils]: 29: Hoare triple {947#false} assume !!(~nc_B~0 >= ~nc_A~0);~j~0 := 0;~i~0 := ~j~0; {947#false} is VALID [2020-07-17 22:50:28,427 INFO L280 TraceCheckUtils]: 30: Hoare triple {947#false} assume !(~i~0 < ~nc_A~0 && ~j~0 < ~nc_B~0); {947#false} is VALID [2020-07-17 22:50:28,427 INFO L280 TraceCheckUtils]: 31: Hoare triple {947#false} ~found~0 := ~shiftLeft((if ~j~0 > ~nc_B~0 - 1 then 1 else 0), ~i~0); {947#false} is VALID [2020-07-17 22:50:28,428 INFO L263 TraceCheckUtils]: 32: Hoare triple {947#false} call __VERIFIER_assert((if 0 == ~found~0 || 1 == ~found~0 then 1 else 0)); {947#false} is VALID [2020-07-17 22:50:28,428 INFO L280 TraceCheckUtils]: 33: Hoare triple {947#false} ~cond := #in~cond; {947#false} is VALID [2020-07-17 22:50:28,428 INFO L280 TraceCheckUtils]: 34: Hoare triple {947#false} assume 0 == ~cond; {947#false} is VALID [2020-07-17 22:50:28,428 INFO L280 TraceCheckUtils]: 35: Hoare triple {947#false} assume !false; {947#false} is VALID [2020-07-17 22:50:28,430 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2020-07-17 22:50:28,430 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-17 22:50:28,431 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 8 [2020-07-17 22:50:28,431 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751146085] [2020-07-17 22:50:28,432 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 36 [2020-07-17 22:50:28,432 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:50:28,432 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-17 22:50:28,484 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:50:28,485 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-17 22:50:28,485 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:50:28,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-17 22:50:28,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-07-17 22:50:28,486 INFO L87 Difference]: Start difference. First operand 38 states and 43 transitions. Second operand 8 states. [2020-07-17 22:50:28,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:50:28,826 INFO L93 Difference]: Finished difference Result 85 states and 104 transitions. [2020-07-17 22:50:28,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-17 22:50:28,826 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 36 [2020-07-17 22:50:28,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:50:28,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-17 22:50:28,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 99 transitions. [2020-07-17 22:50:28,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-17 22:50:28,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 99 transitions. [2020-07-17 22:50:28,834 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 99 transitions. [2020-07-17 22:50:28,954 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 99 edges. 99 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:50:28,956 INFO L225 Difference]: With dead ends: 85 [2020-07-17 22:50:28,956 INFO L226 Difference]: Without dead ends: 60 [2020-07-17 22:50:28,957 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-07-17 22:50:28,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2020-07-17 22:50:28,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 42. [2020-07-17 22:50:28,986 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:50:28,987 INFO L82 GeneralOperation]: Start isEquivalent. First operand 60 states. Second operand 42 states. [2020-07-17 22:50:28,987 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand 42 states. [2020-07-17 22:50:28,987 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 42 states. [2020-07-17 22:50:28,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:50:28,990 INFO L93 Difference]: Finished difference Result 60 states and 73 transitions. [2020-07-17 22:50:28,991 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 73 transitions. [2020-07-17 22:50:28,991 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:50:28,992 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:50:28,992 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 60 states. [2020-07-17 22:50:28,992 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 60 states. [2020-07-17 22:50:28,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:50:28,995 INFO L93 Difference]: Finished difference Result 60 states and 73 transitions. [2020-07-17 22:50:28,995 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 73 transitions. [2020-07-17 22:50:28,996 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:50:28,996 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:50:28,996 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:50:28,997 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:50:28,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-07-17 22:50:28,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 47 transitions. [2020-07-17 22:50:28,999 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 47 transitions. Word has length 36 [2020-07-17 22:50:28,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:50:28,999 INFO L479 AbstractCegarLoop]: Abstraction has 42 states and 47 transitions. [2020-07-17 22:50:28,999 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-17 22:50:29,000 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2020-07-17 22:50:29,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-07-17 22:50:29,001 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:50:29,001 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:50:29,201 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:50:29,202 INFO L427 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:50:29,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:50:29,203 INFO L82 PathProgramCache]: Analyzing trace with hash -1106103076, now seen corresponding path program 4 times [2020-07-17 22:50:29,203 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:50:29,204 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24642761] [2020-07-17 22:50:29,204 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:50:29,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:50:29,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:50:29,388 INFO L280 TraceCheckUtils]: 0: Hoare triple {1376#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1366#true} is VALID [2020-07-17 22:50:29,388 INFO L280 TraceCheckUtils]: 1: Hoare triple {1366#true} assume true; {1366#true} is VALID [2020-07-17 22:50:29,388 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1366#true} {1366#true} #115#return; {1366#true} is VALID [2020-07-17 22:50:29,390 INFO L263 TraceCheckUtils]: 0: Hoare triple {1366#true} call ULTIMATE.init(); {1376#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-17 22:50:29,390 INFO L280 TraceCheckUtils]: 1: Hoare triple {1376#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1366#true} is VALID [2020-07-17 22:50:29,390 INFO L280 TraceCheckUtils]: 2: Hoare triple {1366#true} assume true; {1366#true} is VALID [2020-07-17 22:50:29,390 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1366#true} {1366#true} #115#return; {1366#true} is VALID [2020-07-17 22:50:29,391 INFO L263 TraceCheckUtils]: 4: Hoare triple {1366#true} call #t~ret14 := main(); {1366#true} is VALID [2020-07-17 22:50:29,392 INFO L280 TraceCheckUtils]: 5: Hoare triple {1366#true} call ~#string_A~0.base, ~#string_A~0.offset := #Ultimate.allocOnStack(5);call ~#string_B~0.base, ~#string_B~0.offset := #Ultimate.allocOnStack(5);havoc ~i~0;havoc ~j~0;havoc ~nc_A~0;havoc ~nc_B~0;~found~0 := 0;~i~0 := 0; {1371#(= 0 main_~i~0)} is VALID [2020-07-17 22:50:29,393 INFO L280 TraceCheckUtils]: 6: Hoare triple {1371#(= 0 main_~i~0)} assume !!(~i~0 < 5);assume -128 <= #t~nondet1 && #t~nondet1 <= 127;call write~int(#t~nondet1, ~#string_A~0.base, ~#string_A~0.offset + ~i~0, 1);havoc #t~nondet1; {1371#(= 0 main_~i~0)} is VALID [2020-07-17 22:50:29,393 INFO L280 TraceCheckUtils]: 7: Hoare triple {1371#(= 0 main_~i~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1372#(<= main_~i~0 1)} is VALID [2020-07-17 22:50:29,394 INFO L280 TraceCheckUtils]: 8: Hoare triple {1372#(<= main_~i~0 1)} assume !!(~i~0 < 5);assume -128 <= #t~nondet1 && #t~nondet1 <= 127;call write~int(#t~nondet1, ~#string_A~0.base, ~#string_A~0.offset + ~i~0, 1);havoc #t~nondet1; {1372#(<= main_~i~0 1)} is VALID [2020-07-17 22:50:29,395 INFO L280 TraceCheckUtils]: 9: Hoare triple {1372#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1373#(<= main_~i~0 2)} is VALID [2020-07-17 22:50:29,396 INFO L280 TraceCheckUtils]: 10: Hoare triple {1373#(<= main_~i~0 2)} assume !!(~i~0 < 5);assume -128 <= #t~nondet1 && #t~nondet1 <= 127;call write~int(#t~nondet1, ~#string_A~0.base, ~#string_A~0.offset + ~i~0, 1);havoc #t~nondet1; {1373#(<= main_~i~0 2)} is VALID [2020-07-17 22:50:29,397 INFO L280 TraceCheckUtils]: 11: Hoare triple {1373#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1374#(<= main_~i~0 3)} is VALID [2020-07-17 22:50:29,397 INFO L280 TraceCheckUtils]: 12: Hoare triple {1374#(<= main_~i~0 3)} assume !!(~i~0 < 5);assume -128 <= #t~nondet1 && #t~nondet1 <= 127;call write~int(#t~nondet1, ~#string_A~0.base, ~#string_A~0.offset + ~i~0, 1);havoc #t~nondet1; {1374#(<= main_~i~0 3)} is VALID [2020-07-17 22:50:29,398 INFO L280 TraceCheckUtils]: 13: Hoare triple {1374#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1375#(<= main_~i~0 4)} is VALID [2020-07-17 22:50:29,399 INFO L280 TraceCheckUtils]: 14: Hoare triple {1375#(<= main_~i~0 4)} assume !(~i~0 < 5); {1367#false} is VALID [2020-07-17 22:50:29,399 INFO L280 TraceCheckUtils]: 15: Hoare triple {1367#false} call #t~mem2 := read~int(~#string_A~0.base, 4 + ~#string_A~0.offset, 1); {1367#false} is VALID [2020-07-17 22:50:29,400 INFO L280 TraceCheckUtils]: 16: Hoare triple {1367#false} assume !!(0 == #t~mem2);havoc #t~mem2;~i~0 := 0; {1367#false} is VALID [2020-07-17 22:50:29,400 INFO L280 TraceCheckUtils]: 17: Hoare triple {1367#false} assume !!(~i~0 < 5);assume -128 <= #t~nondet4 && #t~nondet4 <= 127;call write~int(#t~nondet4, ~#string_B~0.base, ~#string_B~0.offset + ~i~0, 1);havoc #t~nondet4; {1367#false} is VALID [2020-07-17 22:50:29,400 INFO L280 TraceCheckUtils]: 18: Hoare triple {1367#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1367#false} is VALID [2020-07-17 22:50:29,400 INFO L280 TraceCheckUtils]: 19: Hoare triple {1367#false} assume !!(~i~0 < 5);assume -128 <= #t~nondet4 && #t~nondet4 <= 127;call write~int(#t~nondet4, ~#string_B~0.base, ~#string_B~0.offset + ~i~0, 1);havoc #t~nondet4; {1367#false} is VALID [2020-07-17 22:50:29,401 INFO L280 TraceCheckUtils]: 20: Hoare triple {1367#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1367#false} is VALID [2020-07-17 22:50:29,401 INFO L280 TraceCheckUtils]: 21: Hoare triple {1367#false} assume !!(~i~0 < 5);assume -128 <= #t~nondet4 && #t~nondet4 <= 127;call write~int(#t~nondet4, ~#string_B~0.base, ~#string_B~0.offset + ~i~0, 1);havoc #t~nondet4; {1367#false} is VALID [2020-07-17 22:50:29,401 INFO L280 TraceCheckUtils]: 22: Hoare triple {1367#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1367#false} is VALID [2020-07-17 22:50:29,401 INFO L280 TraceCheckUtils]: 23: Hoare triple {1367#false} assume !!(~i~0 < 5);assume -128 <= #t~nondet4 && #t~nondet4 <= 127;call write~int(#t~nondet4, ~#string_B~0.base, ~#string_B~0.offset + ~i~0, 1);havoc #t~nondet4; {1367#false} is VALID [2020-07-17 22:50:29,402 INFO L280 TraceCheckUtils]: 24: Hoare triple {1367#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1367#false} is VALID [2020-07-17 22:50:29,402 INFO L280 TraceCheckUtils]: 25: Hoare triple {1367#false} assume !(~i~0 < 5); {1367#false} is VALID [2020-07-17 22:50:29,402 INFO L280 TraceCheckUtils]: 26: Hoare triple {1367#false} call #t~mem5 := read~int(~#string_B~0.base, 4 + ~#string_B~0.offset, 1); {1367#false} is VALID [2020-07-17 22:50:29,402 INFO L280 TraceCheckUtils]: 27: Hoare triple {1367#false} assume !!(0 == #t~mem5);havoc #t~mem5;~nc_A~0 := 0; {1367#false} is VALID [2020-07-17 22:50:29,403 INFO L280 TraceCheckUtils]: 28: Hoare triple {1367#false} call #t~mem6 := read~int(~#string_A~0.base, ~#string_A~0.offset + ~nc_A~0, 1); {1367#false} is VALID [2020-07-17 22:50:29,403 INFO L280 TraceCheckUtils]: 29: Hoare triple {1367#false} assume !(0 != #t~mem6);havoc #t~mem6; {1367#false} is VALID [2020-07-17 22:50:29,403 INFO L280 TraceCheckUtils]: 30: Hoare triple {1367#false} ~nc_B~0 := 0; {1367#false} is VALID [2020-07-17 22:50:29,403 INFO L280 TraceCheckUtils]: 31: Hoare triple {1367#false} call #t~mem8 := read~int(~#string_B~0.base, ~#string_B~0.offset + ~nc_B~0, 1); {1367#false} is VALID [2020-07-17 22:50:29,404 INFO L280 TraceCheckUtils]: 32: Hoare triple {1367#false} assume !(0 != #t~mem8);havoc #t~mem8; {1367#false} is VALID [2020-07-17 22:50:29,404 INFO L280 TraceCheckUtils]: 33: Hoare triple {1367#false} assume !!(~nc_B~0 >= ~nc_A~0);~j~0 := 0;~i~0 := ~j~0; {1367#false} is VALID [2020-07-17 22:50:29,404 INFO L280 TraceCheckUtils]: 34: Hoare triple {1367#false} assume !(~i~0 < ~nc_A~0 && ~j~0 < ~nc_B~0); {1367#false} is VALID [2020-07-17 22:50:29,404 INFO L280 TraceCheckUtils]: 35: Hoare triple {1367#false} ~found~0 := ~shiftLeft((if ~j~0 > ~nc_B~0 - 1 then 1 else 0), ~i~0); {1367#false} is VALID [2020-07-17 22:50:29,405 INFO L263 TraceCheckUtils]: 36: Hoare triple {1367#false} call __VERIFIER_assert((if 0 == ~found~0 || 1 == ~found~0 then 1 else 0)); {1367#false} is VALID [2020-07-17 22:50:29,405 INFO L280 TraceCheckUtils]: 37: Hoare triple {1367#false} ~cond := #in~cond; {1367#false} is VALID [2020-07-17 22:50:29,405 INFO L280 TraceCheckUtils]: 38: Hoare triple {1367#false} assume 0 == ~cond; {1367#false} is VALID [2020-07-17 22:50:29,405 INFO L280 TraceCheckUtils]: 39: Hoare triple {1367#false} assume !false; {1367#false} is VALID [2020-07-17 22:50:29,407 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2020-07-17 22:50:29,408 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24642761] [2020-07-17 22:50:29,408 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1747055861] [2020-07-17 22:50:29,408 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:50:29,462 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-07-17 22:50:29,462 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-17 22:50:29,463 INFO L264 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-17 22:50:29,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:50:29,482 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:50:29,565 INFO L263 TraceCheckUtils]: 0: Hoare triple {1366#true} call ULTIMATE.init(); {1366#true} is VALID [2020-07-17 22:50:29,566 INFO L280 TraceCheckUtils]: 1: Hoare triple {1366#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1366#true} is VALID [2020-07-17 22:50:29,566 INFO L280 TraceCheckUtils]: 2: Hoare triple {1366#true} assume true; {1366#true} is VALID [2020-07-17 22:50:29,566 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1366#true} {1366#true} #115#return; {1366#true} is VALID [2020-07-17 22:50:29,567 INFO L263 TraceCheckUtils]: 4: Hoare triple {1366#true} call #t~ret14 := main(); {1366#true} is VALID [2020-07-17 22:50:29,568 INFO L280 TraceCheckUtils]: 5: Hoare triple {1366#true} call ~#string_A~0.base, ~#string_A~0.offset := #Ultimate.allocOnStack(5);call ~#string_B~0.base, ~#string_B~0.offset := #Ultimate.allocOnStack(5);havoc ~i~0;havoc ~j~0;havoc ~nc_A~0;havoc ~nc_B~0;~found~0 := 0;~i~0 := 0; {1395#(<= main_~i~0 0)} is VALID [2020-07-17 22:50:29,569 INFO L280 TraceCheckUtils]: 6: Hoare triple {1395#(<= main_~i~0 0)} assume !!(~i~0 < 5);assume -128 <= #t~nondet1 && #t~nondet1 <= 127;call write~int(#t~nondet1, ~#string_A~0.base, ~#string_A~0.offset + ~i~0, 1);havoc #t~nondet1; {1395#(<= main_~i~0 0)} is VALID [2020-07-17 22:50:29,570 INFO L280 TraceCheckUtils]: 7: Hoare triple {1395#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1372#(<= main_~i~0 1)} is VALID [2020-07-17 22:50:29,570 INFO L280 TraceCheckUtils]: 8: Hoare triple {1372#(<= main_~i~0 1)} assume !!(~i~0 < 5);assume -128 <= #t~nondet1 && #t~nondet1 <= 127;call write~int(#t~nondet1, ~#string_A~0.base, ~#string_A~0.offset + ~i~0, 1);havoc #t~nondet1; {1372#(<= main_~i~0 1)} is VALID [2020-07-17 22:50:29,571 INFO L280 TraceCheckUtils]: 9: Hoare triple {1372#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1373#(<= main_~i~0 2)} is VALID [2020-07-17 22:50:29,572 INFO L280 TraceCheckUtils]: 10: Hoare triple {1373#(<= main_~i~0 2)} assume !!(~i~0 < 5);assume -128 <= #t~nondet1 && #t~nondet1 <= 127;call write~int(#t~nondet1, ~#string_A~0.base, ~#string_A~0.offset + ~i~0, 1);havoc #t~nondet1; {1373#(<= main_~i~0 2)} is VALID [2020-07-17 22:50:29,573 INFO L280 TraceCheckUtils]: 11: Hoare triple {1373#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1374#(<= main_~i~0 3)} is VALID [2020-07-17 22:50:29,574 INFO L280 TraceCheckUtils]: 12: Hoare triple {1374#(<= main_~i~0 3)} assume !!(~i~0 < 5);assume -128 <= #t~nondet1 && #t~nondet1 <= 127;call write~int(#t~nondet1, ~#string_A~0.base, ~#string_A~0.offset + ~i~0, 1);havoc #t~nondet1; {1374#(<= main_~i~0 3)} is VALID [2020-07-17 22:50:29,574 INFO L280 TraceCheckUtils]: 13: Hoare triple {1374#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1375#(<= main_~i~0 4)} is VALID [2020-07-17 22:50:29,575 INFO L280 TraceCheckUtils]: 14: Hoare triple {1375#(<= main_~i~0 4)} assume !(~i~0 < 5); {1367#false} is VALID [2020-07-17 22:50:29,576 INFO L280 TraceCheckUtils]: 15: Hoare triple {1367#false} call #t~mem2 := read~int(~#string_A~0.base, 4 + ~#string_A~0.offset, 1); {1367#false} is VALID [2020-07-17 22:50:29,576 INFO L280 TraceCheckUtils]: 16: Hoare triple {1367#false} assume !!(0 == #t~mem2);havoc #t~mem2;~i~0 := 0; {1367#false} is VALID [2020-07-17 22:50:29,576 INFO L280 TraceCheckUtils]: 17: Hoare triple {1367#false} assume !!(~i~0 < 5);assume -128 <= #t~nondet4 && #t~nondet4 <= 127;call write~int(#t~nondet4, ~#string_B~0.base, ~#string_B~0.offset + ~i~0, 1);havoc #t~nondet4; {1367#false} is VALID [2020-07-17 22:50:29,576 INFO L280 TraceCheckUtils]: 18: Hoare triple {1367#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1367#false} is VALID [2020-07-17 22:50:29,577 INFO L280 TraceCheckUtils]: 19: Hoare triple {1367#false} assume !!(~i~0 < 5);assume -128 <= #t~nondet4 && #t~nondet4 <= 127;call write~int(#t~nondet4, ~#string_B~0.base, ~#string_B~0.offset + ~i~0, 1);havoc #t~nondet4; {1367#false} is VALID [2020-07-17 22:50:29,577 INFO L280 TraceCheckUtils]: 20: Hoare triple {1367#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1367#false} is VALID [2020-07-17 22:50:29,577 INFO L280 TraceCheckUtils]: 21: Hoare triple {1367#false} assume !!(~i~0 < 5);assume -128 <= #t~nondet4 && #t~nondet4 <= 127;call write~int(#t~nondet4, ~#string_B~0.base, ~#string_B~0.offset + ~i~0, 1);havoc #t~nondet4; {1367#false} is VALID [2020-07-17 22:50:29,577 INFO L280 TraceCheckUtils]: 22: Hoare triple {1367#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1367#false} is VALID [2020-07-17 22:50:29,578 INFO L280 TraceCheckUtils]: 23: Hoare triple {1367#false} assume !!(~i~0 < 5);assume -128 <= #t~nondet4 && #t~nondet4 <= 127;call write~int(#t~nondet4, ~#string_B~0.base, ~#string_B~0.offset + ~i~0, 1);havoc #t~nondet4; {1367#false} is VALID [2020-07-17 22:50:29,578 INFO L280 TraceCheckUtils]: 24: Hoare triple {1367#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1367#false} is VALID [2020-07-17 22:50:29,578 INFO L280 TraceCheckUtils]: 25: Hoare triple {1367#false} assume !(~i~0 < 5); {1367#false} is VALID [2020-07-17 22:50:29,578 INFO L280 TraceCheckUtils]: 26: Hoare triple {1367#false} call #t~mem5 := read~int(~#string_B~0.base, 4 + ~#string_B~0.offset, 1); {1367#false} is VALID [2020-07-17 22:50:29,579 INFO L280 TraceCheckUtils]: 27: Hoare triple {1367#false} assume !!(0 == #t~mem5);havoc #t~mem5;~nc_A~0 := 0; {1367#false} is VALID [2020-07-17 22:50:29,579 INFO L280 TraceCheckUtils]: 28: Hoare triple {1367#false} call #t~mem6 := read~int(~#string_A~0.base, ~#string_A~0.offset + ~nc_A~0, 1); {1367#false} is VALID [2020-07-17 22:50:29,579 INFO L280 TraceCheckUtils]: 29: Hoare triple {1367#false} assume !(0 != #t~mem6);havoc #t~mem6; {1367#false} is VALID [2020-07-17 22:50:29,579 INFO L280 TraceCheckUtils]: 30: Hoare triple {1367#false} ~nc_B~0 := 0; {1367#false} is VALID [2020-07-17 22:50:29,580 INFO L280 TraceCheckUtils]: 31: Hoare triple {1367#false} call #t~mem8 := read~int(~#string_B~0.base, ~#string_B~0.offset + ~nc_B~0, 1); {1367#false} is VALID [2020-07-17 22:50:29,580 INFO L280 TraceCheckUtils]: 32: Hoare triple {1367#false} assume !(0 != #t~mem8);havoc #t~mem8; {1367#false} is VALID [2020-07-17 22:50:29,580 INFO L280 TraceCheckUtils]: 33: Hoare triple {1367#false} assume !!(~nc_B~0 >= ~nc_A~0);~j~0 := 0;~i~0 := ~j~0; {1367#false} is VALID [2020-07-17 22:50:29,581 INFO L280 TraceCheckUtils]: 34: Hoare triple {1367#false} assume !(~i~0 < ~nc_A~0 && ~j~0 < ~nc_B~0); {1367#false} is VALID [2020-07-17 22:50:29,581 INFO L280 TraceCheckUtils]: 35: Hoare triple {1367#false} ~found~0 := ~shiftLeft((if ~j~0 > ~nc_B~0 - 1 then 1 else 0), ~i~0); {1367#false} is VALID [2020-07-17 22:50:29,581 INFO L263 TraceCheckUtils]: 36: Hoare triple {1367#false} call __VERIFIER_assert((if 0 == ~found~0 || 1 == ~found~0 then 1 else 0)); {1367#false} is VALID [2020-07-17 22:50:29,581 INFO L280 TraceCheckUtils]: 37: Hoare triple {1367#false} ~cond := #in~cond; {1367#false} is VALID [2020-07-17 22:50:29,582 INFO L280 TraceCheckUtils]: 38: Hoare triple {1367#false} assume 0 == ~cond; {1367#false} is VALID [2020-07-17 22:50:29,582 INFO L280 TraceCheckUtils]: 39: Hoare triple {1367#false} assume !false; {1367#false} is VALID [2020-07-17 22:50:29,584 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2020-07-17 22:50:29,584 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-17 22:50:29,584 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 9 [2020-07-17 22:50:29,585 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560845491] [2020-07-17 22:50:29,585 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 40 [2020-07-17 22:50:29,586 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:50:29,586 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2020-07-17 22:50:29,632 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:50:29,632 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-17 22:50:29,632 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:50:29,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-17 22:50:29,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-07-17 22:50:29,633 INFO L87 Difference]: Start difference. First operand 42 states and 47 transitions. Second operand 9 states. [2020-07-17 22:50:30,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:50:30,051 INFO L93 Difference]: Finished difference Result 93 states and 114 transitions. [2020-07-17 22:50:30,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-17 22:50:30,052 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 40 [2020-07-17 22:50:30,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:50:30,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-17 22:50:30,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 107 transitions. [2020-07-17 22:50:30,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-17 22:50:30,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 107 transitions. [2020-07-17 22:50:30,059 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 107 transitions. [2020-07-17 22:50:30,207 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 107 edges. 107 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:50:30,209 INFO L225 Difference]: With dead ends: 93 [2020-07-17 22:50:30,209 INFO L226 Difference]: Without dead ends: 66 [2020-07-17 22:50:30,210 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-07-17 22:50:30,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2020-07-17 22:50:30,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 46. [2020-07-17 22:50:30,230 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:50:30,231 INFO L82 GeneralOperation]: Start isEquivalent. First operand 66 states. Second operand 46 states. [2020-07-17 22:50:30,231 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand 46 states. [2020-07-17 22:50:30,231 INFO L87 Difference]: Start difference. First operand 66 states. Second operand 46 states. [2020-07-17 22:50:30,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:50:30,234 INFO L93 Difference]: Finished difference Result 66 states and 81 transitions. [2020-07-17 22:50:30,235 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 81 transitions. [2020-07-17 22:50:30,235 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:50:30,235 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:50:30,236 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand 66 states. [2020-07-17 22:50:30,236 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 66 states. [2020-07-17 22:50:30,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:50:30,239 INFO L93 Difference]: Finished difference Result 66 states and 81 transitions. [2020-07-17 22:50:30,239 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 81 transitions. [2020-07-17 22:50:30,240 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:50:30,240 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:50:30,240 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:50:30,240 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:50:30,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2020-07-17 22:50:30,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 51 transitions. [2020-07-17 22:50:30,243 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 51 transitions. Word has length 40 [2020-07-17 22:50:30,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:50:30,243 INFO L479 AbstractCegarLoop]: Abstraction has 46 states and 51 transitions. [2020-07-17 22:50:30,243 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-17 22:50:30,243 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 51 transitions. [2020-07-17 22:50:30,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2020-07-17 22:50:30,244 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:50:30,244 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:50:30,458 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:50:30,459 INFO L427 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:50:30,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:50:30,460 INFO L82 PathProgramCache]: Analyzing trace with hash 1061537308, now seen corresponding path program 5 times [2020-07-17 22:50:30,460 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:50:30,461 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038979825] [2020-07-17 22:50:30,461 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:50:30,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-17 22:50:30,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-17 22:50:30,687 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-17 22:50:30,688 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-17 22:50:30,689 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-17 22:50:30,783 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2020-07-17 22:50:30,784 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-17 22:50:30,784 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-17 22:50:30,784 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2020-07-17 22:50:30,784 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2020-07-17 22:50:30,784 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2020-07-17 22:50:30,784 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-17 22:50:30,784 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-17 22:50:30,784 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-17 22:50:30,785 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2020-07-17 22:50:30,785 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2020-07-17 22:50:30,785 WARN L170 areAnnotationChecker]: L24-3 has no Hoare annotation [2020-07-17 22:50:30,785 WARN L170 areAnnotationChecker]: L24-3 has no Hoare annotation [2020-07-17 22:50:30,785 WARN L170 areAnnotationChecker]: L24-3 has no Hoare annotation [2020-07-17 22:50:30,785 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation [2020-07-17 22:50:30,785 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation [2020-07-17 22:50:30,785 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-17 22:50:30,785 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-17 22:50:30,786 WARN L170 areAnnotationChecker]: L5-2 has no Hoare annotation [2020-07-17 22:50:30,786 WARN L170 areAnnotationChecker]: L24-4 has no Hoare annotation [2020-07-17 22:50:30,786 WARN L170 areAnnotationChecker]: L24-2 has no Hoare annotation [2020-07-17 22:50:30,786 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2020-07-17 22:50:30,786 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2020-07-17 22:50:30,786 WARN L170 areAnnotationChecker]: L8-2 has no Hoare annotation [2020-07-17 22:50:30,786 WARN L170 areAnnotationChecker]: L26 has no Hoare annotation [2020-07-17 22:50:30,786 WARN L170 areAnnotationChecker]: L26 has no Hoare annotation [2020-07-17 22:50:30,787 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-17 22:50:30,787 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-17 22:50:30,787 WARN L170 areAnnotationChecker]: L28-3 has no Hoare annotation [2020-07-17 22:50:30,787 WARN L170 areAnnotationChecker]: L28-3 has no Hoare annotation [2020-07-17 22:50:30,787 WARN L170 areAnnotationChecker]: L28-3 has no Hoare annotation [2020-07-17 22:50:30,787 WARN L170 areAnnotationChecker]: L60-1 has no Hoare annotation [2020-07-17 22:50:30,787 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-17 22:50:30,787 WARN L170 areAnnotationChecker]: L28-4 has no Hoare annotation [2020-07-17 22:50:30,788 WARN L170 areAnnotationChecker]: L28-2 has no Hoare annotation [2020-07-17 22:50:30,788 WARN L170 areAnnotationChecker]: L30 has no Hoare annotation [2020-07-17 22:50:30,788 WARN L170 areAnnotationChecker]: L30 has no Hoare annotation [2020-07-17 22:50:30,788 WARN L170 areAnnotationChecker]: L33-3 has no Hoare annotation [2020-07-17 22:50:30,788 WARN L170 areAnnotationChecker]: L33-3 has no Hoare annotation [2020-07-17 22:50:30,788 WARN L170 areAnnotationChecker]: L33-4 has no Hoare annotation [2020-07-17 22:50:30,788 WARN L170 areAnnotationChecker]: L33-1 has no Hoare annotation [2020-07-17 22:50:30,788 WARN L170 areAnnotationChecker]: L33-1 has no Hoare annotation [2020-07-17 22:50:30,789 WARN L170 areAnnotationChecker]: L37-3 has no Hoare annotation [2020-07-17 22:50:30,789 WARN L170 areAnnotationChecker]: L37-3 has no Hoare annotation [2020-07-17 22:50:30,789 WARN L170 areAnnotationChecker]: L37-4 has no Hoare annotation [2020-07-17 22:50:30,789 WARN L170 areAnnotationChecker]: L37-4 has no Hoare annotation [2020-07-17 22:50:30,789 WARN L170 areAnnotationChecker]: L37-1 has no Hoare annotation [2020-07-17 22:50:30,789 WARN L170 areAnnotationChecker]: L37-1 has no Hoare annotation [2020-07-17 22:50:30,789 WARN L170 areAnnotationChecker]: L46-2 has no Hoare annotation [2020-07-17 22:50:30,789 WARN L170 areAnnotationChecker]: L46-2 has no Hoare annotation [2020-07-17 22:50:30,790 WARN L170 areAnnotationChecker]: L46-2 has no Hoare annotation [2020-07-17 22:50:30,790 WARN L170 areAnnotationChecker]: L44-2 has no Hoare annotation [2020-07-17 22:50:30,790 WARN L170 areAnnotationChecker]: L46 has no Hoare annotation [2020-07-17 22:50:30,790 WARN L170 areAnnotationChecker]: L46 has no Hoare annotation [2020-07-17 22:50:30,790 WARN L170 areAnnotationChecker]: L60 has no Hoare annotation [2020-07-17 22:50:30,790 WARN L170 areAnnotationChecker]: L60 has no Hoare annotation [2020-07-17 22:50:30,790 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-17 22:50:30,793 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.07 10:50:30 BoogieIcfgContainer [2020-07-17 22:50:30,793 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-17 22:50:30,796 INFO L168 Benchmark]: Toolchain (without parser) took 6947.97 ms. Allocated memory was 145.2 MB in the beginning and 283.6 MB in the end (delta: 138.4 MB). Free memory was 102.7 MB in the beginning and 234.6 MB in the end (delta: -131.9 MB). Peak memory consumption was 6.5 MB. Max. memory is 7.1 GB. [2020-07-17 22:50:30,797 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 145.2 MB. Free memory was 121.4 MB in the beginning and 121.2 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-07-17 22:50:30,798 INFO L168 Benchmark]: CACSL2BoogieTranslator took 426.72 ms. Allocated memory was 145.2 MB in the beginning and 202.4 MB in the end (delta: 57.1 MB). Free memory was 102.3 MB in the beginning and 181.3 MB in the end (delta: -79.0 MB). Peak memory consumption was 20.5 MB. Max. memory is 7.1 GB. [2020-07-17 22:50:30,798 INFO L168 Benchmark]: Boogie Preprocessor took 88.36 ms. Allocated memory is still 202.4 MB. Free memory was 181.3 MB in the beginning and 179.0 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.4 MB. Max. memory is 7.1 GB. [2020-07-17 22:50:30,799 INFO L168 Benchmark]: RCFGBuilder took 577.14 ms. Allocated memory is still 202.4 MB. Free memory was 179.0 MB in the beginning and 149.7 MB in the end (delta: 29.2 MB). Peak memory consumption was 29.2 MB. Max. memory is 7.1 GB. [2020-07-17 22:50:30,800 INFO L168 Benchmark]: TraceAbstraction took 5847.95 ms. Allocated memory was 202.4 MB in the beginning and 283.6 MB in the end (delta: 81.3 MB). Free memory was 149.1 MB in the beginning and 234.6 MB in the end (delta: -85.6 MB). There was no memory consumed. Max. memory is 7.1 GB. [2020-07-17 22:50:30,802 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.25 ms. Allocated memory is still 145.2 MB. Free memory was 121.4 MB in the beginning and 121.2 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 426.72 ms. Allocated memory was 145.2 MB in the beginning and 202.4 MB in the end (delta: 57.1 MB). Free memory was 102.3 MB in the beginning and 181.3 MB in the end (delta: -79.0 MB). Peak memory consumption was 20.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 88.36 ms. Allocated memory is still 202.4 MB. Free memory was 181.3 MB in the beginning and 179.0 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 577.14 ms. Allocated memory is still 202.4 MB. Free memory was 179.0 MB in the beginning and 149.7 MB in the end (delta: 29.2 MB). Peak memory consumption was 29.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 5847.95 ms. Allocated memory was 202.4 MB in the beginning and 283.6 MB in the end (delta: 81.3 MB). Free memory was 149.1 MB in the beginning and 234.6 MB in the end (delta: -85.6 MB). There was no memory consumed. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 9]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of shiftLeft at line 58. Possible FailurePath: [L20] char string_A[5], string_B[5]; [L21] int i, j, nc_A, nc_B, found=0; [L24] i=0 VAL [found=0, i=0, string_A={7:0}, string_B={6:0}] [L24] COND TRUE i<5 [L25] string_A[i]=__VERIFIER_nondet_char() [L24] i++ VAL [found=0, i=1, string_A={7:0}, string_B={6:0}] [L24] COND TRUE i<5 [L25] string_A[i]=__VERIFIER_nondet_char() [L24] i++ VAL [found=0, i=2, string_A={7:0}, string_B={6:0}] [L24] COND TRUE i<5 [L25] string_A[i]=__VERIFIER_nondet_char() [L24] i++ VAL [found=0, i=3, string_A={7:0}, string_B={6:0}] [L24] COND TRUE i<5 [L25] string_A[i]=__VERIFIER_nondet_char() [L24] i++ VAL [found=0, i=4, string_A={7:0}, string_B={6:0}] [L24] COND TRUE i<5 [L25] string_A[i]=__VERIFIER_nondet_char() [L24] i++ VAL [found=0, i=5, string_A={7:0}, string_B={6:0}] [L24] COND FALSE !(i<5) VAL [found=0, i=5, string_A={7:0}, string_B={6:0}] [L26] EXPR string_A[5 -1] VAL [found=0, i=5, string_A={7:0}, string_A[5 -1]=0, string_B={6:0}] [L26] COND FALSE !(!(string_A[5 -1]=='\0')) [L28] i=0 VAL [found=0, i=0, string_A={7:0}, string_B={6:0}] [L28] COND TRUE i<5 [L29] string_B[i]=__VERIFIER_nondet_char() [L28] i++ VAL [found=0, i=1, string_A={7:0}, string_B={6:0}] [L28] COND TRUE i<5 [L29] string_B[i]=__VERIFIER_nondet_char() [L28] i++ VAL [found=0, i=2, string_A={7:0}, string_B={6:0}] [L28] COND TRUE i<5 [L29] string_B[i]=__VERIFIER_nondet_char() [L28] i++ VAL [found=0, i=3, string_A={7:0}, string_B={6:0}] [L28] COND TRUE i<5 [L29] string_B[i]=__VERIFIER_nondet_char() [L28] i++ VAL [found=0, i=4, string_A={7:0}, string_B={6:0}] [L28] COND TRUE i<5 [L29] string_B[i]=__VERIFIER_nondet_char() [L28] i++ VAL [found=0, i=5, string_A={7:0}, string_B={6:0}] [L28] COND FALSE !(i<5) VAL [found=0, i=5, string_A={7:0}, string_B={6:0}] [L30] EXPR string_B[5 -1] VAL [found=0, i=5, string_A={7:0}, string_B={6:0}, string_B[5 -1]=0] [L30] COND FALSE !(!(string_B[5 -1]=='\0')) [L32] nc_A = 0 VAL [found=0, i=5, nc_A=0, string_A={7:0}, string_B={6:0}] [L33] EXPR string_A[nc_A] VAL [found=0, i=5, nc_A=0, string_A={7:0}, string_A[nc_A]=0, string_B={6:0}] [L33] COND FALSE !(string_A[nc_A]!='\0') [L36] nc_B = 0 VAL [found=0, i=5, nc_A=0, nc_B=0, string_A={7:0}, string_B={6:0}] [L37] EXPR string_B[nc_B] VAL [found=0, i=5, nc_A=0, nc_B=0, string_A={7:0}, string_B={6:0}, string_B[nc_B]=0] [L37] COND FALSE !(string_B[nc_B]!='\0') [L40] COND FALSE !(!(nc_B >= nc_A)) [L43] EXPR j=0 [L43] i=j=0 VAL [found=0, i=0, j=0, nc_A=0, nc_B=0, string_A={7:0}, string_B={6:0}] [L44] COND FALSE !((inc_B-1)<