/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/test14.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-8fc6572 [2020-07-10 19:02:15,822 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-10 19:02:15,825 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-10 19:02:15,843 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-10 19:02:15,843 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-10 19:02:15,845 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-10 19:02:15,847 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-10 19:02:15,857 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-10 19:02:15,860 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-10 19:02:15,862 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-10 19:02:15,864 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-10 19:02:15,866 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-10 19:02:15,866 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-10 19:02:15,868 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-10 19:02:15,870 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-10 19:02:15,871 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-10 19:02:15,872 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-10 19:02:15,874 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-10 19:02:15,876 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-10 19:02:15,880 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-10 19:02:15,885 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-10 19:02:15,888 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-10 19:02:15,889 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-10 19:02:15,889 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-10 19:02:15,892 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-10 19:02:15,892 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-10 19:02:15,892 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-10 19:02:15,894 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-10 19:02:15,895 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-10 19:02:15,896 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-10 19:02:15,897 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-10 19:02:15,897 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-10 19:02:15,898 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-10 19:02:15,899 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-10 19:02:15,900 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-10 19:02:15,900 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-10 19:02:15,901 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-10 19:02:15,901 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-10 19:02:15,901 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-10 19:02:15,902 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-10 19:02:15,903 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-10 19:02:15,904 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:15,932 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-10 19:02:15,932 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-10 19:02:15,935 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-10 19:02:15,935 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-10 19:02:15,935 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-10 19:02:15,935 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-10 19:02:15,935 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-10 19:02:15,935 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-10 19:02:15,936 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-10 19:02:15,936 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-10 19:02:15,936 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-10 19:02:15,936 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-10 19:02:15,936 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-10 19:02:15,937 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-10 19:02:15,937 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-10 19:02:15,937 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-10 19:02:15,937 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-10 19:02:15,939 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-10 19:02:15,939 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 19:02:15,939 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-10 19:02:15,940 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-10 19:02:15,940 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-10 19:02:15,940 INFO L138 SettingsManager]: * Use separate solver for trace checks=false [2020-07-10 19:02:16,212 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-10 19:02:16,225 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-10 19:02:16,230 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-10 19:02:16,231 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-10 19:02:16,232 INFO L275 PluginConnector]: CDTParser initialized [2020-07-10 19:02:16,232 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-regression/test14.c [2020-07-10 19:02:16,300 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a6208f5ad/17aca58f84e749eeb3fdfe6c9d766fd4/FLAG2e3bed53e [2020-07-10 19:02:16,773 INFO L306 CDTParser]: Found 1 translation units. [2020-07-10 19:02:16,774 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-regression/test14.c [2020-07-10 19:02:16,780 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a6208f5ad/17aca58f84e749eeb3fdfe6c9d766fd4/FLAG2e3bed53e [2020-07-10 19:02:17,146 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a6208f5ad/17aca58f84e749eeb3fdfe6c9d766fd4 [2020-07-10 19:02:17,156 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-10 19:02:17,158 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-10 19:02:17,159 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-10 19:02:17,159 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-10 19:02:17,164 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-10 19:02:17,166 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 07:02:17" (1/1) ... [2020-07-10 19:02:17,168 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f18f3d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 07:02:17, skipping insertion in model container [2020-07-10 19:02:17,169 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 07:02:17" (1/1) ... [2020-07-10 19:02:17,177 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-10 19:02:17,197 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-10 19:02:17,364 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 19:02:17,376 INFO L203 MainTranslator]: Completed pre-run [2020-07-10 19:02:17,395 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 19:02:17,412 INFO L208 MainTranslator]: Completed translation [2020-07-10 19:02:17,413 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 07:02:17 WrapperNode [2020-07-10 19:02:17,413 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-10 19:02:17,413 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-10 19:02:17,414 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-10 19:02:17,414 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-10 19:02:17,514 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:17" (1/1) ... [2020-07-10 19:02:17,514 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:17" (1/1) ... [2020-07-10 19:02:17,522 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:17" (1/1) ... [2020-07-10 19:02:17,522 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:17" (1/1) ... [2020-07-10 19:02:17,531 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:17" (1/1) ... [2020-07-10 19:02:17,534 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:17" (1/1) ... [2020-07-10 19:02:17,535 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:17" (1/1) ... [2020-07-10 19:02:17,537 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-10 19:02:17,538 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-10 19:02:17,538 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-10 19:02:17,538 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-10 19:02:17,539 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 07:02:17" (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:17,607 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-10 19:02:17,607 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-10 19:02:17,607 INFO L138 BoogieDeclarations]: Found implementation of procedure get_dummy [2020-07-10 19:02:17,607 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-10 19:02:17,607 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-10 19:02:17,608 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-10 19:02:17,608 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2020-07-10 19:02:17,608 INFO L130 BoogieDeclarations]: Found specification of procedure get_dummy [2020-07-10 19:02:17,608 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-10 19:02:17,608 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-10 19:02:17,608 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-07-10 19:02:17,609 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-10 19:02:17,609 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-10 19:02:17,609 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-10 19:02:17,609 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-10 19:02:17,609 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-10 19:02:18,079 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-10 19:02:18,079 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-07-10 19:02:18,089 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 07:02:18 BoogieIcfgContainer [2020-07-10 19:02:18,089 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-10 19:02:18,091 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-10 19:02:18,092 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-10 19:02:18,096 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-10 19:02:18,097 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.07 07:02:17" (1/3) ... [2020-07-10 19:02:18,098 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69726190 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 07:02:18, skipping insertion in model container [2020-07-10 19:02:18,098 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 07:02:17" (2/3) ... [2020-07-10 19:02:18,099 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69726190 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 07:02:18, skipping insertion in model container [2020-07-10 19:02:18,099 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 07:02:18" (3/3) ... [2020-07-10 19:02:18,101 INFO L109 eAbstractionObserver]: Analyzing ICFG test14.c [2020-07-10 19:02:18,112 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-10 19:02:18,120 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-10 19:02:18,133 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-10 19:02:18,157 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-10 19:02:18,157 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-10 19:02:18,157 INFO L377 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-07-10 19:02:18,160 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-10 19:02:18,160 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-10 19:02:18,161 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-10 19:02:18,161 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-10 19:02:18,162 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-10 19:02:18,179 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states. [2020-07-10 19:02:18,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2020-07-10 19:02:18,190 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 19:02:18,191 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:18,191 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 19:02:18,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 19:02:18,196 INFO L82 PathProgramCache]: Analyzing trace with hash 465652526, now seen corresponding path program 1 times [2020-07-10 19:02:18,203 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 19:02:18,204 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [512962197] [2020-07-10 19:02:18,204 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 19:02:18,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 19:02:18,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 19:02:18,553 INFO L280 TraceCheckUtils]: 0: Hoare triple {89#(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; {68#true} is VALID [2020-07-10 19:02:18,554 INFO L280 TraceCheckUtils]: 1: Hoare triple {68#true} #valid := #valid[0 := 0]; {68#true} is VALID [2020-07-10 19:02:18,554 INFO L280 TraceCheckUtils]: 2: Hoare triple {68#true} assume 0 < #StackHeapBarrier; {68#true} is VALID [2020-07-10 19:02:18,555 INFO L280 TraceCheckUtils]: 3: Hoare triple {68#true} SUMMARY for call ~#a~0.base, ~#a~0.offset := #Ultimate.allocOnStack(4); srcloc: L5 {68#true} is VALID [2020-07-10 19:02:18,555 INFO L280 TraceCheckUtils]: 4: Hoare triple {68#true} SUMMARY for call write~init~int(0, ~#a~0.base, ~#a~0.offset, 4); srcloc: L5-1 {68#true} is VALID [2020-07-10 19:02:18,555 INFO L280 TraceCheckUtils]: 5: Hoare triple {68#true} SUMMARY for call ~#b~0.base, ~#b~0.offset := #Ultimate.allocOnStack(4); srcloc: L5-2 {68#true} is VALID [2020-07-10 19:02:18,556 INFO L280 TraceCheckUtils]: 6: Hoare triple {68#true} SUMMARY for call write~init~int(0, ~#b~0.base, ~#b~0.offset, 4); srcloc: L5-3 {68#true} is VALID [2020-07-10 19:02:18,556 INFO L280 TraceCheckUtils]: 7: Hoare triple {68#true} assume true; {68#true} is VALID [2020-07-10 19:02:18,556 INFO L275 TraceCheckUtils]: 8: Hoare quadruple {68#true} {68#true} #81#return; {68#true} is VALID [2020-07-10 19:02:18,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 19:02:18,580 INFO L280 TraceCheckUtils]: 0: Hoare triple {68#true} assume 0 != #t~nondet0 % 256; {68#true} is VALID [2020-07-10 19:02:18,580 INFO L280 TraceCheckUtils]: 1: Hoare triple {68#true} #t~ite1.base, #t~ite1.offset := ~#a~0.base, ~#a~0.offset; {68#true} is VALID [2020-07-10 19:02:18,581 INFO L280 TraceCheckUtils]: 2: Hoare triple {68#true} #res.base, #res.offset := #t~ite1.base, #t~ite1.offset; {68#true} is VALID [2020-07-10 19:02:18,581 INFO L280 TraceCheckUtils]: 3: Hoare triple {68#true} havoc #t~ite1.base, #t~ite1.offset; {68#true} is VALID [2020-07-10 19:02:18,582 INFO L280 TraceCheckUtils]: 4: Hoare triple {68#true} havoc #t~nondet0; {68#true} is VALID [2020-07-10 19:02:18,582 INFO L280 TraceCheckUtils]: 5: Hoare triple {68#true} assume true; {68#true} is VALID [2020-07-10 19:02:18,584 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {68#true} {80#(not (= 0 main_~pc~0.base))} #85#return; {80#(not (= 0 main_~pc~0.base))} is VALID [2020-07-10 19:02:18,587 INFO L263 TraceCheckUtils]: 0: Hoare triple {68#true} call ULTIMATE.init(); {89#(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:18,587 INFO L280 TraceCheckUtils]: 1: Hoare triple {89#(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; {68#true} is VALID [2020-07-10 19:02:18,588 INFO L280 TraceCheckUtils]: 2: Hoare triple {68#true} #valid := #valid[0 := 0]; {68#true} is VALID [2020-07-10 19:02:18,588 INFO L280 TraceCheckUtils]: 3: Hoare triple {68#true} assume 0 < #StackHeapBarrier; {68#true} is VALID [2020-07-10 19:02:18,589 INFO L280 TraceCheckUtils]: 4: Hoare triple {68#true} SUMMARY for call ~#a~0.base, ~#a~0.offset := #Ultimate.allocOnStack(4); srcloc: L5 {68#true} is VALID [2020-07-10 19:02:18,589 INFO L280 TraceCheckUtils]: 5: Hoare triple {68#true} SUMMARY for call write~init~int(0, ~#a~0.base, ~#a~0.offset, 4); srcloc: L5-1 {68#true} is VALID [2020-07-10 19:02:18,590 INFO L280 TraceCheckUtils]: 6: Hoare triple {68#true} SUMMARY for call ~#b~0.base, ~#b~0.offset := #Ultimate.allocOnStack(4); srcloc: L5-2 {68#true} is VALID [2020-07-10 19:02:18,590 INFO L280 TraceCheckUtils]: 7: Hoare triple {68#true} SUMMARY for call write~init~int(0, ~#b~0.base, ~#b~0.offset, 4); srcloc: L5-3 {68#true} is VALID [2020-07-10 19:02:18,590 INFO L280 TraceCheckUtils]: 8: Hoare triple {68#true} assume true; {68#true} is VALID [2020-07-10 19:02:18,590 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {68#true} {68#true} #81#return; {68#true} is VALID [2020-07-10 19:02:18,591 INFO L263 TraceCheckUtils]: 10: Hoare triple {68#true} call #t~ret9 := main(); {68#true} is VALID [2020-07-10 19:02:18,591 INFO L280 TraceCheckUtils]: 11: Hoare triple {68#true} havoc ~a~1; {68#true} is VALID [2020-07-10 19:02:18,592 INFO L280 TraceCheckUtils]: 12: Hoare triple {68#true} havoc ~b~1; {68#true} is VALID [2020-07-10 19:02:18,593 INFO L280 TraceCheckUtils]: 13: Hoare triple {68#true} SUMMARY for call ~#c~0.base, ~#c~0.offset := #Ultimate.allocOnStack(4); srcloc: L13-1 {79#(not (= 0 |main_~#c~0.base|))} is VALID [2020-07-10 19:02:18,594 INFO L280 TraceCheckUtils]: 14: Hoare triple {79#(not (= 0 |main_~#c~0.base|))} SUMMARY for call write~init~int(5, ~#c~0.base, ~#c~0.offset, 4); srcloc: L13-2 {79#(not (= 0 |main_~#c~0.base|))} is VALID [2020-07-10 19:02:18,595 INFO L280 TraceCheckUtils]: 15: Hoare triple {79#(not (= 0 |main_~#c~0.base|))} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {79#(not (= 0 |main_~#c~0.base|))} is VALID [2020-07-10 19:02:18,596 INFO L280 TraceCheckUtils]: 16: Hoare triple {79#(not (= 0 |main_~#c~0.base|))} ~a~1 := #t~nondet2; {79#(not (= 0 |main_~#c~0.base|))} is VALID [2020-07-10 19:02:18,598 INFO L280 TraceCheckUtils]: 17: Hoare triple {79#(not (= 0 |main_~#c~0.base|))} havoc #t~nondet2; {79#(not (= 0 |main_~#c~0.base|))} is VALID [2020-07-10 19:02:18,600 INFO L280 TraceCheckUtils]: 18: Hoare triple {79#(not (= 0 |main_~#c~0.base|))} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {79#(not (= 0 |main_~#c~0.base|))} is VALID [2020-07-10 19:02:18,603 INFO L280 TraceCheckUtils]: 19: Hoare triple {79#(not (= 0 |main_~#c~0.base|))} ~b~1 := #t~nondet3; {79#(not (= 0 |main_~#c~0.base|))} is VALID [2020-07-10 19:02:18,604 INFO L280 TraceCheckUtils]: 20: Hoare triple {79#(not (= 0 |main_~#c~0.base|))} havoc #t~nondet3; {79#(not (= 0 |main_~#c~0.base|))} is VALID [2020-07-10 19:02:18,605 INFO L280 TraceCheckUtils]: 21: Hoare triple {79#(not (= 0 |main_~#c~0.base|))} havoc ~pa~0.base, ~pa~0.offset; {79#(not (= 0 |main_~#c~0.base|))} is VALID [2020-07-10 19:02:18,606 INFO L280 TraceCheckUtils]: 22: Hoare triple {79#(not (= 0 |main_~#c~0.base|))} havoc ~pb~0.base, ~pb~0.offset; {79#(not (= 0 |main_~#c~0.base|))} is VALID [2020-07-10 19:02:18,607 INFO L280 TraceCheckUtils]: 23: Hoare triple {79#(not (= 0 |main_~#c~0.base|))} ~pc~0.base, ~pc~0.offset := ~#c~0.base, ~#c~0.offset; {80#(not (= 0 main_~pc~0.base))} is VALID [2020-07-10 19:02:18,607 INFO L263 TraceCheckUtils]: 24: Hoare triple {80#(not (= 0 main_~pc~0.base))} call #t~ret4.base, #t~ret4.offset := get_dummy(); {68#true} is VALID [2020-07-10 19:02:18,607 INFO L280 TraceCheckUtils]: 25: Hoare triple {68#true} assume 0 != #t~nondet0 % 256; {68#true} is VALID [2020-07-10 19:02:18,608 INFO L280 TraceCheckUtils]: 26: Hoare triple {68#true} #t~ite1.base, #t~ite1.offset := ~#a~0.base, ~#a~0.offset; {68#true} is VALID [2020-07-10 19:02:18,608 INFO L280 TraceCheckUtils]: 27: Hoare triple {68#true} #res.base, #res.offset := #t~ite1.base, #t~ite1.offset; {68#true} is VALID [2020-07-10 19:02:18,608 INFO L280 TraceCheckUtils]: 28: Hoare triple {68#true} havoc #t~ite1.base, #t~ite1.offset; {68#true} is VALID [2020-07-10 19:02:18,609 INFO L280 TraceCheckUtils]: 29: Hoare triple {68#true} havoc #t~nondet0; {68#true} is VALID [2020-07-10 19:02:18,609 INFO L280 TraceCheckUtils]: 30: Hoare triple {68#true} assume true; {68#true} is VALID [2020-07-10 19:02:18,610 INFO L275 TraceCheckUtils]: 31: Hoare quadruple {68#true} {80#(not (= 0 main_~pc~0.base))} #85#return; {80#(not (= 0 main_~pc~0.base))} is VALID [2020-07-10 19:02:18,611 INFO L280 TraceCheckUtils]: 32: Hoare triple {80#(not (= 0 main_~pc~0.base))} ~pb~0.base, ~pb~0.offset := #t~ret4.base, #t~ret4.offset; {80#(not (= 0 main_~pc~0.base))} is VALID [2020-07-10 19:02:18,612 INFO L280 TraceCheckUtils]: 33: Hoare triple {80#(not (= 0 main_~pc~0.base))} ~pa~0.base, ~pa~0.offset := ~pb~0.base, ~pb~0.offset; {80#(not (= 0 main_~pc~0.base))} is VALID [2020-07-10 19:02:18,613 INFO L280 TraceCheckUtils]: 34: Hoare triple {80#(not (= 0 main_~pc~0.base))} havoc #t~ret4.base, #t~ret4.offset; {80#(not (= 0 main_~pc~0.base))} is VALID [2020-07-10 19:02:18,614 INFO L280 TraceCheckUtils]: 35: Hoare triple {80#(not (= 0 main_~pc~0.base))} #t~short8 := ~pc~0.base == 0 && ~pc~0.offset == 0; {88#(not |main_#t~short8|)} is VALID [2020-07-10 19:02:18,615 INFO L280 TraceCheckUtils]: 36: Hoare triple {88#(not |main_#t~short8|)} assume #t~short8; {69#false} is VALID [2020-07-10 19:02:18,615 INFO L280 TraceCheckUtils]: 37: Hoare triple {69#false} assume #t~short8; {69#false} is VALID [2020-07-10 19:02:18,616 INFO L280 TraceCheckUtils]: 38: Hoare triple {69#false} havoc #t~short7; {69#false} is VALID [2020-07-10 19:02:18,616 INFO L280 TraceCheckUtils]: 39: Hoare triple {69#false} havoc #t~short8; {69#false} is VALID [2020-07-10 19:02:18,616 INFO L280 TraceCheckUtils]: 40: Hoare triple {69#false} havoc #t~mem5; {69#false} is VALID [2020-07-10 19:02:18,617 INFO L280 TraceCheckUtils]: 41: Hoare triple {69#false} havoc #t~mem6; {69#false} is VALID [2020-07-10 19:02:18,617 INFO L280 TraceCheckUtils]: 42: Hoare triple {69#false} assume !false; {69#false} is VALID [2020-07-10 19:02:18,625 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:18,625 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 19:02:18,628 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [512962197] [2020-07-10 19:02:18,629 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 19:02:18,630 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-10 19:02:18,630 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766681639] [2020-07-10 19:02:18,636 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 43 [2020-07-10 19:02:18,639 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 19:02:18,643 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-10 19:02:18,724 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:18,725 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-10 19:02:18,725 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 19:02:18,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-10 19:02:18,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-10 19:02:18,736 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 6 states. [2020-07-10 19:02:19,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 19:02:19,382 INFO L93 Difference]: Finished difference Result 83 states and 86 transitions. [2020-07-10 19:02:19,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-10 19:02:19,383 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 43 [2020-07-10 19:02:19,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 19:02:19,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 19:02:19,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 86 transitions. [2020-07-10 19:02:19,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 19:02:19,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 86 transitions. [2020-07-10 19:02:19,405 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 86 transitions. [2020-07-10 19:02:19,525 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 86 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 19:02:19,553 INFO L225 Difference]: With dead ends: 83 [2020-07-10 19:02:19,555 INFO L226 Difference]: Without dead ends: 51 [2020-07-10 19:02:19,560 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:19,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2020-07-10 19:02:19,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2020-07-10 19:02:19,726 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 19:02:19,727 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand 51 states. [2020-07-10 19:02:19,727 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand 51 states. [2020-07-10 19:02:19,728 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 51 states. [2020-07-10 19:02:19,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 19:02:19,742 INFO L93 Difference]: Finished difference Result 51 states and 52 transitions. [2020-07-10 19:02:19,743 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 52 transitions. [2020-07-10 19:02:19,744 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 19:02:19,744 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 19:02:19,746 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand 51 states. [2020-07-10 19:02:19,746 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 51 states. [2020-07-10 19:02:19,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 19:02:19,753 INFO L93 Difference]: Finished difference Result 51 states and 52 transitions. [2020-07-10 19:02:19,753 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 52 transitions. [2020-07-10 19:02:19,754 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 19:02:19,754 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 19:02:19,754 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 19:02:19,755 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 19:02:19,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2020-07-10 19:02:19,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 52 transitions. [2020-07-10 19:02:19,767 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 52 transitions. Word has length 43 [2020-07-10 19:02:19,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 19:02:19,768 INFO L479 AbstractCegarLoop]: Abstraction has 51 states and 52 transitions. [2020-07-10 19:02:19,768 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-10 19:02:19,768 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 51 states and 52 transitions. [2020-07-10 19:02:19,863 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 19:02:19,863 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 52 transitions. [2020-07-10 19:02:19,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2020-07-10 19:02:19,866 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 19:02:19,866 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:19,867 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-10 19:02:19,867 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 19:02:19,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 19:02:19,867 INFO L82 PathProgramCache]: Analyzing trace with hash -1782210472, now seen corresponding path program 1 times [2020-07-10 19:02:19,868 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 19:02:19,868 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1863569372] [2020-07-10 19:02:19,868 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 19:02:19,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 19:02:20,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 19:02:20,043 INFO L280 TraceCheckUtils]: 0: Hoare triple {486#(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; {466#true} is VALID [2020-07-10 19:02:20,044 INFO L280 TraceCheckUtils]: 1: Hoare triple {466#true} #valid := #valid[0 := 0]; {466#true} is VALID [2020-07-10 19:02:20,044 INFO L280 TraceCheckUtils]: 2: Hoare triple {466#true} assume 0 < #StackHeapBarrier; {466#true} is VALID [2020-07-10 19:02:20,044 INFO L280 TraceCheckUtils]: 3: Hoare triple {466#true} SUMMARY for call ~#a~0.base, ~#a~0.offset := #Ultimate.allocOnStack(4); srcloc: L5 {466#true} is VALID [2020-07-10 19:02:20,045 INFO L280 TraceCheckUtils]: 4: Hoare triple {466#true} SUMMARY for call write~init~int(0, ~#a~0.base, ~#a~0.offset, 4); srcloc: L5-1 {466#true} is VALID [2020-07-10 19:02:20,045 INFO L280 TraceCheckUtils]: 5: Hoare triple {466#true} SUMMARY for call ~#b~0.base, ~#b~0.offset := #Ultimate.allocOnStack(4); srcloc: L5-2 {466#true} is VALID [2020-07-10 19:02:20,045 INFO L280 TraceCheckUtils]: 6: Hoare triple {466#true} SUMMARY for call write~init~int(0, ~#b~0.base, ~#b~0.offset, 4); srcloc: L5-3 {466#true} is VALID [2020-07-10 19:02:20,046 INFO L280 TraceCheckUtils]: 7: Hoare triple {466#true} assume true; {466#true} is VALID [2020-07-10 19:02:20,046 INFO L275 TraceCheckUtils]: 8: Hoare quadruple {466#true} {466#true} #81#return; {466#true} is VALID [2020-07-10 19:02:20,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 19:02:20,052 INFO L280 TraceCheckUtils]: 0: Hoare triple {466#true} assume 0 != #t~nondet0 % 256; {466#true} is VALID [2020-07-10 19:02:20,053 INFO L280 TraceCheckUtils]: 1: Hoare triple {466#true} #t~ite1.base, #t~ite1.offset := ~#a~0.base, ~#a~0.offset; {466#true} is VALID [2020-07-10 19:02:20,053 INFO L280 TraceCheckUtils]: 2: Hoare triple {466#true} #res.base, #res.offset := #t~ite1.base, #t~ite1.offset; {466#true} is VALID [2020-07-10 19:02:20,053 INFO L280 TraceCheckUtils]: 3: Hoare triple {466#true} havoc #t~ite1.base, #t~ite1.offset; {466#true} is VALID [2020-07-10 19:02:20,054 INFO L280 TraceCheckUtils]: 4: Hoare triple {466#true} havoc #t~nondet0; {466#true} is VALID [2020-07-10 19:02:20,054 INFO L280 TraceCheckUtils]: 5: Hoare triple {466#true} assume true; {466#true} is VALID [2020-07-10 19:02:20,054 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {466#true} {466#true} #85#return; {466#true} is VALID [2020-07-10 19:02:20,056 INFO L263 TraceCheckUtils]: 0: Hoare triple {466#true} call ULTIMATE.init(); {486#(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:20,056 INFO L280 TraceCheckUtils]: 1: Hoare triple {486#(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; {466#true} is VALID [2020-07-10 19:02:20,056 INFO L280 TraceCheckUtils]: 2: Hoare triple {466#true} #valid := #valid[0 := 0]; {466#true} is VALID [2020-07-10 19:02:20,057 INFO L280 TraceCheckUtils]: 3: Hoare triple {466#true} assume 0 < #StackHeapBarrier; {466#true} is VALID [2020-07-10 19:02:20,057 INFO L280 TraceCheckUtils]: 4: Hoare triple {466#true} SUMMARY for call ~#a~0.base, ~#a~0.offset := #Ultimate.allocOnStack(4); srcloc: L5 {466#true} is VALID [2020-07-10 19:02:20,057 INFO L280 TraceCheckUtils]: 5: Hoare triple {466#true} SUMMARY for call write~init~int(0, ~#a~0.base, ~#a~0.offset, 4); srcloc: L5-1 {466#true} is VALID [2020-07-10 19:02:20,057 INFO L280 TraceCheckUtils]: 6: Hoare triple {466#true} SUMMARY for call ~#b~0.base, ~#b~0.offset := #Ultimate.allocOnStack(4); srcloc: L5-2 {466#true} is VALID [2020-07-10 19:02:20,058 INFO L280 TraceCheckUtils]: 7: Hoare triple {466#true} SUMMARY for call write~init~int(0, ~#b~0.base, ~#b~0.offset, 4); srcloc: L5-3 {466#true} is VALID [2020-07-10 19:02:20,058 INFO L280 TraceCheckUtils]: 8: Hoare triple {466#true} assume true; {466#true} is VALID [2020-07-10 19:02:20,058 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {466#true} {466#true} #81#return; {466#true} is VALID [2020-07-10 19:02:20,059 INFO L263 TraceCheckUtils]: 10: Hoare triple {466#true} call #t~ret9 := main(); {466#true} is VALID [2020-07-10 19:02:20,059 INFO L280 TraceCheckUtils]: 11: Hoare triple {466#true} havoc ~a~1; {466#true} is VALID [2020-07-10 19:02:20,059 INFO L280 TraceCheckUtils]: 12: Hoare triple {466#true} havoc ~b~1; {466#true} is VALID [2020-07-10 19:02:20,060 INFO L280 TraceCheckUtils]: 13: Hoare triple {466#true} SUMMARY for call ~#c~0.base, ~#c~0.offset := #Ultimate.allocOnStack(4); srcloc: L13-1 {466#true} is VALID [2020-07-10 19:02:20,060 INFO L280 TraceCheckUtils]: 14: Hoare triple {466#true} SUMMARY for call write~init~int(5, ~#c~0.base, ~#c~0.offset, 4); srcloc: L13-2 {466#true} is VALID [2020-07-10 19:02:20,060 INFO L280 TraceCheckUtils]: 15: Hoare triple {466#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {466#true} is VALID [2020-07-10 19:02:20,060 INFO L280 TraceCheckUtils]: 16: Hoare triple {466#true} ~a~1 := #t~nondet2; {466#true} is VALID [2020-07-10 19:02:20,061 INFO L280 TraceCheckUtils]: 17: Hoare triple {466#true} havoc #t~nondet2; {466#true} is VALID [2020-07-10 19:02:20,061 INFO L280 TraceCheckUtils]: 18: Hoare triple {466#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {466#true} is VALID [2020-07-10 19:02:20,061 INFO L280 TraceCheckUtils]: 19: Hoare triple {466#true} ~b~1 := #t~nondet3; {466#true} is VALID [2020-07-10 19:02:20,062 INFO L280 TraceCheckUtils]: 20: Hoare triple {466#true} havoc #t~nondet3; {466#true} is VALID [2020-07-10 19:02:20,062 INFO L280 TraceCheckUtils]: 21: Hoare triple {466#true} havoc ~pa~0.base, ~pa~0.offset; {466#true} is VALID [2020-07-10 19:02:20,062 INFO L280 TraceCheckUtils]: 22: Hoare triple {466#true} havoc ~pb~0.base, ~pb~0.offset; {466#true} is VALID [2020-07-10 19:02:20,063 INFO L280 TraceCheckUtils]: 23: Hoare triple {466#true} ~pc~0.base, ~pc~0.offset := ~#c~0.base, ~#c~0.offset; {466#true} is VALID [2020-07-10 19:02:20,063 INFO L263 TraceCheckUtils]: 24: Hoare triple {466#true} call #t~ret4.base, #t~ret4.offset := get_dummy(); {466#true} is VALID [2020-07-10 19:02:20,063 INFO L280 TraceCheckUtils]: 25: Hoare triple {466#true} assume 0 != #t~nondet0 % 256; {466#true} is VALID [2020-07-10 19:02:20,063 INFO L280 TraceCheckUtils]: 26: Hoare triple {466#true} #t~ite1.base, #t~ite1.offset := ~#a~0.base, ~#a~0.offset; {466#true} is VALID [2020-07-10 19:02:20,064 INFO L280 TraceCheckUtils]: 27: Hoare triple {466#true} #res.base, #res.offset := #t~ite1.base, #t~ite1.offset; {466#true} is VALID [2020-07-10 19:02:20,064 INFO L280 TraceCheckUtils]: 28: Hoare triple {466#true} havoc #t~ite1.base, #t~ite1.offset; {466#true} is VALID [2020-07-10 19:02:20,064 INFO L280 TraceCheckUtils]: 29: Hoare triple {466#true} havoc #t~nondet0; {466#true} is VALID [2020-07-10 19:02:20,065 INFO L280 TraceCheckUtils]: 30: Hoare triple {466#true} assume true; {466#true} is VALID [2020-07-10 19:02:20,065 INFO L275 TraceCheckUtils]: 31: Hoare quadruple {466#true} {466#true} #85#return; {466#true} is VALID [2020-07-10 19:02:20,065 INFO L280 TraceCheckUtils]: 32: Hoare triple {466#true} ~pb~0.base, ~pb~0.offset := #t~ret4.base, #t~ret4.offset; {466#true} is VALID [2020-07-10 19:02:20,066 INFO L280 TraceCheckUtils]: 33: Hoare triple {466#true} ~pa~0.base, ~pa~0.offset := ~pb~0.base, ~pb~0.offset; {484#(and (= main_~pb~0.offset main_~pa~0.offset) (= main_~pa~0.base main_~pb~0.base))} is VALID [2020-07-10 19:02:20,067 INFO L280 TraceCheckUtils]: 34: Hoare triple {484#(and (= main_~pb~0.offset main_~pa~0.offset) (= main_~pa~0.base main_~pb~0.base))} havoc #t~ret4.base, #t~ret4.offset; {484#(and (= main_~pb~0.offset main_~pa~0.offset) (= main_~pa~0.base main_~pb~0.base))} is VALID [2020-07-10 19:02:20,068 INFO L280 TraceCheckUtils]: 35: Hoare triple {484#(and (= main_~pb~0.offset main_~pa~0.offset) (= main_~pa~0.base main_~pb~0.base))} #t~short8 := ~pc~0.base == 0 && ~pc~0.offset == 0; {484#(and (= main_~pb~0.offset main_~pa~0.offset) (= main_~pa~0.base main_~pb~0.base))} is VALID [2020-07-10 19:02:20,068 INFO L280 TraceCheckUtils]: 36: Hoare triple {484#(and (= main_~pb~0.offset main_~pa~0.offset) (= main_~pa~0.base main_~pb~0.base))} assume !#t~short8; {484#(and (= main_~pb~0.offset main_~pa~0.offset) (= main_~pa~0.base main_~pb~0.base))} is VALID [2020-07-10 19:02:20,069 INFO L280 TraceCheckUtils]: 37: Hoare triple {484#(and (= main_~pb~0.offset main_~pa~0.offset) (= main_~pa~0.base main_~pb~0.base))} #t~short7 := ~pa~0.base == ~pb~0.base && ~pa~0.offset == ~pb~0.offset; {485#|main_#t~short7|} is VALID [2020-07-10 19:02:20,070 INFO L280 TraceCheckUtils]: 38: Hoare triple {485#|main_#t~short7|} assume !#t~short7; {467#false} is VALID [2020-07-10 19:02:20,070 INFO L280 TraceCheckUtils]: 39: Hoare triple {467#false} #t~short8 := #t~short7; {467#false} is VALID [2020-07-10 19:02:20,070 INFO L280 TraceCheckUtils]: 40: Hoare triple {467#false} assume #t~short8; {467#false} is VALID [2020-07-10 19:02:20,071 INFO L280 TraceCheckUtils]: 41: Hoare triple {467#false} havoc #t~short7; {467#false} is VALID [2020-07-10 19:02:20,071 INFO L280 TraceCheckUtils]: 42: Hoare triple {467#false} havoc #t~short8; {467#false} is VALID [2020-07-10 19:02:20,071 INFO L280 TraceCheckUtils]: 43: Hoare triple {467#false} havoc #t~mem5; {467#false} is VALID [2020-07-10 19:02:20,072 INFO L280 TraceCheckUtils]: 44: Hoare triple {467#false} havoc #t~mem6; {467#false} is VALID [2020-07-10 19:02:20,072 INFO L280 TraceCheckUtils]: 45: Hoare triple {467#false} assume !false; {467#false} is VALID [2020-07-10 19:02:20,075 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:20,075 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 19:02:20,076 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1863569372] [2020-07-10 19:02:20,076 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 19:02:20,076 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-10 19:02:20,076 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120053015] [2020-07-10 19:02:20,077 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2020-07-10 19:02:20,078 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 19:02:20,078 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-10 19:02:20,126 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:20,126 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-10 19:02:20,127 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 19:02:20,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-10 19:02:20,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-10 19:02:20,127 INFO L87 Difference]: Start difference. First operand 51 states and 52 transitions. Second operand 5 states. [2020-07-10 19:02:20,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 19:02:20,553 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2020-07-10 19:02:20,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-10 19:02:20,553 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2020-07-10 19:02:20,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 19:02:20,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 19:02:20,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 59 transitions. [2020-07-10 19:02:20,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 19:02:20,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 59 transitions. [2020-07-10 19:02:20,559 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 59 transitions. [2020-07-10 19:02:20,637 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 19:02:20,640 INFO L225 Difference]: With dead ends: 59 [2020-07-10 19:02:20,640 INFO L226 Difference]: Without dead ends: 51 [2020-07-10 19:02:20,641 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:20,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2020-07-10 19:02:20,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2020-07-10 19:02:20,781 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 19:02:20,782 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand 51 states. [2020-07-10 19:02:20,782 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand 51 states. [2020-07-10 19:02:20,782 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 51 states. [2020-07-10 19:02:20,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 19:02:20,785 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2020-07-10 19:02:20,785 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2020-07-10 19:02:20,786 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 19:02:20,786 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 19:02:20,786 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand 51 states. [2020-07-10 19:02:20,786 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 51 states. [2020-07-10 19:02:20,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 19:02:20,789 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2020-07-10 19:02:20,790 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2020-07-10 19:02:20,790 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 19:02:20,790 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 19:02:20,791 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 19:02:20,791 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 19:02:20,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2020-07-10 19:02:20,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2020-07-10 19:02:20,793 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 46 [2020-07-10 19:02:20,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 19:02:20,794 INFO L479 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2020-07-10 19:02:20,794 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-10 19:02:20,794 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 51 states and 51 transitions. [2020-07-10 19:02:20,853 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 19:02:20,853 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2020-07-10 19:02:20,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2020-07-10 19:02:20,856 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 19:02:20,856 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:20,856 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-10 19:02:20,857 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 19:02:20,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 19:02:20,857 INFO L82 PathProgramCache]: Analyzing trace with hash 1590234488, now seen corresponding path program 1 times [2020-07-10 19:02:20,857 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 19:02:20,858 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1139325367] [2020-07-10 19:02:20,858 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 19:02:20,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 19:02:20,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 19:02:21,006 INFO L280 TraceCheckUtils]: 0: Hoare triple {836#(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; {813#true} is VALID [2020-07-10 19:02:21,006 INFO L280 TraceCheckUtils]: 1: Hoare triple {813#true} #valid := #valid[0 := 0]; {813#true} is VALID [2020-07-10 19:02:21,007 INFO L280 TraceCheckUtils]: 2: Hoare triple {813#true} assume 0 < #StackHeapBarrier; {813#true} is VALID [2020-07-10 19:02:21,007 INFO L280 TraceCheckUtils]: 3: Hoare triple {813#true} SUMMARY for call ~#a~0.base, ~#a~0.offset := #Ultimate.allocOnStack(4); srcloc: L5 {813#true} is VALID [2020-07-10 19:02:21,007 INFO L280 TraceCheckUtils]: 4: Hoare triple {813#true} SUMMARY for call write~init~int(0, ~#a~0.base, ~#a~0.offset, 4); srcloc: L5-1 {813#true} is VALID [2020-07-10 19:02:21,007 INFO L280 TraceCheckUtils]: 5: Hoare triple {813#true} SUMMARY for call ~#b~0.base, ~#b~0.offset := #Ultimate.allocOnStack(4); srcloc: L5-2 {813#true} is VALID [2020-07-10 19:02:21,008 INFO L280 TraceCheckUtils]: 6: Hoare triple {813#true} SUMMARY for call write~init~int(0, ~#b~0.base, ~#b~0.offset, 4); srcloc: L5-3 {813#true} is VALID [2020-07-10 19:02:21,008 INFO L280 TraceCheckUtils]: 7: Hoare triple {813#true} assume true; {813#true} is VALID [2020-07-10 19:02:21,008 INFO L275 TraceCheckUtils]: 8: Hoare quadruple {813#true} {813#true} #81#return; {813#true} is VALID [2020-07-10 19:02:21,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 19:02:21,014 INFO L280 TraceCheckUtils]: 0: Hoare triple {813#true} assume 0 != #t~nondet0 % 256; {813#true} is VALID [2020-07-10 19:02:21,014 INFO L280 TraceCheckUtils]: 1: Hoare triple {813#true} #t~ite1.base, #t~ite1.offset := ~#a~0.base, ~#a~0.offset; {813#true} is VALID [2020-07-10 19:02:21,014 INFO L280 TraceCheckUtils]: 2: Hoare triple {813#true} #res.base, #res.offset := #t~ite1.base, #t~ite1.offset; {813#true} is VALID [2020-07-10 19:02:21,015 INFO L280 TraceCheckUtils]: 3: Hoare triple {813#true} havoc #t~ite1.base, #t~ite1.offset; {813#true} is VALID [2020-07-10 19:02:21,015 INFO L280 TraceCheckUtils]: 4: Hoare triple {813#true} havoc #t~nondet0; {813#true} is VALID [2020-07-10 19:02:21,015 INFO L280 TraceCheckUtils]: 5: Hoare triple {813#true} assume true; {813#true} is VALID [2020-07-10 19:02:21,015 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {813#true} {813#true} #85#return; {813#true} is VALID [2020-07-10 19:02:21,017 INFO L263 TraceCheckUtils]: 0: Hoare triple {813#true} call ULTIMATE.init(); {836#(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:21,017 INFO L280 TraceCheckUtils]: 1: Hoare triple {836#(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; {813#true} is VALID [2020-07-10 19:02:21,017 INFO L280 TraceCheckUtils]: 2: Hoare triple {813#true} #valid := #valid[0 := 0]; {813#true} is VALID [2020-07-10 19:02:21,018 INFO L280 TraceCheckUtils]: 3: Hoare triple {813#true} assume 0 < #StackHeapBarrier; {813#true} is VALID [2020-07-10 19:02:21,018 INFO L280 TraceCheckUtils]: 4: Hoare triple {813#true} SUMMARY for call ~#a~0.base, ~#a~0.offset := #Ultimate.allocOnStack(4); srcloc: L5 {813#true} is VALID [2020-07-10 19:02:21,018 INFO L280 TraceCheckUtils]: 5: Hoare triple {813#true} SUMMARY for call write~init~int(0, ~#a~0.base, ~#a~0.offset, 4); srcloc: L5-1 {813#true} is VALID [2020-07-10 19:02:21,018 INFO L280 TraceCheckUtils]: 6: Hoare triple {813#true} SUMMARY for call ~#b~0.base, ~#b~0.offset := #Ultimate.allocOnStack(4); srcloc: L5-2 {813#true} is VALID [2020-07-10 19:02:21,019 INFO L280 TraceCheckUtils]: 7: Hoare triple {813#true} SUMMARY for call write~init~int(0, ~#b~0.base, ~#b~0.offset, 4); srcloc: L5-3 {813#true} is VALID [2020-07-10 19:02:21,019 INFO L280 TraceCheckUtils]: 8: Hoare triple {813#true} assume true; {813#true} is VALID [2020-07-10 19:02:21,019 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {813#true} {813#true} #81#return; {813#true} is VALID [2020-07-10 19:02:21,019 INFO L263 TraceCheckUtils]: 10: Hoare triple {813#true} call #t~ret9 := main(); {813#true} is VALID [2020-07-10 19:02:21,020 INFO L280 TraceCheckUtils]: 11: Hoare triple {813#true} havoc ~a~1; {813#true} is VALID [2020-07-10 19:02:21,020 INFO L280 TraceCheckUtils]: 12: Hoare triple {813#true} havoc ~b~1; {813#true} is VALID [2020-07-10 19:02:21,020 INFO L280 TraceCheckUtils]: 13: Hoare triple {813#true} SUMMARY for call ~#c~0.base, ~#c~0.offset := #Ultimate.allocOnStack(4); srcloc: L13-1 {813#true} is VALID [2020-07-10 19:02:21,020 INFO L280 TraceCheckUtils]: 14: Hoare triple {813#true} SUMMARY for call write~init~int(5, ~#c~0.base, ~#c~0.offset, 4); srcloc: L13-2 {813#true} is VALID [2020-07-10 19:02:21,021 INFO L280 TraceCheckUtils]: 15: Hoare triple {813#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {813#true} is VALID [2020-07-10 19:02:21,021 INFO L280 TraceCheckUtils]: 16: Hoare triple {813#true} ~a~1 := #t~nondet2; {813#true} is VALID [2020-07-10 19:02:21,021 INFO L280 TraceCheckUtils]: 17: Hoare triple {813#true} havoc #t~nondet2; {813#true} is VALID [2020-07-10 19:02:21,021 INFO L280 TraceCheckUtils]: 18: Hoare triple {813#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {813#true} is VALID [2020-07-10 19:02:21,022 INFO L280 TraceCheckUtils]: 19: Hoare triple {813#true} ~b~1 := #t~nondet3; {813#true} is VALID [2020-07-10 19:02:21,022 INFO L280 TraceCheckUtils]: 20: Hoare triple {813#true} havoc #t~nondet3; {813#true} is VALID [2020-07-10 19:02:21,022 INFO L280 TraceCheckUtils]: 21: Hoare triple {813#true} havoc ~pa~0.base, ~pa~0.offset; {813#true} is VALID [2020-07-10 19:02:21,022 INFO L280 TraceCheckUtils]: 22: Hoare triple {813#true} havoc ~pb~0.base, ~pb~0.offset; {813#true} is VALID [2020-07-10 19:02:21,023 INFO L280 TraceCheckUtils]: 23: Hoare triple {813#true} ~pc~0.base, ~pc~0.offset := ~#c~0.base, ~#c~0.offset; {813#true} is VALID [2020-07-10 19:02:21,023 INFO L263 TraceCheckUtils]: 24: Hoare triple {813#true} call #t~ret4.base, #t~ret4.offset := get_dummy(); {813#true} is VALID [2020-07-10 19:02:21,023 INFO L280 TraceCheckUtils]: 25: Hoare triple {813#true} assume 0 != #t~nondet0 % 256; {813#true} is VALID [2020-07-10 19:02:21,024 INFO L280 TraceCheckUtils]: 26: Hoare triple {813#true} #t~ite1.base, #t~ite1.offset := ~#a~0.base, ~#a~0.offset; {813#true} is VALID [2020-07-10 19:02:21,024 INFO L280 TraceCheckUtils]: 27: Hoare triple {813#true} #res.base, #res.offset := #t~ite1.base, #t~ite1.offset; {813#true} is VALID [2020-07-10 19:02:21,024 INFO L280 TraceCheckUtils]: 28: Hoare triple {813#true} havoc #t~ite1.base, #t~ite1.offset; {813#true} is VALID [2020-07-10 19:02:21,024 INFO L280 TraceCheckUtils]: 29: Hoare triple {813#true} havoc #t~nondet0; {813#true} is VALID [2020-07-10 19:02:21,025 INFO L280 TraceCheckUtils]: 30: Hoare triple {813#true} assume true; {813#true} is VALID [2020-07-10 19:02:21,025 INFO L275 TraceCheckUtils]: 31: Hoare quadruple {813#true} {813#true} #85#return; {813#true} is VALID [2020-07-10 19:02:21,025 INFO L280 TraceCheckUtils]: 32: Hoare triple {813#true} ~pb~0.base, ~pb~0.offset := #t~ret4.base, #t~ret4.offset; {813#true} is VALID [2020-07-10 19:02:21,028 INFO L280 TraceCheckUtils]: 33: Hoare triple {813#true} ~pa~0.base, ~pa~0.offset := ~pb~0.base, ~pb~0.offset; {831#(and (= main_~pb~0.offset main_~pa~0.offset) (= main_~pa~0.base main_~pb~0.base))} is VALID [2020-07-10 19:02:21,028 INFO L280 TraceCheckUtils]: 34: Hoare triple {831#(and (= main_~pb~0.offset main_~pa~0.offset) (= main_~pa~0.base main_~pb~0.base))} havoc #t~ret4.base, #t~ret4.offset; {831#(and (= main_~pb~0.offset main_~pa~0.offset) (= main_~pa~0.base main_~pb~0.base))} is VALID [2020-07-10 19:02:21,029 INFO L280 TraceCheckUtils]: 35: Hoare triple {831#(and (= main_~pb~0.offset main_~pa~0.offset) (= main_~pa~0.base main_~pb~0.base))} #t~short8 := ~pc~0.base == 0 && ~pc~0.offset == 0; {831#(and (= main_~pb~0.offset main_~pa~0.offset) (= main_~pa~0.base main_~pb~0.base))} is VALID [2020-07-10 19:02:21,029 INFO L280 TraceCheckUtils]: 36: Hoare triple {831#(and (= main_~pb~0.offset main_~pa~0.offset) (= main_~pa~0.base main_~pb~0.base))} assume !#t~short8; {831#(and (= main_~pb~0.offset main_~pa~0.offset) (= main_~pa~0.base main_~pb~0.base))} is VALID [2020-07-10 19:02:21,030 INFO L280 TraceCheckUtils]: 37: Hoare triple {831#(and (= main_~pb~0.offset main_~pa~0.offset) (= main_~pa~0.base main_~pb~0.base))} #t~short7 := ~pa~0.base == ~pb~0.base && ~pa~0.offset == ~pb~0.offset; {831#(and (= main_~pb~0.offset main_~pa~0.offset) (= main_~pa~0.base main_~pb~0.base))} is VALID [2020-07-10 19:02:21,031 INFO L280 TraceCheckUtils]: 38: Hoare triple {831#(and (= main_~pb~0.offset main_~pa~0.offset) (= main_~pa~0.base main_~pb~0.base))} assume #t~short7; {831#(and (= main_~pb~0.offset main_~pa~0.offset) (= main_~pa~0.base main_~pb~0.base))} is VALID [2020-07-10 19:02:21,032 INFO L280 TraceCheckUtils]: 39: Hoare triple {831#(and (= main_~pb~0.offset main_~pa~0.offset) (= main_~pa~0.base main_~pb~0.base))} SUMMARY for call #t~mem5 := read~int(~pa~0.base, ~pa~0.offset, 4); srcloc: L19-2 {832#(= (select (select |#memory_int| main_~pb~0.base) main_~pb~0.offset) |main_#t~mem5|)} is VALID [2020-07-10 19:02:21,032 INFO L280 TraceCheckUtils]: 40: Hoare triple {832#(= (select (select |#memory_int| main_~pb~0.base) main_~pb~0.offset) |main_#t~mem5|)} SUMMARY for call #t~mem6 := read~int(~pb~0.base, ~pb~0.offset, 4); srcloc: L19-3 {833#(= |main_#t~mem6| |main_#t~mem5|)} is VALID [2020-07-10 19:02:21,033 INFO L280 TraceCheckUtils]: 41: Hoare triple {833#(= |main_#t~mem6| |main_#t~mem5|)} #t~short7 := #t~mem5 != #t~mem6; {834#(not |main_#t~short7|)} is VALID [2020-07-10 19:02:21,033 INFO L280 TraceCheckUtils]: 42: Hoare triple {834#(not |main_#t~short7|)} #t~short8 := #t~short7; {835#(not |main_#t~short8|)} is VALID [2020-07-10 19:02:21,034 INFO L280 TraceCheckUtils]: 43: Hoare triple {835#(not |main_#t~short8|)} assume #t~short8; {814#false} is VALID [2020-07-10 19:02:21,034 INFO L280 TraceCheckUtils]: 44: Hoare triple {814#false} havoc #t~short7; {814#false} is VALID [2020-07-10 19:02:21,034 INFO L280 TraceCheckUtils]: 45: Hoare triple {814#false} havoc #t~short8; {814#false} is VALID [2020-07-10 19:02:21,034 INFO L280 TraceCheckUtils]: 46: Hoare triple {814#false} havoc #t~mem5; {814#false} is VALID [2020-07-10 19:02:21,035 INFO L280 TraceCheckUtils]: 47: Hoare triple {814#false} havoc #t~mem6; {814#false} is VALID [2020-07-10 19:02:21,035 INFO L280 TraceCheckUtils]: 48: Hoare triple {814#false} assume !false; {814#false} is VALID [2020-07-10 19:02:21,038 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:21,039 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 19:02:21,039 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1139325367] [2020-07-10 19:02:21,039 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 19:02:21,039 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-07-10 19:02:21,040 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077098920] [2020-07-10 19:02:21,040 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 49 [2020-07-10 19:02:21,040 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 19:02:21,041 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-10 19:02:21,094 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:21,094 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-10 19:02:21,095 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 19:02:21,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-10 19:02:21,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2020-07-10 19:02:21,096 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 8 states. [2020-07-10 19:02:21,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 19:02:21,633 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2020-07-10 19:02:21,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-10 19:02:21,634 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 49 [2020-07-10 19:02:21,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 19:02:21,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-10 19:02:21,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 51 transitions. [2020-07-10 19:02:21,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-10 19:02:21,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 51 transitions. [2020-07-10 19:02:21,645 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 51 transitions. [2020-07-10 19:02:21,719 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 19:02:21,720 INFO L225 Difference]: With dead ends: 51 [2020-07-10 19:02:21,720 INFO L226 Difference]: Without dead ends: 0 [2020-07-10 19:02:21,721 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2020-07-10 19:02:21,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-10 19:02:21,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-10 19:02:21,722 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 19:02:21,722 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-10 19:02:21,723 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-10 19:02:21,723 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-10 19:02:21,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 19:02:21,723 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-10 19:02:21,723 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 19:02:21,723 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 19:02:21,724 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 19:02:21,724 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-10 19:02:21,724 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-10 19:02:21,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 19:02:21,725 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-10 19:02:21,725 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 19:02:21,725 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 19:02:21,725 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 19:02:21,725 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 19:02:21,725 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 19:02:21,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-10 19:02:21,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-10 19:02:21,726 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 49 [2020-07-10 19:02:21,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 19:02:21,726 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-10 19:02:21,726 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-10 19:02:21,727 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2020-07-10 19:02:21,727 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:21,727 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 19:02:21,727 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 19:02:21,728 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-10 19:02:21,731 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-10 19:02:22,226 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-10 19:02:22,226 INFO L271 CegarLoopResult]: At program point L-1-1(line -1) the Hoare annotation is: true [2020-07-10 19:02:22,226 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line 5) the Hoare annotation is: true [2020-07-10 19:02:22,226 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:22,227 INFO L271 CegarLoopResult]: At program point L5(line 5) the Hoare annotation is: true [2020-07-10 19:02:22,227 INFO L271 CegarLoopResult]: At program point L5-1(line 5) the Hoare annotation is: true [2020-07-10 19:02:22,227 INFO L271 CegarLoopResult]: At program point L5-2(line 5) the Hoare annotation is: true [2020-07-10 19:02:22,227 INFO L271 CegarLoopResult]: At program point L5-3(line 5) the Hoare annotation is: true [2020-07-10 19:02:22,227 INFO L271 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-07-10 19:02:22,227 INFO L271 CegarLoopResult]: At program point get_dummyFINAL(lines 7 10) the Hoare annotation is: true [2020-07-10 19:02:22,227 INFO L271 CegarLoopResult]: At program point L9(line 9) the Hoare annotation is: true [2020-07-10 19:02:22,227 INFO L271 CegarLoopResult]: At program point get_dummyENTRY(lines 7 10) the Hoare annotation is: true [2020-07-10 19:02:22,228 INFO L271 CegarLoopResult]: At program point L9-2(line 9) the Hoare annotation is: true [2020-07-10 19:02:22,228 INFO L271 CegarLoopResult]: At program point L9-3(line 9) the Hoare annotation is: true [2020-07-10 19:02:22,228 INFO L271 CegarLoopResult]: At program point L9-4(line 9) the Hoare annotation is: true [2020-07-10 19:02:22,228 INFO L271 CegarLoopResult]: At program point L9-5(line 9) the Hoare annotation is: true [2020-07-10 19:02:22,228 INFO L271 CegarLoopResult]: At program point get_dummyEXIT(lines 7 10) the Hoare annotation is: true [2020-07-10 19:02:22,228 INFO L271 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-07-10 19:02:22,228 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-10 19:02:22,228 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-10 19:02:22,228 INFO L271 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-07-10 19:02:22,229 INFO L264 CegarLoopResult]: At program point mainEXIT(lines 12 27) the Hoare annotation is: (not (= 0 main_~pc~0.base)) [2020-07-10 19:02:22,229 INFO L264 CegarLoopResult]: At program point L23(line 23) the Hoare annotation is: (and (not (= 0 |main_~#c~0.base|)) (not (= 0 main_~pc~0.base))) [2020-07-10 19:02:22,229 INFO L264 CegarLoopResult]: At program point L19(line 19) the Hoare annotation is: (and (not |main_#t~short8|) (not (= 0 |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:22,229 INFO L264 CegarLoopResult]: At program point L19-1(line 19) the Hoare annotation is: (and |main_#t~short7| (not |main_#t~short8|) (not (= 0 |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:22,229 INFO L264 CegarLoopResult]: At program point L19-2(line 19) the Hoare annotation is: (and |main_#t~short7| (not |main_#t~short8|) (not (= 0 |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:22,229 INFO L264 CegarLoopResult]: At program point L19-3(line 19) the Hoare annotation is: (and |main_#t~short7| (not |main_#t~short8|) (not (= 0 |main_~#c~0.base|)) (not (= 0 main_~pc~0.base)) (= main_~pb~0.offset main_~pa~0.offset) (= (select (select |#memory_int| main_~pb~0.base) main_~pb~0.offset) |main_#t~mem5|) (= main_~pa~0.base main_~pb~0.base)) [2020-07-10 19:02:22,230 INFO L264 CegarLoopResult]: At program point L15(line 15) the Hoare annotation is: (not (= 0 |main_~#c~0.base|)) [2020-07-10 19:02:22,230 INFO L264 CegarLoopResult]: At program point L19-4(line 19) the Hoare annotation is: (and |main_#t~short7| (not |main_#t~short8|) (not (= 0 |main_~#c~0.base|)) (= |main_#t~mem6| |main_#t~mem5|) (not (= 0 main_~pc~0.base)) (= main_~pb~0.offset main_~pa~0.offset) (= (select (select |#memory_int| main_~pb~0.base) main_~pb~0.offset) |main_#t~mem5|) (= main_~pa~0.base main_~pb~0.base)) [2020-07-10 19:02:22,230 INFO L264 CegarLoopResult]: At program point L15-1(line 15) the Hoare annotation is: (not (= 0 |main_~#c~0.base|)) [2020-07-10 19:02:22,230 INFO L264 CegarLoopResult]: At program point L15-2(line 15) the Hoare annotation is: (not (= 0 |main_~#c~0.base|)) [2020-07-10 19:02:22,230 INFO L264 CegarLoopResult]: At program point L19-6(line 19) the Hoare annotation is: (and (not |main_#t~short8|) (not (= 0 |main_~#c~0.base|)) (not |main_#t~short7|) (= |main_#t~mem6| |main_#t~mem5|) (not (= 0 main_~pc~0.base)) (= main_~pb~0.offset main_~pa~0.offset) (= (select (select |#memory_int| main_~pb~0.base) main_~pb~0.offset) |main_#t~mem5|) (= main_~pa~0.base main_~pb~0.base)) [2020-07-10 19:02:22,231 INFO L264 CegarLoopResult]: At program point L19-7(line 19) the Hoare annotation is: false [2020-07-10 19:02:22,231 INFO L264 CegarLoopResult]: At program point L19-8(line 19) the Hoare annotation is: false [2020-07-10 19:02:22,231 INFO L264 CegarLoopResult]: At program point L19-9(line 19) the Hoare annotation is: false [2020-07-10 19:02:22,231 INFO L264 CegarLoopResult]: At program point L19-10(line 19) the Hoare annotation is: (and (not |main_#t~short8|) (not (= 0 |main_~#c~0.base|)) (not (= 0 main_~pc~0.base))) [2020-07-10 19:02:22,231 INFO L264 CegarLoopResult]: At program point L19-11(line 19) the Hoare annotation is: (and (not (= 0 |main_~#c~0.base|)) (not (= 0 main_~pc~0.base))) [2020-07-10 19:02:22,231 INFO L264 CegarLoopResult]: At program point L19-12(line 19) the Hoare annotation is: (and (not (= 0 |main_~#c~0.base|)) (not (= 0 main_~pc~0.base))) [2020-07-10 19:02:22,232 INFO L264 CegarLoopResult]: At program point L20(lines 12 27) the Hoare annotation is: false [2020-07-10 19:02:22,232 INFO L264 CegarLoopResult]: At program point L16(line 16) the Hoare annotation is: (not (= 0 |main_~#c~0.base|)) [2020-07-10 19:02:22,232 INFO L264 CegarLoopResult]: At program point L16-1(line 16) the Hoare annotation is: (not (= 0 |main_~#c~0.base|)) [2020-07-10 19:02:22,232 INFO L264 CegarLoopResult]: At program point L16-2(line 16) the Hoare annotation is: (not (= 0 |main_~#c~0.base|)) [2020-07-10 19:02:22,232 INFO L264 CegarLoopResult]: At program point L17(line 17) the Hoare annotation is: (and (not (= 0 |main_~#c~0.base|)) (not (= 0 main_~pc~0.base))) [2020-07-10 19:02:22,232 INFO L264 CegarLoopResult]: At program point L17-1(line 17) the Hoare annotation is: (and (not (= 0 |main_~#c~0.base|)) (not (= 0 main_~pc~0.base))) [2020-07-10 19:02:22,232 INFO L264 CegarLoopResult]: At program point L17-2(line 17) the Hoare annotation is: (and (not (= 0 |main_~#c~0.base|)) (not (= 0 main_~pc~0.base))) [2020-07-10 19:02:22,233 INFO L264 CegarLoopResult]: At program point L17-3(line 17) the Hoare annotation is: (and (not (= 0 |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:22,233 INFO L264 CegarLoopResult]: At program point L13(line 13) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |old(#length)| |#length|)) [2020-07-10 19:02:22,233 INFO L264 CegarLoopResult]: At program point mainFINAL(lines 12 27) the Hoare annotation is: (not (= 0 main_~pc~0.base)) [2020-07-10 19:02:22,233 INFO L264 CegarLoopResult]: At program point L13-1(line 13) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |old(#length)| |#length|)) [2020-07-10 19:02:22,233 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:22,234 INFO L264 CegarLoopResult]: At program point L13-3(line 13) the Hoare annotation is: (not (= 0 |main_~#c~0.base|)) [2020-07-10 19:02:22,234 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:22,234 INFO L264 CegarLoopResult]: At program point L13-5(line 13) the Hoare annotation is: (and (not (= 0 |main_~#c~0.base|)) (not (= 0 main_~pc~0.base))) [2020-07-10 19:02:22,234 INFO L264 CegarLoopResult]: At program point L13-6(line 13) the Hoare annotation is: false [2020-07-10 19:02:22,234 INFO L264 CegarLoopResult]: At program point L13-7(line 13) the Hoare annotation is: false [2020-07-10 19:02:22,234 INFO L264 CegarLoopResult]: At program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 25) the Hoare annotation is: false [2020-07-10 19:02:22,235 INFO L264 CegarLoopResult]: At program point mainENTRY(lines 12 27) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |old(#length)| |#length|)) [2020-07-10 19:02:22,235 INFO L264 CegarLoopResult]: At program point L26(line 26) the Hoare annotation is: false [2020-07-10 19:02:22,235 INFO L264 CegarLoopResult]: At program point L18(lines 18 19) the Hoare annotation is: (and (not (= 0 |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:22,235 INFO L264 CegarLoopResult]: At program point L18-1(lines 18 19) the Hoare annotation is: (and (not |main_#t~short8|) (not (= 0 |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:22,235 INFO L264 CegarLoopResult]: At program point L18-3(lines 18 21) the Hoare annotation is: (and (not |main_#t~short8|) (not (= 0 |main_~#c~0.base|)) (not |main_#t~short7|) (= |main_#t~mem6| |main_#t~mem5|) (not (= 0 main_~pc~0.base)) (= main_~pb~0.offset main_~pa~0.offset) (= (select (select |#memory_int| main_~pb~0.base) main_~pb~0.offset) |main_#t~mem5|) (= main_~pa~0.base main_~pb~0.base)) [2020-07-10 19:02:22,236 INFO L264 CegarLoopResult]: At program point L14(line 14) the Hoare annotation is: (not (= 0 |main_~#c~0.base|)) [2020-07-10 19:02:22,236 INFO L264 CegarLoopResult]: At program point L18-4(lines 18 19) the Hoare annotation is: false [2020-07-10 19:02:22,236 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:22,236 INFO L264 CegarLoopResult]: At program point L18-5(lines 18 19) the Hoare annotation is: (and (not |main_#t~short8|) (not (= 0 |main_~#c~0.base|)) (not (= 0 main_~pc~0.base))) [2020-07-10 19:02:22,261 INFO L163 areAnnotationChecker]: CFG has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-10 19:02:22,272 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.07 07:02:22 BoogieIcfgContainer [2020-07-10 19:02:22,273 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-10 19:02:22,275 INFO L168 Benchmark]: Toolchain (without parser) took 5117.24 ms. Allocated memory was 138.9 MB in the beginning and 279.4 MB in the end (delta: 140.5 MB). Free memory was 104.2 MB in the beginning and 99.2 MB in the end (delta: 5.0 MB). Peak memory consumption was 145.5 MB. Max. memory is 7.1 GB. [2020-07-10 19:02:22,276 INFO L168 Benchmark]: CDTParser took 0.81 ms. Allocated memory is still 138.9 MB. Free memory was 122.4 MB in the beginning and 122.1 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2020-07-10 19:02:22,277 INFO L168 Benchmark]: CACSL2BoogieTranslator took 254.28 ms. Allocated memory is still 138.9 MB. Free memory was 103.8 MB in the beginning and 93.2 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2020-07-10 19:02:22,278 INFO L168 Benchmark]: Boogie Preprocessor took 124.13 ms. Allocated memory was 138.9 MB in the beginning and 203.4 MB in the end (delta: 64.5 MB). Free memory was 93.2 MB in the beginning and 181.0 MB in the end (delta: -87.8 MB). Peak memory consumption was 14.2 MB. Max. memory is 7.1 GB. [2020-07-10 19:02:22,279 INFO L168 Benchmark]: RCFGBuilder took 552.39 ms. Allocated memory is still 203.4 MB. Free memory was 181.0 MB in the beginning and 154.0 MB in the end (delta: 27.0 MB). Peak memory consumption was 27.0 MB. Max. memory is 7.1 GB. [2020-07-10 19:02:22,280 INFO L168 Benchmark]: TraceAbstraction took 4181.30 ms. Allocated memory was 203.4 MB in the beginning and 279.4 MB in the end (delta: 76.0 MB). Free memory was 153.4 MB in the beginning and 99.2 MB in the end (delta: 54.2 MB). Peak memory consumption was 130.2 MB. Max. memory is 7.1 GB. [2020-07-10 19:02:22,283 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.81 ms. Allocated memory is still 138.9 MB. Free memory was 122.4 MB in the beginning and 122.1 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 254.28 ms. Allocated memory is still 138.9 MB. Free memory was 103.8 MB in the beginning and 93.2 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 124.13 ms. Allocated memory was 138.9 MB in the beginning and 203.4 MB in the end (delta: 64.5 MB). Free memory was 93.2 MB in the beginning and 181.0 MB in the end (delta: -87.8 MB). Peak memory consumption was 14.2 MB. Max. memory is 7.1 GB. * RCFGBuilder took 552.39 ms. Allocated memory is still 203.4 MB. Free memory was 181.0 MB in the beginning and 154.0 MB in the end (delta: 27.0 MB). Peak memory consumption was 27.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 4181.30 ms. Allocated memory was 203.4 MB in the beginning and 279.4 MB in the end (delta: 76.0 MB). Free memory was 153.4 MB in the beginning and 99.2 MB in the end (delta: 54.2 MB). Peak memory consumption was 130.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 25]: 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, 65 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 3.5s, OverallIterations: 3, TraceHistogramMax: 1, AutomataDifference: 1.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.4s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 136 SDtfs, 114 SDslu, 264 SDs, 0 SdLazy, 273 SolverSat, 13 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 35 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=65occurred 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.3s AutomataMinimizationTime, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 65 LocationsWithAnnotation, 65 PreInvPairs, 78 NumberOfFragments, 428 HoareAnnotationTreeSize, 65 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 65 FomulaSimplificationsInter, 246 FormulaSimplificationTreeSizeReductionInter, 0.2s 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...