/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-8fc6572 [2020-07-10 15:27:34,722 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-10 15:27:34,726 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-10 15:27:34,748 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-10 15:27:34,749 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-10 15:27:34,752 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-10 15:27:34,754 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-10 15:27:34,768 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-10 15:27:34,772 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-10 15:27:34,777 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-10 15:27:34,780 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-10 15:27:34,782 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-10 15:27:34,783 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-10 15:27:34,784 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-10 15:27:34,787 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-10 15:27:34,789 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-10 15:27:34,790 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-10 15:27:34,791 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-10 15:27:34,792 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-10 15:27:34,798 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-10 15:27:34,804 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-10 15:27:34,808 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-10 15:27:34,809 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-10 15:27:34,810 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-10 15:27:34,813 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-10 15:27:34,814 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-10 15:27:34,814 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-10 15:27:34,818 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-10 15:27:34,818 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-10 15:27:34,819 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-10 15:27:34,819 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-10 15:27:34,820 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-10 15:27:34,821 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-10 15:27:34,822 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-10 15:27:34,823 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-10 15:27:34,824 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-10 15:27:34,824 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-10 15:27:34,824 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-10 15:27:34,825 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-10 15:27:34,825 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-10 15:27:34,827 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-10 15:27:34,828 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-10 15:27:34,867 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-10 15:27:34,868 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-10 15:27:34,870 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-10 15:27:34,870 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-10 15:27:34,870 INFO L138 SettingsManager]: * Use SBE=true [2020-07-10 15:27:34,871 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-10 15:27:34,871 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-10 15:27:34,871 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-10 15:27:34,872 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-10 15:27:34,872 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-10 15:27:34,874 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-10 15:27:34,875 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-10 15:27:34,875 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-10 15:27:34,875 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-10 15:27:34,876 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-10 15:27:34,876 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-10 15:27:34,876 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-10 15:27:34,876 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-10 15:27:34,876 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-10 15:27:34,877 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-10 15:27:34,877 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-10 15:27:34,877 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 15:27:34,877 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-10 15:27:34,877 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-10 15:27:34,878 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-10 15:27:34,878 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-10 15:27:34,878 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-10 15:27:34,878 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-10 15:27:34,879 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-10 15:27:34,879 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-10 15:27:35,250 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-10 15:27:35,271 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-10 15:27:35,276 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-10 15:27:35,278 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-10 15:27:35,278 INFO L275 PluginConnector]: CDTParser initialized [2020-07-10 15:27:35,279 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-10 15:27:35,356 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a3b759ec4/2df44a9e5eed43569016f44cf7c15938/FLAGc23f8a84c [2020-07-10 15:27:35,896 INFO L306 CDTParser]: Found 1 translation units. [2020-07-10 15:27:35,897 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/string-2.i [2020-07-10 15:27:35,905 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a3b759ec4/2df44a9e5eed43569016f44cf7c15938/FLAGc23f8a84c [2020-07-10 15:27:36,236 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a3b759ec4/2df44a9e5eed43569016f44cf7c15938 [2020-07-10 15:27:36,244 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-10 15:27:36,246 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-10 15:27:36,250 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-10 15:27:36,250 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-10 15:27:36,255 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-10 15:27:36,258 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 03:27:36" (1/1) ... [2020-07-10 15:27:36,261 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b189a48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:27:36, skipping insertion in model container [2020-07-10 15:27:36,261 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 03:27:36" (1/1) ... [2020-07-10 15:27:36,272 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-10 15:27:36,294 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-10 15:27:36,511 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 15:27:36,519 INFO L203 MainTranslator]: Completed pre-run [2020-07-10 15:27:36,557 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 15:27:36,696 INFO L208 MainTranslator]: Completed translation [2020-07-10 15:27:36,697 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:27:36 WrapperNode [2020-07-10 15:27:36,698 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-10 15:27:36,699 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-10 15:27:36,699 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-10 15:27:36,699 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-10 15:27:36,718 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:27:36" (1/1) ... [2020-07-10 15:27:36,720 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:27:36" (1/1) ... [2020-07-10 15:27:36,748 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:27:36" (1/1) ... [2020-07-10 15:27:36,749 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:27:36" (1/1) ... [2020-07-10 15:27:36,790 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:27:36" (1/1) ... [2020-07-10 15:27:36,804 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:27:36" (1/1) ... [2020-07-10 15:27:36,805 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:27:36" (1/1) ... [2020-07-10 15:27:36,809 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-10 15:27:36,810 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-10 15:27:36,810 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-10 15:27:36,810 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-10 15:27:36,811 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:27:36" (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-10 15:27:36,880 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-10 15:27:36,880 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-10 15:27:36,880 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-07-10 15:27:36,880 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-10 15:27:36,880 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-10 15:27:36,881 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-10 15:27:36,881 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-10 15:27:36,881 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-07-10 15:27:36,881 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-10 15:27:36,881 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2020-07-10 15:27:36,881 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-10 15:27:36,882 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-10 15:27:36,882 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-10 15:27:36,882 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-10 15:27:36,882 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-10 15:27:36,882 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-10 15:27:36,882 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-10 15:27:37,430 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-10 15:27:37,431 INFO L295 CfgBuilder]: Removed 5 assume(true) statements. [2020-07-10 15:27:37,435 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 03:27:37 BoogieIcfgContainer [2020-07-10 15:27:37,436 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-10 15:27:37,437 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-10 15:27:37,438 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-10 15:27:37,453 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-10 15:27:37,454 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.07 03:27:36" (1/3) ... [2020-07-10 15:27:37,457 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d24b6d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 03:27:37, skipping insertion in model container [2020-07-10 15:27:37,457 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:27:36" (2/3) ... [2020-07-10 15:27:37,458 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d24b6d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 03:27:37, skipping insertion in model container [2020-07-10 15:27:37,458 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 03:27:37" (3/3) ... [2020-07-10 15:27:37,465 INFO L109 eAbstractionObserver]: Analyzing ICFG string-2.i [2020-07-10 15:27:37,480 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-10 15:27:37,490 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-10 15:27:37,509 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-10 15:27:37,543 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-10 15:27:37,543 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-10 15:27:37,543 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-10 15:27:37,543 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-10 15:27:37,544 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-10 15:27:37,544 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-10 15:27:37,545 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-10 15:27:37,545 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-10 15:27:37,568 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states. [2020-07-10 15:27:37,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-07-10 15:27:37,576 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:27:37,577 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-10 15:27:37,578 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:27:37,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:27:37,585 INFO L82 PathProgramCache]: Analyzing trace with hash -522531256, now seen corresponding path program 1 times [2020-07-10 15:27:37,598 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:27:37,599 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442545148] [2020-07-10 15:27:37,599 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:27:37,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:27:37,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:27:37,931 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-10 15:27:37,932 INFO L280 TraceCheckUtils]: 1: Hoare triple {38#true} assume true; {38#true} is VALID [2020-07-10 15:27:37,932 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {38#true} {38#true} #115#return; {38#true} is VALID [2020-07-10 15:27:37,938 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-10 15:27:37,939 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-10 15:27:37,940 INFO L280 TraceCheckUtils]: 2: Hoare triple {38#true} assume true; {38#true} is VALID [2020-07-10 15:27:37,940 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {38#true} {38#true} #115#return; {38#true} is VALID [2020-07-10 15:27:37,941 INFO L263 TraceCheckUtils]: 4: Hoare triple {38#true} call #t~ret14 := main(); {38#true} is VALID [2020-07-10 15:27:37,943 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-10 15:27:37,945 INFO L280 TraceCheckUtils]: 6: Hoare triple {43#(= 0 main_~i~0)} assume !(~i~0 < 5); {39#false} is VALID [2020-07-10 15:27:37,946 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-10 15:27:37,946 INFO L280 TraceCheckUtils]: 8: Hoare triple {39#false} assume !!(0 == #t~mem2);havoc #t~mem2;~i~0 := 0; {39#false} is VALID [2020-07-10 15:27:37,947 INFO L280 TraceCheckUtils]: 9: Hoare triple {39#false} assume !(~i~0 < 5); {39#false} is VALID [2020-07-10 15:27:37,947 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-10 15:27:37,948 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-10 15:27:37,948 INFO L280 TraceCheckUtils]: 12: Hoare triple {39#false} assume !true; {39#false} is VALID [2020-07-10 15:27:37,949 INFO L280 TraceCheckUtils]: 13: Hoare triple {39#false} ~nc_B~0 := 0; {39#false} is VALID [2020-07-10 15:27:37,949 INFO L280 TraceCheckUtils]: 14: Hoare triple {39#false} assume !true; {39#false} is VALID [2020-07-10 15:27:37,950 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-10 15:27:37,950 INFO L280 TraceCheckUtils]: 16: Hoare triple {39#false} assume !true; {39#false} is VALID [2020-07-10 15:27:37,951 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-10 15:27:37,951 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-10 15:27:37,952 INFO L280 TraceCheckUtils]: 19: Hoare triple {39#false} ~cond := #in~cond; {39#false} is VALID [2020-07-10 15:27:37,953 INFO L280 TraceCheckUtils]: 20: Hoare triple {39#false} assume 0 == ~cond; {39#false} is VALID [2020-07-10 15:27:37,953 INFO L280 TraceCheckUtils]: 21: Hoare triple {39#false} assume !false; {39#false} is VALID [2020-07-10 15:27:37,957 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:27:37,958 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442545148] [2020-07-10 15:27:37,960 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:27:37,960 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-10 15:27:37,962 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907644854] [2020-07-10 15:27:37,971 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2020-07-10 15:27:37,976 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:27:37,981 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-10 15:27:38,036 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-10 15:27:38,037 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-10 15:27:38,037 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:27:38,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-10 15:27:38,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-10 15:27:38,052 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 4 states. [2020-07-10 15:27:38,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:27:38,536 INFO L93 Difference]: Finished difference Result 73 states and 109 transitions. [2020-07-10 15:27:38,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-10 15:27:38,536 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2020-07-10 15:27:38,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:27:38,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-10 15:27:38,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 109 transitions. [2020-07-10 15:27:38,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-10 15:27:38,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 109 transitions. [2020-07-10 15:27:38,615 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 109 transitions. [2020-07-10 15:27:38,859 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-10 15:27:38,890 INFO L225 Difference]: With dead ends: 73 [2020-07-10 15:27:38,891 INFO L226 Difference]: Without dead ends: 36 [2020-07-10 15:27:38,903 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-10 15:27:38,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2020-07-10 15:27:38,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 30. [2020-07-10 15:27:38,990 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:27:38,991 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand 30 states. [2020-07-10 15:27:38,992 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 30 states. [2020-07-10 15:27:38,992 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 30 states. [2020-07-10 15:27:39,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:27:39,001 INFO L93 Difference]: Finished difference Result 36 states and 43 transitions. [2020-07-10 15:27:39,001 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 43 transitions. [2020-07-10 15:27:39,002 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:27:39,002 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:27:39,003 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 36 states. [2020-07-10 15:27:39,003 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 36 states. [2020-07-10 15:27:39,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:27:39,013 INFO L93 Difference]: Finished difference Result 36 states and 43 transitions. [2020-07-10 15:27:39,013 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 43 transitions. [2020-07-10 15:27:39,015 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:27:39,016 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:27:39,017 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:27:39,017 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:27:39,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-07-10 15:27:39,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 35 transitions. [2020-07-10 15:27:39,025 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 35 transitions. Word has length 22 [2020-07-10 15:27:39,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:27:39,026 INFO L479 AbstractCegarLoop]: Abstraction has 30 states and 35 transitions. [2020-07-10 15:27:39,026 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-10 15:27:39,026 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2020-07-10 15:27:39,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-07-10 15:27:39,028 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:27:39,028 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-10 15:27:39,029 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-10 15:27:39,029 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:27:39,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:27:39,034 INFO L82 PathProgramCache]: Analyzing trace with hash -1816798436, now seen corresponding path program 1 times [2020-07-10 15:27:39,035 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:27:39,035 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72382799] [2020-07-10 15:27:39,036 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:27:39,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:27:39,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:27:39,178 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-10 15:27:39,179 INFO L280 TraceCheckUtils]: 1: Hoare triple {256#true} assume true; {256#true} is VALID [2020-07-10 15:27:39,180 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {256#true} {256#true} #115#return; {256#true} is VALID [2020-07-10 15:27:39,182 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-10 15:27:39,182 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-10 15:27:39,182 INFO L280 TraceCheckUtils]: 2: Hoare triple {256#true} assume true; {256#true} is VALID [2020-07-10 15:27:39,183 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {256#true} {256#true} #115#return; {256#true} is VALID [2020-07-10 15:27:39,183 INFO L263 TraceCheckUtils]: 4: Hoare triple {256#true} call #t~ret14 := main(); {256#true} is VALID [2020-07-10 15:27:39,185 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-10 15:27:39,186 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-10 15:27:39,187 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-10 15:27:39,188 INFO L280 TraceCheckUtils]: 8: Hoare triple {262#(<= main_~i~0 1)} assume !(~i~0 < 5); {257#false} is VALID [2020-07-10 15:27:39,188 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-10 15:27:39,189 INFO L280 TraceCheckUtils]: 10: Hoare triple {257#false} assume !!(0 == #t~mem2);havoc #t~mem2;~i~0 := 0; {257#false} is VALID [2020-07-10 15:27:39,189 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-10 15:27:39,190 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-10 15:27:39,190 INFO L280 TraceCheckUtils]: 13: Hoare triple {257#false} assume !(~i~0 < 5); {257#false} is VALID [2020-07-10 15:27:39,191 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-10 15:27:39,191 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-10 15:27:39,192 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-10 15:27:39,192 INFO L280 TraceCheckUtils]: 17: Hoare triple {257#false} assume !(0 != #t~mem6);havoc #t~mem6; {257#false} is VALID [2020-07-10 15:27:39,192 INFO L280 TraceCheckUtils]: 18: Hoare triple {257#false} ~nc_B~0 := 0; {257#false} is VALID [2020-07-10 15:27:39,193 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-10 15:27:39,193 INFO L280 TraceCheckUtils]: 20: Hoare triple {257#false} assume !(0 != #t~mem8);havoc #t~mem8; {257#false} is VALID [2020-07-10 15:27:39,193 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-10 15:27:39,194 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-10 15:27:39,194 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-10 15:27:39,194 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-10 15:27:39,195 INFO L280 TraceCheckUtils]: 25: Hoare triple {257#false} ~cond := #in~cond; {257#false} is VALID [2020-07-10 15:27:39,195 INFO L280 TraceCheckUtils]: 26: Hoare triple {257#false} assume 0 == ~cond; {257#false} is VALID [2020-07-10 15:27:39,195 INFO L280 TraceCheckUtils]: 27: Hoare triple {257#false} assume !false; {257#false} is VALID [2020-07-10 15:27:39,197 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-10 15:27:39,198 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72382799] [2020-07-10 15:27:39,198 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1747351596] [2020-07-10 15:27:39,199 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-10 15:27:39,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:27:39,260 INFO L264 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-10 15:27:39,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:27:39,282 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 15:27:39,384 INFO L263 TraceCheckUtils]: 0: Hoare triple {256#true} call ULTIMATE.init(); {256#true} is VALID [2020-07-10 15:27:39,385 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-10 15:27:39,386 INFO L280 TraceCheckUtils]: 2: Hoare triple {256#true} assume true; {256#true} is VALID [2020-07-10 15:27:39,386 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {256#true} {256#true} #115#return; {256#true} is VALID [2020-07-10 15:27:39,386 INFO L263 TraceCheckUtils]: 4: Hoare triple {256#true} call #t~ret14 := main(); {256#true} is VALID [2020-07-10 15:27:39,388 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-10 15:27:39,389 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-10 15:27:39,391 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-10 15:27:39,392 INFO L280 TraceCheckUtils]: 8: Hoare triple {262#(<= main_~i~0 1)} assume !(~i~0 < 5); {257#false} is VALID [2020-07-10 15:27:39,393 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-10 15:27:39,393 INFO L280 TraceCheckUtils]: 10: Hoare triple {257#false} assume !!(0 == #t~mem2);havoc #t~mem2;~i~0 := 0; {257#false} is VALID [2020-07-10 15:27:39,393 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-10 15:27:39,394 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-10 15:27:39,394 INFO L280 TraceCheckUtils]: 13: Hoare triple {257#false} assume !(~i~0 < 5); {257#false} is VALID [2020-07-10 15:27:39,395 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-10 15:27:39,395 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-10 15:27:39,395 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-10 15:27:39,396 INFO L280 TraceCheckUtils]: 17: Hoare triple {257#false} assume !(0 != #t~mem6);havoc #t~mem6; {257#false} is VALID [2020-07-10 15:27:39,396 INFO L280 TraceCheckUtils]: 18: Hoare triple {257#false} ~nc_B~0 := 0; {257#false} is VALID [2020-07-10 15:27:39,396 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-10 15:27:39,396 INFO L280 TraceCheckUtils]: 20: Hoare triple {257#false} assume !(0 != #t~mem8);havoc #t~mem8; {257#false} is VALID [2020-07-10 15:27:39,397 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-10 15:27:39,397 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-10 15:27:39,398 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-10 15:27:39,398 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-10 15:27:39,398 INFO L280 TraceCheckUtils]: 25: Hoare triple {257#false} ~cond := #in~cond; {257#false} is VALID [2020-07-10 15:27:39,399 INFO L280 TraceCheckUtils]: 26: Hoare triple {257#false} assume 0 == ~cond; {257#false} is VALID [2020-07-10 15:27:39,399 INFO L280 TraceCheckUtils]: 27: Hoare triple {257#false} assume !false; {257#false} is VALID [2020-07-10 15:27:39,401 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-10 15:27:39,402 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-10 15:27:39,402 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 6 [2020-07-10 15:27:39,404 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331040345] [2020-07-10 15:27:39,405 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2020-07-10 15:27:39,406 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:27:39,406 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-10 15:27:39,454 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-10 15:27:39,454 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-10 15:27:39,454 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:27:39,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-10 15:27:39,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-07-10 15:27:39,456 INFO L87 Difference]: Start difference. First operand 30 states and 35 transitions. Second operand 6 states. [2020-07-10 15:27:39,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:27:39,857 INFO L93 Difference]: Finished difference Result 65 states and 80 transitions. [2020-07-10 15:27:39,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-10 15:27:39,857 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2020-07-10 15:27:39,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:27:39,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 15:27:39,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 79 transitions. [2020-07-10 15:27:39,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 15:27:39,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 79 transitions. [2020-07-10 15:27:39,868 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 79 transitions. [2020-07-10 15:27:40,011 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-10 15:27:40,014 INFO L225 Difference]: With dead ends: 65 [2020-07-10 15:27:40,014 INFO L226 Difference]: Without dead ends: 44 [2020-07-10 15:27:40,016 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-10 15:27:40,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2020-07-10 15:27:40,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 34. [2020-07-10 15:27:40,077 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:27:40,078 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand 34 states. [2020-07-10 15:27:40,079 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 34 states. [2020-07-10 15:27:40,079 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 34 states. [2020-07-10 15:27:40,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:27:40,088 INFO L93 Difference]: Finished difference Result 44 states and 53 transitions. [2020-07-10 15:27:40,088 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 53 transitions. [2020-07-10 15:27:40,090 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:27:40,090 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:27:40,090 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 44 states. [2020-07-10 15:27:40,090 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 44 states. [2020-07-10 15:27:40,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:27:40,102 INFO L93 Difference]: Finished difference Result 44 states and 53 transitions. [2020-07-10 15:27:40,102 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 53 transitions. [2020-07-10 15:27:40,103 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:27:40,103 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:27:40,103 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:27:40,103 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:27:40,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2020-07-10 15:27:40,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 39 transitions. [2020-07-10 15:27:40,109 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 39 transitions. Word has length 28 [2020-07-10 15:27:40,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:27:40,114 INFO L479 AbstractCegarLoop]: Abstraction has 34 states and 39 transitions. [2020-07-10 15:27:40,115 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-10 15:27:40,115 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 39 transitions. [2020-07-10 15:27:40,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2020-07-10 15:27:40,116 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:27:40,118 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-10 15:27:40,332 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2020-07-10 15:27:40,333 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:27:40,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:27:40,335 INFO L82 PathProgramCache]: Analyzing trace with hash 1067646812, now seen corresponding path program 2 times [2020-07-10 15:27:40,335 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:27:40,336 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199974492] [2020-07-10 15:27:40,337 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:27:40,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:27:40,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:27:40,533 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-10 15:27:40,533 INFO L280 TraceCheckUtils]: 1: Hoare triple {576#true} assume true; {576#true} is VALID [2020-07-10 15:27:40,534 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {576#true} {576#true} #115#return; {576#true} is VALID [2020-07-10 15:27:40,535 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-10 15:27:40,536 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-10 15:27:40,536 INFO L280 TraceCheckUtils]: 2: Hoare triple {576#true} assume true; {576#true} is VALID [2020-07-10 15:27:40,537 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {576#true} {576#true} #115#return; {576#true} is VALID [2020-07-10 15:27:40,537 INFO L263 TraceCheckUtils]: 4: Hoare triple {576#true} call #t~ret14 := main(); {576#true} is VALID [2020-07-10 15:27:40,538 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-10 15:27:40,540 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-10 15:27:40,543 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-10 15:27:40,545 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-10 15:27:40,546 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-10 15:27:40,547 INFO L280 TraceCheckUtils]: 10: Hoare triple {583#(<= main_~i~0 2)} assume !(~i~0 < 5); {577#false} is VALID [2020-07-10 15:27:40,547 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-10 15:27:40,548 INFO L280 TraceCheckUtils]: 12: Hoare triple {577#false} assume !!(0 == #t~mem2);havoc #t~mem2;~i~0 := 0; {577#false} is VALID [2020-07-10 15:27:40,548 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-10 15:27:40,548 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-10 15:27:40,549 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-10 15:27:40,549 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-10 15:27:40,549 INFO L280 TraceCheckUtils]: 17: Hoare triple {577#false} assume !(~i~0 < 5); {577#false} is VALID [2020-07-10 15:27:40,550 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-10 15:27:40,550 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-10 15:27:40,550 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-10 15:27:40,551 INFO L280 TraceCheckUtils]: 21: Hoare triple {577#false} assume !(0 != #t~mem6);havoc #t~mem6; {577#false} is VALID [2020-07-10 15:27:40,551 INFO L280 TraceCheckUtils]: 22: Hoare triple {577#false} ~nc_B~0 := 0; {577#false} is VALID [2020-07-10 15:27:40,551 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-10 15:27:40,551 INFO L280 TraceCheckUtils]: 24: Hoare triple {577#false} assume !(0 != #t~mem8);havoc #t~mem8; {577#false} is VALID [2020-07-10 15:27:40,552 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-10 15:27:40,552 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-10 15:27:40,552 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-10 15:27:40,553 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-10 15:27:40,553 INFO L280 TraceCheckUtils]: 29: Hoare triple {577#false} ~cond := #in~cond; {577#false} is VALID [2020-07-10 15:27:40,553 INFO L280 TraceCheckUtils]: 30: Hoare triple {577#false} assume 0 == ~cond; {577#false} is VALID [2020-07-10 15:27:40,553 INFO L280 TraceCheckUtils]: 31: Hoare triple {577#false} assume !false; {577#false} is VALID [2020-07-10 15:27:40,555 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-10 15:27:40,556 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199974492] [2020-07-10 15:27:40,556 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [95604976] [2020-07-10 15:27:40,557 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-10 15:27:40,612 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-10 15:27:40,613 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-10 15:27:40,615 INFO L264 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-10 15:27:40,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:27:40,631 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 15:27:40,721 INFO L263 TraceCheckUtils]: 0: Hoare triple {576#true} call ULTIMATE.init(); {576#true} is VALID [2020-07-10 15:27:40,722 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-10 15:27:40,722 INFO L280 TraceCheckUtils]: 2: Hoare triple {576#true} assume true; {576#true} is VALID [2020-07-10 15:27:40,723 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {576#true} {576#true} #115#return; {576#true} is VALID [2020-07-10 15:27:40,727 INFO L263 TraceCheckUtils]: 4: Hoare triple {576#true} call #t~ret14 := main(); {576#true} is VALID [2020-07-10 15:27:40,742 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-10 15:27:40,744 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-10 15:27:40,745 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-10 15:27:40,747 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-10 15:27:40,752 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-10 15:27:40,754 INFO L280 TraceCheckUtils]: 10: Hoare triple {583#(<= main_~i~0 2)} assume !(~i~0 < 5); {577#false} is VALID [2020-07-10 15:27:40,754 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-10 15:27:40,754 INFO L280 TraceCheckUtils]: 12: Hoare triple {577#false} assume !!(0 == #t~mem2);havoc #t~mem2;~i~0 := 0; {577#false} is VALID [2020-07-10 15:27:40,755 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-10 15:27:40,755 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-10 15:27:40,756 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-10 15:27:40,756 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-10 15:27:40,756 INFO L280 TraceCheckUtils]: 17: Hoare triple {577#false} assume !(~i~0 < 5); {577#false} is VALID [2020-07-10 15:27:40,757 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-10 15:27:40,757 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-10 15:27:40,757 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-10 15:27:40,758 INFO L280 TraceCheckUtils]: 21: Hoare triple {577#false} assume !(0 != #t~mem6);havoc #t~mem6; {577#false} is VALID [2020-07-10 15:27:40,758 INFO L280 TraceCheckUtils]: 22: Hoare triple {577#false} ~nc_B~0 := 0; {577#false} is VALID [2020-07-10 15:27:40,759 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-10 15:27:40,759 INFO L280 TraceCheckUtils]: 24: Hoare triple {577#false} assume !(0 != #t~mem8);havoc #t~mem8; {577#false} is VALID [2020-07-10 15:27:40,760 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-10 15:27:40,760 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-10 15:27:40,760 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-10 15:27:40,761 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-10 15:27:40,761 INFO L280 TraceCheckUtils]: 29: Hoare triple {577#false} ~cond := #in~cond; {577#false} is VALID [2020-07-10 15:27:40,761 INFO L280 TraceCheckUtils]: 30: Hoare triple {577#false} assume 0 == ~cond; {577#false} is VALID [2020-07-10 15:27:40,762 INFO L280 TraceCheckUtils]: 31: Hoare triple {577#false} assume !false; {577#false} is VALID [2020-07-10 15:27:40,765 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-10 15:27:40,765 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-10 15:27:40,766 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 7 [2020-07-10 15:27:40,766 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924193103] [2020-07-10 15:27:40,768 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 32 [2020-07-10 15:27:40,770 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:27:40,771 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-10 15:27:40,825 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-10 15:27:40,826 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-10 15:27:40,826 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:27:40,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-10 15:27:40,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-07-10 15:27:40,827 INFO L87 Difference]: Start difference. First operand 34 states and 39 transitions. Second operand 7 states. [2020-07-10 15:27:41,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:27:41,240 INFO L93 Difference]: Finished difference Result 75 states and 92 transitions. [2020-07-10 15:27:41,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-10 15:27:41,240 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 32 [2020-07-10 15:27:41,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:27:41,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-10 15:27:41,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 89 transitions. [2020-07-10 15:27:41,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-10 15:27:41,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 89 transitions. [2020-07-10 15:27:41,253 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 89 transitions. [2020-07-10 15:27:41,392 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-10 15:27:41,398 INFO L225 Difference]: With dead ends: 75 [2020-07-10 15:27:41,399 INFO L226 Difference]: Without dead ends: 52 [2020-07-10 15:27:41,400 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-10 15:27:41,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2020-07-10 15:27:41,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 38. [2020-07-10 15:27:41,423 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:27:41,423 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand 38 states. [2020-07-10 15:27:41,424 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand 38 states. [2020-07-10 15:27:41,424 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 38 states. [2020-07-10 15:27:41,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:27:41,428 INFO L93 Difference]: Finished difference Result 52 states and 63 transitions. [2020-07-10 15:27:41,428 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 63 transitions. [2020-07-10 15:27:41,429 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:27:41,429 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:27:41,430 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 52 states. [2020-07-10 15:27:41,430 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 52 states. [2020-07-10 15:27:41,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:27:41,434 INFO L93 Difference]: Finished difference Result 52 states and 63 transitions. [2020-07-10 15:27:41,434 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 63 transitions. [2020-07-10 15:27:41,435 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:27:41,435 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:27:41,435 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:27:41,436 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:27:41,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2020-07-10 15:27:41,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 43 transitions. [2020-07-10 15:27:41,438 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 43 transitions. Word has length 32 [2020-07-10 15:27:41,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:27:41,439 INFO L479 AbstractCegarLoop]: Abstraction has 38 states and 43 transitions. [2020-07-10 15:27:41,439 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-10 15:27:41,439 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 43 transitions. [2020-07-10 15:27:41,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-07-10 15:27:41,440 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:27:41,440 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-10 15:27:41,654 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:27:41,655 INFO L427 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:27:41,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:27:41,656 INFO L82 PathProgramCache]: Analyzing trace with hash -1245957476, now seen corresponding path program 3 times [2020-07-10 15:27:41,657 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:27:41,658 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847367434] [2020-07-10 15:27:41,658 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:27:41,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:27:41,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:27:41,814 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-10 15:27:41,815 INFO L280 TraceCheckUtils]: 1: Hoare triple {946#true} assume true; {946#true} is VALID [2020-07-10 15:27:41,815 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {946#true} {946#true} #115#return; {946#true} is VALID [2020-07-10 15:27:41,817 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-10 15:27:41,817 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-10 15:27:41,818 INFO L280 TraceCheckUtils]: 2: Hoare triple {946#true} assume true; {946#true} is VALID [2020-07-10 15:27:41,818 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {946#true} {946#true} #115#return; {946#true} is VALID [2020-07-10 15:27:41,819 INFO L263 TraceCheckUtils]: 4: Hoare triple {946#true} call #t~ret14 := main(); {946#true} is VALID [2020-07-10 15:27:41,839 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-10 15:27:41,840 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-10 15:27:41,841 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-10 15:27:41,842 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-10 15:27:41,842 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-10 15:27:41,843 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-10 15:27:41,844 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-10 15:27:41,845 INFO L280 TraceCheckUtils]: 12: Hoare triple {954#(<= main_~i~0 3)} assume !(~i~0 < 5); {947#false} is VALID [2020-07-10 15:27:41,845 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-10 15:27:41,846 INFO L280 TraceCheckUtils]: 14: Hoare triple {947#false} assume !!(0 == #t~mem2);havoc #t~mem2;~i~0 := 0; {947#false} is VALID [2020-07-10 15:27:41,846 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-10 15:27:41,846 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-10 15:27:41,847 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-10 15:27:41,847 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-10 15:27:41,847 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-10 15:27:41,847 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-10 15:27:41,848 INFO L280 TraceCheckUtils]: 21: Hoare triple {947#false} assume !(~i~0 < 5); {947#false} is VALID [2020-07-10 15:27:41,848 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-10 15:27:41,848 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-10 15:27:41,848 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-10 15:27:41,849 INFO L280 TraceCheckUtils]: 25: Hoare triple {947#false} assume !(0 != #t~mem6);havoc #t~mem6; {947#false} is VALID [2020-07-10 15:27:41,849 INFO L280 TraceCheckUtils]: 26: Hoare triple {947#false} ~nc_B~0 := 0; {947#false} is VALID [2020-07-10 15:27:41,849 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-10 15:27:41,849 INFO L280 TraceCheckUtils]: 28: Hoare triple {947#false} assume !(0 != #t~mem8);havoc #t~mem8; {947#false} is VALID [2020-07-10 15:27:41,850 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-10 15:27:41,850 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-10 15:27:41,850 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-10 15:27:41,850 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-10 15:27:41,851 INFO L280 TraceCheckUtils]: 33: Hoare triple {947#false} ~cond := #in~cond; {947#false} is VALID [2020-07-10 15:27:41,851 INFO L280 TraceCheckUtils]: 34: Hoare triple {947#false} assume 0 == ~cond; {947#false} is VALID [2020-07-10 15:27:41,851 INFO L280 TraceCheckUtils]: 35: Hoare triple {947#false} assume !false; {947#false} is VALID [2020-07-10 15:27:41,854 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-10 15:27:41,854 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847367434] [2020-07-10 15:27:41,855 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2119666425] [2020-07-10 15:27:41,855 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-10 15:27:41,920 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2020-07-10 15:27:41,920 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-10 15:27:41,921 INFO L264 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-10 15:27:41,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:27:41,941 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 15:27:42,079 INFO L263 TraceCheckUtils]: 0: Hoare triple {946#true} call ULTIMATE.init(); {946#true} is VALID [2020-07-10 15:27:42,080 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-10 15:27:42,081 INFO L280 TraceCheckUtils]: 2: Hoare triple {946#true} assume true; {946#true} is VALID [2020-07-10 15:27:42,081 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {946#true} {946#true} #115#return; {946#true} is VALID [2020-07-10 15:27:42,082 INFO L263 TraceCheckUtils]: 4: Hoare triple {946#true} call #t~ret14 := main(); {946#true} is VALID [2020-07-10 15:27:42,082 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-10 15:27:42,083 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-10 15:27:42,083 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-10 15:27:42,083 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-10 15:27:42,084 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-10 15:27:42,084 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-10 15:27:42,084 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-10 15:27:42,084 INFO L280 TraceCheckUtils]: 12: Hoare triple {946#true} assume !(~i~0 < 5); {946#true} is VALID [2020-07-10 15:27:42,084 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-10 15:27:42,086 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-10 15:27:42,086 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-10 15:27:42,087 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-10 15:27:42,088 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-10 15:27:42,089 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-10 15:27:42,090 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-10 15:27:42,091 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-10 15:27:42,092 INFO L280 TraceCheckUtils]: 21: Hoare triple {954#(<= main_~i~0 3)} assume !(~i~0 < 5); {947#false} is VALID [2020-07-10 15:27:42,092 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-10 15:27:42,092 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-10 15:27:42,093 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-10 15:27:42,093 INFO L280 TraceCheckUtils]: 25: Hoare triple {947#false} assume !(0 != #t~mem6);havoc #t~mem6; {947#false} is VALID [2020-07-10 15:27:42,093 INFO L280 TraceCheckUtils]: 26: Hoare triple {947#false} ~nc_B~0 := 0; {947#false} is VALID [2020-07-10 15:27:42,093 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-10 15:27:42,094 INFO L280 TraceCheckUtils]: 28: Hoare triple {947#false} assume !(0 != #t~mem8);havoc #t~mem8; {947#false} is VALID [2020-07-10 15:27:42,094 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-10 15:27:42,094 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-10 15:27:42,094 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-10 15:27:42,095 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-10 15:27:42,095 INFO L280 TraceCheckUtils]: 33: Hoare triple {947#false} ~cond := #in~cond; {947#false} is VALID [2020-07-10 15:27:42,095 INFO L280 TraceCheckUtils]: 34: Hoare triple {947#false} assume 0 == ~cond; {947#false} is VALID [2020-07-10 15:27:42,096 INFO L280 TraceCheckUtils]: 35: Hoare triple {947#false} assume !false; {947#false} is VALID [2020-07-10 15:27:42,097 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-10 15:27:42,098 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-10 15:27:42,098 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 8 [2020-07-10 15:27:42,099 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183201556] [2020-07-10 15:27:42,099 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 36 [2020-07-10 15:27:42,100 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:27:42,100 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-10 15:27:42,168 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-10 15:27:42,168 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-10 15:27:42,169 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:27:42,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-10 15:27:42,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-07-10 15:27:42,170 INFO L87 Difference]: Start difference. First operand 38 states and 43 transitions. Second operand 8 states. [2020-07-10 15:27:42,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:27:42,600 INFO L93 Difference]: Finished difference Result 85 states and 104 transitions. [2020-07-10 15:27:42,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-10 15:27:42,601 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 36 [2020-07-10 15:27:42,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:27:42,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-10 15:27:42,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 99 transitions. [2020-07-10 15:27:42,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-10 15:27:42,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 99 transitions. [2020-07-10 15:27:42,609 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 99 transitions. [2020-07-10 15:27:42,734 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-10 15:27:42,737 INFO L225 Difference]: With dead ends: 85 [2020-07-10 15:27:42,737 INFO L226 Difference]: Without dead ends: 60 [2020-07-10 15:27:42,738 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-10 15:27:42,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2020-07-10 15:27:42,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 42. [2020-07-10 15:27:42,768 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:27:42,768 INFO L82 GeneralOperation]: Start isEquivalent. First operand 60 states. Second operand 42 states. [2020-07-10 15:27:42,768 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand 42 states. [2020-07-10 15:27:42,768 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 42 states. [2020-07-10 15:27:42,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:27:42,771 INFO L93 Difference]: Finished difference Result 60 states and 73 transitions. [2020-07-10 15:27:42,772 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 73 transitions. [2020-07-10 15:27:42,774 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:27:42,774 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:27:42,775 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 60 states. [2020-07-10 15:27:42,775 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 60 states. [2020-07-10 15:27:42,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:27:42,784 INFO L93 Difference]: Finished difference Result 60 states and 73 transitions. [2020-07-10 15:27:42,785 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 73 transitions. [2020-07-10 15:27:42,788 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:27:42,788 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:27:42,788 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:27:42,788 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:27:42,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-07-10 15:27:42,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 47 transitions. [2020-07-10 15:27:42,791 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 47 transitions. Word has length 36 [2020-07-10 15:27:42,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:27:42,794 INFO L479 AbstractCegarLoop]: Abstraction has 42 states and 47 transitions. [2020-07-10 15:27:42,795 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-10 15:27:42,795 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2020-07-10 15:27:42,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-07-10 15:27:42,800 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:27:42,800 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-10 15:27:43,015 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:27:43,016 INFO L427 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:27:43,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:27:43,017 INFO L82 PathProgramCache]: Analyzing trace with hash -1106103076, now seen corresponding path program 4 times [2020-07-10 15:27:43,017 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:27:43,018 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999867648] [2020-07-10 15:27:43,018 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:27:43,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:27:43,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:27:43,230 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-10 15:27:43,231 INFO L280 TraceCheckUtils]: 1: Hoare triple {1366#true} assume true; {1366#true} is VALID [2020-07-10 15:27:43,231 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1366#true} {1366#true} #115#return; {1366#true} is VALID [2020-07-10 15:27:43,251 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-10 15:27:43,251 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-10 15:27:43,252 INFO L280 TraceCheckUtils]: 2: Hoare triple {1366#true} assume true; {1366#true} is VALID [2020-07-10 15:27:43,252 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1366#true} {1366#true} #115#return; {1366#true} is VALID [2020-07-10 15:27:43,253 INFO L263 TraceCheckUtils]: 4: Hoare triple {1366#true} call #t~ret14 := main(); {1366#true} is VALID [2020-07-10 15:27:43,258 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-10 15:27:43,258 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-10 15:27:43,259 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-10 15:27:43,260 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-10 15:27:43,261 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-10 15:27:43,262 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-10 15:27:43,263 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-10 15:27:43,264 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-10 15:27:43,266 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-10 15:27:43,267 INFO L280 TraceCheckUtils]: 14: Hoare triple {1375#(<= main_~i~0 4)} assume !(~i~0 < 5); {1367#false} is VALID [2020-07-10 15:27:43,267 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-10 15:27:43,268 INFO L280 TraceCheckUtils]: 16: Hoare triple {1367#false} assume !!(0 == #t~mem2);havoc #t~mem2;~i~0 := 0; {1367#false} is VALID [2020-07-10 15:27:43,268 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-10 15:27:43,268 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-10 15:27:43,269 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-10 15:27:43,269 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-10 15:27:43,269 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-10 15:27:43,271 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-10 15:27:43,271 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-10 15:27:43,271 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-10 15:27:43,272 INFO L280 TraceCheckUtils]: 25: Hoare triple {1367#false} assume !(~i~0 < 5); {1367#false} is VALID [2020-07-10 15:27:43,272 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-10 15:27:43,274 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-10 15:27:43,274 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-10 15:27:43,274 INFO L280 TraceCheckUtils]: 29: Hoare triple {1367#false} assume !(0 != #t~mem6);havoc #t~mem6; {1367#false} is VALID [2020-07-10 15:27:43,275 INFO L280 TraceCheckUtils]: 30: Hoare triple {1367#false} ~nc_B~0 := 0; {1367#false} is VALID [2020-07-10 15:27:43,275 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-10 15:27:43,275 INFO L280 TraceCheckUtils]: 32: Hoare triple {1367#false} assume !(0 != #t~mem8);havoc #t~mem8; {1367#false} is VALID [2020-07-10 15:27:43,275 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-10 15:27:43,276 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-10 15:27:43,276 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-10 15:27:43,276 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-10 15:27:43,276 INFO L280 TraceCheckUtils]: 37: Hoare triple {1367#false} ~cond := #in~cond; {1367#false} is VALID [2020-07-10 15:27:43,276 INFO L280 TraceCheckUtils]: 38: Hoare triple {1367#false} assume 0 == ~cond; {1367#false} is VALID [2020-07-10 15:27:43,277 INFO L280 TraceCheckUtils]: 39: Hoare triple {1367#false} assume !false; {1367#false} is VALID [2020-07-10 15:27:43,279 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-10 15:27:43,280 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999867648] [2020-07-10 15:27:43,280 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [842486114] [2020-07-10 15:27:43,280 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-10 15:27:43,332 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-07-10 15:27:43,333 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-10 15:27:43,334 INFO L264 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-10 15:27:43,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:27:43,350 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 15:27:43,454 INFO L263 TraceCheckUtils]: 0: Hoare triple {1366#true} call ULTIMATE.init(); {1366#true} is VALID [2020-07-10 15:27:43,454 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-10 15:27:43,455 INFO L280 TraceCheckUtils]: 2: Hoare triple {1366#true} assume true; {1366#true} is VALID [2020-07-10 15:27:43,455 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1366#true} {1366#true} #115#return; {1366#true} is VALID [2020-07-10 15:27:43,455 INFO L263 TraceCheckUtils]: 4: Hoare triple {1366#true} call #t~ret14 := main(); {1366#true} is VALID [2020-07-10 15:27:43,457 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-10 15:27:43,458 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-10 15:27:43,459 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-10 15:27:43,460 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-10 15:27:43,461 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-10 15:27:43,462 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-10 15:27:43,463 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-10 15:27:43,464 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-10 15:27:43,465 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-10 15:27:43,467 INFO L280 TraceCheckUtils]: 14: Hoare triple {1375#(<= main_~i~0 4)} assume !(~i~0 < 5); {1367#false} is VALID [2020-07-10 15:27:43,467 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-10 15:27:43,467 INFO L280 TraceCheckUtils]: 16: Hoare triple {1367#false} assume !!(0 == #t~mem2);havoc #t~mem2;~i~0 := 0; {1367#false} is VALID [2020-07-10 15:27:43,468 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-10 15:27:43,468 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-10 15:27:43,468 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-10 15:27:43,469 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-10 15:27:43,469 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-10 15:27:43,469 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-10 15:27:43,469 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-10 15:27:43,470 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-10 15:27:43,470 INFO L280 TraceCheckUtils]: 25: Hoare triple {1367#false} assume !(~i~0 < 5); {1367#false} is VALID [2020-07-10 15:27:43,470 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-10 15:27:43,470 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-10 15:27:43,471 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-10 15:27:43,471 INFO L280 TraceCheckUtils]: 29: Hoare triple {1367#false} assume !(0 != #t~mem6);havoc #t~mem6; {1367#false} is VALID [2020-07-10 15:27:43,471 INFO L280 TraceCheckUtils]: 30: Hoare triple {1367#false} ~nc_B~0 := 0; {1367#false} is VALID [2020-07-10 15:27:43,472 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-10 15:27:43,472 INFO L280 TraceCheckUtils]: 32: Hoare triple {1367#false} assume !(0 != #t~mem8);havoc #t~mem8; {1367#false} is VALID [2020-07-10 15:27:43,472 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-10 15:27:43,473 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-10 15:27:43,473 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-10 15:27:43,474 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-10 15:27:43,474 INFO L280 TraceCheckUtils]: 37: Hoare triple {1367#false} ~cond := #in~cond; {1367#false} is VALID [2020-07-10 15:27:43,474 INFO L280 TraceCheckUtils]: 38: Hoare triple {1367#false} assume 0 == ~cond; {1367#false} is VALID [2020-07-10 15:27:43,474 INFO L280 TraceCheckUtils]: 39: Hoare triple {1367#false} assume !false; {1367#false} is VALID [2020-07-10 15:27:43,476 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-10 15:27:43,476 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-10 15:27:43,476 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 9 [2020-07-10 15:27:43,477 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797367281] [2020-07-10 15:27:43,478 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 40 [2020-07-10 15:27:43,478 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:27:43,478 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2020-07-10 15:27:43,528 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-10 15:27:43,529 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-10 15:27:43,529 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:27:43,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-10 15:27:43,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-07-10 15:27:43,530 INFO L87 Difference]: Start difference. First operand 42 states and 47 transitions. Second operand 9 states. [2020-07-10 15:27:43,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:27:43,995 INFO L93 Difference]: Finished difference Result 93 states and 114 transitions. [2020-07-10 15:27:43,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-10 15:27:43,995 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 40 [2020-07-10 15:27:43,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:27:43,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-10 15:27:43,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 107 transitions. [2020-07-10 15:27:43,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-10 15:27:44,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 107 transitions. [2020-07-10 15:27:44,002 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 107 transitions. [2020-07-10 15:27:44,143 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-10 15:27:44,148 INFO L225 Difference]: With dead ends: 93 [2020-07-10 15:27:44,148 INFO L226 Difference]: Without dead ends: 66 [2020-07-10 15:27:44,150 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-10 15:27:44,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2020-07-10 15:27:44,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 46. [2020-07-10 15:27:44,175 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:27:44,175 INFO L82 GeneralOperation]: Start isEquivalent. First operand 66 states. Second operand 46 states. [2020-07-10 15:27:44,175 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand 46 states. [2020-07-10 15:27:44,175 INFO L87 Difference]: Start difference. First operand 66 states. Second operand 46 states. [2020-07-10 15:27:44,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:27:44,181 INFO L93 Difference]: Finished difference Result 66 states and 81 transitions. [2020-07-10 15:27:44,182 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 81 transitions. [2020-07-10 15:27:44,182 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:27:44,183 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:27:44,183 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand 66 states. [2020-07-10 15:27:44,183 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 66 states. [2020-07-10 15:27:44,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:27:44,190 INFO L93 Difference]: Finished difference Result 66 states and 81 transitions. [2020-07-10 15:27:44,190 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 81 transitions. [2020-07-10 15:27:44,190 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:27:44,190 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:27:44,191 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:27:44,191 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:27:44,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2020-07-10 15:27:44,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 51 transitions. [2020-07-10 15:27:44,194 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 51 transitions. Word has length 40 [2020-07-10 15:27:44,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:27:44,194 INFO L479 AbstractCegarLoop]: Abstraction has 46 states and 51 transitions. [2020-07-10 15:27:44,194 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-10 15:27:44,194 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 51 transitions. [2020-07-10 15:27:44,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2020-07-10 15:27:44,195 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:27:44,195 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-10 15:27:44,403 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:27:44,403 INFO L427 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:27:44,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:27:44,404 INFO L82 PathProgramCache]: Analyzing trace with hash 1061537308, now seen corresponding path program 5 times [2020-07-10 15:27:44,405 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:27:44,405 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926128834] [2020-07-10 15:27:44,405 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:27:44,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-10 15:27:44,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-10 15:27:44,577 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-10 15:27:44,577 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-10 15:27:44,578 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-10 15:27:44,630 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2020-07-10 15:27:44,631 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-10 15:27:44,631 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-10 15:27:44,631 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2020-07-10 15:27:44,631 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2020-07-10 15:27:44,632 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2020-07-10 15:27:44,632 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-10 15:27:44,632 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-10 15:27:44,632 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-10 15:27:44,632 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2020-07-10 15:27:44,632 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2020-07-10 15:27:44,632 WARN L170 areAnnotationChecker]: L24-3 has no Hoare annotation [2020-07-10 15:27:44,633 WARN L170 areAnnotationChecker]: L24-3 has no Hoare annotation [2020-07-10 15:27:44,633 WARN L170 areAnnotationChecker]: L24-3 has no Hoare annotation [2020-07-10 15:27:44,633 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation [2020-07-10 15:27:44,633 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation [2020-07-10 15:27:44,633 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-10 15:27:44,633 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-10 15:27:44,633 WARN L170 areAnnotationChecker]: L5-2 has no Hoare annotation [2020-07-10 15:27:44,634 WARN L170 areAnnotationChecker]: L24-4 has no Hoare annotation [2020-07-10 15:27:44,634 WARN L170 areAnnotationChecker]: L24-2 has no Hoare annotation [2020-07-10 15:27:44,634 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2020-07-10 15:27:44,634 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2020-07-10 15:27:44,634 WARN L170 areAnnotationChecker]: L8-2 has no Hoare annotation [2020-07-10 15:27:44,634 WARN L170 areAnnotationChecker]: L26 has no Hoare annotation [2020-07-10 15:27:44,634 WARN L170 areAnnotationChecker]: L26 has no Hoare annotation [2020-07-10 15:27:44,635 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-10 15:27:44,635 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-10 15:27:44,635 WARN L170 areAnnotationChecker]: L28-3 has no Hoare annotation [2020-07-10 15:27:44,635 WARN L170 areAnnotationChecker]: L28-3 has no Hoare annotation [2020-07-10 15:27:44,635 WARN L170 areAnnotationChecker]: L28-3 has no Hoare annotation [2020-07-10 15:27:44,635 WARN L170 areAnnotationChecker]: L60-1 has no Hoare annotation [2020-07-10 15:27:44,635 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-10 15:27:44,636 WARN L170 areAnnotationChecker]: L28-4 has no Hoare annotation [2020-07-10 15:27:44,636 WARN L170 areAnnotationChecker]: L28-2 has no Hoare annotation [2020-07-10 15:27:44,636 WARN L170 areAnnotationChecker]: L30 has no Hoare annotation [2020-07-10 15:27:44,636 WARN L170 areAnnotationChecker]: L30 has no Hoare annotation [2020-07-10 15:27:44,636 WARN L170 areAnnotationChecker]: L33-3 has no Hoare annotation [2020-07-10 15:27:44,637 WARN L170 areAnnotationChecker]: L33-3 has no Hoare annotation [2020-07-10 15:27:44,637 WARN L170 areAnnotationChecker]: L33-4 has no Hoare annotation [2020-07-10 15:27:44,637 WARN L170 areAnnotationChecker]: L33-1 has no Hoare annotation [2020-07-10 15:27:44,637 WARN L170 areAnnotationChecker]: L33-1 has no Hoare annotation [2020-07-10 15:27:44,637 WARN L170 areAnnotationChecker]: L37-3 has no Hoare annotation [2020-07-10 15:27:44,637 WARN L170 areAnnotationChecker]: L37-3 has no Hoare annotation [2020-07-10 15:27:44,637 WARN L170 areAnnotationChecker]: L37-4 has no Hoare annotation [2020-07-10 15:27:44,638 WARN L170 areAnnotationChecker]: L37-4 has no Hoare annotation [2020-07-10 15:27:44,638 WARN L170 areAnnotationChecker]: L37-1 has no Hoare annotation [2020-07-10 15:27:44,638 WARN L170 areAnnotationChecker]: L37-1 has no Hoare annotation [2020-07-10 15:27:44,638 WARN L170 areAnnotationChecker]: L46-2 has no Hoare annotation [2020-07-10 15:27:44,638 WARN L170 areAnnotationChecker]: L46-2 has no Hoare annotation [2020-07-10 15:27:44,638 WARN L170 areAnnotationChecker]: L46-2 has no Hoare annotation [2020-07-10 15:27:44,639 WARN L170 areAnnotationChecker]: L44-2 has no Hoare annotation [2020-07-10 15:27:44,639 WARN L170 areAnnotationChecker]: L46 has no Hoare annotation [2020-07-10 15:27:44,639 WARN L170 areAnnotationChecker]: L46 has no Hoare annotation [2020-07-10 15:27:44,639 WARN L170 areAnnotationChecker]: L60 has no Hoare annotation [2020-07-10 15:27:44,639 WARN L170 areAnnotationChecker]: L60 has no Hoare annotation [2020-07-10 15:27:44,640 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-10 15:27:44,642 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.07 03:27:44 BoogieIcfgContainer [2020-07-10 15:27:44,643 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-10 15:27:44,646 INFO L168 Benchmark]: Toolchain (without parser) took 8400.11 ms. Allocated memory was 143.1 MB in the beginning and 293.1 MB in the end (delta: 149.9 MB). Free memory was 100.8 MB in the beginning and 113.6 MB in the end (delta: -12.8 MB). Peak memory consumption was 137.1 MB. Max. memory is 7.1 GB. [2020-07-10 15:27:44,647 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 143.1 MB. Free memory is still 119.0 MB. There was no memory consumed. Max. memory is 7.1 GB. [2020-07-10 15:27:44,648 INFO L168 Benchmark]: CACSL2BoogieTranslator took 448.63 ms. Allocated memory was 143.1 MB in the beginning and 201.3 MB in the end (delta: 58.2 MB). Free memory was 100.8 MB in the beginning and 179.9 MB in the end (delta: -79.1 MB). Peak memory consumption was 21.2 MB. Max. memory is 7.1 GB. [2020-07-10 15:27:44,648 INFO L168 Benchmark]: Boogie Preprocessor took 110.26 ms. Allocated memory is still 201.3 MB. Free memory was 179.9 MB in the beginning and 177.5 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.4 MB. Max. memory is 7.1 GB. [2020-07-10 15:27:44,649 INFO L168 Benchmark]: RCFGBuilder took 626.19 ms. Allocated memory is still 201.3 MB. Free memory was 177.5 MB in the beginning and 148.3 MB in the end (delta: 29.1 MB). Peak memory consumption was 29.1 MB. Max. memory is 7.1 GB. [2020-07-10 15:27:44,650 INFO L168 Benchmark]: TraceAbstraction took 7205.42 ms. Allocated memory was 201.3 MB in the beginning and 293.1 MB in the end (delta: 91.8 MB). Free memory was 148.3 MB in the beginning and 113.6 MB in the end (delta: 34.7 MB). Peak memory consumption was 126.5 MB. Max. memory is 7.1 GB. [2020-07-10 15:27:44,653 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.26 ms. Allocated memory is still 143.1 MB. Free memory is still 119.0 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 448.63 ms. Allocated memory was 143.1 MB in the beginning and 201.3 MB in the end (delta: 58.2 MB). Free memory was 100.8 MB in the beginning and 179.9 MB in the end (delta: -79.1 MB). Peak memory consumption was 21.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 110.26 ms. Allocated memory is still 201.3 MB. Free memory was 179.9 MB in the beginning and 177.5 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 626.19 ms. Allocated memory is still 201.3 MB. Free memory was 177.5 MB in the beginning and 148.3 MB in the end (delta: 29.1 MB). Peak memory consumption was 29.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 7205.42 ms. Allocated memory was 201.3 MB in the beginning and 293.1 MB in the end (delta: 91.8 MB). Free memory was 148.3 MB in the beginning and 113.6 MB in the end (delta: 34.7 MB). Peak memory consumption was 126.5 MB. 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)<