/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 --traceabstraction.compute.interpolants.along.a.counterexample Craig_NestedInterpolation --traceabstraction.use.separate.solver.for.trace.checks true -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/loops/string-2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-8fc6572 [2020-07-11 02:27:46,923 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-11 02:27:46,926 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-11 02:27:46,945 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-11 02:27:46,946 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-11 02:27:46,948 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-11 02:27:46,950 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-11 02:27:46,964 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-11 02:27:46,965 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-11 02:27:46,967 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-11 02:27:46,970 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-11 02:27:46,971 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-11 02:27:46,972 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-11 02:27:46,976 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-11 02:27:46,978 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-11 02:27:46,979 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-11 02:27:46,980 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-11 02:27:46,982 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-11 02:27:46,984 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-11 02:27:46,991 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-11 02:27:46,995 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-11 02:27:46,998 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-11 02:27:47,000 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-11 02:27:47,001 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-11 02:27:47,003 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-11 02:27:47,003 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-11 02:27:47,003 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-11 02:27:47,004 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-11 02:27:47,005 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-11 02:27:47,006 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-11 02:27:47,006 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-11 02:27:47,007 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-11 02:27:47,007 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-11 02:27:47,008 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-11 02:27:47,009 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-11 02:27:47,009 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-11 02:27:47,010 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-11 02:27:47,010 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-11 02:27:47,010 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-11 02:27:47,011 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-11 02:27:47,012 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-11 02:27:47,013 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-11 02:27:47,022 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-11 02:27:47,023 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-11 02:27:47,024 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-11 02:27:47,024 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-11 02:27:47,024 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-11 02:27:47,025 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-11 02:27:47,025 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-11 02:27:47,025 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-11 02:27:47,025 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-11 02:27:47,025 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-11 02:27:47,027 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-11 02:27:47,027 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-11 02:27:47,028 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-11 02:27:47,028 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-11 02:27:47,028 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-11 02:27:47,028 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-11 02:27:47,029 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-11 02:27:47,029 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-11 02:27:47,029 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-11 02:27:47,029 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-11 02:27:47,029 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-11 02:27:47,030 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-11 02:27:47,030 INFO L138 SettingsManager]: * Use separate solver for trace checks=false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> Craig_NestedInterpolation Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use separate solver for trace checks -> true [2020-07-11 02:27:47,311 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-11 02:27:47,325 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-11 02:27:47,328 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-11 02:27:47,330 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-11 02:27:47,330 INFO L275 PluginConnector]: CDTParser initialized [2020-07-11 02:27:47,331 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-11 02:27:47,407 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8010e72b9/afaa674c126d4c33874d53df4435fc59/FLAGfe2fbc446 [2020-07-11 02:27:47,888 INFO L306 CDTParser]: Found 1 translation units. [2020-07-11 02:27:47,888 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/string-2.i [2020-07-11 02:27:47,895 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8010e72b9/afaa674c126d4c33874d53df4435fc59/FLAGfe2fbc446 [2020-07-11 02:27:48,225 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8010e72b9/afaa674c126d4c33874d53df4435fc59 [2020-07-11 02:27:48,234 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-11 02:27:48,236 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-11 02:27:48,237 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-11 02:27:48,237 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-11 02:27:48,240 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-11 02:27:48,242 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.07 02:27:48" (1/1) ... [2020-07-11 02:27:48,244 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72c53f28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:27:48, skipping insertion in model container [2020-07-11 02:27:48,245 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.07 02:27:48" (1/1) ... [2020-07-11 02:27:48,252 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-11 02:27:48,271 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-11 02:27:48,501 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-11 02:27:48,507 INFO L203 MainTranslator]: Completed pre-run [2020-07-11 02:27:48,539 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-11 02:27:48,561 INFO L208 MainTranslator]: Completed translation [2020-07-11 02:27:48,562 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:27:48 WrapperNode [2020-07-11 02:27:48,562 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-11 02:27:48,563 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-11 02:27:48,563 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-11 02:27:48,563 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-11 02:27:48,665 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:27:48" (1/1) ... [2020-07-11 02:27:48,665 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:27:48" (1/1) ... [2020-07-11 02:27:48,688 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:27:48" (1/1) ... [2020-07-11 02:27:48,689 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:27:48" (1/1) ... [2020-07-11 02:27:48,720 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:27:48" (1/1) ... [2020-07-11 02:27:48,735 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:27:48" (1/1) ... [2020-07-11 02:27:48,738 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:27:48" (1/1) ... [2020-07-11 02:27:48,745 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-11 02:27:48,746 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-11 02:27:48,746 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-11 02:27:48,746 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-11 02:27:48,747 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:27:48" (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-11 02:27:48,807 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-11 02:27:48,807 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-11 02:27:48,808 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-07-11 02:27:48,808 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-11 02:27:48,808 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-11 02:27:48,808 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-11 02:27:48,808 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-11 02:27:48,808 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-07-11 02:27:48,808 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-11 02:27:48,808 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2020-07-11 02:27:48,809 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-11 02:27:48,809 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-11 02:27:48,809 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-11 02:27:48,809 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-11 02:27:48,809 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-11 02:27:48,809 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-11 02:27:48,810 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-11 02:27:49,381 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-11 02:27:49,381 INFO L295 CfgBuilder]: Removed 5 assume(true) statements. [2020-07-11 02:27:49,387 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 02:27:49 BoogieIcfgContainer [2020-07-11 02:27:49,387 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-11 02:27:49,388 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-11 02:27:49,389 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-11 02:27:49,392 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-11 02:27:49,393 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.07 02:27:48" (1/3) ... [2020-07-11 02:27:49,394 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4642bbaf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.07 02:27:49, skipping insertion in model container [2020-07-11 02:27:49,394 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:27:48" (2/3) ... [2020-07-11 02:27:49,395 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4642bbaf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.07 02:27:49, skipping insertion in model container [2020-07-11 02:27:49,395 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 02:27:49" (3/3) ... [2020-07-11 02:27:49,397 INFO L109 eAbstractionObserver]: Analyzing ICFG string-2.i [2020-07-11 02:27:49,410 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-11 02:27:49,419 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-11 02:27:49,435 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-11 02:27:49,459 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-11 02:27:49,459 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-11 02:27:49,459 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-07-11 02:27:49,460 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-11 02:27:49,460 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-11 02:27:49,460 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-11 02:27:49,461 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-11 02:27:49,461 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-11 02:27:49,480 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states. [2020-07-11 02:27:49,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-07-11 02:27:49,493 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 02:27:49,494 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-11 02:27:49,495 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 02:27:49,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 02:27:49,502 INFO L82 PathProgramCache]: Analyzing trace with hash -768807104, now seen corresponding path program 1 times [2020-07-11 02:27:49,512 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 02:27:49,513 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [693794972] [2020-07-11 02:27:49,513 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 02:27:49,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:27:49,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:27:49,740 INFO L280 TraceCheckUtils]: 0: Hoare triple {115#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {108#true} is VALID [2020-07-11 02:27:49,740 INFO L280 TraceCheckUtils]: 1: Hoare triple {108#true} #valid := #valid[0 := 0]; {108#true} is VALID [2020-07-11 02:27:49,741 INFO L280 TraceCheckUtils]: 2: Hoare triple {108#true} assume 0 < #StackHeapBarrier; {108#true} is VALID [2020-07-11 02:27:49,741 INFO L280 TraceCheckUtils]: 3: Hoare triple {108#true} assume true; {108#true} is VALID [2020-07-11 02:27:49,742 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {108#true} {108#true} #186#return; {108#true} is VALID [2020-07-11 02:27:49,745 INFO L263 TraceCheckUtils]: 0: Hoare triple {108#true} call ULTIMATE.init(); {115#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-11 02:27:49,746 INFO L280 TraceCheckUtils]: 1: Hoare triple {115#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {108#true} is VALID [2020-07-11 02:27:49,746 INFO L280 TraceCheckUtils]: 2: Hoare triple {108#true} #valid := #valid[0 := 0]; {108#true} is VALID [2020-07-11 02:27:49,747 INFO L280 TraceCheckUtils]: 3: Hoare triple {108#true} assume 0 < #StackHeapBarrier; {108#true} is VALID [2020-07-11 02:27:49,747 INFO L280 TraceCheckUtils]: 4: Hoare triple {108#true} assume true; {108#true} is VALID [2020-07-11 02:27:49,747 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {108#true} {108#true} #186#return; {108#true} is VALID [2020-07-11 02:27:49,748 INFO L263 TraceCheckUtils]: 6: Hoare triple {108#true} call #t~ret14 := main(); {108#true} is VALID [2020-07-11 02:27:49,748 INFO L280 TraceCheckUtils]: 7: Hoare triple {108#true} SUMMARY for call ~#string_A~0.base, ~#string_A~0.offset := #Ultimate.allocOnStack(5); srcloc: mainENTRY {108#true} is VALID [2020-07-11 02:27:49,749 INFO L280 TraceCheckUtils]: 8: Hoare triple {108#true} SUMMARY for call ~#string_B~0.base, ~#string_B~0.offset := #Ultimate.allocOnStack(5); srcloc: L20 {108#true} is VALID [2020-07-11 02:27:49,749 INFO L280 TraceCheckUtils]: 9: Hoare triple {108#true} havoc ~i~0; {108#true} is VALID [2020-07-11 02:27:49,749 INFO L280 TraceCheckUtils]: 10: Hoare triple {108#true} havoc ~j~0; {108#true} is VALID [2020-07-11 02:27:49,750 INFO L280 TraceCheckUtils]: 11: Hoare triple {108#true} havoc ~nc_A~0; {108#true} is VALID [2020-07-11 02:27:49,750 INFO L280 TraceCheckUtils]: 12: Hoare triple {108#true} havoc ~nc_B~0; {108#true} is VALID [2020-07-11 02:27:49,750 INFO L280 TraceCheckUtils]: 13: Hoare triple {108#true} ~found~0 := 0; {108#true} is VALID [2020-07-11 02:27:49,751 INFO L280 TraceCheckUtils]: 14: Hoare triple {108#true} ~i~0 := 0; {108#true} is VALID [2020-07-11 02:27:49,756 INFO L280 TraceCheckUtils]: 15: Hoare triple {108#true} assume !true; {109#false} is VALID [2020-07-11 02:27:49,756 INFO L280 TraceCheckUtils]: 16: Hoare triple {109#false} SUMMARY for call #t~mem2 := read~int(~#string_A~0.base, 4 + ~#string_A~0.offset, 1); srcloc: L24-7 {109#false} is VALID [2020-07-11 02:27:49,756 INFO L280 TraceCheckUtils]: 17: Hoare triple {109#false} assume !!(0 == #t~mem2); {109#false} is VALID [2020-07-11 02:27:49,757 INFO L280 TraceCheckUtils]: 18: Hoare triple {109#false} havoc #t~mem2; {109#false} is VALID [2020-07-11 02:27:49,757 INFO L280 TraceCheckUtils]: 19: Hoare triple {109#false} ~i~0 := 0; {109#false} is VALID [2020-07-11 02:27:49,758 INFO L280 TraceCheckUtils]: 20: Hoare triple {109#false} assume !true; {109#false} is VALID [2020-07-11 02:27:49,758 INFO L280 TraceCheckUtils]: 21: Hoare triple {109#false} SUMMARY for call #t~mem5 := read~int(~#string_B~0.base, 4 + ~#string_B~0.offset, 1); srcloc: L28-7 {109#false} is VALID [2020-07-11 02:27:49,759 INFO L280 TraceCheckUtils]: 22: Hoare triple {109#false} assume !!(0 == #t~mem5); {109#false} is VALID [2020-07-11 02:27:49,759 INFO L280 TraceCheckUtils]: 23: Hoare triple {109#false} havoc #t~mem5; {109#false} is VALID [2020-07-11 02:27:49,759 INFO L280 TraceCheckUtils]: 24: Hoare triple {109#false} ~nc_A~0 := 0; {109#false} is VALID [2020-07-11 02:27:49,760 INFO L280 TraceCheckUtils]: 25: Hoare triple {109#false} assume !true; {109#false} is VALID [2020-07-11 02:27:49,760 INFO L280 TraceCheckUtils]: 26: Hoare triple {109#false} ~nc_B~0 := 0; {109#false} is VALID [2020-07-11 02:27:49,761 INFO L280 TraceCheckUtils]: 27: Hoare triple {109#false} assume !true; {109#false} is VALID [2020-07-11 02:27:49,761 INFO L280 TraceCheckUtils]: 28: Hoare triple {109#false} assume !!(~nc_B~0 >= ~nc_A~0); {109#false} is VALID [2020-07-11 02:27:49,761 INFO L280 TraceCheckUtils]: 29: Hoare triple {109#false} ~j~0 := 0; {109#false} is VALID [2020-07-11 02:27:49,762 INFO L280 TraceCheckUtils]: 30: Hoare triple {109#false} ~i~0 := ~j~0; {109#false} is VALID [2020-07-11 02:27:49,762 INFO L280 TraceCheckUtils]: 31: Hoare triple {109#false} assume !true; {109#false} is VALID [2020-07-11 02:27:49,762 INFO L280 TraceCheckUtils]: 32: Hoare triple {109#false} ~found~0 := ~shiftLeft((if ~j~0 > ~nc_B~0 - 1 then 1 else 0), ~i~0); {109#false} is VALID [2020-07-11 02:27:49,763 INFO L263 TraceCheckUtils]: 33: Hoare triple {109#false} call __VERIFIER_assert((if 0 == ~found~0 || 1 == ~found~0 then 1 else 0)); {109#false} is VALID [2020-07-11 02:27:49,763 INFO L280 TraceCheckUtils]: 34: Hoare triple {109#false} ~cond := #in~cond; {109#false} is VALID [2020-07-11 02:27:49,763 INFO L280 TraceCheckUtils]: 35: Hoare triple {109#false} assume 0 == ~cond; {109#false} is VALID [2020-07-11 02:27:49,764 INFO L280 TraceCheckUtils]: 36: Hoare triple {109#false} assume !false; {109#false} is VALID [2020-07-11 02:27:49,769 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-11 02:27:49,770 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [693794972] [2020-07-11 02:27:49,772 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-11 02:27:49,772 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-11 02:27:49,773 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685356385] [2020-07-11 02:27:49,780 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2020-07-11 02:27:49,783 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 02:27:49,787 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-11 02:27:49,849 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:27:49,850 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-11 02:27:49,850 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 02:27:49,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-11 02:27:49,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-11 02:27:49,863 INFO L87 Difference]: Start difference. First operand 105 states. Second operand 3 states. [2020-07-11 02:27:50,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:27:50,385 INFO L93 Difference]: Finished difference Result 188 states and 215 transitions. [2020-07-11 02:27:50,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-11 02:27:50,386 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2020-07-11 02:27:50,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 02:27:50,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-11 02:27:50,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 215 transitions. [2020-07-11 02:27:50,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-11 02:27:50,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 215 transitions. [2020-07-11 02:27:50,411 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 215 transitions. [2020-07-11 02:27:50,642 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 215 edges. 215 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:27:50,658 INFO L225 Difference]: With dead ends: 188 [2020-07-11 02:27:50,659 INFO L226 Difference]: Without dead ends: 77 [2020-07-11 02:27:50,663 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-11 02:27:50,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2020-07-11 02:27:50,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2020-07-11 02:27:50,749 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 02:27:50,750 INFO L82 GeneralOperation]: Start isEquivalent. First operand 77 states. Second operand 77 states. [2020-07-11 02:27:50,751 INFO L74 IsIncluded]: Start isIncluded. First operand 77 states. Second operand 77 states. [2020-07-11 02:27:50,751 INFO L87 Difference]: Start difference. First operand 77 states. Second operand 77 states. [2020-07-11 02:27:50,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:27:50,760 INFO L93 Difference]: Finished difference Result 77 states and 82 transitions. [2020-07-11 02:27:50,760 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 82 transitions. [2020-07-11 02:27:50,761 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:27:50,762 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:27:50,762 INFO L74 IsIncluded]: Start isIncluded. First operand 77 states. Second operand 77 states. [2020-07-11 02:27:50,762 INFO L87 Difference]: Start difference. First operand 77 states. Second operand 77 states. [2020-07-11 02:27:50,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:27:50,770 INFO L93 Difference]: Finished difference Result 77 states and 82 transitions. [2020-07-11 02:27:50,770 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 82 transitions. [2020-07-11 02:27:50,771 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:27:50,771 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:27:50,772 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 02:27:50,772 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 02:27:50,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2020-07-11 02:27:50,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 82 transitions. [2020-07-11 02:27:50,781 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 82 transitions. Word has length 37 [2020-07-11 02:27:50,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 02:27:50,781 INFO L479 AbstractCegarLoop]: Abstraction has 77 states and 82 transitions. [2020-07-11 02:27:50,781 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-11 02:27:50,782 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 77 states and 82 transitions. [2020-07-11 02:27:50,880 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:27:50,880 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 82 transitions. [2020-07-11 02:27:50,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-07-11 02:27:50,882 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 02:27:50,883 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-11 02:27:50,883 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-11 02:27:50,883 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 02:27:50,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 02:27:50,884 INFO L82 PathProgramCache]: Analyzing trace with hash 1309055982, now seen corresponding path program 1 times [2020-07-11 02:27:50,884 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 02:27:50,885 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1223100075] [2020-07-11 02:27:50,885 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 02:27:50,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:27:50,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:27:50,976 INFO L280 TraceCheckUtils]: 0: Hoare triple {810#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {802#true} is VALID [2020-07-11 02:27:50,977 INFO L280 TraceCheckUtils]: 1: Hoare triple {802#true} #valid := #valid[0 := 0]; {802#true} is VALID [2020-07-11 02:27:50,977 INFO L280 TraceCheckUtils]: 2: Hoare triple {802#true} assume 0 < #StackHeapBarrier; {802#true} is VALID [2020-07-11 02:27:50,977 INFO L280 TraceCheckUtils]: 3: Hoare triple {802#true} assume true; {802#true} is VALID [2020-07-11 02:27:50,978 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {802#true} {802#true} #186#return; {802#true} is VALID [2020-07-11 02:27:50,979 INFO L263 TraceCheckUtils]: 0: Hoare triple {802#true} call ULTIMATE.init(); {810#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-11 02:27:50,980 INFO L280 TraceCheckUtils]: 1: Hoare triple {810#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {802#true} is VALID [2020-07-11 02:27:50,980 INFO L280 TraceCheckUtils]: 2: Hoare triple {802#true} #valid := #valid[0 := 0]; {802#true} is VALID [2020-07-11 02:27:50,980 INFO L280 TraceCheckUtils]: 3: Hoare triple {802#true} assume 0 < #StackHeapBarrier; {802#true} is VALID [2020-07-11 02:27:50,981 INFO L280 TraceCheckUtils]: 4: Hoare triple {802#true} assume true; {802#true} is VALID [2020-07-11 02:27:50,981 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {802#true} {802#true} #186#return; {802#true} is VALID [2020-07-11 02:27:50,981 INFO L263 TraceCheckUtils]: 6: Hoare triple {802#true} call #t~ret14 := main(); {802#true} is VALID [2020-07-11 02:27:50,982 INFO L280 TraceCheckUtils]: 7: Hoare triple {802#true} SUMMARY for call ~#string_A~0.base, ~#string_A~0.offset := #Ultimate.allocOnStack(5); srcloc: mainENTRY {802#true} is VALID [2020-07-11 02:27:50,982 INFO L280 TraceCheckUtils]: 8: Hoare triple {802#true} SUMMARY for call ~#string_B~0.base, ~#string_B~0.offset := #Ultimate.allocOnStack(5); srcloc: L20 {802#true} is VALID [2020-07-11 02:27:50,983 INFO L280 TraceCheckUtils]: 9: Hoare triple {802#true} havoc ~i~0; {802#true} is VALID [2020-07-11 02:27:50,983 INFO L280 TraceCheckUtils]: 10: Hoare triple {802#true} havoc ~j~0; {802#true} is VALID [2020-07-11 02:27:50,983 INFO L280 TraceCheckUtils]: 11: Hoare triple {802#true} havoc ~nc_A~0; {802#true} is VALID [2020-07-11 02:27:50,984 INFO L280 TraceCheckUtils]: 12: Hoare triple {802#true} havoc ~nc_B~0; {802#true} is VALID [2020-07-11 02:27:50,984 INFO L280 TraceCheckUtils]: 13: Hoare triple {802#true} ~found~0 := 0; {802#true} is VALID [2020-07-11 02:27:50,985 INFO L280 TraceCheckUtils]: 14: Hoare triple {802#true} ~i~0 := 0; {809#(= 0 main_~i~0)} is VALID [2020-07-11 02:27:50,986 INFO L280 TraceCheckUtils]: 15: Hoare triple {809#(= 0 main_~i~0)} assume !(~i~0 < 5); {803#false} is VALID [2020-07-11 02:27:50,987 INFO L280 TraceCheckUtils]: 16: Hoare triple {803#false} SUMMARY for call #t~mem2 := read~int(~#string_A~0.base, 4 + ~#string_A~0.offset, 1); srcloc: L24-7 {803#false} is VALID [2020-07-11 02:27:50,987 INFO L280 TraceCheckUtils]: 17: Hoare triple {803#false} assume !!(0 == #t~mem2); {803#false} is VALID [2020-07-11 02:27:50,988 INFO L280 TraceCheckUtils]: 18: Hoare triple {803#false} havoc #t~mem2; {803#false} is VALID [2020-07-11 02:27:50,988 INFO L280 TraceCheckUtils]: 19: Hoare triple {803#false} ~i~0 := 0; {803#false} is VALID [2020-07-11 02:27:50,988 INFO L280 TraceCheckUtils]: 20: Hoare triple {803#false} assume !(~i~0 < 5); {803#false} is VALID [2020-07-11 02:27:50,989 INFO L280 TraceCheckUtils]: 21: Hoare triple {803#false} SUMMARY for call #t~mem5 := read~int(~#string_B~0.base, 4 + ~#string_B~0.offset, 1); srcloc: L28-7 {803#false} is VALID [2020-07-11 02:27:50,989 INFO L280 TraceCheckUtils]: 22: Hoare triple {803#false} assume !!(0 == #t~mem5); {803#false} is VALID [2020-07-11 02:27:50,990 INFO L280 TraceCheckUtils]: 23: Hoare triple {803#false} havoc #t~mem5; {803#false} is VALID [2020-07-11 02:27:50,990 INFO L280 TraceCheckUtils]: 24: Hoare triple {803#false} ~nc_A~0 := 0; {803#false} is VALID [2020-07-11 02:27:50,990 INFO L280 TraceCheckUtils]: 25: Hoare triple {803#false} SUMMARY for call #t~mem6 := read~int(~#string_A~0.base, ~#string_A~0.offset + ~nc_A~0, 1); srcloc: L33-5 {803#false} is VALID [2020-07-11 02:27:50,991 INFO L280 TraceCheckUtils]: 26: Hoare triple {803#false} assume !(0 != #t~mem6); {803#false} is VALID [2020-07-11 02:27:50,991 INFO L280 TraceCheckUtils]: 27: Hoare triple {803#false} havoc #t~mem6; {803#false} is VALID [2020-07-11 02:27:50,992 INFO L280 TraceCheckUtils]: 28: Hoare triple {803#false} ~nc_B~0 := 0; {803#false} is VALID [2020-07-11 02:27:50,992 INFO L280 TraceCheckUtils]: 29: Hoare triple {803#false} SUMMARY for call #t~mem8 := read~int(~#string_B~0.base, ~#string_B~0.offset + ~nc_B~0, 1); srcloc: L37-5 {803#false} is VALID [2020-07-11 02:27:50,992 INFO L280 TraceCheckUtils]: 30: Hoare triple {803#false} assume !(0 != #t~mem8); {803#false} is VALID [2020-07-11 02:27:50,993 INFO L280 TraceCheckUtils]: 31: Hoare triple {803#false} havoc #t~mem8; {803#false} is VALID [2020-07-11 02:27:50,993 INFO L280 TraceCheckUtils]: 32: Hoare triple {803#false} assume !!(~nc_B~0 >= ~nc_A~0); {803#false} is VALID [2020-07-11 02:27:50,993 INFO L280 TraceCheckUtils]: 33: Hoare triple {803#false} ~j~0 := 0; {803#false} is VALID [2020-07-11 02:27:51,007 INFO L280 TraceCheckUtils]: 34: Hoare triple {803#false} ~i~0 := ~j~0; {803#false} is VALID [2020-07-11 02:27:51,007 INFO L280 TraceCheckUtils]: 35: Hoare triple {803#false} assume !(~i~0 < ~nc_A~0 && ~j~0 < ~nc_B~0); {803#false} is VALID [2020-07-11 02:27:51,008 INFO L280 TraceCheckUtils]: 36: Hoare triple {803#false} ~found~0 := ~shiftLeft((if ~j~0 > ~nc_B~0 - 1 then 1 else 0), ~i~0); {803#false} is VALID [2020-07-11 02:27:51,008 INFO L263 TraceCheckUtils]: 37: Hoare triple {803#false} call __VERIFIER_assert((if 0 == ~found~0 || 1 == ~found~0 then 1 else 0)); {803#false} is VALID [2020-07-11 02:27:51,008 INFO L280 TraceCheckUtils]: 38: Hoare triple {803#false} ~cond := #in~cond; {803#false} is VALID [2020-07-11 02:27:51,009 INFO L280 TraceCheckUtils]: 39: Hoare triple {803#false} assume 0 == ~cond; {803#false} is VALID [2020-07-11 02:27:51,009 INFO L280 TraceCheckUtils]: 40: Hoare triple {803#false} assume !false; {803#false} is VALID [2020-07-11 02:27:51,011 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-11 02:27:51,011 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1223100075] [2020-07-11 02:27:51,011 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-11 02:27:51,011 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-11 02:27:51,012 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575789999] [2020-07-11 02:27:51,013 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 41 [2020-07-11 02:27:51,014 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 02:27:51,014 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-11 02:27:51,057 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:27:51,057 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-11 02:27:51,057 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 02:27:51,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-11 02:27:51,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-11 02:27:51,058 INFO L87 Difference]: Start difference. First operand 77 states and 82 transitions. Second operand 4 states. [2020-07-11 02:27:51,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:27:51,435 INFO L93 Difference]: Finished difference Result 144 states and 155 transitions. [2020-07-11 02:27:51,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-11 02:27:51,435 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 41 [2020-07-11 02:27:51,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 02:27:51,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-11 02:27:51,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 155 transitions. [2020-07-11 02:27:51,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-11 02:27:51,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 155 transitions. [2020-07-11 02:27:51,445 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 155 transitions. [2020-07-11 02:27:51,603 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 155 edges. 155 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:27:51,607 INFO L225 Difference]: With dead ends: 144 [2020-07-11 02:27:51,607 INFO L226 Difference]: Without dead ends: 89 [2020-07-11 02:27:51,609 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-11 02:27:51,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2020-07-11 02:27:51,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 79. [2020-07-11 02:27:51,660 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 02:27:51,660 INFO L82 GeneralOperation]: Start isEquivalent. First operand 89 states. Second operand 79 states. [2020-07-11 02:27:51,660 INFO L74 IsIncluded]: Start isIncluded. First operand 89 states. Second operand 79 states. [2020-07-11 02:27:51,660 INFO L87 Difference]: Start difference. First operand 89 states. Second operand 79 states. [2020-07-11 02:27:51,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:27:51,665 INFO L93 Difference]: Finished difference Result 89 states and 94 transitions. [2020-07-11 02:27:51,665 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 94 transitions. [2020-07-11 02:27:51,666 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:27:51,666 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:27:51,666 INFO L74 IsIncluded]: Start isIncluded. First operand 79 states. Second operand 89 states. [2020-07-11 02:27:51,667 INFO L87 Difference]: Start difference. First operand 79 states. Second operand 89 states. [2020-07-11 02:27:51,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:27:51,671 INFO L93 Difference]: Finished difference Result 89 states and 94 transitions. [2020-07-11 02:27:51,672 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 94 transitions. [2020-07-11 02:27:51,672 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:27:51,673 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:27:51,673 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 02:27:51,673 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 02:27:51,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2020-07-11 02:27:51,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 84 transitions. [2020-07-11 02:27:51,677 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 84 transitions. Word has length 41 [2020-07-11 02:27:51,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 02:27:51,677 INFO L479 AbstractCegarLoop]: Abstraction has 79 states and 84 transitions. [2020-07-11 02:27:51,678 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-11 02:27:51,678 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 79 states and 84 transitions. [2020-07-11 02:27:51,755 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:27:51,756 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 84 transitions. [2020-07-11 02:27:51,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2020-07-11 02:27:51,757 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 02:27:51,758 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, 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-11 02:27:51,758 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-11 02:27:51,758 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 02:27:51,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 02:27:51,759 INFO L82 PathProgramCache]: Analyzing trace with hash 512896601, now seen corresponding path program 1 times [2020-07-11 02:27:51,759 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 02:27:51,759 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [964026847] [2020-07-11 02:27:51,759 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 02:27:51,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:27:51,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:27:51,887 INFO L280 TraceCheckUtils]: 0: Hoare triple {1447#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {1437#true} is VALID [2020-07-11 02:27:51,888 INFO L280 TraceCheckUtils]: 1: Hoare triple {1437#true} #valid := #valid[0 := 0]; {1437#true} is VALID [2020-07-11 02:27:51,888 INFO L280 TraceCheckUtils]: 2: Hoare triple {1437#true} assume 0 < #StackHeapBarrier; {1437#true} is VALID [2020-07-11 02:27:51,888 INFO L280 TraceCheckUtils]: 3: Hoare triple {1437#true} assume true; {1437#true} is VALID [2020-07-11 02:27:51,889 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {1437#true} {1437#true} #186#return; {1437#true} is VALID [2020-07-11 02:27:51,890 INFO L263 TraceCheckUtils]: 0: Hoare triple {1437#true} call ULTIMATE.init(); {1447#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-11 02:27:51,890 INFO L280 TraceCheckUtils]: 1: Hoare triple {1447#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {1437#true} is VALID [2020-07-11 02:27:51,890 INFO L280 TraceCheckUtils]: 2: Hoare triple {1437#true} #valid := #valid[0 := 0]; {1437#true} is VALID [2020-07-11 02:27:51,890 INFO L280 TraceCheckUtils]: 3: Hoare triple {1437#true} assume 0 < #StackHeapBarrier; {1437#true} is VALID [2020-07-11 02:27:51,891 INFO L280 TraceCheckUtils]: 4: Hoare triple {1437#true} assume true; {1437#true} is VALID [2020-07-11 02:27:51,891 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {1437#true} {1437#true} #186#return; {1437#true} is VALID [2020-07-11 02:27:51,891 INFO L263 TraceCheckUtils]: 6: Hoare triple {1437#true} call #t~ret14 := main(); {1437#true} is VALID [2020-07-11 02:27:51,891 INFO L280 TraceCheckUtils]: 7: Hoare triple {1437#true} SUMMARY for call ~#string_A~0.base, ~#string_A~0.offset := #Ultimate.allocOnStack(5); srcloc: mainENTRY {1437#true} is VALID [2020-07-11 02:27:51,892 INFO L280 TraceCheckUtils]: 8: Hoare triple {1437#true} SUMMARY for call ~#string_B~0.base, ~#string_B~0.offset := #Ultimate.allocOnStack(5); srcloc: L20 {1437#true} is VALID [2020-07-11 02:27:51,892 INFO L280 TraceCheckUtils]: 9: Hoare triple {1437#true} havoc ~i~0; {1437#true} is VALID [2020-07-11 02:27:51,892 INFO L280 TraceCheckUtils]: 10: Hoare triple {1437#true} havoc ~j~0; {1437#true} is VALID [2020-07-11 02:27:51,892 INFO L280 TraceCheckUtils]: 11: Hoare triple {1437#true} havoc ~nc_A~0; {1437#true} is VALID [2020-07-11 02:27:51,893 INFO L280 TraceCheckUtils]: 12: Hoare triple {1437#true} havoc ~nc_B~0; {1437#true} is VALID [2020-07-11 02:27:51,893 INFO L280 TraceCheckUtils]: 13: Hoare triple {1437#true} ~found~0 := 0; {1437#true} is VALID [2020-07-11 02:27:51,894 INFO L280 TraceCheckUtils]: 14: Hoare triple {1437#true} ~i~0 := 0; {1444#(= 0 main_~i~0)} is VALID [2020-07-11 02:27:51,894 INFO L280 TraceCheckUtils]: 15: Hoare triple {1444#(= 0 main_~i~0)} assume !!(~i~0 < 5); {1444#(= 0 main_~i~0)} is VALID [2020-07-11 02:27:51,895 INFO L280 TraceCheckUtils]: 16: Hoare triple {1444#(= 0 main_~i~0)} assume -128 <= #t~nondet1 && #t~nondet1 <= 127; {1444#(= 0 main_~i~0)} is VALID [2020-07-11 02:27:51,895 INFO L280 TraceCheckUtils]: 17: Hoare triple {1444#(= 0 main_~i~0)} SUMMARY for call write~int(#t~nondet1, ~#string_A~0.base, ~#string_A~0.offset + ~i~0, 1); srcloc: L25-1 {1444#(= 0 main_~i~0)} is VALID [2020-07-11 02:27:51,896 INFO L280 TraceCheckUtils]: 18: Hoare triple {1444#(= 0 main_~i~0)} havoc #t~nondet1; {1444#(= 0 main_~i~0)} is VALID [2020-07-11 02:27:51,897 INFO L280 TraceCheckUtils]: 19: Hoare triple {1444#(= 0 main_~i~0)} #t~post0 := ~i~0; {1445#(= |main_#t~post0| 0)} is VALID [2020-07-11 02:27:51,897 INFO L280 TraceCheckUtils]: 20: Hoare triple {1445#(= |main_#t~post0| 0)} ~i~0 := 1 + #t~post0; {1446#(<= main_~i~0 1)} is VALID [2020-07-11 02:27:51,898 INFO L280 TraceCheckUtils]: 21: Hoare triple {1446#(<= main_~i~0 1)} havoc #t~post0; {1446#(<= main_~i~0 1)} is VALID [2020-07-11 02:27:51,899 INFO L280 TraceCheckUtils]: 22: Hoare triple {1446#(<= main_~i~0 1)} assume !(~i~0 < 5); {1438#false} is VALID [2020-07-11 02:27:51,899 INFO L280 TraceCheckUtils]: 23: Hoare triple {1438#false} SUMMARY for call #t~mem2 := read~int(~#string_A~0.base, 4 + ~#string_A~0.offset, 1); srcloc: L24-7 {1438#false} is VALID [2020-07-11 02:27:51,899 INFO L280 TraceCheckUtils]: 24: Hoare triple {1438#false} assume !!(0 == #t~mem2); {1438#false} is VALID [2020-07-11 02:27:51,900 INFO L280 TraceCheckUtils]: 25: Hoare triple {1438#false} havoc #t~mem2; {1438#false} is VALID [2020-07-11 02:27:51,900 INFO L280 TraceCheckUtils]: 26: Hoare triple {1438#false} ~i~0 := 0; {1438#false} is VALID [2020-07-11 02:27:51,900 INFO L280 TraceCheckUtils]: 27: Hoare triple {1438#false} assume !!(~i~0 < 5); {1438#false} is VALID [2020-07-11 02:27:51,900 INFO L280 TraceCheckUtils]: 28: Hoare triple {1438#false} assume -128 <= #t~nondet4 && #t~nondet4 <= 127; {1438#false} is VALID [2020-07-11 02:27:51,901 INFO L280 TraceCheckUtils]: 29: Hoare triple {1438#false} SUMMARY for call write~int(#t~nondet4, ~#string_B~0.base, ~#string_B~0.offset + ~i~0, 1); srcloc: L29-1 {1438#false} is VALID [2020-07-11 02:27:51,901 INFO L280 TraceCheckUtils]: 30: Hoare triple {1438#false} havoc #t~nondet4; {1438#false} is VALID [2020-07-11 02:27:51,901 INFO L280 TraceCheckUtils]: 31: Hoare triple {1438#false} #t~post3 := ~i~0; {1438#false} is VALID [2020-07-11 02:27:51,901 INFO L280 TraceCheckUtils]: 32: Hoare triple {1438#false} ~i~0 := 1 + #t~post3; {1438#false} is VALID [2020-07-11 02:27:51,902 INFO L280 TraceCheckUtils]: 33: Hoare triple {1438#false} havoc #t~post3; {1438#false} is VALID [2020-07-11 02:27:51,902 INFO L280 TraceCheckUtils]: 34: Hoare triple {1438#false} assume !(~i~0 < 5); {1438#false} is VALID [2020-07-11 02:27:51,902 INFO L280 TraceCheckUtils]: 35: Hoare triple {1438#false} SUMMARY for call #t~mem5 := read~int(~#string_B~0.base, 4 + ~#string_B~0.offset, 1); srcloc: L28-7 {1438#false} is VALID [2020-07-11 02:27:51,903 INFO L280 TraceCheckUtils]: 36: Hoare triple {1438#false} assume !!(0 == #t~mem5); {1438#false} is VALID [2020-07-11 02:27:51,903 INFO L280 TraceCheckUtils]: 37: Hoare triple {1438#false} havoc #t~mem5; {1438#false} is VALID [2020-07-11 02:27:51,903 INFO L280 TraceCheckUtils]: 38: Hoare triple {1438#false} ~nc_A~0 := 0; {1438#false} is VALID [2020-07-11 02:27:51,903 INFO L280 TraceCheckUtils]: 39: Hoare triple {1438#false} SUMMARY for call #t~mem6 := read~int(~#string_A~0.base, ~#string_A~0.offset + ~nc_A~0, 1); srcloc: L33-5 {1438#false} is VALID [2020-07-11 02:27:51,904 INFO L280 TraceCheckUtils]: 40: Hoare triple {1438#false} assume !(0 != #t~mem6); {1438#false} is VALID [2020-07-11 02:27:51,904 INFO L280 TraceCheckUtils]: 41: Hoare triple {1438#false} havoc #t~mem6; {1438#false} is VALID [2020-07-11 02:27:51,904 INFO L280 TraceCheckUtils]: 42: Hoare triple {1438#false} ~nc_B~0 := 0; {1438#false} is VALID [2020-07-11 02:27:51,904 INFO L280 TraceCheckUtils]: 43: Hoare triple {1438#false} SUMMARY for call #t~mem8 := read~int(~#string_B~0.base, ~#string_B~0.offset + ~nc_B~0, 1); srcloc: L37-5 {1438#false} is VALID [2020-07-11 02:27:51,905 INFO L280 TraceCheckUtils]: 44: Hoare triple {1438#false} assume !(0 != #t~mem8); {1438#false} is VALID [2020-07-11 02:27:51,905 INFO L280 TraceCheckUtils]: 45: Hoare triple {1438#false} havoc #t~mem8; {1438#false} is VALID [2020-07-11 02:27:51,905 INFO L280 TraceCheckUtils]: 46: Hoare triple {1438#false} assume !!(~nc_B~0 >= ~nc_A~0); {1438#false} is VALID [2020-07-11 02:27:51,905 INFO L280 TraceCheckUtils]: 47: Hoare triple {1438#false} ~j~0 := 0; {1438#false} is VALID [2020-07-11 02:27:51,906 INFO L280 TraceCheckUtils]: 48: Hoare triple {1438#false} ~i~0 := ~j~0; {1438#false} is VALID [2020-07-11 02:27:51,906 INFO L280 TraceCheckUtils]: 49: Hoare triple {1438#false} assume !(~i~0 < ~nc_A~0 && ~j~0 < ~nc_B~0); {1438#false} is VALID [2020-07-11 02:27:51,906 INFO L280 TraceCheckUtils]: 50: Hoare triple {1438#false} ~found~0 := ~shiftLeft((if ~j~0 > ~nc_B~0 - 1 then 1 else 0), ~i~0); {1438#false} is VALID [2020-07-11 02:27:51,906 INFO L263 TraceCheckUtils]: 51: Hoare triple {1438#false} call __VERIFIER_assert((if 0 == ~found~0 || 1 == ~found~0 then 1 else 0)); {1438#false} is VALID [2020-07-11 02:27:51,907 INFO L280 TraceCheckUtils]: 52: Hoare triple {1438#false} ~cond := #in~cond; {1438#false} is VALID [2020-07-11 02:27:51,907 INFO L280 TraceCheckUtils]: 53: Hoare triple {1438#false} assume 0 == ~cond; {1438#false} is VALID [2020-07-11 02:27:51,907 INFO L280 TraceCheckUtils]: 54: Hoare triple {1438#false} assume !false; {1438#false} is VALID [2020-07-11 02:27:51,911 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-11 02:27:51,911 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [964026847] [2020-07-11 02:27:51,912 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-11 02:27:51,912 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-07-11 02:27:51,912 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963750737] [2020-07-11 02:27:51,913 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 55 [2020-07-11 02:27:51,913 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 02:27:51,913 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-11 02:27:51,968 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:27:51,968 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-11 02:27:51,969 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 02:27:51,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-11 02:27:51,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-07-11 02:27:51,969 INFO L87 Difference]: Start difference. First operand 79 states and 84 transitions. Second operand 6 states. [2020-07-11 02:27:52,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:27:52,506 INFO L93 Difference]: Finished difference Result 152 states and 162 transitions. [2020-07-11 02:27:52,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-11 02:27:52,506 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 55 [2020-07-11 02:27:52,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 02:27:52,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-11 02:27:52,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 161 transitions. [2020-07-11 02:27:52,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-11 02:27:52,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 161 transitions. [2020-07-11 02:27:52,515 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 161 transitions. [2020-07-11 02:27:52,673 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 161 edges. 161 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:27:52,676 INFO L225 Difference]: With dead ends: 152 [2020-07-11 02:27:52,676 INFO L226 Difference]: Without dead ends: 96 [2020-07-11 02:27:52,678 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2020-07-11 02:27:52,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2020-07-11 02:27:52,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 86. [2020-07-11 02:27:52,733 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 02:27:52,734 INFO L82 GeneralOperation]: Start isEquivalent. First operand 96 states. Second operand 86 states. [2020-07-11 02:27:52,734 INFO L74 IsIncluded]: Start isIncluded. First operand 96 states. Second operand 86 states. [2020-07-11 02:27:52,734 INFO L87 Difference]: Start difference. First operand 96 states. Second operand 86 states. [2020-07-11 02:27:52,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:27:52,738 INFO L93 Difference]: Finished difference Result 96 states and 101 transitions. [2020-07-11 02:27:52,738 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 101 transitions. [2020-07-11 02:27:52,739 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:27:52,739 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:27:52,740 INFO L74 IsIncluded]: Start isIncluded. First operand 86 states. Second operand 96 states. [2020-07-11 02:27:52,740 INFO L87 Difference]: Start difference. First operand 86 states. Second operand 96 states. [2020-07-11 02:27:52,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:27:52,746 INFO L93 Difference]: Finished difference Result 96 states and 101 transitions. [2020-07-11 02:27:52,746 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 101 transitions. [2020-07-11 02:27:52,746 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:27:52,746 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:27:52,746 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 02:27:52,747 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 02:27:52,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2020-07-11 02:27:52,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 91 transitions. [2020-07-11 02:27:52,751 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 91 transitions. Word has length 55 [2020-07-11 02:27:52,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 02:27:52,752 INFO L479 AbstractCegarLoop]: Abstraction has 86 states and 91 transitions. [2020-07-11 02:27:52,752 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-11 02:27:52,752 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 86 states and 91 transitions. [2020-07-11 02:27:52,832 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:27:52,832 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 91 transitions. [2020-07-11 02:27:52,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2020-07-11 02:27:52,838 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 02:27:52,838 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 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, 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-11 02:27:52,838 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-11 02:27:52,839 INFO L427 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 02:27:52,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 02:27:52,839 INFO L82 PathProgramCache]: Analyzing trace with hash 1958895614, now seen corresponding path program 2 times [2020-07-11 02:27:52,840 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 02:27:52,840 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [659896616] [2020-07-11 02:27:52,840 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 02:27:52,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:27:52,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:27:52,953 INFO L280 TraceCheckUtils]: 0: Hoare triple {2132#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {2122#true} is VALID [2020-07-11 02:27:52,953 INFO L280 TraceCheckUtils]: 1: Hoare triple {2122#true} #valid := #valid[0 := 0]; {2122#true} is VALID [2020-07-11 02:27:52,954 INFO L280 TraceCheckUtils]: 2: Hoare triple {2122#true} assume 0 < #StackHeapBarrier; {2122#true} is VALID [2020-07-11 02:27:52,954 INFO L280 TraceCheckUtils]: 3: Hoare triple {2122#true} assume true; {2122#true} is VALID [2020-07-11 02:27:52,954 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {2122#true} {2122#true} #186#return; {2122#true} is VALID [2020-07-11 02:27:52,955 INFO L263 TraceCheckUtils]: 0: Hoare triple {2122#true} call ULTIMATE.init(); {2132#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-11 02:27:52,956 INFO L280 TraceCheckUtils]: 1: Hoare triple {2132#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {2122#true} is VALID [2020-07-11 02:27:52,956 INFO L280 TraceCheckUtils]: 2: Hoare triple {2122#true} #valid := #valid[0 := 0]; {2122#true} is VALID [2020-07-11 02:27:52,956 INFO L280 TraceCheckUtils]: 3: Hoare triple {2122#true} assume 0 < #StackHeapBarrier; {2122#true} is VALID [2020-07-11 02:27:52,956 INFO L280 TraceCheckUtils]: 4: Hoare triple {2122#true} assume true; {2122#true} is VALID [2020-07-11 02:27:52,957 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {2122#true} {2122#true} #186#return; {2122#true} is VALID [2020-07-11 02:27:52,957 INFO L263 TraceCheckUtils]: 6: Hoare triple {2122#true} call #t~ret14 := main(); {2122#true} is VALID [2020-07-11 02:27:52,957 INFO L280 TraceCheckUtils]: 7: Hoare triple {2122#true} SUMMARY for call ~#string_A~0.base, ~#string_A~0.offset := #Ultimate.allocOnStack(5); srcloc: mainENTRY {2122#true} is VALID [2020-07-11 02:27:52,957 INFO L280 TraceCheckUtils]: 8: Hoare triple {2122#true} SUMMARY for call ~#string_B~0.base, ~#string_B~0.offset := #Ultimate.allocOnStack(5); srcloc: L20 {2122#true} is VALID [2020-07-11 02:27:52,958 INFO L280 TraceCheckUtils]: 9: Hoare triple {2122#true} havoc ~i~0; {2122#true} is VALID [2020-07-11 02:27:52,958 INFO L280 TraceCheckUtils]: 10: Hoare triple {2122#true} havoc ~j~0; {2122#true} is VALID [2020-07-11 02:27:52,958 INFO L280 TraceCheckUtils]: 11: Hoare triple {2122#true} havoc ~nc_A~0; {2122#true} is VALID [2020-07-11 02:27:52,958 INFO L280 TraceCheckUtils]: 12: Hoare triple {2122#true} havoc ~nc_B~0; {2122#true} is VALID [2020-07-11 02:27:52,959 INFO L280 TraceCheckUtils]: 13: Hoare triple {2122#true} ~found~0 := 0; {2122#true} is VALID [2020-07-11 02:27:52,959 INFO L280 TraceCheckUtils]: 14: Hoare triple {2122#true} ~i~0 := 0; {2122#true} is VALID [2020-07-11 02:27:52,959 INFO L280 TraceCheckUtils]: 15: Hoare triple {2122#true} assume !!(~i~0 < 5); {2122#true} is VALID [2020-07-11 02:27:52,959 INFO L280 TraceCheckUtils]: 16: Hoare triple {2122#true} assume -128 <= #t~nondet1 && #t~nondet1 <= 127; {2122#true} is VALID [2020-07-11 02:27:52,960 INFO L280 TraceCheckUtils]: 17: Hoare triple {2122#true} SUMMARY for call write~int(#t~nondet1, ~#string_A~0.base, ~#string_A~0.offset + ~i~0, 1); srcloc: L25-1 {2122#true} is VALID [2020-07-11 02:27:52,960 INFO L280 TraceCheckUtils]: 18: Hoare triple {2122#true} havoc #t~nondet1; {2122#true} is VALID [2020-07-11 02:27:52,960 INFO L280 TraceCheckUtils]: 19: Hoare triple {2122#true} #t~post0 := ~i~0; {2122#true} is VALID [2020-07-11 02:27:52,960 INFO L280 TraceCheckUtils]: 20: Hoare triple {2122#true} ~i~0 := 1 + #t~post0; {2122#true} is VALID [2020-07-11 02:27:52,961 INFO L280 TraceCheckUtils]: 21: Hoare triple {2122#true} havoc #t~post0; {2122#true} is VALID [2020-07-11 02:27:52,961 INFO L280 TraceCheckUtils]: 22: Hoare triple {2122#true} assume !!(~i~0 < 5); {2122#true} is VALID [2020-07-11 02:27:52,961 INFO L280 TraceCheckUtils]: 23: Hoare triple {2122#true} assume -128 <= #t~nondet1 && #t~nondet1 <= 127; {2122#true} is VALID [2020-07-11 02:27:52,961 INFO L280 TraceCheckUtils]: 24: Hoare triple {2122#true} SUMMARY for call write~int(#t~nondet1, ~#string_A~0.base, ~#string_A~0.offset + ~i~0, 1); srcloc: L25-1 {2122#true} is VALID [2020-07-11 02:27:52,962 INFO L280 TraceCheckUtils]: 25: Hoare triple {2122#true} havoc #t~nondet1; {2122#true} is VALID [2020-07-11 02:27:52,962 INFO L280 TraceCheckUtils]: 26: Hoare triple {2122#true} #t~post0 := ~i~0; {2122#true} is VALID [2020-07-11 02:27:52,962 INFO L280 TraceCheckUtils]: 27: Hoare triple {2122#true} ~i~0 := 1 + #t~post0; {2122#true} is VALID [2020-07-11 02:27:52,962 INFO L280 TraceCheckUtils]: 28: Hoare triple {2122#true} havoc #t~post0; {2122#true} is VALID [2020-07-11 02:27:52,963 INFO L280 TraceCheckUtils]: 29: Hoare triple {2122#true} assume !(~i~0 < 5); {2122#true} is VALID [2020-07-11 02:27:52,963 INFO L280 TraceCheckUtils]: 30: Hoare triple {2122#true} SUMMARY for call #t~mem2 := read~int(~#string_A~0.base, 4 + ~#string_A~0.offset, 1); srcloc: L24-7 {2122#true} is VALID [2020-07-11 02:27:52,963 INFO L280 TraceCheckUtils]: 31: Hoare triple {2122#true} assume !!(0 == #t~mem2); {2122#true} is VALID [2020-07-11 02:27:52,963 INFO L280 TraceCheckUtils]: 32: Hoare triple {2122#true} havoc #t~mem2; {2122#true} is VALID [2020-07-11 02:27:52,964 INFO L280 TraceCheckUtils]: 33: Hoare triple {2122#true} ~i~0 := 0; {2129#(= 0 main_~i~0)} is VALID [2020-07-11 02:27:52,965 INFO L280 TraceCheckUtils]: 34: Hoare triple {2129#(= 0 main_~i~0)} assume !!(~i~0 < 5); {2129#(= 0 main_~i~0)} is VALID [2020-07-11 02:27:52,966 INFO L280 TraceCheckUtils]: 35: Hoare triple {2129#(= 0 main_~i~0)} assume -128 <= #t~nondet4 && #t~nondet4 <= 127; {2129#(= 0 main_~i~0)} is VALID [2020-07-11 02:27:52,966 INFO L280 TraceCheckUtils]: 36: Hoare triple {2129#(= 0 main_~i~0)} SUMMARY for call write~int(#t~nondet4, ~#string_B~0.base, ~#string_B~0.offset + ~i~0, 1); srcloc: L29-1 {2129#(= 0 main_~i~0)} is VALID [2020-07-11 02:27:52,967 INFO L280 TraceCheckUtils]: 37: Hoare triple {2129#(= 0 main_~i~0)} havoc #t~nondet4; {2129#(= 0 main_~i~0)} is VALID [2020-07-11 02:27:52,968 INFO L280 TraceCheckUtils]: 38: Hoare triple {2129#(= 0 main_~i~0)} #t~post3 := ~i~0; {2130#(= |main_#t~post3| 0)} is VALID [2020-07-11 02:27:52,968 INFO L280 TraceCheckUtils]: 39: Hoare triple {2130#(= |main_#t~post3| 0)} ~i~0 := 1 + #t~post3; {2131#(<= main_~i~0 1)} is VALID [2020-07-11 02:27:52,969 INFO L280 TraceCheckUtils]: 40: Hoare triple {2131#(<= main_~i~0 1)} havoc #t~post3; {2131#(<= main_~i~0 1)} is VALID [2020-07-11 02:27:52,972 INFO L280 TraceCheckUtils]: 41: Hoare triple {2131#(<= main_~i~0 1)} assume !(~i~0 < 5); {2123#false} is VALID [2020-07-11 02:27:52,972 INFO L280 TraceCheckUtils]: 42: Hoare triple {2123#false} SUMMARY for call #t~mem5 := read~int(~#string_B~0.base, 4 + ~#string_B~0.offset, 1); srcloc: L28-7 {2123#false} is VALID [2020-07-11 02:27:52,972 INFO L280 TraceCheckUtils]: 43: Hoare triple {2123#false} assume !!(0 == #t~mem5); {2123#false} is VALID [2020-07-11 02:27:52,973 INFO L280 TraceCheckUtils]: 44: Hoare triple {2123#false} havoc #t~mem5; {2123#false} is VALID [2020-07-11 02:27:52,973 INFO L280 TraceCheckUtils]: 45: Hoare triple {2123#false} ~nc_A~0 := 0; {2123#false} is VALID [2020-07-11 02:27:52,973 INFO L280 TraceCheckUtils]: 46: Hoare triple {2123#false} SUMMARY for call #t~mem6 := read~int(~#string_A~0.base, ~#string_A~0.offset + ~nc_A~0, 1); srcloc: L33-5 {2123#false} is VALID [2020-07-11 02:27:52,973 INFO L280 TraceCheckUtils]: 47: Hoare triple {2123#false} assume !(0 != #t~mem6); {2123#false} is VALID [2020-07-11 02:27:52,974 INFO L280 TraceCheckUtils]: 48: Hoare triple {2123#false} havoc #t~mem6; {2123#false} is VALID [2020-07-11 02:27:52,974 INFO L280 TraceCheckUtils]: 49: Hoare triple {2123#false} ~nc_B~0 := 0; {2123#false} is VALID [2020-07-11 02:27:52,974 INFO L280 TraceCheckUtils]: 50: Hoare triple {2123#false} SUMMARY for call #t~mem8 := read~int(~#string_B~0.base, ~#string_B~0.offset + ~nc_B~0, 1); srcloc: L37-5 {2123#false} is VALID [2020-07-11 02:27:52,974 INFO L280 TraceCheckUtils]: 51: Hoare triple {2123#false} assume !(0 != #t~mem8); {2123#false} is VALID [2020-07-11 02:27:52,975 INFO L280 TraceCheckUtils]: 52: Hoare triple {2123#false} havoc #t~mem8; {2123#false} is VALID [2020-07-11 02:27:52,975 INFO L280 TraceCheckUtils]: 53: Hoare triple {2123#false} assume !!(~nc_B~0 >= ~nc_A~0); {2123#false} is VALID [2020-07-11 02:27:52,975 INFO L280 TraceCheckUtils]: 54: Hoare triple {2123#false} ~j~0 := 0; {2123#false} is VALID [2020-07-11 02:27:52,975 INFO L280 TraceCheckUtils]: 55: Hoare triple {2123#false} ~i~0 := ~j~0; {2123#false} is VALID [2020-07-11 02:27:52,975 INFO L280 TraceCheckUtils]: 56: Hoare triple {2123#false} assume !(~i~0 < ~nc_A~0 && ~j~0 < ~nc_B~0); {2123#false} is VALID [2020-07-11 02:27:52,976 INFO L280 TraceCheckUtils]: 57: Hoare triple {2123#false} ~found~0 := ~shiftLeft((if ~j~0 > ~nc_B~0 - 1 then 1 else 0), ~i~0); {2123#false} is VALID [2020-07-11 02:27:52,976 INFO L263 TraceCheckUtils]: 58: Hoare triple {2123#false} call __VERIFIER_assert((if 0 == ~found~0 || 1 == ~found~0 then 1 else 0)); {2123#false} is VALID [2020-07-11 02:27:52,976 INFO L280 TraceCheckUtils]: 59: Hoare triple {2123#false} ~cond := #in~cond; {2123#false} is VALID [2020-07-11 02:27:52,976 INFO L280 TraceCheckUtils]: 60: Hoare triple {2123#false} assume 0 == ~cond; {2123#false} is VALID [2020-07-11 02:27:52,977 INFO L280 TraceCheckUtils]: 61: Hoare triple {2123#false} assume !false; {2123#false} is VALID [2020-07-11 02:27:52,981 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2020-07-11 02:27:52,981 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [659896616] [2020-07-11 02:27:52,982 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-11 02:27:52,982 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-07-11 02:27:52,982 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175093276] [2020-07-11 02:27:52,982 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 62 [2020-07-11 02:27:52,983 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 02:27:52,983 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-11 02:27:53,037 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:27:53,037 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-11 02:27:53,037 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 02:27:53,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-11 02:27:53,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-07-11 02:27:53,038 INFO L87 Difference]: Start difference. First operand 86 states and 91 transitions. Second operand 6 states. [2020-07-11 02:27:53,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:27:53,573 INFO L93 Difference]: Finished difference Result 142 states and 151 transitions. [2020-07-11 02:27:53,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-11 02:27:53,573 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 62 [2020-07-11 02:27:53,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 02:27:53,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-11 02:27:53,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 149 transitions. [2020-07-11 02:27:53,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-11 02:27:53,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 149 transitions. [2020-07-11 02:27:53,580 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 149 transitions. [2020-07-11 02:27:53,728 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 149 edges. 149 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:27:53,731 INFO L225 Difference]: With dead ends: 142 [2020-07-11 02:27:53,731 INFO L226 Difference]: Without dead ends: 98 [2020-07-11 02:27:53,732 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2020-07-11 02:27:53,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2020-07-11 02:27:53,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 93. [2020-07-11 02:27:53,798 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 02:27:53,798 INFO L82 GeneralOperation]: Start isEquivalent. First operand 98 states. Second operand 93 states. [2020-07-11 02:27:53,798 INFO L74 IsIncluded]: Start isIncluded. First operand 98 states. Second operand 93 states. [2020-07-11 02:27:53,798 INFO L87 Difference]: Start difference. First operand 98 states. Second operand 93 states. [2020-07-11 02:27:53,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:27:53,802 INFO L93 Difference]: Finished difference Result 98 states and 103 transitions. [2020-07-11 02:27:53,802 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 103 transitions. [2020-07-11 02:27:53,802 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:27:53,803 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:27:53,803 INFO L74 IsIncluded]: Start isIncluded. First operand 93 states. Second operand 98 states. [2020-07-11 02:27:53,803 INFO L87 Difference]: Start difference. First operand 93 states. Second operand 98 states. [2020-07-11 02:27:53,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:27:53,806 INFO L93 Difference]: Finished difference Result 98 states and 103 transitions. [2020-07-11 02:27:53,807 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 103 transitions. [2020-07-11 02:27:53,807 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:27:53,807 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:27:53,807 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 02:27:53,807 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 02:27:53,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2020-07-11 02:27:53,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 98 transitions. [2020-07-11 02:27:53,811 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 98 transitions. Word has length 62 [2020-07-11 02:27:53,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 02:27:53,811 INFO L479 AbstractCegarLoop]: Abstraction has 93 states and 98 transitions. [2020-07-11 02:27:53,811 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-11 02:27:53,811 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 93 states and 98 transitions. [2020-07-11 02:27:53,923 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 98 edges. 98 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:27:53,923 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 98 transitions. [2020-07-11 02:27:53,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2020-07-11 02:27:53,924 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 02:27:53,926 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-11 02:27:53,927 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-11 02:27:53,927 INFO L427 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 02:27:53,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 02:27:53,927 INFO L82 PathProgramCache]: Analyzing trace with hash 11176526, now seen corresponding path program 3 times [2020-07-11 02:27:53,928 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 02:27:53,928 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [614365718] [2020-07-11 02:27:53,928 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 02:27:53,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:27:54,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:27:54,110 INFO L280 TraceCheckUtils]: 0: Hoare triple {2817#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {2805#true} is VALID [2020-07-11 02:27:54,110 INFO L280 TraceCheckUtils]: 1: Hoare triple {2805#true} #valid := #valid[0 := 0]; {2805#true} is VALID [2020-07-11 02:27:54,110 INFO L280 TraceCheckUtils]: 2: Hoare triple {2805#true} assume 0 < #StackHeapBarrier; {2805#true} is VALID [2020-07-11 02:27:54,110 INFO L280 TraceCheckUtils]: 3: Hoare triple {2805#true} assume true; {2805#true} is VALID [2020-07-11 02:27:54,111 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {2805#true} {2805#true} #186#return; {2805#true} is VALID [2020-07-11 02:27:54,112 INFO L263 TraceCheckUtils]: 0: Hoare triple {2805#true} call ULTIMATE.init(); {2817#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-11 02:27:54,112 INFO L280 TraceCheckUtils]: 1: Hoare triple {2817#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {2805#true} is VALID [2020-07-11 02:27:54,112 INFO L280 TraceCheckUtils]: 2: Hoare triple {2805#true} #valid := #valid[0 := 0]; {2805#true} is VALID [2020-07-11 02:27:54,113 INFO L280 TraceCheckUtils]: 3: Hoare triple {2805#true} assume 0 < #StackHeapBarrier; {2805#true} is VALID [2020-07-11 02:27:54,113 INFO L280 TraceCheckUtils]: 4: Hoare triple {2805#true} assume true; {2805#true} is VALID [2020-07-11 02:27:54,113 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {2805#true} {2805#true} #186#return; {2805#true} is VALID [2020-07-11 02:27:54,113 INFO L263 TraceCheckUtils]: 6: Hoare triple {2805#true} call #t~ret14 := main(); {2805#true} is VALID [2020-07-11 02:27:54,114 INFO L280 TraceCheckUtils]: 7: Hoare triple {2805#true} SUMMARY for call ~#string_A~0.base, ~#string_A~0.offset := #Ultimate.allocOnStack(5); srcloc: mainENTRY {2805#true} is VALID [2020-07-11 02:27:54,114 INFO L280 TraceCheckUtils]: 8: Hoare triple {2805#true} SUMMARY for call ~#string_B~0.base, ~#string_B~0.offset := #Ultimate.allocOnStack(5); srcloc: L20 {2805#true} is VALID [2020-07-11 02:27:54,114 INFO L280 TraceCheckUtils]: 9: Hoare triple {2805#true} havoc ~i~0; {2805#true} is VALID [2020-07-11 02:27:54,115 INFO L280 TraceCheckUtils]: 10: Hoare triple {2805#true} havoc ~j~0; {2805#true} is VALID [2020-07-11 02:27:54,115 INFO L280 TraceCheckUtils]: 11: Hoare triple {2805#true} havoc ~nc_A~0; {2805#true} is VALID [2020-07-11 02:27:54,115 INFO L280 TraceCheckUtils]: 12: Hoare triple {2805#true} havoc ~nc_B~0; {2805#true} is VALID [2020-07-11 02:27:54,116 INFO L280 TraceCheckUtils]: 13: Hoare triple {2805#true} ~found~0 := 0; {2805#true} is VALID [2020-07-11 02:27:54,117 INFO L280 TraceCheckUtils]: 14: Hoare triple {2805#true} ~i~0 := 0; {2812#(= 0 main_~i~0)} is VALID [2020-07-11 02:27:54,117 INFO L280 TraceCheckUtils]: 15: Hoare triple {2812#(= 0 main_~i~0)} assume !!(~i~0 < 5); {2812#(= 0 main_~i~0)} is VALID [2020-07-11 02:27:54,118 INFO L280 TraceCheckUtils]: 16: Hoare triple {2812#(= 0 main_~i~0)} assume -128 <= #t~nondet1 && #t~nondet1 <= 127; {2812#(= 0 main_~i~0)} is VALID [2020-07-11 02:27:54,119 INFO L280 TraceCheckUtils]: 17: Hoare triple {2812#(= 0 main_~i~0)} SUMMARY for call write~int(#t~nondet1, ~#string_A~0.base, ~#string_A~0.offset + ~i~0, 1); srcloc: L25-1 {2812#(= 0 main_~i~0)} is VALID [2020-07-11 02:27:54,120 INFO L280 TraceCheckUtils]: 18: Hoare triple {2812#(= 0 main_~i~0)} havoc #t~nondet1; {2812#(= 0 main_~i~0)} is VALID [2020-07-11 02:27:54,121 INFO L280 TraceCheckUtils]: 19: Hoare triple {2812#(= 0 main_~i~0)} #t~post0 := ~i~0; {2813#(= |main_#t~post0| 0)} is VALID [2020-07-11 02:27:54,122 INFO L280 TraceCheckUtils]: 20: Hoare triple {2813#(= |main_#t~post0| 0)} ~i~0 := 1 + #t~post0; {2814#(<= main_~i~0 1)} is VALID [2020-07-11 02:27:54,122 INFO L280 TraceCheckUtils]: 21: Hoare triple {2814#(<= main_~i~0 1)} havoc #t~post0; {2814#(<= main_~i~0 1)} is VALID [2020-07-11 02:27:54,123 INFO L280 TraceCheckUtils]: 22: Hoare triple {2814#(<= main_~i~0 1)} assume !!(~i~0 < 5); {2814#(<= main_~i~0 1)} is VALID [2020-07-11 02:27:54,123 INFO L280 TraceCheckUtils]: 23: Hoare triple {2814#(<= main_~i~0 1)} assume -128 <= #t~nondet1 && #t~nondet1 <= 127; {2814#(<= main_~i~0 1)} is VALID [2020-07-11 02:27:54,124 INFO L280 TraceCheckUtils]: 24: Hoare triple {2814#(<= main_~i~0 1)} SUMMARY for call write~int(#t~nondet1, ~#string_A~0.base, ~#string_A~0.offset + ~i~0, 1); srcloc: L25-1 {2814#(<= main_~i~0 1)} is VALID [2020-07-11 02:27:54,125 INFO L280 TraceCheckUtils]: 25: Hoare triple {2814#(<= main_~i~0 1)} havoc #t~nondet1; {2814#(<= main_~i~0 1)} is VALID [2020-07-11 02:27:54,125 INFO L280 TraceCheckUtils]: 26: Hoare triple {2814#(<= main_~i~0 1)} #t~post0 := ~i~0; {2815#(<= |main_#t~post0| 1)} is VALID [2020-07-11 02:27:54,126 INFO L280 TraceCheckUtils]: 27: Hoare triple {2815#(<= |main_#t~post0| 1)} ~i~0 := 1 + #t~post0; {2816#(<= main_~i~0 2)} is VALID [2020-07-11 02:27:54,127 INFO L280 TraceCheckUtils]: 28: Hoare triple {2816#(<= main_~i~0 2)} havoc #t~post0; {2816#(<= main_~i~0 2)} is VALID [2020-07-11 02:27:54,128 INFO L280 TraceCheckUtils]: 29: Hoare triple {2816#(<= main_~i~0 2)} assume !(~i~0 < 5); {2806#false} is VALID [2020-07-11 02:27:54,128 INFO L280 TraceCheckUtils]: 30: Hoare triple {2806#false} SUMMARY for call #t~mem2 := read~int(~#string_A~0.base, 4 + ~#string_A~0.offset, 1); srcloc: L24-7 {2806#false} is VALID [2020-07-11 02:27:54,128 INFO L280 TraceCheckUtils]: 31: Hoare triple {2806#false} assume !!(0 == #t~mem2); {2806#false} is VALID [2020-07-11 02:27:54,128 INFO L280 TraceCheckUtils]: 32: Hoare triple {2806#false} havoc #t~mem2; {2806#false} is VALID [2020-07-11 02:27:54,129 INFO L280 TraceCheckUtils]: 33: Hoare triple {2806#false} ~i~0 := 0; {2806#false} is VALID [2020-07-11 02:27:54,129 INFO L280 TraceCheckUtils]: 34: Hoare triple {2806#false} assume !!(~i~0 < 5); {2806#false} is VALID [2020-07-11 02:27:54,129 INFO L280 TraceCheckUtils]: 35: Hoare triple {2806#false} assume -128 <= #t~nondet4 && #t~nondet4 <= 127; {2806#false} is VALID [2020-07-11 02:27:54,129 INFO L280 TraceCheckUtils]: 36: Hoare triple {2806#false} SUMMARY for call write~int(#t~nondet4, ~#string_B~0.base, ~#string_B~0.offset + ~i~0, 1); srcloc: L29-1 {2806#false} is VALID [2020-07-11 02:27:54,129 INFO L280 TraceCheckUtils]: 37: Hoare triple {2806#false} havoc #t~nondet4; {2806#false} is VALID [2020-07-11 02:27:54,130 INFO L280 TraceCheckUtils]: 38: Hoare triple {2806#false} #t~post3 := ~i~0; {2806#false} is VALID [2020-07-11 02:27:54,130 INFO L280 TraceCheckUtils]: 39: Hoare triple {2806#false} ~i~0 := 1 + #t~post3; {2806#false} is VALID [2020-07-11 02:27:54,131 INFO L280 TraceCheckUtils]: 40: Hoare triple {2806#false} havoc #t~post3; {2806#false} is VALID [2020-07-11 02:27:54,132 INFO L280 TraceCheckUtils]: 41: Hoare triple {2806#false} assume !!(~i~0 < 5); {2806#false} is VALID [2020-07-11 02:27:54,132 INFO L280 TraceCheckUtils]: 42: Hoare triple {2806#false} assume -128 <= #t~nondet4 && #t~nondet4 <= 127; {2806#false} is VALID [2020-07-11 02:27:54,132 INFO L280 TraceCheckUtils]: 43: Hoare triple {2806#false} SUMMARY for call write~int(#t~nondet4, ~#string_B~0.base, ~#string_B~0.offset + ~i~0, 1); srcloc: L29-1 {2806#false} is VALID [2020-07-11 02:27:54,132 INFO L280 TraceCheckUtils]: 44: Hoare triple {2806#false} havoc #t~nondet4; {2806#false} is VALID [2020-07-11 02:27:54,132 INFO L280 TraceCheckUtils]: 45: Hoare triple {2806#false} #t~post3 := ~i~0; {2806#false} is VALID [2020-07-11 02:27:54,133 INFO L280 TraceCheckUtils]: 46: Hoare triple {2806#false} ~i~0 := 1 + #t~post3; {2806#false} is VALID [2020-07-11 02:27:54,133 INFO L280 TraceCheckUtils]: 47: Hoare triple {2806#false} havoc #t~post3; {2806#false} is VALID [2020-07-11 02:27:54,134 INFO L280 TraceCheckUtils]: 48: Hoare triple {2806#false} assume !(~i~0 < 5); {2806#false} is VALID [2020-07-11 02:27:54,135 INFO L280 TraceCheckUtils]: 49: Hoare triple {2806#false} SUMMARY for call #t~mem5 := read~int(~#string_B~0.base, 4 + ~#string_B~0.offset, 1); srcloc: L28-7 {2806#false} is VALID [2020-07-11 02:27:54,135 INFO L280 TraceCheckUtils]: 50: Hoare triple {2806#false} assume !!(0 == #t~mem5); {2806#false} is VALID [2020-07-11 02:27:54,135 INFO L280 TraceCheckUtils]: 51: Hoare triple {2806#false} havoc #t~mem5; {2806#false} is VALID [2020-07-11 02:27:54,135 INFO L280 TraceCheckUtils]: 52: Hoare triple {2806#false} ~nc_A~0 := 0; {2806#false} is VALID [2020-07-11 02:27:54,136 INFO L280 TraceCheckUtils]: 53: Hoare triple {2806#false} SUMMARY for call #t~mem6 := read~int(~#string_A~0.base, ~#string_A~0.offset + ~nc_A~0, 1); srcloc: L33-5 {2806#false} is VALID [2020-07-11 02:27:54,136 INFO L280 TraceCheckUtils]: 54: Hoare triple {2806#false} assume !(0 != #t~mem6); {2806#false} is VALID [2020-07-11 02:27:54,136 INFO L280 TraceCheckUtils]: 55: Hoare triple {2806#false} havoc #t~mem6; {2806#false} is VALID [2020-07-11 02:27:54,136 INFO L280 TraceCheckUtils]: 56: Hoare triple {2806#false} ~nc_B~0 := 0; {2806#false} is VALID [2020-07-11 02:27:54,137 INFO L280 TraceCheckUtils]: 57: Hoare triple {2806#false} SUMMARY for call #t~mem8 := read~int(~#string_B~0.base, ~#string_B~0.offset + ~nc_B~0, 1); srcloc: L37-5 {2806#false} is VALID [2020-07-11 02:27:54,137 INFO L280 TraceCheckUtils]: 58: Hoare triple {2806#false} assume !(0 != #t~mem8); {2806#false} is VALID [2020-07-11 02:27:54,137 INFO L280 TraceCheckUtils]: 59: Hoare triple {2806#false} havoc #t~mem8; {2806#false} is VALID [2020-07-11 02:27:54,137 INFO L280 TraceCheckUtils]: 60: Hoare triple {2806#false} assume !!(~nc_B~0 >= ~nc_A~0); {2806#false} is VALID [2020-07-11 02:27:54,137 INFO L280 TraceCheckUtils]: 61: Hoare triple {2806#false} ~j~0 := 0; {2806#false} is VALID [2020-07-11 02:27:54,138 INFO L280 TraceCheckUtils]: 62: Hoare triple {2806#false} ~i~0 := ~j~0; {2806#false} is VALID [2020-07-11 02:27:54,138 INFO L280 TraceCheckUtils]: 63: Hoare triple {2806#false} assume !(~i~0 < ~nc_A~0 && ~j~0 < ~nc_B~0); {2806#false} is VALID [2020-07-11 02:27:54,138 INFO L280 TraceCheckUtils]: 64: Hoare triple {2806#false} ~found~0 := ~shiftLeft((if ~j~0 > ~nc_B~0 - 1 then 1 else 0), ~i~0); {2806#false} is VALID [2020-07-11 02:27:54,138 INFO L263 TraceCheckUtils]: 65: Hoare triple {2806#false} call __VERIFIER_assert((if 0 == ~found~0 || 1 == ~found~0 then 1 else 0)); {2806#false} is VALID [2020-07-11 02:27:54,138 INFO L280 TraceCheckUtils]: 66: Hoare triple {2806#false} ~cond := #in~cond; {2806#false} is VALID [2020-07-11 02:27:54,139 INFO L280 TraceCheckUtils]: 67: Hoare triple {2806#false} assume 0 == ~cond; {2806#false} is VALID [2020-07-11 02:27:54,139 INFO L280 TraceCheckUtils]: 68: Hoare triple {2806#false} assume !false; {2806#false} is VALID [2020-07-11 02:27:54,144 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-11 02:27:54,145 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [614365718] [2020-07-11 02:27:54,145 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-11 02:27:54,145 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-07-11 02:27:54,145 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587747949] [2020-07-11 02:27:54,147 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 69 [2020-07-11 02:27:54,148 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 02:27:54,148 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-11 02:27:54,203 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:27:54,203 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-11 02:27:54,204 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 02:27:54,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-11 02:27:54,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-07-11 02:27:54,205 INFO L87 Difference]: Start difference. First operand 93 states and 98 transitions. Second operand 8 states. [2020-07-11 02:27:54,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:27:54,740 INFO L93 Difference]: Finished difference Result 168 states and 178 transitions. [2020-07-11 02:27:54,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-11 02:27:54,740 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 69 [2020-07-11 02:27:54,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 02:27:54,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-11 02:27:54,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 168 transitions. [2020-07-11 02:27:54,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-11 02:27:54,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 168 transitions. [2020-07-11 02:27:54,747 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 168 transitions. [2020-07-11 02:27:54,924 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 168 edges. 168 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:27:54,926 INFO L225 Difference]: With dead ends: 168 [2020-07-11 02:27:54,926 INFO L226 Difference]: Without dead ends: 105 [2020-07-11 02:27:54,927 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2020-07-11 02:27:54,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2020-07-11 02:27:54,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 100. [2020-07-11 02:27:54,992 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 02:27:54,992 INFO L82 GeneralOperation]: Start isEquivalent. First operand 105 states. Second operand 100 states. [2020-07-11 02:27:54,993 INFO L74 IsIncluded]: Start isIncluded. First operand 105 states. Second operand 100 states. [2020-07-11 02:27:54,993 INFO L87 Difference]: Start difference. First operand 105 states. Second operand 100 states. [2020-07-11 02:27:54,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:27:54,996 INFO L93 Difference]: Finished difference Result 105 states and 110 transitions. [2020-07-11 02:27:54,996 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 110 transitions. [2020-07-11 02:27:54,997 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:27:54,997 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:27:54,997 INFO L74 IsIncluded]: Start isIncluded. First operand 100 states. Second operand 105 states. [2020-07-11 02:27:54,997 INFO L87 Difference]: Start difference. First operand 100 states. Second operand 105 states. [2020-07-11 02:27:55,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:27:55,001 INFO L93 Difference]: Finished difference Result 105 states and 110 transitions. [2020-07-11 02:27:55,001 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 110 transitions. [2020-07-11 02:27:55,001 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:27:55,002 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:27:55,002 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 02:27:55,002 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 02:27:55,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2020-07-11 02:27:55,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 105 transitions. [2020-07-11 02:27:55,005 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 105 transitions. Word has length 69 [2020-07-11 02:27:55,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 02:27:55,006 INFO L479 AbstractCegarLoop]: Abstraction has 100 states and 105 transitions. [2020-07-11 02:27:55,006 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-11 02:27:55,006 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 100 states and 105 transitions. [2020-07-11 02:27:55,112 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 105 edges. 105 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:27:55,112 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 105 transitions. [2020-07-11 02:27:55,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2020-07-11 02:27:55,114 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 02:27:55,114 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-11 02:27:55,114 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-11 02:27:55,115 INFO L427 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 02:27:55,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 02:27:55,115 INFO L82 PathProgramCache]: Analyzing trace with hash -1399032013, now seen corresponding path program 4 times [2020-07-11 02:27:55,115 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 02:27:55,115 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1907749832] [2020-07-11 02:27:55,116 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 02:27:55,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:27:55,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:27:55,292 INFO L280 TraceCheckUtils]: 0: Hoare triple {3588#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {3574#true} is VALID [2020-07-11 02:27:55,292 INFO L280 TraceCheckUtils]: 1: Hoare triple {3574#true} #valid := #valid[0 := 0]; {3574#true} is VALID [2020-07-11 02:27:55,292 INFO L280 TraceCheckUtils]: 2: Hoare triple {3574#true} assume 0 < #StackHeapBarrier; {3574#true} is VALID [2020-07-11 02:27:55,292 INFO L280 TraceCheckUtils]: 3: Hoare triple {3574#true} assume true; {3574#true} is VALID [2020-07-11 02:27:55,293 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {3574#true} {3574#true} #186#return; {3574#true} is VALID [2020-07-11 02:27:55,294 INFO L263 TraceCheckUtils]: 0: Hoare triple {3574#true} call ULTIMATE.init(); {3588#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-11 02:27:55,294 INFO L280 TraceCheckUtils]: 1: Hoare triple {3588#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {3574#true} is VALID [2020-07-11 02:27:55,294 INFO L280 TraceCheckUtils]: 2: Hoare triple {3574#true} #valid := #valid[0 := 0]; {3574#true} is VALID [2020-07-11 02:27:55,294 INFO L280 TraceCheckUtils]: 3: Hoare triple {3574#true} assume 0 < #StackHeapBarrier; {3574#true} is VALID [2020-07-11 02:27:55,295 INFO L280 TraceCheckUtils]: 4: Hoare triple {3574#true} assume true; {3574#true} is VALID [2020-07-11 02:27:55,295 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {3574#true} {3574#true} #186#return; {3574#true} is VALID [2020-07-11 02:27:55,295 INFO L263 TraceCheckUtils]: 6: Hoare triple {3574#true} call #t~ret14 := main(); {3574#true} is VALID [2020-07-11 02:27:55,295 INFO L280 TraceCheckUtils]: 7: Hoare triple {3574#true} SUMMARY for call ~#string_A~0.base, ~#string_A~0.offset := #Ultimate.allocOnStack(5); srcloc: mainENTRY {3574#true} is VALID [2020-07-11 02:27:55,296 INFO L280 TraceCheckUtils]: 8: Hoare triple {3574#true} SUMMARY for call ~#string_B~0.base, ~#string_B~0.offset := #Ultimate.allocOnStack(5); srcloc: L20 {3574#true} is VALID [2020-07-11 02:27:55,296 INFO L280 TraceCheckUtils]: 9: Hoare triple {3574#true} havoc ~i~0; {3574#true} is VALID [2020-07-11 02:27:55,296 INFO L280 TraceCheckUtils]: 10: Hoare triple {3574#true} havoc ~j~0; {3574#true} is VALID [2020-07-11 02:27:55,296 INFO L280 TraceCheckUtils]: 11: Hoare triple {3574#true} havoc ~nc_A~0; {3574#true} is VALID [2020-07-11 02:27:55,296 INFO L280 TraceCheckUtils]: 12: Hoare triple {3574#true} havoc ~nc_B~0; {3574#true} is VALID [2020-07-11 02:27:55,297 INFO L280 TraceCheckUtils]: 13: Hoare triple {3574#true} ~found~0 := 0; {3574#true} is VALID [2020-07-11 02:27:55,297 INFO L280 TraceCheckUtils]: 14: Hoare triple {3574#true} ~i~0 := 0; {3581#(= 0 main_~i~0)} is VALID [2020-07-11 02:27:55,298 INFO L280 TraceCheckUtils]: 15: Hoare triple {3581#(= 0 main_~i~0)} assume !!(~i~0 < 5); {3581#(= 0 main_~i~0)} is VALID [2020-07-11 02:27:55,298 INFO L280 TraceCheckUtils]: 16: Hoare triple {3581#(= 0 main_~i~0)} assume -128 <= #t~nondet1 && #t~nondet1 <= 127; {3581#(= 0 main_~i~0)} is VALID [2020-07-11 02:27:55,299 INFO L280 TraceCheckUtils]: 17: Hoare triple {3581#(= 0 main_~i~0)} SUMMARY for call write~int(#t~nondet1, ~#string_A~0.base, ~#string_A~0.offset + ~i~0, 1); srcloc: L25-1 {3581#(= 0 main_~i~0)} is VALID [2020-07-11 02:27:55,299 INFO L280 TraceCheckUtils]: 18: Hoare triple {3581#(= 0 main_~i~0)} havoc #t~nondet1; {3581#(= 0 main_~i~0)} is VALID [2020-07-11 02:27:55,300 INFO L280 TraceCheckUtils]: 19: Hoare triple {3581#(= 0 main_~i~0)} #t~post0 := ~i~0; {3582#(= |main_#t~post0| 0)} is VALID [2020-07-11 02:27:55,301 INFO L280 TraceCheckUtils]: 20: Hoare triple {3582#(= |main_#t~post0| 0)} ~i~0 := 1 + #t~post0; {3583#(<= main_~i~0 1)} is VALID [2020-07-11 02:27:55,301 INFO L280 TraceCheckUtils]: 21: Hoare triple {3583#(<= main_~i~0 1)} havoc #t~post0; {3583#(<= main_~i~0 1)} is VALID [2020-07-11 02:27:55,303 INFO L280 TraceCheckUtils]: 22: Hoare triple {3583#(<= main_~i~0 1)} assume !!(~i~0 < 5); {3583#(<= main_~i~0 1)} is VALID [2020-07-11 02:27:55,306 INFO L280 TraceCheckUtils]: 23: Hoare triple {3583#(<= main_~i~0 1)} assume -128 <= #t~nondet1 && #t~nondet1 <= 127; {3583#(<= main_~i~0 1)} is VALID [2020-07-11 02:27:55,309 INFO L280 TraceCheckUtils]: 24: Hoare triple {3583#(<= main_~i~0 1)} SUMMARY for call write~int(#t~nondet1, ~#string_A~0.base, ~#string_A~0.offset + ~i~0, 1); srcloc: L25-1 {3583#(<= main_~i~0 1)} is VALID [2020-07-11 02:27:55,310 INFO L280 TraceCheckUtils]: 25: Hoare triple {3583#(<= main_~i~0 1)} havoc #t~nondet1; {3583#(<= main_~i~0 1)} is VALID [2020-07-11 02:27:55,311 INFO L280 TraceCheckUtils]: 26: Hoare triple {3583#(<= main_~i~0 1)} #t~post0 := ~i~0; {3584#(<= |main_#t~post0| 1)} is VALID [2020-07-11 02:27:55,312 INFO L280 TraceCheckUtils]: 27: Hoare triple {3584#(<= |main_#t~post0| 1)} ~i~0 := 1 + #t~post0; {3585#(<= main_~i~0 2)} is VALID [2020-07-11 02:27:55,313 INFO L280 TraceCheckUtils]: 28: Hoare triple {3585#(<= main_~i~0 2)} havoc #t~post0; {3585#(<= main_~i~0 2)} is VALID [2020-07-11 02:27:55,314 INFO L280 TraceCheckUtils]: 29: Hoare triple {3585#(<= main_~i~0 2)} assume !!(~i~0 < 5); {3585#(<= main_~i~0 2)} is VALID [2020-07-11 02:27:55,314 INFO L280 TraceCheckUtils]: 30: Hoare triple {3585#(<= main_~i~0 2)} assume -128 <= #t~nondet1 && #t~nondet1 <= 127; {3585#(<= main_~i~0 2)} is VALID [2020-07-11 02:27:55,315 INFO L280 TraceCheckUtils]: 31: Hoare triple {3585#(<= main_~i~0 2)} SUMMARY for call write~int(#t~nondet1, ~#string_A~0.base, ~#string_A~0.offset + ~i~0, 1); srcloc: L25-1 {3585#(<= main_~i~0 2)} is VALID [2020-07-11 02:27:55,315 INFO L280 TraceCheckUtils]: 32: Hoare triple {3585#(<= main_~i~0 2)} havoc #t~nondet1; {3585#(<= main_~i~0 2)} is VALID [2020-07-11 02:27:55,316 INFO L280 TraceCheckUtils]: 33: Hoare triple {3585#(<= main_~i~0 2)} #t~post0 := ~i~0; {3586#(<= |main_#t~post0| 2)} is VALID [2020-07-11 02:27:55,317 INFO L280 TraceCheckUtils]: 34: Hoare triple {3586#(<= |main_#t~post0| 2)} ~i~0 := 1 + #t~post0; {3587#(<= main_~i~0 3)} is VALID [2020-07-11 02:27:55,317 INFO L280 TraceCheckUtils]: 35: Hoare triple {3587#(<= main_~i~0 3)} havoc #t~post0; {3587#(<= main_~i~0 3)} is VALID [2020-07-11 02:27:55,318 INFO L280 TraceCheckUtils]: 36: Hoare triple {3587#(<= main_~i~0 3)} assume !(~i~0 < 5); {3575#false} is VALID [2020-07-11 02:27:55,318 INFO L280 TraceCheckUtils]: 37: Hoare triple {3575#false} SUMMARY for call #t~mem2 := read~int(~#string_A~0.base, 4 + ~#string_A~0.offset, 1); srcloc: L24-7 {3575#false} is VALID [2020-07-11 02:27:55,319 INFO L280 TraceCheckUtils]: 38: Hoare triple {3575#false} assume !!(0 == #t~mem2); {3575#false} is VALID [2020-07-11 02:27:55,319 INFO L280 TraceCheckUtils]: 39: Hoare triple {3575#false} havoc #t~mem2; {3575#false} is VALID [2020-07-11 02:27:55,319 INFO L280 TraceCheckUtils]: 40: Hoare triple {3575#false} ~i~0 := 0; {3575#false} is VALID [2020-07-11 02:27:55,319 INFO L280 TraceCheckUtils]: 41: Hoare triple {3575#false} assume !!(~i~0 < 5); {3575#false} is VALID [2020-07-11 02:27:55,320 INFO L280 TraceCheckUtils]: 42: Hoare triple {3575#false} assume -128 <= #t~nondet4 && #t~nondet4 <= 127; {3575#false} is VALID [2020-07-11 02:27:55,320 INFO L280 TraceCheckUtils]: 43: Hoare triple {3575#false} SUMMARY for call write~int(#t~nondet4, ~#string_B~0.base, ~#string_B~0.offset + ~i~0, 1); srcloc: L29-1 {3575#false} is VALID [2020-07-11 02:27:55,320 INFO L280 TraceCheckUtils]: 44: Hoare triple {3575#false} havoc #t~nondet4; {3575#false} is VALID [2020-07-11 02:27:55,321 INFO L280 TraceCheckUtils]: 45: Hoare triple {3575#false} #t~post3 := ~i~0; {3575#false} is VALID [2020-07-11 02:27:55,321 INFO L280 TraceCheckUtils]: 46: Hoare triple {3575#false} ~i~0 := 1 + #t~post3; {3575#false} is VALID [2020-07-11 02:27:55,321 INFO L280 TraceCheckUtils]: 47: Hoare triple {3575#false} havoc #t~post3; {3575#false} is VALID [2020-07-11 02:27:55,321 INFO L280 TraceCheckUtils]: 48: Hoare triple {3575#false} assume !!(~i~0 < 5); {3575#false} is VALID [2020-07-11 02:27:55,322 INFO L280 TraceCheckUtils]: 49: Hoare triple {3575#false} assume -128 <= #t~nondet4 && #t~nondet4 <= 127; {3575#false} is VALID [2020-07-11 02:27:55,322 INFO L280 TraceCheckUtils]: 50: Hoare triple {3575#false} SUMMARY for call write~int(#t~nondet4, ~#string_B~0.base, ~#string_B~0.offset + ~i~0, 1); srcloc: L29-1 {3575#false} is VALID [2020-07-11 02:27:55,322 INFO L280 TraceCheckUtils]: 51: Hoare triple {3575#false} havoc #t~nondet4; {3575#false} is VALID [2020-07-11 02:27:55,322 INFO L280 TraceCheckUtils]: 52: Hoare triple {3575#false} #t~post3 := ~i~0; {3575#false} is VALID [2020-07-11 02:27:55,323 INFO L280 TraceCheckUtils]: 53: Hoare triple {3575#false} ~i~0 := 1 + #t~post3; {3575#false} is VALID [2020-07-11 02:27:55,323 INFO L280 TraceCheckUtils]: 54: Hoare triple {3575#false} havoc #t~post3; {3575#false} is VALID [2020-07-11 02:27:55,323 INFO L280 TraceCheckUtils]: 55: Hoare triple {3575#false} assume !(~i~0 < 5); {3575#false} is VALID [2020-07-11 02:27:55,324 INFO L280 TraceCheckUtils]: 56: Hoare triple {3575#false} SUMMARY for call #t~mem5 := read~int(~#string_B~0.base, 4 + ~#string_B~0.offset, 1); srcloc: L28-7 {3575#false} is VALID [2020-07-11 02:27:55,324 INFO L280 TraceCheckUtils]: 57: Hoare triple {3575#false} assume !!(0 == #t~mem5); {3575#false} is VALID [2020-07-11 02:27:55,324 INFO L280 TraceCheckUtils]: 58: Hoare triple {3575#false} havoc #t~mem5; {3575#false} is VALID [2020-07-11 02:27:55,324 INFO L280 TraceCheckUtils]: 59: Hoare triple {3575#false} ~nc_A~0 := 0; {3575#false} is VALID [2020-07-11 02:27:55,325 INFO L280 TraceCheckUtils]: 60: Hoare triple {3575#false} SUMMARY for call #t~mem6 := read~int(~#string_A~0.base, ~#string_A~0.offset + ~nc_A~0, 1); srcloc: L33-5 {3575#false} is VALID [2020-07-11 02:27:55,325 INFO L280 TraceCheckUtils]: 61: Hoare triple {3575#false} assume !(0 != #t~mem6); {3575#false} is VALID [2020-07-11 02:27:55,325 INFO L280 TraceCheckUtils]: 62: Hoare triple {3575#false} havoc #t~mem6; {3575#false} is VALID [2020-07-11 02:27:55,325 INFO L280 TraceCheckUtils]: 63: Hoare triple {3575#false} ~nc_B~0 := 0; {3575#false} is VALID [2020-07-11 02:27:55,325 INFO L280 TraceCheckUtils]: 64: Hoare triple {3575#false} SUMMARY for call #t~mem8 := read~int(~#string_B~0.base, ~#string_B~0.offset + ~nc_B~0, 1); srcloc: L37-5 {3575#false} is VALID [2020-07-11 02:27:55,326 INFO L280 TraceCheckUtils]: 65: Hoare triple {3575#false} assume !(0 != #t~mem8); {3575#false} is VALID [2020-07-11 02:27:55,326 INFO L280 TraceCheckUtils]: 66: Hoare triple {3575#false} havoc #t~mem8; {3575#false} is VALID [2020-07-11 02:27:55,326 INFO L280 TraceCheckUtils]: 67: Hoare triple {3575#false} assume !!(~nc_B~0 >= ~nc_A~0); {3575#false} is VALID [2020-07-11 02:27:55,326 INFO L280 TraceCheckUtils]: 68: Hoare triple {3575#false} ~j~0 := 0; {3575#false} is VALID [2020-07-11 02:27:55,327 INFO L280 TraceCheckUtils]: 69: Hoare triple {3575#false} ~i~0 := ~j~0; {3575#false} is VALID [2020-07-11 02:27:55,327 INFO L280 TraceCheckUtils]: 70: Hoare triple {3575#false} assume !(~i~0 < ~nc_A~0 && ~j~0 < ~nc_B~0); {3575#false} is VALID [2020-07-11 02:27:55,327 INFO L280 TraceCheckUtils]: 71: Hoare triple {3575#false} ~found~0 := ~shiftLeft((if ~j~0 > ~nc_B~0 - 1 then 1 else 0), ~i~0); {3575#false} is VALID [2020-07-11 02:27:55,328 INFO L263 TraceCheckUtils]: 72: Hoare triple {3575#false} call __VERIFIER_assert((if 0 == ~found~0 || 1 == ~found~0 then 1 else 0)); {3575#false} is VALID [2020-07-11 02:27:55,328 INFO L280 TraceCheckUtils]: 73: Hoare triple {3575#false} ~cond := #in~cond; {3575#false} is VALID [2020-07-11 02:27:55,328 INFO L280 TraceCheckUtils]: 74: Hoare triple {3575#false} assume 0 == ~cond; {3575#false} is VALID [2020-07-11 02:27:55,328 INFO L280 TraceCheckUtils]: 75: Hoare triple {3575#false} assume !false; {3575#false} is VALID [2020-07-11 02:27:55,333 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2020-07-11 02:27:55,334 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1907749832] [2020-07-11 02:27:55,334 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-11 02:27:55,334 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-07-11 02:27:55,334 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042283199] [2020-07-11 02:27:55,335 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 76 [2020-07-11 02:27:55,335 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 02:27:55,335 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2020-07-11 02:27:55,402 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:27:55,402 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-11 02:27:55,402 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 02:27:55,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-11 02:27:55,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2020-07-11 02:27:55,403 INFO L87 Difference]: Start difference. First operand 100 states and 105 transitions. Second operand 10 states. [2020-07-11 02:27:56,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:27:56,095 INFO L93 Difference]: Finished difference Result 175 states and 185 transitions. [2020-07-11 02:27:56,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-07-11 02:27:56,095 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 76 [2020-07-11 02:27:56,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 02:27:56,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-11 02:27:56,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 175 transitions. [2020-07-11 02:27:56,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-11 02:27:56,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 175 transitions. [2020-07-11 02:27:56,102 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 175 transitions. [2020-07-11 02:27:56,262 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 175 edges. 175 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:27:56,265 INFO L225 Difference]: With dead ends: 175 [2020-07-11 02:27:56,265 INFO L226 Difference]: Without dead ends: 112 [2020-07-11 02:27:56,266 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=160, Unknown=0, NotChecked=0, Total=240 [2020-07-11 02:27:56,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2020-07-11 02:27:56,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 107. [2020-07-11 02:27:56,343 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 02:27:56,343 INFO L82 GeneralOperation]: Start isEquivalent. First operand 112 states. Second operand 107 states. [2020-07-11 02:27:56,343 INFO L74 IsIncluded]: Start isIncluded. First operand 112 states. Second operand 107 states. [2020-07-11 02:27:56,343 INFO L87 Difference]: Start difference. First operand 112 states. Second operand 107 states. [2020-07-11 02:27:56,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:27:56,347 INFO L93 Difference]: Finished difference Result 112 states and 117 transitions. [2020-07-11 02:27:56,347 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 117 transitions. [2020-07-11 02:27:56,347 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:27:56,347 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:27:56,348 INFO L74 IsIncluded]: Start isIncluded. First operand 107 states. Second operand 112 states. [2020-07-11 02:27:56,348 INFO L87 Difference]: Start difference. First operand 107 states. Second operand 112 states. [2020-07-11 02:27:56,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:27:56,352 INFO L93 Difference]: Finished difference Result 112 states and 117 transitions. [2020-07-11 02:27:56,352 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 117 transitions. [2020-07-11 02:27:56,352 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:27:56,352 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:27:56,352 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 02:27:56,353 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 02:27:56,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2020-07-11 02:27:56,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 112 transitions. [2020-07-11 02:27:56,356 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 112 transitions. Word has length 76 [2020-07-11 02:27:56,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 02:27:56,356 INFO L479 AbstractCegarLoop]: Abstraction has 107 states and 112 transitions. [2020-07-11 02:27:56,356 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-11 02:27:56,356 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 107 states and 112 transitions. [2020-07-11 02:27:56,469 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 112 edges. 112 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:27:56,469 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 112 transitions. [2020-07-11 02:27:56,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2020-07-11 02:27:56,471 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 02:27:56,471 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-11 02:27:56,471 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-11 02:27:56,472 INFO L427 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 02:27:56,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 02:27:56,472 INFO L82 PathProgramCache]: Analyzing trace with hash 1633037998, now seen corresponding path program 5 times [2020-07-11 02:27:56,472 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 02:27:56,473 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1649089592] [2020-07-11 02:27:56,473 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 02:27:56,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:27:56,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:27:56,662 INFO L280 TraceCheckUtils]: 0: Hoare triple {4407#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {4391#true} is VALID [2020-07-11 02:27:56,663 INFO L280 TraceCheckUtils]: 1: Hoare triple {4391#true} #valid := #valid[0 := 0]; {4391#true} is VALID [2020-07-11 02:27:56,663 INFO L280 TraceCheckUtils]: 2: Hoare triple {4391#true} assume 0 < #StackHeapBarrier; {4391#true} is VALID [2020-07-11 02:27:56,663 INFO L280 TraceCheckUtils]: 3: Hoare triple {4391#true} assume true; {4391#true} is VALID [2020-07-11 02:27:56,663 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {4391#true} {4391#true} #186#return; {4391#true} is VALID [2020-07-11 02:27:56,664 INFO L263 TraceCheckUtils]: 0: Hoare triple {4391#true} call ULTIMATE.init(); {4407#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-11 02:27:56,664 INFO L280 TraceCheckUtils]: 1: Hoare triple {4407#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {4391#true} is VALID [2020-07-11 02:27:56,664 INFO L280 TraceCheckUtils]: 2: Hoare triple {4391#true} #valid := #valid[0 := 0]; {4391#true} is VALID [2020-07-11 02:27:56,664 INFO L280 TraceCheckUtils]: 3: Hoare triple {4391#true} assume 0 < #StackHeapBarrier; {4391#true} is VALID [2020-07-11 02:27:56,664 INFO L280 TraceCheckUtils]: 4: Hoare triple {4391#true} assume true; {4391#true} is VALID [2020-07-11 02:27:56,664 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {4391#true} {4391#true} #186#return; {4391#true} is VALID [2020-07-11 02:27:56,665 INFO L263 TraceCheckUtils]: 6: Hoare triple {4391#true} call #t~ret14 := main(); {4391#true} is VALID [2020-07-11 02:27:56,665 INFO L280 TraceCheckUtils]: 7: Hoare triple {4391#true} SUMMARY for call ~#string_A~0.base, ~#string_A~0.offset := #Ultimate.allocOnStack(5); srcloc: mainENTRY {4391#true} is VALID [2020-07-11 02:27:56,665 INFO L280 TraceCheckUtils]: 8: Hoare triple {4391#true} SUMMARY for call ~#string_B~0.base, ~#string_B~0.offset := #Ultimate.allocOnStack(5); srcloc: L20 {4391#true} is VALID [2020-07-11 02:27:56,665 INFO L280 TraceCheckUtils]: 9: Hoare triple {4391#true} havoc ~i~0; {4391#true} is VALID [2020-07-11 02:27:56,665 INFO L280 TraceCheckUtils]: 10: Hoare triple {4391#true} havoc ~j~0; {4391#true} is VALID [2020-07-11 02:27:56,666 INFO L280 TraceCheckUtils]: 11: Hoare triple {4391#true} havoc ~nc_A~0; {4391#true} is VALID [2020-07-11 02:27:56,666 INFO L280 TraceCheckUtils]: 12: Hoare triple {4391#true} havoc ~nc_B~0; {4391#true} is VALID [2020-07-11 02:27:56,666 INFO L280 TraceCheckUtils]: 13: Hoare triple {4391#true} ~found~0 := 0; {4391#true} is VALID [2020-07-11 02:27:56,668 INFO L280 TraceCheckUtils]: 14: Hoare triple {4391#true} ~i~0 := 0; {4398#(= 0 main_~i~0)} is VALID [2020-07-11 02:27:56,670 INFO L280 TraceCheckUtils]: 15: Hoare triple {4398#(= 0 main_~i~0)} assume !!(~i~0 < 5); {4398#(= 0 main_~i~0)} is VALID [2020-07-11 02:27:56,671 INFO L280 TraceCheckUtils]: 16: Hoare triple {4398#(= 0 main_~i~0)} assume -128 <= #t~nondet1 && #t~nondet1 <= 127; {4398#(= 0 main_~i~0)} is VALID [2020-07-11 02:27:56,672 INFO L280 TraceCheckUtils]: 17: Hoare triple {4398#(= 0 main_~i~0)} SUMMARY for call write~int(#t~nondet1, ~#string_A~0.base, ~#string_A~0.offset + ~i~0, 1); srcloc: L25-1 {4398#(= 0 main_~i~0)} is VALID [2020-07-11 02:27:56,672 INFO L280 TraceCheckUtils]: 18: Hoare triple {4398#(= 0 main_~i~0)} havoc #t~nondet1; {4398#(= 0 main_~i~0)} is VALID [2020-07-11 02:27:56,672 INFO L280 TraceCheckUtils]: 19: Hoare triple {4398#(= 0 main_~i~0)} #t~post0 := ~i~0; {4399#(= |main_#t~post0| 0)} is VALID [2020-07-11 02:27:56,673 INFO L280 TraceCheckUtils]: 20: Hoare triple {4399#(= |main_#t~post0| 0)} ~i~0 := 1 + #t~post0; {4400#(<= main_~i~0 1)} is VALID [2020-07-11 02:27:56,673 INFO L280 TraceCheckUtils]: 21: Hoare triple {4400#(<= main_~i~0 1)} havoc #t~post0; {4400#(<= main_~i~0 1)} is VALID [2020-07-11 02:27:56,674 INFO L280 TraceCheckUtils]: 22: Hoare triple {4400#(<= main_~i~0 1)} assume !!(~i~0 < 5); {4400#(<= main_~i~0 1)} is VALID [2020-07-11 02:27:56,678 INFO L280 TraceCheckUtils]: 23: Hoare triple {4400#(<= main_~i~0 1)} assume -128 <= #t~nondet1 && #t~nondet1 <= 127; {4400#(<= main_~i~0 1)} is VALID [2020-07-11 02:27:56,678 INFO L280 TraceCheckUtils]: 24: Hoare triple {4400#(<= main_~i~0 1)} SUMMARY for call write~int(#t~nondet1, ~#string_A~0.base, ~#string_A~0.offset + ~i~0, 1); srcloc: L25-1 {4400#(<= main_~i~0 1)} is VALID [2020-07-11 02:27:56,678 INFO L280 TraceCheckUtils]: 25: Hoare triple {4400#(<= main_~i~0 1)} havoc #t~nondet1; {4400#(<= main_~i~0 1)} is VALID [2020-07-11 02:27:56,679 INFO L280 TraceCheckUtils]: 26: Hoare triple {4400#(<= main_~i~0 1)} #t~post0 := ~i~0; {4401#(<= |main_#t~post0| 1)} is VALID [2020-07-11 02:27:56,679 INFO L280 TraceCheckUtils]: 27: Hoare triple {4401#(<= |main_#t~post0| 1)} ~i~0 := 1 + #t~post0; {4402#(<= main_~i~0 2)} is VALID [2020-07-11 02:27:56,680 INFO L280 TraceCheckUtils]: 28: Hoare triple {4402#(<= main_~i~0 2)} havoc #t~post0; {4402#(<= main_~i~0 2)} is VALID [2020-07-11 02:27:56,680 INFO L280 TraceCheckUtils]: 29: Hoare triple {4402#(<= main_~i~0 2)} assume !!(~i~0 < 5); {4402#(<= main_~i~0 2)} is VALID [2020-07-11 02:27:56,681 INFO L280 TraceCheckUtils]: 30: Hoare triple {4402#(<= main_~i~0 2)} assume -128 <= #t~nondet1 && #t~nondet1 <= 127; {4402#(<= main_~i~0 2)} is VALID [2020-07-11 02:27:56,681 INFO L280 TraceCheckUtils]: 31: Hoare triple {4402#(<= main_~i~0 2)} SUMMARY for call write~int(#t~nondet1, ~#string_A~0.base, ~#string_A~0.offset + ~i~0, 1); srcloc: L25-1 {4402#(<= main_~i~0 2)} is VALID [2020-07-11 02:27:56,681 INFO L280 TraceCheckUtils]: 32: Hoare triple {4402#(<= main_~i~0 2)} havoc #t~nondet1; {4402#(<= main_~i~0 2)} is VALID [2020-07-11 02:27:56,682 INFO L280 TraceCheckUtils]: 33: Hoare triple {4402#(<= main_~i~0 2)} #t~post0 := ~i~0; {4403#(<= |main_#t~post0| 2)} is VALID [2020-07-11 02:27:56,682 INFO L280 TraceCheckUtils]: 34: Hoare triple {4403#(<= |main_#t~post0| 2)} ~i~0 := 1 + #t~post0; {4404#(<= main_~i~0 3)} is VALID [2020-07-11 02:27:56,683 INFO L280 TraceCheckUtils]: 35: Hoare triple {4404#(<= main_~i~0 3)} havoc #t~post0; {4404#(<= main_~i~0 3)} is VALID [2020-07-11 02:27:56,683 INFO L280 TraceCheckUtils]: 36: Hoare triple {4404#(<= main_~i~0 3)} assume !!(~i~0 < 5); {4404#(<= main_~i~0 3)} is VALID [2020-07-11 02:27:56,684 INFO L280 TraceCheckUtils]: 37: Hoare triple {4404#(<= main_~i~0 3)} assume -128 <= #t~nondet1 && #t~nondet1 <= 127; {4404#(<= main_~i~0 3)} is VALID [2020-07-11 02:27:56,684 INFO L280 TraceCheckUtils]: 38: Hoare triple {4404#(<= main_~i~0 3)} SUMMARY for call write~int(#t~nondet1, ~#string_A~0.base, ~#string_A~0.offset + ~i~0, 1); srcloc: L25-1 {4404#(<= main_~i~0 3)} is VALID [2020-07-11 02:27:56,685 INFO L280 TraceCheckUtils]: 39: Hoare triple {4404#(<= main_~i~0 3)} havoc #t~nondet1; {4404#(<= main_~i~0 3)} is VALID [2020-07-11 02:27:56,688 INFO L280 TraceCheckUtils]: 40: Hoare triple {4404#(<= main_~i~0 3)} #t~post0 := ~i~0; {4405#(<= |main_#t~post0| 3)} is VALID [2020-07-11 02:27:56,688 INFO L280 TraceCheckUtils]: 41: Hoare triple {4405#(<= |main_#t~post0| 3)} ~i~0 := 1 + #t~post0; {4406#(<= main_~i~0 4)} is VALID [2020-07-11 02:27:56,689 INFO L280 TraceCheckUtils]: 42: Hoare triple {4406#(<= main_~i~0 4)} havoc #t~post0; {4406#(<= main_~i~0 4)} is VALID [2020-07-11 02:27:56,689 INFO L280 TraceCheckUtils]: 43: Hoare triple {4406#(<= main_~i~0 4)} assume !(~i~0 < 5); {4392#false} is VALID [2020-07-11 02:27:56,689 INFO L280 TraceCheckUtils]: 44: Hoare triple {4392#false} SUMMARY for call #t~mem2 := read~int(~#string_A~0.base, 4 + ~#string_A~0.offset, 1); srcloc: L24-7 {4392#false} is VALID [2020-07-11 02:27:56,689 INFO L280 TraceCheckUtils]: 45: Hoare triple {4392#false} assume !!(0 == #t~mem2); {4392#false} is VALID [2020-07-11 02:27:56,690 INFO L280 TraceCheckUtils]: 46: Hoare triple {4392#false} havoc #t~mem2; {4392#false} is VALID [2020-07-11 02:27:56,690 INFO L280 TraceCheckUtils]: 47: Hoare triple {4392#false} ~i~0 := 0; {4392#false} is VALID [2020-07-11 02:27:56,690 INFO L280 TraceCheckUtils]: 48: Hoare triple {4392#false} assume !!(~i~0 < 5); {4392#false} is VALID [2020-07-11 02:27:56,690 INFO L280 TraceCheckUtils]: 49: Hoare triple {4392#false} assume -128 <= #t~nondet4 && #t~nondet4 <= 127; {4392#false} is VALID [2020-07-11 02:27:56,690 INFO L280 TraceCheckUtils]: 50: Hoare triple {4392#false} SUMMARY for call write~int(#t~nondet4, ~#string_B~0.base, ~#string_B~0.offset + ~i~0, 1); srcloc: L29-1 {4392#false} is VALID [2020-07-11 02:27:56,690 INFO L280 TraceCheckUtils]: 51: Hoare triple {4392#false} havoc #t~nondet4; {4392#false} is VALID [2020-07-11 02:27:56,691 INFO L280 TraceCheckUtils]: 52: Hoare triple {4392#false} #t~post3 := ~i~0; {4392#false} is VALID [2020-07-11 02:27:56,691 INFO L280 TraceCheckUtils]: 53: Hoare triple {4392#false} ~i~0 := 1 + #t~post3; {4392#false} is VALID [2020-07-11 02:27:56,691 INFO L280 TraceCheckUtils]: 54: Hoare triple {4392#false} havoc #t~post3; {4392#false} is VALID [2020-07-11 02:27:56,691 INFO L280 TraceCheckUtils]: 55: Hoare triple {4392#false} assume !!(~i~0 < 5); {4392#false} is VALID [2020-07-11 02:27:56,691 INFO L280 TraceCheckUtils]: 56: Hoare triple {4392#false} assume -128 <= #t~nondet4 && #t~nondet4 <= 127; {4392#false} is VALID [2020-07-11 02:27:56,692 INFO L280 TraceCheckUtils]: 57: Hoare triple {4392#false} SUMMARY for call write~int(#t~nondet4, ~#string_B~0.base, ~#string_B~0.offset + ~i~0, 1); srcloc: L29-1 {4392#false} is VALID [2020-07-11 02:27:56,692 INFO L280 TraceCheckUtils]: 58: Hoare triple {4392#false} havoc #t~nondet4; {4392#false} is VALID [2020-07-11 02:27:56,692 INFO L280 TraceCheckUtils]: 59: Hoare triple {4392#false} #t~post3 := ~i~0; {4392#false} is VALID [2020-07-11 02:27:56,692 INFO L280 TraceCheckUtils]: 60: Hoare triple {4392#false} ~i~0 := 1 + #t~post3; {4392#false} is VALID [2020-07-11 02:27:56,692 INFO L280 TraceCheckUtils]: 61: Hoare triple {4392#false} havoc #t~post3; {4392#false} is VALID [2020-07-11 02:27:56,693 INFO L280 TraceCheckUtils]: 62: Hoare triple {4392#false} assume !(~i~0 < 5); {4392#false} is VALID [2020-07-11 02:27:56,693 INFO L280 TraceCheckUtils]: 63: Hoare triple {4392#false} SUMMARY for call #t~mem5 := read~int(~#string_B~0.base, 4 + ~#string_B~0.offset, 1); srcloc: L28-7 {4392#false} is VALID [2020-07-11 02:27:56,693 INFO L280 TraceCheckUtils]: 64: Hoare triple {4392#false} assume !!(0 == #t~mem5); {4392#false} is VALID [2020-07-11 02:27:56,693 INFO L280 TraceCheckUtils]: 65: Hoare triple {4392#false} havoc #t~mem5; {4392#false} is VALID [2020-07-11 02:27:56,693 INFO L280 TraceCheckUtils]: 66: Hoare triple {4392#false} ~nc_A~0 := 0; {4392#false} is VALID [2020-07-11 02:27:56,693 INFO L280 TraceCheckUtils]: 67: Hoare triple {4392#false} SUMMARY for call #t~mem6 := read~int(~#string_A~0.base, ~#string_A~0.offset + ~nc_A~0, 1); srcloc: L33-5 {4392#false} is VALID [2020-07-11 02:27:56,694 INFO L280 TraceCheckUtils]: 68: Hoare triple {4392#false} assume !(0 != #t~mem6); {4392#false} is VALID [2020-07-11 02:27:56,694 INFO L280 TraceCheckUtils]: 69: Hoare triple {4392#false} havoc #t~mem6; {4392#false} is VALID [2020-07-11 02:27:56,694 INFO L280 TraceCheckUtils]: 70: Hoare triple {4392#false} ~nc_B~0 := 0; {4392#false} is VALID [2020-07-11 02:27:56,694 INFO L280 TraceCheckUtils]: 71: Hoare triple {4392#false} SUMMARY for call #t~mem8 := read~int(~#string_B~0.base, ~#string_B~0.offset + ~nc_B~0, 1); srcloc: L37-5 {4392#false} is VALID [2020-07-11 02:27:56,694 INFO L280 TraceCheckUtils]: 72: Hoare triple {4392#false} assume !(0 != #t~mem8); {4392#false} is VALID [2020-07-11 02:27:56,695 INFO L280 TraceCheckUtils]: 73: Hoare triple {4392#false} havoc #t~mem8; {4392#false} is VALID [2020-07-11 02:27:56,695 INFO L280 TraceCheckUtils]: 74: Hoare triple {4392#false} assume !!(~nc_B~0 >= ~nc_A~0); {4392#false} is VALID [2020-07-11 02:27:56,695 INFO L280 TraceCheckUtils]: 75: Hoare triple {4392#false} ~j~0 := 0; {4392#false} is VALID [2020-07-11 02:27:56,695 INFO L280 TraceCheckUtils]: 76: Hoare triple {4392#false} ~i~0 := ~j~0; {4392#false} is VALID [2020-07-11 02:27:56,695 INFO L280 TraceCheckUtils]: 77: Hoare triple {4392#false} assume !(~i~0 < ~nc_A~0 && ~j~0 < ~nc_B~0); {4392#false} is VALID [2020-07-11 02:27:56,696 INFO L280 TraceCheckUtils]: 78: Hoare triple {4392#false} ~found~0 := ~shiftLeft((if ~j~0 > ~nc_B~0 - 1 then 1 else 0), ~i~0); {4392#false} is VALID [2020-07-11 02:27:56,696 INFO L263 TraceCheckUtils]: 79: Hoare triple {4392#false} call __VERIFIER_assert((if 0 == ~found~0 || 1 == ~found~0 then 1 else 0)); {4392#false} is VALID [2020-07-11 02:27:56,696 INFO L280 TraceCheckUtils]: 80: Hoare triple {4392#false} ~cond := #in~cond; {4392#false} is VALID [2020-07-11 02:27:56,696 INFO L280 TraceCheckUtils]: 81: Hoare triple {4392#false} assume 0 == ~cond; {4392#false} is VALID [2020-07-11 02:27:56,696 INFO L280 TraceCheckUtils]: 82: Hoare triple {4392#false} assume !false; {4392#false} is VALID [2020-07-11 02:27:56,711 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2020-07-11 02:27:56,712 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1649089592] [2020-07-11 02:27:56,712 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-11 02:27:56,712 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2020-07-11 02:27:56,712 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612124272] [2020-07-11 02:27:56,713 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 83 [2020-07-11 02:27:56,713 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 02:27:56,713 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2020-07-11 02:27:56,785 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:27:56,785 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-07-11 02:27:56,785 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 02:27:56,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-07-11 02:27:56,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2020-07-11 02:27:56,786 INFO L87 Difference]: Start difference. First operand 107 states and 112 transitions. Second operand 12 states. [2020-07-11 02:27:57,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:27:57,639 INFO L93 Difference]: Finished difference Result 177 states and 187 transitions. [2020-07-11 02:27:57,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-07-11 02:27:57,639 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 83 [2020-07-11 02:27:57,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 02:27:57,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-11 02:27:57,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 177 transitions. [2020-07-11 02:27:57,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-11 02:27:57,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 177 transitions. [2020-07-11 02:27:57,646 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 177 transitions. [2020-07-11 02:27:57,827 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 177 edges. 177 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:27:57,830 INFO L225 Difference]: With dead ends: 177 [2020-07-11 02:27:57,830 INFO L226 Difference]: Without dead ends: 114 [2020-07-11 02:27:57,831 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=125, Invalid=255, Unknown=0, NotChecked=0, Total=380 [2020-07-11 02:27:57,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2020-07-11 02:27:57,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2020-07-11 02:27:57,932 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 02:27:57,932 INFO L82 GeneralOperation]: Start isEquivalent. First operand 114 states. Second operand 114 states. [2020-07-11 02:27:57,932 INFO L74 IsIncluded]: Start isIncluded. First operand 114 states. Second operand 114 states. [2020-07-11 02:27:57,932 INFO L87 Difference]: Start difference. First operand 114 states. Second operand 114 states. [2020-07-11 02:27:57,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:27:57,936 INFO L93 Difference]: Finished difference Result 114 states and 119 transitions. [2020-07-11 02:27:57,936 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 119 transitions. [2020-07-11 02:27:57,936 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:27:57,936 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:27:57,936 INFO L74 IsIncluded]: Start isIncluded. First operand 114 states. Second operand 114 states. [2020-07-11 02:27:57,937 INFO L87 Difference]: Start difference. First operand 114 states. Second operand 114 states. [2020-07-11 02:27:57,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:27:57,940 INFO L93 Difference]: Finished difference Result 114 states and 119 transitions. [2020-07-11 02:27:57,940 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 119 transitions. [2020-07-11 02:27:57,941 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:27:57,941 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:27:57,941 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 02:27:57,941 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 02:27:57,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2020-07-11 02:27:57,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 119 transitions. [2020-07-11 02:27:57,945 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 119 transitions. Word has length 83 [2020-07-11 02:27:57,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 02:27:57,945 INFO L479 AbstractCegarLoop]: Abstraction has 114 states and 119 transitions. [2020-07-11 02:27:57,945 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-07-11 02:27:57,945 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 114 states and 119 transitions. [2020-07-11 02:27:58,065 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 119 edges. 119 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:27:58,065 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 119 transitions. [2020-07-11 02:27:58,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2020-07-11 02:27:58,067 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 02:27:58,067 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-11 02:27:58,067 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-11 02:27:58,067 INFO L427 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 02:27:58,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 02:27:58,068 INFO L82 PathProgramCache]: Analyzing trace with hash 2059478739, now seen corresponding path program 6 times [2020-07-11 02:27:58,068 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 02:27:58,068 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1952851172] [2020-07-11 02:27:58,068 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 02:27:58,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:27:58,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:27:58,247 INFO L280 TraceCheckUtils]: 0: Hoare triple {5248#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {5236#true} is VALID [2020-07-11 02:27:58,247 INFO L280 TraceCheckUtils]: 1: Hoare triple {5236#true} #valid := #valid[0 := 0]; {5236#true} is VALID [2020-07-11 02:27:58,247 INFO L280 TraceCheckUtils]: 2: Hoare triple {5236#true} assume 0 < #StackHeapBarrier; {5236#true} is VALID [2020-07-11 02:27:58,247 INFO L280 TraceCheckUtils]: 3: Hoare triple {5236#true} assume true; {5236#true} is VALID [2020-07-11 02:27:58,248 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {5236#true} {5236#true} #186#return; {5236#true} is VALID [2020-07-11 02:27:58,249 INFO L263 TraceCheckUtils]: 0: Hoare triple {5236#true} call ULTIMATE.init(); {5248#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-11 02:27:58,249 INFO L280 TraceCheckUtils]: 1: Hoare triple {5248#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {5236#true} is VALID [2020-07-11 02:27:58,249 INFO L280 TraceCheckUtils]: 2: Hoare triple {5236#true} #valid := #valid[0 := 0]; {5236#true} is VALID [2020-07-11 02:27:58,249 INFO L280 TraceCheckUtils]: 3: Hoare triple {5236#true} assume 0 < #StackHeapBarrier; {5236#true} is VALID [2020-07-11 02:27:58,250 INFO L280 TraceCheckUtils]: 4: Hoare triple {5236#true} assume true; {5236#true} is VALID [2020-07-11 02:27:58,250 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {5236#true} {5236#true} #186#return; {5236#true} is VALID [2020-07-11 02:27:58,250 INFO L263 TraceCheckUtils]: 6: Hoare triple {5236#true} call #t~ret14 := main(); {5236#true} is VALID [2020-07-11 02:27:58,250 INFO L280 TraceCheckUtils]: 7: Hoare triple {5236#true} SUMMARY for call ~#string_A~0.base, ~#string_A~0.offset := #Ultimate.allocOnStack(5); srcloc: mainENTRY {5236#true} is VALID [2020-07-11 02:27:58,250 INFO L280 TraceCheckUtils]: 8: Hoare triple {5236#true} SUMMARY for call ~#string_B~0.base, ~#string_B~0.offset := #Ultimate.allocOnStack(5); srcloc: L20 {5236#true} is VALID [2020-07-11 02:27:58,251 INFO L280 TraceCheckUtils]: 9: Hoare triple {5236#true} havoc ~i~0; {5236#true} is VALID [2020-07-11 02:27:58,251 INFO L280 TraceCheckUtils]: 10: Hoare triple {5236#true} havoc ~j~0; {5236#true} is VALID [2020-07-11 02:27:58,251 INFO L280 TraceCheckUtils]: 11: Hoare triple {5236#true} havoc ~nc_A~0; {5236#true} is VALID [2020-07-11 02:27:58,251 INFO L280 TraceCheckUtils]: 12: Hoare triple {5236#true} havoc ~nc_B~0; {5236#true} is VALID [2020-07-11 02:27:58,251 INFO L280 TraceCheckUtils]: 13: Hoare triple {5236#true} ~found~0 := 0; {5236#true} is VALID [2020-07-11 02:27:58,252 INFO L280 TraceCheckUtils]: 14: Hoare triple {5236#true} ~i~0 := 0; {5236#true} is VALID [2020-07-11 02:27:58,252 INFO L280 TraceCheckUtils]: 15: Hoare triple {5236#true} assume !!(~i~0 < 5); {5236#true} is VALID [2020-07-11 02:27:58,252 INFO L280 TraceCheckUtils]: 16: Hoare triple {5236#true} assume -128 <= #t~nondet1 && #t~nondet1 <= 127; {5236#true} is VALID [2020-07-11 02:27:58,252 INFO L280 TraceCheckUtils]: 17: Hoare triple {5236#true} SUMMARY for call write~int(#t~nondet1, ~#string_A~0.base, ~#string_A~0.offset + ~i~0, 1); srcloc: L25-1 {5236#true} is VALID [2020-07-11 02:27:58,252 INFO L280 TraceCheckUtils]: 18: Hoare triple {5236#true} havoc #t~nondet1; {5236#true} is VALID [2020-07-11 02:27:58,253 INFO L280 TraceCheckUtils]: 19: Hoare triple {5236#true} #t~post0 := ~i~0; {5236#true} is VALID [2020-07-11 02:27:58,253 INFO L280 TraceCheckUtils]: 20: Hoare triple {5236#true} ~i~0 := 1 + #t~post0; {5236#true} is VALID [2020-07-11 02:27:58,253 INFO L280 TraceCheckUtils]: 21: Hoare triple {5236#true} havoc #t~post0; {5236#true} is VALID [2020-07-11 02:27:58,253 INFO L280 TraceCheckUtils]: 22: Hoare triple {5236#true} assume !!(~i~0 < 5); {5236#true} is VALID [2020-07-11 02:27:58,253 INFO L280 TraceCheckUtils]: 23: Hoare triple {5236#true} assume -128 <= #t~nondet1 && #t~nondet1 <= 127; {5236#true} is VALID [2020-07-11 02:27:58,254 INFO L280 TraceCheckUtils]: 24: Hoare triple {5236#true} SUMMARY for call write~int(#t~nondet1, ~#string_A~0.base, ~#string_A~0.offset + ~i~0, 1); srcloc: L25-1 {5236#true} is VALID [2020-07-11 02:27:58,254 INFO L280 TraceCheckUtils]: 25: Hoare triple {5236#true} havoc #t~nondet1; {5236#true} is VALID [2020-07-11 02:27:58,254 INFO L280 TraceCheckUtils]: 26: Hoare triple {5236#true} #t~post0 := ~i~0; {5236#true} is VALID [2020-07-11 02:27:58,254 INFO L280 TraceCheckUtils]: 27: Hoare triple {5236#true} ~i~0 := 1 + #t~post0; {5236#true} is VALID [2020-07-11 02:27:58,254 INFO L280 TraceCheckUtils]: 28: Hoare triple {5236#true} havoc #t~post0; {5236#true} is VALID [2020-07-11 02:27:58,255 INFO L280 TraceCheckUtils]: 29: Hoare triple {5236#true} assume !!(~i~0 < 5); {5236#true} is VALID [2020-07-11 02:27:58,255 INFO L280 TraceCheckUtils]: 30: Hoare triple {5236#true} assume -128 <= #t~nondet1 && #t~nondet1 <= 127; {5236#true} is VALID [2020-07-11 02:27:58,255 INFO L280 TraceCheckUtils]: 31: Hoare triple {5236#true} SUMMARY for call write~int(#t~nondet1, ~#string_A~0.base, ~#string_A~0.offset + ~i~0, 1); srcloc: L25-1 {5236#true} is VALID [2020-07-11 02:27:58,255 INFO L280 TraceCheckUtils]: 32: Hoare triple {5236#true} havoc #t~nondet1; {5236#true} is VALID [2020-07-11 02:27:58,255 INFO L280 TraceCheckUtils]: 33: Hoare triple {5236#true} #t~post0 := ~i~0; {5236#true} is VALID [2020-07-11 02:27:58,256 INFO L280 TraceCheckUtils]: 34: Hoare triple {5236#true} ~i~0 := 1 + #t~post0; {5236#true} is VALID [2020-07-11 02:27:58,256 INFO L280 TraceCheckUtils]: 35: Hoare triple {5236#true} havoc #t~post0; {5236#true} is VALID [2020-07-11 02:27:58,256 INFO L280 TraceCheckUtils]: 36: Hoare triple {5236#true} assume !!(~i~0 < 5); {5236#true} is VALID [2020-07-11 02:27:58,256 INFO L280 TraceCheckUtils]: 37: Hoare triple {5236#true} assume -128 <= #t~nondet1 && #t~nondet1 <= 127; {5236#true} is VALID [2020-07-11 02:27:58,256 INFO L280 TraceCheckUtils]: 38: Hoare triple {5236#true} SUMMARY for call write~int(#t~nondet1, ~#string_A~0.base, ~#string_A~0.offset + ~i~0, 1); srcloc: L25-1 {5236#true} is VALID [2020-07-11 02:27:58,257 INFO L280 TraceCheckUtils]: 39: Hoare triple {5236#true} havoc #t~nondet1; {5236#true} is VALID [2020-07-11 02:27:58,257 INFO L280 TraceCheckUtils]: 40: Hoare triple {5236#true} #t~post0 := ~i~0; {5236#true} is VALID [2020-07-11 02:27:58,257 INFO L280 TraceCheckUtils]: 41: Hoare triple {5236#true} ~i~0 := 1 + #t~post0; {5236#true} is VALID [2020-07-11 02:27:58,257 INFO L280 TraceCheckUtils]: 42: Hoare triple {5236#true} havoc #t~post0; {5236#true} is VALID [2020-07-11 02:27:58,258 INFO L280 TraceCheckUtils]: 43: Hoare triple {5236#true} assume !!(~i~0 < 5); {5236#true} is VALID [2020-07-11 02:27:58,258 INFO L280 TraceCheckUtils]: 44: Hoare triple {5236#true} assume -128 <= #t~nondet1 && #t~nondet1 <= 127; {5236#true} is VALID [2020-07-11 02:27:58,258 INFO L280 TraceCheckUtils]: 45: Hoare triple {5236#true} SUMMARY for call write~int(#t~nondet1, ~#string_A~0.base, ~#string_A~0.offset + ~i~0, 1); srcloc: L25-1 {5236#true} is VALID [2020-07-11 02:27:58,258 INFO L280 TraceCheckUtils]: 46: Hoare triple {5236#true} havoc #t~nondet1; {5236#true} is VALID [2020-07-11 02:27:58,258 INFO L280 TraceCheckUtils]: 47: Hoare triple {5236#true} #t~post0 := ~i~0; {5236#true} is VALID [2020-07-11 02:27:58,259 INFO L280 TraceCheckUtils]: 48: Hoare triple {5236#true} ~i~0 := 1 + #t~post0; {5236#true} is VALID [2020-07-11 02:27:58,259 INFO L280 TraceCheckUtils]: 49: Hoare triple {5236#true} havoc #t~post0; {5236#true} is VALID [2020-07-11 02:27:58,259 INFO L280 TraceCheckUtils]: 50: Hoare triple {5236#true} assume !(~i~0 < 5); {5236#true} is VALID [2020-07-11 02:27:58,259 INFO L280 TraceCheckUtils]: 51: Hoare triple {5236#true} SUMMARY for call #t~mem2 := read~int(~#string_A~0.base, 4 + ~#string_A~0.offset, 1); srcloc: L24-7 {5236#true} is VALID [2020-07-11 02:27:58,260 INFO L280 TraceCheckUtils]: 52: Hoare triple {5236#true} assume !!(0 == #t~mem2); {5236#true} is VALID [2020-07-11 02:27:58,260 INFO L280 TraceCheckUtils]: 53: Hoare triple {5236#true} havoc #t~mem2; {5236#true} is VALID [2020-07-11 02:27:58,261 INFO L280 TraceCheckUtils]: 54: Hoare triple {5236#true} ~i~0 := 0; {5243#(= 0 main_~i~0)} is VALID [2020-07-11 02:27:58,264 INFO L280 TraceCheckUtils]: 55: Hoare triple {5243#(= 0 main_~i~0)} assume !!(~i~0 < 5); {5243#(= 0 main_~i~0)} is VALID [2020-07-11 02:27:58,265 INFO L280 TraceCheckUtils]: 56: Hoare triple {5243#(= 0 main_~i~0)} assume -128 <= #t~nondet4 && #t~nondet4 <= 127; {5243#(= 0 main_~i~0)} is VALID [2020-07-11 02:27:58,266 INFO L280 TraceCheckUtils]: 57: Hoare triple {5243#(= 0 main_~i~0)} SUMMARY for call write~int(#t~nondet4, ~#string_B~0.base, ~#string_B~0.offset + ~i~0, 1); srcloc: L29-1 {5243#(= 0 main_~i~0)} is VALID [2020-07-11 02:27:58,266 INFO L280 TraceCheckUtils]: 58: Hoare triple {5243#(= 0 main_~i~0)} havoc #t~nondet4; {5243#(= 0 main_~i~0)} is VALID [2020-07-11 02:27:58,267 INFO L280 TraceCheckUtils]: 59: Hoare triple {5243#(= 0 main_~i~0)} #t~post3 := ~i~0; {5244#(= |main_#t~post3| 0)} is VALID [2020-07-11 02:27:58,267 INFO L280 TraceCheckUtils]: 60: Hoare triple {5244#(= |main_#t~post3| 0)} ~i~0 := 1 + #t~post3; {5245#(<= main_~i~0 1)} is VALID [2020-07-11 02:27:58,268 INFO L280 TraceCheckUtils]: 61: Hoare triple {5245#(<= main_~i~0 1)} havoc #t~post3; {5245#(<= main_~i~0 1)} is VALID [2020-07-11 02:27:58,268 INFO L280 TraceCheckUtils]: 62: Hoare triple {5245#(<= main_~i~0 1)} assume !!(~i~0 < 5); {5245#(<= main_~i~0 1)} is VALID [2020-07-11 02:27:58,269 INFO L280 TraceCheckUtils]: 63: Hoare triple {5245#(<= main_~i~0 1)} assume -128 <= #t~nondet4 && #t~nondet4 <= 127; {5245#(<= main_~i~0 1)} is VALID [2020-07-11 02:27:58,270 INFO L280 TraceCheckUtils]: 64: Hoare triple {5245#(<= main_~i~0 1)} SUMMARY for call write~int(#t~nondet4, ~#string_B~0.base, ~#string_B~0.offset + ~i~0, 1); srcloc: L29-1 {5245#(<= main_~i~0 1)} is VALID [2020-07-11 02:27:58,270 INFO L280 TraceCheckUtils]: 65: Hoare triple {5245#(<= main_~i~0 1)} havoc #t~nondet4; {5245#(<= main_~i~0 1)} is VALID [2020-07-11 02:27:58,271 INFO L280 TraceCheckUtils]: 66: Hoare triple {5245#(<= main_~i~0 1)} #t~post3 := ~i~0; {5246#(<= |main_#t~post3| 1)} is VALID [2020-07-11 02:27:58,272 INFO L280 TraceCheckUtils]: 67: Hoare triple {5246#(<= |main_#t~post3| 1)} ~i~0 := 1 + #t~post3; {5247#(<= main_~i~0 2)} is VALID [2020-07-11 02:27:58,272 INFO L280 TraceCheckUtils]: 68: Hoare triple {5247#(<= main_~i~0 2)} havoc #t~post3; {5247#(<= main_~i~0 2)} is VALID [2020-07-11 02:27:58,273 INFO L280 TraceCheckUtils]: 69: Hoare triple {5247#(<= main_~i~0 2)} assume !(~i~0 < 5); {5237#false} is VALID [2020-07-11 02:27:58,273 INFO L280 TraceCheckUtils]: 70: Hoare triple {5237#false} SUMMARY for call #t~mem5 := read~int(~#string_B~0.base, 4 + ~#string_B~0.offset, 1); srcloc: L28-7 {5237#false} is VALID [2020-07-11 02:27:58,273 INFO L280 TraceCheckUtils]: 71: Hoare triple {5237#false} assume !!(0 == #t~mem5); {5237#false} is VALID [2020-07-11 02:27:58,274 INFO L280 TraceCheckUtils]: 72: Hoare triple {5237#false} havoc #t~mem5; {5237#false} is VALID [2020-07-11 02:27:58,274 INFO L280 TraceCheckUtils]: 73: Hoare triple {5237#false} ~nc_A~0 := 0; {5237#false} is VALID [2020-07-11 02:27:58,274 INFO L280 TraceCheckUtils]: 74: Hoare triple {5237#false} SUMMARY for call #t~mem6 := read~int(~#string_A~0.base, ~#string_A~0.offset + ~nc_A~0, 1); srcloc: L33-5 {5237#false} is VALID [2020-07-11 02:27:58,274 INFO L280 TraceCheckUtils]: 75: Hoare triple {5237#false} assume !(0 != #t~mem6); {5237#false} is VALID [2020-07-11 02:27:58,274 INFO L280 TraceCheckUtils]: 76: Hoare triple {5237#false} havoc #t~mem6; {5237#false} is VALID [2020-07-11 02:27:58,275 INFO L280 TraceCheckUtils]: 77: Hoare triple {5237#false} ~nc_B~0 := 0; {5237#false} is VALID [2020-07-11 02:27:58,275 INFO L280 TraceCheckUtils]: 78: Hoare triple {5237#false} SUMMARY for call #t~mem8 := read~int(~#string_B~0.base, ~#string_B~0.offset + ~nc_B~0, 1); srcloc: L37-5 {5237#false} is VALID [2020-07-11 02:27:58,275 INFO L280 TraceCheckUtils]: 79: Hoare triple {5237#false} assume !(0 != #t~mem8); {5237#false} is VALID [2020-07-11 02:27:58,275 INFO L280 TraceCheckUtils]: 80: Hoare triple {5237#false} havoc #t~mem8; {5237#false} is VALID [2020-07-11 02:27:58,275 INFO L280 TraceCheckUtils]: 81: Hoare triple {5237#false} assume !!(~nc_B~0 >= ~nc_A~0); {5237#false} is VALID [2020-07-11 02:27:58,276 INFO L280 TraceCheckUtils]: 82: Hoare triple {5237#false} ~j~0 := 0; {5237#false} is VALID [2020-07-11 02:27:58,276 INFO L280 TraceCheckUtils]: 83: Hoare triple {5237#false} ~i~0 := ~j~0; {5237#false} is VALID [2020-07-11 02:27:58,276 INFO L280 TraceCheckUtils]: 84: Hoare triple {5237#false} assume !(~i~0 < ~nc_A~0 && ~j~0 < ~nc_B~0); {5237#false} is VALID [2020-07-11 02:27:58,276 INFO L280 TraceCheckUtils]: 85: Hoare triple {5237#false} ~found~0 := ~shiftLeft((if ~j~0 > ~nc_B~0 - 1 then 1 else 0), ~i~0); {5237#false} is VALID [2020-07-11 02:27:58,276 INFO L263 TraceCheckUtils]: 86: Hoare triple {5237#false} call __VERIFIER_assert((if 0 == ~found~0 || 1 == ~found~0 then 1 else 0)); {5237#false} is VALID [2020-07-11 02:27:58,277 INFO L280 TraceCheckUtils]: 87: Hoare triple {5237#false} ~cond := #in~cond; {5237#false} is VALID [2020-07-11 02:27:58,277 INFO L280 TraceCheckUtils]: 88: Hoare triple {5237#false} assume 0 == ~cond; {5237#false} is VALID [2020-07-11 02:27:58,277 INFO L280 TraceCheckUtils]: 89: Hoare triple {5237#false} assume !false; {5237#false} is VALID [2020-07-11 02:27:58,282 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2020-07-11 02:27:58,282 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1952851172] [2020-07-11 02:27:58,282 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-11 02:27:58,283 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-07-11 02:27:58,283 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171865408] [2020-07-11 02:27:58,283 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 90 [2020-07-11 02:27:58,284 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 02:27:58,284 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-11 02:27:58,343 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:27:58,343 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-11 02:27:58,343 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 02:27:58,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-11 02:27:58,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-07-11 02:27:58,344 INFO L87 Difference]: Start difference. First operand 114 states and 119 transitions. Second operand 8 states. [2020-07-11 02:27:58,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:27:58,995 INFO L93 Difference]: Finished difference Result 170 states and 179 transitions. [2020-07-11 02:27:58,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-11 02:27:58,995 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 90 [2020-07-11 02:27:58,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 02:27:58,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-11 02:27:58,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 156 transitions. [2020-07-11 02:27:58,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-11 02:27:59,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 156 transitions. [2020-07-11 02:27:59,001 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 156 transitions. [2020-07-11 02:27:59,162 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 156 edges. 156 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:27:59,165 INFO L225 Difference]: With dead ends: 170 [2020-07-11 02:27:59,166 INFO L226 Difference]: Without dead ends: 126 [2020-07-11 02:27:59,166 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2020-07-11 02:27:59,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2020-07-11 02:27:59,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 121. [2020-07-11 02:27:59,264 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 02:27:59,264 INFO L82 GeneralOperation]: Start isEquivalent. First operand 126 states. Second operand 121 states. [2020-07-11 02:27:59,264 INFO L74 IsIncluded]: Start isIncluded. First operand 126 states. Second operand 121 states. [2020-07-11 02:27:59,265 INFO L87 Difference]: Start difference. First operand 126 states. Second operand 121 states. [2020-07-11 02:27:59,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:27:59,269 INFO L93 Difference]: Finished difference Result 126 states and 131 transitions. [2020-07-11 02:27:59,269 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 131 transitions. [2020-07-11 02:27:59,269 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:27:59,270 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:27:59,270 INFO L74 IsIncluded]: Start isIncluded. First operand 121 states. Second operand 126 states. [2020-07-11 02:27:59,270 INFO L87 Difference]: Start difference. First operand 121 states. Second operand 126 states. [2020-07-11 02:27:59,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:27:59,273 INFO L93 Difference]: Finished difference Result 126 states and 131 transitions. [2020-07-11 02:27:59,273 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 131 transitions. [2020-07-11 02:27:59,273 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:27:59,273 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:27:59,274 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 02:27:59,274 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 02:27:59,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2020-07-11 02:27:59,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 126 transitions. [2020-07-11 02:27:59,277 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 126 transitions. Word has length 90 [2020-07-11 02:27:59,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 02:27:59,278 INFO L479 AbstractCegarLoop]: Abstraction has 121 states and 126 transitions. [2020-07-11 02:27:59,278 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-11 02:27:59,278 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 121 states and 126 transitions. [2020-07-11 02:27:59,418 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 126 edges. 126 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:27:59,418 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 126 transitions. [2020-07-11 02:27:59,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2020-07-11 02:27:59,420 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 02:27:59,420 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-11 02:27:59,420 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-07-11 02:27:59,420 INFO L427 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 02:27:59,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 02:27:59,421 INFO L82 PathProgramCache]: Analyzing trace with hash 2012961241, now seen corresponding path program 7 times [2020-07-11 02:27:59,421 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 02:27:59,421 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1865702612] [2020-07-11 02:27:59,422 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 02:27:59,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:27:59,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:27:59,568 INFO L280 TraceCheckUtils]: 0: Hoare triple {6107#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {6093#true} is VALID [2020-07-11 02:27:59,569 INFO L280 TraceCheckUtils]: 1: Hoare triple {6093#true} #valid := #valid[0 := 0]; {6093#true} is VALID [2020-07-11 02:27:59,569 INFO L280 TraceCheckUtils]: 2: Hoare triple {6093#true} assume 0 < #StackHeapBarrier; {6093#true} is VALID [2020-07-11 02:27:59,569 INFO L280 TraceCheckUtils]: 3: Hoare triple {6093#true} assume true; {6093#true} is VALID [2020-07-11 02:27:59,569 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {6093#true} {6093#true} #186#return; {6093#true} is VALID [2020-07-11 02:27:59,570 INFO L263 TraceCheckUtils]: 0: Hoare triple {6093#true} call ULTIMATE.init(); {6107#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-11 02:27:59,570 INFO L280 TraceCheckUtils]: 1: Hoare triple {6107#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {6093#true} is VALID [2020-07-11 02:27:59,571 INFO L280 TraceCheckUtils]: 2: Hoare triple {6093#true} #valid := #valid[0 := 0]; {6093#true} is VALID [2020-07-11 02:27:59,571 INFO L280 TraceCheckUtils]: 3: Hoare triple {6093#true} assume 0 < #StackHeapBarrier; {6093#true} is VALID [2020-07-11 02:27:59,571 INFO L280 TraceCheckUtils]: 4: Hoare triple {6093#true} assume true; {6093#true} is VALID [2020-07-11 02:27:59,571 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {6093#true} {6093#true} #186#return; {6093#true} is VALID [2020-07-11 02:27:59,571 INFO L263 TraceCheckUtils]: 6: Hoare triple {6093#true} call #t~ret14 := main(); {6093#true} is VALID [2020-07-11 02:27:59,572 INFO L280 TraceCheckUtils]: 7: Hoare triple {6093#true} SUMMARY for call ~#string_A~0.base, ~#string_A~0.offset := #Ultimate.allocOnStack(5); srcloc: mainENTRY {6093#true} is VALID [2020-07-11 02:27:59,572 INFO L280 TraceCheckUtils]: 8: Hoare triple {6093#true} SUMMARY for call ~#string_B~0.base, ~#string_B~0.offset := #Ultimate.allocOnStack(5); srcloc: L20 {6093#true} is VALID [2020-07-11 02:27:59,572 INFO L280 TraceCheckUtils]: 9: Hoare triple {6093#true} havoc ~i~0; {6093#true} is VALID [2020-07-11 02:27:59,572 INFO L280 TraceCheckUtils]: 10: Hoare triple {6093#true} havoc ~j~0; {6093#true} is VALID [2020-07-11 02:27:59,572 INFO L280 TraceCheckUtils]: 11: Hoare triple {6093#true} havoc ~nc_A~0; {6093#true} is VALID [2020-07-11 02:27:59,573 INFO L280 TraceCheckUtils]: 12: Hoare triple {6093#true} havoc ~nc_B~0; {6093#true} is VALID [2020-07-11 02:27:59,573 INFO L280 TraceCheckUtils]: 13: Hoare triple {6093#true} ~found~0 := 0; {6093#true} is VALID [2020-07-11 02:27:59,573 INFO L280 TraceCheckUtils]: 14: Hoare triple {6093#true} ~i~0 := 0; {6093#true} is VALID [2020-07-11 02:27:59,573 INFO L280 TraceCheckUtils]: 15: Hoare triple {6093#true} assume !!(~i~0 < 5); {6093#true} is VALID [2020-07-11 02:27:59,573 INFO L280 TraceCheckUtils]: 16: Hoare triple {6093#true} assume -128 <= #t~nondet1 && #t~nondet1 <= 127; {6093#true} is VALID [2020-07-11 02:27:59,574 INFO L280 TraceCheckUtils]: 17: Hoare triple {6093#true} SUMMARY for call write~int(#t~nondet1, ~#string_A~0.base, ~#string_A~0.offset + ~i~0, 1); srcloc: L25-1 {6093#true} is VALID [2020-07-11 02:27:59,574 INFO L280 TraceCheckUtils]: 18: Hoare triple {6093#true} havoc #t~nondet1; {6093#true} is VALID [2020-07-11 02:27:59,574 INFO L280 TraceCheckUtils]: 19: Hoare triple {6093#true} #t~post0 := ~i~0; {6093#true} is VALID [2020-07-11 02:27:59,574 INFO L280 TraceCheckUtils]: 20: Hoare triple {6093#true} ~i~0 := 1 + #t~post0; {6093#true} is VALID [2020-07-11 02:27:59,574 INFO L280 TraceCheckUtils]: 21: Hoare triple {6093#true} havoc #t~post0; {6093#true} is VALID [2020-07-11 02:27:59,575 INFO L280 TraceCheckUtils]: 22: Hoare triple {6093#true} assume !!(~i~0 < 5); {6093#true} is VALID [2020-07-11 02:27:59,575 INFO L280 TraceCheckUtils]: 23: Hoare triple {6093#true} assume -128 <= #t~nondet1 && #t~nondet1 <= 127; {6093#true} is VALID [2020-07-11 02:27:59,575 INFO L280 TraceCheckUtils]: 24: Hoare triple {6093#true} SUMMARY for call write~int(#t~nondet1, ~#string_A~0.base, ~#string_A~0.offset + ~i~0, 1); srcloc: L25-1 {6093#true} is VALID [2020-07-11 02:27:59,575 INFO L280 TraceCheckUtils]: 25: Hoare triple {6093#true} havoc #t~nondet1; {6093#true} is VALID [2020-07-11 02:27:59,575 INFO L280 TraceCheckUtils]: 26: Hoare triple {6093#true} #t~post0 := ~i~0; {6093#true} is VALID [2020-07-11 02:27:59,575 INFO L280 TraceCheckUtils]: 27: Hoare triple {6093#true} ~i~0 := 1 + #t~post0; {6093#true} is VALID [2020-07-11 02:27:59,576 INFO L280 TraceCheckUtils]: 28: Hoare triple {6093#true} havoc #t~post0; {6093#true} is VALID [2020-07-11 02:27:59,576 INFO L280 TraceCheckUtils]: 29: Hoare triple {6093#true} assume !!(~i~0 < 5); {6093#true} is VALID [2020-07-11 02:27:59,576 INFO L280 TraceCheckUtils]: 30: Hoare triple {6093#true} assume -128 <= #t~nondet1 && #t~nondet1 <= 127; {6093#true} is VALID [2020-07-11 02:27:59,576 INFO L280 TraceCheckUtils]: 31: Hoare triple {6093#true} SUMMARY for call write~int(#t~nondet1, ~#string_A~0.base, ~#string_A~0.offset + ~i~0, 1); srcloc: L25-1 {6093#true} is VALID [2020-07-11 02:27:59,576 INFO L280 TraceCheckUtils]: 32: Hoare triple {6093#true} havoc #t~nondet1; {6093#true} is VALID [2020-07-11 02:27:59,577 INFO L280 TraceCheckUtils]: 33: Hoare triple {6093#true} #t~post0 := ~i~0; {6093#true} is VALID [2020-07-11 02:27:59,577 INFO L280 TraceCheckUtils]: 34: Hoare triple {6093#true} ~i~0 := 1 + #t~post0; {6093#true} is VALID [2020-07-11 02:27:59,577 INFO L280 TraceCheckUtils]: 35: Hoare triple {6093#true} havoc #t~post0; {6093#true} is VALID [2020-07-11 02:27:59,577 INFO L280 TraceCheckUtils]: 36: Hoare triple {6093#true} assume !!(~i~0 < 5); {6093#true} is VALID [2020-07-11 02:27:59,577 INFO L280 TraceCheckUtils]: 37: Hoare triple {6093#true} assume -128 <= #t~nondet1 && #t~nondet1 <= 127; {6093#true} is VALID [2020-07-11 02:27:59,578 INFO L280 TraceCheckUtils]: 38: Hoare triple {6093#true} SUMMARY for call write~int(#t~nondet1, ~#string_A~0.base, ~#string_A~0.offset + ~i~0, 1); srcloc: L25-1 {6093#true} is VALID [2020-07-11 02:27:59,578 INFO L280 TraceCheckUtils]: 39: Hoare triple {6093#true} havoc #t~nondet1; {6093#true} is VALID [2020-07-11 02:27:59,578 INFO L280 TraceCheckUtils]: 40: Hoare triple {6093#true} #t~post0 := ~i~0; {6093#true} is VALID [2020-07-11 02:27:59,578 INFO L280 TraceCheckUtils]: 41: Hoare triple {6093#true} ~i~0 := 1 + #t~post0; {6093#true} is VALID [2020-07-11 02:27:59,578 INFO L280 TraceCheckUtils]: 42: Hoare triple {6093#true} havoc #t~post0; {6093#true} is VALID [2020-07-11 02:27:59,579 INFO L280 TraceCheckUtils]: 43: Hoare triple {6093#true} assume !!(~i~0 < 5); {6093#true} is VALID [2020-07-11 02:27:59,579 INFO L280 TraceCheckUtils]: 44: Hoare triple {6093#true} assume -128 <= #t~nondet1 && #t~nondet1 <= 127; {6093#true} is VALID [2020-07-11 02:27:59,579 INFO L280 TraceCheckUtils]: 45: Hoare triple {6093#true} SUMMARY for call write~int(#t~nondet1, ~#string_A~0.base, ~#string_A~0.offset + ~i~0, 1); srcloc: L25-1 {6093#true} is VALID [2020-07-11 02:27:59,579 INFO L280 TraceCheckUtils]: 46: Hoare triple {6093#true} havoc #t~nondet1; {6093#true} is VALID [2020-07-11 02:27:59,579 INFO L280 TraceCheckUtils]: 47: Hoare triple {6093#true} #t~post0 := ~i~0; {6093#true} is VALID [2020-07-11 02:27:59,580 INFO L280 TraceCheckUtils]: 48: Hoare triple {6093#true} ~i~0 := 1 + #t~post0; {6093#true} is VALID [2020-07-11 02:27:59,580 INFO L280 TraceCheckUtils]: 49: Hoare triple {6093#true} havoc #t~post0; {6093#true} is VALID [2020-07-11 02:27:59,580 INFO L280 TraceCheckUtils]: 50: Hoare triple {6093#true} assume !(~i~0 < 5); {6093#true} is VALID [2020-07-11 02:27:59,580 INFO L280 TraceCheckUtils]: 51: Hoare triple {6093#true} SUMMARY for call #t~mem2 := read~int(~#string_A~0.base, 4 + ~#string_A~0.offset, 1); srcloc: L24-7 {6093#true} is VALID [2020-07-11 02:27:59,580 INFO L280 TraceCheckUtils]: 52: Hoare triple {6093#true} assume !!(0 == #t~mem2); {6093#true} is VALID [2020-07-11 02:27:59,581 INFO L280 TraceCheckUtils]: 53: Hoare triple {6093#true} havoc #t~mem2; {6093#true} is VALID [2020-07-11 02:27:59,581 INFO L280 TraceCheckUtils]: 54: Hoare triple {6093#true} ~i~0 := 0; {6100#(= 0 main_~i~0)} is VALID [2020-07-11 02:27:59,582 INFO L280 TraceCheckUtils]: 55: Hoare triple {6100#(= 0 main_~i~0)} assume !!(~i~0 < 5); {6100#(= 0 main_~i~0)} is VALID [2020-07-11 02:27:59,582 INFO L280 TraceCheckUtils]: 56: Hoare triple {6100#(= 0 main_~i~0)} assume -128 <= #t~nondet4 && #t~nondet4 <= 127; {6100#(= 0 main_~i~0)} is VALID [2020-07-11 02:27:59,583 INFO L280 TraceCheckUtils]: 57: Hoare triple {6100#(= 0 main_~i~0)} SUMMARY for call write~int(#t~nondet4, ~#string_B~0.base, ~#string_B~0.offset + ~i~0, 1); srcloc: L29-1 {6100#(= 0 main_~i~0)} is VALID [2020-07-11 02:27:59,583 INFO L280 TraceCheckUtils]: 58: Hoare triple {6100#(= 0 main_~i~0)} havoc #t~nondet4; {6100#(= 0 main_~i~0)} is VALID [2020-07-11 02:27:59,584 INFO L280 TraceCheckUtils]: 59: Hoare triple {6100#(= 0 main_~i~0)} #t~post3 := ~i~0; {6101#(= |main_#t~post3| 0)} is VALID [2020-07-11 02:27:59,585 INFO L280 TraceCheckUtils]: 60: Hoare triple {6101#(= |main_#t~post3| 0)} ~i~0 := 1 + #t~post3; {6102#(<= main_~i~0 1)} is VALID [2020-07-11 02:27:59,585 INFO L280 TraceCheckUtils]: 61: Hoare triple {6102#(<= main_~i~0 1)} havoc #t~post3; {6102#(<= main_~i~0 1)} is VALID [2020-07-11 02:27:59,586 INFO L280 TraceCheckUtils]: 62: Hoare triple {6102#(<= main_~i~0 1)} assume !!(~i~0 < 5); {6102#(<= main_~i~0 1)} is VALID [2020-07-11 02:27:59,586 INFO L280 TraceCheckUtils]: 63: Hoare triple {6102#(<= main_~i~0 1)} assume -128 <= #t~nondet4 && #t~nondet4 <= 127; {6102#(<= main_~i~0 1)} is VALID [2020-07-11 02:27:59,587 INFO L280 TraceCheckUtils]: 64: Hoare triple {6102#(<= main_~i~0 1)} SUMMARY for call write~int(#t~nondet4, ~#string_B~0.base, ~#string_B~0.offset + ~i~0, 1); srcloc: L29-1 {6102#(<= main_~i~0 1)} is VALID [2020-07-11 02:27:59,587 INFO L280 TraceCheckUtils]: 65: Hoare triple {6102#(<= main_~i~0 1)} havoc #t~nondet4; {6102#(<= main_~i~0 1)} is VALID [2020-07-11 02:27:59,588 INFO L280 TraceCheckUtils]: 66: Hoare triple {6102#(<= main_~i~0 1)} #t~post3 := ~i~0; {6103#(<= |main_#t~post3| 1)} is VALID [2020-07-11 02:27:59,589 INFO L280 TraceCheckUtils]: 67: Hoare triple {6103#(<= |main_#t~post3| 1)} ~i~0 := 1 + #t~post3; {6104#(<= main_~i~0 2)} is VALID [2020-07-11 02:27:59,589 INFO L280 TraceCheckUtils]: 68: Hoare triple {6104#(<= main_~i~0 2)} havoc #t~post3; {6104#(<= main_~i~0 2)} is VALID [2020-07-11 02:27:59,590 INFO L280 TraceCheckUtils]: 69: Hoare triple {6104#(<= main_~i~0 2)} assume !!(~i~0 < 5); {6104#(<= main_~i~0 2)} is VALID [2020-07-11 02:27:59,590 INFO L280 TraceCheckUtils]: 70: Hoare triple {6104#(<= main_~i~0 2)} assume -128 <= #t~nondet4 && #t~nondet4 <= 127; {6104#(<= main_~i~0 2)} is VALID [2020-07-11 02:27:59,591 INFO L280 TraceCheckUtils]: 71: Hoare triple {6104#(<= main_~i~0 2)} SUMMARY for call write~int(#t~nondet4, ~#string_B~0.base, ~#string_B~0.offset + ~i~0, 1); srcloc: L29-1 {6104#(<= main_~i~0 2)} is VALID [2020-07-11 02:27:59,591 INFO L280 TraceCheckUtils]: 72: Hoare triple {6104#(<= main_~i~0 2)} havoc #t~nondet4; {6104#(<= main_~i~0 2)} is VALID [2020-07-11 02:27:59,592 INFO L280 TraceCheckUtils]: 73: Hoare triple {6104#(<= main_~i~0 2)} #t~post3 := ~i~0; {6105#(<= |main_#t~post3| 2)} is VALID [2020-07-11 02:27:59,593 INFO L280 TraceCheckUtils]: 74: Hoare triple {6105#(<= |main_#t~post3| 2)} ~i~0 := 1 + #t~post3; {6106#(<= main_~i~0 3)} is VALID [2020-07-11 02:27:59,593 INFO L280 TraceCheckUtils]: 75: Hoare triple {6106#(<= main_~i~0 3)} havoc #t~post3; {6106#(<= main_~i~0 3)} is VALID [2020-07-11 02:27:59,594 INFO L280 TraceCheckUtils]: 76: Hoare triple {6106#(<= main_~i~0 3)} assume !(~i~0 < 5); {6094#false} is VALID [2020-07-11 02:27:59,594 INFO L280 TraceCheckUtils]: 77: Hoare triple {6094#false} SUMMARY for call #t~mem5 := read~int(~#string_B~0.base, 4 + ~#string_B~0.offset, 1); srcloc: L28-7 {6094#false} is VALID [2020-07-11 02:27:59,594 INFO L280 TraceCheckUtils]: 78: Hoare triple {6094#false} assume !!(0 == #t~mem5); {6094#false} is VALID [2020-07-11 02:27:59,594 INFO L280 TraceCheckUtils]: 79: Hoare triple {6094#false} havoc #t~mem5; {6094#false} is VALID [2020-07-11 02:27:59,595 INFO L280 TraceCheckUtils]: 80: Hoare triple {6094#false} ~nc_A~0 := 0; {6094#false} is VALID [2020-07-11 02:27:59,595 INFO L280 TraceCheckUtils]: 81: Hoare triple {6094#false} SUMMARY for call #t~mem6 := read~int(~#string_A~0.base, ~#string_A~0.offset + ~nc_A~0, 1); srcloc: L33-5 {6094#false} is VALID [2020-07-11 02:27:59,595 INFO L280 TraceCheckUtils]: 82: Hoare triple {6094#false} assume !(0 != #t~mem6); {6094#false} is VALID [2020-07-11 02:27:59,595 INFO L280 TraceCheckUtils]: 83: Hoare triple {6094#false} havoc #t~mem6; {6094#false} is VALID [2020-07-11 02:27:59,595 INFO L280 TraceCheckUtils]: 84: Hoare triple {6094#false} ~nc_B~0 := 0; {6094#false} is VALID [2020-07-11 02:27:59,596 INFO L280 TraceCheckUtils]: 85: Hoare triple {6094#false} SUMMARY for call #t~mem8 := read~int(~#string_B~0.base, ~#string_B~0.offset + ~nc_B~0, 1); srcloc: L37-5 {6094#false} is VALID [2020-07-11 02:27:59,596 INFO L280 TraceCheckUtils]: 86: Hoare triple {6094#false} assume !(0 != #t~mem8); {6094#false} is VALID [2020-07-11 02:27:59,596 INFO L280 TraceCheckUtils]: 87: Hoare triple {6094#false} havoc #t~mem8; {6094#false} is VALID [2020-07-11 02:27:59,596 INFO L280 TraceCheckUtils]: 88: Hoare triple {6094#false} assume !!(~nc_B~0 >= ~nc_A~0); {6094#false} is VALID [2020-07-11 02:27:59,596 INFO L280 TraceCheckUtils]: 89: Hoare triple {6094#false} ~j~0 := 0; {6094#false} is VALID [2020-07-11 02:27:59,597 INFO L280 TraceCheckUtils]: 90: Hoare triple {6094#false} ~i~0 := ~j~0; {6094#false} is VALID [2020-07-11 02:27:59,597 INFO L280 TraceCheckUtils]: 91: Hoare triple {6094#false} assume !(~i~0 < ~nc_A~0 && ~j~0 < ~nc_B~0); {6094#false} is VALID [2020-07-11 02:27:59,597 INFO L280 TraceCheckUtils]: 92: Hoare triple {6094#false} ~found~0 := ~shiftLeft((if ~j~0 > ~nc_B~0 - 1 then 1 else 0), ~i~0); {6094#false} is VALID [2020-07-11 02:27:59,602 INFO L263 TraceCheckUtils]: 93: Hoare triple {6094#false} call __VERIFIER_assert((if 0 == ~found~0 || 1 == ~found~0 then 1 else 0)); {6094#false} is VALID [2020-07-11 02:27:59,603 INFO L280 TraceCheckUtils]: 94: Hoare triple {6094#false} ~cond := #in~cond; {6094#false} is VALID [2020-07-11 02:27:59,603 INFO L280 TraceCheckUtils]: 95: Hoare triple {6094#false} assume 0 == ~cond; {6094#false} is VALID [2020-07-11 02:27:59,603 INFO L280 TraceCheckUtils]: 96: Hoare triple {6094#false} assume !false; {6094#false} is VALID [2020-07-11 02:27:59,615 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2020-07-11 02:27:59,615 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1865702612] [2020-07-11 02:27:59,615 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-11 02:27:59,615 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-07-11 02:27:59,616 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884176988] [2020-07-11 02:27:59,619 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 97 [2020-07-11 02:27:59,620 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 02:27:59,620 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2020-07-11 02:27:59,688 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:27:59,688 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-11 02:27:59,689 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 02:27:59,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-11 02:27:59,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2020-07-11 02:27:59,689 INFO L87 Difference]: Start difference. First operand 121 states and 126 transitions. Second operand 10 states. [2020-07-11 02:28:00,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:28:00,624 INFO L93 Difference]: Finished difference Result 177 states and 186 transitions. [2020-07-11 02:28:00,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-07-11 02:28:00,624 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 97 [2020-07-11 02:28:00,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 02:28:00,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-11 02:28:00,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 163 transitions. [2020-07-11 02:28:00,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-11 02:28:00,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 163 transitions. [2020-07-11 02:28:00,630 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 163 transitions. [2020-07-11 02:28:00,787 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 163 edges. 163 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:28:00,790 INFO L225 Difference]: With dead ends: 177 [2020-07-11 02:28:00,790 INFO L226 Difference]: Without dead ends: 133 [2020-07-11 02:28:00,791 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=160, Unknown=0, NotChecked=0, Total=240 [2020-07-11 02:28:00,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2020-07-11 02:28:00,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 128. [2020-07-11 02:28:00,882 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 02:28:00,882 INFO L82 GeneralOperation]: Start isEquivalent. First operand 133 states. Second operand 128 states. [2020-07-11 02:28:00,882 INFO L74 IsIncluded]: Start isIncluded. First operand 133 states. Second operand 128 states. [2020-07-11 02:28:00,882 INFO L87 Difference]: Start difference. First operand 133 states. Second operand 128 states. [2020-07-11 02:28:00,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:28:00,886 INFO L93 Difference]: Finished difference Result 133 states and 138 transitions. [2020-07-11 02:28:00,886 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 138 transitions. [2020-07-11 02:28:00,886 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:28:00,887 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:28:00,887 INFO L74 IsIncluded]: Start isIncluded. First operand 128 states. Second operand 133 states. [2020-07-11 02:28:00,887 INFO L87 Difference]: Start difference. First operand 128 states. Second operand 133 states. [2020-07-11 02:28:00,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:28:00,890 INFO L93 Difference]: Finished difference Result 133 states and 138 transitions. [2020-07-11 02:28:00,890 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 138 transitions. [2020-07-11 02:28:00,890 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:28:00,890 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:28:00,890 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 02:28:00,890 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 02:28:00,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2020-07-11 02:28:00,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 133 transitions. [2020-07-11 02:28:00,892 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 133 transitions. Word has length 97 [2020-07-11 02:28:00,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 02:28:00,893 INFO L479 AbstractCegarLoop]: Abstraction has 128 states and 133 transitions. [2020-07-11 02:28:00,893 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-11 02:28:00,893 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 128 states and 133 transitions. [2020-07-11 02:28:01,034 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 133 edges. 133 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:28:01,034 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 133 transitions. [2020-07-11 02:28:01,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2020-07-11 02:28:01,036 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 02:28:01,036 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-11 02:28:01,036 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-07-11 02:28:01,037 INFO L427 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 02:28:01,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 02:28:01,037 INFO L82 PathProgramCache]: Analyzing trace with hash 1354290195, now seen corresponding path program 8 times [2020-07-11 02:28:01,037 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 02:28:01,037 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [369681281] [2020-07-11 02:28:01,038 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 02:28:01,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:28:01,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:28:01,216 INFO L280 TraceCheckUtils]: 0: Hoare triple {7014#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {6998#true} is VALID [2020-07-11 02:28:01,216 INFO L280 TraceCheckUtils]: 1: Hoare triple {6998#true} #valid := #valid[0 := 0]; {6998#true} is VALID [2020-07-11 02:28:01,216 INFO L280 TraceCheckUtils]: 2: Hoare triple {6998#true} assume 0 < #StackHeapBarrier; {6998#true} is VALID [2020-07-11 02:28:01,217 INFO L280 TraceCheckUtils]: 3: Hoare triple {6998#true} assume true; {6998#true} is VALID [2020-07-11 02:28:01,217 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {6998#true} {6998#true} #186#return; {6998#true} is VALID [2020-07-11 02:28:01,218 INFO L263 TraceCheckUtils]: 0: Hoare triple {6998#true} call ULTIMATE.init(); {7014#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-11 02:28:01,218 INFO L280 TraceCheckUtils]: 1: Hoare triple {7014#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {6998#true} is VALID [2020-07-11 02:28:01,218 INFO L280 TraceCheckUtils]: 2: Hoare triple {6998#true} #valid := #valid[0 := 0]; {6998#true} is VALID [2020-07-11 02:28:01,218 INFO L280 TraceCheckUtils]: 3: Hoare triple {6998#true} assume 0 < #StackHeapBarrier; {6998#true} is VALID [2020-07-11 02:28:01,219 INFO L280 TraceCheckUtils]: 4: Hoare triple {6998#true} assume true; {6998#true} is VALID [2020-07-11 02:28:01,219 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {6998#true} {6998#true} #186#return; {6998#true} is VALID [2020-07-11 02:28:01,219 INFO L263 TraceCheckUtils]: 6: Hoare triple {6998#true} call #t~ret14 := main(); {6998#true} is VALID [2020-07-11 02:28:01,219 INFO L280 TraceCheckUtils]: 7: Hoare triple {6998#true} SUMMARY for call ~#string_A~0.base, ~#string_A~0.offset := #Ultimate.allocOnStack(5); srcloc: mainENTRY {6998#true} is VALID [2020-07-11 02:28:01,219 INFO L280 TraceCheckUtils]: 8: Hoare triple {6998#true} SUMMARY for call ~#string_B~0.base, ~#string_B~0.offset := #Ultimate.allocOnStack(5); srcloc: L20 {6998#true} is VALID [2020-07-11 02:28:01,220 INFO L280 TraceCheckUtils]: 9: Hoare triple {6998#true} havoc ~i~0; {6998#true} is VALID [2020-07-11 02:28:01,220 INFO L280 TraceCheckUtils]: 10: Hoare triple {6998#true} havoc ~j~0; {6998#true} is VALID [2020-07-11 02:28:01,220 INFO L280 TraceCheckUtils]: 11: Hoare triple {6998#true} havoc ~nc_A~0; {6998#true} is VALID [2020-07-11 02:28:01,220 INFO L280 TraceCheckUtils]: 12: Hoare triple {6998#true} havoc ~nc_B~0; {6998#true} is VALID [2020-07-11 02:28:01,220 INFO L280 TraceCheckUtils]: 13: Hoare triple {6998#true} ~found~0 := 0; {6998#true} is VALID [2020-07-11 02:28:01,220 INFO L280 TraceCheckUtils]: 14: Hoare triple {6998#true} ~i~0 := 0; {6998#true} is VALID [2020-07-11 02:28:01,221 INFO L280 TraceCheckUtils]: 15: Hoare triple {6998#true} assume !!(~i~0 < 5); {6998#true} is VALID [2020-07-11 02:28:01,221 INFO L280 TraceCheckUtils]: 16: Hoare triple {6998#true} assume -128 <= #t~nondet1 && #t~nondet1 <= 127; {6998#true} is VALID [2020-07-11 02:28:01,221 INFO L280 TraceCheckUtils]: 17: Hoare triple {6998#true} SUMMARY for call write~int(#t~nondet1, ~#string_A~0.base, ~#string_A~0.offset + ~i~0, 1); srcloc: L25-1 {6998#true} is VALID [2020-07-11 02:28:01,221 INFO L280 TraceCheckUtils]: 18: Hoare triple {6998#true} havoc #t~nondet1; {6998#true} is VALID [2020-07-11 02:28:01,221 INFO L280 TraceCheckUtils]: 19: Hoare triple {6998#true} #t~post0 := ~i~0; {6998#true} is VALID [2020-07-11 02:28:01,222 INFO L280 TraceCheckUtils]: 20: Hoare triple {6998#true} ~i~0 := 1 + #t~post0; {6998#true} is VALID [2020-07-11 02:28:01,222 INFO L280 TraceCheckUtils]: 21: Hoare triple {6998#true} havoc #t~post0; {6998#true} is VALID [2020-07-11 02:28:01,222 INFO L280 TraceCheckUtils]: 22: Hoare triple {6998#true} assume !!(~i~0 < 5); {6998#true} is VALID [2020-07-11 02:28:01,222 INFO L280 TraceCheckUtils]: 23: Hoare triple {6998#true} assume -128 <= #t~nondet1 && #t~nondet1 <= 127; {6998#true} is VALID [2020-07-11 02:28:01,222 INFO L280 TraceCheckUtils]: 24: Hoare triple {6998#true} SUMMARY for call write~int(#t~nondet1, ~#string_A~0.base, ~#string_A~0.offset + ~i~0, 1); srcloc: L25-1 {6998#true} is VALID [2020-07-11 02:28:01,222 INFO L280 TraceCheckUtils]: 25: Hoare triple {6998#true} havoc #t~nondet1; {6998#true} is VALID [2020-07-11 02:28:01,223 INFO L280 TraceCheckUtils]: 26: Hoare triple {6998#true} #t~post0 := ~i~0; {6998#true} is VALID [2020-07-11 02:28:01,223 INFO L280 TraceCheckUtils]: 27: Hoare triple {6998#true} ~i~0 := 1 + #t~post0; {6998#true} is VALID [2020-07-11 02:28:01,223 INFO L280 TraceCheckUtils]: 28: Hoare triple {6998#true} havoc #t~post0; {6998#true} is VALID [2020-07-11 02:28:01,223 INFO L280 TraceCheckUtils]: 29: Hoare triple {6998#true} assume !!(~i~0 < 5); {6998#true} is VALID [2020-07-11 02:28:01,223 INFO L280 TraceCheckUtils]: 30: Hoare triple {6998#true} assume -128 <= #t~nondet1 && #t~nondet1 <= 127; {6998#true} is VALID [2020-07-11 02:28:01,223 INFO L280 TraceCheckUtils]: 31: Hoare triple {6998#true} SUMMARY for call write~int(#t~nondet1, ~#string_A~0.base, ~#string_A~0.offset + ~i~0, 1); srcloc: L25-1 {6998#true} is VALID [2020-07-11 02:28:01,224 INFO L280 TraceCheckUtils]: 32: Hoare triple {6998#true} havoc #t~nondet1; {6998#true} is VALID [2020-07-11 02:28:01,224 INFO L280 TraceCheckUtils]: 33: Hoare triple {6998#true} #t~post0 := ~i~0; {6998#true} is VALID [2020-07-11 02:28:01,224 INFO L280 TraceCheckUtils]: 34: Hoare triple {6998#true} ~i~0 := 1 + #t~post0; {6998#true} is VALID [2020-07-11 02:28:01,224 INFO L280 TraceCheckUtils]: 35: Hoare triple {6998#true} havoc #t~post0; {6998#true} is VALID [2020-07-11 02:28:01,224 INFO L280 TraceCheckUtils]: 36: Hoare triple {6998#true} assume !!(~i~0 < 5); {6998#true} is VALID [2020-07-11 02:28:01,224 INFO L280 TraceCheckUtils]: 37: Hoare triple {6998#true} assume -128 <= #t~nondet1 && #t~nondet1 <= 127; {6998#true} is VALID [2020-07-11 02:28:01,225 INFO L280 TraceCheckUtils]: 38: Hoare triple {6998#true} SUMMARY for call write~int(#t~nondet1, ~#string_A~0.base, ~#string_A~0.offset + ~i~0, 1); srcloc: L25-1 {6998#true} is VALID [2020-07-11 02:28:01,225 INFO L280 TraceCheckUtils]: 39: Hoare triple {6998#true} havoc #t~nondet1; {6998#true} is VALID [2020-07-11 02:28:01,225 INFO L280 TraceCheckUtils]: 40: Hoare triple {6998#true} #t~post0 := ~i~0; {6998#true} is VALID [2020-07-11 02:28:01,225 INFO L280 TraceCheckUtils]: 41: Hoare triple {6998#true} ~i~0 := 1 + #t~post0; {6998#true} is VALID [2020-07-11 02:28:01,225 INFO L280 TraceCheckUtils]: 42: Hoare triple {6998#true} havoc #t~post0; {6998#true} is VALID [2020-07-11 02:28:01,226 INFO L280 TraceCheckUtils]: 43: Hoare triple {6998#true} assume !!(~i~0 < 5); {6998#true} is VALID [2020-07-11 02:28:01,226 INFO L280 TraceCheckUtils]: 44: Hoare triple {6998#true} assume -128 <= #t~nondet1 && #t~nondet1 <= 127; {6998#true} is VALID [2020-07-11 02:28:01,226 INFO L280 TraceCheckUtils]: 45: Hoare triple {6998#true} SUMMARY for call write~int(#t~nondet1, ~#string_A~0.base, ~#string_A~0.offset + ~i~0, 1); srcloc: L25-1 {6998#true} is VALID [2020-07-11 02:28:01,226 INFO L280 TraceCheckUtils]: 46: Hoare triple {6998#true} havoc #t~nondet1; {6998#true} is VALID [2020-07-11 02:28:01,226 INFO L280 TraceCheckUtils]: 47: Hoare triple {6998#true} #t~post0 := ~i~0; {6998#true} is VALID [2020-07-11 02:28:01,226 INFO L280 TraceCheckUtils]: 48: Hoare triple {6998#true} ~i~0 := 1 + #t~post0; {6998#true} is VALID [2020-07-11 02:28:01,228 INFO L280 TraceCheckUtils]: 49: Hoare triple {6998#true} havoc #t~post0; {6998#true} is VALID [2020-07-11 02:28:01,229 INFO L280 TraceCheckUtils]: 50: Hoare triple {6998#true} assume !(~i~0 < 5); {6998#true} is VALID [2020-07-11 02:28:01,229 INFO L280 TraceCheckUtils]: 51: Hoare triple {6998#true} SUMMARY for call #t~mem2 := read~int(~#string_A~0.base, 4 + ~#string_A~0.offset, 1); srcloc: L24-7 {6998#true} is VALID [2020-07-11 02:28:01,229 INFO L280 TraceCheckUtils]: 52: Hoare triple {6998#true} assume !!(0 == #t~mem2); {6998#true} is VALID [2020-07-11 02:28:01,229 INFO L280 TraceCheckUtils]: 53: Hoare triple {6998#true} havoc #t~mem2; {6998#true} is VALID [2020-07-11 02:28:01,231 INFO L280 TraceCheckUtils]: 54: Hoare triple {6998#true} ~i~0 := 0; {7005#(= 0 main_~i~0)} is VALID [2020-07-11 02:28:01,231 INFO L280 TraceCheckUtils]: 55: Hoare triple {7005#(= 0 main_~i~0)} assume !!(~i~0 < 5); {7005#(= 0 main_~i~0)} is VALID [2020-07-11 02:28:01,232 INFO L280 TraceCheckUtils]: 56: Hoare triple {7005#(= 0 main_~i~0)} assume -128 <= #t~nondet4 && #t~nondet4 <= 127; {7005#(= 0 main_~i~0)} is VALID [2020-07-11 02:28:01,232 INFO L280 TraceCheckUtils]: 57: Hoare triple {7005#(= 0 main_~i~0)} SUMMARY for call write~int(#t~nondet4, ~#string_B~0.base, ~#string_B~0.offset + ~i~0, 1); srcloc: L29-1 {7005#(= 0 main_~i~0)} is VALID [2020-07-11 02:28:01,233 INFO L280 TraceCheckUtils]: 58: Hoare triple {7005#(= 0 main_~i~0)} havoc #t~nondet4; {7005#(= 0 main_~i~0)} is VALID [2020-07-11 02:28:01,233 INFO L280 TraceCheckUtils]: 59: Hoare triple {7005#(= 0 main_~i~0)} #t~post3 := ~i~0; {7006#(= |main_#t~post3| 0)} is VALID [2020-07-11 02:28:01,234 INFO L280 TraceCheckUtils]: 60: Hoare triple {7006#(= |main_#t~post3| 0)} ~i~0 := 1 + #t~post3; {7007#(<= main_~i~0 1)} is VALID [2020-07-11 02:28:01,234 INFO L280 TraceCheckUtils]: 61: Hoare triple {7007#(<= main_~i~0 1)} havoc #t~post3; {7007#(<= main_~i~0 1)} is VALID [2020-07-11 02:28:01,235 INFO L280 TraceCheckUtils]: 62: Hoare triple {7007#(<= main_~i~0 1)} assume !!(~i~0 < 5); {7007#(<= main_~i~0 1)} is VALID [2020-07-11 02:28:01,236 INFO L280 TraceCheckUtils]: 63: Hoare triple {7007#(<= main_~i~0 1)} assume -128 <= #t~nondet4 && #t~nondet4 <= 127; {7007#(<= main_~i~0 1)} is VALID [2020-07-11 02:28:01,237 INFO L280 TraceCheckUtils]: 64: Hoare triple {7007#(<= main_~i~0 1)} SUMMARY for call write~int(#t~nondet4, ~#string_B~0.base, ~#string_B~0.offset + ~i~0, 1); srcloc: L29-1 {7007#(<= main_~i~0 1)} is VALID [2020-07-11 02:28:01,237 INFO L280 TraceCheckUtils]: 65: Hoare triple {7007#(<= main_~i~0 1)} havoc #t~nondet4; {7007#(<= main_~i~0 1)} is VALID [2020-07-11 02:28:01,238 INFO L280 TraceCheckUtils]: 66: Hoare triple {7007#(<= main_~i~0 1)} #t~post3 := ~i~0; {7008#(<= |main_#t~post3| 1)} is VALID [2020-07-11 02:28:01,238 INFO L280 TraceCheckUtils]: 67: Hoare triple {7008#(<= |main_#t~post3| 1)} ~i~0 := 1 + #t~post3; {7009#(<= main_~i~0 2)} is VALID [2020-07-11 02:28:01,239 INFO L280 TraceCheckUtils]: 68: Hoare triple {7009#(<= main_~i~0 2)} havoc #t~post3; {7009#(<= main_~i~0 2)} is VALID [2020-07-11 02:28:01,239 INFO L280 TraceCheckUtils]: 69: Hoare triple {7009#(<= main_~i~0 2)} assume !!(~i~0 < 5); {7009#(<= main_~i~0 2)} is VALID [2020-07-11 02:28:01,240 INFO L280 TraceCheckUtils]: 70: Hoare triple {7009#(<= main_~i~0 2)} assume -128 <= #t~nondet4 && #t~nondet4 <= 127; {7009#(<= main_~i~0 2)} is VALID [2020-07-11 02:28:01,240 INFO L280 TraceCheckUtils]: 71: Hoare triple {7009#(<= main_~i~0 2)} SUMMARY for call write~int(#t~nondet4, ~#string_B~0.base, ~#string_B~0.offset + ~i~0, 1); srcloc: L29-1 {7009#(<= main_~i~0 2)} is VALID [2020-07-11 02:28:01,241 INFO L280 TraceCheckUtils]: 72: Hoare triple {7009#(<= main_~i~0 2)} havoc #t~nondet4; {7009#(<= main_~i~0 2)} is VALID [2020-07-11 02:28:01,242 INFO L280 TraceCheckUtils]: 73: Hoare triple {7009#(<= main_~i~0 2)} #t~post3 := ~i~0; {7010#(<= |main_#t~post3| 2)} is VALID [2020-07-11 02:28:01,243 INFO L280 TraceCheckUtils]: 74: Hoare triple {7010#(<= |main_#t~post3| 2)} ~i~0 := 1 + #t~post3; {7011#(<= main_~i~0 3)} is VALID [2020-07-11 02:28:01,245 INFO L280 TraceCheckUtils]: 75: Hoare triple {7011#(<= main_~i~0 3)} havoc #t~post3; {7011#(<= main_~i~0 3)} is VALID [2020-07-11 02:28:01,245 INFO L280 TraceCheckUtils]: 76: Hoare triple {7011#(<= main_~i~0 3)} assume !!(~i~0 < 5); {7011#(<= main_~i~0 3)} is VALID [2020-07-11 02:28:01,246 INFO L280 TraceCheckUtils]: 77: Hoare triple {7011#(<= main_~i~0 3)} assume -128 <= #t~nondet4 && #t~nondet4 <= 127; {7011#(<= main_~i~0 3)} is VALID [2020-07-11 02:28:01,247 INFO L280 TraceCheckUtils]: 78: Hoare triple {7011#(<= main_~i~0 3)} SUMMARY for call write~int(#t~nondet4, ~#string_B~0.base, ~#string_B~0.offset + ~i~0, 1); srcloc: L29-1 {7011#(<= main_~i~0 3)} is VALID [2020-07-11 02:28:01,248 INFO L280 TraceCheckUtils]: 79: Hoare triple {7011#(<= main_~i~0 3)} havoc #t~nondet4; {7011#(<= main_~i~0 3)} is VALID [2020-07-11 02:28:01,248 INFO L280 TraceCheckUtils]: 80: Hoare triple {7011#(<= main_~i~0 3)} #t~post3 := ~i~0; {7012#(<= |main_#t~post3| 3)} is VALID [2020-07-11 02:28:01,250 INFO L280 TraceCheckUtils]: 81: Hoare triple {7012#(<= |main_#t~post3| 3)} ~i~0 := 1 + #t~post3; {7013#(<= main_~i~0 4)} is VALID [2020-07-11 02:28:01,250 INFO L280 TraceCheckUtils]: 82: Hoare triple {7013#(<= main_~i~0 4)} havoc #t~post3; {7013#(<= main_~i~0 4)} is VALID [2020-07-11 02:28:01,251 INFO L280 TraceCheckUtils]: 83: Hoare triple {7013#(<= main_~i~0 4)} assume !(~i~0 < 5); {6999#false} is VALID [2020-07-11 02:28:01,252 INFO L280 TraceCheckUtils]: 84: Hoare triple {6999#false} SUMMARY for call #t~mem5 := read~int(~#string_B~0.base, 4 + ~#string_B~0.offset, 1); srcloc: L28-7 {6999#false} is VALID [2020-07-11 02:28:01,252 INFO L280 TraceCheckUtils]: 85: Hoare triple {6999#false} assume !!(0 == #t~mem5); {6999#false} is VALID [2020-07-11 02:28:01,252 INFO L280 TraceCheckUtils]: 86: Hoare triple {6999#false} havoc #t~mem5; {6999#false} is VALID [2020-07-11 02:28:01,252 INFO L280 TraceCheckUtils]: 87: Hoare triple {6999#false} ~nc_A~0 := 0; {6999#false} is VALID [2020-07-11 02:28:01,253 INFO L280 TraceCheckUtils]: 88: Hoare triple {6999#false} SUMMARY for call #t~mem6 := read~int(~#string_A~0.base, ~#string_A~0.offset + ~nc_A~0, 1); srcloc: L33-5 {6999#false} is VALID [2020-07-11 02:28:01,253 INFO L280 TraceCheckUtils]: 89: Hoare triple {6999#false} assume !(0 != #t~mem6); {6999#false} is VALID [2020-07-11 02:28:01,253 INFO L280 TraceCheckUtils]: 90: Hoare triple {6999#false} havoc #t~mem6; {6999#false} is VALID [2020-07-11 02:28:01,254 INFO L280 TraceCheckUtils]: 91: Hoare triple {6999#false} ~nc_B~0 := 0; {6999#false} is VALID [2020-07-11 02:28:01,254 INFO L280 TraceCheckUtils]: 92: Hoare triple {6999#false} SUMMARY for call #t~mem8 := read~int(~#string_B~0.base, ~#string_B~0.offset + ~nc_B~0, 1); srcloc: L37-5 {6999#false} is VALID [2020-07-11 02:28:01,254 INFO L280 TraceCheckUtils]: 93: Hoare triple {6999#false} assume !(0 != #t~mem8); {6999#false} is VALID [2020-07-11 02:28:01,254 INFO L280 TraceCheckUtils]: 94: Hoare triple {6999#false} havoc #t~mem8; {6999#false} is VALID [2020-07-11 02:28:01,255 INFO L280 TraceCheckUtils]: 95: Hoare triple {6999#false} assume !!(~nc_B~0 >= ~nc_A~0); {6999#false} is VALID [2020-07-11 02:28:01,255 INFO L280 TraceCheckUtils]: 96: Hoare triple {6999#false} ~j~0 := 0; {6999#false} is VALID [2020-07-11 02:28:01,255 INFO L280 TraceCheckUtils]: 97: Hoare triple {6999#false} ~i~0 := ~j~0; {6999#false} is VALID [2020-07-11 02:28:01,256 INFO L280 TraceCheckUtils]: 98: Hoare triple {6999#false} assume !(~i~0 < ~nc_A~0 && ~j~0 < ~nc_B~0); {6999#false} is VALID [2020-07-11 02:28:01,256 INFO L280 TraceCheckUtils]: 99: Hoare triple {6999#false} ~found~0 := ~shiftLeft((if ~j~0 > ~nc_B~0 - 1 then 1 else 0), ~i~0); {6999#false} is VALID [2020-07-11 02:28:01,256 INFO L263 TraceCheckUtils]: 100: Hoare triple {6999#false} call __VERIFIER_assert((if 0 == ~found~0 || 1 == ~found~0 then 1 else 0)); {6999#false} is VALID [2020-07-11 02:28:01,257 INFO L280 TraceCheckUtils]: 101: Hoare triple {6999#false} ~cond := #in~cond; {6999#false} is VALID [2020-07-11 02:28:01,257 INFO L280 TraceCheckUtils]: 102: Hoare triple {6999#false} assume 0 == ~cond; {6999#false} is VALID [2020-07-11 02:28:01,257 INFO L280 TraceCheckUtils]: 103: Hoare triple {6999#false} assume !false; {6999#false} is VALID [2020-07-11 02:28:01,271 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2020-07-11 02:28:01,272 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [369681281] [2020-07-11 02:28:01,272 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-11 02:28:01,272 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2020-07-11 02:28:01,272 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962561050] [2020-07-11 02:28:01,273 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 104 [2020-07-11 02:28:01,274 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 02:28:01,274 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2020-07-11 02:28:01,360 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:28:01,360 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-07-11 02:28:01,361 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 02:28:01,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-07-11 02:28:01,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2020-07-11 02:28:01,361 INFO L87 Difference]: Start difference. First operand 128 states and 133 transitions. Second operand 12 states. [2020-07-11 02:28:02,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:28:02,239 INFO L93 Difference]: Finished difference Result 179 states and 188 transitions. [2020-07-11 02:28:02,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-07-11 02:28:02,240 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 104 [2020-07-11 02:28:02,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 02:28:02,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-11 02:28:02,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 165 transitions. [2020-07-11 02:28:02,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-11 02:28:02,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 165 transitions. [2020-07-11 02:28:02,245 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 165 transitions. [2020-07-11 02:28:02,400 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 165 edges. 165 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:28:02,402 INFO L225 Difference]: With dead ends: 179 [2020-07-11 02:28:02,403 INFO L226 Difference]: Without dead ends: 135 [2020-07-11 02:28:02,403 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=125, Invalid=255, Unknown=0, NotChecked=0, Total=380 [2020-07-11 02:28:02,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2020-07-11 02:28:02,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2020-07-11 02:28:02,520 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 02:28:02,520 INFO L82 GeneralOperation]: Start isEquivalent. First operand 135 states. Second operand 135 states. [2020-07-11 02:28:02,521 INFO L74 IsIncluded]: Start isIncluded. First operand 135 states. Second operand 135 states. [2020-07-11 02:28:02,521 INFO L87 Difference]: Start difference. First operand 135 states. Second operand 135 states. [2020-07-11 02:28:02,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:28:02,524 INFO L93 Difference]: Finished difference Result 135 states and 140 transitions. [2020-07-11 02:28:02,524 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 140 transitions. [2020-07-11 02:28:02,525 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:28:02,525 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:28:02,525 INFO L74 IsIncluded]: Start isIncluded. First operand 135 states. Second operand 135 states. [2020-07-11 02:28:02,525 INFO L87 Difference]: Start difference. First operand 135 states. Second operand 135 states. [2020-07-11 02:28:02,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:28:02,527 INFO L93 Difference]: Finished difference Result 135 states and 140 transitions. [2020-07-11 02:28:02,528 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 140 transitions. [2020-07-11 02:28:02,528 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:28:02,528 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:28:02,528 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 02:28:02,528 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 02:28:02,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2020-07-11 02:28:02,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 140 transitions. [2020-07-11 02:28:02,531 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 140 transitions. Word has length 104 [2020-07-11 02:28:02,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 02:28:02,531 INFO L479 AbstractCegarLoop]: Abstraction has 135 states and 140 transitions. [2020-07-11 02:28:02,532 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-07-11 02:28:02,532 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 135 states and 140 transitions. [2020-07-11 02:28:02,688 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 140 edges. 140 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:28:02,689 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 140 transitions. [2020-07-11 02:28:02,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2020-07-11 02:28:02,690 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 02:28:02,690 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-11 02:28:02,691 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-07-11 02:28:02,691 INFO L427 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 02:28:02,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 02:28:02,691 INFO L82 PathProgramCache]: Analyzing trace with hash 1908556953, now seen corresponding path program 9 times [2020-07-11 02:28:02,691 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 02:28:02,691 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [262629280] [2020-07-11 02:28:02,692 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 02:28:02,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-11 02:28:02,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-11 02:28:02,800 INFO L174 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-07-11 02:28:02,800 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-11 02:28:02,800 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-07-11 02:28:02,863 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2020-07-11 02:28:02,864 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-11 02:28:02,864 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-11 02:28:02,864 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2020-07-11 02:28:02,864 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2020-07-11 02:28:02,864 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2020-07-11 02:28:02,864 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-11 02:28:02,864 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-11 02:28:02,864 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-11 02:28:02,864 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2020-07-11 02:28:02,865 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2020-07-11 02:28:02,865 WARN L170 areAnnotationChecker]: L20 has no Hoare annotation [2020-07-11 02:28:02,865 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation [2020-07-11 02:28:02,865 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation [2020-07-11 02:28:02,865 WARN L170 areAnnotationChecker]: L-1-1 has no Hoare annotation [2020-07-11 02:28:02,865 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-11 02:28:02,865 WARN L170 areAnnotationChecker]: L5-1 has no Hoare annotation [2020-07-11 02:28:02,865 WARN L170 areAnnotationChecker]: L5-3 has no Hoare annotation [2020-07-11 02:28:02,866 WARN L170 areAnnotationChecker]: L20-1 has no Hoare annotation [2020-07-11 02:28:02,866 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2020-07-11 02:28:02,866 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2020-07-11 02:28:02,866 WARN L170 areAnnotationChecker]: L8-2 has no Hoare annotation [2020-07-11 02:28:02,866 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-11 02:28:02,866 WARN L170 areAnnotationChecker]: L21 has no Hoare annotation [2020-07-11 02:28:02,866 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-11 02:28:02,867 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-11 02:28:02,867 WARN L170 areAnnotationChecker]: L21-1 has no Hoare annotation [2020-07-11 02:28:02,867 WARN L170 areAnnotationChecker]: L60-1 has no Hoare annotation [2020-07-11 02:28:02,867 WARN L170 areAnnotationChecker]: L21-2 has no Hoare annotation [2020-07-11 02:28:02,867 WARN L170 areAnnotationChecker]: L20-14 has no Hoare annotation [2020-07-11 02:28:02,867 WARN L170 areAnnotationChecker]: L21-3 has no Hoare annotation [2020-07-11 02:28:02,867 WARN L170 areAnnotationChecker]: L20-15 has no Hoare annotation [2020-07-11 02:28:02,867 WARN L170 areAnnotationChecker]: L24 has no Hoare annotation [2020-07-11 02:28:02,867 WARN L170 areAnnotationChecker]: L20-16 has no Hoare annotation [2020-07-11 02:28:02,868 WARN L170 areAnnotationChecker]: L24-6 has no Hoare annotation [2020-07-11 02:28:02,868 WARN L170 areAnnotationChecker]: L24-6 has no Hoare annotation [2020-07-11 02:28:02,868 WARN L170 areAnnotationChecker]: L24-6 has no Hoare annotation [2020-07-11 02:28:02,868 WARN L170 areAnnotationChecker]: L20-17 has no Hoare annotation [2020-07-11 02:28:02,868 WARN L170 areAnnotationChecker]: L24-7 has no Hoare annotation [2020-07-11 02:28:02,868 WARN L170 areAnnotationChecker]: L25 has no Hoare annotation [2020-07-11 02:28:02,868 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-11 02:28:02,868 WARN L170 areAnnotationChecker]: L26 has no Hoare annotation [2020-07-11 02:28:02,868 WARN L170 areAnnotationChecker]: L26 has no Hoare annotation [2020-07-11 02:28:02,868 WARN L170 areAnnotationChecker]: L25-1 has no Hoare annotation [2020-07-11 02:28:02,869 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-11 02:28:02,869 WARN L170 areAnnotationChecker]: L26-1 has no Hoare annotation [2020-07-11 02:28:02,869 WARN L170 areAnnotationChecker]: L26-3 has no Hoare annotation [2020-07-11 02:28:02,869 WARN L170 areAnnotationChecker]: L25-2 has no Hoare annotation [2020-07-11 02:28:02,869 WARN L170 areAnnotationChecker]: L26-2 has no Hoare annotation [2020-07-11 02:28:02,869 WARN L170 areAnnotationChecker]: L28 has no Hoare annotation [2020-07-11 02:28:02,869 WARN L170 areAnnotationChecker]: L24-3 has no Hoare annotation [2020-07-11 02:28:02,869 WARN L170 areAnnotationChecker]: L20-2 has no Hoare annotation [2020-07-11 02:28:02,869 WARN L170 areAnnotationChecker]: L28-6 has no Hoare annotation [2020-07-11 02:28:02,870 WARN L170 areAnnotationChecker]: L28-6 has no Hoare annotation [2020-07-11 02:28:02,870 WARN L170 areAnnotationChecker]: L28-6 has no Hoare annotation [2020-07-11 02:28:02,870 WARN L170 areAnnotationChecker]: L24-4 has no Hoare annotation [2020-07-11 02:28:02,870 WARN L170 areAnnotationChecker]: L20-3 has no Hoare annotation [2020-07-11 02:28:02,870 WARN L170 areAnnotationChecker]: L28-7 has no Hoare annotation [2020-07-11 02:28:02,870 WARN L170 areAnnotationChecker]: L29 has no Hoare annotation [2020-07-11 02:28:02,870 WARN L170 areAnnotationChecker]: L24-5 has no Hoare annotation [2020-07-11 02:28:02,870 WARN L170 areAnnotationChecker]: L20-4 has no Hoare annotation [2020-07-11 02:28:02,870 WARN L170 areAnnotationChecker]: L30 has no Hoare annotation [2020-07-11 02:28:02,871 WARN L170 areAnnotationChecker]: L30 has no Hoare annotation [2020-07-11 02:28:02,871 WARN L170 areAnnotationChecker]: L29-1 has no Hoare annotation [2020-07-11 02:28:02,871 WARN L170 areAnnotationChecker]: L20-5 has no Hoare annotation [2020-07-11 02:28:02,871 WARN L170 areAnnotationChecker]: L30-1 has no Hoare annotation [2020-07-11 02:28:02,871 WARN L170 areAnnotationChecker]: L30-3 has no Hoare annotation [2020-07-11 02:28:02,871 WARN L170 areAnnotationChecker]: L29-2 has no Hoare annotation [2020-07-11 02:28:02,871 WARN L170 areAnnotationChecker]: L30-2 has no Hoare annotation [2020-07-11 02:28:02,871 WARN L170 areAnnotationChecker]: L32 has no Hoare annotation [2020-07-11 02:28:02,871 WARN L170 areAnnotationChecker]: L28-3 has no Hoare annotation [2020-07-11 02:28:02,872 WARN L170 areAnnotationChecker]: L20-6 has no Hoare annotation [2020-07-11 02:28:02,872 WARN L170 areAnnotationChecker]: L33-5 has no Hoare annotation [2020-07-11 02:28:02,872 WARN L170 areAnnotationChecker]: L33-5 has no Hoare annotation [2020-07-11 02:28:02,872 WARN L170 areAnnotationChecker]: L28-4 has no Hoare annotation [2020-07-11 02:28:02,872 WARN L170 areAnnotationChecker]: L20-7 has no Hoare annotation [2020-07-11 02:28:02,872 WARN L170 areAnnotationChecker]: L33-6 has no Hoare annotation [2020-07-11 02:28:02,872 WARN L170 areAnnotationChecker]: L33-1 has no Hoare annotation [2020-07-11 02:28:02,872 WARN L170 areAnnotationChecker]: L33-1 has no Hoare annotation [2020-07-11 02:28:02,873 WARN L170 areAnnotationChecker]: L28-5 has no Hoare annotation [2020-07-11 02:28:02,873 WARN L170 areAnnotationChecker]: L20-8 has no Hoare annotation [2020-07-11 02:28:02,873 WARN L170 areAnnotationChecker]: L37-5 has no Hoare annotation [2020-07-11 02:28:02,873 WARN L170 areAnnotationChecker]: L37-5 has no Hoare annotation [2020-07-11 02:28:02,873 WARN L170 areAnnotationChecker]: L33-2 has no Hoare annotation [2020-07-11 02:28:02,873 WARN L170 areAnnotationChecker]: L33-4 has no Hoare annotation [2020-07-11 02:28:02,873 WARN L170 areAnnotationChecker]: L20-9 has no Hoare annotation [2020-07-11 02:28:02,873 WARN L170 areAnnotationChecker]: L37-6 has no Hoare annotation [2020-07-11 02:28:02,873 WARN L170 areAnnotationChecker]: L37-6 has no Hoare annotation [2020-07-11 02:28:02,873 WARN L170 areAnnotationChecker]: L37-1 has no Hoare annotation [2020-07-11 02:28:02,874 WARN L170 areAnnotationChecker]: L37-1 has no Hoare annotation [2020-07-11 02:28:02,874 WARN L170 areAnnotationChecker]: L34 has no Hoare annotation [2020-07-11 02:28:02,874 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2020-07-11 02:28:02,874 WARN L170 areAnnotationChecker]: L43 has no Hoare annotation [2020-07-11 02:28:02,874 WARN L170 areAnnotationChecker]: L37-2 has no Hoare annotation [2020-07-11 02:28:02,874 WARN L170 areAnnotationChecker]: L37-4 has no Hoare annotation [2020-07-11 02:28:02,874 WARN L170 areAnnotationChecker]: L34-1 has no Hoare annotation [2020-07-11 02:28:02,874 WARN L170 areAnnotationChecker]: L20-10 has no Hoare annotation [2020-07-11 02:28:02,874 WARN L170 areAnnotationChecker]: L43-1 has no Hoare annotation [2020-07-11 02:28:02,874 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2020-07-11 02:28:02,875 WARN L170 areAnnotationChecker]: L34-2 has no Hoare annotation [2020-07-11 02:28:02,875 WARN L170 areAnnotationChecker]: L20-11 has no Hoare annotation [2020-07-11 02:28:02,875 WARN L170 areAnnotationChecker]: L46-8 has no Hoare annotation [2020-07-11 02:28:02,875 WARN L170 areAnnotationChecker]: L46-8 has no Hoare annotation [2020-07-11 02:28:02,875 WARN L170 areAnnotationChecker]: L46-8 has no Hoare annotation [2020-07-11 02:28:02,875 WARN L170 areAnnotationChecker]: L38-1 has no Hoare annotation [2020-07-11 02:28:02,875 WARN L170 areAnnotationChecker]: L20-12 has no Hoare annotation [2020-07-11 02:28:02,875 WARN L170 areAnnotationChecker]: L44-2 has no Hoare annotation [2020-07-11 02:28:02,875 WARN L170 areAnnotationChecker]: L46 has no Hoare annotation [2020-07-11 02:28:02,875 WARN L170 areAnnotationChecker]: L38-2 has no Hoare annotation [2020-07-11 02:28:02,876 WARN L170 areAnnotationChecker]: L20-13 has no Hoare annotation [2020-07-11 02:28:02,876 WARN L170 areAnnotationChecker]: L60 has no Hoare annotation [2020-07-11 02:28:02,876 WARN L170 areAnnotationChecker]: L60 has no Hoare annotation [2020-07-11 02:28:02,876 WARN L170 areAnnotationChecker]: L46-1 has no Hoare annotation [2020-07-11 02:28:02,876 WARN L170 areAnnotationChecker]: L46-2 has no Hoare annotation [2020-07-11 02:28:02,876 WARN L170 areAnnotationChecker]: L46-2 has no Hoare annotation [2020-07-11 02:28:02,876 WARN L170 areAnnotationChecker]: L46-3 has no Hoare annotation [2020-07-11 02:28:02,877 WARN L170 areAnnotationChecker]: L46-6 has no Hoare annotation [2020-07-11 02:28:02,877 WARN L170 areAnnotationChecker]: L46-4 has no Hoare annotation [2020-07-11 02:28:02,877 WARN L170 areAnnotationChecker]: L46-7 has no Hoare annotation [2020-07-11 02:28:02,877 WARN L170 areAnnotationChecker]: L48 has no Hoare annotation [2020-07-11 02:28:02,877 WARN L170 areAnnotationChecker]: L53 has no Hoare annotation [2020-07-11 02:28:02,877 WARN L170 areAnnotationChecker]: L48-1 has no Hoare annotation [2020-07-11 02:28:02,877 WARN L170 areAnnotationChecker]: L54 has no Hoare annotation [2020-07-11 02:28:02,877 WARN L170 areAnnotationChecker]: L48-2 has no Hoare annotation [2020-07-11 02:28:02,877 WARN L170 areAnnotationChecker]: L49 has no Hoare annotation [2020-07-11 02:28:02,878 WARN L170 areAnnotationChecker]: L49-1 has no Hoare annotation [2020-07-11 02:28:02,878 WARN L170 areAnnotationChecker]: L49-2 has no Hoare annotation [2020-07-11 02:28:02,878 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-11 02:28:02,882 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.07 02:28:02 BoogieIcfgContainer [2020-07-11 02:28:02,882 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-11 02:28:02,885 INFO L168 Benchmark]: Toolchain (without parser) took 14649.37 ms. Allocated memory was 144.2 MB in the beginning and 373.3 MB in the end (delta: 229.1 MB). Free memory was 101.5 MB in the beginning and 143.5 MB in the end (delta: -42.1 MB). Peak memory consumption was 187.1 MB. Max. memory is 7.1 GB. [2020-07-11 02:28:02,886 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 144.2 MB. Free memory was 119.6 MB in the beginning and 119.4 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2020-07-11 02:28:02,886 INFO L168 Benchmark]: CACSL2BoogieTranslator took 325.57 ms. Allocated memory is still 144.2 MB. Free memory was 101.1 MB in the beginning and 89.8 MB in the end (delta: 11.2 MB). Peak memory consumption was 11.2 MB. Max. memory is 7.1 GB. [2020-07-11 02:28:02,887 INFO L168 Benchmark]: Boogie Preprocessor took 183.03 ms. Allocated memory was 144.2 MB in the beginning and 201.9 MB in the end (delta: 57.7 MB). Free memory was 89.8 MB in the beginning and 178.6 MB in the end (delta: -88.8 MB). Peak memory consumption was 9.6 MB. Max. memory is 7.1 GB. [2020-07-11 02:28:02,888 INFO L168 Benchmark]: RCFGBuilder took 641.36 ms. Allocated memory is still 201.9 MB. Free memory was 178.6 MB in the beginning and 139.1 MB in the end (delta: 39.5 MB). Peak memory consumption was 39.5 MB. Max. memory is 7.1 GB. [2020-07-11 02:28:02,889 INFO L168 Benchmark]: TraceAbstraction took 13493.58 ms. Allocated memory was 201.9 MB in the beginning and 373.3 MB in the end (delta: 171.4 MB). Free memory was 139.1 MB in the beginning and 143.5 MB in the end (delta: -4.5 MB). Peak memory consumption was 167.0 MB. Max. memory is 7.1 GB. [2020-07-11 02:28:02,891 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 144.2 MB. Free memory was 119.6 MB in the beginning and 119.4 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 325.57 ms. Allocated memory is still 144.2 MB. Free memory was 101.1 MB in the beginning and 89.8 MB in the end (delta: 11.2 MB). Peak memory consumption was 11.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 183.03 ms. Allocated memory was 144.2 MB in the beginning and 201.9 MB in the end (delta: 57.7 MB). Free memory was 89.8 MB in the beginning and 178.6 MB in the end (delta: -88.8 MB). Peak memory consumption was 9.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 641.36 ms. Allocated memory is still 201.9 MB. Free memory was 178.6 MB in the beginning and 139.1 MB in the end (delta: 39.5 MB). Peak memory consumption was 39.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 13493.58 ms. Allocated memory was 201.9 MB in the beginning and 373.3 MB in the end (delta: 171.4 MB). Free memory was 139.1 MB in the beginning and 143.5 MB in the end (delta: -4.5 MB). Peak memory consumption was 167.0 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]; VAL [string_A={7:0}, string_B={6:0}] [L21] int i, j, nc_A, nc_B, found=0; VAL [found=0, string_A={7:0}, string_B={6:0}] [L24] i=0 VAL [found=0, i=0, string_A={7:0}, string_B={6:0}] [L24] COND TRUE i<5 VAL [found=0, i=0, string_A={7:0}, string_B={6:0}] [L25] string_A[i]=__VERIFIER_nondet_char() VAL [__VERIFIER_nondet_char()=0, found=0, i=0, string_A={7:0}, string_B={6:0}] [L24] i++ VAL [found=0, i=1, string_A={7:0}, string_B={6:0}] [L24] COND TRUE i<5 VAL [found=0, i=1, string_A={7:0}, string_B={6:0}] [L25] string_A[i]=__VERIFIER_nondet_char() VAL [__VERIFIER_nondet_char()=-2, found=0, i=1, string_A={7:0}, string_B={6:0}] [L24] i++ VAL [found=0, i=2, string_A={7:0}, string_B={6:0}] [L24] COND TRUE i<5 VAL [found=0, i=2, string_A={7:0}, string_B={6:0}] [L25] string_A[i]=__VERIFIER_nondet_char() VAL [__VERIFIER_nondet_char()=-3, found=0, i=2, string_A={7:0}, string_B={6:0}] [L24] i++ VAL [found=0, i=3, string_A={7:0}, string_B={6:0}] [L24] COND TRUE i<5 VAL [found=0, i=3, string_A={7:0}, string_B={6:0}] [L25] string_A[i]=__VERIFIER_nondet_char() VAL [__VERIFIER_nondet_char()=-4, found=0, i=3, string_A={7:0}, string_B={6:0}] [L24] i++ VAL [found=0, i=4, string_A={7:0}, string_B={6:0}] [L24] COND TRUE i<5 VAL [found=0, i=4, string_A={7:0}, string_B={6:0}] [L25] string_A[i]=__VERIFIER_nondet_char() VAL [__VERIFIER_nondet_char()=0, found=0, i=4, string_A={7:0}, string_B={6:0}] [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')) VAL [found=0, i=5, string_A={7:0}, string_A[5 -1]=0, string_B={6:0}] [L28] i=0 VAL [found=0, i=0, string_A={7:0}, string_B={6:0}] [L28] COND TRUE i<5 VAL [found=0, i=0, string_A={7:0}, string_B={6:0}] [L29] string_B[i]=__VERIFIER_nondet_char() VAL [__VERIFIER_nondet_char()=0, found=0, i=0, string_A={7:0}, string_B={6:0}] [L28] i++ VAL [found=0, i=1, string_A={7:0}, string_B={6:0}] [L28] COND TRUE i<5 VAL [found=0, i=1, string_A={7:0}, string_B={6:0}] [L29] string_B[i]=__VERIFIER_nondet_char() VAL [__VERIFIER_nondet_char()=-7, found=0, i=1, string_A={7:0}, string_B={6:0}] [L28] i++ VAL [found=0, i=2, string_A={7:0}, string_B={6:0}] [L28] COND TRUE i<5 VAL [found=0, i=2, string_A={7:0}, string_B={6:0}] [L29] string_B[i]=__VERIFIER_nondet_char() VAL [__VERIFIER_nondet_char()=8, found=0, i=2, string_A={7:0}, string_B={6:0}] [L28] i++ VAL [found=0, i=3, string_A={7:0}, string_B={6:0}] [L28] COND TRUE i<5 VAL [found=0, i=3, string_A={7:0}, string_B={6:0}] [L29] string_B[i]=__VERIFIER_nondet_char() VAL [__VERIFIER_nondet_char()=-8, found=0, i=3, string_A={7:0}, string_B={6:0}] [L28] i++ VAL [found=0, i=4, string_A={7:0}, string_B={6:0}] [L28] COND TRUE i<5 VAL [found=0, i=4, string_A={7:0}, string_B={6:0}] [L29] string_B[i]=__VERIFIER_nondet_char() VAL [__VERIFIER_nondet_char()=0, found=0, i=4, string_A={7:0}, string_B={6:0}] [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')) VAL [found=0, i=5, string_A={7:0}, string_B={6:0}, 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') VAL [found=0, i=5, nc_A=0, string_A={7:0}, string_A[nc_A]=0, string_B={6: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') VAL [found=0, i=5, nc_A=0, nc_B=0, string_A={7:0}, string_B={6:0}, string_B[nc_B]=0] [L40] COND FALSE !(!(nc_B >= nc_A)) VAL [found=0, i=5, nc_A=0, nc_B=0, string_A={7:0}, string_B={6:0}] [L43] EXPR j=0 VAL [found=0, i=5, j=0, nc_A=0, nc_B=0, string_A={7:0}, string_B={6: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)<