/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml --traceabstraction.compute.interpolants.along.a.counterexample Craig_NestedInterpolation --traceabstraction.use.separate.solver.for.trace.checks true -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/ldv-regression/test22-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-46f3038-m [2020-07-08 22:23:11,909 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-08 22:23:11,912 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-08 22:23:11,932 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-08 22:23:11,933 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-08 22:23:11,935 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-08 22:23:11,937 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-08 22:23:11,949 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-08 22:23:11,950 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-08 22:23:11,951 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-08 22:23:11,952 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-08 22:23:11,953 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-08 22:23:11,958 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-08 22:23:11,959 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-08 22:23:11,961 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-08 22:23:11,962 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-08 22:23:11,962 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-08 22:23:11,963 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-08 22:23:11,969 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-08 22:23:11,973 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-08 22:23:11,975 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-08 22:23:11,976 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-08 22:23:11,980 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-08 22:23:11,981 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-08 22:23:11,985 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-08 22:23:11,986 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-08 22:23:11,986 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-08 22:23:11,989 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-08 22:23:11,989 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-08 22:23:11,990 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-08 22:23:11,990 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-08 22:23:11,992 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-08 22:23:11,994 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-08 22:23:11,995 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-08 22:23:11,999 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-08 22:23:11,999 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-08 22:23:12,000 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-08 22:23:12,001 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-08 22:23:12,001 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-08 22:23:12,002 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-08 22:23:12,003 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-08 22:23:12,004 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-08 22:23:12,021 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-08 22:23:12,022 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-08 22:23:12,024 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-08 22:23:12,024 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-08 22:23:12,025 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-08 22:23:12,025 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-08 22:23:12,025 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-08 22:23:12,025 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-08 22:23:12,025 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-08 22:23:12,026 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-08 22:23:12,027 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-08 22:23:12,027 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-08 22:23:12,027 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-08 22:23:12,028 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-08 22:23:12,028 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-08 22:23:12,028 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-08 22:23:12,029 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-08 22:23:12,029 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-08 22:23:12,029 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-08 22:23:12,029 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-08 22:23:12,029 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-08 22:23:12,030 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-08 22:23:12,030 INFO L138 SettingsManager]: * Use separate solver for trace checks=false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> Craig_NestedInterpolation Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use separate solver for trace checks -> true [2020-07-08 22:23:12,311 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-08 22:23:12,331 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-08 22:23:12,335 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-08 22:23:12,337 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-08 22:23:12,338 INFO L275 PluginConnector]: CDTParser initialized [2020-07-08 22:23:12,338 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-regression/test22-2.c [2020-07-08 22:23:12,425 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2373c4bcf/469c77bd08d94a4cac949ed0a9f8024b/FLAGcd8ce5695 [2020-07-08 22:23:12,949 INFO L306 CDTParser]: Found 1 translation units. [2020-07-08 22:23:12,950 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-regression/test22-2.c [2020-07-08 22:23:12,957 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2373c4bcf/469c77bd08d94a4cac949ed0a9f8024b/FLAGcd8ce5695 [2020-07-08 22:23:13,285 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2373c4bcf/469c77bd08d94a4cac949ed0a9f8024b [2020-07-08 22:23:13,295 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-08 22:23:13,296 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-08 22:23:13,297 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-08 22:23:13,298 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-08 22:23:13,301 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-08 22:23:13,303 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.07 10:23:13" (1/1) ... [2020-07-08 22:23:13,306 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@38b20f67 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 10:23:13, skipping insertion in model container [2020-07-08 22:23:13,306 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.07 10:23:13" (1/1) ... [2020-07-08 22:23:13,315 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-08 22:23:13,336 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-08 22:23:13,538 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-08 22:23:13,550 INFO L203 MainTranslator]: Completed pre-run [2020-07-08 22:23:13,572 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-08 22:23:13,591 INFO L208 MainTranslator]: Completed translation [2020-07-08 22:23:13,592 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 10:23:13 WrapperNode [2020-07-08 22:23:13,592 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-08 22:23:13,593 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-08 22:23:13,593 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-08 22:23:13,593 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-08 22:23:13,687 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 10:23:13" (1/1) ... [2020-07-08 22:23:13,687 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 10:23:13" (1/1) ... [2020-07-08 22:23:13,696 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 10:23:13" (1/1) ... [2020-07-08 22:23:13,697 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 10:23:13" (1/1) ... [2020-07-08 22:23:13,711 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 10:23:13" (1/1) ... [2020-07-08 22:23:13,717 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 10:23:13" (1/1) ... [2020-07-08 22:23:13,718 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 10:23:13" (1/1) ... [2020-07-08 22:23:13,721 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-08 22:23:13,721 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-08 22:23:13,722 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-08 22:23:13,722 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-08 22:23:13,723 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 10:23:13" (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-08 22:23:13,781 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-08 22:23:13,782 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-08 22:23:13,782 INFO L138 BoogieDeclarations]: Found implementation of procedure init [2020-07-08 22:23:13,782 INFO L138 BoogieDeclarations]: Found implementation of procedure get_dummy [2020-07-08 22:23:13,782 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2020-07-08 22:23:13,782 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-08 22:23:13,782 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-08 22:23:13,782 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-08 22:23:13,783 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2020-07-08 22:23:13,783 INFO L130 BoogieDeclarations]: Found specification of procedure init [2020-07-08 22:23:13,783 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-08 22:23:13,783 INFO L130 BoogieDeclarations]: Found specification of procedure get_dummy [2020-07-08 22:23:13,783 INFO L130 BoogieDeclarations]: Found specification of procedure check [2020-07-08 22:23:13,783 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-08 22:23:13,784 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-08 22:23:13,784 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-08 22:23:13,784 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-08 22:23:13,784 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-07-08 22:23:13,784 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-08 22:23:13,784 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-08 22:23:14,280 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-08 22:23:14,280 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-07-08 22:23:14,286 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.07 10:23:14 BoogieIcfgContainer [2020-07-08 22:23:14,286 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-08 22:23:14,288 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-08 22:23:14,288 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-08 22:23:14,291 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-08 22:23:14,292 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.07 10:23:13" (1/3) ... [2020-07-08 22:23:14,293 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75de37f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.07 10:23:14, skipping insertion in model container [2020-07-08 22:23:14,293 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 10:23:13" (2/3) ... [2020-07-08 22:23:14,294 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75de37f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.07 10:23:14, skipping insertion in model container [2020-07-08 22:23:14,294 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.07 10:23:14" (3/3) ... [2020-07-08 22:23:14,296 INFO L109 eAbstractionObserver]: Analyzing ICFG test22-2.c [2020-07-08 22:23:14,308 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-08 22:23:14,318 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-08 22:23:14,334 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-08 22:23:14,358 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-08 22:23:14,358 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-08 22:23:14,359 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-07-08 22:23:14,359 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-08 22:23:14,359 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-08 22:23:14,360 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-08 22:23:14,360 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-08 22:23:14,360 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-08 22:23:14,379 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states. [2020-07-08 22:23:14,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2020-07-08 22:23:14,394 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 22:23:14,396 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 22:23:14,396 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 22:23:14,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 22:23:14,404 INFO L82 PathProgramCache]: Analyzing trace with hash 2026025413, now seen corresponding path program 1 times [2020-07-08 22:23:14,413 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 22:23:14,414 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [485110937] [2020-07-08 22:23:14,415 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 22:23:14,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 22:23:14,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 22:23:14,782 INFO L280 TraceCheckUtils]: 0: Hoare triple {146#(and (= |~#d2~0.offset| |old(~#d2~0.offset)|) (= |~#d1~0.base| |old(~#d1~0.base)|) (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |~#d2~0.base| |old(~#d2~0.base)|) (= |~#d1~0.offset| |old(~#d1~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#length)| |#length|))} #NULL.base, #NULL.offset := 0, 0; {91#true} is VALID [2020-07-08 22:23:14,782 INFO L280 TraceCheckUtils]: 1: Hoare triple {91#true} #valid := #valid[0 := 0]; {91#true} is VALID [2020-07-08 22:23:14,783 INFO L280 TraceCheckUtils]: 2: Hoare triple {91#true} assume 0 < #StackHeapBarrier; {91#true} is VALID [2020-07-08 22:23:14,783 INFO L280 TraceCheckUtils]: 3: Hoare triple {91#true} SUMMARY for call ~#d1~0.base, ~#d1~0.offset := #Ultimate.allocOnStack(8); srcloc: L9 {91#true} is VALID [2020-07-08 22:23:14,784 INFO L280 TraceCheckUtils]: 4: Hoare triple {91#true} SUMMARY for call write~init~int(0, ~#d1~0.base, ~#d1~0.offset, 4); srcloc: L9-1 {91#true} is VALID [2020-07-08 22:23:14,785 INFO L280 TraceCheckUtils]: 5: Hoare triple {91#true} SUMMARY for call write~init~int(0, ~#d1~0.base, 4 + ~#d1~0.offset, 4); srcloc: L9-2 {91#true} is VALID [2020-07-08 22:23:14,785 INFO L280 TraceCheckUtils]: 6: Hoare triple {91#true} SUMMARY for call ~#d2~0.base, ~#d2~0.offset := #Ultimate.allocOnStack(8); srcloc: L9-3 {91#true} is VALID [2020-07-08 22:23:14,785 INFO L280 TraceCheckUtils]: 7: Hoare triple {91#true} SUMMARY for call write~init~int(0, ~#d2~0.base, ~#d2~0.offset, 4); srcloc: L9-4 {91#true} is VALID [2020-07-08 22:23:14,786 INFO L280 TraceCheckUtils]: 8: Hoare triple {91#true} SUMMARY for call write~init~int(0, ~#d2~0.base, 4 + ~#d2~0.offset, 4); srcloc: L9-5 {91#true} is VALID [2020-07-08 22:23:14,786 INFO L280 TraceCheckUtils]: 9: Hoare triple {91#true} assume true; {91#true} is VALID [2020-07-08 22:23:14,786 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {91#true} {91#true} #123#return; {91#true} is VALID [2020-07-08 22:23:14,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 22:23:14,809 INFO L280 TraceCheckUtils]: 0: Hoare triple {147#(= |#memory_int| |old(#memory_int)|)} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {91#true} is VALID [2020-07-08 22:23:14,810 INFO L280 TraceCheckUtils]: 1: Hoare triple {91#true} SUMMARY for call write~int(#t~nondet0, ~#d1~0.base, ~#d1~0.offset, 4); srcloc: L13 {91#true} is VALID [2020-07-08 22:23:14,810 INFO L280 TraceCheckUtils]: 2: Hoare triple {91#true} havoc #t~nondet0; {91#true} is VALID [2020-07-08 22:23:14,810 INFO L280 TraceCheckUtils]: 3: Hoare triple {91#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {91#true} is VALID [2020-07-08 22:23:14,811 INFO L280 TraceCheckUtils]: 4: Hoare triple {91#true} SUMMARY for call write~int(#t~nondet1, ~#d1~0.base, 4 + ~#d1~0.offset, 4); srcloc: L14-1 {91#true} is VALID [2020-07-08 22:23:14,811 INFO L280 TraceCheckUtils]: 5: Hoare triple {91#true} havoc #t~nondet1; {91#true} is VALID [2020-07-08 22:23:14,811 INFO L280 TraceCheckUtils]: 6: Hoare triple {91#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {91#true} is VALID [2020-07-08 22:23:14,812 INFO L280 TraceCheckUtils]: 7: Hoare triple {91#true} SUMMARY for call write~int(#t~nondet2, ~#d2~0.base, ~#d2~0.offset, 4); srcloc: L16-1 {91#true} is VALID [2020-07-08 22:23:14,812 INFO L280 TraceCheckUtils]: 8: Hoare triple {91#true} havoc #t~nondet2; {91#true} is VALID [2020-07-08 22:23:14,812 INFO L280 TraceCheckUtils]: 9: Hoare triple {91#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {91#true} is VALID [2020-07-08 22:23:14,813 INFO L280 TraceCheckUtils]: 10: Hoare triple {91#true} SUMMARY for call write~int(#t~nondet3, ~#d2~0.base, 4 + ~#d2~0.offset, 4); srcloc: L17-1 {91#true} is VALID [2020-07-08 22:23:14,813 INFO L280 TraceCheckUtils]: 11: Hoare triple {91#true} havoc #t~nondet3; {91#true} is VALID [2020-07-08 22:23:14,814 INFO L280 TraceCheckUtils]: 12: Hoare triple {91#true} assume true; {91#true} is VALID [2020-07-08 22:23:14,814 INFO L275 TraceCheckUtils]: 13: Hoare quadruple {91#true} {91#true} #113#return; {91#true} is VALID [2020-07-08 22:23:14,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 22:23:14,822 INFO L280 TraceCheckUtils]: 0: Hoare triple {91#true} assume 0 != #t~nondet4 % 256; {91#true} is VALID [2020-07-08 22:23:14,823 INFO L280 TraceCheckUtils]: 1: Hoare triple {91#true} #t~ite5.base, #t~ite5.offset := ~#d1~0.base, ~#d1~0.offset; {91#true} is VALID [2020-07-08 22:23:14,823 INFO L280 TraceCheckUtils]: 2: Hoare triple {91#true} #res.base, #res.offset := #t~ite5.base, #t~ite5.offset; {91#true} is VALID [2020-07-08 22:23:14,824 INFO L280 TraceCheckUtils]: 3: Hoare triple {91#true} havoc #t~nondet4; {91#true} is VALID [2020-07-08 22:23:14,824 INFO L280 TraceCheckUtils]: 4: Hoare triple {91#true} havoc #t~ite5.base, #t~ite5.offset; {91#true} is VALID [2020-07-08 22:23:14,824 INFO L280 TraceCheckUtils]: 5: Hoare triple {91#true} assume true; {91#true} is VALID [2020-07-08 22:23:14,825 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {91#true} {91#true} #115#return; {91#true} is VALID [2020-07-08 22:23:14,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 22:23:14,832 INFO L280 TraceCheckUtils]: 0: Hoare triple {91#true} assume 0 != #t~nondet4 % 256; {91#true} is VALID [2020-07-08 22:23:14,832 INFO L280 TraceCheckUtils]: 1: Hoare triple {91#true} #t~ite5.base, #t~ite5.offset := ~#d1~0.base, ~#d1~0.offset; {91#true} is VALID [2020-07-08 22:23:14,833 INFO L280 TraceCheckUtils]: 2: Hoare triple {91#true} #res.base, #res.offset := #t~ite5.base, #t~ite5.offset; {91#true} is VALID [2020-07-08 22:23:14,833 INFO L280 TraceCheckUtils]: 3: Hoare triple {91#true} havoc #t~nondet4; {91#true} is VALID [2020-07-08 22:23:14,833 INFO L280 TraceCheckUtils]: 4: Hoare triple {91#true} havoc #t~ite5.base, #t~ite5.offset; {91#true} is VALID [2020-07-08 22:23:14,834 INFO L280 TraceCheckUtils]: 5: Hoare triple {91#true} assume true; {91#true} is VALID [2020-07-08 22:23:14,834 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {91#true} {91#true} #117#return; {91#true} is VALID [2020-07-08 22:23:14,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 22:23:14,841 INFO L280 TraceCheckUtils]: 0: Hoare triple {91#true} assume 0 != #t~nondet4 % 256; {91#true} is VALID [2020-07-08 22:23:14,842 INFO L280 TraceCheckUtils]: 1: Hoare triple {91#true} #t~ite5.base, #t~ite5.offset := ~#d1~0.base, ~#d1~0.offset; {91#true} is VALID [2020-07-08 22:23:14,842 INFO L280 TraceCheckUtils]: 2: Hoare triple {91#true} #res.base, #res.offset := #t~ite5.base, #t~ite5.offset; {91#true} is VALID [2020-07-08 22:23:14,843 INFO L280 TraceCheckUtils]: 3: Hoare triple {91#true} havoc #t~nondet4; {91#true} is VALID [2020-07-08 22:23:14,843 INFO L280 TraceCheckUtils]: 4: Hoare triple {91#true} havoc #t~ite5.base, #t~ite5.offset; {91#true} is VALID [2020-07-08 22:23:14,843 INFO L280 TraceCheckUtils]: 5: Hoare triple {91#true} assume true; {91#true} is VALID [2020-07-08 22:23:14,844 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {91#true} {91#true} #119#return; {91#true} is VALID [2020-07-08 22:23:14,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 22:23:14,861 INFO L280 TraceCheckUtils]: 0: Hoare triple {91#true} ~s1.base, ~s1.offset := #in~s1.base, #in~s1.offset; {91#true} is VALID [2020-07-08 22:23:14,862 INFO L280 TraceCheckUtils]: 1: Hoare triple {91#true} ~i := #in~i; {91#true} is VALID [2020-07-08 22:23:14,862 INFO L280 TraceCheckUtils]: 2: Hoare triple {91#true} SUMMARY for call #t~mem6 := read~int(~s1.base, ~s1.offset, 4); srcloc: L27 {91#true} is VALID [2020-07-08 22:23:14,862 INFO L280 TraceCheckUtils]: 3: Hoare triple {91#true} #res := (if #t~mem6 == ~i then 1 else 0); {91#true} is VALID [2020-07-08 22:23:14,863 INFO L280 TraceCheckUtils]: 4: Hoare triple {91#true} havoc #t~mem6; {91#true} is VALID [2020-07-08 22:23:14,863 INFO L280 TraceCheckUtils]: 5: Hoare triple {91#true} assume true; {91#true} is VALID [2020-07-08 22:23:14,863 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {91#true} {92#false} #121#return; {92#false} is VALID [2020-07-08 22:23:14,866 INFO L263 TraceCheckUtils]: 0: Hoare triple {91#true} call ULTIMATE.init(); {146#(and (= |~#d2~0.offset| |old(~#d2~0.offset)|) (= |~#d1~0.base| |old(~#d1~0.base)|) (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |~#d2~0.base| |old(~#d2~0.base)|) (= |~#d1~0.offset| |old(~#d1~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#length)| |#length|))} is VALID [2020-07-08 22:23:14,866 INFO L280 TraceCheckUtils]: 1: Hoare triple {146#(and (= |~#d2~0.offset| |old(~#d2~0.offset)|) (= |~#d1~0.base| |old(~#d1~0.base)|) (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |~#d2~0.base| |old(~#d2~0.base)|) (= |~#d1~0.offset| |old(~#d1~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#length)| |#length|))} #NULL.base, #NULL.offset := 0, 0; {91#true} is VALID [2020-07-08 22:23:14,867 INFO L280 TraceCheckUtils]: 2: Hoare triple {91#true} #valid := #valid[0 := 0]; {91#true} is VALID [2020-07-08 22:23:14,867 INFO L280 TraceCheckUtils]: 3: Hoare triple {91#true} assume 0 < #StackHeapBarrier; {91#true} is VALID [2020-07-08 22:23:14,867 INFO L280 TraceCheckUtils]: 4: Hoare triple {91#true} SUMMARY for call ~#d1~0.base, ~#d1~0.offset := #Ultimate.allocOnStack(8); srcloc: L9 {91#true} is VALID [2020-07-08 22:23:14,868 INFO L280 TraceCheckUtils]: 5: Hoare triple {91#true} SUMMARY for call write~init~int(0, ~#d1~0.base, ~#d1~0.offset, 4); srcloc: L9-1 {91#true} is VALID [2020-07-08 22:23:14,868 INFO L280 TraceCheckUtils]: 6: Hoare triple {91#true} SUMMARY for call write~init~int(0, ~#d1~0.base, 4 + ~#d1~0.offset, 4); srcloc: L9-2 {91#true} is VALID [2020-07-08 22:23:14,869 INFO L280 TraceCheckUtils]: 7: Hoare triple {91#true} SUMMARY for call ~#d2~0.base, ~#d2~0.offset := #Ultimate.allocOnStack(8); srcloc: L9-3 {91#true} is VALID [2020-07-08 22:23:14,869 INFO L280 TraceCheckUtils]: 8: Hoare triple {91#true} SUMMARY for call write~init~int(0, ~#d2~0.base, ~#d2~0.offset, 4); srcloc: L9-4 {91#true} is VALID [2020-07-08 22:23:14,869 INFO L280 TraceCheckUtils]: 9: Hoare triple {91#true} SUMMARY for call write~init~int(0, ~#d2~0.base, 4 + ~#d2~0.offset, 4); srcloc: L9-5 {91#true} is VALID [2020-07-08 22:23:14,870 INFO L280 TraceCheckUtils]: 10: Hoare triple {91#true} assume true; {91#true} is VALID [2020-07-08 22:23:14,870 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {91#true} {91#true} #123#return; {91#true} is VALID [2020-07-08 22:23:14,870 INFO L263 TraceCheckUtils]: 12: Hoare triple {91#true} call #t~ret17 := main(); {91#true} is VALID [2020-07-08 22:23:14,872 INFO L263 TraceCheckUtils]: 13: Hoare triple {91#true} call init(); {147#(= |#memory_int| |old(#memory_int)|)} is VALID [2020-07-08 22:23:14,872 INFO L280 TraceCheckUtils]: 14: Hoare triple {147#(= |#memory_int| |old(#memory_int)|)} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {91#true} is VALID [2020-07-08 22:23:14,872 INFO L280 TraceCheckUtils]: 15: Hoare triple {91#true} SUMMARY for call write~int(#t~nondet0, ~#d1~0.base, ~#d1~0.offset, 4); srcloc: L13 {91#true} is VALID [2020-07-08 22:23:14,873 INFO L280 TraceCheckUtils]: 16: Hoare triple {91#true} havoc #t~nondet0; {91#true} is VALID [2020-07-08 22:23:14,873 INFO L280 TraceCheckUtils]: 17: Hoare triple {91#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {91#true} is VALID [2020-07-08 22:23:14,874 INFO L280 TraceCheckUtils]: 18: Hoare triple {91#true} SUMMARY for call write~int(#t~nondet1, ~#d1~0.base, 4 + ~#d1~0.offset, 4); srcloc: L14-1 {91#true} is VALID [2020-07-08 22:23:14,874 INFO L280 TraceCheckUtils]: 19: Hoare triple {91#true} havoc #t~nondet1; {91#true} is VALID [2020-07-08 22:23:14,874 INFO L280 TraceCheckUtils]: 20: Hoare triple {91#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {91#true} is VALID [2020-07-08 22:23:14,875 INFO L280 TraceCheckUtils]: 21: Hoare triple {91#true} SUMMARY for call write~int(#t~nondet2, ~#d2~0.base, ~#d2~0.offset, 4); srcloc: L16-1 {91#true} is VALID [2020-07-08 22:23:14,875 INFO L280 TraceCheckUtils]: 22: Hoare triple {91#true} havoc #t~nondet2; {91#true} is VALID [2020-07-08 22:23:14,875 INFO L280 TraceCheckUtils]: 23: Hoare triple {91#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {91#true} is VALID [2020-07-08 22:23:14,876 INFO L280 TraceCheckUtils]: 24: Hoare triple {91#true} SUMMARY for call write~int(#t~nondet3, ~#d2~0.base, 4 + ~#d2~0.offset, 4); srcloc: L17-1 {91#true} is VALID [2020-07-08 22:23:14,876 INFO L280 TraceCheckUtils]: 25: Hoare triple {91#true} havoc #t~nondet3; {91#true} is VALID [2020-07-08 22:23:14,877 INFO L280 TraceCheckUtils]: 26: Hoare triple {91#true} assume true; {91#true} is VALID [2020-07-08 22:23:14,877 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {91#true} {91#true} #113#return; {91#true} is VALID [2020-07-08 22:23:14,877 INFO L263 TraceCheckUtils]: 28: Hoare triple {91#true} call #t~ret7.base, #t~ret7.offset := get_dummy(); {91#true} is VALID [2020-07-08 22:23:14,878 INFO L280 TraceCheckUtils]: 29: Hoare triple {91#true} assume 0 != #t~nondet4 % 256; {91#true} is VALID [2020-07-08 22:23:14,878 INFO L280 TraceCheckUtils]: 30: Hoare triple {91#true} #t~ite5.base, #t~ite5.offset := ~#d1~0.base, ~#d1~0.offset; {91#true} is VALID [2020-07-08 22:23:14,878 INFO L280 TraceCheckUtils]: 31: Hoare triple {91#true} #res.base, #res.offset := #t~ite5.base, #t~ite5.offset; {91#true} is VALID [2020-07-08 22:23:14,879 INFO L280 TraceCheckUtils]: 32: Hoare triple {91#true} havoc #t~nondet4; {91#true} is VALID [2020-07-08 22:23:14,879 INFO L280 TraceCheckUtils]: 33: Hoare triple {91#true} havoc #t~ite5.base, #t~ite5.offset; {91#true} is VALID [2020-07-08 22:23:14,879 INFO L280 TraceCheckUtils]: 34: Hoare triple {91#true} assume true; {91#true} is VALID [2020-07-08 22:23:14,880 INFO L275 TraceCheckUtils]: 35: Hoare quadruple {91#true} {91#true} #115#return; {91#true} is VALID [2020-07-08 22:23:14,880 INFO L280 TraceCheckUtils]: 36: Hoare triple {91#true} ~pd1~0.base, ~pd1~0.offset := #t~ret7.base, #t~ret7.offset; {91#true} is VALID [2020-07-08 22:23:14,881 INFO L280 TraceCheckUtils]: 37: Hoare triple {91#true} havoc #t~ret7.base, #t~ret7.offset; {91#true} is VALID [2020-07-08 22:23:14,881 INFO L263 TraceCheckUtils]: 38: Hoare triple {91#true} call #t~ret8.base, #t~ret8.offset := get_dummy(); {91#true} is VALID [2020-07-08 22:23:14,881 INFO L280 TraceCheckUtils]: 39: Hoare triple {91#true} assume 0 != #t~nondet4 % 256; {91#true} is VALID [2020-07-08 22:23:14,882 INFO L280 TraceCheckUtils]: 40: Hoare triple {91#true} #t~ite5.base, #t~ite5.offset := ~#d1~0.base, ~#d1~0.offset; {91#true} is VALID [2020-07-08 22:23:14,882 INFO L280 TraceCheckUtils]: 41: Hoare triple {91#true} #res.base, #res.offset := #t~ite5.base, #t~ite5.offset; {91#true} is VALID [2020-07-08 22:23:14,882 INFO L280 TraceCheckUtils]: 42: Hoare triple {91#true} havoc #t~nondet4; {91#true} is VALID [2020-07-08 22:23:14,883 INFO L280 TraceCheckUtils]: 43: Hoare triple {91#true} havoc #t~ite5.base, #t~ite5.offset; {91#true} is VALID [2020-07-08 22:23:14,883 INFO L280 TraceCheckUtils]: 44: Hoare triple {91#true} assume true; {91#true} is VALID [2020-07-08 22:23:14,883 INFO L275 TraceCheckUtils]: 45: Hoare quadruple {91#true} {91#true} #117#return; {91#true} is VALID [2020-07-08 22:23:14,884 INFO L280 TraceCheckUtils]: 46: Hoare triple {91#true} ~pd2~0.base, ~pd2~0.offset := #t~ret8.base, #t~ret8.offset; {91#true} is VALID [2020-07-08 22:23:14,884 INFO L280 TraceCheckUtils]: 47: Hoare triple {91#true} havoc #t~ret8.base, #t~ret8.offset; {91#true} is VALID [2020-07-08 22:23:14,885 INFO L263 TraceCheckUtils]: 48: Hoare triple {91#true} call #t~ret9.base, #t~ret9.offset := get_dummy(); {91#true} is VALID [2020-07-08 22:23:14,885 INFO L280 TraceCheckUtils]: 49: Hoare triple {91#true} assume 0 != #t~nondet4 % 256; {91#true} is VALID [2020-07-08 22:23:14,885 INFO L280 TraceCheckUtils]: 50: Hoare triple {91#true} #t~ite5.base, #t~ite5.offset := ~#d1~0.base, ~#d1~0.offset; {91#true} is VALID [2020-07-08 22:23:14,886 INFO L280 TraceCheckUtils]: 51: Hoare triple {91#true} #res.base, #res.offset := #t~ite5.base, #t~ite5.offset; {91#true} is VALID [2020-07-08 22:23:14,886 INFO L280 TraceCheckUtils]: 52: Hoare triple {91#true} havoc #t~nondet4; {91#true} is VALID [2020-07-08 22:23:14,886 INFO L280 TraceCheckUtils]: 53: Hoare triple {91#true} havoc #t~ite5.base, #t~ite5.offset; {91#true} is VALID [2020-07-08 22:23:14,887 INFO L280 TraceCheckUtils]: 54: Hoare triple {91#true} assume true; {91#true} is VALID [2020-07-08 22:23:14,887 INFO L275 TraceCheckUtils]: 55: Hoare quadruple {91#true} {91#true} #119#return; {91#true} is VALID [2020-07-08 22:23:14,887 INFO L280 TraceCheckUtils]: 56: Hoare triple {91#true} ~pd3~0.base, ~pd3~0.offset := #t~ret9.base, #t~ret9.offset; {91#true} is VALID [2020-07-08 22:23:14,888 INFO L280 TraceCheckUtils]: 57: Hoare triple {91#true} havoc #t~ret9.base, #t~ret9.offset; {91#true} is VALID [2020-07-08 22:23:14,888 INFO L280 TraceCheckUtils]: 58: Hoare triple {91#true} assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647; {91#true} is VALID [2020-07-08 22:23:14,889 INFO L280 TraceCheckUtils]: 59: Hoare triple {91#true} ~i~0 := #t~nondet10; {91#true} is VALID [2020-07-08 22:23:14,889 INFO L280 TraceCheckUtils]: 60: Hoare triple {91#true} havoc #t~nondet10; {91#true} is VALID [2020-07-08 22:23:14,889 INFO L280 TraceCheckUtils]: 61: Hoare triple {91#true} #t~short12 := (~pd1~0.base != 0 || ~pd1~0.offset != 0) && ~pd1~0.base == ~pd2~0.base && ~pd1~0.offset == ~pd2~0.offset; {91#true} is VALID [2020-07-08 22:23:14,890 INFO L280 TraceCheckUtils]: 62: Hoare triple {91#true} assume !#t~short12; {91#true} is VALID [2020-07-08 22:23:14,890 INFO L280 TraceCheckUtils]: 63: Hoare triple {91#true} assume #t~short12; {91#true} is VALID [2020-07-08 22:23:14,890 INFO L280 TraceCheckUtils]: 64: Hoare triple {91#true} havoc #t~mem11; {91#true} is VALID [2020-07-08 22:23:14,891 INFO L280 TraceCheckUtils]: 65: Hoare triple {91#true} havoc #t~short12; {91#true} is VALID [2020-07-08 22:23:14,891 INFO L280 TraceCheckUtils]: 66: Hoare triple {91#true} ~pa~0.base, ~pa~0.offset := ~pd1~0.base, ~pd1~0.offset; {91#true} is VALID [2020-07-08 22:23:14,892 INFO L280 TraceCheckUtils]: 67: Hoare triple {91#true} SUMMARY for call #t~mem13 := read~int(~pd3~0.base, ~pd3~0.offset, 4); srcloc: L37 {91#true} is VALID [2020-07-08 22:23:14,892 INFO L280 TraceCheckUtils]: 68: Hoare triple {91#true} ~i~0 := #t~mem13 - 10; {91#true} is VALID [2020-07-08 22:23:14,892 INFO L280 TraceCheckUtils]: 69: Hoare triple {91#true} havoc #t~mem13; {91#true} is VALID [2020-07-08 22:23:14,893 INFO L280 TraceCheckUtils]: 70: Hoare triple {91#true} assume !true; {92#false} is VALID [2020-07-08 22:23:14,894 INFO L263 TraceCheckUtils]: 71: Hoare triple {92#false} call #t~ret16 := check(~pd2~0.base, ~pd2~0.offset, ~i~0); {91#true} is VALID [2020-07-08 22:23:14,894 INFO L280 TraceCheckUtils]: 72: Hoare triple {91#true} ~s1.base, ~s1.offset := #in~s1.base, #in~s1.offset; {91#true} is VALID [2020-07-08 22:23:14,894 INFO L280 TraceCheckUtils]: 73: Hoare triple {91#true} ~i := #in~i; {91#true} is VALID [2020-07-08 22:23:14,895 INFO L280 TraceCheckUtils]: 74: Hoare triple {91#true} SUMMARY for call #t~mem6 := read~int(~s1.base, ~s1.offset, 4); srcloc: L27 {91#true} is VALID [2020-07-08 22:23:14,895 INFO L280 TraceCheckUtils]: 75: Hoare triple {91#true} #res := (if #t~mem6 == ~i then 1 else 0); {91#true} is VALID [2020-07-08 22:23:14,896 INFO L280 TraceCheckUtils]: 76: Hoare triple {91#true} havoc #t~mem6; {91#true} is VALID [2020-07-08 22:23:14,896 INFO L280 TraceCheckUtils]: 77: Hoare triple {91#true} assume true; {91#true} is VALID [2020-07-08 22:23:14,896 INFO L275 TraceCheckUtils]: 78: Hoare quadruple {91#true} {92#false} #121#return; {92#false} is VALID [2020-07-08 22:23:14,897 INFO L280 TraceCheckUtils]: 79: Hoare triple {92#false} assume -2147483648 <= #t~ret16 && #t~ret16 <= 2147483647; {92#false} is VALID [2020-07-08 22:23:14,897 INFO L280 TraceCheckUtils]: 80: Hoare triple {92#false} assume 0 == #t~ret16; {92#false} is VALID [2020-07-08 22:23:14,897 INFO L280 TraceCheckUtils]: 81: Hoare triple {92#false} havoc #t~ret16; {92#false} is VALID [2020-07-08 22:23:14,898 INFO L280 TraceCheckUtils]: 82: Hoare triple {92#false} assume !false; {92#false} is VALID [2020-07-08 22:23:14,918 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-07-08 22:23:14,919 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [485110937] [2020-07-08 22:23:14,922 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 22:23:14,922 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-08 22:23:14,923 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047803963] [2020-07-08 22:23:14,931 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 83 [2020-07-08 22:23:14,938 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 22:23:14,942 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-08 22:23:15,099 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 22:23:15,100 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-08 22:23:15,100 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 22:23:15,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-08 22:23:15,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-08 22:23:15,112 INFO L87 Difference]: Start difference. First operand 88 states. Second operand 4 states. [2020-07-08 22:23:16,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 22:23:16,181 INFO L93 Difference]: Finished difference Result 107 states and 114 transitions. [2020-07-08 22:23:16,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-08 22:23:16,181 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 83 [2020-07-08 22:23:16,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 22:23:16,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-08 22:23:16,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 114 transitions. [2020-07-08 22:23:16,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-08 22:23:16,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 114 transitions. [2020-07-08 22:23:16,225 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 114 transitions. [2020-07-08 22:23:16,431 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 114 edges. 114 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 22:23:16,459 INFO L225 Difference]: With dead ends: 107 [2020-07-08 22:23:16,460 INFO L226 Difference]: Without dead ends: 79 [2020-07-08 22:23:16,464 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-07-08 22:23:16,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2020-07-08 22:23:16,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2020-07-08 22:23:16,780 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 22:23:16,781 INFO L82 GeneralOperation]: Start isEquivalent. First operand 79 states. Second operand 79 states. [2020-07-08 22:23:16,781 INFO L74 IsIncluded]: Start isIncluded. First operand 79 states. Second operand 79 states. [2020-07-08 22:23:16,781 INFO L87 Difference]: Start difference. First operand 79 states. Second operand 79 states. [2020-07-08 22:23:16,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 22:23:16,794 INFO L93 Difference]: Finished difference Result 79 states and 83 transitions. [2020-07-08 22:23:16,794 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 83 transitions. [2020-07-08 22:23:16,795 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 22:23:16,795 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 22:23:16,796 INFO L74 IsIncluded]: Start isIncluded. First operand 79 states. Second operand 79 states. [2020-07-08 22:23:16,796 INFO L87 Difference]: Start difference. First operand 79 states. Second operand 79 states. [2020-07-08 22:23:16,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 22:23:16,804 INFO L93 Difference]: Finished difference Result 79 states and 83 transitions. [2020-07-08 22:23:16,804 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 83 transitions. [2020-07-08 22:23:16,805 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 22:23:16,805 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 22:23:16,806 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 22:23:16,806 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 22:23:16,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2020-07-08 22:23:16,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 83 transitions. [2020-07-08 22:23:16,813 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 83 transitions. Word has length 83 [2020-07-08 22:23:16,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 22:23:16,814 INFO L479 AbstractCegarLoop]: Abstraction has 79 states and 83 transitions. [2020-07-08 22:23:16,814 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-08 22:23:16,815 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 79 states and 83 transitions. [2020-07-08 22:23:16,964 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 22:23:16,964 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 83 transitions. [2020-07-08 22:23:16,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2020-07-08 22:23:16,967 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 22:23:16,968 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 22:23:16,968 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-08 22:23:16,968 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 22:23:16,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 22:23:16,969 INFO L82 PathProgramCache]: Analyzing trace with hash 177245466, now seen corresponding path program 1 times [2020-07-08 22:23:16,969 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 22:23:16,970 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [473694542] [2020-07-08 22:23:16,970 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 22:23:17,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 22:23:17,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 22:23:17,087 INFO L280 TraceCheckUtils]: 0: Hoare triple {739#(and (= |~#d2~0.offset| |old(~#d2~0.offset)|) (= |~#d1~0.base| |old(~#d1~0.base)|) (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |~#d2~0.base| |old(~#d2~0.base)|) (= |~#d1~0.offset| |old(~#d1~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#length)| |#length|))} #NULL.base, #NULL.offset := 0, 0; {683#true} is VALID [2020-07-08 22:23:17,087 INFO L280 TraceCheckUtils]: 1: Hoare triple {683#true} #valid := #valid[0 := 0]; {683#true} is VALID [2020-07-08 22:23:17,088 INFO L280 TraceCheckUtils]: 2: Hoare triple {683#true} assume 0 < #StackHeapBarrier; {683#true} is VALID [2020-07-08 22:23:17,088 INFO L280 TraceCheckUtils]: 3: Hoare triple {683#true} SUMMARY for call ~#d1~0.base, ~#d1~0.offset := #Ultimate.allocOnStack(8); srcloc: L9 {683#true} is VALID [2020-07-08 22:23:17,088 INFO L280 TraceCheckUtils]: 4: Hoare triple {683#true} SUMMARY for call write~init~int(0, ~#d1~0.base, ~#d1~0.offset, 4); srcloc: L9-1 {683#true} is VALID [2020-07-08 22:23:17,089 INFO L280 TraceCheckUtils]: 5: Hoare triple {683#true} SUMMARY for call write~init~int(0, ~#d1~0.base, 4 + ~#d1~0.offset, 4); srcloc: L9-2 {683#true} is VALID [2020-07-08 22:23:17,089 INFO L280 TraceCheckUtils]: 6: Hoare triple {683#true} SUMMARY for call ~#d2~0.base, ~#d2~0.offset := #Ultimate.allocOnStack(8); srcloc: L9-3 {683#true} is VALID [2020-07-08 22:23:17,089 INFO L280 TraceCheckUtils]: 7: Hoare triple {683#true} SUMMARY for call write~init~int(0, ~#d2~0.base, ~#d2~0.offset, 4); srcloc: L9-4 {683#true} is VALID [2020-07-08 22:23:17,089 INFO L280 TraceCheckUtils]: 8: Hoare triple {683#true} SUMMARY for call write~init~int(0, ~#d2~0.base, 4 + ~#d2~0.offset, 4); srcloc: L9-5 {683#true} is VALID [2020-07-08 22:23:17,090 INFO L280 TraceCheckUtils]: 9: Hoare triple {683#true} assume true; {683#true} is VALID [2020-07-08 22:23:17,090 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {683#true} {683#true} #123#return; {683#true} is VALID [2020-07-08 22:23:17,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 22:23:17,103 INFO L280 TraceCheckUtils]: 0: Hoare triple {740#(= |#memory_int| |old(#memory_int)|)} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {683#true} is VALID [2020-07-08 22:23:17,104 INFO L280 TraceCheckUtils]: 1: Hoare triple {683#true} SUMMARY for call write~int(#t~nondet0, ~#d1~0.base, ~#d1~0.offset, 4); srcloc: L13 {683#true} is VALID [2020-07-08 22:23:17,104 INFO L280 TraceCheckUtils]: 2: Hoare triple {683#true} havoc #t~nondet0; {683#true} is VALID [2020-07-08 22:23:17,105 INFO L280 TraceCheckUtils]: 3: Hoare triple {683#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {683#true} is VALID [2020-07-08 22:23:17,105 INFO L280 TraceCheckUtils]: 4: Hoare triple {683#true} SUMMARY for call write~int(#t~nondet1, ~#d1~0.base, 4 + ~#d1~0.offset, 4); srcloc: L14-1 {683#true} is VALID [2020-07-08 22:23:17,105 INFO L280 TraceCheckUtils]: 5: Hoare triple {683#true} havoc #t~nondet1; {683#true} is VALID [2020-07-08 22:23:17,105 INFO L280 TraceCheckUtils]: 6: Hoare triple {683#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {683#true} is VALID [2020-07-08 22:23:17,106 INFO L280 TraceCheckUtils]: 7: Hoare triple {683#true} SUMMARY for call write~int(#t~nondet2, ~#d2~0.base, ~#d2~0.offset, 4); srcloc: L16-1 {683#true} is VALID [2020-07-08 22:23:17,106 INFO L280 TraceCheckUtils]: 8: Hoare triple {683#true} havoc #t~nondet2; {683#true} is VALID [2020-07-08 22:23:17,106 INFO L280 TraceCheckUtils]: 9: Hoare triple {683#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {683#true} is VALID [2020-07-08 22:23:17,106 INFO L280 TraceCheckUtils]: 10: Hoare triple {683#true} SUMMARY for call write~int(#t~nondet3, ~#d2~0.base, 4 + ~#d2~0.offset, 4); srcloc: L17-1 {683#true} is VALID [2020-07-08 22:23:17,107 INFO L280 TraceCheckUtils]: 11: Hoare triple {683#true} havoc #t~nondet3; {683#true} is VALID [2020-07-08 22:23:17,107 INFO L280 TraceCheckUtils]: 12: Hoare triple {683#true} assume true; {683#true} is VALID [2020-07-08 22:23:17,107 INFO L275 TraceCheckUtils]: 13: Hoare quadruple {683#true} {683#true} #113#return; {683#true} is VALID [2020-07-08 22:23:17,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 22:23:17,112 INFO L280 TraceCheckUtils]: 0: Hoare triple {683#true} assume 0 != #t~nondet4 % 256; {683#true} is VALID [2020-07-08 22:23:17,113 INFO L280 TraceCheckUtils]: 1: Hoare triple {683#true} #t~ite5.base, #t~ite5.offset := ~#d1~0.base, ~#d1~0.offset; {683#true} is VALID [2020-07-08 22:23:17,113 INFO L280 TraceCheckUtils]: 2: Hoare triple {683#true} #res.base, #res.offset := #t~ite5.base, #t~ite5.offset; {683#true} is VALID [2020-07-08 22:23:17,113 INFO L280 TraceCheckUtils]: 3: Hoare triple {683#true} havoc #t~nondet4; {683#true} is VALID [2020-07-08 22:23:17,113 INFO L280 TraceCheckUtils]: 4: Hoare triple {683#true} havoc #t~ite5.base, #t~ite5.offset; {683#true} is VALID [2020-07-08 22:23:17,114 INFO L280 TraceCheckUtils]: 5: Hoare triple {683#true} assume true; {683#true} is VALID [2020-07-08 22:23:17,114 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {683#true} {683#true} #115#return; {683#true} is VALID [2020-07-08 22:23:17,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 22:23:17,119 INFO L280 TraceCheckUtils]: 0: Hoare triple {683#true} assume 0 != #t~nondet4 % 256; {683#true} is VALID [2020-07-08 22:23:17,119 INFO L280 TraceCheckUtils]: 1: Hoare triple {683#true} #t~ite5.base, #t~ite5.offset := ~#d1~0.base, ~#d1~0.offset; {683#true} is VALID [2020-07-08 22:23:17,119 INFO L280 TraceCheckUtils]: 2: Hoare triple {683#true} #res.base, #res.offset := #t~ite5.base, #t~ite5.offset; {683#true} is VALID [2020-07-08 22:23:17,119 INFO L280 TraceCheckUtils]: 3: Hoare triple {683#true} havoc #t~nondet4; {683#true} is VALID [2020-07-08 22:23:17,120 INFO L280 TraceCheckUtils]: 4: Hoare triple {683#true} havoc #t~ite5.base, #t~ite5.offset; {683#true} is VALID [2020-07-08 22:23:17,120 INFO L280 TraceCheckUtils]: 5: Hoare triple {683#true} assume true; {683#true} is VALID [2020-07-08 22:23:17,120 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {683#true} {683#true} #117#return; {683#true} is VALID [2020-07-08 22:23:17,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 22:23:17,126 INFO L280 TraceCheckUtils]: 0: Hoare triple {683#true} assume 0 != #t~nondet4 % 256; {683#true} is VALID [2020-07-08 22:23:17,126 INFO L280 TraceCheckUtils]: 1: Hoare triple {683#true} #t~ite5.base, #t~ite5.offset := ~#d1~0.base, ~#d1~0.offset; {683#true} is VALID [2020-07-08 22:23:17,126 INFO L280 TraceCheckUtils]: 2: Hoare triple {683#true} #res.base, #res.offset := #t~ite5.base, #t~ite5.offset; {683#true} is VALID [2020-07-08 22:23:17,127 INFO L280 TraceCheckUtils]: 3: Hoare triple {683#true} havoc #t~nondet4; {683#true} is VALID [2020-07-08 22:23:17,127 INFO L280 TraceCheckUtils]: 4: Hoare triple {683#true} havoc #t~ite5.base, #t~ite5.offset; {683#true} is VALID [2020-07-08 22:23:17,127 INFO L280 TraceCheckUtils]: 5: Hoare triple {683#true} assume true; {683#true} is VALID [2020-07-08 22:23:17,127 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {683#true} {683#true} #119#return; {683#true} is VALID [2020-07-08 22:23:17,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 22:23:17,133 INFO L280 TraceCheckUtils]: 0: Hoare triple {683#true} ~s1.base, ~s1.offset := #in~s1.base, #in~s1.offset; {683#true} is VALID [2020-07-08 22:23:17,133 INFO L280 TraceCheckUtils]: 1: Hoare triple {683#true} ~i := #in~i; {683#true} is VALID [2020-07-08 22:23:17,133 INFO L280 TraceCheckUtils]: 2: Hoare triple {683#true} SUMMARY for call #t~mem6 := read~int(~s1.base, ~s1.offset, 4); srcloc: L27 {683#true} is VALID [2020-07-08 22:23:17,134 INFO L280 TraceCheckUtils]: 3: Hoare triple {683#true} #res := (if #t~mem6 == ~i then 1 else 0); {683#true} is VALID [2020-07-08 22:23:17,134 INFO L280 TraceCheckUtils]: 4: Hoare triple {683#true} havoc #t~mem6; {683#true} is VALID [2020-07-08 22:23:17,134 INFO L280 TraceCheckUtils]: 5: Hoare triple {683#true} assume true; {683#true} is VALID [2020-07-08 22:23:17,135 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {683#true} {684#false} #121#return; {684#false} is VALID [2020-07-08 22:23:17,136 INFO L263 TraceCheckUtils]: 0: Hoare triple {683#true} call ULTIMATE.init(); {739#(and (= |~#d2~0.offset| |old(~#d2~0.offset)|) (= |~#d1~0.base| |old(~#d1~0.base)|) (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |~#d2~0.base| |old(~#d2~0.base)|) (= |~#d1~0.offset| |old(~#d1~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#length)| |#length|))} is VALID [2020-07-08 22:23:17,136 INFO L280 TraceCheckUtils]: 1: Hoare triple {739#(and (= |~#d2~0.offset| |old(~#d2~0.offset)|) (= |~#d1~0.base| |old(~#d1~0.base)|) (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |~#d2~0.base| |old(~#d2~0.base)|) (= |~#d1~0.offset| |old(~#d1~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#length)| |#length|))} #NULL.base, #NULL.offset := 0, 0; {683#true} is VALID [2020-07-08 22:23:17,137 INFO L280 TraceCheckUtils]: 2: Hoare triple {683#true} #valid := #valid[0 := 0]; {683#true} is VALID [2020-07-08 22:23:17,137 INFO L280 TraceCheckUtils]: 3: Hoare triple {683#true} assume 0 < #StackHeapBarrier; {683#true} is VALID [2020-07-08 22:23:17,137 INFO L280 TraceCheckUtils]: 4: Hoare triple {683#true} SUMMARY for call ~#d1~0.base, ~#d1~0.offset := #Ultimate.allocOnStack(8); srcloc: L9 {683#true} is VALID [2020-07-08 22:23:17,137 INFO L280 TraceCheckUtils]: 5: Hoare triple {683#true} SUMMARY for call write~init~int(0, ~#d1~0.base, ~#d1~0.offset, 4); srcloc: L9-1 {683#true} is VALID [2020-07-08 22:23:17,138 INFO L280 TraceCheckUtils]: 6: Hoare triple {683#true} SUMMARY for call write~init~int(0, ~#d1~0.base, 4 + ~#d1~0.offset, 4); srcloc: L9-2 {683#true} is VALID [2020-07-08 22:23:17,138 INFO L280 TraceCheckUtils]: 7: Hoare triple {683#true} SUMMARY for call ~#d2~0.base, ~#d2~0.offset := #Ultimate.allocOnStack(8); srcloc: L9-3 {683#true} is VALID [2020-07-08 22:23:17,138 INFO L280 TraceCheckUtils]: 8: Hoare triple {683#true} SUMMARY for call write~init~int(0, ~#d2~0.base, ~#d2~0.offset, 4); srcloc: L9-4 {683#true} is VALID [2020-07-08 22:23:17,138 INFO L280 TraceCheckUtils]: 9: Hoare triple {683#true} SUMMARY for call write~init~int(0, ~#d2~0.base, 4 + ~#d2~0.offset, 4); srcloc: L9-5 {683#true} is VALID [2020-07-08 22:23:17,139 INFO L280 TraceCheckUtils]: 10: Hoare triple {683#true} assume true; {683#true} is VALID [2020-07-08 22:23:17,139 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {683#true} {683#true} #123#return; {683#true} is VALID [2020-07-08 22:23:17,139 INFO L263 TraceCheckUtils]: 12: Hoare triple {683#true} call #t~ret17 := main(); {683#true} is VALID [2020-07-08 22:23:17,140 INFO L263 TraceCheckUtils]: 13: Hoare triple {683#true} call init(); {740#(= |#memory_int| |old(#memory_int)|)} is VALID [2020-07-08 22:23:17,140 INFO L280 TraceCheckUtils]: 14: Hoare triple {740#(= |#memory_int| |old(#memory_int)|)} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {683#true} is VALID [2020-07-08 22:23:17,140 INFO L280 TraceCheckUtils]: 15: Hoare triple {683#true} SUMMARY for call write~int(#t~nondet0, ~#d1~0.base, ~#d1~0.offset, 4); srcloc: L13 {683#true} is VALID [2020-07-08 22:23:17,141 INFO L280 TraceCheckUtils]: 16: Hoare triple {683#true} havoc #t~nondet0; {683#true} is VALID [2020-07-08 22:23:17,141 INFO L280 TraceCheckUtils]: 17: Hoare triple {683#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {683#true} is VALID [2020-07-08 22:23:17,141 INFO L280 TraceCheckUtils]: 18: Hoare triple {683#true} SUMMARY for call write~int(#t~nondet1, ~#d1~0.base, 4 + ~#d1~0.offset, 4); srcloc: L14-1 {683#true} is VALID [2020-07-08 22:23:17,141 INFO L280 TraceCheckUtils]: 19: Hoare triple {683#true} havoc #t~nondet1; {683#true} is VALID [2020-07-08 22:23:17,142 INFO L280 TraceCheckUtils]: 20: Hoare triple {683#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {683#true} is VALID [2020-07-08 22:23:17,142 INFO L280 TraceCheckUtils]: 21: Hoare triple {683#true} SUMMARY for call write~int(#t~nondet2, ~#d2~0.base, ~#d2~0.offset, 4); srcloc: L16-1 {683#true} is VALID [2020-07-08 22:23:17,142 INFO L280 TraceCheckUtils]: 22: Hoare triple {683#true} havoc #t~nondet2; {683#true} is VALID [2020-07-08 22:23:17,142 INFO L280 TraceCheckUtils]: 23: Hoare triple {683#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {683#true} is VALID [2020-07-08 22:23:17,143 INFO L280 TraceCheckUtils]: 24: Hoare triple {683#true} SUMMARY for call write~int(#t~nondet3, ~#d2~0.base, 4 + ~#d2~0.offset, 4); srcloc: L17-1 {683#true} is VALID [2020-07-08 22:23:17,143 INFO L280 TraceCheckUtils]: 25: Hoare triple {683#true} havoc #t~nondet3; {683#true} is VALID [2020-07-08 22:23:17,143 INFO L280 TraceCheckUtils]: 26: Hoare triple {683#true} assume true; {683#true} is VALID [2020-07-08 22:23:17,143 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {683#true} {683#true} #113#return; {683#true} is VALID [2020-07-08 22:23:17,143 INFO L263 TraceCheckUtils]: 28: Hoare triple {683#true} call #t~ret7.base, #t~ret7.offset := get_dummy(); {683#true} is VALID [2020-07-08 22:23:17,144 INFO L280 TraceCheckUtils]: 29: Hoare triple {683#true} assume 0 != #t~nondet4 % 256; {683#true} is VALID [2020-07-08 22:23:17,144 INFO L280 TraceCheckUtils]: 30: Hoare triple {683#true} #t~ite5.base, #t~ite5.offset := ~#d1~0.base, ~#d1~0.offset; {683#true} is VALID [2020-07-08 22:23:17,144 INFO L280 TraceCheckUtils]: 31: Hoare triple {683#true} #res.base, #res.offset := #t~ite5.base, #t~ite5.offset; {683#true} is VALID [2020-07-08 22:23:17,144 INFO L280 TraceCheckUtils]: 32: Hoare triple {683#true} havoc #t~nondet4; {683#true} is VALID [2020-07-08 22:23:17,145 INFO L280 TraceCheckUtils]: 33: Hoare triple {683#true} havoc #t~ite5.base, #t~ite5.offset; {683#true} is VALID [2020-07-08 22:23:17,145 INFO L280 TraceCheckUtils]: 34: Hoare triple {683#true} assume true; {683#true} is VALID [2020-07-08 22:23:17,145 INFO L275 TraceCheckUtils]: 35: Hoare quadruple {683#true} {683#true} #115#return; {683#true} is VALID [2020-07-08 22:23:17,145 INFO L280 TraceCheckUtils]: 36: Hoare triple {683#true} ~pd1~0.base, ~pd1~0.offset := #t~ret7.base, #t~ret7.offset; {683#true} is VALID [2020-07-08 22:23:17,145 INFO L280 TraceCheckUtils]: 37: Hoare triple {683#true} havoc #t~ret7.base, #t~ret7.offset; {683#true} is VALID [2020-07-08 22:23:17,146 INFO L263 TraceCheckUtils]: 38: Hoare triple {683#true} call #t~ret8.base, #t~ret8.offset := get_dummy(); {683#true} is VALID [2020-07-08 22:23:17,146 INFO L280 TraceCheckUtils]: 39: Hoare triple {683#true} assume 0 != #t~nondet4 % 256; {683#true} is VALID [2020-07-08 22:23:17,146 INFO L280 TraceCheckUtils]: 40: Hoare triple {683#true} #t~ite5.base, #t~ite5.offset := ~#d1~0.base, ~#d1~0.offset; {683#true} is VALID [2020-07-08 22:23:17,146 INFO L280 TraceCheckUtils]: 41: Hoare triple {683#true} #res.base, #res.offset := #t~ite5.base, #t~ite5.offset; {683#true} is VALID [2020-07-08 22:23:17,147 INFO L280 TraceCheckUtils]: 42: Hoare triple {683#true} havoc #t~nondet4; {683#true} is VALID [2020-07-08 22:23:17,147 INFO L280 TraceCheckUtils]: 43: Hoare triple {683#true} havoc #t~ite5.base, #t~ite5.offset; {683#true} is VALID [2020-07-08 22:23:17,147 INFO L280 TraceCheckUtils]: 44: Hoare triple {683#true} assume true; {683#true} is VALID [2020-07-08 22:23:17,147 INFO L275 TraceCheckUtils]: 45: Hoare quadruple {683#true} {683#true} #117#return; {683#true} is VALID [2020-07-08 22:23:17,148 INFO L280 TraceCheckUtils]: 46: Hoare triple {683#true} ~pd2~0.base, ~pd2~0.offset := #t~ret8.base, #t~ret8.offset; {683#true} is VALID [2020-07-08 22:23:17,148 INFO L280 TraceCheckUtils]: 47: Hoare triple {683#true} havoc #t~ret8.base, #t~ret8.offset; {683#true} is VALID [2020-07-08 22:23:17,148 INFO L263 TraceCheckUtils]: 48: Hoare triple {683#true} call #t~ret9.base, #t~ret9.offset := get_dummy(); {683#true} is VALID [2020-07-08 22:23:17,148 INFO L280 TraceCheckUtils]: 49: Hoare triple {683#true} assume 0 != #t~nondet4 % 256; {683#true} is VALID [2020-07-08 22:23:17,149 INFO L280 TraceCheckUtils]: 50: Hoare triple {683#true} #t~ite5.base, #t~ite5.offset := ~#d1~0.base, ~#d1~0.offset; {683#true} is VALID [2020-07-08 22:23:17,149 INFO L280 TraceCheckUtils]: 51: Hoare triple {683#true} #res.base, #res.offset := #t~ite5.base, #t~ite5.offset; {683#true} is VALID [2020-07-08 22:23:17,149 INFO L280 TraceCheckUtils]: 52: Hoare triple {683#true} havoc #t~nondet4; {683#true} is VALID [2020-07-08 22:23:17,149 INFO L280 TraceCheckUtils]: 53: Hoare triple {683#true} havoc #t~ite5.base, #t~ite5.offset; {683#true} is VALID [2020-07-08 22:23:17,149 INFO L280 TraceCheckUtils]: 54: Hoare triple {683#true} assume true; {683#true} is VALID [2020-07-08 22:23:17,150 INFO L275 TraceCheckUtils]: 55: Hoare quadruple {683#true} {683#true} #119#return; {683#true} is VALID [2020-07-08 22:23:17,150 INFO L280 TraceCheckUtils]: 56: Hoare triple {683#true} ~pd3~0.base, ~pd3~0.offset := #t~ret9.base, #t~ret9.offset; {683#true} is VALID [2020-07-08 22:23:17,150 INFO L280 TraceCheckUtils]: 57: Hoare triple {683#true} havoc #t~ret9.base, #t~ret9.offset; {683#true} is VALID [2020-07-08 22:23:17,150 INFO L280 TraceCheckUtils]: 58: Hoare triple {683#true} assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647; {683#true} is VALID [2020-07-08 22:23:17,151 INFO L280 TraceCheckUtils]: 59: Hoare triple {683#true} ~i~0 := #t~nondet10; {683#true} is VALID [2020-07-08 22:23:17,151 INFO L280 TraceCheckUtils]: 60: Hoare triple {683#true} havoc #t~nondet10; {683#true} is VALID [2020-07-08 22:23:17,151 INFO L280 TraceCheckUtils]: 61: Hoare triple {683#true} #t~short12 := (~pd1~0.base != 0 || ~pd1~0.offset != 0) && ~pd1~0.base == ~pd2~0.base && ~pd1~0.offset == ~pd2~0.offset; {683#true} is VALID [2020-07-08 22:23:17,152 INFO L280 TraceCheckUtils]: 62: Hoare triple {683#true} assume !#t~short12; {731#(not |main_#t~short12|)} is VALID [2020-07-08 22:23:17,153 INFO L280 TraceCheckUtils]: 63: Hoare triple {731#(not |main_#t~short12|)} assume #t~short12; {684#false} is VALID [2020-07-08 22:23:17,153 INFO L280 TraceCheckUtils]: 64: Hoare triple {684#false} havoc #t~mem11; {684#false} is VALID [2020-07-08 22:23:17,153 INFO L280 TraceCheckUtils]: 65: Hoare triple {684#false} havoc #t~short12; {684#false} is VALID [2020-07-08 22:23:17,153 INFO L280 TraceCheckUtils]: 66: Hoare triple {684#false} ~pa~0.base, ~pa~0.offset := ~pd1~0.base, ~pd1~0.offset; {684#false} is VALID [2020-07-08 22:23:17,154 INFO L280 TraceCheckUtils]: 67: Hoare triple {684#false} SUMMARY for call #t~mem13 := read~int(~pd3~0.base, ~pd3~0.offset, 4); srcloc: L37 {684#false} is VALID [2020-07-08 22:23:17,154 INFO L280 TraceCheckUtils]: 68: Hoare triple {684#false} ~i~0 := #t~mem13 - 10; {684#false} is VALID [2020-07-08 22:23:17,154 INFO L280 TraceCheckUtils]: 69: Hoare triple {684#false} havoc #t~mem13; {684#false} is VALID [2020-07-08 22:23:17,154 INFO L280 TraceCheckUtils]: 70: Hoare triple {684#false} SUMMARY for call #t~mem14 := read~int(~pa~0.base, ~pa~0.offset, 4); srcloc: L38-5 {684#false} is VALID [2020-07-08 22:23:17,155 INFO L280 TraceCheckUtils]: 71: Hoare triple {684#false} assume !(~i~0 < #t~mem14); {684#false} is VALID [2020-07-08 22:23:17,155 INFO L280 TraceCheckUtils]: 72: Hoare triple {684#false} havoc #t~mem14; {684#false} is VALID [2020-07-08 22:23:17,155 INFO L263 TraceCheckUtils]: 73: Hoare triple {684#false} call #t~ret16 := check(~pd2~0.base, ~pd2~0.offset, ~i~0); {683#true} is VALID [2020-07-08 22:23:17,155 INFO L280 TraceCheckUtils]: 74: Hoare triple {683#true} ~s1.base, ~s1.offset := #in~s1.base, #in~s1.offset; {683#true} is VALID [2020-07-08 22:23:17,155 INFO L280 TraceCheckUtils]: 75: Hoare triple {683#true} ~i := #in~i; {683#true} is VALID [2020-07-08 22:23:17,156 INFO L280 TraceCheckUtils]: 76: Hoare triple {683#true} SUMMARY for call #t~mem6 := read~int(~s1.base, ~s1.offset, 4); srcloc: L27 {683#true} is VALID [2020-07-08 22:23:17,156 INFO L280 TraceCheckUtils]: 77: Hoare triple {683#true} #res := (if #t~mem6 == ~i then 1 else 0); {683#true} is VALID [2020-07-08 22:23:17,156 INFO L280 TraceCheckUtils]: 78: Hoare triple {683#true} havoc #t~mem6; {683#true} is VALID [2020-07-08 22:23:17,156 INFO L280 TraceCheckUtils]: 79: Hoare triple {683#true} assume true; {683#true} is VALID [2020-07-08 22:23:17,157 INFO L275 TraceCheckUtils]: 80: Hoare quadruple {683#true} {684#false} #121#return; {684#false} is VALID [2020-07-08 22:23:17,157 INFO L280 TraceCheckUtils]: 81: Hoare triple {684#false} assume -2147483648 <= #t~ret16 && #t~ret16 <= 2147483647; {684#false} is VALID [2020-07-08 22:23:17,157 INFO L280 TraceCheckUtils]: 82: Hoare triple {684#false} assume 0 == #t~ret16; {684#false} is VALID [2020-07-08 22:23:17,158 INFO L280 TraceCheckUtils]: 83: Hoare triple {684#false} havoc #t~ret16; {684#false} is VALID [2020-07-08 22:23:17,158 INFO L280 TraceCheckUtils]: 84: Hoare triple {684#false} assume !false; {684#false} is VALID [2020-07-08 22:23:17,165 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-07-08 22:23:17,166 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [473694542] [2020-07-08 22:23:17,166 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 22:23:17,166 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-08 22:23:17,166 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220538343] [2020-07-08 22:23:17,168 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 85 [2020-07-08 22:23:17,169 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 22:23:17,169 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-08 22:23:17,244 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 22:23:17,245 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-08 22:23:17,245 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 22:23:17,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-08 22:23:17,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-08 22:23:17,246 INFO L87 Difference]: Start difference. First operand 79 states and 83 transitions. Second operand 5 states. [2020-07-08 22:23:18,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 22:23:18,231 INFO L93 Difference]: Finished difference Result 106 states and 110 transitions. [2020-07-08 22:23:18,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-08 22:23:18,231 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 85 [2020-07-08 22:23:18,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 22:23:18,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-08 22:23:18,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 110 transitions. [2020-07-08 22:23:18,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-08 22:23:18,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 110 transitions. [2020-07-08 22:23:18,243 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 110 transitions. [2020-07-08 22:23:18,454 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 110 edges. 110 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 22:23:18,459 INFO L225 Difference]: With dead ends: 106 [2020-07-08 22:23:18,459 INFO L226 Difference]: Without dead ends: 79 [2020-07-08 22:23:18,460 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-07-08 22:23:18,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2020-07-08 22:23:18,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2020-07-08 22:23:18,725 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 22:23:18,726 INFO L82 GeneralOperation]: Start isEquivalent. First operand 79 states. Second operand 79 states. [2020-07-08 22:23:18,726 INFO L74 IsIncluded]: Start isIncluded. First operand 79 states. Second operand 79 states. [2020-07-08 22:23:18,726 INFO L87 Difference]: Start difference. First operand 79 states. Second operand 79 states. [2020-07-08 22:23:18,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 22:23:18,732 INFO L93 Difference]: Finished difference Result 79 states and 82 transitions. [2020-07-08 22:23:18,732 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 82 transitions. [2020-07-08 22:23:18,733 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 22:23:18,733 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 22:23:18,733 INFO L74 IsIncluded]: Start isIncluded. First operand 79 states. Second operand 79 states. [2020-07-08 22:23:18,733 INFO L87 Difference]: Start difference. First operand 79 states. Second operand 79 states. [2020-07-08 22:23:18,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 22:23:18,738 INFO L93 Difference]: Finished difference Result 79 states and 82 transitions. [2020-07-08 22:23:18,738 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 82 transitions. [2020-07-08 22:23:18,739 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 22:23:18,739 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 22:23:18,740 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 22:23:18,740 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 22:23:18,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2020-07-08 22:23:18,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 82 transitions. [2020-07-08 22:23:18,744 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 82 transitions. Word has length 85 [2020-07-08 22:23:18,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 22:23:18,745 INFO L479 AbstractCegarLoop]: Abstraction has 79 states and 82 transitions. [2020-07-08 22:23:18,745 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-08 22:23:18,745 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 79 states and 82 transitions. [2020-07-08 22:23:18,897 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 22:23:18,897 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 82 transitions. [2020-07-08 22:23:18,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2020-07-08 22:23:18,899 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 22:23:18,900 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 22:23:18,900 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-08 22:23:18,900 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 22:23:18,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 22:23:18,900 INFO L82 PathProgramCache]: Analyzing trace with hash 679818391, now seen corresponding path program 1 times [2020-07-08 22:23:18,901 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 22:23:18,901 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1998832390] [2020-07-08 22:23:18,901 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 22:23:18,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 22:23:19,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 22:23:19,266 INFO L280 TraceCheckUtils]: 0: Hoare triple {1339#(and (= |~#d2~0.offset| |old(~#d2~0.offset)|) (= |~#d1~0.base| |old(~#d1~0.base)|) (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |~#d2~0.base| |old(~#d2~0.base)|) (= |~#d1~0.offset| |old(~#d1~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#length)| |#length|))} #NULL.base, #NULL.offset := 0, 0; {1276#true} is VALID [2020-07-08 22:23:19,267 INFO L280 TraceCheckUtils]: 1: Hoare triple {1276#true} #valid := #valid[0 := 0]; {1276#true} is VALID [2020-07-08 22:23:19,267 INFO L280 TraceCheckUtils]: 2: Hoare triple {1276#true} assume 0 < #StackHeapBarrier; {1276#true} is VALID [2020-07-08 22:23:19,267 INFO L280 TraceCheckUtils]: 3: Hoare triple {1276#true} SUMMARY for call ~#d1~0.base, ~#d1~0.offset := #Ultimate.allocOnStack(8); srcloc: L9 {1276#true} is VALID [2020-07-08 22:23:19,268 INFO L280 TraceCheckUtils]: 4: Hoare triple {1276#true} SUMMARY for call write~init~int(0, ~#d1~0.base, ~#d1~0.offset, 4); srcloc: L9-1 {1276#true} is VALID [2020-07-08 22:23:19,268 INFO L280 TraceCheckUtils]: 5: Hoare triple {1276#true} SUMMARY for call write~init~int(0, ~#d1~0.base, 4 + ~#d1~0.offset, 4); srcloc: L9-2 {1276#true} is VALID [2020-07-08 22:23:19,268 INFO L280 TraceCheckUtils]: 6: Hoare triple {1276#true} SUMMARY for call ~#d2~0.base, ~#d2~0.offset := #Ultimate.allocOnStack(8); srcloc: L9-3 {1276#true} is VALID [2020-07-08 22:23:19,268 INFO L280 TraceCheckUtils]: 7: Hoare triple {1276#true} SUMMARY for call write~init~int(0, ~#d2~0.base, ~#d2~0.offset, 4); srcloc: L9-4 {1276#true} is VALID [2020-07-08 22:23:19,269 INFO L280 TraceCheckUtils]: 8: Hoare triple {1276#true} SUMMARY for call write~init~int(0, ~#d2~0.base, 4 + ~#d2~0.offset, 4); srcloc: L9-5 {1276#true} is VALID [2020-07-08 22:23:19,269 INFO L280 TraceCheckUtils]: 9: Hoare triple {1276#true} assume true; {1276#true} is VALID [2020-07-08 22:23:19,269 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {1276#true} {1276#true} #123#return; {1276#true} is VALID [2020-07-08 22:23:19,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 22:23:19,302 INFO L280 TraceCheckUtils]: 0: Hoare triple {1340#(= |#memory_int| |old(#memory_int)|)} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {1276#true} is VALID [2020-07-08 22:23:19,302 INFO L280 TraceCheckUtils]: 1: Hoare triple {1276#true} SUMMARY for call write~int(#t~nondet0, ~#d1~0.base, ~#d1~0.offset, 4); srcloc: L13 {1276#true} is VALID [2020-07-08 22:23:19,303 INFO L280 TraceCheckUtils]: 2: Hoare triple {1276#true} havoc #t~nondet0; {1276#true} is VALID [2020-07-08 22:23:19,303 INFO L280 TraceCheckUtils]: 3: Hoare triple {1276#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {1276#true} is VALID [2020-07-08 22:23:19,303 INFO L280 TraceCheckUtils]: 4: Hoare triple {1276#true} SUMMARY for call write~int(#t~nondet1, ~#d1~0.base, 4 + ~#d1~0.offset, 4); srcloc: L14-1 {1276#true} is VALID [2020-07-08 22:23:19,304 INFO L280 TraceCheckUtils]: 5: Hoare triple {1276#true} havoc #t~nondet1; {1276#true} is VALID [2020-07-08 22:23:19,304 INFO L280 TraceCheckUtils]: 6: Hoare triple {1276#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {1276#true} is VALID [2020-07-08 22:23:19,304 INFO L280 TraceCheckUtils]: 7: Hoare triple {1276#true} SUMMARY for call write~int(#t~nondet2, ~#d2~0.base, ~#d2~0.offset, 4); srcloc: L16-1 {1276#true} is VALID [2020-07-08 22:23:19,304 INFO L280 TraceCheckUtils]: 8: Hoare triple {1276#true} havoc #t~nondet2; {1276#true} is VALID [2020-07-08 22:23:19,305 INFO L280 TraceCheckUtils]: 9: Hoare triple {1276#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {1276#true} is VALID [2020-07-08 22:23:19,305 INFO L280 TraceCheckUtils]: 10: Hoare triple {1276#true} SUMMARY for call write~int(#t~nondet3, ~#d2~0.base, 4 + ~#d2~0.offset, 4); srcloc: L17-1 {1276#true} is VALID [2020-07-08 22:23:19,305 INFO L280 TraceCheckUtils]: 11: Hoare triple {1276#true} havoc #t~nondet3; {1276#true} is VALID [2020-07-08 22:23:19,305 INFO L280 TraceCheckUtils]: 12: Hoare triple {1276#true} assume true; {1276#true} is VALID [2020-07-08 22:23:19,306 INFO L275 TraceCheckUtils]: 13: Hoare quadruple {1276#true} {1276#true} #113#return; {1276#true} is VALID [2020-07-08 22:23:19,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 22:23:19,391 INFO L280 TraceCheckUtils]: 0: Hoare triple {1276#true} assume 0 != #t~nondet4 % 256; {1276#true} is VALID [2020-07-08 22:23:19,392 INFO L280 TraceCheckUtils]: 1: Hoare triple {1276#true} #t~ite5.base, #t~ite5.offset := ~#d1~0.base, ~#d1~0.offset; {1341#(and (= |get_dummy_#t~ite5.offset| |~#d1~0.offset|) (= |~#d1~0.base| |get_dummy_#t~ite5.base|))} is VALID [2020-07-08 22:23:19,392 INFO L280 TraceCheckUtils]: 2: Hoare triple {1341#(and (= |get_dummy_#t~ite5.offset| |~#d1~0.offset|) (= |~#d1~0.base| |get_dummy_#t~ite5.base|))} #res.base, #res.offset := #t~ite5.base, #t~ite5.offset; {1342#(and (= |get_dummy_#res.offset| |~#d1~0.offset|) (= |~#d1~0.base| |get_dummy_#res.base|))} is VALID [2020-07-08 22:23:19,393 INFO L280 TraceCheckUtils]: 3: Hoare triple {1342#(and (= |get_dummy_#res.offset| |~#d1~0.offset|) (= |~#d1~0.base| |get_dummy_#res.base|))} havoc #t~nondet4; {1342#(and (= |get_dummy_#res.offset| |~#d1~0.offset|) (= |~#d1~0.base| |get_dummy_#res.base|))} is VALID [2020-07-08 22:23:19,394 INFO L280 TraceCheckUtils]: 4: Hoare triple {1342#(and (= |get_dummy_#res.offset| |~#d1~0.offset|) (= |~#d1~0.base| |get_dummy_#res.base|))} havoc #t~ite5.base, #t~ite5.offset; {1342#(and (= |get_dummy_#res.offset| |~#d1~0.offset|) (= |~#d1~0.base| |get_dummy_#res.base|))} is VALID [2020-07-08 22:23:19,394 INFO L280 TraceCheckUtils]: 5: Hoare triple {1342#(and (= |get_dummy_#res.offset| |~#d1~0.offset|) (= |~#d1~0.base| |get_dummy_#res.base|))} assume true; {1342#(and (= |get_dummy_#res.offset| |~#d1~0.offset|) (= |~#d1~0.base| |get_dummy_#res.base|))} is VALID [2020-07-08 22:23:19,396 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {1342#(and (= |get_dummy_#res.offset| |~#d1~0.offset|) (= |~#d1~0.base| |get_dummy_#res.base|))} {1276#true} #115#return; {1310#(and (= |main_#t~ret7.offset| |~#d1~0.offset|) (= |~#d1~0.base| |main_#t~ret7.base|))} is VALID [2020-07-08 22:23:19,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 22:23:19,410 INFO L280 TraceCheckUtils]: 0: Hoare triple {1276#true} assume 0 != #t~nondet4 % 256; {1276#true} is VALID [2020-07-08 22:23:19,411 INFO L280 TraceCheckUtils]: 1: Hoare triple {1276#true} #t~ite5.base, #t~ite5.offset := ~#d1~0.base, ~#d1~0.offset; {1276#true} is VALID [2020-07-08 22:23:19,411 INFO L280 TraceCheckUtils]: 2: Hoare triple {1276#true} #res.base, #res.offset := #t~ite5.base, #t~ite5.offset; {1276#true} is VALID [2020-07-08 22:23:19,411 INFO L280 TraceCheckUtils]: 3: Hoare triple {1276#true} havoc #t~nondet4; {1276#true} is VALID [2020-07-08 22:23:19,411 INFO L280 TraceCheckUtils]: 4: Hoare triple {1276#true} havoc #t~ite5.base, #t~ite5.offset; {1276#true} is VALID [2020-07-08 22:23:19,412 INFO L280 TraceCheckUtils]: 5: Hoare triple {1276#true} assume true; {1276#true} is VALID [2020-07-08 22:23:19,413 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {1276#true} {1311#(and (= |~#d1~0.base| main_~pd1~0.base) (= main_~pd1~0.offset |~#d1~0.offset|))} #117#return; {1311#(and (= |~#d1~0.base| main_~pd1~0.base) (= main_~pd1~0.offset |~#d1~0.offset|))} is VALID [2020-07-08 22:23:19,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 22:23:19,436 INFO L280 TraceCheckUtils]: 0: Hoare triple {1276#true} assume 0 != #t~nondet4 % 256; {1276#true} is VALID [2020-07-08 22:23:19,438 INFO L280 TraceCheckUtils]: 1: Hoare triple {1276#true} #t~ite5.base, #t~ite5.offset := ~#d1~0.base, ~#d1~0.offset; {1341#(and (= |get_dummy_#t~ite5.offset| |~#d1~0.offset|) (= |~#d1~0.base| |get_dummy_#t~ite5.base|))} is VALID [2020-07-08 22:23:19,439 INFO L280 TraceCheckUtils]: 2: Hoare triple {1341#(and (= |get_dummy_#t~ite5.offset| |~#d1~0.offset|) (= |~#d1~0.base| |get_dummy_#t~ite5.base|))} #res.base, #res.offset := #t~ite5.base, #t~ite5.offset; {1342#(and (= |get_dummy_#res.offset| |~#d1~0.offset|) (= |~#d1~0.base| |get_dummy_#res.base|))} is VALID [2020-07-08 22:23:19,440 INFO L280 TraceCheckUtils]: 3: Hoare triple {1342#(and (= |get_dummy_#res.offset| |~#d1~0.offset|) (= |~#d1~0.base| |get_dummy_#res.base|))} havoc #t~nondet4; {1342#(and (= |get_dummy_#res.offset| |~#d1~0.offset|) (= |~#d1~0.base| |get_dummy_#res.base|))} is VALID [2020-07-08 22:23:19,441 INFO L280 TraceCheckUtils]: 4: Hoare triple {1342#(and (= |get_dummy_#res.offset| |~#d1~0.offset|) (= |~#d1~0.base| |get_dummy_#res.base|))} havoc #t~ite5.base, #t~ite5.offset; {1342#(and (= |get_dummy_#res.offset| |~#d1~0.offset|) (= |~#d1~0.base| |get_dummy_#res.base|))} is VALID [2020-07-08 22:23:19,441 INFO L280 TraceCheckUtils]: 5: Hoare triple {1342#(and (= |get_dummy_#res.offset| |~#d1~0.offset|) (= |~#d1~0.base| |get_dummy_#res.base|))} assume true; {1342#(and (= |get_dummy_#res.offset| |~#d1~0.offset|) (= |~#d1~0.base| |get_dummy_#res.base|))} is VALID [2020-07-08 22:23:19,442 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {1342#(and (= |get_dummy_#res.offset| |~#d1~0.offset|) (= |~#d1~0.base| |get_dummy_#res.base|))} {1311#(and (= |~#d1~0.base| main_~pd1~0.base) (= main_~pd1~0.offset |~#d1~0.offset|))} #119#return; {1326#(and (= |main_#t~ret9.base| main_~pd1~0.base) (= main_~pd1~0.offset |main_#t~ret9.offset|))} is VALID [2020-07-08 22:23:19,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 22:23:19,449 INFO L280 TraceCheckUtils]: 0: Hoare triple {1276#true} ~s1.base, ~s1.offset := #in~s1.base, #in~s1.offset; {1276#true} is VALID [2020-07-08 22:23:19,450 INFO L280 TraceCheckUtils]: 1: Hoare triple {1276#true} ~i := #in~i; {1276#true} is VALID [2020-07-08 22:23:19,450 INFO L280 TraceCheckUtils]: 2: Hoare triple {1276#true} SUMMARY for call #t~mem6 := read~int(~s1.base, ~s1.offset, 4); srcloc: L27 {1276#true} is VALID [2020-07-08 22:23:19,450 INFO L280 TraceCheckUtils]: 3: Hoare triple {1276#true} #res := (if #t~mem6 == ~i then 1 else 0); {1276#true} is VALID [2020-07-08 22:23:19,450 INFO L280 TraceCheckUtils]: 4: Hoare triple {1276#true} havoc #t~mem6; {1276#true} is VALID [2020-07-08 22:23:19,451 INFO L280 TraceCheckUtils]: 5: Hoare triple {1276#true} assume true; {1276#true} is VALID [2020-07-08 22:23:19,451 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {1276#true} {1277#false} #121#return; {1277#false} is VALID [2020-07-08 22:23:19,458 INFO L263 TraceCheckUtils]: 0: Hoare triple {1276#true} call ULTIMATE.init(); {1339#(and (= |~#d2~0.offset| |old(~#d2~0.offset)|) (= |~#d1~0.base| |old(~#d1~0.base)|) (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |~#d2~0.base| |old(~#d2~0.base)|) (= |~#d1~0.offset| |old(~#d1~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#length)| |#length|))} is VALID [2020-07-08 22:23:19,459 INFO L280 TraceCheckUtils]: 1: Hoare triple {1339#(and (= |~#d2~0.offset| |old(~#d2~0.offset)|) (= |~#d1~0.base| |old(~#d1~0.base)|) (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |~#d2~0.base| |old(~#d2~0.base)|) (= |~#d1~0.offset| |old(~#d1~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#length)| |#length|))} #NULL.base, #NULL.offset := 0, 0; {1276#true} is VALID [2020-07-08 22:23:19,459 INFO L280 TraceCheckUtils]: 2: Hoare triple {1276#true} #valid := #valid[0 := 0]; {1276#true} is VALID [2020-07-08 22:23:19,459 INFO L280 TraceCheckUtils]: 3: Hoare triple {1276#true} assume 0 < #StackHeapBarrier; {1276#true} is VALID [2020-07-08 22:23:19,460 INFO L280 TraceCheckUtils]: 4: Hoare triple {1276#true} SUMMARY for call ~#d1~0.base, ~#d1~0.offset := #Ultimate.allocOnStack(8); srcloc: L9 {1276#true} is VALID [2020-07-08 22:23:19,460 INFO L280 TraceCheckUtils]: 5: Hoare triple {1276#true} SUMMARY for call write~init~int(0, ~#d1~0.base, ~#d1~0.offset, 4); srcloc: L9-1 {1276#true} is VALID [2020-07-08 22:23:19,460 INFO L280 TraceCheckUtils]: 6: Hoare triple {1276#true} SUMMARY for call write~init~int(0, ~#d1~0.base, 4 + ~#d1~0.offset, 4); srcloc: L9-2 {1276#true} is VALID [2020-07-08 22:23:19,460 INFO L280 TraceCheckUtils]: 7: Hoare triple {1276#true} SUMMARY for call ~#d2~0.base, ~#d2~0.offset := #Ultimate.allocOnStack(8); srcloc: L9-3 {1276#true} is VALID [2020-07-08 22:23:19,460 INFO L280 TraceCheckUtils]: 8: Hoare triple {1276#true} SUMMARY for call write~init~int(0, ~#d2~0.base, ~#d2~0.offset, 4); srcloc: L9-4 {1276#true} is VALID [2020-07-08 22:23:19,461 INFO L280 TraceCheckUtils]: 9: Hoare triple {1276#true} SUMMARY for call write~init~int(0, ~#d2~0.base, 4 + ~#d2~0.offset, 4); srcloc: L9-5 {1276#true} is VALID [2020-07-08 22:23:19,461 INFO L280 TraceCheckUtils]: 10: Hoare triple {1276#true} assume true; {1276#true} is VALID [2020-07-08 22:23:19,465 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {1276#true} {1276#true} #123#return; {1276#true} is VALID [2020-07-08 22:23:19,466 INFO L263 TraceCheckUtils]: 12: Hoare triple {1276#true} call #t~ret17 := main(); {1276#true} is VALID [2020-07-08 22:23:19,469 INFO L263 TraceCheckUtils]: 13: Hoare triple {1276#true} call init(); {1340#(= |#memory_int| |old(#memory_int)|)} is VALID [2020-07-08 22:23:19,470 INFO L280 TraceCheckUtils]: 14: Hoare triple {1340#(= |#memory_int| |old(#memory_int)|)} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {1276#true} is VALID [2020-07-08 22:23:19,470 INFO L280 TraceCheckUtils]: 15: Hoare triple {1276#true} SUMMARY for call write~int(#t~nondet0, ~#d1~0.base, ~#d1~0.offset, 4); srcloc: L13 {1276#true} is VALID [2020-07-08 22:23:19,470 INFO L280 TraceCheckUtils]: 16: Hoare triple {1276#true} havoc #t~nondet0; {1276#true} is VALID [2020-07-08 22:23:19,471 INFO L280 TraceCheckUtils]: 17: Hoare triple {1276#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {1276#true} is VALID [2020-07-08 22:23:19,471 INFO L280 TraceCheckUtils]: 18: Hoare triple {1276#true} SUMMARY for call write~int(#t~nondet1, ~#d1~0.base, 4 + ~#d1~0.offset, 4); srcloc: L14-1 {1276#true} is VALID [2020-07-08 22:23:19,471 INFO L280 TraceCheckUtils]: 19: Hoare triple {1276#true} havoc #t~nondet1; {1276#true} is VALID [2020-07-08 22:23:19,471 INFO L280 TraceCheckUtils]: 20: Hoare triple {1276#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {1276#true} is VALID [2020-07-08 22:23:19,471 INFO L280 TraceCheckUtils]: 21: Hoare triple {1276#true} SUMMARY for call write~int(#t~nondet2, ~#d2~0.base, ~#d2~0.offset, 4); srcloc: L16-1 {1276#true} is VALID [2020-07-08 22:23:19,472 INFO L280 TraceCheckUtils]: 22: Hoare triple {1276#true} havoc #t~nondet2; {1276#true} is VALID [2020-07-08 22:23:19,472 INFO L280 TraceCheckUtils]: 23: Hoare triple {1276#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {1276#true} is VALID [2020-07-08 22:23:19,472 INFO L280 TraceCheckUtils]: 24: Hoare triple {1276#true} SUMMARY for call write~int(#t~nondet3, ~#d2~0.base, 4 + ~#d2~0.offset, 4); srcloc: L17-1 {1276#true} is VALID [2020-07-08 22:23:19,476 INFO L280 TraceCheckUtils]: 25: Hoare triple {1276#true} havoc #t~nondet3; {1276#true} is VALID [2020-07-08 22:23:19,476 INFO L280 TraceCheckUtils]: 26: Hoare triple {1276#true} assume true; {1276#true} is VALID [2020-07-08 22:23:19,476 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {1276#true} {1276#true} #113#return; {1276#true} is VALID [2020-07-08 22:23:19,476 INFO L263 TraceCheckUtils]: 28: Hoare triple {1276#true} call #t~ret7.base, #t~ret7.offset := get_dummy(); {1276#true} is VALID [2020-07-08 22:23:19,476 INFO L280 TraceCheckUtils]: 29: Hoare triple {1276#true} assume 0 != #t~nondet4 % 256; {1276#true} is VALID [2020-07-08 22:23:19,480 INFO L280 TraceCheckUtils]: 30: Hoare triple {1276#true} #t~ite5.base, #t~ite5.offset := ~#d1~0.base, ~#d1~0.offset; {1341#(and (= |get_dummy_#t~ite5.offset| |~#d1~0.offset|) (= |~#d1~0.base| |get_dummy_#t~ite5.base|))} is VALID [2020-07-08 22:23:19,481 INFO L280 TraceCheckUtils]: 31: Hoare triple {1341#(and (= |get_dummy_#t~ite5.offset| |~#d1~0.offset|) (= |~#d1~0.base| |get_dummy_#t~ite5.base|))} #res.base, #res.offset := #t~ite5.base, #t~ite5.offset; {1342#(and (= |get_dummy_#res.offset| |~#d1~0.offset|) (= |~#d1~0.base| |get_dummy_#res.base|))} is VALID [2020-07-08 22:23:19,483 INFO L280 TraceCheckUtils]: 32: Hoare triple {1342#(and (= |get_dummy_#res.offset| |~#d1~0.offset|) (= |~#d1~0.base| |get_dummy_#res.base|))} havoc #t~nondet4; {1342#(and (= |get_dummy_#res.offset| |~#d1~0.offset|) (= |~#d1~0.base| |get_dummy_#res.base|))} is VALID [2020-07-08 22:23:19,483 INFO L280 TraceCheckUtils]: 33: Hoare triple {1342#(and (= |get_dummy_#res.offset| |~#d1~0.offset|) (= |~#d1~0.base| |get_dummy_#res.base|))} havoc #t~ite5.base, #t~ite5.offset; {1342#(and (= |get_dummy_#res.offset| |~#d1~0.offset|) (= |~#d1~0.base| |get_dummy_#res.base|))} is VALID [2020-07-08 22:23:19,484 INFO L280 TraceCheckUtils]: 34: Hoare triple {1342#(and (= |get_dummy_#res.offset| |~#d1~0.offset|) (= |~#d1~0.base| |get_dummy_#res.base|))} assume true; {1342#(and (= |get_dummy_#res.offset| |~#d1~0.offset|) (= |~#d1~0.base| |get_dummy_#res.base|))} is VALID [2020-07-08 22:23:19,485 INFO L275 TraceCheckUtils]: 35: Hoare quadruple {1342#(and (= |get_dummy_#res.offset| |~#d1~0.offset|) (= |~#d1~0.base| |get_dummy_#res.base|))} {1276#true} #115#return; {1310#(and (= |main_#t~ret7.offset| |~#d1~0.offset|) (= |~#d1~0.base| |main_#t~ret7.base|))} is VALID [2020-07-08 22:23:19,486 INFO L280 TraceCheckUtils]: 36: Hoare triple {1310#(and (= |main_#t~ret7.offset| |~#d1~0.offset|) (= |~#d1~0.base| |main_#t~ret7.base|))} ~pd1~0.base, ~pd1~0.offset := #t~ret7.base, #t~ret7.offset; {1311#(and (= |~#d1~0.base| main_~pd1~0.base) (= main_~pd1~0.offset |~#d1~0.offset|))} is VALID [2020-07-08 22:23:19,487 INFO L280 TraceCheckUtils]: 37: Hoare triple {1311#(and (= |~#d1~0.base| main_~pd1~0.base) (= main_~pd1~0.offset |~#d1~0.offset|))} havoc #t~ret7.base, #t~ret7.offset; {1311#(and (= |~#d1~0.base| main_~pd1~0.base) (= main_~pd1~0.offset |~#d1~0.offset|))} is VALID [2020-07-08 22:23:19,487 INFO L263 TraceCheckUtils]: 38: Hoare triple {1311#(and (= |~#d1~0.base| main_~pd1~0.base) (= main_~pd1~0.offset |~#d1~0.offset|))} call #t~ret8.base, #t~ret8.offset := get_dummy(); {1276#true} is VALID [2020-07-08 22:23:19,487 INFO L280 TraceCheckUtils]: 39: Hoare triple {1276#true} assume 0 != #t~nondet4 % 256; {1276#true} is VALID [2020-07-08 22:23:19,487 INFO L280 TraceCheckUtils]: 40: Hoare triple {1276#true} #t~ite5.base, #t~ite5.offset := ~#d1~0.base, ~#d1~0.offset; {1276#true} is VALID [2020-07-08 22:23:19,488 INFO L280 TraceCheckUtils]: 41: Hoare triple {1276#true} #res.base, #res.offset := #t~ite5.base, #t~ite5.offset; {1276#true} is VALID [2020-07-08 22:23:19,488 INFO L280 TraceCheckUtils]: 42: Hoare triple {1276#true} havoc #t~nondet4; {1276#true} is VALID [2020-07-08 22:23:19,488 INFO L280 TraceCheckUtils]: 43: Hoare triple {1276#true} havoc #t~ite5.base, #t~ite5.offset; {1276#true} is VALID [2020-07-08 22:23:19,488 INFO L280 TraceCheckUtils]: 44: Hoare triple {1276#true} assume true; {1276#true} is VALID [2020-07-08 22:23:19,490 INFO L275 TraceCheckUtils]: 45: Hoare quadruple {1276#true} {1311#(and (= |~#d1~0.base| main_~pd1~0.base) (= main_~pd1~0.offset |~#d1~0.offset|))} #117#return; {1311#(and (= |~#d1~0.base| main_~pd1~0.base) (= main_~pd1~0.offset |~#d1~0.offset|))} is VALID [2020-07-08 22:23:19,491 INFO L280 TraceCheckUtils]: 46: Hoare triple {1311#(and (= |~#d1~0.base| main_~pd1~0.base) (= main_~pd1~0.offset |~#d1~0.offset|))} ~pd2~0.base, ~pd2~0.offset := #t~ret8.base, #t~ret8.offset; {1311#(and (= |~#d1~0.base| main_~pd1~0.base) (= main_~pd1~0.offset |~#d1~0.offset|))} is VALID [2020-07-08 22:23:19,491 INFO L280 TraceCheckUtils]: 47: Hoare triple {1311#(and (= |~#d1~0.base| main_~pd1~0.base) (= main_~pd1~0.offset |~#d1~0.offset|))} havoc #t~ret8.base, #t~ret8.offset; {1311#(and (= |~#d1~0.base| main_~pd1~0.base) (= main_~pd1~0.offset |~#d1~0.offset|))} is VALID [2020-07-08 22:23:19,492 INFO L263 TraceCheckUtils]: 48: Hoare triple {1311#(and (= |~#d1~0.base| main_~pd1~0.base) (= main_~pd1~0.offset |~#d1~0.offset|))} call #t~ret9.base, #t~ret9.offset := get_dummy(); {1276#true} is VALID [2020-07-08 22:23:19,492 INFO L280 TraceCheckUtils]: 49: Hoare triple {1276#true} assume 0 != #t~nondet4 % 256; {1276#true} is VALID [2020-07-08 22:23:19,493 INFO L280 TraceCheckUtils]: 50: Hoare triple {1276#true} #t~ite5.base, #t~ite5.offset := ~#d1~0.base, ~#d1~0.offset; {1341#(and (= |get_dummy_#t~ite5.offset| |~#d1~0.offset|) (= |~#d1~0.base| |get_dummy_#t~ite5.base|))} is VALID [2020-07-08 22:23:19,495 INFO L280 TraceCheckUtils]: 51: Hoare triple {1341#(and (= |get_dummy_#t~ite5.offset| |~#d1~0.offset|) (= |~#d1~0.base| |get_dummy_#t~ite5.base|))} #res.base, #res.offset := #t~ite5.base, #t~ite5.offset; {1342#(and (= |get_dummy_#res.offset| |~#d1~0.offset|) (= |~#d1~0.base| |get_dummy_#res.base|))} is VALID [2020-07-08 22:23:19,496 INFO L280 TraceCheckUtils]: 52: Hoare triple {1342#(and (= |get_dummy_#res.offset| |~#d1~0.offset|) (= |~#d1~0.base| |get_dummy_#res.base|))} havoc #t~nondet4; {1342#(and (= |get_dummy_#res.offset| |~#d1~0.offset|) (= |~#d1~0.base| |get_dummy_#res.base|))} is VALID [2020-07-08 22:23:19,497 INFO L280 TraceCheckUtils]: 53: Hoare triple {1342#(and (= |get_dummy_#res.offset| |~#d1~0.offset|) (= |~#d1~0.base| |get_dummy_#res.base|))} havoc #t~ite5.base, #t~ite5.offset; {1342#(and (= |get_dummy_#res.offset| |~#d1~0.offset|) (= |~#d1~0.base| |get_dummy_#res.base|))} is VALID [2020-07-08 22:23:19,498 INFO L280 TraceCheckUtils]: 54: Hoare triple {1342#(and (= |get_dummy_#res.offset| |~#d1~0.offset|) (= |~#d1~0.base| |get_dummy_#res.base|))} assume true; {1342#(and (= |get_dummy_#res.offset| |~#d1~0.offset|) (= |~#d1~0.base| |get_dummy_#res.base|))} is VALID [2020-07-08 22:23:19,500 INFO L275 TraceCheckUtils]: 55: Hoare quadruple {1342#(and (= |get_dummy_#res.offset| |~#d1~0.offset|) (= |~#d1~0.base| |get_dummy_#res.base|))} {1311#(and (= |~#d1~0.base| main_~pd1~0.base) (= main_~pd1~0.offset |~#d1~0.offset|))} #119#return; {1326#(and (= |main_#t~ret9.base| main_~pd1~0.base) (= main_~pd1~0.offset |main_#t~ret9.offset|))} is VALID [2020-07-08 22:23:19,501 INFO L280 TraceCheckUtils]: 56: Hoare triple {1326#(and (= |main_#t~ret9.base| main_~pd1~0.base) (= main_~pd1~0.offset |main_#t~ret9.offset|))} ~pd3~0.base, ~pd3~0.offset := #t~ret9.base, #t~ret9.offset; {1327#(and (= main_~pd3~0.base main_~pd1~0.base) (= main_~pd3~0.offset main_~pd1~0.offset))} is VALID [2020-07-08 22:23:19,512 INFO L280 TraceCheckUtils]: 57: Hoare triple {1327#(and (= main_~pd3~0.base main_~pd1~0.base) (= main_~pd3~0.offset main_~pd1~0.offset))} havoc #t~ret9.base, #t~ret9.offset; {1327#(and (= main_~pd3~0.base main_~pd1~0.base) (= main_~pd3~0.offset main_~pd1~0.offset))} is VALID [2020-07-08 22:23:19,513 INFO L280 TraceCheckUtils]: 58: Hoare triple {1327#(and (= main_~pd3~0.base main_~pd1~0.base) (= main_~pd3~0.offset main_~pd1~0.offset))} assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647; {1327#(and (= main_~pd3~0.base main_~pd1~0.base) (= main_~pd3~0.offset main_~pd1~0.offset))} is VALID [2020-07-08 22:23:19,514 INFO L280 TraceCheckUtils]: 59: Hoare triple {1327#(and (= main_~pd3~0.base main_~pd1~0.base) (= main_~pd3~0.offset main_~pd1~0.offset))} ~i~0 := #t~nondet10; {1327#(and (= main_~pd3~0.base main_~pd1~0.base) (= main_~pd3~0.offset main_~pd1~0.offset))} is VALID [2020-07-08 22:23:19,514 INFO L280 TraceCheckUtils]: 60: Hoare triple {1327#(and (= main_~pd3~0.base main_~pd1~0.base) (= main_~pd3~0.offset main_~pd1~0.offset))} havoc #t~nondet10; {1327#(and (= main_~pd3~0.base main_~pd1~0.base) (= main_~pd3~0.offset main_~pd1~0.offset))} is VALID [2020-07-08 22:23:19,515 INFO L280 TraceCheckUtils]: 61: Hoare triple {1327#(and (= main_~pd3~0.base main_~pd1~0.base) (= main_~pd3~0.offset main_~pd1~0.offset))} #t~short12 := (~pd1~0.base != 0 || ~pd1~0.offset != 0) && ~pd1~0.base == ~pd2~0.base && ~pd1~0.offset == ~pd2~0.offset; {1327#(and (= main_~pd3~0.base main_~pd1~0.base) (= main_~pd3~0.offset main_~pd1~0.offset))} is VALID [2020-07-08 22:23:19,518 INFO L280 TraceCheckUtils]: 62: Hoare triple {1327#(and (= main_~pd3~0.base main_~pd1~0.base) (= main_~pd3~0.offset main_~pd1~0.offset))} assume #t~short12; {1327#(and (= main_~pd3~0.base main_~pd1~0.base) (= main_~pd3~0.offset main_~pd1~0.offset))} is VALID [2020-07-08 22:23:19,521 INFO L280 TraceCheckUtils]: 63: Hoare triple {1327#(and (= main_~pd3~0.base main_~pd1~0.base) (= main_~pd3~0.offset main_~pd1~0.offset))} SUMMARY for call #t~mem11 := read~int(~pd2~0.base, ~pd2~0.offset, 4); srcloc: L35-2 {1327#(and (= main_~pd3~0.base main_~pd1~0.base) (= main_~pd3~0.offset main_~pd1~0.offset))} is VALID [2020-07-08 22:23:19,522 INFO L280 TraceCheckUtils]: 64: Hoare triple {1327#(and (= main_~pd3~0.base main_~pd1~0.base) (= main_~pd3~0.offset main_~pd1~0.offset))} #t~short12 := #t~mem11 > 0; {1327#(and (= main_~pd3~0.base main_~pd1~0.base) (= main_~pd3~0.offset main_~pd1~0.offset))} is VALID [2020-07-08 22:23:19,523 INFO L280 TraceCheckUtils]: 65: Hoare triple {1327#(and (= main_~pd3~0.base main_~pd1~0.base) (= main_~pd3~0.offset main_~pd1~0.offset))} assume #t~short12; {1327#(and (= main_~pd3~0.base main_~pd1~0.base) (= main_~pd3~0.offset main_~pd1~0.offset))} is VALID [2020-07-08 22:23:19,524 INFO L280 TraceCheckUtils]: 66: Hoare triple {1327#(and (= main_~pd3~0.base main_~pd1~0.base) (= main_~pd3~0.offset main_~pd1~0.offset))} havoc #t~mem11; {1327#(and (= main_~pd3~0.base main_~pd1~0.base) (= main_~pd3~0.offset main_~pd1~0.offset))} is VALID [2020-07-08 22:23:19,524 INFO L280 TraceCheckUtils]: 67: Hoare triple {1327#(and (= main_~pd3~0.base main_~pd1~0.base) (= main_~pd3~0.offset main_~pd1~0.offset))} havoc #t~short12; {1327#(and (= main_~pd3~0.base main_~pd1~0.base) (= main_~pd3~0.offset main_~pd1~0.offset))} is VALID [2020-07-08 22:23:19,525 INFO L280 TraceCheckUtils]: 68: Hoare triple {1327#(and (= main_~pd3~0.base main_~pd1~0.base) (= main_~pd3~0.offset main_~pd1~0.offset))} ~pa~0.base, ~pa~0.offset := ~pd1~0.base, ~pd1~0.offset; {1328#(and (= main_~pa~0.base main_~pd3~0.base) (= main_~pd3~0.offset main_~pa~0.offset))} is VALID [2020-07-08 22:23:19,526 INFO L280 TraceCheckUtils]: 69: Hoare triple {1328#(and (= main_~pa~0.base main_~pd3~0.base) (= main_~pd3~0.offset main_~pa~0.offset))} SUMMARY for call #t~mem13 := read~int(~pd3~0.base, ~pd3~0.offset, 4); srcloc: L37 {1329#(= |main_#t~mem13| (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))} is VALID [2020-07-08 22:23:19,527 INFO L280 TraceCheckUtils]: 70: Hoare triple {1329#(= |main_#t~mem13| (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))} ~i~0 := #t~mem13 - 10; {1330#(<= (+ main_~i~0 10) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))} is VALID [2020-07-08 22:23:19,527 INFO L280 TraceCheckUtils]: 71: Hoare triple {1330#(<= (+ main_~i~0 10) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))} havoc #t~mem13; {1330#(<= (+ main_~i~0 10) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))} is VALID [2020-07-08 22:23:19,528 INFO L280 TraceCheckUtils]: 72: Hoare triple {1330#(<= (+ main_~i~0 10) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))} SUMMARY for call #t~mem14 := read~int(~pa~0.base, ~pa~0.offset, 4); srcloc: L38-5 {1331#(<= (+ main_~i~0 10) |main_#t~mem14|)} is VALID [2020-07-08 22:23:19,529 INFO L280 TraceCheckUtils]: 73: Hoare triple {1331#(<= (+ main_~i~0 10) |main_#t~mem14|)} assume !(~i~0 < #t~mem14); {1277#false} is VALID [2020-07-08 22:23:19,529 INFO L280 TraceCheckUtils]: 74: Hoare triple {1277#false} havoc #t~mem14; {1277#false} is VALID [2020-07-08 22:23:19,529 INFO L263 TraceCheckUtils]: 75: Hoare triple {1277#false} call #t~ret16 := check(~pd2~0.base, ~pd2~0.offset, ~i~0); {1276#true} is VALID [2020-07-08 22:23:19,529 INFO L280 TraceCheckUtils]: 76: Hoare triple {1276#true} ~s1.base, ~s1.offset := #in~s1.base, #in~s1.offset; {1276#true} is VALID [2020-07-08 22:23:19,530 INFO L280 TraceCheckUtils]: 77: Hoare triple {1276#true} ~i := #in~i; {1276#true} is VALID [2020-07-08 22:23:19,530 INFO L280 TraceCheckUtils]: 78: Hoare triple {1276#true} SUMMARY for call #t~mem6 := read~int(~s1.base, ~s1.offset, 4); srcloc: L27 {1276#true} is VALID [2020-07-08 22:23:19,530 INFO L280 TraceCheckUtils]: 79: Hoare triple {1276#true} #res := (if #t~mem6 == ~i then 1 else 0); {1276#true} is VALID [2020-07-08 22:23:19,530 INFO L280 TraceCheckUtils]: 80: Hoare triple {1276#true} havoc #t~mem6; {1276#true} is VALID [2020-07-08 22:23:19,530 INFO L280 TraceCheckUtils]: 81: Hoare triple {1276#true} assume true; {1276#true} is VALID [2020-07-08 22:23:19,531 INFO L275 TraceCheckUtils]: 82: Hoare quadruple {1276#true} {1277#false} #121#return; {1277#false} is VALID [2020-07-08 22:23:19,531 INFO L280 TraceCheckUtils]: 83: Hoare triple {1277#false} assume -2147483648 <= #t~ret16 && #t~ret16 <= 2147483647; {1277#false} is VALID [2020-07-08 22:23:19,531 INFO L280 TraceCheckUtils]: 84: Hoare triple {1277#false} assume 0 == #t~ret16; {1277#false} is VALID [2020-07-08 22:23:19,531 INFO L280 TraceCheckUtils]: 85: Hoare triple {1277#false} havoc #t~ret16; {1277#false} is VALID [2020-07-08 22:23:19,531 INFO L280 TraceCheckUtils]: 86: Hoare triple {1277#false} assume !false; {1277#false} is VALID [2020-07-08 22:23:19,545 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-07-08 22:23:19,546 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1998832390] [2020-07-08 22:23:19,546 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-08 22:23:19,546 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2020-07-08 22:23:19,547 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123526360] [2020-07-08 22:23:19,549 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 87 [2020-07-08 22:23:19,553 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 22:23:19,553 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2020-07-08 22:23:19,638 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 22:23:19,638 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-07-08 22:23:19,638 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 22:23:19,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-07-08 22:23:19,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2020-07-08 22:23:19,639 INFO L87 Difference]: Start difference. First operand 79 states and 82 transitions. Second operand 14 states. [2020-07-08 22:23:24,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 22:23:24,659 INFO L93 Difference]: Finished difference Result 167 states and 178 transitions. [2020-07-08 22:23:24,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-07-08 22:23:24,659 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 87 [2020-07-08 22:23:24,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 22:23:24,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-08 22:23:24,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 178 transitions. [2020-07-08 22:23:24,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-08 22:23:24,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 178 transitions. [2020-07-08 22:23:24,674 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states and 178 transitions. [2020-07-08 22:23:24,994 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 178 edges. 178 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 22:23:25,001 INFO L225 Difference]: With dead ends: 167 [2020-07-08 22:23:25,001 INFO L226 Difference]: Without dead ends: 153 [2020-07-08 22:23:25,002 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=139, Invalid=673, Unknown=0, NotChecked=0, Total=812 [2020-07-08 22:23:25,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2020-07-08 22:23:25,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 108. [2020-07-08 22:23:25,484 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 22:23:25,485 INFO L82 GeneralOperation]: Start isEquivalent. First operand 153 states. Second operand 108 states. [2020-07-08 22:23:25,485 INFO L74 IsIncluded]: Start isIncluded. First operand 153 states. Second operand 108 states. [2020-07-08 22:23:25,485 INFO L87 Difference]: Start difference. First operand 153 states. Second operand 108 states. [2020-07-08 22:23:25,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 22:23:25,494 INFO L93 Difference]: Finished difference Result 153 states and 164 transitions. [2020-07-08 22:23:25,494 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 164 transitions. [2020-07-08 22:23:25,495 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 22:23:25,495 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 22:23:25,496 INFO L74 IsIncluded]: Start isIncluded. First operand 108 states. Second operand 153 states. [2020-07-08 22:23:25,496 INFO L87 Difference]: Start difference. First operand 108 states. Second operand 153 states. [2020-07-08 22:23:25,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 22:23:25,505 INFO L93 Difference]: Finished difference Result 153 states and 164 transitions. [2020-07-08 22:23:25,505 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 164 transitions. [2020-07-08 22:23:25,506 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 22:23:25,506 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 22:23:25,506 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 22:23:25,506 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 22:23:25,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2020-07-08 22:23:25,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 117 transitions. [2020-07-08 22:23:25,512 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 117 transitions. Word has length 87 [2020-07-08 22:23:25,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 22:23:25,512 INFO L479 AbstractCegarLoop]: Abstraction has 108 states and 117 transitions. [2020-07-08 22:23:25,512 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-07-08 22:23:25,512 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 108 states and 117 transitions. [2020-07-08 22:23:25,719 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 117 edges. 117 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 22:23:25,719 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 117 transitions. [2020-07-08 22:23:25,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2020-07-08 22:23:25,722 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 22:23:25,722 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 22:23:25,723 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-08 22:23:25,723 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 22:23:25,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 22:23:25,723 INFO L82 PathProgramCache]: Analyzing trace with hash -2022406921, now seen corresponding path program 1 times [2020-07-08 22:23:25,723 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 22:23:25,724 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [799023829] [2020-07-08 22:23:25,724 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 22:23:25,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-08 22:23:25,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-08 22:23:25,823 INFO L174 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-07-08 22:23:25,824 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-08 22:23:25,824 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-08 22:23:25,929 WARN L170 areAnnotationChecker]: initENTRY has no Hoare annotation [2020-07-08 22:23:25,929 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2020-07-08 22:23:25,929 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-08 22:23:25,929 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-08 22:23:25,930 WARN L170 areAnnotationChecker]: get_dummyENTRY has no Hoare annotation [2020-07-08 22:23:25,930 WARN L170 areAnnotationChecker]: get_dummyENTRY has no Hoare annotation [2020-07-08 22:23:25,930 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2020-07-08 22:23:25,930 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2020-07-08 22:23:25,930 WARN L170 areAnnotationChecker]: checkENTRY has no Hoare annotation [2020-07-08 22:23:25,930 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2020-07-08 22:23:25,930 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-08 22:23:25,930 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-08 22:23:25,930 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-08 22:23:25,931 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2020-07-08 22:23:25,931 WARN L170 areAnnotationChecker]: L22-2 has no Hoare annotation [2020-07-08 22:23:25,931 WARN L170 areAnnotationChecker]: L32 has no Hoare annotation [2020-07-08 22:23:25,931 WARN L170 areAnnotationChecker]: L32 has no Hoare annotation [2020-07-08 22:23:25,931 WARN L170 areAnnotationChecker]: L25 has no Hoare annotation [2020-07-08 22:23:25,931 WARN L170 areAnnotationChecker]: L13-1 has no Hoare annotation [2020-07-08 22:23:25,931 WARN L170 areAnnotationChecker]: L-1-1 has no Hoare annotation [2020-07-08 22:23:25,931 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-08 22:23:25,931 WARN L170 areAnnotationChecker]: L22-3 has no Hoare annotation [2020-07-08 22:23:25,931 WARN L170 areAnnotationChecker]: L33 has no Hoare annotation [2020-07-08 22:23:25,932 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2020-07-08 22:23:25,932 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2020-07-08 22:23:25,932 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2020-07-08 22:23:25,932 WARN L170 areAnnotationChecker]: L22-4 has no Hoare annotation [2020-07-08 22:23:25,932 WARN L170 areAnnotationChecker]: L33-1 has no Hoare annotation [2020-07-08 22:23:25,932 WARN L170 areAnnotationChecker]: L27-1 has no Hoare annotation [2020-07-08 22:23:25,932 WARN L170 areAnnotationChecker]: L14-1 has no Hoare annotation [2020-07-08 22:23:25,933 WARN L170 areAnnotationChecker]: L9-1 has no Hoare annotation [2020-07-08 22:23:25,933 WARN L170 areAnnotationChecker]: L22-5 has no Hoare annotation [2020-07-08 22:23:25,933 WARN L170 areAnnotationChecker]: L33-2 has no Hoare annotation [2020-07-08 22:23:25,933 WARN L170 areAnnotationChecker]: L33-2 has no Hoare annotation [2020-07-08 22:23:25,933 WARN L170 areAnnotationChecker]: L27-2 has no Hoare annotation [2020-07-08 22:23:25,933 WARN L170 areAnnotationChecker]: L14-2 has no Hoare annotation [2020-07-08 22:23:25,933 WARN L170 areAnnotationChecker]: L9-2 has no Hoare annotation [2020-07-08 22:23:25,933 WARN L170 areAnnotationChecker]: get_dummyFINAL has no Hoare annotation [2020-07-08 22:23:25,933 WARN L170 areAnnotationChecker]: L33-3 has no Hoare annotation [2020-07-08 22:23:25,934 WARN L170 areAnnotationChecker]: checkFINAL has no Hoare annotation [2020-07-08 22:23:25,934 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2020-07-08 22:23:25,934 WARN L170 areAnnotationChecker]: L9-3 has no Hoare annotation [2020-07-08 22:23:25,934 WARN L170 areAnnotationChecker]: get_dummyEXIT has no Hoare annotation [2020-07-08 22:23:25,934 WARN L170 areAnnotationChecker]: get_dummyEXIT has no Hoare annotation [2020-07-08 22:23:25,934 WARN L170 areAnnotationChecker]: get_dummyEXIT has no Hoare annotation [2020-07-08 22:23:25,934 WARN L170 areAnnotationChecker]: L33-4 has no Hoare annotation [2020-07-08 22:23:25,934 WARN L170 areAnnotationChecker]: checkEXIT has no Hoare annotation [2020-07-08 22:23:25,935 WARN L170 areAnnotationChecker]: L16-1 has no Hoare annotation [2020-07-08 22:23:25,935 WARN L170 areAnnotationChecker]: L9-4 has no Hoare annotation [2020-07-08 22:23:25,935 WARN L170 areAnnotationChecker]: L33-6 has no Hoare annotation [2020-07-08 22:23:25,935 WARN L170 areAnnotationChecker]: L33-5 has no Hoare annotation [2020-07-08 22:23:25,935 WARN L170 areAnnotationChecker]: L33-5 has no Hoare annotation [2020-07-08 22:23:25,935 WARN L170 areAnnotationChecker]: L41 has no Hoare annotation [2020-07-08 22:23:25,935 WARN L170 areAnnotationChecker]: L16-2 has no Hoare annotation [2020-07-08 22:23:25,935 WARN L170 areAnnotationChecker]: L9-5 has no Hoare annotation [2020-07-08 22:23:25,935 WARN L170 areAnnotationChecker]: L33-7 has no Hoare annotation [2020-07-08 22:23:25,936 WARN L170 areAnnotationChecker]: L41-1 has no Hoare annotation [2020-07-08 22:23:25,936 WARN L170 areAnnotationChecker]: L41-1 has no Hoare annotation [2020-07-08 22:23:25,936 WARN L170 areAnnotationChecker]: L17 has no Hoare annotation [2020-07-08 22:23:25,936 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-08 22:23:25,936 WARN L170 areAnnotationChecker]: L34 has no Hoare annotation [2020-07-08 22:23:25,936 WARN L170 areAnnotationChecker]: L41-2 has no Hoare annotation [2020-07-08 22:23:25,936 WARN L170 areAnnotationChecker]: L41-3 has no Hoare annotation [2020-07-08 22:23:25,937 WARN L170 areAnnotationChecker]: L17-1 has no Hoare annotation [2020-07-08 22:23:25,937 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-08 22:23:25,937 WARN L170 areAnnotationChecker]: L34-1 has no Hoare annotation [2020-07-08 22:23:25,937 WARN L170 areAnnotationChecker]: L42 has no Hoare annotation [2020-07-08 22:23:25,937 WARN L170 areAnnotationChecker]: L42 has no Hoare annotation [2020-07-08 22:23:25,937 WARN L170 areAnnotationChecker]: L35-11 has no Hoare annotation [2020-07-08 22:23:25,937 WARN L170 areAnnotationChecker]: L17-2 has no Hoare annotation [2020-07-08 22:23:25,937 WARN L170 areAnnotationChecker]: L34-2 has no Hoare annotation [2020-07-08 22:23:25,938 WARN L170 areAnnotationChecker]: L49 has no Hoare annotation [2020-07-08 22:23:25,938 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-08 22:23:25,938 WARN L170 areAnnotationChecker]: initFINAL has no Hoare annotation [2020-07-08 22:23:25,938 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2020-07-08 22:23:25,938 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-08 22:23:25,938 WARN L170 areAnnotationChecker]: initEXIT has no Hoare annotation [2020-07-08 22:23:25,938 WARN L170 areAnnotationChecker]: L35-1 has no Hoare annotation [2020-07-08 22:23:25,938 WARN L170 areAnnotationChecker]: L35-1 has no Hoare annotation [2020-07-08 22:23:25,938 WARN L170 areAnnotationChecker]: L35-2 has no Hoare annotation [2020-07-08 22:23:25,939 WARN L170 areAnnotationChecker]: L35-5 has no Hoare annotation [2020-07-08 22:23:25,939 WARN L170 areAnnotationChecker]: L35-5 has no Hoare annotation [2020-07-08 22:23:25,939 WARN L170 areAnnotationChecker]: L35-3 has no Hoare annotation [2020-07-08 22:23:25,939 WARN L170 areAnnotationChecker]: L35-6 has no Hoare annotation [2020-07-08 22:23:25,939 WARN L170 areAnnotationChecker]: L35-9 has no Hoare annotation [2020-07-08 22:23:25,939 WARN L170 areAnnotationChecker]: L35-7 has no Hoare annotation [2020-07-08 22:23:25,939 WARN L170 areAnnotationChecker]: L35-10 has no Hoare annotation [2020-07-08 22:23:25,939 WARN L170 areAnnotationChecker]: L36 has no Hoare annotation [2020-07-08 22:23:25,940 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2020-07-08 22:23:25,940 WARN L170 areAnnotationChecker]: L37-1 has no Hoare annotation [2020-07-08 22:23:25,940 WARN L170 areAnnotationChecker]: L37-2 has no Hoare annotation [2020-07-08 22:23:25,940 WARN L170 areAnnotationChecker]: L38-5 has no Hoare annotation [2020-07-08 22:23:25,940 WARN L170 areAnnotationChecker]: L38-5 has no Hoare annotation [2020-07-08 22:23:25,940 WARN L170 areAnnotationChecker]: L38-6 has no Hoare annotation [2020-07-08 22:23:25,940 WARN L170 areAnnotationChecker]: L38-6 has no Hoare annotation [2020-07-08 22:23:25,940 WARN L170 areAnnotationChecker]: L38-1 has no Hoare annotation [2020-07-08 22:23:25,940 WARN L170 areAnnotationChecker]: L38-1 has no Hoare annotation [2020-07-08 22:23:25,941 WARN L170 areAnnotationChecker]: L38-2 has no Hoare annotation [2020-07-08 22:23:25,941 WARN L170 areAnnotationChecker]: L38-4 has no Hoare annotation [2020-07-08 22:23:25,941 WARN L170 areAnnotationChecker]: L39 has no Hoare annotation [2020-07-08 22:23:25,941 WARN L170 areAnnotationChecker]: L39-1 has no Hoare annotation [2020-07-08 22:23:25,941 WARN L170 areAnnotationChecker]: L39-2 has no Hoare annotation [2020-07-08 22:23:25,941 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-08 22:23:25,947 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.07 10:23:25 BoogieIcfgContainer [2020-07-08 22:23:25,947 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-08 22:23:25,950 INFO L168 Benchmark]: Toolchain (without parser) took 12652.99 ms. Allocated memory was 138.4 MB in the beginning and 353.9 MB in the end (delta: 215.5 MB). Free memory was 102.7 MB in the beginning and 176.7 MB in the end (delta: -74.0 MB). Peak memory consumption was 141.5 MB. Max. memory is 7.1 GB. [2020-07-08 22:23:25,952 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 138.4 MB. Free memory was 120.6 MB in the beginning and 120.4 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2020-07-08 22:23:25,956 INFO L168 Benchmark]: CACSL2BoogieTranslator took 294.91 ms. Allocated memory is still 138.4 MB. Free memory was 102.5 MB in the beginning and 91.2 MB in the end (delta: 11.3 MB). Peak memory consumption was 11.3 MB. Max. memory is 7.1 GB. [2020-07-08 22:23:25,958 INFO L168 Benchmark]: Boogie Preprocessor took 128.41 ms. Allocated memory was 138.4 MB in the beginning and 202.9 MB in the end (delta: 64.5 MB). Free memory was 91.2 MB in the beginning and 179.8 MB in the end (delta: -88.6 MB). Peak memory consumption was 14.0 MB. Max. memory is 7.1 GB. [2020-07-08 22:23:25,959 INFO L168 Benchmark]: RCFGBuilder took 564.77 ms. Allocated memory is still 202.9 MB. Free memory was 179.8 MB in the beginning and 144.7 MB in the end (delta: 35.2 MB). Peak memory consumption was 35.2 MB. Max. memory is 7.1 GB. [2020-07-08 22:23:25,965 INFO L168 Benchmark]: TraceAbstraction took 11659.33 ms. Allocated memory was 202.9 MB in the beginning and 353.9 MB in the end (delta: 151.0 MB). Free memory was 144.0 MB in the beginning and 176.7 MB in the end (delta: -32.7 MB). Peak memory consumption was 118.3 MB. Max. memory is 7.1 GB. [2020-07-08 22:23:25,971 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.26 ms. Allocated memory is still 138.4 MB. Free memory was 120.6 MB in the beginning and 120.4 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 294.91 ms. Allocated memory is still 138.4 MB. Free memory was 102.5 MB in the beginning and 91.2 MB in the end (delta: 11.3 MB). Peak memory consumption was 11.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 128.41 ms. Allocated memory was 138.4 MB in the beginning and 202.9 MB in the end (delta: 64.5 MB). Free memory was 91.2 MB in the beginning and 179.8 MB in the end (delta: -88.6 MB). Peak memory consumption was 14.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 564.77 ms. Allocated memory is still 202.9 MB. Free memory was 179.8 MB in the beginning and 144.7 MB in the end (delta: 35.2 MB). Peak memory consumption was 35.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 11659.33 ms. Allocated memory was 202.9 MB in the beginning and 353.9 MB in the end (delta: 151.0 MB). Free memory was 144.0 MB in the beginning and 176.7 MB in the end (delta: -32.7 MB). Peak memory consumption was 118.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 48]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L9] struct dummy d1, d2; VAL [\old(d1)=18, \old(d1)=22, \old(d2)=19, \old(d2)=21, d1={3:0}, d2={2:0}] [L32] CALL init() VAL [d1={3:0}, d2={2:0}] [L13] d1.a = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=5, d1={3:0}, d2={2:0}] [L14] d1.b = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=-1, d1={3:0}, d2={2:0}] [L16] d2.a = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=16, d1={3:0}, d2={2:0}] [L17] d2.b = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=-2, d1={3:0}, d2={2:0}] [L32] RET init() VAL [d1={3:0}, d2={2:0}] [L33] CALL, EXPR get_dummy() VAL [d1={3:0}, d2={2:0}] [L22] EXPR __VERIFIER_nondet_bool() ? &d1 : &d2 VAL [__VERIFIER_nondet_bool()=1, __VERIFIER_nondet_bool() ? &d1 : &d2={3:0}, d1={3:0}, d2={2:0}] [L22] return (__VERIFIER_nondet_bool() ? &d1 : &d2); VAL [\result={3:0}, __VERIFIER_nondet_bool()=1, __VERIFIER_nondet_bool() ? &d1 : &d2={3:0}, d1={3:0}, d2={2:0}] [L33] RET, EXPR get_dummy() VAL [d1={3:0}, d2={2:0}, get_dummy()={3:0}] [L33] struct dummy *pd1 = get_dummy(), *pd2 = get_dummy(), *pd3 = get_dummy(); VAL [d1={3:0}, d2={2:0}, get_dummy()={3:0}, pd1={3:0}] [L33] CALL, EXPR get_dummy() VAL [d1={3:0}, d2={2:0}] [L22] EXPR __VERIFIER_nondet_bool() ? &d1 : &d2 VAL [__VERIFIER_nondet_bool()=1, __VERIFIER_nondet_bool() ? &d1 : &d2={3:0}, d1={3:0}, d2={2:0}] [L22] return (__VERIFIER_nondet_bool() ? &d1 : &d2); VAL [\result={3:0}, __VERIFIER_nondet_bool()=1, __VERIFIER_nondet_bool() ? &d1 : &d2={3:0}, d1={3:0}, d2={2:0}] [L33] RET, EXPR get_dummy() VAL [d1={3:0}, d2={2:0}, get_dummy()={3:0}, pd1={3:0}] [L33] struct dummy *pd1 = get_dummy(), *pd2 = get_dummy(), *pd3 = get_dummy(); VAL [d1={3:0}, d2={2:0}, get_dummy()={3:0}, pd1={3:0}, pd2={3:0}] [L33] CALL, EXPR get_dummy() VAL [d1={3:0}, d2={2:0}] [L22] EXPR __VERIFIER_nondet_bool() ? &d1 : &d2 VAL [__VERIFIER_nondet_bool()=0, __VERIFIER_nondet_bool() ? &d1 : &d2={2:0}, d1={3:0}, d2={2:0}] [L22] return (__VERIFIER_nondet_bool() ? &d1 : &d2); VAL [\result={2:0}, __VERIFIER_nondet_bool()=0, __VERIFIER_nondet_bool() ? &d1 : &d2={2:0}, d1={3:0}, d2={2:0}] [L33] RET, EXPR get_dummy() VAL [d1={3:0}, d2={2:0}, get_dummy()={2:0}, pd1={3:0}, pd2={3:0}] [L33] struct dummy *pd1 = get_dummy(), *pd2 = get_dummy(), *pd3 = get_dummy(); VAL [d1={3:0}, d2={2:0}, get_dummy()={2:0}, pd1={3:0}, pd2={3:0}, pd3={2:0}] [L34] int i = __VERIFIER_nondet_int(); VAL [__VERIFIER_nondet_int()=0, d1={3:0}, d2={2:0}, i=0, pd1={3:0}, pd2={3:0}, pd3={2:0}] [L35] pd1 != 0 && pd1 == pd2 && (*pd2).a > 0 VAL [d1={3:0}, d2={2:0}, i=0, pd1={3:0}, pd1 != 0 && pd1 == pd2 && (*pd2).a > 0=1, pd2={3:0}, pd3={2:0}] [L35] EXPR (*pd2).a VAL [(*pd2).a=5, d1={3:0}, d2={2:0}, i=0, pd1={3:0}, pd1 != 0 && pd1 == pd2 && (*pd2).a > 0=1, pd2={3:0}, pd3={2:0}] [L35] pd1 != 0 && pd1 == pd2 && (*pd2).a > 0 VAL [(*pd2).a=5, d1={3:0}, d2={2:0}, i=0, pd1={3:0}, pd1 != 0 && pd1 == pd2 && (*pd2).a > 0=1, pd2={3:0}, pd3={2:0}] [L35] COND TRUE pd1 != 0 && pd1 == pd2 && (*pd2).a > 0 VAL [(*pd2).a=5, d1={3:0}, d2={2:0}, i=0, pd1={3:0}, pd1 != 0 && pd1 == pd2 && (*pd2).a > 0=1, pd2={3:0}, pd3={2:0}] [L36] int *pa = &pd1->a; VAL [d1={3:0}, d2={2:0}, i=0, pa={3:0}, pd1={3:0}, pd2={3:0}, pd3={2:0}] [L37] EXPR pd3->a VAL [d1={3:0}, d2={2:0}, i=0, pa={3:0}, pd1={3:0}, pd2={3:0}, pd3={2:0}, pd3->a=16] [L37] i = pd3->a - 10 VAL [d1={3:0}, d2={2:0}, i=6, pa={3:0}, pd1={3:0}, pd2={3:0}, pd3={2:0}, pd3->a=16] [L38] EXPR \read(*pa) VAL [\read(*pa)=5, d1={3:0}, d2={2:0}, i=6, pa={3:0}, pd1={3:0}, pd2={3:0}, pd3={2:0}] [L38] COND FALSE !(i < *pa) VAL [\read(*pa)=5, d1={3:0}, d2={2:0}, i=6, pa={3:0}, pd1={3:0}, pd2={3:0}, pd3={2:0}] [L41] CALL, EXPR check(pd2, i) VAL [\old(i)=6, d1={3:0}, d2={2:0}, s1={3:0}] [L27] EXPR s1->a VAL [\old(i)=6, d1={3:0}, d2={2:0}, i=6, s1={3:0}, s1={3:0}, s1->a=5] [L27] return s1->a == i; VAL [\old(i)=6, \result=0, d1={3:0}, d2={2:0}, i=6, s1={3:0}, s1={3:0}, s1->a=5] [L41] RET, EXPR check(pd2, i) VAL [check(pd2, i)=0, d1={3:0}, d2={2:0}, i=6, pa={3:0}, pd1={3:0}, pd2={3:0}, pd3={2:0}] [L41] COND TRUE !check(pd2, i) VAL [check(pd2, i)=0, d1={3:0}, d2={2:0}, i=6, pa={3:0}, pd1={3:0}, pd2={3:0}, pd3={2:0}] [L48] __VERIFIER_error() VAL [d1={3:0}, d2={2:0}, i=6, pa={3:0}, pd1={3:0}, pd2={3:0}, pd3={2:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 88 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 11.4s, OverallIterations: 4, TraceHistogramMax: 3, AutomataDifference: 7.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 209 SDtfs, 396 SDslu, 76 SDs, 0 SdLazy, 1267 SolverSat, 62 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 76 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=108occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 45 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 342 NumberOfCodeBlocks, 342 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 252 ConstructedInterpolants, 0 QuantifiedInterpolants, 45528 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 2 PerfectInterpolantSequences, 58/63 InterpolantCoveringCapability, 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 incorrect! Received shutdown request...