/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/ldv-regression/test11.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-8fc6572 [2020-07-10 19:02:10,962 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-10 19:02:10,964 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-10 19:02:10,983 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-10 19:02:10,984 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-10 19:02:10,985 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-10 19:02:10,986 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-10 19:02:10,988 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-10 19:02:10,990 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-10 19:02:10,991 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-10 19:02:10,992 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-10 19:02:10,993 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-10 19:02:10,993 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-10 19:02:10,995 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-10 19:02:10,996 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-10 19:02:10,997 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-10 19:02:10,998 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-10 19:02:10,999 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-10 19:02:11,001 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-10 19:02:11,003 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-10 19:02:11,004 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-10 19:02:11,006 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-10 19:02:11,007 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-10 19:02:11,008 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-10 19:02:11,010 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-10 19:02:11,010 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-10 19:02:11,011 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-10 19:02:11,012 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-10 19:02:11,012 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-10 19:02:11,013 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-10 19:02:11,013 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-10 19:02:11,014 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-10 19:02:11,015 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-10 19:02:11,016 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-10 19:02:11,017 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-10 19:02:11,017 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-10 19:02:11,018 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-10 19:02:11,018 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-10 19:02:11,018 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-10 19:02:11,019 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-10 19:02:11,020 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-10 19:02:11,021 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-10 19:02:11,030 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-10 19:02:11,030 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-10 19:02:11,032 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-10 19:02:11,032 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-10 19:02:11,032 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-10 19:02:11,032 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-10 19:02:11,032 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-10 19:02:11,033 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-10 19:02:11,033 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-10 19:02:11,033 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-10 19:02:11,033 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-10 19:02:11,033 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-10 19:02:11,034 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-10 19:02:11,034 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-10 19:02:11,034 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-10 19:02:11,034 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-10 19:02:11,034 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-10 19:02:11,035 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-10 19:02:11,035 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 19:02:11,035 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-10 19:02:11,035 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-10 19:02:11,035 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-10 19:02:11,036 INFO L138 SettingsManager]: * Use separate solver for trace checks=false [2020-07-10 19:02:11,332 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-10 19:02:11,349 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-10 19:02:11,353 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-10 19:02:11,354 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-10 19:02:11,355 INFO L275 PluginConnector]: CDTParser initialized [2020-07-10 19:02:11,355 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-regression/test11.c [2020-07-10 19:02:11,425 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b17ea81f2/3a9d8bad6fe34351a77393ec699c9b80/FLAG04856fb02 [2020-07-10 19:02:11,856 INFO L306 CDTParser]: Found 1 translation units. [2020-07-10 19:02:11,857 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-regression/test11.c [2020-07-10 19:02:11,864 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b17ea81f2/3a9d8bad6fe34351a77393ec699c9b80/FLAG04856fb02 [2020-07-10 19:02:12,189 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b17ea81f2/3a9d8bad6fe34351a77393ec699c9b80 [2020-07-10 19:02:12,200 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-10 19:02:12,203 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-10 19:02:12,205 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-10 19:02:12,205 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-10 19:02:12,209 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-10 19:02:12,210 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 07:02:12" (1/1) ... [2020-07-10 19:02:12,214 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49cf07e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 07:02:12, skipping insertion in model container [2020-07-10 19:02:12,214 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 07:02:12" (1/1) ... [2020-07-10 19:02:12,222 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-10 19:02:12,241 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-10 19:02:12,408 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 19:02:12,423 INFO L203 MainTranslator]: Completed pre-run [2020-07-10 19:02:12,444 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 19:02:12,462 INFO L208 MainTranslator]: Completed translation [2020-07-10 19:02:12,462 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 07:02:12 WrapperNode [2020-07-10 19:02:12,463 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-10 19:02:12,463 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-10 19:02:12,464 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-10 19:02:12,464 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-10 19:02:12,478 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 07:02:12" (1/1) ... [2020-07-10 19:02:12,479 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 07:02:12" (1/1) ... [2020-07-10 19:02:12,572 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 07:02:12" (1/1) ... [2020-07-10 19:02:12,572 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 07:02:12" (1/1) ... [2020-07-10 19:02:12,582 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 07:02:12" (1/1) ... [2020-07-10 19:02:12,585 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 07:02:12" (1/1) ... [2020-07-10 19:02:12,587 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 07:02:12" (1/1) ... [2020-07-10 19:02:12,590 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-10 19:02:12,593 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-10 19:02:12,593 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-10 19:02:12,593 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-10 19:02:12,594 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 07:02:12" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 19:02:12,653 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-10 19:02:12,654 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-10 19:02:12,654 INFO L138 BoogieDeclarations]: Found implementation of procedure get_dummy [2020-07-10 19:02:12,654 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-10 19:02:12,654 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-10 19:02:12,654 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-10 19:02:12,654 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2020-07-10 19:02:12,654 INFO L130 BoogieDeclarations]: Found specification of procedure get_dummy [2020-07-10 19:02:12,655 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-10 19:02:12,655 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-10 19:02:12,655 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-07-10 19:02:12,655 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-10 19:02:12,655 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-10 19:02:12,655 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-10 19:02:12,655 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-10 19:02:12,656 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-10 19:02:13,090 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-10 19:02:13,090 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-07-10 19:02:13,096 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 07:02:13 BoogieIcfgContainer [2020-07-10 19:02:13,096 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-10 19:02:13,097 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-10 19:02:13,097 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-10 19:02:13,105 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-10 19:02:13,106 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.07 07:02:12" (1/3) ... [2020-07-10 19:02:13,107 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20a83ff0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 07:02:13, skipping insertion in model container [2020-07-10 19:02:13,107 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 07:02:12" (2/3) ... [2020-07-10 19:02:13,108 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20a83ff0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 07:02:13, skipping insertion in model container [2020-07-10 19:02:13,108 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 07:02:13" (3/3) ... [2020-07-10 19:02:13,109 INFO L109 eAbstractionObserver]: Analyzing ICFG test11.c [2020-07-10 19:02:13,120 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-10 19:02:13,128 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-10 19:02:13,143 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-10 19:02:13,162 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-10 19:02:13,163 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-10 19:02:13,163 INFO L377 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-07-10 19:02:13,163 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-10 19:02:13,163 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-10 19:02:13,163 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-10 19:02:13,164 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-10 19:02:13,164 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-10 19:02:13,182 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states. [2020-07-10 19:02:13,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2020-07-10 19:02:13,194 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 19:02:13,196 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] [2020-07-10 19:02:13,196 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 19:02:13,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 19:02:13,202 INFO L82 PathProgramCache]: Analyzing trace with hash 1040052544, now seen corresponding path program 1 times [2020-07-10 19:02:13,209 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 19:02:13,210 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1842166917] [2020-07-10 19:02:13,210 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 19:02:13,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 19:02:13,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 19:02:13,691 INFO L280 TraceCheckUtils]: 0: Hoare triple {94#(and (= |~#a~0.base| |old(~#a~0.base)|) (= |~#b~0.base| |old(~#b~0.base)|) (= |#valid| |old(#valid)|) (= |~#b~0.offset| |old(~#b~0.offset)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |~#a~0.offset| |old(~#a~0.offset)|) (= |old(#length)| |#length|))} #NULL.base, #NULL.offset := 0, 0; {73#true} is VALID [2020-07-10 19:02:13,691 INFO L280 TraceCheckUtils]: 1: Hoare triple {73#true} #valid := #valid[0 := 0]; {73#true} is VALID [2020-07-10 19:02:13,692 INFO L280 TraceCheckUtils]: 2: Hoare triple {73#true} assume 0 < #StackHeapBarrier; {73#true} is VALID [2020-07-10 19:02:13,692 INFO L280 TraceCheckUtils]: 3: Hoare triple {73#true} SUMMARY for call ~#a~0.base, ~#a~0.offset := #Ultimate.allocOnStack(4); srcloc: L5 {73#true} is VALID [2020-07-10 19:02:13,693 INFO L280 TraceCheckUtils]: 4: Hoare triple {73#true} SUMMARY for call write~init~int(0, ~#a~0.base, ~#a~0.offset, 4); srcloc: L5-1 {73#true} is VALID [2020-07-10 19:02:13,693 INFO L280 TraceCheckUtils]: 5: Hoare triple {73#true} SUMMARY for call ~#b~0.base, ~#b~0.offset := #Ultimate.allocOnStack(4); srcloc: L5-2 {73#true} is VALID [2020-07-10 19:02:13,694 INFO L280 TraceCheckUtils]: 6: Hoare triple {73#true} SUMMARY for call write~init~int(0, ~#b~0.base, ~#b~0.offset, 4); srcloc: L5-3 {73#true} is VALID [2020-07-10 19:02:13,694 INFO L280 TraceCheckUtils]: 7: Hoare triple {73#true} assume true; {73#true} is VALID [2020-07-10 19:02:13,695 INFO L275 TraceCheckUtils]: 8: Hoare quadruple {73#true} {73#true} #90#return; {73#true} is VALID [2020-07-10 19:02:13,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 19:02:13,713 INFO L280 TraceCheckUtils]: 0: Hoare triple {73#true} assume 0 != #t~nondet0 % 256; {73#true} is VALID [2020-07-10 19:02:13,714 INFO L280 TraceCheckUtils]: 1: Hoare triple {73#true} #t~ite1.base, #t~ite1.offset := ~#a~0.base, ~#a~0.offset; {73#true} is VALID [2020-07-10 19:02:13,715 INFO L280 TraceCheckUtils]: 2: Hoare triple {73#true} #res.base, #res.offset := #t~ite1.base, #t~ite1.offset; {73#true} is VALID [2020-07-10 19:02:13,715 INFO L280 TraceCheckUtils]: 3: Hoare triple {73#true} havoc #t~nondet0; {73#true} is VALID [2020-07-10 19:02:13,716 INFO L280 TraceCheckUtils]: 4: Hoare triple {73#true} havoc #t~ite1.base, #t~ite1.offset; {73#true} is VALID [2020-07-10 19:02:13,716 INFO L280 TraceCheckUtils]: 5: Hoare triple {73#true} assume true; {73#true} is VALID [2020-07-10 19:02:13,718 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {73#true} {85#(not (= 0 main_~pc~0.base))} #94#return; {85#(not (= 0 main_~pc~0.base))} is VALID [2020-07-10 19:02:13,721 INFO L263 TraceCheckUtils]: 0: Hoare triple {73#true} call ULTIMATE.init(); {94#(and (= |~#a~0.base| |old(~#a~0.base)|) (= |~#b~0.base| |old(~#b~0.base)|) (= |#valid| |old(#valid)|) (= |~#b~0.offset| |old(~#b~0.offset)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |~#a~0.offset| |old(~#a~0.offset)|) (= |old(#length)| |#length|))} is VALID [2020-07-10 19:02:13,722 INFO L280 TraceCheckUtils]: 1: Hoare triple {94#(and (= |~#a~0.base| |old(~#a~0.base)|) (= |~#b~0.base| |old(~#b~0.base)|) (= |#valid| |old(#valid)|) (= |~#b~0.offset| |old(~#b~0.offset)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |~#a~0.offset| |old(~#a~0.offset)|) (= |old(#length)| |#length|))} #NULL.base, #NULL.offset := 0, 0; {73#true} is VALID [2020-07-10 19:02:13,723 INFO L280 TraceCheckUtils]: 2: Hoare triple {73#true} #valid := #valid[0 := 0]; {73#true} is VALID [2020-07-10 19:02:13,723 INFO L280 TraceCheckUtils]: 3: Hoare triple {73#true} assume 0 < #StackHeapBarrier; {73#true} is VALID [2020-07-10 19:02:13,723 INFO L280 TraceCheckUtils]: 4: Hoare triple {73#true} SUMMARY for call ~#a~0.base, ~#a~0.offset := #Ultimate.allocOnStack(4); srcloc: L5 {73#true} is VALID [2020-07-10 19:02:13,724 INFO L280 TraceCheckUtils]: 5: Hoare triple {73#true} SUMMARY for call write~init~int(0, ~#a~0.base, ~#a~0.offset, 4); srcloc: L5-1 {73#true} is VALID [2020-07-10 19:02:13,724 INFO L280 TraceCheckUtils]: 6: Hoare triple {73#true} SUMMARY for call ~#b~0.base, ~#b~0.offset := #Ultimate.allocOnStack(4); srcloc: L5-2 {73#true} is VALID [2020-07-10 19:02:13,725 INFO L280 TraceCheckUtils]: 7: Hoare triple {73#true} SUMMARY for call write~init~int(0, ~#b~0.base, ~#b~0.offset, 4); srcloc: L5-3 {73#true} is VALID [2020-07-10 19:02:13,725 INFO L280 TraceCheckUtils]: 8: Hoare triple {73#true} assume true; {73#true} is VALID [2020-07-10 19:02:13,725 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {73#true} {73#true} #90#return; {73#true} is VALID [2020-07-10 19:02:13,726 INFO L263 TraceCheckUtils]: 10: Hoare triple {73#true} call #t~ret11 := main(); {73#true} is VALID [2020-07-10 19:02:13,727 INFO L280 TraceCheckUtils]: 11: Hoare triple {73#true} SUMMARY for call ~#c~0.base, ~#c~0.offset := #Ultimate.allocOnStack(4); srcloc: mainENTRY {84#(not (= 0 |main_~#c~0.base|))} is VALID [2020-07-10 19:02:13,730 INFO L280 TraceCheckUtils]: 12: Hoare triple {84#(not (= 0 |main_~#c~0.base|))} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {84#(not (= 0 |main_~#c~0.base|))} is VALID [2020-07-10 19:02:13,731 INFO L280 TraceCheckUtils]: 13: Hoare triple {84#(not (= 0 |main_~#c~0.base|))} SUMMARY for call write~init~int(#t~nondet2, ~#c~0.base, ~#c~0.offset, 4); srcloc: L13-1 {84#(not (= 0 |main_~#c~0.base|))} is VALID [2020-07-10 19:02:13,732 INFO L280 TraceCheckUtils]: 14: Hoare triple {84#(not (= 0 |main_~#c~0.base|))} havoc #t~nondet2; {84#(not (= 0 |main_~#c~0.base|))} is VALID [2020-07-10 19:02:13,733 INFO L280 TraceCheckUtils]: 15: Hoare triple {84#(not (= 0 |main_~#c~0.base|))} havoc ~pa~0.base, ~pa~0.offset; {84#(not (= 0 |main_~#c~0.base|))} is VALID [2020-07-10 19:02:13,734 INFO L280 TraceCheckUtils]: 16: Hoare triple {84#(not (= 0 |main_~#c~0.base|))} havoc ~pb~0.base, ~pb~0.offset; {84#(not (= 0 |main_~#c~0.base|))} is VALID [2020-07-10 19:02:13,735 INFO L280 TraceCheckUtils]: 17: Hoare triple {84#(not (= 0 |main_~#c~0.base|))} ~pc~0.base, ~pc~0.offset := ~#c~0.base, ~#c~0.offset; {85#(not (= 0 main_~pc~0.base))} is VALID [2020-07-10 19:02:13,736 INFO L280 TraceCheckUtils]: 18: Hoare triple {85#(not (= 0 main_~pc~0.base))} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {85#(not (= 0 main_~pc~0.base))} is VALID [2020-07-10 19:02:13,737 INFO L280 TraceCheckUtils]: 19: Hoare triple {85#(not (= 0 main_~pc~0.base))} SUMMARY for call write~int(#t~nondet3, ~#a~0.base, ~#a~0.offset, 4); srcloc: L15-1 {85#(not (= 0 main_~pc~0.base))} is VALID [2020-07-10 19:02:13,738 INFO L280 TraceCheckUtils]: 20: Hoare triple {85#(not (= 0 main_~pc~0.base))} havoc #t~nondet3; {85#(not (= 0 main_~pc~0.base))} is VALID [2020-07-10 19:02:13,739 INFO L280 TraceCheckUtils]: 21: Hoare triple {85#(not (= 0 main_~pc~0.base))} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {85#(not (= 0 main_~pc~0.base))} is VALID [2020-07-10 19:02:13,741 INFO L280 TraceCheckUtils]: 22: Hoare triple {85#(not (= 0 main_~pc~0.base))} SUMMARY for call write~int(#t~nondet4, ~#b~0.base, ~#b~0.offset, 4); srcloc: L16-1 {85#(not (= 0 main_~pc~0.base))} is VALID [2020-07-10 19:02:13,743 INFO L280 TraceCheckUtils]: 23: Hoare triple {85#(not (= 0 main_~pc~0.base))} havoc #t~nondet4; {85#(not (= 0 main_~pc~0.base))} is VALID [2020-07-10 19:02:13,743 INFO L263 TraceCheckUtils]: 24: Hoare triple {85#(not (= 0 main_~pc~0.base))} call #t~ret5.base, #t~ret5.offset := get_dummy(); {73#true} is VALID [2020-07-10 19:02:13,744 INFO L280 TraceCheckUtils]: 25: Hoare triple {73#true} assume 0 != #t~nondet0 % 256; {73#true} is VALID [2020-07-10 19:02:13,744 INFO L280 TraceCheckUtils]: 26: Hoare triple {73#true} #t~ite1.base, #t~ite1.offset := ~#a~0.base, ~#a~0.offset; {73#true} is VALID [2020-07-10 19:02:13,744 INFO L280 TraceCheckUtils]: 27: Hoare triple {73#true} #res.base, #res.offset := #t~ite1.base, #t~ite1.offset; {73#true} is VALID [2020-07-10 19:02:13,745 INFO L280 TraceCheckUtils]: 28: Hoare triple {73#true} havoc #t~nondet0; {73#true} is VALID [2020-07-10 19:02:13,745 INFO L280 TraceCheckUtils]: 29: Hoare triple {73#true} havoc #t~ite1.base, #t~ite1.offset; {73#true} is VALID [2020-07-10 19:02:13,745 INFO L280 TraceCheckUtils]: 30: Hoare triple {73#true} assume true; {73#true} is VALID [2020-07-10 19:02:13,748 INFO L275 TraceCheckUtils]: 31: Hoare quadruple {73#true} {85#(not (= 0 main_~pc~0.base))} #94#return; {85#(not (= 0 main_~pc~0.base))} is VALID [2020-07-10 19:02:13,749 INFO L280 TraceCheckUtils]: 32: Hoare triple {85#(not (= 0 main_~pc~0.base))} ~pb~0.base, ~pb~0.offset := #t~ret5.base, #t~ret5.offset; {85#(not (= 0 main_~pc~0.base))} is VALID [2020-07-10 19:02:13,750 INFO L280 TraceCheckUtils]: 33: Hoare triple {85#(not (= 0 main_~pc~0.base))} ~pa~0.base, ~pa~0.offset := ~pb~0.base, ~pb~0.offset; {85#(not (= 0 main_~pc~0.base))} is VALID [2020-07-10 19:02:13,751 INFO L280 TraceCheckUtils]: 34: Hoare triple {85#(not (= 0 main_~pc~0.base))} havoc #t~ret5.base, #t~ret5.offset; {85#(not (= 0 main_~pc~0.base))} is VALID [2020-07-10 19:02:13,753 INFO L280 TraceCheckUtils]: 35: Hoare triple {85#(not (= 0 main_~pc~0.base))} #t~short9 := ~pc~0.base == 0 && ~pc~0.offset == 0; {93#(not |main_#t~short9|)} is VALID [2020-07-10 19:02:13,754 INFO L280 TraceCheckUtils]: 36: Hoare triple {93#(not |main_#t~short9|)} assume #t~short9; {74#false} is VALID [2020-07-10 19:02:13,754 INFO L280 TraceCheckUtils]: 37: Hoare triple {74#false} assume #t~short9; {74#false} is VALID [2020-07-10 19:02:13,755 INFO L280 TraceCheckUtils]: 38: Hoare triple {74#false} havoc #t~mem7; {74#false} is VALID [2020-07-10 19:02:13,755 INFO L280 TraceCheckUtils]: 39: Hoare triple {74#false} havoc #t~short8; {74#false} is VALID [2020-07-10 19:02:13,755 INFO L280 TraceCheckUtils]: 40: Hoare triple {74#false} havoc #t~mem6; {74#false} is VALID [2020-07-10 19:02:13,756 INFO L280 TraceCheckUtils]: 41: Hoare triple {74#false} havoc #t~short9; {74#false} is VALID [2020-07-10 19:02:13,756 INFO L280 TraceCheckUtils]: 42: Hoare triple {74#false} assume !false; {74#false} is VALID [2020-07-10 19:02:13,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 19:02:13,766 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 19:02:13,768 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1842166917] [2020-07-10 19:02:13,770 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 19:02:13,771 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-10 19:02:13,772 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127093897] [2020-07-10 19:02:13,779 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 43 [2020-07-10 19:02:13,782 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 19:02:13,786 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-10 19:02:13,868 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 19:02:13,868 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-10 19:02:13,869 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 19:02:13,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-10 19:02:13,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-10 19:02:13,881 INFO L87 Difference]: Start difference. First operand 70 states. Second operand 6 states. [2020-07-10 19:02:14,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 19:02:14,620 INFO L93 Difference]: Finished difference Result 93 states and 98 transitions. [2020-07-10 19:02:14,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-10 19:02:14,620 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 43 [2020-07-10 19:02:14,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 19:02:14,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 19:02:14,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 98 transitions. [2020-07-10 19:02:14,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 19:02:14,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 98 transitions. [2020-07-10 19:02:14,645 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 98 transitions. [2020-07-10 19:02:14,775 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-10 19:02:14,790 INFO L225 Difference]: With dead ends: 93 [2020-07-10 19:02:14,790 INFO L226 Difference]: Without dead ends: 59 [2020-07-10 19:02:14,795 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-07-10 19:02:14,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2020-07-10 19:02:14,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2020-07-10 19:02:14,958 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 19:02:14,958 INFO L82 GeneralOperation]: Start isEquivalent. First operand 59 states. Second operand 59 states. [2020-07-10 19:02:14,959 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand 59 states. [2020-07-10 19:02:14,959 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 59 states. [2020-07-10 19:02:14,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 19:02:14,966 INFO L93 Difference]: Finished difference Result 59 states and 61 transitions. [2020-07-10 19:02:14,966 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 61 transitions. [2020-07-10 19:02:14,967 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 19:02:14,967 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 19:02:14,968 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand 59 states. [2020-07-10 19:02:14,968 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 59 states. [2020-07-10 19:02:14,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 19:02:14,974 INFO L93 Difference]: Finished difference Result 59 states and 61 transitions. [2020-07-10 19:02:14,974 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 61 transitions. [2020-07-10 19:02:14,975 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 19:02:14,975 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 19:02:14,976 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 19:02:14,976 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 19:02:14,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2020-07-10 19:02:14,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 61 transitions. [2020-07-10 19:02:14,982 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 61 transitions. Word has length 43 [2020-07-10 19:02:14,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 19:02:14,983 INFO L479 AbstractCegarLoop]: Abstraction has 59 states and 61 transitions. [2020-07-10 19:02:14,983 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-10 19:02:14,983 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 59 states and 61 transitions. [2020-07-10 19:02:15,095 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 19:02:15,095 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 61 transitions. [2020-07-10 19:02:15,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2020-07-10 19:02:15,097 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 19:02:15,097 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] [2020-07-10 19:02:15,098 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-10 19:02:15,098 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 19:02:15,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 19:02:15,098 INFO L82 PathProgramCache]: Analyzing trace with hash -981249608, now seen corresponding path program 1 times [2020-07-10 19:02:15,099 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 19:02:15,099 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1185187704] [2020-07-10 19:02:15,099 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 19:02:15,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 19:02:15,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 19:02:15,221 INFO L280 TraceCheckUtils]: 0: Hoare triple {543#(and (= |~#a~0.base| |old(~#a~0.base)|) (= |~#b~0.base| |old(~#b~0.base)|) (= |#valid| |old(#valid)|) (= |~#b~0.offset| |old(~#b~0.offset)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |~#a~0.offset| |old(~#a~0.offset)|) (= |old(#length)| |#length|))} #NULL.base, #NULL.offset := 0, 0; {523#true} is VALID [2020-07-10 19:02:15,221 INFO L280 TraceCheckUtils]: 1: Hoare triple {523#true} #valid := #valid[0 := 0]; {523#true} is VALID [2020-07-10 19:02:15,222 INFO L280 TraceCheckUtils]: 2: Hoare triple {523#true} assume 0 < #StackHeapBarrier; {523#true} is VALID [2020-07-10 19:02:15,222 INFO L280 TraceCheckUtils]: 3: Hoare triple {523#true} SUMMARY for call ~#a~0.base, ~#a~0.offset := #Ultimate.allocOnStack(4); srcloc: L5 {523#true} is VALID [2020-07-10 19:02:15,222 INFO L280 TraceCheckUtils]: 4: Hoare triple {523#true} SUMMARY for call write~init~int(0, ~#a~0.base, ~#a~0.offset, 4); srcloc: L5-1 {523#true} is VALID [2020-07-10 19:02:15,223 INFO L280 TraceCheckUtils]: 5: Hoare triple {523#true} SUMMARY for call ~#b~0.base, ~#b~0.offset := #Ultimate.allocOnStack(4); srcloc: L5-2 {523#true} is VALID [2020-07-10 19:02:15,223 INFO L280 TraceCheckUtils]: 6: Hoare triple {523#true} SUMMARY for call write~init~int(0, ~#b~0.base, ~#b~0.offset, 4); srcloc: L5-3 {523#true} is VALID [2020-07-10 19:02:15,223 INFO L280 TraceCheckUtils]: 7: Hoare triple {523#true} assume true; {523#true} is VALID [2020-07-10 19:02:15,224 INFO L275 TraceCheckUtils]: 8: Hoare quadruple {523#true} {523#true} #90#return; {523#true} is VALID [2020-07-10 19:02:15,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 19:02:15,231 INFO L280 TraceCheckUtils]: 0: Hoare triple {523#true} assume 0 != #t~nondet0 % 256; {523#true} is VALID [2020-07-10 19:02:15,231 INFO L280 TraceCheckUtils]: 1: Hoare triple {523#true} #t~ite1.base, #t~ite1.offset := ~#a~0.base, ~#a~0.offset; {523#true} is VALID [2020-07-10 19:02:15,231 INFO L280 TraceCheckUtils]: 2: Hoare triple {523#true} #res.base, #res.offset := #t~ite1.base, #t~ite1.offset; {523#true} is VALID [2020-07-10 19:02:15,232 INFO L280 TraceCheckUtils]: 3: Hoare triple {523#true} havoc #t~nondet0; {523#true} is VALID [2020-07-10 19:02:15,232 INFO L280 TraceCheckUtils]: 4: Hoare triple {523#true} havoc #t~ite1.base, #t~ite1.offset; {523#true} is VALID [2020-07-10 19:02:15,232 INFO L280 TraceCheckUtils]: 5: Hoare triple {523#true} assume true; {523#true} is VALID [2020-07-10 19:02:15,233 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {523#true} {523#true} #94#return; {523#true} is VALID [2020-07-10 19:02:15,234 INFO L263 TraceCheckUtils]: 0: Hoare triple {523#true} call ULTIMATE.init(); {543#(and (= |~#a~0.base| |old(~#a~0.base)|) (= |~#b~0.base| |old(~#b~0.base)|) (= |#valid| |old(#valid)|) (= |~#b~0.offset| |old(~#b~0.offset)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |~#a~0.offset| |old(~#a~0.offset)|) (= |old(#length)| |#length|))} is VALID [2020-07-10 19:02:15,235 INFO L280 TraceCheckUtils]: 1: Hoare triple {543#(and (= |~#a~0.base| |old(~#a~0.base)|) (= |~#b~0.base| |old(~#b~0.base)|) (= |#valid| |old(#valid)|) (= |~#b~0.offset| |old(~#b~0.offset)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |~#a~0.offset| |old(~#a~0.offset)|) (= |old(#length)| |#length|))} #NULL.base, #NULL.offset := 0, 0; {523#true} is VALID [2020-07-10 19:02:15,235 INFO L280 TraceCheckUtils]: 2: Hoare triple {523#true} #valid := #valid[0 := 0]; {523#true} is VALID [2020-07-10 19:02:15,235 INFO L280 TraceCheckUtils]: 3: Hoare triple {523#true} assume 0 < #StackHeapBarrier; {523#true} is VALID [2020-07-10 19:02:15,236 INFO L280 TraceCheckUtils]: 4: Hoare triple {523#true} SUMMARY for call ~#a~0.base, ~#a~0.offset := #Ultimate.allocOnStack(4); srcloc: L5 {523#true} is VALID [2020-07-10 19:02:15,236 INFO L280 TraceCheckUtils]: 5: Hoare triple {523#true} SUMMARY for call write~init~int(0, ~#a~0.base, ~#a~0.offset, 4); srcloc: L5-1 {523#true} is VALID [2020-07-10 19:02:15,236 INFO L280 TraceCheckUtils]: 6: Hoare triple {523#true} SUMMARY for call ~#b~0.base, ~#b~0.offset := #Ultimate.allocOnStack(4); srcloc: L5-2 {523#true} is VALID [2020-07-10 19:02:15,237 INFO L280 TraceCheckUtils]: 7: Hoare triple {523#true} SUMMARY for call write~init~int(0, ~#b~0.base, ~#b~0.offset, 4); srcloc: L5-3 {523#true} is VALID [2020-07-10 19:02:15,237 INFO L280 TraceCheckUtils]: 8: Hoare triple {523#true} assume true; {523#true} is VALID [2020-07-10 19:02:15,237 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {523#true} {523#true} #90#return; {523#true} is VALID [2020-07-10 19:02:15,237 INFO L263 TraceCheckUtils]: 10: Hoare triple {523#true} call #t~ret11 := main(); {523#true} is VALID [2020-07-10 19:02:15,238 INFO L280 TraceCheckUtils]: 11: Hoare triple {523#true} SUMMARY for call ~#c~0.base, ~#c~0.offset := #Ultimate.allocOnStack(4); srcloc: mainENTRY {523#true} is VALID [2020-07-10 19:02:15,238 INFO L280 TraceCheckUtils]: 12: Hoare triple {523#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {523#true} is VALID [2020-07-10 19:02:15,238 INFO L280 TraceCheckUtils]: 13: Hoare triple {523#true} SUMMARY for call write~init~int(#t~nondet2, ~#c~0.base, ~#c~0.offset, 4); srcloc: L13-1 {523#true} is VALID [2020-07-10 19:02:15,239 INFO L280 TraceCheckUtils]: 14: Hoare triple {523#true} havoc #t~nondet2; {523#true} is VALID [2020-07-10 19:02:15,239 INFO L280 TraceCheckUtils]: 15: Hoare triple {523#true} havoc ~pa~0.base, ~pa~0.offset; {523#true} is VALID [2020-07-10 19:02:15,239 INFO L280 TraceCheckUtils]: 16: Hoare triple {523#true} havoc ~pb~0.base, ~pb~0.offset; {523#true} is VALID [2020-07-10 19:02:15,240 INFO L280 TraceCheckUtils]: 17: Hoare triple {523#true} ~pc~0.base, ~pc~0.offset := ~#c~0.base, ~#c~0.offset; {523#true} is VALID [2020-07-10 19:02:15,240 INFO L280 TraceCheckUtils]: 18: Hoare triple {523#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {523#true} is VALID [2020-07-10 19:02:15,240 INFO L280 TraceCheckUtils]: 19: Hoare triple {523#true} SUMMARY for call write~int(#t~nondet3, ~#a~0.base, ~#a~0.offset, 4); srcloc: L15-1 {523#true} is VALID [2020-07-10 19:02:15,241 INFO L280 TraceCheckUtils]: 20: Hoare triple {523#true} havoc #t~nondet3; {523#true} is VALID [2020-07-10 19:02:15,241 INFO L280 TraceCheckUtils]: 21: Hoare triple {523#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {523#true} is VALID [2020-07-10 19:02:15,241 INFO L280 TraceCheckUtils]: 22: Hoare triple {523#true} SUMMARY for call write~int(#t~nondet4, ~#b~0.base, ~#b~0.offset, 4); srcloc: L16-1 {523#true} is VALID [2020-07-10 19:02:15,242 INFO L280 TraceCheckUtils]: 23: Hoare triple {523#true} havoc #t~nondet4; {523#true} is VALID [2020-07-10 19:02:15,242 INFO L263 TraceCheckUtils]: 24: Hoare triple {523#true} call #t~ret5.base, #t~ret5.offset := get_dummy(); {523#true} is VALID [2020-07-10 19:02:15,242 INFO L280 TraceCheckUtils]: 25: Hoare triple {523#true} assume 0 != #t~nondet0 % 256; {523#true} is VALID [2020-07-10 19:02:15,242 INFO L280 TraceCheckUtils]: 26: Hoare triple {523#true} #t~ite1.base, #t~ite1.offset := ~#a~0.base, ~#a~0.offset; {523#true} is VALID [2020-07-10 19:02:15,243 INFO L280 TraceCheckUtils]: 27: Hoare triple {523#true} #res.base, #res.offset := #t~ite1.base, #t~ite1.offset; {523#true} is VALID [2020-07-10 19:02:15,243 INFO L280 TraceCheckUtils]: 28: Hoare triple {523#true} havoc #t~nondet0; {523#true} is VALID [2020-07-10 19:02:15,243 INFO L280 TraceCheckUtils]: 29: Hoare triple {523#true} havoc #t~ite1.base, #t~ite1.offset; {523#true} is VALID [2020-07-10 19:02:15,244 INFO L280 TraceCheckUtils]: 30: Hoare triple {523#true} assume true; {523#true} is VALID [2020-07-10 19:02:15,244 INFO L275 TraceCheckUtils]: 31: Hoare quadruple {523#true} {523#true} #94#return; {523#true} is VALID [2020-07-10 19:02:15,244 INFO L280 TraceCheckUtils]: 32: Hoare triple {523#true} ~pb~0.base, ~pb~0.offset := #t~ret5.base, #t~ret5.offset; {523#true} is VALID [2020-07-10 19:02:15,245 INFO L280 TraceCheckUtils]: 33: Hoare triple {523#true} ~pa~0.base, ~pa~0.offset := ~pb~0.base, ~pb~0.offset; {541#(and (= main_~pb~0.offset main_~pa~0.offset) (= main_~pa~0.base main_~pb~0.base))} is VALID [2020-07-10 19:02:15,247 INFO L280 TraceCheckUtils]: 34: Hoare triple {541#(and (= main_~pb~0.offset main_~pa~0.offset) (= main_~pa~0.base main_~pb~0.base))} havoc #t~ret5.base, #t~ret5.offset; {541#(and (= main_~pb~0.offset main_~pa~0.offset) (= main_~pa~0.base main_~pb~0.base))} is VALID [2020-07-10 19:02:15,248 INFO L280 TraceCheckUtils]: 35: Hoare triple {541#(and (= main_~pb~0.offset main_~pa~0.offset) (= main_~pa~0.base main_~pb~0.base))} #t~short9 := ~pc~0.base == 0 && ~pc~0.offset == 0; {541#(and (= main_~pb~0.offset main_~pa~0.offset) (= main_~pa~0.base main_~pb~0.base))} is VALID [2020-07-10 19:02:15,250 INFO L280 TraceCheckUtils]: 36: Hoare triple {541#(and (= main_~pb~0.offset main_~pa~0.offset) (= main_~pa~0.base main_~pb~0.base))} assume !#t~short9; {541#(and (= main_~pb~0.offset main_~pa~0.offset) (= main_~pa~0.base main_~pb~0.base))} is VALID [2020-07-10 19:02:15,252 INFO L280 TraceCheckUtils]: 37: Hoare triple {541#(and (= main_~pb~0.offset main_~pa~0.offset) (= main_~pa~0.base main_~pb~0.base))} #t~short8 := ~pa~0.base == ~pb~0.base && ~pa~0.offset == ~pb~0.offset; {542#|main_#t~short8|} is VALID [2020-07-10 19:02:15,252 INFO L280 TraceCheckUtils]: 38: Hoare triple {542#|main_#t~short8|} assume !#t~short8; {524#false} is VALID [2020-07-10 19:02:15,253 INFO L280 TraceCheckUtils]: 39: Hoare triple {524#false} #t~short9 := #t~short8; {524#false} is VALID [2020-07-10 19:02:15,253 INFO L280 TraceCheckUtils]: 40: Hoare triple {524#false} assume #t~short9; {524#false} is VALID [2020-07-10 19:02:15,253 INFO L280 TraceCheckUtils]: 41: Hoare triple {524#false} havoc #t~mem7; {524#false} is VALID [2020-07-10 19:02:15,254 INFO L280 TraceCheckUtils]: 42: Hoare triple {524#false} havoc #t~short8; {524#false} is VALID [2020-07-10 19:02:15,254 INFO L280 TraceCheckUtils]: 43: Hoare triple {524#false} havoc #t~mem6; {524#false} is VALID [2020-07-10 19:02:15,254 INFO L280 TraceCheckUtils]: 44: Hoare triple {524#false} havoc #t~short9; {524#false} is VALID [2020-07-10 19:02:15,254 INFO L280 TraceCheckUtils]: 45: Hoare triple {524#false} assume !false; {524#false} is VALID [2020-07-10 19:02:15,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 19:02:15,258 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 19:02:15,258 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1185187704] [2020-07-10 19:02:15,259 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 19:02:15,259 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-10 19:02:15,259 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259259496] [2020-07-10 19:02:15,260 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2020-07-10 19:02:15,261 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 19:02:15,261 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-10 19:02:15,309 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 19:02:15,310 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-10 19:02:15,310 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 19:02:15,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-10 19:02:15,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-10 19:02:15,311 INFO L87 Difference]: Start difference. First operand 59 states and 61 transitions. Second operand 5 states. [2020-07-10 19:02:15,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 19:02:15,767 INFO L93 Difference]: Finished difference Result 75 states and 77 transitions. [2020-07-10 19:02:15,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-10 19:02:15,767 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2020-07-10 19:02:15,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 19:02:15,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 19:02:15,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 77 transitions. [2020-07-10 19:02:15,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 19:02:15,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 77 transitions. [2020-07-10 19:02:15,774 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 77 transitions. [2020-07-10 19:02:15,871 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 19:02:15,874 INFO L225 Difference]: With dead ends: 75 [2020-07-10 19:02:15,875 INFO L226 Difference]: Without dead ends: 59 [2020-07-10 19:02:15,878 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-10 19:02:15,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2020-07-10 19:02:16,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2020-07-10 19:02:16,042 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 19:02:16,042 INFO L82 GeneralOperation]: Start isEquivalent. First operand 59 states. Second operand 59 states. [2020-07-10 19:02:16,042 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand 59 states. [2020-07-10 19:02:16,042 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 59 states. [2020-07-10 19:02:16,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 19:02:16,047 INFO L93 Difference]: Finished difference Result 59 states and 60 transitions. [2020-07-10 19:02:16,048 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 60 transitions. [2020-07-10 19:02:16,048 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 19:02:16,048 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 19:02:16,049 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand 59 states. [2020-07-10 19:02:16,049 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 59 states. [2020-07-10 19:02:16,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 19:02:16,063 INFO L93 Difference]: Finished difference Result 59 states and 60 transitions. [2020-07-10 19:02:16,063 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 60 transitions. [2020-07-10 19:02:16,064 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 19:02:16,064 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 19:02:16,064 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 19:02:16,064 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 19:02:16,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2020-07-10 19:02:16,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 60 transitions. [2020-07-10 19:02:16,073 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 60 transitions. Word has length 46 [2020-07-10 19:02:16,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 19:02:16,074 INFO L479 AbstractCegarLoop]: Abstraction has 59 states and 60 transitions. [2020-07-10 19:02:16,074 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-10 19:02:16,074 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 59 states and 60 transitions. [2020-07-10 19:02:16,165 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 19:02:16,165 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 60 transitions. [2020-07-10 19:02:16,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2020-07-10 19:02:16,167 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 19:02:16,168 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] [2020-07-10 19:02:16,168 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-10 19:02:16,168 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 19:02:16,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 19:02:16,169 INFO L82 PathProgramCache]: Analyzing trace with hash 176769226, now seen corresponding path program 1 times [2020-07-10 19:02:16,169 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 19:02:16,169 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [536357377] [2020-07-10 19:02:16,169 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 19:02:16,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 19:02:16,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 19:02:16,309 INFO L280 TraceCheckUtils]: 0: Hoare triple {957#(and (= |~#a~0.base| |old(~#a~0.base)|) (= |~#b~0.base| |old(~#b~0.base)|) (= |#valid| |old(#valid)|) (= |~#b~0.offset| |old(~#b~0.offset)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |~#a~0.offset| |old(~#a~0.offset)|) (= |old(#length)| |#length|))} #NULL.base, #NULL.offset := 0, 0; {934#true} is VALID [2020-07-10 19:02:16,309 INFO L280 TraceCheckUtils]: 1: Hoare triple {934#true} #valid := #valid[0 := 0]; {934#true} is VALID [2020-07-10 19:02:16,310 INFO L280 TraceCheckUtils]: 2: Hoare triple {934#true} assume 0 < #StackHeapBarrier; {934#true} is VALID [2020-07-10 19:02:16,310 INFO L280 TraceCheckUtils]: 3: Hoare triple {934#true} SUMMARY for call ~#a~0.base, ~#a~0.offset := #Ultimate.allocOnStack(4); srcloc: L5 {934#true} is VALID [2020-07-10 19:02:16,310 INFO L280 TraceCheckUtils]: 4: Hoare triple {934#true} SUMMARY for call write~init~int(0, ~#a~0.base, ~#a~0.offset, 4); srcloc: L5-1 {934#true} is VALID [2020-07-10 19:02:16,311 INFO L280 TraceCheckUtils]: 5: Hoare triple {934#true} SUMMARY for call ~#b~0.base, ~#b~0.offset := #Ultimate.allocOnStack(4); srcloc: L5-2 {934#true} is VALID [2020-07-10 19:02:16,311 INFO L280 TraceCheckUtils]: 6: Hoare triple {934#true} SUMMARY for call write~init~int(0, ~#b~0.base, ~#b~0.offset, 4); srcloc: L5-3 {934#true} is VALID [2020-07-10 19:02:16,311 INFO L280 TraceCheckUtils]: 7: Hoare triple {934#true} assume true; {934#true} is VALID [2020-07-10 19:02:16,312 INFO L275 TraceCheckUtils]: 8: Hoare quadruple {934#true} {934#true} #90#return; {934#true} is VALID [2020-07-10 19:02:16,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 19:02:16,320 INFO L280 TraceCheckUtils]: 0: Hoare triple {934#true} assume 0 != #t~nondet0 % 256; {934#true} is VALID [2020-07-10 19:02:16,321 INFO L280 TraceCheckUtils]: 1: Hoare triple {934#true} #t~ite1.base, #t~ite1.offset := ~#a~0.base, ~#a~0.offset; {934#true} is VALID [2020-07-10 19:02:16,321 INFO L280 TraceCheckUtils]: 2: Hoare triple {934#true} #res.base, #res.offset := #t~ite1.base, #t~ite1.offset; {934#true} is VALID [2020-07-10 19:02:16,321 INFO L280 TraceCheckUtils]: 3: Hoare triple {934#true} havoc #t~nondet0; {934#true} is VALID [2020-07-10 19:02:16,321 INFO L280 TraceCheckUtils]: 4: Hoare triple {934#true} havoc #t~ite1.base, #t~ite1.offset; {934#true} is VALID [2020-07-10 19:02:16,322 INFO L280 TraceCheckUtils]: 5: Hoare triple {934#true} assume true; {934#true} is VALID [2020-07-10 19:02:16,322 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {934#true} {934#true} #94#return; {934#true} is VALID [2020-07-10 19:02:16,324 INFO L263 TraceCheckUtils]: 0: Hoare triple {934#true} call ULTIMATE.init(); {957#(and (= |~#a~0.base| |old(~#a~0.base)|) (= |~#b~0.base| |old(~#b~0.base)|) (= |#valid| |old(#valid)|) (= |~#b~0.offset| |old(~#b~0.offset)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |~#a~0.offset| |old(~#a~0.offset)|) (= |old(#length)| |#length|))} is VALID [2020-07-10 19:02:16,324 INFO L280 TraceCheckUtils]: 1: Hoare triple {957#(and (= |~#a~0.base| |old(~#a~0.base)|) (= |~#b~0.base| |old(~#b~0.base)|) (= |#valid| |old(#valid)|) (= |~#b~0.offset| |old(~#b~0.offset)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |~#a~0.offset| |old(~#a~0.offset)|) (= |old(#length)| |#length|))} #NULL.base, #NULL.offset := 0, 0; {934#true} is VALID [2020-07-10 19:02:16,324 INFO L280 TraceCheckUtils]: 2: Hoare triple {934#true} #valid := #valid[0 := 0]; {934#true} is VALID [2020-07-10 19:02:16,324 INFO L280 TraceCheckUtils]: 3: Hoare triple {934#true} assume 0 < #StackHeapBarrier; {934#true} is VALID [2020-07-10 19:02:16,325 INFO L280 TraceCheckUtils]: 4: Hoare triple {934#true} SUMMARY for call ~#a~0.base, ~#a~0.offset := #Ultimate.allocOnStack(4); srcloc: L5 {934#true} is VALID [2020-07-10 19:02:16,325 INFO L280 TraceCheckUtils]: 5: Hoare triple {934#true} SUMMARY for call write~init~int(0, ~#a~0.base, ~#a~0.offset, 4); srcloc: L5-1 {934#true} is VALID [2020-07-10 19:02:16,325 INFO L280 TraceCheckUtils]: 6: Hoare triple {934#true} SUMMARY for call ~#b~0.base, ~#b~0.offset := #Ultimate.allocOnStack(4); srcloc: L5-2 {934#true} is VALID [2020-07-10 19:02:16,325 INFO L280 TraceCheckUtils]: 7: Hoare triple {934#true} SUMMARY for call write~init~int(0, ~#b~0.base, ~#b~0.offset, 4); srcloc: L5-3 {934#true} is VALID [2020-07-10 19:02:16,325 INFO L280 TraceCheckUtils]: 8: Hoare triple {934#true} assume true; {934#true} is VALID [2020-07-10 19:02:16,326 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {934#true} {934#true} #90#return; {934#true} is VALID [2020-07-10 19:02:16,326 INFO L263 TraceCheckUtils]: 10: Hoare triple {934#true} call #t~ret11 := main(); {934#true} is VALID [2020-07-10 19:02:16,326 INFO L280 TraceCheckUtils]: 11: Hoare triple {934#true} SUMMARY for call ~#c~0.base, ~#c~0.offset := #Ultimate.allocOnStack(4); srcloc: mainENTRY {934#true} is VALID [2020-07-10 19:02:16,326 INFO L280 TraceCheckUtils]: 12: Hoare triple {934#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {934#true} is VALID [2020-07-10 19:02:16,326 INFO L280 TraceCheckUtils]: 13: Hoare triple {934#true} SUMMARY for call write~init~int(#t~nondet2, ~#c~0.base, ~#c~0.offset, 4); srcloc: L13-1 {934#true} is VALID [2020-07-10 19:02:16,327 INFO L280 TraceCheckUtils]: 14: Hoare triple {934#true} havoc #t~nondet2; {934#true} is VALID [2020-07-10 19:02:16,327 INFO L280 TraceCheckUtils]: 15: Hoare triple {934#true} havoc ~pa~0.base, ~pa~0.offset; {934#true} is VALID [2020-07-10 19:02:16,327 INFO L280 TraceCheckUtils]: 16: Hoare triple {934#true} havoc ~pb~0.base, ~pb~0.offset; {934#true} is VALID [2020-07-10 19:02:16,327 INFO L280 TraceCheckUtils]: 17: Hoare triple {934#true} ~pc~0.base, ~pc~0.offset := ~#c~0.base, ~#c~0.offset; {934#true} is VALID [2020-07-10 19:02:16,327 INFO L280 TraceCheckUtils]: 18: Hoare triple {934#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {934#true} is VALID [2020-07-10 19:02:16,328 INFO L280 TraceCheckUtils]: 19: Hoare triple {934#true} SUMMARY for call write~int(#t~nondet3, ~#a~0.base, ~#a~0.offset, 4); srcloc: L15-1 {934#true} is VALID [2020-07-10 19:02:16,328 INFO L280 TraceCheckUtils]: 20: Hoare triple {934#true} havoc #t~nondet3; {934#true} is VALID [2020-07-10 19:02:16,328 INFO L280 TraceCheckUtils]: 21: Hoare triple {934#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {934#true} is VALID [2020-07-10 19:02:16,328 INFO L280 TraceCheckUtils]: 22: Hoare triple {934#true} SUMMARY for call write~int(#t~nondet4, ~#b~0.base, ~#b~0.offset, 4); srcloc: L16-1 {934#true} is VALID [2020-07-10 19:02:16,329 INFO L280 TraceCheckUtils]: 23: Hoare triple {934#true} havoc #t~nondet4; {934#true} is VALID [2020-07-10 19:02:16,329 INFO L263 TraceCheckUtils]: 24: Hoare triple {934#true} call #t~ret5.base, #t~ret5.offset := get_dummy(); {934#true} is VALID [2020-07-10 19:02:16,329 INFO L280 TraceCheckUtils]: 25: Hoare triple {934#true} assume 0 != #t~nondet0 % 256; {934#true} is VALID [2020-07-10 19:02:16,329 INFO L280 TraceCheckUtils]: 26: Hoare triple {934#true} #t~ite1.base, #t~ite1.offset := ~#a~0.base, ~#a~0.offset; {934#true} is VALID [2020-07-10 19:02:16,330 INFO L280 TraceCheckUtils]: 27: Hoare triple {934#true} #res.base, #res.offset := #t~ite1.base, #t~ite1.offset; {934#true} is VALID [2020-07-10 19:02:16,330 INFO L280 TraceCheckUtils]: 28: Hoare triple {934#true} havoc #t~nondet0; {934#true} is VALID [2020-07-10 19:02:16,330 INFO L280 TraceCheckUtils]: 29: Hoare triple {934#true} havoc #t~ite1.base, #t~ite1.offset; {934#true} is VALID [2020-07-10 19:02:16,330 INFO L280 TraceCheckUtils]: 30: Hoare triple {934#true} assume true; {934#true} is VALID [2020-07-10 19:02:16,331 INFO L275 TraceCheckUtils]: 31: Hoare quadruple {934#true} {934#true} #94#return; {934#true} is VALID [2020-07-10 19:02:16,331 INFO L280 TraceCheckUtils]: 32: Hoare triple {934#true} ~pb~0.base, ~pb~0.offset := #t~ret5.base, #t~ret5.offset; {934#true} is VALID [2020-07-10 19:02:16,332 INFO L280 TraceCheckUtils]: 33: Hoare triple {934#true} ~pa~0.base, ~pa~0.offset := ~pb~0.base, ~pb~0.offset; {952#(and (= main_~pb~0.offset main_~pa~0.offset) (= main_~pa~0.base main_~pb~0.base))} is VALID [2020-07-10 19:02:16,334 INFO L280 TraceCheckUtils]: 34: Hoare triple {952#(and (= main_~pb~0.offset main_~pa~0.offset) (= main_~pa~0.base main_~pb~0.base))} havoc #t~ret5.base, #t~ret5.offset; {952#(and (= main_~pb~0.offset main_~pa~0.offset) (= main_~pa~0.base main_~pb~0.base))} is VALID [2020-07-10 19:02:16,335 INFO L280 TraceCheckUtils]: 35: Hoare triple {952#(and (= main_~pb~0.offset main_~pa~0.offset) (= main_~pa~0.base main_~pb~0.base))} #t~short9 := ~pc~0.base == 0 && ~pc~0.offset == 0; {952#(and (= main_~pb~0.offset main_~pa~0.offset) (= main_~pa~0.base main_~pb~0.base))} is VALID [2020-07-10 19:02:16,336 INFO L280 TraceCheckUtils]: 36: Hoare triple {952#(and (= main_~pb~0.offset main_~pa~0.offset) (= main_~pa~0.base main_~pb~0.base))} assume !#t~short9; {952#(and (= main_~pb~0.offset main_~pa~0.offset) (= main_~pa~0.base main_~pb~0.base))} is VALID [2020-07-10 19:02:16,337 INFO L280 TraceCheckUtils]: 37: Hoare triple {952#(and (= main_~pb~0.offset main_~pa~0.offset) (= main_~pa~0.base main_~pb~0.base))} #t~short8 := ~pa~0.base == ~pb~0.base && ~pa~0.offset == ~pb~0.offset; {952#(and (= main_~pb~0.offset main_~pa~0.offset) (= main_~pa~0.base main_~pb~0.base))} is VALID [2020-07-10 19:02:16,338 INFO L280 TraceCheckUtils]: 38: Hoare triple {952#(and (= main_~pb~0.offset main_~pa~0.offset) (= main_~pa~0.base main_~pb~0.base))} assume #t~short8; {952#(and (= main_~pb~0.offset main_~pa~0.offset) (= main_~pa~0.base main_~pb~0.base))} is VALID [2020-07-10 19:02:16,338 INFO L280 TraceCheckUtils]: 39: Hoare triple {952#(and (= main_~pb~0.offset main_~pa~0.offset) (= main_~pa~0.base main_~pb~0.base))} SUMMARY for call #t~mem6 := read~int(~pa~0.base, ~pa~0.offset, 4); srcloc: L19-2 {953#(= (select (select |#memory_int| main_~pb~0.base) main_~pb~0.offset) |main_#t~mem6|)} is VALID [2020-07-10 19:02:16,339 INFO L280 TraceCheckUtils]: 40: Hoare triple {953#(= (select (select |#memory_int| main_~pb~0.base) main_~pb~0.offset) |main_#t~mem6|)} SUMMARY for call #t~mem7 := read~int(~pb~0.base, ~pb~0.offset, 4); srcloc: L19-3 {954#(= |main_#t~mem7| |main_#t~mem6|)} is VALID [2020-07-10 19:02:16,339 INFO L280 TraceCheckUtils]: 41: Hoare triple {954#(= |main_#t~mem7| |main_#t~mem6|)} #t~short8 := #t~mem6 != #t~mem7; {955#(not |main_#t~short8|)} is VALID [2020-07-10 19:02:16,340 INFO L280 TraceCheckUtils]: 42: Hoare triple {955#(not |main_#t~short8|)} #t~short9 := #t~short8; {956#(not |main_#t~short9|)} is VALID [2020-07-10 19:02:16,340 INFO L280 TraceCheckUtils]: 43: Hoare triple {956#(not |main_#t~short9|)} assume #t~short9; {935#false} is VALID [2020-07-10 19:02:16,341 INFO L280 TraceCheckUtils]: 44: Hoare triple {935#false} havoc #t~mem7; {935#false} is VALID [2020-07-10 19:02:16,341 INFO L280 TraceCheckUtils]: 45: Hoare triple {935#false} havoc #t~short8; {935#false} is VALID [2020-07-10 19:02:16,341 INFO L280 TraceCheckUtils]: 46: Hoare triple {935#false} havoc #t~mem6; {935#false} is VALID [2020-07-10 19:02:16,341 INFO L280 TraceCheckUtils]: 47: Hoare triple {935#false} havoc #t~short9; {935#false} is VALID [2020-07-10 19:02:16,341 INFO L280 TraceCheckUtils]: 48: Hoare triple {935#false} assume !false; {935#false} is VALID [2020-07-10 19:02:16,345 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 19:02:16,345 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 19:02:16,345 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [536357377] [2020-07-10 19:02:16,346 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 19:02:16,346 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-07-10 19:02:16,346 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634115087] [2020-07-10 19:02:16,347 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 49 [2020-07-10 19:02:16,347 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 19:02:16,347 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-10 19:02:16,412 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 19:02:16,412 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-10 19:02:16,413 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 19:02:16,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-10 19:02:16,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2020-07-10 19:02:16,414 INFO L87 Difference]: Start difference. First operand 59 states and 60 transitions. Second operand 8 states. [2020-07-10 19:02:17,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 19:02:17,104 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2020-07-10 19:02:17,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-10 19:02:17,104 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 49 [2020-07-10 19:02:17,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 19:02:17,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-10 19:02:17,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 61 transitions. [2020-07-10 19:02:17,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-10 19:02:17,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 61 transitions. [2020-07-10 19:02:17,116 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 61 transitions. [2020-07-10 19:02:17,186 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 19:02:17,189 INFO L225 Difference]: With dead ends: 61 [2020-07-10 19:02:17,189 INFO L226 Difference]: Without dead ends: 55 [2020-07-10 19:02:17,190 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2020-07-10 19:02:17,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2020-07-10 19:02:17,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2020-07-10 19:02:17,298 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 19:02:17,298 INFO L82 GeneralOperation]: Start isEquivalent. First operand 55 states. Second operand 55 states. [2020-07-10 19:02:17,298 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand 55 states. [2020-07-10 19:02:17,298 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 55 states. [2020-07-10 19:02:17,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 19:02:17,303 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2020-07-10 19:02:17,303 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2020-07-10 19:02:17,304 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 19:02:17,304 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 19:02:17,304 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand 55 states. [2020-07-10 19:02:17,304 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 55 states. [2020-07-10 19:02:17,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 19:02:17,307 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2020-07-10 19:02:17,308 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2020-07-10 19:02:17,308 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 19:02:17,308 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 19:02:17,309 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 19:02:17,309 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 19:02:17,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2020-07-10 19:02:17,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2020-07-10 19:02:17,312 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 49 [2020-07-10 19:02:17,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 19:02:17,312 INFO L479 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2020-07-10 19:02:17,312 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-10 19:02:17,312 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 55 states and 55 transitions. [2020-07-10 19:02:17,398 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-10 19:02:17,399 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2020-07-10 19:02:17,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2020-07-10 19:02:17,401 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 19:02:17,401 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] [2020-07-10 19:02:17,401 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-10 19:02:17,401 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 19:02:17,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 19:02:17,402 INFO L82 PathProgramCache]: Analyzing trace with hash -1988535102, now seen corresponding path program 1 times [2020-07-10 19:02:17,402 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 19:02:17,402 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [27868933] [2020-07-10 19:02:17,402 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 19:02:17,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 19:02:17,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 19:02:17,538 INFO L280 TraceCheckUtils]: 0: Hoare triple {1333#(and (= |~#a~0.base| |old(~#a~0.base)|) (= |~#b~0.base| |old(~#b~0.base)|) (= |#valid| |old(#valid)|) (= |~#b~0.offset| |old(~#b~0.offset)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |~#a~0.offset| |old(~#a~0.offset)|) (= |old(#length)| |#length|))} #NULL.base, #NULL.offset := 0, 0; {1312#true} is VALID [2020-07-10 19:02:17,538 INFO L280 TraceCheckUtils]: 1: Hoare triple {1312#true} #valid := #valid[0 := 0]; {1312#true} is VALID [2020-07-10 19:02:17,538 INFO L280 TraceCheckUtils]: 2: Hoare triple {1312#true} assume 0 < #StackHeapBarrier; {1312#true} is VALID [2020-07-10 19:02:17,539 INFO L280 TraceCheckUtils]: 3: Hoare triple {1312#true} SUMMARY for call ~#a~0.base, ~#a~0.offset := #Ultimate.allocOnStack(4); srcloc: L5 {1312#true} is VALID [2020-07-10 19:02:17,539 INFO L280 TraceCheckUtils]: 4: Hoare triple {1312#true} SUMMARY for call write~init~int(0, ~#a~0.base, ~#a~0.offset, 4); srcloc: L5-1 {1312#true} is VALID [2020-07-10 19:02:17,539 INFO L280 TraceCheckUtils]: 5: Hoare triple {1312#true} SUMMARY for call ~#b~0.base, ~#b~0.offset := #Ultimate.allocOnStack(4); srcloc: L5-2 {1312#true} is VALID [2020-07-10 19:02:17,540 INFO L280 TraceCheckUtils]: 6: Hoare triple {1312#true} SUMMARY for call write~init~int(0, ~#b~0.base, ~#b~0.offset, 4); srcloc: L5-3 {1312#true} is VALID [2020-07-10 19:02:17,540 INFO L280 TraceCheckUtils]: 7: Hoare triple {1312#true} assume true; {1312#true} is VALID [2020-07-10 19:02:17,544 INFO L275 TraceCheckUtils]: 8: Hoare quadruple {1312#true} {1312#true} #90#return; {1312#true} is VALID [2020-07-10 19:02:17,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 19:02:17,560 INFO L280 TraceCheckUtils]: 0: Hoare triple {1312#true} assume 0 != #t~nondet0 % 256; {1312#true} is VALID [2020-07-10 19:02:17,561 INFO L280 TraceCheckUtils]: 1: Hoare triple {1312#true} #t~ite1.base, #t~ite1.offset := ~#a~0.base, ~#a~0.offset; {1312#true} is VALID [2020-07-10 19:02:17,561 INFO L280 TraceCheckUtils]: 2: Hoare triple {1312#true} #res.base, #res.offset := #t~ite1.base, #t~ite1.offset; {1312#true} is VALID [2020-07-10 19:02:17,561 INFO L280 TraceCheckUtils]: 3: Hoare triple {1312#true} havoc #t~nondet0; {1312#true} is VALID [2020-07-10 19:02:17,562 INFO L280 TraceCheckUtils]: 4: Hoare triple {1312#true} havoc #t~ite1.base, #t~ite1.offset; {1312#true} is VALID [2020-07-10 19:02:17,562 INFO L280 TraceCheckUtils]: 5: Hoare triple {1312#true} assume true; {1312#true} is VALID [2020-07-10 19:02:17,563 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {1312#true} {1323#(and (= |main_~#c~0.offset| main_~pc~0.offset) (= main_~pc~0.base |main_~#c~0.base|))} #94#return; {1323#(and (= |main_~#c~0.offset| main_~pc~0.offset) (= main_~pc~0.base |main_~#c~0.base|))} is VALID [2020-07-10 19:02:17,564 INFO L263 TraceCheckUtils]: 0: Hoare triple {1312#true} call ULTIMATE.init(); {1333#(and (= |~#a~0.base| |old(~#a~0.base)|) (= |~#b~0.base| |old(~#b~0.base)|) (= |#valid| |old(#valid)|) (= |~#b~0.offset| |old(~#b~0.offset)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |~#a~0.offset| |old(~#a~0.offset)|) (= |old(#length)| |#length|))} is VALID [2020-07-10 19:02:17,565 INFO L280 TraceCheckUtils]: 1: Hoare triple {1333#(and (= |~#a~0.base| |old(~#a~0.base)|) (= |~#b~0.base| |old(~#b~0.base)|) (= |#valid| |old(#valid)|) (= |~#b~0.offset| |old(~#b~0.offset)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |~#a~0.offset| |old(~#a~0.offset)|) (= |old(#length)| |#length|))} #NULL.base, #NULL.offset := 0, 0; {1312#true} is VALID [2020-07-10 19:02:17,565 INFO L280 TraceCheckUtils]: 2: Hoare triple {1312#true} #valid := #valid[0 := 0]; {1312#true} is VALID [2020-07-10 19:02:17,565 INFO L280 TraceCheckUtils]: 3: Hoare triple {1312#true} assume 0 < #StackHeapBarrier; {1312#true} is VALID [2020-07-10 19:02:17,566 INFO L280 TraceCheckUtils]: 4: Hoare triple {1312#true} SUMMARY for call ~#a~0.base, ~#a~0.offset := #Ultimate.allocOnStack(4); srcloc: L5 {1312#true} is VALID [2020-07-10 19:02:17,566 INFO L280 TraceCheckUtils]: 5: Hoare triple {1312#true} SUMMARY for call write~init~int(0, ~#a~0.base, ~#a~0.offset, 4); srcloc: L5-1 {1312#true} is VALID [2020-07-10 19:02:17,566 INFO L280 TraceCheckUtils]: 6: Hoare triple {1312#true} SUMMARY for call ~#b~0.base, ~#b~0.offset := #Ultimate.allocOnStack(4); srcloc: L5-2 {1312#true} is VALID [2020-07-10 19:02:17,567 INFO L280 TraceCheckUtils]: 7: Hoare triple {1312#true} SUMMARY for call write~init~int(0, ~#b~0.base, ~#b~0.offset, 4); srcloc: L5-3 {1312#true} is VALID [2020-07-10 19:02:17,567 INFO L280 TraceCheckUtils]: 8: Hoare triple {1312#true} assume true; {1312#true} is VALID [2020-07-10 19:02:17,567 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {1312#true} {1312#true} #90#return; {1312#true} is VALID [2020-07-10 19:02:17,567 INFO L263 TraceCheckUtils]: 10: Hoare triple {1312#true} call #t~ret11 := main(); {1312#true} is VALID [2020-07-10 19:02:17,568 INFO L280 TraceCheckUtils]: 11: Hoare triple {1312#true} SUMMARY for call ~#c~0.base, ~#c~0.offset := #Ultimate.allocOnStack(4); srcloc: mainENTRY {1312#true} is VALID [2020-07-10 19:02:17,568 INFO L280 TraceCheckUtils]: 12: Hoare triple {1312#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {1312#true} is VALID [2020-07-10 19:02:17,568 INFO L280 TraceCheckUtils]: 13: Hoare triple {1312#true} SUMMARY for call write~init~int(#t~nondet2, ~#c~0.base, ~#c~0.offset, 4); srcloc: L13-1 {1312#true} is VALID [2020-07-10 19:02:17,569 INFO L280 TraceCheckUtils]: 14: Hoare triple {1312#true} havoc #t~nondet2; {1312#true} is VALID [2020-07-10 19:02:17,569 INFO L280 TraceCheckUtils]: 15: Hoare triple {1312#true} havoc ~pa~0.base, ~pa~0.offset; {1312#true} is VALID [2020-07-10 19:02:17,569 INFO L280 TraceCheckUtils]: 16: Hoare triple {1312#true} havoc ~pb~0.base, ~pb~0.offset; {1312#true} is VALID [2020-07-10 19:02:17,570 INFO L280 TraceCheckUtils]: 17: Hoare triple {1312#true} ~pc~0.base, ~pc~0.offset := ~#c~0.base, ~#c~0.offset; {1323#(and (= |main_~#c~0.offset| main_~pc~0.offset) (= main_~pc~0.base |main_~#c~0.base|))} is VALID [2020-07-10 19:02:17,571 INFO L280 TraceCheckUtils]: 18: Hoare triple {1323#(and (= |main_~#c~0.offset| main_~pc~0.offset) (= main_~pc~0.base |main_~#c~0.base|))} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {1323#(and (= |main_~#c~0.offset| main_~pc~0.offset) (= main_~pc~0.base |main_~#c~0.base|))} is VALID [2020-07-10 19:02:17,572 INFO L280 TraceCheckUtils]: 19: Hoare triple {1323#(and (= |main_~#c~0.offset| main_~pc~0.offset) (= main_~pc~0.base |main_~#c~0.base|))} SUMMARY for call write~int(#t~nondet3, ~#a~0.base, ~#a~0.offset, 4); srcloc: L15-1 {1323#(and (= |main_~#c~0.offset| main_~pc~0.offset) (= main_~pc~0.base |main_~#c~0.base|))} is VALID [2020-07-10 19:02:17,572 INFO L280 TraceCheckUtils]: 20: Hoare triple {1323#(and (= |main_~#c~0.offset| main_~pc~0.offset) (= main_~pc~0.base |main_~#c~0.base|))} havoc #t~nondet3; {1323#(and (= |main_~#c~0.offset| main_~pc~0.offset) (= main_~pc~0.base |main_~#c~0.base|))} is VALID [2020-07-10 19:02:17,573 INFO L280 TraceCheckUtils]: 21: Hoare triple {1323#(and (= |main_~#c~0.offset| main_~pc~0.offset) (= main_~pc~0.base |main_~#c~0.base|))} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {1323#(and (= |main_~#c~0.offset| main_~pc~0.offset) (= main_~pc~0.base |main_~#c~0.base|))} is VALID [2020-07-10 19:02:17,574 INFO L280 TraceCheckUtils]: 22: Hoare triple {1323#(and (= |main_~#c~0.offset| main_~pc~0.offset) (= main_~pc~0.base |main_~#c~0.base|))} SUMMARY for call write~int(#t~nondet4, ~#b~0.base, ~#b~0.offset, 4); srcloc: L16-1 {1323#(and (= |main_~#c~0.offset| main_~pc~0.offset) (= main_~pc~0.base |main_~#c~0.base|))} is VALID [2020-07-10 19:02:17,575 INFO L280 TraceCheckUtils]: 23: Hoare triple {1323#(and (= |main_~#c~0.offset| main_~pc~0.offset) (= main_~pc~0.base |main_~#c~0.base|))} havoc #t~nondet4; {1323#(and (= |main_~#c~0.offset| main_~pc~0.offset) (= main_~pc~0.base |main_~#c~0.base|))} is VALID [2020-07-10 19:02:17,575 INFO L263 TraceCheckUtils]: 24: Hoare triple {1323#(and (= |main_~#c~0.offset| main_~pc~0.offset) (= main_~pc~0.base |main_~#c~0.base|))} call #t~ret5.base, #t~ret5.offset := get_dummy(); {1312#true} is VALID [2020-07-10 19:02:17,575 INFO L280 TraceCheckUtils]: 25: Hoare triple {1312#true} assume 0 != #t~nondet0 % 256; {1312#true} is VALID [2020-07-10 19:02:17,576 INFO L280 TraceCheckUtils]: 26: Hoare triple {1312#true} #t~ite1.base, #t~ite1.offset := ~#a~0.base, ~#a~0.offset; {1312#true} is VALID [2020-07-10 19:02:17,576 INFO L280 TraceCheckUtils]: 27: Hoare triple {1312#true} #res.base, #res.offset := #t~ite1.base, #t~ite1.offset; {1312#true} is VALID [2020-07-10 19:02:17,576 INFO L280 TraceCheckUtils]: 28: Hoare triple {1312#true} havoc #t~nondet0; {1312#true} is VALID [2020-07-10 19:02:17,576 INFO L280 TraceCheckUtils]: 29: Hoare triple {1312#true} havoc #t~ite1.base, #t~ite1.offset; {1312#true} is VALID [2020-07-10 19:02:17,577 INFO L280 TraceCheckUtils]: 30: Hoare triple {1312#true} assume true; {1312#true} is VALID [2020-07-10 19:02:17,578 INFO L275 TraceCheckUtils]: 31: Hoare quadruple {1312#true} {1323#(and (= |main_~#c~0.offset| main_~pc~0.offset) (= main_~pc~0.base |main_~#c~0.base|))} #94#return; {1323#(and (= |main_~#c~0.offset| main_~pc~0.offset) (= main_~pc~0.base |main_~#c~0.base|))} is VALID [2020-07-10 19:02:17,578 INFO L280 TraceCheckUtils]: 32: Hoare triple {1323#(and (= |main_~#c~0.offset| main_~pc~0.offset) (= main_~pc~0.base |main_~#c~0.base|))} ~pb~0.base, ~pb~0.offset := #t~ret5.base, #t~ret5.offset; {1323#(and (= |main_~#c~0.offset| main_~pc~0.offset) (= main_~pc~0.base |main_~#c~0.base|))} is VALID [2020-07-10 19:02:17,579 INFO L280 TraceCheckUtils]: 33: Hoare triple {1323#(and (= |main_~#c~0.offset| main_~pc~0.offset) (= main_~pc~0.base |main_~#c~0.base|))} ~pa~0.base, ~pa~0.offset := ~pb~0.base, ~pb~0.offset; {1323#(and (= |main_~#c~0.offset| main_~pc~0.offset) (= main_~pc~0.base |main_~#c~0.base|))} is VALID [2020-07-10 19:02:17,580 INFO L280 TraceCheckUtils]: 34: Hoare triple {1323#(and (= |main_~#c~0.offset| main_~pc~0.offset) (= main_~pc~0.base |main_~#c~0.base|))} havoc #t~ret5.base, #t~ret5.offset; {1323#(and (= |main_~#c~0.offset| main_~pc~0.offset) (= main_~pc~0.base |main_~#c~0.base|))} is VALID [2020-07-10 19:02:17,580 INFO L280 TraceCheckUtils]: 35: Hoare triple {1323#(and (= |main_~#c~0.offset| main_~pc~0.offset) (= main_~pc~0.base |main_~#c~0.base|))} #t~short9 := ~pc~0.base == 0 && ~pc~0.offset == 0; {1323#(and (= |main_~#c~0.offset| main_~pc~0.offset) (= main_~pc~0.base |main_~#c~0.base|))} is VALID [2020-07-10 19:02:17,581 INFO L280 TraceCheckUtils]: 36: Hoare triple {1323#(and (= |main_~#c~0.offset| main_~pc~0.offset) (= main_~pc~0.base |main_~#c~0.base|))} assume !#t~short9; {1323#(and (= |main_~#c~0.offset| main_~pc~0.offset) (= main_~pc~0.base |main_~#c~0.base|))} is VALID [2020-07-10 19:02:17,582 INFO L280 TraceCheckUtils]: 37: Hoare triple {1323#(and (= |main_~#c~0.offset| main_~pc~0.offset) (= main_~pc~0.base |main_~#c~0.base|))} #t~short8 := ~pa~0.base == ~pb~0.base && ~pa~0.offset == ~pb~0.offset; {1323#(and (= |main_~#c~0.offset| main_~pc~0.offset) (= main_~pc~0.base |main_~#c~0.base|))} is VALID [2020-07-10 19:02:17,582 INFO L280 TraceCheckUtils]: 38: Hoare triple {1323#(and (= |main_~#c~0.offset| main_~pc~0.offset) (= main_~pc~0.base |main_~#c~0.base|))} assume #t~short8; {1323#(and (= |main_~#c~0.offset| main_~pc~0.offset) (= main_~pc~0.base |main_~#c~0.base|))} is VALID [2020-07-10 19:02:17,583 INFO L280 TraceCheckUtils]: 39: Hoare triple {1323#(and (= |main_~#c~0.offset| main_~pc~0.offset) (= main_~pc~0.base |main_~#c~0.base|))} SUMMARY for call #t~mem6 := read~int(~pa~0.base, ~pa~0.offset, 4); srcloc: L19-2 {1323#(and (= |main_~#c~0.offset| main_~pc~0.offset) (= main_~pc~0.base |main_~#c~0.base|))} is VALID [2020-07-10 19:02:17,585 INFO L280 TraceCheckUtils]: 40: Hoare triple {1323#(and (= |main_~#c~0.offset| main_~pc~0.offset) (= main_~pc~0.base |main_~#c~0.base|))} SUMMARY for call #t~mem7 := read~int(~pb~0.base, ~pb~0.offset, 4); srcloc: L19-3 {1323#(and (= |main_~#c~0.offset| main_~pc~0.offset) (= main_~pc~0.base |main_~#c~0.base|))} is VALID [2020-07-10 19:02:17,586 INFO L280 TraceCheckUtils]: 41: Hoare triple {1323#(and (= |main_~#c~0.offset| main_~pc~0.offset) (= main_~pc~0.base |main_~#c~0.base|))} #t~short8 := #t~mem6 != #t~mem7; {1323#(and (= |main_~#c~0.offset| main_~pc~0.offset) (= main_~pc~0.base |main_~#c~0.base|))} is VALID [2020-07-10 19:02:17,588 INFO L280 TraceCheckUtils]: 42: Hoare triple {1323#(and (= |main_~#c~0.offset| main_~pc~0.offset) (= main_~pc~0.base |main_~#c~0.base|))} #t~short9 := #t~short8; {1323#(and (= |main_~#c~0.offset| main_~pc~0.offset) (= main_~pc~0.base |main_~#c~0.base|))} is VALID [2020-07-10 19:02:17,590 INFO L280 TraceCheckUtils]: 43: Hoare triple {1323#(and (= |main_~#c~0.offset| main_~pc~0.offset) (= main_~pc~0.base |main_~#c~0.base|))} assume !#t~short9; {1323#(and (= |main_~#c~0.offset| main_~pc~0.offset) (= main_~pc~0.base |main_~#c~0.base|))} is VALID [2020-07-10 19:02:17,592 INFO L280 TraceCheckUtils]: 44: Hoare triple {1323#(and (= |main_~#c~0.offset| main_~pc~0.offset) (= main_~pc~0.base |main_~#c~0.base|))} havoc #t~mem7; {1323#(and (= |main_~#c~0.offset| main_~pc~0.offset) (= main_~pc~0.base |main_~#c~0.base|))} is VALID [2020-07-10 19:02:17,594 INFO L280 TraceCheckUtils]: 45: Hoare triple {1323#(and (= |main_~#c~0.offset| main_~pc~0.offset) (= main_~pc~0.base |main_~#c~0.base|))} havoc #t~short8; {1323#(and (= |main_~#c~0.offset| main_~pc~0.offset) (= main_~pc~0.base |main_~#c~0.base|))} is VALID [2020-07-10 19:02:17,594 INFO L280 TraceCheckUtils]: 46: Hoare triple {1323#(and (= |main_~#c~0.offset| main_~pc~0.offset) (= main_~pc~0.base |main_~#c~0.base|))} havoc #t~mem6; {1323#(and (= |main_~#c~0.offset| main_~pc~0.offset) (= main_~pc~0.base |main_~#c~0.base|))} is VALID [2020-07-10 19:02:17,595 INFO L280 TraceCheckUtils]: 47: Hoare triple {1323#(and (= |main_~#c~0.offset| main_~pc~0.offset) (= main_~pc~0.base |main_~#c~0.base|))} havoc #t~short9; {1323#(and (= |main_~#c~0.offset| main_~pc~0.offset) (= main_~pc~0.base |main_~#c~0.base|))} is VALID [2020-07-10 19:02:17,596 INFO L280 TraceCheckUtils]: 48: Hoare triple {1323#(and (= |main_~#c~0.offset| main_~pc~0.offset) (= main_~pc~0.base |main_~#c~0.base|))} SUMMARY for call write~int(60, ~pc~0.base, ~pc~0.offset, 4); srcloc: L23 {1331#(= (select (select |#memory_int| |main_~#c~0.base|) |main_~#c~0.offset|) 60)} is VALID [2020-07-10 19:02:17,597 INFO L280 TraceCheckUtils]: 49: Hoare triple {1331#(= (select (select |#memory_int| |main_~#c~0.base|) |main_~#c~0.offset|) 60)} SUMMARY for call #t~mem10 := read~int(~#c~0.base, ~#c~0.offset, 4); srcloc: L23-1 {1332#(= |main_#t~mem10| 60)} is VALID [2020-07-10 19:02:17,598 INFO L280 TraceCheckUtils]: 50: Hoare triple {1332#(= |main_#t~mem10| 60)} assume 60 != #t~mem10; {1313#false} is VALID [2020-07-10 19:02:17,598 INFO L280 TraceCheckUtils]: 51: Hoare triple {1313#false} havoc #t~mem10; {1313#false} is VALID [2020-07-10 19:02:17,599 INFO L280 TraceCheckUtils]: 52: Hoare triple {1313#false} assume !false; {1313#false} is VALID [2020-07-10 19:02:17,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 19:02:17,605 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 19:02:17,606 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [27868933] [2020-07-10 19:02:17,606 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 19:02:17,606 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-10 19:02:17,607 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72261135] [2020-07-10 19:02:17,607 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 53 [2020-07-10 19:02:17,608 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 19:02:17,608 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-10 19:02:17,665 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 19:02:17,665 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-10 19:02:17,665 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 19:02:17,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-10 19:02:17,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-10 19:02:17,666 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 6 states. [2020-07-10 19:02:18,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 19:02:18,156 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2020-07-10 19:02:18,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-10 19:02:18,156 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 53 [2020-07-10 19:02:18,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 19:02:18,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 19:02:18,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 55 transitions. [2020-07-10 19:02:18,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 19:02:18,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 55 transitions. [2020-07-10 19:02:18,162 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 55 transitions. [2020-07-10 19:02:18,214 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-10 19:02:18,214 INFO L225 Difference]: With dead ends: 55 [2020-07-10 19:02:18,214 INFO L226 Difference]: Without dead ends: 0 [2020-07-10 19:02:18,215 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-07-10 19:02:18,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-10 19:02:18,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-10 19:02:18,216 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 19:02:18,216 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-10 19:02:18,216 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-10 19:02:18,216 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-10 19:02:18,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 19:02:18,217 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-10 19:02:18,217 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 19:02:18,218 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 19:02:18,218 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 19:02:18,219 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-10 19:02:18,219 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-10 19:02:18,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 19:02:18,219 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-10 19:02:18,219 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 19:02:18,219 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 19:02:18,220 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 19:02:18,220 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 19:02:18,220 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 19:02:18,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-10 19:02:18,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-10 19:02:18,220 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 53 [2020-07-10 19:02:18,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 19:02:18,223 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-10 19:02:18,223 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-10 19:02:18,223 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2020-07-10 19:02:18,223 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 19:02:18,223 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 19:02:18,223 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 19:02:18,224 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-10 19:02:18,226 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-10 19:02:19,130 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-10 19:02:19,130 INFO L271 CegarLoopResult]: At program point L-1-1(line -1) the Hoare annotation is: true [2020-07-10 19:02:19,130 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line 5) the Hoare annotation is: true [2020-07-10 19:02:19,130 INFO L264 CegarLoopResult]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |~#a~0.base| |old(~#a~0.base)|) (= |~#b~0.base| |old(~#b~0.base)|) (= |#valid| |old(#valid)|) (= |~#b~0.offset| |old(~#b~0.offset)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |~#a~0.offset| |old(~#a~0.offset)|) (= |old(#length)| |#length|)) [2020-07-10 19:02:19,131 INFO L271 CegarLoopResult]: At program point L5(line 5) the Hoare annotation is: true [2020-07-10 19:02:19,131 INFO L271 CegarLoopResult]: At program point L5-1(line 5) the Hoare annotation is: true [2020-07-10 19:02:19,131 INFO L271 CegarLoopResult]: At program point L5-2(line 5) the Hoare annotation is: true [2020-07-10 19:02:19,131 INFO L271 CegarLoopResult]: At program point L5-3(line 5) the Hoare annotation is: true [2020-07-10 19:02:19,131 INFO L271 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-07-10 19:02:19,131 INFO L271 CegarLoopResult]: At program point get_dummyFINAL(lines 7 10) the Hoare annotation is: true [2020-07-10 19:02:19,131 INFO L271 CegarLoopResult]: At program point L9(line 9) the Hoare annotation is: true [2020-07-10 19:02:19,132 INFO L271 CegarLoopResult]: At program point get_dummyENTRY(lines 7 10) the Hoare annotation is: true [2020-07-10 19:02:19,132 INFO L271 CegarLoopResult]: At program point L9-2(line 9) the Hoare annotation is: true [2020-07-10 19:02:19,132 INFO L271 CegarLoopResult]: At program point L9-3(line 9) the Hoare annotation is: true [2020-07-10 19:02:19,132 INFO L271 CegarLoopResult]: At program point L9-4(line 9) the Hoare annotation is: true [2020-07-10 19:02:19,132 INFO L271 CegarLoopResult]: At program point L9-5(line 9) the Hoare annotation is: true [2020-07-10 19:02:19,132 INFO L271 CegarLoopResult]: At program point get_dummyEXIT(lines 7 10) the Hoare annotation is: true [2020-07-10 19:02:19,132 INFO L271 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-07-10 19:02:19,132 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-10 19:02:19,133 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-10 19:02:19,133 INFO L271 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-07-10 19:02:19,133 INFO L264 CegarLoopResult]: At program point L31(line 31) the Hoare annotation is: false [2020-07-10 19:02:19,133 INFO L264 CegarLoopResult]: At program point mainEXIT(lines 12 32) the Hoare annotation is: (not (= 0 main_~pc~0.base)) [2020-07-10 19:02:19,133 INFO L264 CegarLoopResult]: At program point L23(line 23) the Hoare annotation is: (and (= |main_~#c~0.offset| main_~pc~0.offset) (= main_~pc~0.base |main_~#c~0.base|) (not (= 0 main_~pc~0.base)) (= main_~pb~0.offset main_~pa~0.offset) (= main_~pa~0.base main_~pb~0.base)) [2020-07-10 19:02:19,133 INFO L264 CegarLoopResult]: At program point L23-1(line 23) the Hoare annotation is: (and (= (select (select |#memory_int| |main_~#c~0.base|) |main_~#c~0.offset|) 60) (= |main_~#c~0.offset| main_~pc~0.offset) (= main_~pc~0.base |main_~#c~0.base|) (not (= 0 main_~pc~0.base)) (= main_~pb~0.offset main_~pa~0.offset) (= main_~pa~0.base main_~pb~0.base)) [2020-07-10 19:02:19,134 INFO L264 CegarLoopResult]: At program point L19(line 19) the Hoare annotation is: (and (not |main_#t~short9|) (= |main_~#c~0.offset| main_~pc~0.offset) (= main_~pc~0.base |main_~#c~0.base|) (not (= 0 main_~pc~0.base)) (= main_~pb~0.offset main_~pa~0.offset) (= main_~pa~0.base main_~pb~0.base)) [2020-07-10 19:02:19,134 INFO L264 CegarLoopResult]: At program point L19-1(line 19) the Hoare annotation is: (and |main_#t~short8| (not |main_#t~short9|) (= |main_~#c~0.offset| main_~pc~0.offset) (= main_~pc~0.base |main_~#c~0.base|) (not (= 0 main_~pc~0.base)) (= main_~pb~0.offset main_~pa~0.offset) (= main_~pa~0.base main_~pb~0.base)) [2020-07-10 19:02:19,134 INFO L264 CegarLoopResult]: At program point L19-2(line 19) the Hoare annotation is: (and |main_#t~short8| (not |main_#t~short9|) (= |main_~#c~0.offset| main_~pc~0.offset) (= main_~pc~0.base |main_~#c~0.base|) (not (= 0 main_~pc~0.base)) (= main_~pb~0.offset main_~pa~0.offset) (= main_~pa~0.base main_~pb~0.base)) [2020-07-10 19:02:19,134 INFO L264 CegarLoopResult]: At program point L19-3(line 19) the Hoare annotation is: (and |main_#t~short8| (= (select (select |#memory_int| main_~pb~0.base) main_~pb~0.offset) |main_#t~mem6|) (not |main_#t~short9|) (= |main_~#c~0.offset| main_~pc~0.offset) (= main_~pc~0.base |main_~#c~0.base|) (not (= 0 main_~pc~0.base)) (= main_~pb~0.offset main_~pa~0.offset) (= main_~pa~0.base main_~pb~0.base)) [2020-07-10 19:02:19,135 INFO L264 CegarLoopResult]: At program point L15(line 15) the Hoare annotation is: (and (= |main_~#c~0.offset| main_~pc~0.offset) (= main_~pc~0.base |main_~#c~0.base|) (not (= 0 main_~pc~0.base))) [2020-07-10 19:02:19,135 INFO L264 CegarLoopResult]: At program point L19-4(line 19) the Hoare annotation is: (and |main_#t~short8| (= (select (select |#memory_int| main_~pb~0.base) main_~pb~0.offset) |main_#t~mem6|) (not |main_#t~short9|) (= |main_~#c~0.offset| main_~pc~0.offset) (= |main_#t~mem7| |main_#t~mem6|) (= main_~pc~0.base |main_~#c~0.base|) (not (= 0 main_~pc~0.base)) (= main_~pb~0.offset main_~pa~0.offset) (= main_~pa~0.base main_~pb~0.base)) [2020-07-10 19:02:19,135 INFO L264 CegarLoopResult]: At program point L15-1(line 15) the Hoare annotation is: (and (= |main_~#c~0.offset| main_~pc~0.offset) (= main_~pc~0.base |main_~#c~0.base|) (not (= 0 main_~pc~0.base))) [2020-07-10 19:02:19,135 INFO L264 CegarLoopResult]: At program point L15-2(line 15) the Hoare annotation is: (and (= |main_~#c~0.offset| main_~pc~0.offset) (= main_~pc~0.base |main_~#c~0.base|) (not (= 0 main_~pc~0.base))) [2020-07-10 19:02:19,135 INFO L264 CegarLoopResult]: At program point L19-6(line 19) the Hoare annotation is: (and (= (select (select |#memory_int| main_~pb~0.base) main_~pb~0.offset) |main_#t~mem6|) (not |main_#t~short9|) (= |main_~#c~0.offset| main_~pc~0.offset) (not |main_#t~short8|) (= |main_#t~mem7| |main_#t~mem6|) (= main_~pc~0.base |main_~#c~0.base|) (not (= 0 main_~pc~0.base)) (= main_~pb~0.offset main_~pa~0.offset) (= main_~pa~0.base main_~pb~0.base)) [2020-07-10 19:02:19,136 INFO L264 CegarLoopResult]: At program point L19-7(line 19) the Hoare annotation is: false [2020-07-10 19:02:19,136 INFO L264 CegarLoopResult]: At program point L19-8(line 19) the Hoare annotation is: false [2020-07-10 19:02:19,136 INFO L264 CegarLoopResult]: At program point L19-9(line 19) the Hoare annotation is: false [2020-07-10 19:02:19,136 INFO L264 CegarLoopResult]: At program point L19-10(line 19) the Hoare annotation is: (and (= (select (select |#memory_int| main_~pb~0.base) main_~pb~0.offset) |main_#t~mem6|) (not |main_#t~short9|) (= |main_~#c~0.offset| main_~pc~0.offset) (not |main_#t~short8|) (= |main_#t~mem7| |main_#t~mem6|) (= main_~pc~0.base |main_~#c~0.base|) (not (= 0 main_~pc~0.base)) (= main_~pb~0.offset main_~pa~0.offset) (= main_~pa~0.base main_~pb~0.base)) [2020-07-10 19:02:19,137 INFO L264 CegarLoopResult]: At program point L19-11(line 19) the Hoare annotation is: (and (= (select (select |#memory_int| main_~pb~0.base) main_~pb~0.offset) |main_#t~mem6|) (not |main_#t~short9|) (= |main_~#c~0.offset| main_~pc~0.offset) (not |main_#t~short8|) (= main_~pc~0.base |main_~#c~0.base|) (not (= 0 main_~pc~0.base)) (= main_~pb~0.offset main_~pa~0.offset) (= main_~pa~0.base main_~pb~0.base)) [2020-07-10 19:02:19,137 INFO L264 CegarLoopResult]: At program point L19-12(line 19) the Hoare annotation is: (and (= (select (select |#memory_int| main_~pb~0.base) main_~pb~0.offset) |main_#t~mem6|) (not |main_#t~short9|) (= |main_~#c~0.offset| main_~pc~0.offset) (= main_~pc~0.base |main_~#c~0.base|) (not (= 0 main_~pc~0.base)) (= main_~pb~0.offset main_~pa~0.offset) (= main_~pa~0.base main_~pb~0.base)) [2020-07-10 19:02:19,137 INFO L264 CegarLoopResult]: At program point L28(line 28) the Hoare annotation is: (and (not (= 0 |main_~#c~0.base|)) (not (= 0 main_~pc~0.base))) [2020-07-10 19:02:19,137 INFO L264 CegarLoopResult]: At program point L24(lines 24 26) the Hoare annotation is: (and (= (select (select |#memory_int| |main_~#c~0.base|) |main_~#c~0.offset|) 60) (= |main_~#c~0.offset| main_~pc~0.offset) (= main_~pc~0.base |main_~#c~0.base|) (not (= 0 main_~pc~0.base)) (= |main_#t~mem10| 60) (= main_~pb~0.offset main_~pa~0.offset) (= main_~pa~0.base main_~pb~0.base)) [2020-07-10 19:02:19,137 INFO L264 CegarLoopResult]: At program point L24-1(line 24) the Hoare annotation is: false [2020-07-10 19:02:19,138 INFO L264 CegarLoopResult]: At program point L24-2(line 24) the Hoare annotation is: (and (not (= 0 |main_~#c~0.base|)) (not (= 0 main_~pc~0.base))) [2020-07-10 19:02:19,138 INFO L264 CegarLoopResult]: At program point L16(line 16) the Hoare annotation is: (and (= |main_~#c~0.offset| main_~pc~0.offset) (= main_~pc~0.base |main_~#c~0.base|) (not (= 0 main_~pc~0.base))) [2020-07-10 19:02:19,138 INFO L264 CegarLoopResult]: At program point L16-1(line 16) the Hoare annotation is: (and (= |main_~#c~0.offset| main_~pc~0.offset) (= main_~pc~0.base |main_~#c~0.base|) (not (= 0 main_~pc~0.base))) [2020-07-10 19:02:19,138 INFO L264 CegarLoopResult]: At program point L16-2(line 16) the Hoare annotation is: (and (= |main_~#c~0.offset| main_~pc~0.offset) (= main_~pc~0.base |main_~#c~0.base|) (not (= 0 main_~pc~0.base))) [2020-07-10 19:02:19,138 INFO L264 CegarLoopResult]: At program point L25(lines 12 32) the Hoare annotation is: false [2020-07-10 19:02:19,139 INFO L264 CegarLoopResult]: At program point L17(line 17) the Hoare annotation is: (and (= |main_~#c~0.offset| main_~pc~0.offset) (= main_~pc~0.base |main_~#c~0.base|) (not (= 0 main_~pc~0.base))) [2020-07-10 19:02:19,139 INFO L264 CegarLoopResult]: At program point L17-1(line 17) the Hoare annotation is: (and (= |main_~#c~0.offset| main_~pc~0.offset) (= main_~pc~0.base |main_~#c~0.base|) (not (= 0 main_~pc~0.base))) [2020-07-10 19:02:19,139 INFO L264 CegarLoopResult]: At program point L17-2(line 17) the Hoare annotation is: (and (= |main_~#c~0.offset| main_~pc~0.offset) (= main_~pc~0.base |main_~#c~0.base|) (not (= 0 main_~pc~0.base))) [2020-07-10 19:02:19,139 INFO L264 CegarLoopResult]: At program point L17-3(line 17) the Hoare annotation is: (and (= |main_~#c~0.offset| main_~pc~0.offset) (= main_~pc~0.base |main_~#c~0.base|) (not (= 0 main_~pc~0.base)) (= main_~pb~0.offset main_~pa~0.offset) (= main_~pa~0.base main_~pb~0.base)) [2020-07-10 19:02:19,139 INFO L264 CegarLoopResult]: At program point L13(line 13) the Hoare annotation is: (not (= 0 |main_~#c~0.base|)) [2020-07-10 19:02:19,140 INFO L264 CegarLoopResult]: At program point mainFINAL(lines 12 32) the Hoare annotation is: (not (= 0 main_~pc~0.base)) [2020-07-10 19:02:19,140 INFO L264 CegarLoopResult]: At program point L13-1(line 13) the Hoare annotation is: (not (= 0 |main_~#c~0.base|)) [2020-07-10 19:02:19,140 INFO L264 CegarLoopResult]: At program point L13-2(line 13) the Hoare annotation is: (not (= 0 |main_~#c~0.base|)) [2020-07-10 19:02:19,140 INFO L264 CegarLoopResult]: At program point L13-3(line 13) the Hoare annotation is: (and (not (= 0 |main_~#c~0.base|)) (not (= 0 main_~pc~0.base))) [2020-07-10 19:02:19,140 INFO L264 CegarLoopResult]: At program point L13-4(line 13) the Hoare annotation is: (and (not (= 0 |main_~#c~0.base|)) (not (= 0 main_~pc~0.base))) [2020-07-10 19:02:19,140 INFO L264 CegarLoopResult]: At program point L13-5(line 13) the Hoare annotation is: false [2020-07-10 19:02:19,140 INFO L264 CegarLoopResult]: At program point L13-6(line 13) the Hoare annotation is: false [2020-07-10 19:02:19,141 INFO L264 CegarLoopResult]: At program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 30) the Hoare annotation is: false [2020-07-10 19:02:19,141 INFO L264 CegarLoopResult]: At program point mainENTRY(lines 12 32) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |old(#length)| |#length|)) [2020-07-10 19:02:19,141 INFO L264 CegarLoopResult]: At program point L18(lines 18 19) the Hoare annotation is: (and (= |main_~#c~0.offset| main_~pc~0.offset) (= main_~pc~0.base |main_~#c~0.base|) (not (= 0 main_~pc~0.base)) (= main_~pb~0.offset main_~pa~0.offset) (= main_~pa~0.base main_~pb~0.base)) [2020-07-10 19:02:19,141 INFO L264 CegarLoopResult]: At program point L18-1(lines 18 19) the Hoare annotation is: (and (not |main_#t~short9|) (= |main_~#c~0.offset| main_~pc~0.offset) (= main_~pc~0.base |main_~#c~0.base|) (not (= 0 main_~pc~0.base)) (= main_~pb~0.offset main_~pa~0.offset) (= main_~pa~0.base main_~pb~0.base)) [2020-07-10 19:02:19,141 INFO L264 CegarLoopResult]: At program point L18-3(lines 18 21) the Hoare annotation is: (and (= (select (select |#memory_int| main_~pb~0.base) main_~pb~0.offset) |main_#t~mem6|) (not |main_#t~short9|) (= |main_~#c~0.offset| main_~pc~0.offset) (not |main_#t~short8|) (= |main_#t~mem7| |main_#t~mem6|) (= main_~pc~0.base |main_~#c~0.base|) (not (= 0 main_~pc~0.base)) (= main_~pb~0.offset main_~pa~0.offset) (= main_~pa~0.base main_~pb~0.base)) [2020-07-10 19:02:19,142 INFO L264 CegarLoopResult]: At program point L14(line 14) the Hoare annotation is: (not (= 0 |main_~#c~0.base|)) [2020-07-10 19:02:19,142 INFO L264 CegarLoopResult]: At program point L18-4(lines 18 19) the Hoare annotation is: false [2020-07-10 19:02:19,142 INFO L264 CegarLoopResult]: At program point L14-1(line 14) the Hoare annotation is: (not (= 0 |main_~#c~0.base|)) [2020-07-10 19:02:19,142 INFO L264 CegarLoopResult]: At program point L18-5(lines 18 19) the Hoare annotation is: (and (not |main_#t~short9|) (= |main_~#c~0.offset| main_~pc~0.offset) (= main_~pc~0.base |main_~#c~0.base|) (not (= 0 main_~pc~0.base)) (= main_~pb~0.offset main_~pa~0.offset) (= main_~pa~0.base main_~pb~0.base)) [2020-07-10 19:02:19,142 INFO L264 CegarLoopResult]: At program point L14-2(line 14) the Hoare annotation is: (not (= 0 |main_~#c~0.base|)) [2020-07-10 19:02:19,177 INFO L163 areAnnotationChecker]: CFG has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-10 19:02:19,192 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.07 07:02:19 BoogieIcfgContainer [2020-07-10 19:02:19,192 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-10 19:02:19,196 INFO L168 Benchmark]: Toolchain (without parser) took 6993.45 ms. Allocated memory was 136.8 MB in the beginning and 308.8 MB in the end (delta: 172.0 MB). Free memory was 101.6 MB in the beginning and 184.8 MB in the end (delta: -83.2 MB). Peak memory consumption was 88.7 MB. Max. memory is 7.1 GB. [2020-07-10 19:02:19,197 INFO L168 Benchmark]: CDTParser took 0.77 ms. Allocated memory is still 136.8 MB. Free memory was 120.3 MB in the beginning and 120.0 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-07-10 19:02:19,198 INFO L168 Benchmark]: CACSL2BoogieTranslator took 258.36 ms. Allocated memory is still 136.8 MB. Free memory was 101.4 MB in the beginning and 91.1 MB in the end (delta: 10.3 MB). Peak memory consumption was 10.3 MB. Max. memory is 7.1 GB. [2020-07-10 19:02:19,199 INFO L168 Benchmark]: Boogie Preprocessor took 126.50 ms. Allocated memory was 136.8 MB in the beginning and 201.3 MB in the end (delta: 64.5 MB). Free memory was 91.1 MB in the beginning and 179.5 MB in the end (delta: -88.4 MB). Peak memory consumption was 14.5 MB. Max. memory is 7.1 GB. [2020-07-10 19:02:19,200 INFO L168 Benchmark]: RCFGBuilder took 503.17 ms. Allocated memory is still 201.3 MB. Free memory was 179.5 MB in the beginning and 149.6 MB in the end (delta: 29.8 MB). Peak memory consumption was 29.8 MB. Max. memory is 7.1 GB. [2020-07-10 19:02:19,200 INFO L168 Benchmark]: TraceAbstraction took 6095.26 ms. Allocated memory was 201.3 MB in the beginning and 308.8 MB in the end (delta: 107.5 MB). Free memory was 148.9 MB in the beginning and 184.8 MB in the end (delta: -35.9 MB). Peak memory consumption was 71.6 MB. Max. memory is 7.1 GB. [2020-07-10 19:02:19,204 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.77 ms. Allocated memory is still 136.8 MB. Free memory was 120.3 MB in the beginning and 120.0 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 258.36 ms. Allocated memory is still 136.8 MB. Free memory was 101.4 MB in the beginning and 91.1 MB in the end (delta: 10.3 MB). Peak memory consumption was 10.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 126.50 ms. Allocated memory was 136.8 MB in the beginning and 201.3 MB in the end (delta: 64.5 MB). Free memory was 91.1 MB in the beginning and 179.5 MB in the end (delta: -88.4 MB). Peak memory consumption was 14.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 503.17 ms. Allocated memory is still 201.3 MB. Free memory was 179.5 MB in the beginning and 149.6 MB in the end (delta: 29.8 MB). Peak memory consumption was 29.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 6095.26 ms. Allocated memory was 201.3 MB in the beginning and 308.8 MB in the end (delta: 107.5 MB). Free memory was 148.9 MB in the beginning and 184.8 MB in the end (delta: -35.9 MB). Peak memory consumption was 71.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 30]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 12]: Loop Invariant Derived loop invariant: 0 - ProcedureContractResult [Line: 7]: Procedure Contract for get_dummy Derived contract for procedure get_dummy: 1 - ProcedureContractResult [Line: 12]: Procedure Contract for main Derived contract for procedure main: !(0 == pc) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 70 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 5.0s, OverallIterations: 4, TraceHistogramMax: 1, AutomataDifference: 2.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.9s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 204 SDtfs, 168 SDslu, 397 SDs, 0 SdLazy, 383 SolverSat, 15 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 47 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=70occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 4 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 70 LocationsWithAnnotation, 70 PreInvPairs, 87 NumberOfFragments, 632 HoareAnnotationTreeSize, 70 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 70 FomulaSimplificationsInter, 314 FormulaSimplificationTreeSizeReductionInter, 0.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...