java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline_WitnessPrinter.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/list-properties/simple_false-unreach-call_false-valid-memcleanup.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 11:04:35,504 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 11:04:35,506 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 11:04:35,518 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 11:04:35,518 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 11:04:35,519 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 11:04:35,520 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 11:04:35,522 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 11:04:35,523 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 11:04:35,524 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 11:04:35,525 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 11:04:35,525 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 11:04:35,526 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 11:04:35,527 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 11:04:35,528 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 11:04:35,529 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 11:04:35,530 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 11:04:35,532 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 11:04:35,534 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 11:04:35,535 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 11:04:35,536 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 11:04:35,538 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 11:04:35,540 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 11:04:35,541 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 11:04:35,541 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 11:04:35,542 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 11:04:35,543 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 11:04:35,544 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 11:04:35,545 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 11:04:35,546 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 11:04:35,546 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 11:04:35,547 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 11:04:35,547 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 11:04:35,547 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 11:04:35,548 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 11:04:35,549 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 11:04:35,549 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-11-23 11:04:35,568 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 11:04:35,568 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 11:04:35,569 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 11:04:35,569 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 11:04:35,569 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 11:04:35,570 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 11:04:35,570 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 11:04:35,570 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 11:04:35,570 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 11:04:35,570 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 11:04:35,571 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 11:04:35,571 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 11:04:35,571 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 11:04:35,571 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 11:04:35,571 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 11:04:35,572 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 11:04:35,572 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 11:04:35,572 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 11:04:35,572 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 11:04:35,572 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 11:04:35,573 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 11:04:35,573 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 11:04:35,573 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 11:04:35,573 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 11:04:35,573 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 11:04:35,574 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 11:04:35,574 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 11:04:35,574 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 11:04:35,574 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-23 11:04:35,574 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 11:04:35,575 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 11:04:35,575 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 11:04:35,575 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 11:04:35,619 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 11:04:35,631 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 11:04:35,635 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 11:04:35,637 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 11:04:35,637 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 11:04:35,638 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-properties/simple_false-unreach-call_false-valid-memcleanup.i [2018-11-23 11:04:35,702 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8851cbc5a/fd46a631290b43ec9d5c0a3e9c2c671e/FLAGc4b43abbb [2018-11-23 11:04:36,180 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 11:04:36,181 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-properties/simple_false-unreach-call_false-valid-memcleanup.i [2018-11-23 11:04:36,194 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8851cbc5a/fd46a631290b43ec9d5c0a3e9c2c671e/FLAGc4b43abbb [2018-11-23 11:04:36,469 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8851cbc5a/fd46a631290b43ec9d5c0a3e9c2c671e [2018-11-23 11:04:36,479 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 11:04:36,480 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 11:04:36,482 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 11:04:36,482 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 11:04:36,486 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 11:04:36,491 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:04:36" (1/1) ... [2018-11-23 11:04:36,494 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f2023cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:04:36, skipping insertion in model container [2018-11-23 11:04:36,494 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:04:36" (1/1) ... [2018-11-23 11:04:36,505 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 11:04:36,569 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 11:04:36,930 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:04:36,947 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 11:04:37,001 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:04:37,064 INFO L195 MainTranslator]: Completed translation [2018-11-23 11:04:37,065 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:04:37 WrapperNode [2018-11-23 11:04:37,065 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 11:04:37,066 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 11:04:37,066 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 11:04:37,066 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 11:04:37,076 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:04:37" (1/1) ... [2018-11-23 11:04:37,101 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:04:37" (1/1) ... [2018-11-23 11:04:37,185 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 11:04:37,185 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 11:04:37,186 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 11:04:37,186 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 11:04:37,196 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:04:37" (1/1) ... [2018-11-23 11:04:37,197 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:04:37" (1/1) ... [2018-11-23 11:04:37,200 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:04:37" (1/1) ... [2018-11-23 11:04:37,201 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:04:37" (1/1) ... [2018-11-23 11:04:37,222 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:04:37" (1/1) ... [2018-11-23 11:04:37,230 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:04:37" (1/1) ... [2018-11-23 11:04:37,232 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:04:37" (1/1) ... [2018-11-23 11:04:37,239 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 11:04:37,240 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 11:04:37,240 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 11:04:37,240 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 11:04:37,244 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:04:37" (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 [2018-11-23 11:04:37,300 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 11:04:37,300 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-23 11:04:37,300 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-23 11:04:37,300 INFO L138 BoogieDeclarations]: Found implementation of procedure exit [2018-11-23 11:04:37,300 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 11:04:37,300 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 11:04:37,300 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 11:04:37,301 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 11:04:37,301 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-23 11:04:37,301 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-23 11:04:37,301 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-23 11:04:37,301 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 11:04:37,301 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 11:04:37,952 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 11:04:37,953 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-11-23 11:04:37,953 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:04:37 BoogieIcfgContainer [2018-11-23 11:04:37,953 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 11:04:37,954 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 11:04:37,955 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 11:04:37,959 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 11:04:37,959 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 11:04:36" (1/3) ... [2018-11-23 11:04:37,960 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66911986 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:04:37, skipping insertion in model container [2018-11-23 11:04:37,960 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:04:37" (2/3) ... [2018-11-23 11:04:37,961 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66911986 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:04:37, skipping insertion in model container [2018-11-23 11:04:37,961 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:04:37" (3/3) ... [2018-11-23 11:04:37,963 INFO L112 eAbstractionObserver]: Analyzing ICFG simple_false-unreach-call_false-valid-memcleanup.i [2018-11-23 11:04:37,974 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 11:04:37,984 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 11:04:38,000 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 11:04:38,028 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 11:04:38,028 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 11:04:38,028 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 11:04:38,028 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 11:04:38,029 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 11:04:38,029 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 11:04:38,029 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 11:04:38,029 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 11:04:38,029 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 11:04:38,046 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states. [2018-11-23 11:04:38,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-23 11:04:38,052 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:04:38,053 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:04:38,056 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:04:38,061 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:04:38,062 INFO L82 PathProgramCache]: Analyzing trace with hash -457132283, now seen corresponding path program 1 times [2018-11-23 11:04:38,067 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:04:38,068 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:04:38,086 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:04:38,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:04:38,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:04:38,174 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:04:38,252 INFO L256 TraceCheckUtils]: 0: Hoare triple {29#true} call ULTIMATE.init(); {29#true} is VALID [2018-11-23 11:04:38,256 INFO L273 TraceCheckUtils]: 1: Hoare triple {29#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {29#true} is VALID [2018-11-23 11:04:38,256 INFO L273 TraceCheckUtils]: 2: Hoare triple {29#true} assume true; {29#true} is VALID [2018-11-23 11:04:38,257 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {29#true} {29#true} #65#return; {29#true} is VALID [2018-11-23 11:04:38,257 INFO L256 TraceCheckUtils]: 4: Hoare triple {29#true} call #t~ret6 := main(); {29#true} is VALID [2018-11-23 11:04:38,257 INFO L273 TraceCheckUtils]: 5: Hoare triple {29#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8bv32);~a~0.base, ~a~0.offset := #t~malloc0.base, #t~malloc0.offset; {29#true} is VALID [2018-11-23 11:04:38,258 INFO L273 TraceCheckUtils]: 6: Hoare triple {29#true} assume !(~a~0.base == 0bv32 && ~a~0.offset == 0bv32); {29#true} is VALID [2018-11-23 11:04:38,258 INFO L273 TraceCheckUtils]: 7: Hoare triple {29#true} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset;call write~intINTTYPE4(2bv32, ~a~0.base, ~a~0.offset, 4bv32); {29#true} is VALID [2018-11-23 11:04:38,259 INFO L273 TraceCheckUtils]: 8: Hoare triple {29#true} assume !true; {30#false} is VALID [2018-11-23 11:04:38,259 INFO L273 TraceCheckUtils]: 9: Hoare triple {30#false} call write~intINTTYPE4(2bv32, ~p~0.base, ~p~0.offset, 4bv32);call write~$Pointer$(0bv32, 0bv32, ~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {30#false} is VALID [2018-11-23 11:04:38,259 INFO L273 TraceCheckUtils]: 10: Hoare triple {30#false} assume !!(~p~0.base != 0bv32 || ~p~0.offset != 0bv32);call #t~mem4 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {30#false} is VALID [2018-11-23 11:04:38,260 INFO L273 TraceCheckUtils]: 11: Hoare triple {30#false} assume 2bv32 != #t~mem4;havoc #t~mem4; {30#false} is VALID [2018-11-23 11:04:38,260 INFO L273 TraceCheckUtils]: 12: Hoare triple {30#false} assume !false; {30#false} is VALID [2018-11-23 11:04:38,264 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:04:38,264 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:04:38,270 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:04:38,270 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 11:04:38,280 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 13 [2018-11-23 11:04:38,283 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:04:38,288 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 11:04:38,395 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:04:38,396 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 11:04:38,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 11:04:38,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 11:04:38,408 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 2 states. [2018-11-23 11:04:38,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:04:38,679 INFO L93 Difference]: Finished difference Result 37 states and 45 transitions. [2018-11-23 11:04:38,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 11:04:38,679 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 13 [2018-11-23 11:04:38,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:04:38,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 11:04:38,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 45 transitions. [2018-11-23 11:04:38,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 11:04:38,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 45 transitions. [2018-11-23 11:04:38,714 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 45 transitions. [2018-11-23 11:04:38,925 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:04:38,942 INFO L225 Difference]: With dead ends: 37 [2018-11-23 11:04:38,942 INFO L226 Difference]: Without dead ends: 17 [2018-11-23 11:04:38,947 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 11:04:38,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-11-23 11:04:39,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-11-23 11:04:39,012 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:04:39,012 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand 17 states. [2018-11-23 11:04:39,013 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand 17 states. [2018-11-23 11:04:39,013 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 17 states. [2018-11-23 11:04:39,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:04:39,017 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2018-11-23 11:04:39,017 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2018-11-23 11:04:39,017 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:04:39,017 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:04:39,018 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand 17 states. [2018-11-23 11:04:39,018 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 17 states. [2018-11-23 11:04:39,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:04:39,021 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2018-11-23 11:04:39,021 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2018-11-23 11:04:39,022 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:04:39,022 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:04:39,022 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:04:39,022 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:04:39,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 11:04:39,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2018-11-23 11:04:39,028 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 13 [2018-11-23 11:04:39,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:04:39,028 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2018-11-23 11:04:39,029 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 11:04:39,029 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2018-11-23 11:04:39,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-23 11:04:39,030 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:04:39,030 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:04:39,030 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:04:39,030 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:04:39,030 INFO L82 PathProgramCache]: Analyzing trace with hash -468214535, now seen corresponding path program 1 times [2018-11-23 11:04:39,031 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:04:39,031 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:04:39,056 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:04:39,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:04:39,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:04:39,125 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:04:39,433 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2018-11-23 11:04:39,439 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-11-23 11:04:39,456 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2018-11-23 11:04:39,465 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 11:04:39,468 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:04:39,475 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:04:39,482 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:04:39,483 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:22, output treesize:11 [2018-11-23 11:04:39,749 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-11-23 11:04:39,818 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-11-23 11:04:39,846 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:04:39,868 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:04:39,871 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:04:39,871 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-11-23 11:04:39,875 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:04:39,875 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, main_~p~0.base]. (let ((.cse0 (select (select |#memory_int| main_~p~0.base) (_ bv0 32)))) (and (= (bvadd .cse0 (_ bv4294967294 32)) (_ bv0 32)) (= .cse0 |main_#t~mem4|))) [2018-11-23 11:04:39,876 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (= (_ bv0 32) (bvadd |main_#t~mem4| (_ bv4294967294 32))) [2018-11-23 11:04:39,932 INFO L256 TraceCheckUtils]: 0: Hoare triple {174#true} call ULTIMATE.init(); {174#true} is VALID [2018-11-23 11:04:39,933 INFO L273 TraceCheckUtils]: 1: Hoare triple {174#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {174#true} is VALID [2018-11-23 11:04:39,933 INFO L273 TraceCheckUtils]: 2: Hoare triple {174#true} assume true; {174#true} is VALID [2018-11-23 11:04:39,933 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {174#true} {174#true} #65#return; {174#true} is VALID [2018-11-23 11:04:39,934 INFO L256 TraceCheckUtils]: 4: Hoare triple {174#true} call #t~ret6 := main(); {174#true} is VALID [2018-11-23 11:04:39,934 INFO L273 TraceCheckUtils]: 5: Hoare triple {174#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8bv32);~a~0.base, ~a~0.offset := #t~malloc0.base, #t~malloc0.offset; {194#(= main_~a~0.offset (_ bv0 32))} is VALID [2018-11-23 11:04:39,939 INFO L273 TraceCheckUtils]: 6: Hoare triple {194#(= main_~a~0.offset (_ bv0 32))} assume !(~a~0.base == 0bv32 && ~a~0.offset == 0bv32); {194#(= main_~a~0.offset (_ bv0 32))} is VALID [2018-11-23 11:04:39,956 INFO L273 TraceCheckUtils]: 7: Hoare triple {194#(= main_~a~0.offset (_ bv0 32))} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset;call write~intINTTYPE4(2bv32, ~a~0.base, ~a~0.offset, 4bv32); {201#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset))} is VALID [2018-11-23 11:04:39,971 INFO L273 TraceCheckUtils]: 8: Hoare triple {201#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset))} assume !(0bv32 != #t~nondet1);havoc #t~nondet1; {201#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset))} is VALID [2018-11-23 11:04:39,987 INFO L273 TraceCheckUtils]: 9: Hoare triple {201#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset))} call write~intINTTYPE4(2bv32, ~p~0.base, ~p~0.offset, 4bv32);call write~$Pointer$(0bv32, 0bv32, ~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {208#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select (select |#memory_int| main_~p~0.base) (_ bv0 32)) (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-23 11:04:40,002 INFO L273 TraceCheckUtils]: 10: Hoare triple {208#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select (select |#memory_int| main_~p~0.base) (_ bv0 32)) (_ bv4294967294 32)) (_ bv0 32)))} assume !!(~p~0.base != 0bv32 || ~p~0.offset != 0bv32);call #t~mem4 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {212#(= (_ bv2 32) |main_#t~mem4|)} is VALID [2018-11-23 11:04:40,017 INFO L273 TraceCheckUtils]: 11: Hoare triple {212#(= (_ bv2 32) |main_#t~mem4|)} assume 2bv32 != #t~mem4;havoc #t~mem4; {175#false} is VALID [2018-11-23 11:04:40,017 INFO L273 TraceCheckUtils]: 12: Hoare triple {175#false} assume !false; {175#false} is VALID [2018-11-23 11:04:40,019 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:04:40,019 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:04:40,024 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:04:40,024 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-23 11:04:40,026 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2018-11-23 11:04:40,027 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:04:40,027 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 11:04:40,088 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:04:40,089 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 11:04:40,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 11:04:40,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-23 11:04:40,090 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand 6 states. [2018-11-23 11:04:40,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:04:40,879 INFO L93 Difference]: Finished difference Result 31 states and 33 transitions. [2018-11-23 11:04:40,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 11:04:40,880 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2018-11-23 11:04:40,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:04:40,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 11:04:40,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 33 transitions. [2018-11-23 11:04:40,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 11:04:40,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 33 transitions. [2018-11-23 11:04:40,886 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 33 transitions. [2018-11-23 11:04:40,982 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:04:40,984 INFO L225 Difference]: With dead ends: 31 [2018-11-23 11:04:40,984 INFO L226 Difference]: Without dead ends: 29 [2018-11-23 11:04:40,986 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-11-23 11:04:40,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-11-23 11:04:41,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 21. [2018-11-23 11:04:41,009 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:04:41,009 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand 21 states. [2018-11-23 11:04:41,010 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 21 states. [2018-11-23 11:04:41,010 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 21 states. [2018-11-23 11:04:41,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:04:41,013 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2018-11-23 11:04:41,013 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2018-11-23 11:04:41,014 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:04:41,014 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:04:41,014 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 29 states. [2018-11-23 11:04:41,014 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 29 states. [2018-11-23 11:04:41,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:04:41,017 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2018-11-23 11:04:41,018 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2018-11-23 11:04:41,018 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:04:41,018 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:04:41,019 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:04:41,019 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:04:41,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-23 11:04:41,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2018-11-23 11:04:41,021 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 13 [2018-11-23 11:04:41,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:04:41,022 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2018-11-23 11:04:41,022 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 11:04:41,022 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2018-11-23 11:04:41,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-23 11:04:41,023 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:04:41,023 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:04:41,023 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:04:41,024 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:04:41,024 INFO L82 PathProgramCache]: Analyzing trace with hash 1479379545, now seen corresponding path program 1 times [2018-11-23 11:04:41,024 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:04:41,025 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:04:41,051 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:04:41,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:04:41,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:04:41,105 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:04:41,208 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-23 11:04:41,236 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-23 11:04:41,255 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:04:41,260 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:04:41,277 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-23 11:04:41,283 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-23 11:04:41,294 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 11:04:41,297 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:04:41,309 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:04:41,309 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:26, output treesize:18 [2018-11-23 11:04:41,392 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-23 11:04:41,409 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-23 11:04:41,417 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:04:41,421 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:04:41,442 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-23 11:04:41,451 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-23 11:04:41,457 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 11:04:41,459 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:04:41,473 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:04:41,473 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:29, output treesize:7 [2018-11-23 11:04:41,478 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:04:41,478 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_$Pointer$.offset|, v_main_~p~0.base_13, |#memory_$Pointer$.base|]. (let ((.cse0 (select (select |#memory_$Pointer$.base| v_main_~p~0.base_13) (_ bv4 32))) (.cse1 (select (select |#memory_$Pointer$.offset| v_main_~p~0.base_13) (_ bv4 32)))) (and (= .cse0 (_ bv0 32)) (= main_~p~0.offset .cse1) (= .cse0 main_~p~0.base) (= (_ bv0 32) .cse1))) [2018-11-23 11:04:41,478 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= main_~p~0.offset (_ bv0 32)) (= (_ bv0 32) main_~p~0.base)) [2018-11-23 11:04:41,538 INFO L256 TraceCheckUtils]: 0: Hoare triple {349#true} call ULTIMATE.init(); {349#true} is VALID [2018-11-23 11:04:41,538 INFO L273 TraceCheckUtils]: 1: Hoare triple {349#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {349#true} is VALID [2018-11-23 11:04:41,539 INFO L273 TraceCheckUtils]: 2: Hoare triple {349#true} assume true; {349#true} is VALID [2018-11-23 11:04:41,539 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {349#true} {349#true} #65#return; {349#true} is VALID [2018-11-23 11:04:41,539 INFO L256 TraceCheckUtils]: 4: Hoare triple {349#true} call #t~ret6 := main(); {349#true} is VALID [2018-11-23 11:04:41,540 INFO L273 TraceCheckUtils]: 5: Hoare triple {349#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8bv32);~a~0.base, ~a~0.offset := #t~malloc0.base, #t~malloc0.offset; {369#(= main_~a~0.offset (_ bv0 32))} is VALID [2018-11-23 11:04:41,544 INFO L273 TraceCheckUtils]: 6: Hoare triple {369#(= main_~a~0.offset (_ bv0 32))} assume !(~a~0.base == 0bv32 && ~a~0.offset == 0bv32); {369#(= main_~a~0.offset (_ bv0 32))} is VALID [2018-11-23 11:04:41,548 INFO L273 TraceCheckUtils]: 7: Hoare triple {369#(= main_~a~0.offset (_ bv0 32))} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset;call write~intINTTYPE4(2bv32, ~a~0.base, ~a~0.offset, 4bv32); {376#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset))} is VALID [2018-11-23 11:04:41,550 INFO L273 TraceCheckUtils]: 8: Hoare triple {376#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset))} assume !(0bv32 != #t~nondet1);havoc #t~nondet1; {376#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset))} is VALID [2018-11-23 11:04:41,552 INFO L273 TraceCheckUtils]: 9: Hoare triple {376#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset))} call write~intINTTYPE4(2bv32, ~p~0.base, ~p~0.offset, 4bv32);call write~$Pointer$(0bv32, 0bv32, ~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {383#(and (= main_~p~0.offset (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (= (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32)) (_ bv0 32)))} is VALID [2018-11-23 11:04:41,555 INFO L273 TraceCheckUtils]: 10: Hoare triple {383#(and (= main_~p~0.offset (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (= (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32)) (_ bv0 32)))} assume !!(~p~0.base != 0bv32 || ~p~0.offset != 0bv32);call #t~mem4 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {383#(and (= main_~p~0.offset (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (= (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32)) (_ bv0 32)))} is VALID [2018-11-23 11:04:41,556 INFO L273 TraceCheckUtils]: 11: Hoare triple {383#(and (= main_~p~0.offset (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (= (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32)) (_ bv0 32)))} assume !(2bv32 != #t~mem4);havoc #t~mem4; {383#(and (= main_~p~0.offset (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (= (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32)) (_ bv0 32)))} is VALID [2018-11-23 11:04:41,558 INFO L273 TraceCheckUtils]: 12: Hoare triple {383#(and (= main_~p~0.offset (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (= (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32)) (_ bv0 32)))} call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~p~0.base, ~p~0.offset := #t~mem5.base, #t~mem5.offset;havoc #t~mem5.base, #t~mem5.offset; {393#(and (= main_~p~0.offset (_ bv0 32)) (= (_ bv0 32) main_~p~0.base))} is VALID [2018-11-23 11:04:41,560 INFO L273 TraceCheckUtils]: 13: Hoare triple {393#(and (= main_~p~0.offset (_ bv0 32)) (= (_ bv0 32) main_~p~0.base))} assume !!(~p~0.base != 0bv32 || ~p~0.offset != 0bv32);call #t~mem4 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {350#false} is VALID [2018-11-23 11:04:41,560 INFO L273 TraceCheckUtils]: 14: Hoare triple {350#false} assume 2bv32 != #t~mem4;havoc #t~mem4; {350#false} is VALID [2018-11-23 11:04:41,561 INFO L273 TraceCheckUtils]: 15: Hoare triple {350#false} assume !false; {350#false} is VALID [2018-11-23 11:04:41,563 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:04:41,563 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:04:41,892 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2018-11-23 11:04:41,899 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2018-11-23 11:04:41,909 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:04:41,911 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:04:41,917 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2018-11-23 11:04:41,925 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2018-11-23 11:04:41,926 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 11:04:41,929 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:04:41,956 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 11:04:41,957 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:39, output treesize:7 [2018-11-23 11:04:41,969 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:04:41,970 WARN L384 uantifierElimination]: Input elimination task: ∀ [|v_#memory_$Pointer$.offset_14|, |v_#memory_$Pointer$.base_14|]. (let ((.cse0 (bvadd main_~p~0.offset (_ bv4 32))) (.cse1 (bvadd main_~a~0.offset (_ bv4 32)))) (and (= (select (select (store |v_#memory_$Pointer$.offset_14| main_~p~0.base (store (select |v_#memory_$Pointer$.offset_14| main_~p~0.base) .cse0 (_ bv0 32))) main_~a~0.base) .cse1) (_ bv0 32)) (= (_ bv0 32) (select (select (store |v_#memory_$Pointer$.base_14| main_~p~0.base (store (select |v_#memory_$Pointer$.base_14| main_~p~0.base) .cse0 (_ bv0 32))) main_~a~0.base) .cse1)))) [2018-11-23 11:04:41,970 WARN L385 uantifierElimination]: ElimStorePlain result: ∀ []. (and (= main_~p~0.base main_~a~0.base) (= main_~p~0.offset main_~a~0.offset)) [2018-11-23 11:04:42,014 INFO L273 TraceCheckUtils]: 15: Hoare triple {350#false} assume !false; {350#false} is VALID [2018-11-23 11:04:42,015 INFO L273 TraceCheckUtils]: 14: Hoare triple {350#false} assume 2bv32 != #t~mem4;havoc #t~mem4; {350#false} is VALID [2018-11-23 11:04:42,016 INFO L273 TraceCheckUtils]: 13: Hoare triple {393#(and (= main_~p~0.offset (_ bv0 32)) (= (_ bv0 32) main_~p~0.base))} assume !!(~p~0.base != 0bv32 || ~p~0.offset != 0bv32);call #t~mem4 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {350#false} is VALID [2018-11-23 11:04:42,018 INFO L273 TraceCheckUtils]: 12: Hoare triple {412#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (= (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) (_ bv0 32)))} call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~p~0.base, ~p~0.offset := #t~mem5.base, #t~mem5.offset;havoc #t~mem5.base, #t~mem5.offset; {393#(and (= main_~p~0.offset (_ bv0 32)) (= (_ bv0 32) main_~p~0.base))} is VALID [2018-11-23 11:04:42,019 INFO L273 TraceCheckUtils]: 11: Hoare triple {412#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (= (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) (_ bv0 32)))} assume !(2bv32 != #t~mem4);havoc #t~mem4; {412#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (= (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) (_ bv0 32)))} is VALID [2018-11-23 11:04:42,020 INFO L273 TraceCheckUtils]: 10: Hoare triple {412#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (= (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) (_ bv0 32)))} assume !!(~p~0.base != 0bv32 || ~p~0.offset != 0bv32);call #t~mem4 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {412#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (= (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) (_ bv0 32)))} is VALID [2018-11-23 11:04:42,039 INFO L273 TraceCheckUtils]: 9: Hoare triple {422#(and (= main_~p~0.base main_~a~0.base) (= main_~p~0.offset main_~a~0.offset))} call write~intINTTYPE4(2bv32, ~p~0.base, ~p~0.offset, 4bv32);call write~$Pointer$(0bv32, 0bv32, ~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {412#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (= (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) (_ bv0 32)))} is VALID [2018-11-23 11:04:42,040 INFO L273 TraceCheckUtils]: 8: Hoare triple {422#(and (= main_~p~0.base main_~a~0.base) (= main_~p~0.offset main_~a~0.offset))} assume !(0bv32 != #t~nondet1);havoc #t~nondet1; {422#(and (= main_~p~0.base main_~a~0.base) (= main_~p~0.offset main_~a~0.offset))} is VALID [2018-11-23 11:04:42,041 INFO L273 TraceCheckUtils]: 7: Hoare triple {349#true} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset;call write~intINTTYPE4(2bv32, ~a~0.base, ~a~0.offset, 4bv32); {422#(and (= main_~p~0.base main_~a~0.base) (= main_~p~0.offset main_~a~0.offset))} is VALID [2018-11-23 11:04:42,041 INFO L273 TraceCheckUtils]: 6: Hoare triple {349#true} assume !(~a~0.base == 0bv32 && ~a~0.offset == 0bv32); {349#true} is VALID [2018-11-23 11:04:42,042 INFO L273 TraceCheckUtils]: 5: Hoare triple {349#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8bv32);~a~0.base, ~a~0.offset := #t~malloc0.base, #t~malloc0.offset; {349#true} is VALID [2018-11-23 11:04:42,042 INFO L256 TraceCheckUtils]: 4: Hoare triple {349#true} call #t~ret6 := main(); {349#true} is VALID [2018-11-23 11:04:42,042 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {349#true} {349#true} #65#return; {349#true} is VALID [2018-11-23 11:04:42,043 INFO L273 TraceCheckUtils]: 2: Hoare triple {349#true} assume true; {349#true} is VALID [2018-11-23 11:04:42,043 INFO L273 TraceCheckUtils]: 1: Hoare triple {349#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {349#true} is VALID [2018-11-23 11:04:42,043 INFO L256 TraceCheckUtils]: 0: Hoare triple {349#true} call ULTIMATE.init(); {349#true} is VALID [2018-11-23 11:04:42,045 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:04:42,048 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:04:42,048 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 8 [2018-11-23 11:04:42,048 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-11-23 11:04:42,049 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:04:42,049 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-23 11:04:42,110 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:04:42,111 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 11:04:42,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 11:04:42,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-11-23 11:04:42,111 INFO L87 Difference]: Start difference. First operand 21 states and 23 transitions. Second operand 8 states. [2018-11-23 11:04:42,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:04:42,643 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2018-11-23 11:04:42,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 11:04:42,643 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-11-23 11:04:42,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:04:42,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 11:04:42,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 37 transitions. [2018-11-23 11:04:42,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 11:04:42,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 37 transitions. [2018-11-23 11:04:42,649 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 37 transitions. [2018-11-23 11:04:42,710 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:04:42,712 INFO L225 Difference]: With dead ends: 35 [2018-11-23 11:04:42,712 INFO L226 Difference]: Without dead ends: 25 [2018-11-23 11:04:42,713 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-11-23 11:04:42,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-11-23 11:04:42,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 18. [2018-11-23 11:04:42,727 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:04:42,727 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand 18 states. [2018-11-23 11:04:42,727 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 18 states. [2018-11-23 11:04:42,728 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 18 states. [2018-11-23 11:04:42,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:04:42,730 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2018-11-23 11:04:42,731 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2018-11-23 11:04:42,731 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:04:42,732 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:04:42,732 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand 25 states. [2018-11-23 11:04:42,733 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 25 states. [2018-11-23 11:04:42,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:04:42,735 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2018-11-23 11:04:42,735 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2018-11-23 11:04:42,736 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:04:42,736 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:04:42,736 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:04:42,737 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:04:42,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 11:04:42,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2018-11-23 11:04:42,738 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 16 [2018-11-23 11:04:42,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:04:42,739 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2018-11-23 11:04:42,739 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 11:04:42,739 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2018-11-23 11:04:42,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-23 11:04:42,740 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:04:42,740 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:04:42,740 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:04:42,740 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:04:42,741 INFO L82 PathProgramCache]: Analyzing trace with hash -761396014, now seen corresponding path program 1 times [2018-11-23 11:04:42,741 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:04:42,741 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:04:42,761 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:04:42,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 11:04:42,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 11:04:42,905 INFO L469 BasicCegarLoop]: Counterexample might be feasible ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); VAL [|#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |old(#NULL.base)|=(_ bv0 32), |old(#NULL.offset)|=(_ bv0 32)] [?] #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; VAL [|#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |old(#NULL.base)|=(_ bv0 32), |old(#NULL.offset)|=(_ bv0 32)] [?] assume true; VAL [|#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |old(#NULL.base)|=(_ bv0 32), |old(#NULL.offset)|=(_ bv0 32)] [?] RET #65#return; VAL [|#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32)] [?] CALL call #t~ret6 := main(); VAL [|#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32)] [?] call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8bv32);~a~0.base, ~a~0.offset := #t~malloc0.base, #t~malloc0.offset; VAL [main_~a~0.base=(_ bv2181570690 32), main_~a~0.offset=(_ bv0 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_#t~malloc0.base|=(_ bv2181570690 32), |main_#t~malloc0.offset|=(_ bv0 32)] [?] assume !(~a~0.base == 0bv32 && ~a~0.offset == 0bv32); VAL [main_~a~0.base=(_ bv2181570690 32), main_~a~0.offset=(_ bv0 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_#t~malloc0.base|=(_ bv2181570690 32), |main_#t~malloc0.offset|=(_ bv0 32)] [?] havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset;call write~intINTTYPE4(2bv32, ~a~0.base, ~a~0.offset, 4bv32); VAL [main_~a~0.base=(_ bv2181570690 32), main_~a~0.offset=(_ bv0 32), main_~p~0.base=(_ bv2181570690 32), main_~p~0.offset=(_ bv0 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_#t~malloc0.base|=(_ bv2181570690 32), |main_#t~malloc0.offset|=(_ bv0 32)] [?] assume !!(0bv32 != #t~nondet1);havoc #t~nondet1;call write~intINTTYPE4(1bv32, ~p~0.base, ~p~0.offset, 4bv32);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8bv32);~t~0.base, ~t~0.offset := #t~malloc2.base, #t~malloc2.offset; VAL [main_~a~0.base=(_ bv2181570690 32), main_~a~0.offset=(_ bv0 32), main_~p~0.base=(_ bv2181570690 32), main_~p~0.offset=(_ bv0 32), main_~t~0.base=(_ bv1 32), main_~t~0.offset=(_ bv0 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_#t~malloc0.base|=(_ bv2181570690 32), |main_#t~malloc0.offset|=(_ bv0 32), |main_#t~malloc2.base|=(_ bv1 32), |main_#t~malloc2.offset|=(_ bv0 32)] [?] assume !(~t~0.base == 0bv32 && ~t~0.offset == 0bv32); VAL [main_~a~0.base=(_ bv2181570690 32), main_~a~0.offset=(_ bv0 32), main_~p~0.base=(_ bv2181570690 32), main_~p~0.offset=(_ bv0 32), main_~t~0.base=(_ bv1 32), main_~t~0.offset=(_ bv0 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_#t~malloc0.base|=(_ bv2181570690 32), |main_#t~malloc0.offset|=(_ bv0 32), |main_#t~malloc2.base|=(_ bv1 32), |main_#t~malloc2.offset|=(_ bv0 32)] [?] call write~$Pointer$(~t~0.base, ~t~0.offset, ~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~p~0.base, ~p~0.offset := #t~mem3.base, #t~mem3.offset;havoc #t~mem3.base, #t~mem3.offset; VAL [main_~a~0.base=(_ bv2181570690 32), main_~a~0.offset=(_ bv0 32), main_~p~0.base=(_ bv1 32), main_~p~0.offset=(_ bv0 32), main_~t~0.base=(_ bv1 32), main_~t~0.offset=(_ bv0 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_#t~malloc0.base|=(_ bv2181570690 32), |main_#t~malloc0.offset|=(_ bv0 32), |main_#t~malloc2.base|=(_ bv1 32), |main_#t~malloc2.offset|=(_ bv0 32)] [?] assume !(0bv32 != #t~nondet1);havoc #t~nondet1; VAL [main_~a~0.base=(_ bv2181570690 32), main_~a~0.offset=(_ bv0 32), main_~p~0.base=(_ bv1 32), main_~p~0.offset=(_ bv0 32), main_~t~0.base=(_ bv1 32), main_~t~0.offset=(_ bv0 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_#t~malloc0.base|=(_ bv2181570690 32), |main_#t~malloc0.offset|=(_ bv0 32), |main_#t~malloc2.base|=(_ bv1 32), |main_#t~malloc2.offset|=(_ bv0 32)] [?] call write~intINTTYPE4(2bv32, ~p~0.base, ~p~0.offset, 4bv32);call write~$Pointer$(0bv32, 0bv32, ~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; VAL [main_~a~0.base=(_ bv2181570690 32), main_~a~0.offset=(_ bv0 32), main_~p~0.base=(_ bv2181570690 32), main_~p~0.offset=(_ bv0 32), main_~t~0.base=(_ bv1 32), main_~t~0.offset=(_ bv0 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_#t~malloc0.base|=(_ bv2181570690 32), |main_#t~malloc0.offset|=(_ bv0 32), |main_#t~malloc2.base|=(_ bv1 32), |main_#t~malloc2.offset|=(_ bv0 32)] [?] assume !!(~p~0.base != 0bv32 || ~p~0.offset != 0bv32);call #t~mem4 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); VAL [main_~a~0.base=(_ bv2181570690 32), main_~a~0.offset=(_ bv0 32), main_~p~0.base=(_ bv2181570690 32), main_~p~0.offset=(_ bv0 32), main_~t~0.base=(_ bv1 32), main_~t~0.offset=(_ bv0 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_#t~malloc0.base|=(_ bv2181570690 32), |main_#t~malloc0.offset|=(_ bv0 32), |main_#t~malloc2.base|=(_ bv1 32), |main_#t~malloc2.offset|=(_ bv0 32), |main_#t~mem4|=(_ bv1 32)] [?] assume 2bv32 != #t~mem4;havoc #t~mem4; VAL [main_~a~0.base=(_ bv2181570690 32), main_~a~0.offset=(_ bv0 32), main_~p~0.base=(_ bv2181570690 32), main_~p~0.offset=(_ bv0 32), main_~t~0.base=(_ bv1 32), main_~t~0.offset=(_ bv0 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_#t~malloc0.base|=(_ bv2181570690 32), |main_#t~malloc0.offset|=(_ bv0 32), |main_#t~malloc2.base|=(_ bv1 32), |main_#t~malloc2.offset|=(_ bv0 32)] [?] assume !false; VAL [main_~a~0.base=(_ bv2181570690 32), main_~a~0.offset=(_ bv0 32), main_~p~0.base=(_ bv2181570690 32), main_~p~0.offset=(_ bv0 32), main_~t~0.base=(_ bv1 32), main_~t~0.offset=(_ bv0 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_#t~malloc0.base|=(_ bv2181570690 32), |main_#t~malloc0.offset|=(_ bv0 32), |main_#t~malloc2.base|=(_ bv1 32), |main_#t~malloc2.offset|=(_ bv0 32)] [?] CALL call ULTIMATE.init(); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, old(#NULL.base)=0bv32, old(#NULL.offset)=0bv32] [?] #NULL.base, #NULL.offset := 0bv32, 0bv32; [?] #valid := #valid[0bv32 := 0bv1]; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, old(#NULL.base)=0bv32, old(#NULL.offset)=0bv32] [?] ensures true; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, old(#NULL.base)=0bv32, old(#NULL.offset)=0bv32] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0bv32, #NULL.offset=0bv32] [?] CALL call #t~ret6 := main(); VAL [#NULL.base=0bv32, #NULL.offset=0bv32] [L627] call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8bv32); [L627] ~a~0.base, ~a~0.offset := #t~malloc0.base, #t~malloc0.offset; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc0.base=2181570690bv32, #t~malloc0.offset=0bv32, ~a~0.base=2181570690bv32, ~a~0.offset=0bv32] [L628] assume !(~a~0.base == 0bv32 && ~a~0.offset == 0bv32); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc0.base=2181570690bv32, #t~malloc0.offset=0bv32, ~a~0.base=2181570690bv32, ~a~0.offset=0bv32] [L629] havoc ~t~0.base, ~t~0.offset; [L630] ~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; [L631] call write~intINTTYPE4(2bv32, ~a~0.base, ~a~0.offset, 4bv32); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc0.base=2181570690bv32, #t~malloc0.offset=0bv32, ~a~0.base=2181570690bv32, ~a~0.offset=0bv32, ~p~0.base=2181570690bv32, ~p~0.offset=0bv32] [L632-L638] assume !!(0bv32 != #t~nondet1); [L632] havoc #t~nondet1; [L633] call write~intINTTYPE4(1bv32, ~p~0.base, ~p~0.offset, 4bv32); [L634] call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8bv32); [L634] ~t~0.base, ~t~0.offset := #t~malloc2.base, #t~malloc2.offset; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc0.base=2181570690bv32, #t~malloc0.offset=0bv32, #t~malloc2.base=1bv32, #t~malloc2.offset=0bv32, ~a~0.base=2181570690bv32, ~a~0.offset=0bv32, ~p~0.base=2181570690bv32, ~p~0.offset=0bv32, ~t~0.base=1bv32, ~t~0.offset=0bv32] [L635] assume !(~t~0.base == 0bv32 && ~t~0.offset == 0bv32); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc0.base=2181570690bv32, #t~malloc0.offset=0bv32, #t~malloc2.base=1bv32, #t~malloc2.offset=0bv32, ~a~0.base=2181570690bv32, ~a~0.offset=0bv32, ~p~0.base=2181570690bv32, ~p~0.offset=0bv32, ~t~0.base=1bv32, ~t~0.offset=0bv32] [L636] call write~$Pointer$(~t~0.base, ~t~0.offset, ~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32); [L637] call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32); [L637] ~p~0.base, ~p~0.offset := #t~mem3.base, #t~mem3.offset; [L637] havoc #t~mem3.base, #t~mem3.offset; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc0.base=2181570690bv32, #t~malloc0.offset=0bv32, #t~malloc2.base=1bv32, #t~malloc2.offset=0bv32, ~a~0.base=2181570690bv32, ~a~0.offset=0bv32, ~p~0.base=1bv32, ~p~0.offset=0bv32, ~t~0.base=1bv32, ~t~0.offset=0bv32] [L632-L638] assume !(0bv32 != #t~nondet1); [L632] havoc #t~nondet1; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc0.base=2181570690bv32, #t~malloc0.offset=0bv32, #t~malloc2.base=1bv32, #t~malloc2.offset=0bv32, ~a~0.base=2181570690bv32, ~a~0.offset=0bv32, ~p~0.base=1bv32, ~p~0.offset=0bv32, ~t~0.base=1bv32, ~t~0.offset=0bv32] [L639] call write~intINTTYPE4(2bv32, ~p~0.base, ~p~0.offset, 4bv32); [L640] call write~$Pointer$(0bv32, 0bv32, ~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32); [L641] ~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc0.base=2181570690bv32, #t~malloc0.offset=0bv32, #t~malloc2.base=1bv32, #t~malloc2.offset=0bv32, ~a~0.base=2181570690bv32, ~a~0.offset=0bv32, ~p~0.base=2181570690bv32, ~p~0.offset=0bv32, ~t~0.base=1bv32, ~t~0.offset=0bv32] [L642-L647] assume !!(~p~0.base != 0bv32 || ~p~0.offset != 0bv32); [L643] call #t~mem4 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc0.base=2181570690bv32, #t~malloc0.offset=0bv32, #t~malloc2.base=1bv32, #t~malloc2.offset=0bv32, #t~mem4=1bv32, ~a~0.base=2181570690bv32, ~a~0.offset=0bv32, ~p~0.base=2181570690bv32, ~p~0.offset=0bv32, ~t~0.base=1bv32, ~t~0.offset=0bv32] [L643-L645] assume 2bv32 != #t~mem4; [L643] havoc #t~mem4; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc0.base=2181570690bv32, #t~malloc0.offset=0bv32, #t~malloc2.base=1bv32, #t~malloc2.offset=0bv32, ~a~0.base=2181570690bv32, ~a~0.offset=0bv32, ~p~0.base=2181570690bv32, ~p~0.offset=0bv32, ~t~0.base=1bv32, ~t~0.offset=0bv32] [L644] assert false; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc0.base=2181570690bv32, #t~malloc0.offset=0bv32, #t~malloc2.base=1bv32, #t~malloc2.offset=0bv32, ~a~0.base=2181570690bv32, ~a~0.offset=0bv32, ~p~0.base=2181570690bv32, ~p~0.offset=0bv32, ~t~0.base=1bv32, ~t~0.offset=0bv32] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, old(#NULL.base)=0bv32, old(#NULL.offset)=0bv32] [?] #NULL.base, #NULL.offset := 0bv32, 0bv32; [?] #valid := #valid[0bv32 := 0bv1]; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, old(#NULL.base)=0bv32, old(#NULL.offset)=0bv32] [?] ensures true; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, old(#NULL.base)=0bv32, old(#NULL.offset)=0bv32] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0bv32, #NULL.offset=0bv32] [?] CALL call #t~ret6 := main(); VAL [#NULL.base=0bv32, #NULL.offset=0bv32] [L627] call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8bv32); [L627] ~a~0.base, ~a~0.offset := #t~malloc0.base, #t~malloc0.offset; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc0.base=2181570690bv32, #t~malloc0.offset=0bv32, ~a~0.base=2181570690bv32, ~a~0.offset=0bv32] [L628] assume !(~a~0.base == 0bv32 && ~a~0.offset == 0bv32); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc0.base=2181570690bv32, #t~malloc0.offset=0bv32, ~a~0.base=2181570690bv32, ~a~0.offset=0bv32] [L629] havoc ~t~0.base, ~t~0.offset; [L630] ~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; [L631] call write~intINTTYPE4(2bv32, ~a~0.base, ~a~0.offset, 4bv32); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc0.base=2181570690bv32, #t~malloc0.offset=0bv32, ~a~0.base=2181570690bv32, ~a~0.offset=0bv32, ~p~0.base=2181570690bv32, ~p~0.offset=0bv32] [L632-L638] assume !!(0bv32 != #t~nondet1); [L632] havoc #t~nondet1; [L633] call write~intINTTYPE4(1bv32, ~p~0.base, ~p~0.offset, 4bv32); [L634] call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8bv32); [L634] ~t~0.base, ~t~0.offset := #t~malloc2.base, #t~malloc2.offset; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc0.base=2181570690bv32, #t~malloc0.offset=0bv32, #t~malloc2.base=1bv32, #t~malloc2.offset=0bv32, ~a~0.base=2181570690bv32, ~a~0.offset=0bv32, ~p~0.base=2181570690bv32, ~p~0.offset=0bv32, ~t~0.base=1bv32, ~t~0.offset=0bv32] [L635] assume !(~t~0.base == 0bv32 && ~t~0.offset == 0bv32); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc0.base=2181570690bv32, #t~malloc0.offset=0bv32, #t~malloc2.base=1bv32, #t~malloc2.offset=0bv32, ~a~0.base=2181570690bv32, ~a~0.offset=0bv32, ~p~0.base=2181570690bv32, ~p~0.offset=0bv32, ~t~0.base=1bv32, ~t~0.offset=0bv32] [L636] call write~$Pointer$(~t~0.base, ~t~0.offset, ~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32); [L637] call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32); [L637] ~p~0.base, ~p~0.offset := #t~mem3.base, #t~mem3.offset; [L637] havoc #t~mem3.base, #t~mem3.offset; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc0.base=2181570690bv32, #t~malloc0.offset=0bv32, #t~malloc2.base=1bv32, #t~malloc2.offset=0bv32, ~a~0.base=2181570690bv32, ~a~0.offset=0bv32, ~p~0.base=1bv32, ~p~0.offset=0bv32, ~t~0.base=1bv32, ~t~0.offset=0bv32] [L632-L638] assume !(0bv32 != #t~nondet1); [L632] havoc #t~nondet1; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc0.base=2181570690bv32, #t~malloc0.offset=0bv32, #t~malloc2.base=1bv32, #t~malloc2.offset=0bv32, ~a~0.base=2181570690bv32, ~a~0.offset=0bv32, ~p~0.base=1bv32, ~p~0.offset=0bv32, ~t~0.base=1bv32, ~t~0.offset=0bv32] [L639] call write~intINTTYPE4(2bv32, ~p~0.base, ~p~0.offset, 4bv32); [L640] call write~$Pointer$(0bv32, 0bv32, ~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32); [L641] ~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc0.base=2181570690bv32, #t~malloc0.offset=0bv32, #t~malloc2.base=1bv32, #t~malloc2.offset=0bv32, ~a~0.base=2181570690bv32, ~a~0.offset=0bv32, ~p~0.base=2181570690bv32, ~p~0.offset=0bv32, ~t~0.base=1bv32, ~t~0.offset=0bv32] [L642-L647] assume !!(~p~0.base != 0bv32 || ~p~0.offset != 0bv32); [L643] call #t~mem4 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc0.base=2181570690bv32, #t~malloc0.offset=0bv32, #t~malloc2.base=1bv32, #t~malloc2.offset=0bv32, #t~mem4=1bv32, ~a~0.base=2181570690bv32, ~a~0.offset=0bv32, ~p~0.base=2181570690bv32, ~p~0.offset=0bv32, ~t~0.base=1bv32, ~t~0.offset=0bv32] [L643-L645] assume 2bv32 != #t~mem4; [L643] havoc #t~mem4; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc0.base=2181570690bv32, #t~malloc0.offset=0bv32, #t~malloc2.base=1bv32, #t~malloc2.offset=0bv32, ~a~0.base=2181570690bv32, ~a~0.offset=0bv32, ~p~0.base=2181570690bv32, ~p~0.offset=0bv32, ~t~0.base=1bv32, ~t~0.offset=0bv32] [L644] assert false; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc0.base=2181570690bv32, #t~malloc0.offset=0bv32, #t~malloc2.base=1bv32, #t~malloc2.offset=0bv32, ~a~0.base=2181570690bv32, ~a~0.offset=0bv32, ~p~0.base=2181570690bv32, ~p~0.offset=0bv32, ~t~0.base=1bv32, ~t~0.offset=0bv32] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, old(#NULL!base)=0bv32, old(#NULL!offset)=0bv32] [?] #NULL := { base: 0bv32, offset: 0bv32 }; [?] #valid[0bv32] := 0bv1; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, old(#NULL!base)=0bv32, old(#NULL!offset)=0bv32] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32] [?] CALL call #t~ret6 := main(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32] [L627] FCALL call #t~malloc0 := #Ultimate.alloc(8bv32); [L627] ~a~0 := #t~malloc0; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=2181570690bv32, #t~malloc0!offset=0bv32, ~a~0!base=2181570690bv32, ~a~0!offset=0bv32] [L628] COND FALSE !(~a~0 == { base: 0bv32, offset: 0bv32 }) VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=2181570690bv32, #t~malloc0!offset=0bv32, ~a~0!base=2181570690bv32, ~a~0!offset=0bv32] [L629] havoc ~t~0; [L630] ~p~0 := ~a~0; [L631] FCALL call write~intINTTYPE4(2bv32, { base: ~a~0!base, offset: ~a~0!offset }, 4bv32); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=2181570690bv32, #t~malloc0!offset=0bv32, ~a~0!base=2181570690bv32, ~a~0!offset=0bv32, ~p~0!base=2181570690bv32, ~p~0!offset=0bv32] [L632-L638] COND FALSE !(!(0bv32 != #t~nondet1)) [L632] havoc #t~nondet1; [L633] FCALL call write~intINTTYPE4(1bv32, { base: ~p~0!base, offset: ~p~0!offset }, 4bv32); [L634] FCALL call #t~malloc2 := #Ultimate.alloc(8bv32); [L634] ~t~0 := #t~malloc2; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=2181570690bv32, #t~malloc0!offset=0bv32, #t~malloc2!base=1bv32, #t~malloc2!offset=0bv32, ~a~0!base=2181570690bv32, ~a~0!offset=0bv32, ~p~0!base=2181570690bv32, ~p~0!offset=0bv32, ~t~0!base=1bv32, ~t~0!offset=0bv32] [L635] COND FALSE !(~t~0 == { base: 0bv32, offset: 0bv32 }) VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=2181570690bv32, #t~malloc0!offset=0bv32, #t~malloc2!base=1bv32, #t~malloc2!offset=0bv32, ~a~0!base=2181570690bv32, ~a~0!offset=0bv32, ~p~0!base=2181570690bv32, ~p~0!offset=0bv32, ~t~0!base=1bv32, ~t~0!offset=0bv32] [L636] FCALL call write~$Pointer$(~t~0, { base: ~p~0!base, offset: ~bvadd32(4bv32, ~p~0!offset) }, 4bv32); [L637] FCALL call #t~mem3 := read~$Pointer$({ base: ~p~0!base, offset: ~bvadd32(4bv32, ~p~0!offset) }, 4bv32); [L637] ~p~0 := #t~mem3; [L637] havoc #t~mem3; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=2181570690bv32, #t~malloc0!offset=0bv32, #t~malloc2!base=1bv32, #t~malloc2!offset=0bv32, ~a~0!base=2181570690bv32, ~a~0!offset=0bv32, ~p~0!base=1bv32, ~p~0!offset=0bv32, ~t~0!base=1bv32, ~t~0!offset=0bv32] [L632-L638] COND TRUE !(0bv32 != #t~nondet1) [L632] havoc #t~nondet1; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=2181570690bv32, #t~malloc0!offset=0bv32, #t~malloc2!base=1bv32, #t~malloc2!offset=0bv32, ~a~0!base=2181570690bv32, ~a~0!offset=0bv32, ~p~0!base=1bv32, ~p~0!offset=0bv32, ~t~0!base=1bv32, ~t~0!offset=0bv32] [L639] FCALL call write~intINTTYPE4(2bv32, { base: ~p~0!base, offset: ~p~0!offset }, 4bv32); [L640] FCALL call write~$Pointer$({ base: 0bv32, offset: 0bv32 }, { base: ~p~0!base, offset: ~bvadd32(4bv32, ~p~0!offset) }, 4bv32); [L641] ~p~0 := ~a~0; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=2181570690bv32, #t~malloc0!offset=0bv32, #t~malloc2!base=1bv32, #t~malloc2!offset=0bv32, ~a~0!base=2181570690bv32, ~a~0!offset=0bv32, ~p~0!base=2181570690bv32, ~p~0!offset=0bv32, ~t~0!base=1bv32, ~t~0!offset=0bv32] [L642-L647] COND FALSE !(!(~p~0 != { base: 0bv32, offset: 0bv32 })) [L643] FCALL call #t~mem4 := read~intINTTYPE4({ base: ~p~0!base, offset: ~p~0!offset }, 4bv32); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=2181570690bv32, #t~malloc0!offset=0bv32, #t~malloc2!base=1bv32, #t~malloc2!offset=0bv32, #t~mem4=1bv32, ~a~0!base=2181570690bv32, ~a~0!offset=0bv32, ~p~0!base=2181570690bv32, ~p~0!offset=0bv32, ~t~0!base=1bv32, ~t~0!offset=0bv32] [L643] COND TRUE 2bv32 != #t~mem4 [L643] havoc #t~mem4; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=2181570690bv32, #t~malloc0!offset=0bv32, #t~malloc2!base=1bv32, #t~malloc2!offset=0bv32, ~a~0!base=2181570690bv32, ~a~0!offset=0bv32, ~p~0!base=2181570690bv32, ~p~0!offset=0bv32, ~t~0!base=1bv32, ~t~0!offset=0bv32] [L644] assert false; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=2181570690bv32, #t~malloc0!offset=0bv32, #t~malloc2!base=1bv32, #t~malloc2!offset=0bv32, ~a~0!base=2181570690bv32, ~a~0!offset=0bv32, ~p~0!base=2181570690bv32, ~p~0!offset=0bv32, ~t~0!base=1bv32, ~t~0!offset=0bv32] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, old(#NULL!base)=0bv32, old(#NULL!offset)=0bv32] [?] #NULL := { base: 0bv32, offset: 0bv32 }; [?] #valid[0bv32] := 0bv1; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, old(#NULL!base)=0bv32, old(#NULL!offset)=0bv32] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32] [?] CALL call #t~ret6 := main(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32] [L627] FCALL call #t~malloc0 := #Ultimate.alloc(8bv32); [L627] ~a~0 := #t~malloc0; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=2181570690bv32, #t~malloc0!offset=0bv32, ~a~0!base=2181570690bv32, ~a~0!offset=0bv32] [L628] COND FALSE !(~a~0 == { base: 0bv32, offset: 0bv32 }) VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=2181570690bv32, #t~malloc0!offset=0bv32, ~a~0!base=2181570690bv32, ~a~0!offset=0bv32] [L629] havoc ~t~0; [L630] ~p~0 := ~a~0; [L631] FCALL call write~intINTTYPE4(2bv32, { base: ~a~0!base, offset: ~a~0!offset }, 4bv32); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=2181570690bv32, #t~malloc0!offset=0bv32, ~a~0!base=2181570690bv32, ~a~0!offset=0bv32, ~p~0!base=2181570690bv32, ~p~0!offset=0bv32] [L632-L638] COND FALSE !(!(0bv32 != #t~nondet1)) [L632] havoc #t~nondet1; [L633] FCALL call write~intINTTYPE4(1bv32, { base: ~p~0!base, offset: ~p~0!offset }, 4bv32); [L634] FCALL call #t~malloc2 := #Ultimate.alloc(8bv32); [L634] ~t~0 := #t~malloc2; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=2181570690bv32, #t~malloc0!offset=0bv32, #t~malloc2!base=1bv32, #t~malloc2!offset=0bv32, ~a~0!base=2181570690bv32, ~a~0!offset=0bv32, ~p~0!base=2181570690bv32, ~p~0!offset=0bv32, ~t~0!base=1bv32, ~t~0!offset=0bv32] [L635] COND FALSE !(~t~0 == { base: 0bv32, offset: 0bv32 }) VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=2181570690bv32, #t~malloc0!offset=0bv32, #t~malloc2!base=1bv32, #t~malloc2!offset=0bv32, ~a~0!base=2181570690bv32, ~a~0!offset=0bv32, ~p~0!base=2181570690bv32, ~p~0!offset=0bv32, ~t~0!base=1bv32, ~t~0!offset=0bv32] [L636] FCALL call write~$Pointer$(~t~0, { base: ~p~0!base, offset: ~bvadd32(4bv32, ~p~0!offset) }, 4bv32); [L637] FCALL call #t~mem3 := read~$Pointer$({ base: ~p~0!base, offset: ~bvadd32(4bv32, ~p~0!offset) }, 4bv32); [L637] ~p~0 := #t~mem3; [L637] havoc #t~mem3; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=2181570690bv32, #t~malloc0!offset=0bv32, #t~malloc2!base=1bv32, #t~malloc2!offset=0bv32, ~a~0!base=2181570690bv32, ~a~0!offset=0bv32, ~p~0!base=1bv32, ~p~0!offset=0bv32, ~t~0!base=1bv32, ~t~0!offset=0bv32] [L632-L638] COND TRUE !(0bv32 != #t~nondet1) [L632] havoc #t~nondet1; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=2181570690bv32, #t~malloc0!offset=0bv32, #t~malloc2!base=1bv32, #t~malloc2!offset=0bv32, ~a~0!base=2181570690bv32, ~a~0!offset=0bv32, ~p~0!base=1bv32, ~p~0!offset=0bv32, ~t~0!base=1bv32, ~t~0!offset=0bv32] [L639] FCALL call write~intINTTYPE4(2bv32, { base: ~p~0!base, offset: ~p~0!offset }, 4bv32); [L640] FCALL call write~$Pointer$({ base: 0bv32, offset: 0bv32 }, { base: ~p~0!base, offset: ~bvadd32(4bv32, ~p~0!offset) }, 4bv32); [L641] ~p~0 := ~a~0; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=2181570690bv32, #t~malloc0!offset=0bv32, #t~malloc2!base=1bv32, #t~malloc2!offset=0bv32, ~a~0!base=2181570690bv32, ~a~0!offset=0bv32, ~p~0!base=2181570690bv32, ~p~0!offset=0bv32, ~t~0!base=1bv32, ~t~0!offset=0bv32] [L642-L647] COND FALSE !(!(~p~0 != { base: 0bv32, offset: 0bv32 })) [L643] FCALL call #t~mem4 := read~intINTTYPE4({ base: ~p~0!base, offset: ~p~0!offset }, 4bv32); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=2181570690bv32, #t~malloc0!offset=0bv32, #t~malloc2!base=1bv32, #t~malloc2!offset=0bv32, #t~mem4=1bv32, ~a~0!base=2181570690bv32, ~a~0!offset=0bv32, ~p~0!base=2181570690bv32, ~p~0!offset=0bv32, ~t~0!base=1bv32, ~t~0!offset=0bv32] [L643] COND TRUE 2bv32 != #t~mem4 [L643] havoc #t~mem4; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=2181570690bv32, #t~malloc0!offset=0bv32, #t~malloc2!base=1bv32, #t~malloc2!offset=0bv32, ~a~0!base=2181570690bv32, ~a~0!offset=0bv32, ~p~0!base=2181570690bv32, ~p~0!offset=0bv32, ~t~0!base=1bv32, ~t~0!offset=0bv32] [L644] assert false; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=2181570690bv32, #t~malloc0!offset=0bv32, #t~malloc2!base=1bv32, #t~malloc2!offset=0bv32, ~a~0!base=2181570690bv32, ~a~0!offset=0bv32, ~p~0!base=2181570690bv32, ~p~0!offset=0bv32, ~t~0!base=1bv32, ~t~0!offset=0bv32] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, old(#NULL!base)=0bv32, old(#NULL!offset)=0bv32] [?] #NULL := { base: 0bv32, offset: 0bv32 }; [?] #valid[0bv32] := 0bv1; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, old(#NULL!base)=0bv32, old(#NULL!offset)=0bv32] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32] [?] CALL call #t~ret6 := main(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32] [L627] FCALL call #t~malloc0 := #Ultimate.alloc(8bv32); [L627] ~a~0 := #t~malloc0; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=2181570690bv32, #t~malloc0!offset=0bv32, ~a~0!base=2181570690bv32, ~a~0!offset=0bv32] [L628] COND FALSE !(~a~0 == { base: 0bv32, offset: 0bv32 }) VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=2181570690bv32, #t~malloc0!offset=0bv32, ~a~0!base=2181570690bv32, ~a~0!offset=0bv32] [L629] havoc ~t~0; [L630] ~p~0 := ~a~0; [L631] FCALL call write~intINTTYPE4(2bv32, { base: ~a~0!base, offset: ~a~0!offset }, 4bv32); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=2181570690bv32, #t~malloc0!offset=0bv32, ~a~0!base=2181570690bv32, ~a~0!offset=0bv32, ~p~0!base=2181570690bv32, ~p~0!offset=0bv32] [L632-L638] COND FALSE !(!(0bv32 != #t~nondet1)) [L632] havoc #t~nondet1; [L633] FCALL call write~intINTTYPE4(1bv32, { base: ~p~0!base, offset: ~p~0!offset }, 4bv32); [L634] FCALL call #t~malloc2 := #Ultimate.alloc(8bv32); [L634] ~t~0 := #t~malloc2; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=2181570690bv32, #t~malloc0!offset=0bv32, #t~malloc2!base=1bv32, #t~malloc2!offset=0bv32, ~a~0!base=2181570690bv32, ~a~0!offset=0bv32, ~p~0!base=2181570690bv32, ~p~0!offset=0bv32, ~t~0!base=1bv32, ~t~0!offset=0bv32] [L635] COND FALSE !(~t~0 == { base: 0bv32, offset: 0bv32 }) VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=2181570690bv32, #t~malloc0!offset=0bv32, #t~malloc2!base=1bv32, #t~malloc2!offset=0bv32, ~a~0!base=2181570690bv32, ~a~0!offset=0bv32, ~p~0!base=2181570690bv32, ~p~0!offset=0bv32, ~t~0!base=1bv32, ~t~0!offset=0bv32] [L636] FCALL call write~$Pointer$(~t~0, { base: ~p~0!base, offset: ~bvadd32(4bv32, ~p~0!offset) }, 4bv32); [L637] FCALL call #t~mem3 := read~$Pointer$({ base: ~p~0!base, offset: ~bvadd32(4bv32, ~p~0!offset) }, 4bv32); [L637] ~p~0 := #t~mem3; [L637] havoc #t~mem3; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=2181570690bv32, #t~malloc0!offset=0bv32, #t~malloc2!base=1bv32, #t~malloc2!offset=0bv32, ~a~0!base=2181570690bv32, ~a~0!offset=0bv32, ~p~0!base=1bv32, ~p~0!offset=0bv32, ~t~0!base=1bv32, ~t~0!offset=0bv32] [L632-L638] COND TRUE !(0bv32 != #t~nondet1) [L632] havoc #t~nondet1; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=2181570690bv32, #t~malloc0!offset=0bv32, #t~malloc2!base=1bv32, #t~malloc2!offset=0bv32, ~a~0!base=2181570690bv32, ~a~0!offset=0bv32, ~p~0!base=1bv32, ~p~0!offset=0bv32, ~t~0!base=1bv32, ~t~0!offset=0bv32] [L639] FCALL call write~intINTTYPE4(2bv32, { base: ~p~0!base, offset: ~p~0!offset }, 4bv32); [L640] FCALL call write~$Pointer$({ base: 0bv32, offset: 0bv32 }, { base: ~p~0!base, offset: ~bvadd32(4bv32, ~p~0!offset) }, 4bv32); [L641] ~p~0 := ~a~0; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=2181570690bv32, #t~malloc0!offset=0bv32, #t~malloc2!base=1bv32, #t~malloc2!offset=0bv32, ~a~0!base=2181570690bv32, ~a~0!offset=0bv32, ~p~0!base=2181570690bv32, ~p~0!offset=0bv32, ~t~0!base=1bv32, ~t~0!offset=0bv32] [L642-L647] COND FALSE !(!(~p~0 != { base: 0bv32, offset: 0bv32 })) [L643] FCALL call #t~mem4 := read~intINTTYPE4({ base: ~p~0!base, offset: ~p~0!offset }, 4bv32); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=2181570690bv32, #t~malloc0!offset=0bv32, #t~malloc2!base=1bv32, #t~malloc2!offset=0bv32, #t~mem4=1bv32, ~a~0!base=2181570690bv32, ~a~0!offset=0bv32, ~p~0!base=2181570690bv32, ~p~0!offset=0bv32, ~t~0!base=1bv32, ~t~0!offset=0bv32] [L643] COND TRUE 2bv32 != #t~mem4 [L643] havoc #t~mem4; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=2181570690bv32, #t~malloc0!offset=0bv32, #t~malloc2!base=1bv32, #t~malloc2!offset=0bv32, ~a~0!base=2181570690bv32, ~a~0!offset=0bv32, ~p~0!base=2181570690bv32, ~p~0!offset=0bv32, ~t~0!base=1bv32, ~t~0!offset=0bv32] [L644] assert false; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=2181570690bv32, #t~malloc0!offset=0bv32, #t~malloc2!base=1bv32, #t~malloc2!offset=0bv32, ~a~0!base=2181570690bv32, ~a~0!offset=0bv32, ~p~0!base=2181570690bv32, ~p~0!offset=0bv32, ~t~0!base=1bv32, ~t~0!offset=0bv32] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, old(#NULL!base)=0bv32, old(#NULL!offset)=0bv32] [?] #NULL := { base: 0bv32, offset: 0bv32 }; [?] #valid[0bv32] := 0bv1; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, old(#NULL!base)=0bv32, old(#NULL!offset)=0bv32] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32] [?] CALL call #t~ret6 := main(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32] [L627] FCALL call #t~malloc0 := #Ultimate.alloc(8bv32); [L627] ~a~0 := #t~malloc0; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=2181570690bv32, #t~malloc0!offset=0bv32, ~a~0!base=2181570690bv32, ~a~0!offset=0bv32] [L628] COND FALSE !(~a~0 == { base: 0bv32, offset: 0bv32 }) VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=2181570690bv32, #t~malloc0!offset=0bv32, ~a~0!base=2181570690bv32, ~a~0!offset=0bv32] [L629] havoc ~t~0; [L630] ~p~0 := ~a~0; [L631] FCALL call write~intINTTYPE4(2bv32, { base: ~a~0!base, offset: ~a~0!offset }, 4bv32); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=2181570690bv32, #t~malloc0!offset=0bv32, ~a~0!base=2181570690bv32, ~a~0!offset=0bv32, ~p~0!base=2181570690bv32, ~p~0!offset=0bv32] [L632-L638] COND FALSE !(!(0bv32 != #t~nondet1)) [L632] havoc #t~nondet1; [L633] FCALL call write~intINTTYPE4(1bv32, { base: ~p~0!base, offset: ~p~0!offset }, 4bv32); [L634] FCALL call #t~malloc2 := #Ultimate.alloc(8bv32); [L634] ~t~0 := #t~malloc2; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=2181570690bv32, #t~malloc0!offset=0bv32, #t~malloc2!base=1bv32, #t~malloc2!offset=0bv32, ~a~0!base=2181570690bv32, ~a~0!offset=0bv32, ~p~0!base=2181570690bv32, ~p~0!offset=0bv32, ~t~0!base=1bv32, ~t~0!offset=0bv32] [L635] COND FALSE !(~t~0 == { base: 0bv32, offset: 0bv32 }) VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=2181570690bv32, #t~malloc0!offset=0bv32, #t~malloc2!base=1bv32, #t~malloc2!offset=0bv32, ~a~0!base=2181570690bv32, ~a~0!offset=0bv32, ~p~0!base=2181570690bv32, ~p~0!offset=0bv32, ~t~0!base=1bv32, ~t~0!offset=0bv32] [L636] FCALL call write~$Pointer$(~t~0, { base: ~p~0!base, offset: ~bvadd32(4bv32, ~p~0!offset) }, 4bv32); [L637] FCALL call #t~mem3 := read~$Pointer$({ base: ~p~0!base, offset: ~bvadd32(4bv32, ~p~0!offset) }, 4bv32); [L637] ~p~0 := #t~mem3; [L637] havoc #t~mem3; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=2181570690bv32, #t~malloc0!offset=0bv32, #t~malloc2!base=1bv32, #t~malloc2!offset=0bv32, ~a~0!base=2181570690bv32, ~a~0!offset=0bv32, ~p~0!base=1bv32, ~p~0!offset=0bv32, ~t~0!base=1bv32, ~t~0!offset=0bv32] [L632-L638] COND TRUE !(0bv32 != #t~nondet1) [L632] havoc #t~nondet1; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=2181570690bv32, #t~malloc0!offset=0bv32, #t~malloc2!base=1bv32, #t~malloc2!offset=0bv32, ~a~0!base=2181570690bv32, ~a~0!offset=0bv32, ~p~0!base=1bv32, ~p~0!offset=0bv32, ~t~0!base=1bv32, ~t~0!offset=0bv32] [L639] FCALL call write~intINTTYPE4(2bv32, { base: ~p~0!base, offset: ~p~0!offset }, 4bv32); [L640] FCALL call write~$Pointer$({ base: 0bv32, offset: 0bv32 }, { base: ~p~0!base, offset: ~bvadd32(4bv32, ~p~0!offset) }, 4bv32); [L641] ~p~0 := ~a~0; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=2181570690bv32, #t~malloc0!offset=0bv32, #t~malloc2!base=1bv32, #t~malloc2!offset=0bv32, ~a~0!base=2181570690bv32, ~a~0!offset=0bv32, ~p~0!base=2181570690bv32, ~p~0!offset=0bv32, ~t~0!base=1bv32, ~t~0!offset=0bv32] [L642-L647] COND FALSE !(!(~p~0 != { base: 0bv32, offset: 0bv32 })) [L643] FCALL call #t~mem4 := read~intINTTYPE4({ base: ~p~0!base, offset: ~p~0!offset }, 4bv32); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=2181570690bv32, #t~malloc0!offset=0bv32, #t~malloc2!base=1bv32, #t~malloc2!offset=0bv32, #t~mem4=1bv32, ~a~0!base=2181570690bv32, ~a~0!offset=0bv32, ~p~0!base=2181570690bv32, ~p~0!offset=0bv32, ~t~0!base=1bv32, ~t~0!offset=0bv32] [L643] COND TRUE 2bv32 != #t~mem4 [L643] havoc #t~mem4; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=2181570690bv32, #t~malloc0!offset=0bv32, #t~malloc2!base=1bv32, #t~malloc2!offset=0bv32, ~a~0!base=2181570690bv32, ~a~0!offset=0bv32, ~p~0!base=2181570690bv32, ~p~0!offset=0bv32, ~t~0!base=1bv32, ~t~0!offset=0bv32] [L644] assert false; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=2181570690bv32, #t~malloc0!offset=0bv32, #t~malloc2!base=1bv32, #t~malloc2!offset=0bv32, ~a~0!base=2181570690bv32, ~a~0!offset=0bv32, ~p~0!base=2181570690bv32, ~p~0!offset=0bv32, ~t~0!base=1bv32, ~t~0!offset=0bv32] [L627] List a = (List) malloc(sizeof(struct node)); VAL [a={-2113396606:0}, malloc(sizeof(struct node))={-2113396606:0}] [L628] COND FALSE !(a == 0) VAL [a={-2113396606:0}, malloc(sizeof(struct node))={-2113396606:0}] [L629] List t; [L630] List p = a; [L631] a->h = 2 VAL [a={-2113396606:0}, malloc(sizeof(struct node))={-2113396606:0}, p={-2113396606:0}] [L632] COND TRUE __VERIFIER_nondet_int() [L633] p->h = 1 [L634] t = (List) malloc(sizeof(struct node)) VAL [a={-2113396606:0}, malloc(sizeof(struct node))={1:0}, malloc(sizeof(struct node))={-2113396606:0}, p={-2113396606:0}, t={1:0}] [L635] COND FALSE !(t == 0) VAL [a={-2113396606:0}, malloc(sizeof(struct node))={1:0}, malloc(sizeof(struct node))={-2113396606:0}, p={-2113396606:0}, t={1:0}] [L636] p->n = t [L637] EXPR p->n [L637] p = p->n [L632] COND FALSE !(__VERIFIER_nondet_int()) [L639] p->h = 2 [L640] p->n = 0 [L641] p = a VAL [a={-2113396606:0}, malloc(sizeof(struct node))={1:0}, malloc(sizeof(struct node))={-2113396606:0}, p={-2113396606:0}, t={1:0}] [L642] COND TRUE p!=0 [L643] EXPR p->h VAL [a={-2113396606:0}, malloc(sizeof(struct node))={1:0}, malloc(sizeof(struct node))={-2113396606:0}, p={-2113396606:0}, p->h=1, t={1:0}] [L643] COND TRUE p->h != 2 [L644] __VERIFIER_error() VAL [a={-2113396606:0}, malloc(sizeof(struct node))={1:0}, malloc(sizeof(struct node))={-2113396606:0}, p={-2113396606:0}, t={1:0}] ----- [2018-11-23 11:04:42,991 WARN L170 areAnnotationChecker]: exitENTRY has no Hoare annotation [2018-11-23 11:04:42,991 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2018-11-23 11:04:42,991 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2018-11-23 11:04:42,992 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2018-11-23 11:04:42,992 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2018-11-23 11:04:42,992 WARN L170 areAnnotationChecker]: L620 has no Hoare annotation [2018-11-23 11:04:42,992 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2018-11-23 11:04:42,992 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2018-11-23 11:04:42,992 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2018-11-23 11:04:42,992 WARN L170 areAnnotationChecker]: L628 has no Hoare annotation [2018-11-23 11:04:42,992 WARN L170 areAnnotationChecker]: L628 has no Hoare annotation [2018-11-23 11:04:42,995 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-23 11:04:42,995 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-23 11:04:42,995 WARN L170 areAnnotationChecker]: L628-1 has no Hoare annotation [2018-11-23 11:04:42,995 WARN L170 areAnnotationChecker]: L628-1 has no Hoare annotation [2018-11-23 11:04:42,995 WARN L170 areAnnotationChecker]: L628-3 has no Hoare annotation [2018-11-23 11:04:42,995 WARN L170 areAnnotationChecker]: L632-2 has no Hoare annotation [2018-11-23 11:04:42,996 WARN L170 areAnnotationChecker]: L632-2 has no Hoare annotation [2018-11-23 11:04:42,996 WARN L170 areAnnotationChecker]: L632-2 has no Hoare annotation [2018-11-23 11:04:42,996 WARN L170 areAnnotationChecker]: L632-3 has no Hoare annotation [2018-11-23 11:04:42,996 WARN L170 areAnnotationChecker]: L635 has no Hoare annotation [2018-11-23 11:04:42,996 WARN L170 areAnnotationChecker]: L635 has no Hoare annotation [2018-11-23 11:04:42,996 WARN L170 areAnnotationChecker]: L642-2 has no Hoare annotation [2018-11-23 11:04:42,996 WARN L170 areAnnotationChecker]: L642-2 has no Hoare annotation [2018-11-23 11:04:42,999 WARN L170 areAnnotationChecker]: L642-2 has no Hoare annotation [2018-11-23 11:04:42,999 WARN L170 areAnnotationChecker]: L635-1 has no Hoare annotation [2018-11-23 11:04:42,999 WARN L170 areAnnotationChecker]: L635-1 has no Hoare annotation [2018-11-23 11:04:42,999 WARN L170 areAnnotationChecker]: L635-3 has no Hoare annotation [2018-11-23 11:04:42,999 WARN L170 areAnnotationChecker]: L642-3 has no Hoare annotation [2018-11-23 11:04:42,999 WARN L170 areAnnotationChecker]: L643 has no Hoare annotation [2018-11-23 11:04:43,000 WARN L170 areAnnotationChecker]: L643 has no Hoare annotation [2018-11-23 11:04:43,000 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-23 11:04:43,000 WARN L170 areAnnotationChecker]: L644 has no Hoare annotation [2018-11-23 11:04:43,000 WARN L170 areAnnotationChecker]: L644 has no Hoare annotation [2018-11-23 11:04:43,000 WARN L170 areAnnotationChecker]: L643-2 has no Hoare annotation [2018-11-23 11:04:43,000 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2018-11-23 11:04:43,001 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. [2018-11-23 11:04:43,008 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 11:04:43 BoogieIcfgContainer [2018-11-23 11:04:43,008 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 11:04:43,009 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 11:04:43,012 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 11:04:43,012 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 11:04:43,013 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:04:37" (3/4) ... [2018-11-23 11:04:43,018 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); VAL [|#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |old(#NULL.base)|=(_ bv0 32), |old(#NULL.offset)|=(_ bv0 32)] [?] #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; VAL [|#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |old(#NULL.base)|=(_ bv0 32), |old(#NULL.offset)|=(_ bv0 32)] [?] assume true; VAL [|#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |old(#NULL.base)|=(_ bv0 32), |old(#NULL.offset)|=(_ bv0 32)] [?] RET #65#return; VAL [|#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32)] [?] CALL call #t~ret6 := main(); VAL [|#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32)] [?] call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8bv32);~a~0.base, ~a~0.offset := #t~malloc0.base, #t~malloc0.offset; VAL [main_~a~0.base=(_ bv2181570690 32), main_~a~0.offset=(_ bv0 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_#t~malloc0.base|=(_ bv2181570690 32), |main_#t~malloc0.offset|=(_ bv0 32)] [?] assume !(~a~0.base == 0bv32 && ~a~0.offset == 0bv32); VAL [main_~a~0.base=(_ bv2181570690 32), main_~a~0.offset=(_ bv0 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_#t~malloc0.base|=(_ bv2181570690 32), |main_#t~malloc0.offset|=(_ bv0 32)] [?] havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset;call write~intINTTYPE4(2bv32, ~a~0.base, ~a~0.offset, 4bv32); VAL [main_~a~0.base=(_ bv2181570690 32), main_~a~0.offset=(_ bv0 32), main_~p~0.base=(_ bv2181570690 32), main_~p~0.offset=(_ bv0 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_#t~malloc0.base|=(_ bv2181570690 32), |main_#t~malloc0.offset|=(_ bv0 32)] [?] assume !!(0bv32 != #t~nondet1);havoc #t~nondet1;call write~intINTTYPE4(1bv32, ~p~0.base, ~p~0.offset, 4bv32);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8bv32);~t~0.base, ~t~0.offset := #t~malloc2.base, #t~malloc2.offset; VAL [main_~a~0.base=(_ bv2181570690 32), main_~a~0.offset=(_ bv0 32), main_~p~0.base=(_ bv2181570690 32), main_~p~0.offset=(_ bv0 32), main_~t~0.base=(_ bv1 32), main_~t~0.offset=(_ bv0 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_#t~malloc0.base|=(_ bv2181570690 32), |main_#t~malloc0.offset|=(_ bv0 32), |main_#t~malloc2.base|=(_ bv1 32), |main_#t~malloc2.offset|=(_ bv0 32)] [?] assume !(~t~0.base == 0bv32 && ~t~0.offset == 0bv32); VAL [main_~a~0.base=(_ bv2181570690 32), main_~a~0.offset=(_ bv0 32), main_~p~0.base=(_ bv2181570690 32), main_~p~0.offset=(_ bv0 32), main_~t~0.base=(_ bv1 32), main_~t~0.offset=(_ bv0 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_#t~malloc0.base|=(_ bv2181570690 32), |main_#t~malloc0.offset|=(_ bv0 32), |main_#t~malloc2.base|=(_ bv1 32), |main_#t~malloc2.offset|=(_ bv0 32)] [?] call write~$Pointer$(~t~0.base, ~t~0.offset, ~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~p~0.base, ~p~0.offset := #t~mem3.base, #t~mem3.offset;havoc #t~mem3.base, #t~mem3.offset; VAL [main_~a~0.base=(_ bv2181570690 32), main_~a~0.offset=(_ bv0 32), main_~p~0.base=(_ bv1 32), main_~p~0.offset=(_ bv0 32), main_~t~0.base=(_ bv1 32), main_~t~0.offset=(_ bv0 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_#t~malloc0.base|=(_ bv2181570690 32), |main_#t~malloc0.offset|=(_ bv0 32), |main_#t~malloc2.base|=(_ bv1 32), |main_#t~malloc2.offset|=(_ bv0 32)] [?] assume !(0bv32 != #t~nondet1);havoc #t~nondet1; VAL [main_~a~0.base=(_ bv2181570690 32), main_~a~0.offset=(_ bv0 32), main_~p~0.base=(_ bv1 32), main_~p~0.offset=(_ bv0 32), main_~t~0.base=(_ bv1 32), main_~t~0.offset=(_ bv0 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_#t~malloc0.base|=(_ bv2181570690 32), |main_#t~malloc0.offset|=(_ bv0 32), |main_#t~malloc2.base|=(_ bv1 32), |main_#t~malloc2.offset|=(_ bv0 32)] [?] call write~intINTTYPE4(2bv32, ~p~0.base, ~p~0.offset, 4bv32);call write~$Pointer$(0bv32, 0bv32, ~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; VAL [main_~a~0.base=(_ bv2181570690 32), main_~a~0.offset=(_ bv0 32), main_~p~0.base=(_ bv2181570690 32), main_~p~0.offset=(_ bv0 32), main_~t~0.base=(_ bv1 32), main_~t~0.offset=(_ bv0 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_#t~malloc0.base|=(_ bv2181570690 32), |main_#t~malloc0.offset|=(_ bv0 32), |main_#t~malloc2.base|=(_ bv1 32), |main_#t~malloc2.offset|=(_ bv0 32)] [?] assume !!(~p~0.base != 0bv32 || ~p~0.offset != 0bv32);call #t~mem4 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); VAL [main_~a~0.base=(_ bv2181570690 32), main_~a~0.offset=(_ bv0 32), main_~p~0.base=(_ bv2181570690 32), main_~p~0.offset=(_ bv0 32), main_~t~0.base=(_ bv1 32), main_~t~0.offset=(_ bv0 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_#t~malloc0.base|=(_ bv2181570690 32), |main_#t~malloc0.offset|=(_ bv0 32), |main_#t~malloc2.base|=(_ bv1 32), |main_#t~malloc2.offset|=(_ bv0 32), |main_#t~mem4|=(_ bv1 32)] [?] assume 2bv32 != #t~mem4;havoc #t~mem4; VAL [main_~a~0.base=(_ bv2181570690 32), main_~a~0.offset=(_ bv0 32), main_~p~0.base=(_ bv2181570690 32), main_~p~0.offset=(_ bv0 32), main_~t~0.base=(_ bv1 32), main_~t~0.offset=(_ bv0 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_#t~malloc0.base|=(_ bv2181570690 32), |main_#t~malloc0.offset|=(_ bv0 32), |main_#t~malloc2.base|=(_ bv1 32), |main_#t~malloc2.offset|=(_ bv0 32)] [?] assume !false; VAL [main_~a~0.base=(_ bv2181570690 32), main_~a~0.offset=(_ bv0 32), main_~p~0.base=(_ bv2181570690 32), main_~p~0.offset=(_ bv0 32), main_~t~0.base=(_ bv1 32), main_~t~0.offset=(_ bv0 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_#t~malloc0.base|=(_ bv2181570690 32), |main_#t~malloc0.offset|=(_ bv0 32), |main_#t~malloc2.base|=(_ bv1 32), |main_#t~malloc2.offset|=(_ bv0 32)] [?] CALL call ULTIMATE.init(); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, old(#NULL.base)=0bv32, old(#NULL.offset)=0bv32] [?] #NULL.base, #NULL.offset := 0bv32, 0bv32; [?] #valid := #valid[0bv32 := 0bv1]; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, old(#NULL.base)=0bv32, old(#NULL.offset)=0bv32] [?] ensures true; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, old(#NULL.base)=0bv32, old(#NULL.offset)=0bv32] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0bv32, #NULL.offset=0bv32] [?] CALL call #t~ret6 := main(); VAL [#NULL.base=0bv32, #NULL.offset=0bv32] [L627] call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8bv32); [L627] ~a~0.base, ~a~0.offset := #t~malloc0.base, #t~malloc0.offset; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc0.base=2181570690bv32, #t~malloc0.offset=0bv32, ~a~0.base=2181570690bv32, ~a~0.offset=0bv32] [L628] assume !(~a~0.base == 0bv32 && ~a~0.offset == 0bv32); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc0.base=2181570690bv32, #t~malloc0.offset=0bv32, ~a~0.base=2181570690bv32, ~a~0.offset=0bv32] [L629] havoc ~t~0.base, ~t~0.offset; [L630] ~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; [L631] call write~intINTTYPE4(2bv32, ~a~0.base, ~a~0.offset, 4bv32); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc0.base=2181570690bv32, #t~malloc0.offset=0bv32, ~a~0.base=2181570690bv32, ~a~0.offset=0bv32, ~p~0.base=2181570690bv32, ~p~0.offset=0bv32] [L632-L638] assume !!(0bv32 != #t~nondet1); [L632] havoc #t~nondet1; [L633] call write~intINTTYPE4(1bv32, ~p~0.base, ~p~0.offset, 4bv32); [L634] call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8bv32); [L634] ~t~0.base, ~t~0.offset := #t~malloc2.base, #t~malloc2.offset; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc0.base=2181570690bv32, #t~malloc0.offset=0bv32, #t~malloc2.base=1bv32, #t~malloc2.offset=0bv32, ~a~0.base=2181570690bv32, ~a~0.offset=0bv32, ~p~0.base=2181570690bv32, ~p~0.offset=0bv32, ~t~0.base=1bv32, ~t~0.offset=0bv32] [L635] assume !(~t~0.base == 0bv32 && ~t~0.offset == 0bv32); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc0.base=2181570690bv32, #t~malloc0.offset=0bv32, #t~malloc2.base=1bv32, #t~malloc2.offset=0bv32, ~a~0.base=2181570690bv32, ~a~0.offset=0bv32, ~p~0.base=2181570690bv32, ~p~0.offset=0bv32, ~t~0.base=1bv32, ~t~0.offset=0bv32] [L636] call write~$Pointer$(~t~0.base, ~t~0.offset, ~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32); [L637] call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32); [L637] ~p~0.base, ~p~0.offset := #t~mem3.base, #t~mem3.offset; [L637] havoc #t~mem3.base, #t~mem3.offset; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc0.base=2181570690bv32, #t~malloc0.offset=0bv32, #t~malloc2.base=1bv32, #t~malloc2.offset=0bv32, ~a~0.base=2181570690bv32, ~a~0.offset=0bv32, ~p~0.base=1bv32, ~p~0.offset=0bv32, ~t~0.base=1bv32, ~t~0.offset=0bv32] [L632-L638] assume !(0bv32 != #t~nondet1); [L632] havoc #t~nondet1; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc0.base=2181570690bv32, #t~malloc0.offset=0bv32, #t~malloc2.base=1bv32, #t~malloc2.offset=0bv32, ~a~0.base=2181570690bv32, ~a~0.offset=0bv32, ~p~0.base=1bv32, ~p~0.offset=0bv32, ~t~0.base=1bv32, ~t~0.offset=0bv32] [L639] call write~intINTTYPE4(2bv32, ~p~0.base, ~p~0.offset, 4bv32); [L640] call write~$Pointer$(0bv32, 0bv32, ~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32); [L641] ~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc0.base=2181570690bv32, #t~malloc0.offset=0bv32, #t~malloc2.base=1bv32, #t~malloc2.offset=0bv32, ~a~0.base=2181570690bv32, ~a~0.offset=0bv32, ~p~0.base=2181570690bv32, ~p~0.offset=0bv32, ~t~0.base=1bv32, ~t~0.offset=0bv32] [L642-L647] assume !!(~p~0.base != 0bv32 || ~p~0.offset != 0bv32); [L643] call #t~mem4 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc0.base=2181570690bv32, #t~malloc0.offset=0bv32, #t~malloc2.base=1bv32, #t~malloc2.offset=0bv32, #t~mem4=1bv32, ~a~0.base=2181570690bv32, ~a~0.offset=0bv32, ~p~0.base=2181570690bv32, ~p~0.offset=0bv32, ~t~0.base=1bv32, ~t~0.offset=0bv32] [L643-L645] assume 2bv32 != #t~mem4; [L643] havoc #t~mem4; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc0.base=2181570690bv32, #t~malloc0.offset=0bv32, #t~malloc2.base=1bv32, #t~malloc2.offset=0bv32, ~a~0.base=2181570690bv32, ~a~0.offset=0bv32, ~p~0.base=2181570690bv32, ~p~0.offset=0bv32, ~t~0.base=1bv32, ~t~0.offset=0bv32] [L644] assert false; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc0.base=2181570690bv32, #t~malloc0.offset=0bv32, #t~malloc2.base=1bv32, #t~malloc2.offset=0bv32, ~a~0.base=2181570690bv32, ~a~0.offset=0bv32, ~p~0.base=2181570690bv32, ~p~0.offset=0bv32, ~t~0.base=1bv32, ~t~0.offset=0bv32] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, old(#NULL.base)=0bv32, old(#NULL.offset)=0bv32] [?] #NULL.base, #NULL.offset := 0bv32, 0bv32; [?] #valid := #valid[0bv32 := 0bv1]; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, old(#NULL.base)=0bv32, old(#NULL.offset)=0bv32] [?] ensures true; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, old(#NULL.base)=0bv32, old(#NULL.offset)=0bv32] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0bv32, #NULL.offset=0bv32] [?] CALL call #t~ret6 := main(); VAL [#NULL.base=0bv32, #NULL.offset=0bv32] [L627] call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8bv32); [L627] ~a~0.base, ~a~0.offset := #t~malloc0.base, #t~malloc0.offset; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc0.base=2181570690bv32, #t~malloc0.offset=0bv32, ~a~0.base=2181570690bv32, ~a~0.offset=0bv32] [L628] assume !(~a~0.base == 0bv32 && ~a~0.offset == 0bv32); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc0.base=2181570690bv32, #t~malloc0.offset=0bv32, ~a~0.base=2181570690bv32, ~a~0.offset=0bv32] [L629] havoc ~t~0.base, ~t~0.offset; [L630] ~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; [L631] call write~intINTTYPE4(2bv32, ~a~0.base, ~a~0.offset, 4bv32); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc0.base=2181570690bv32, #t~malloc0.offset=0bv32, ~a~0.base=2181570690bv32, ~a~0.offset=0bv32, ~p~0.base=2181570690bv32, ~p~0.offset=0bv32] [L632-L638] assume !!(0bv32 != #t~nondet1); [L632] havoc #t~nondet1; [L633] call write~intINTTYPE4(1bv32, ~p~0.base, ~p~0.offset, 4bv32); [L634] call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8bv32); [L634] ~t~0.base, ~t~0.offset := #t~malloc2.base, #t~malloc2.offset; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc0.base=2181570690bv32, #t~malloc0.offset=0bv32, #t~malloc2.base=1bv32, #t~malloc2.offset=0bv32, ~a~0.base=2181570690bv32, ~a~0.offset=0bv32, ~p~0.base=2181570690bv32, ~p~0.offset=0bv32, ~t~0.base=1bv32, ~t~0.offset=0bv32] [L635] assume !(~t~0.base == 0bv32 && ~t~0.offset == 0bv32); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc0.base=2181570690bv32, #t~malloc0.offset=0bv32, #t~malloc2.base=1bv32, #t~malloc2.offset=0bv32, ~a~0.base=2181570690bv32, ~a~0.offset=0bv32, ~p~0.base=2181570690bv32, ~p~0.offset=0bv32, ~t~0.base=1bv32, ~t~0.offset=0bv32] [L636] call write~$Pointer$(~t~0.base, ~t~0.offset, ~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32); [L637] call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32); [L637] ~p~0.base, ~p~0.offset := #t~mem3.base, #t~mem3.offset; [L637] havoc #t~mem3.base, #t~mem3.offset; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc0.base=2181570690bv32, #t~malloc0.offset=0bv32, #t~malloc2.base=1bv32, #t~malloc2.offset=0bv32, ~a~0.base=2181570690bv32, ~a~0.offset=0bv32, ~p~0.base=1bv32, ~p~0.offset=0bv32, ~t~0.base=1bv32, ~t~0.offset=0bv32] [L632-L638] assume !(0bv32 != #t~nondet1); [L632] havoc #t~nondet1; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc0.base=2181570690bv32, #t~malloc0.offset=0bv32, #t~malloc2.base=1bv32, #t~malloc2.offset=0bv32, ~a~0.base=2181570690bv32, ~a~0.offset=0bv32, ~p~0.base=1bv32, ~p~0.offset=0bv32, ~t~0.base=1bv32, ~t~0.offset=0bv32] [L639] call write~intINTTYPE4(2bv32, ~p~0.base, ~p~0.offset, 4bv32); [L640] call write~$Pointer$(0bv32, 0bv32, ~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32); [L641] ~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc0.base=2181570690bv32, #t~malloc0.offset=0bv32, #t~malloc2.base=1bv32, #t~malloc2.offset=0bv32, ~a~0.base=2181570690bv32, ~a~0.offset=0bv32, ~p~0.base=2181570690bv32, ~p~0.offset=0bv32, ~t~0.base=1bv32, ~t~0.offset=0bv32] [L642-L647] assume !!(~p~0.base != 0bv32 || ~p~0.offset != 0bv32); [L643] call #t~mem4 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc0.base=2181570690bv32, #t~malloc0.offset=0bv32, #t~malloc2.base=1bv32, #t~malloc2.offset=0bv32, #t~mem4=1bv32, ~a~0.base=2181570690bv32, ~a~0.offset=0bv32, ~p~0.base=2181570690bv32, ~p~0.offset=0bv32, ~t~0.base=1bv32, ~t~0.offset=0bv32] [L643-L645] assume 2bv32 != #t~mem4; [L643] havoc #t~mem4; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc0.base=2181570690bv32, #t~malloc0.offset=0bv32, #t~malloc2.base=1bv32, #t~malloc2.offset=0bv32, ~a~0.base=2181570690bv32, ~a~0.offset=0bv32, ~p~0.base=2181570690bv32, ~p~0.offset=0bv32, ~t~0.base=1bv32, ~t~0.offset=0bv32] [L644] assert false; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc0.base=2181570690bv32, #t~malloc0.offset=0bv32, #t~malloc2.base=1bv32, #t~malloc2.offset=0bv32, ~a~0.base=2181570690bv32, ~a~0.offset=0bv32, ~p~0.base=2181570690bv32, ~p~0.offset=0bv32, ~t~0.base=1bv32, ~t~0.offset=0bv32] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, old(#NULL!base)=0bv32, old(#NULL!offset)=0bv32] [?] #NULL := { base: 0bv32, offset: 0bv32 }; [?] #valid[0bv32] := 0bv1; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, old(#NULL!base)=0bv32, old(#NULL!offset)=0bv32] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32] [?] CALL call #t~ret6 := main(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32] [L627] FCALL call #t~malloc0 := #Ultimate.alloc(8bv32); [L627] ~a~0 := #t~malloc0; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=2181570690bv32, #t~malloc0!offset=0bv32, ~a~0!base=2181570690bv32, ~a~0!offset=0bv32] [L628] COND FALSE !(~a~0 == { base: 0bv32, offset: 0bv32 }) VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=2181570690bv32, #t~malloc0!offset=0bv32, ~a~0!base=2181570690bv32, ~a~0!offset=0bv32] [L629] havoc ~t~0; [L630] ~p~0 := ~a~0; [L631] FCALL call write~intINTTYPE4(2bv32, { base: ~a~0!base, offset: ~a~0!offset }, 4bv32); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=2181570690bv32, #t~malloc0!offset=0bv32, ~a~0!base=2181570690bv32, ~a~0!offset=0bv32, ~p~0!base=2181570690bv32, ~p~0!offset=0bv32] [L632-L638] COND FALSE !(!(0bv32 != #t~nondet1)) [L632] havoc #t~nondet1; [L633] FCALL call write~intINTTYPE4(1bv32, { base: ~p~0!base, offset: ~p~0!offset }, 4bv32); [L634] FCALL call #t~malloc2 := #Ultimate.alloc(8bv32); [L634] ~t~0 := #t~malloc2; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=2181570690bv32, #t~malloc0!offset=0bv32, #t~malloc2!base=1bv32, #t~malloc2!offset=0bv32, ~a~0!base=2181570690bv32, ~a~0!offset=0bv32, ~p~0!base=2181570690bv32, ~p~0!offset=0bv32, ~t~0!base=1bv32, ~t~0!offset=0bv32] [L635] COND FALSE !(~t~0 == { base: 0bv32, offset: 0bv32 }) VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=2181570690bv32, #t~malloc0!offset=0bv32, #t~malloc2!base=1bv32, #t~malloc2!offset=0bv32, ~a~0!base=2181570690bv32, ~a~0!offset=0bv32, ~p~0!base=2181570690bv32, ~p~0!offset=0bv32, ~t~0!base=1bv32, ~t~0!offset=0bv32] [L636] FCALL call write~$Pointer$(~t~0, { base: ~p~0!base, offset: ~bvadd32(4bv32, ~p~0!offset) }, 4bv32); [L637] FCALL call #t~mem3 := read~$Pointer$({ base: ~p~0!base, offset: ~bvadd32(4bv32, ~p~0!offset) }, 4bv32); [L637] ~p~0 := #t~mem3; [L637] havoc #t~mem3; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=2181570690bv32, #t~malloc0!offset=0bv32, #t~malloc2!base=1bv32, #t~malloc2!offset=0bv32, ~a~0!base=2181570690bv32, ~a~0!offset=0bv32, ~p~0!base=1bv32, ~p~0!offset=0bv32, ~t~0!base=1bv32, ~t~0!offset=0bv32] [L632-L638] COND TRUE !(0bv32 != #t~nondet1) [L632] havoc #t~nondet1; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=2181570690bv32, #t~malloc0!offset=0bv32, #t~malloc2!base=1bv32, #t~malloc2!offset=0bv32, ~a~0!base=2181570690bv32, ~a~0!offset=0bv32, ~p~0!base=1bv32, ~p~0!offset=0bv32, ~t~0!base=1bv32, ~t~0!offset=0bv32] [L639] FCALL call write~intINTTYPE4(2bv32, { base: ~p~0!base, offset: ~p~0!offset }, 4bv32); [L640] FCALL call write~$Pointer$({ base: 0bv32, offset: 0bv32 }, { base: ~p~0!base, offset: ~bvadd32(4bv32, ~p~0!offset) }, 4bv32); [L641] ~p~0 := ~a~0; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=2181570690bv32, #t~malloc0!offset=0bv32, #t~malloc2!base=1bv32, #t~malloc2!offset=0bv32, ~a~0!base=2181570690bv32, ~a~0!offset=0bv32, ~p~0!base=2181570690bv32, ~p~0!offset=0bv32, ~t~0!base=1bv32, ~t~0!offset=0bv32] [L642-L647] COND FALSE !(!(~p~0 != { base: 0bv32, offset: 0bv32 })) [L643] FCALL call #t~mem4 := read~intINTTYPE4({ base: ~p~0!base, offset: ~p~0!offset }, 4bv32); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=2181570690bv32, #t~malloc0!offset=0bv32, #t~malloc2!base=1bv32, #t~malloc2!offset=0bv32, #t~mem4=1bv32, ~a~0!base=2181570690bv32, ~a~0!offset=0bv32, ~p~0!base=2181570690bv32, ~p~0!offset=0bv32, ~t~0!base=1bv32, ~t~0!offset=0bv32] [L643] COND TRUE 2bv32 != #t~mem4 [L643] havoc #t~mem4; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=2181570690bv32, #t~malloc0!offset=0bv32, #t~malloc2!base=1bv32, #t~malloc2!offset=0bv32, ~a~0!base=2181570690bv32, ~a~0!offset=0bv32, ~p~0!base=2181570690bv32, ~p~0!offset=0bv32, ~t~0!base=1bv32, ~t~0!offset=0bv32] [L644] assert false; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=2181570690bv32, #t~malloc0!offset=0bv32, #t~malloc2!base=1bv32, #t~malloc2!offset=0bv32, ~a~0!base=2181570690bv32, ~a~0!offset=0bv32, ~p~0!base=2181570690bv32, ~p~0!offset=0bv32, ~t~0!base=1bv32, ~t~0!offset=0bv32] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, old(#NULL!base)=0bv32, old(#NULL!offset)=0bv32] [?] #NULL := { base: 0bv32, offset: 0bv32 }; [?] #valid[0bv32] := 0bv1; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, old(#NULL!base)=0bv32, old(#NULL!offset)=0bv32] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32] [?] CALL call #t~ret6 := main(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32] [L627] FCALL call #t~malloc0 := #Ultimate.alloc(8bv32); [L627] ~a~0 := #t~malloc0; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=2181570690bv32, #t~malloc0!offset=0bv32, ~a~0!base=2181570690bv32, ~a~0!offset=0bv32] [L628] COND FALSE !(~a~0 == { base: 0bv32, offset: 0bv32 }) VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=2181570690bv32, #t~malloc0!offset=0bv32, ~a~0!base=2181570690bv32, ~a~0!offset=0bv32] [L629] havoc ~t~0; [L630] ~p~0 := ~a~0; [L631] FCALL call write~intINTTYPE4(2bv32, { base: ~a~0!base, offset: ~a~0!offset }, 4bv32); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=2181570690bv32, #t~malloc0!offset=0bv32, ~a~0!base=2181570690bv32, ~a~0!offset=0bv32, ~p~0!base=2181570690bv32, ~p~0!offset=0bv32] [L632-L638] COND FALSE !(!(0bv32 != #t~nondet1)) [L632] havoc #t~nondet1; [L633] FCALL call write~intINTTYPE4(1bv32, { base: ~p~0!base, offset: ~p~0!offset }, 4bv32); [L634] FCALL call #t~malloc2 := #Ultimate.alloc(8bv32); [L634] ~t~0 := #t~malloc2; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=2181570690bv32, #t~malloc0!offset=0bv32, #t~malloc2!base=1bv32, #t~malloc2!offset=0bv32, ~a~0!base=2181570690bv32, ~a~0!offset=0bv32, ~p~0!base=2181570690bv32, ~p~0!offset=0bv32, ~t~0!base=1bv32, ~t~0!offset=0bv32] [L635] COND FALSE !(~t~0 == { base: 0bv32, offset: 0bv32 }) VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=2181570690bv32, #t~malloc0!offset=0bv32, #t~malloc2!base=1bv32, #t~malloc2!offset=0bv32, ~a~0!base=2181570690bv32, ~a~0!offset=0bv32, ~p~0!base=2181570690bv32, ~p~0!offset=0bv32, ~t~0!base=1bv32, ~t~0!offset=0bv32] [L636] FCALL call write~$Pointer$(~t~0, { base: ~p~0!base, offset: ~bvadd32(4bv32, ~p~0!offset) }, 4bv32); [L637] FCALL call #t~mem3 := read~$Pointer$({ base: ~p~0!base, offset: ~bvadd32(4bv32, ~p~0!offset) }, 4bv32); [L637] ~p~0 := #t~mem3; [L637] havoc #t~mem3; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=2181570690bv32, #t~malloc0!offset=0bv32, #t~malloc2!base=1bv32, #t~malloc2!offset=0bv32, ~a~0!base=2181570690bv32, ~a~0!offset=0bv32, ~p~0!base=1bv32, ~p~0!offset=0bv32, ~t~0!base=1bv32, ~t~0!offset=0bv32] [L632-L638] COND TRUE !(0bv32 != #t~nondet1) [L632] havoc #t~nondet1; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=2181570690bv32, #t~malloc0!offset=0bv32, #t~malloc2!base=1bv32, #t~malloc2!offset=0bv32, ~a~0!base=2181570690bv32, ~a~0!offset=0bv32, ~p~0!base=1bv32, ~p~0!offset=0bv32, ~t~0!base=1bv32, ~t~0!offset=0bv32] [L639] FCALL call write~intINTTYPE4(2bv32, { base: ~p~0!base, offset: ~p~0!offset }, 4bv32); [L640] FCALL call write~$Pointer$({ base: 0bv32, offset: 0bv32 }, { base: ~p~0!base, offset: ~bvadd32(4bv32, ~p~0!offset) }, 4bv32); [L641] ~p~0 := ~a~0; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=2181570690bv32, #t~malloc0!offset=0bv32, #t~malloc2!base=1bv32, #t~malloc2!offset=0bv32, ~a~0!base=2181570690bv32, ~a~0!offset=0bv32, ~p~0!base=2181570690bv32, ~p~0!offset=0bv32, ~t~0!base=1bv32, ~t~0!offset=0bv32] [L642-L647] COND FALSE !(!(~p~0 != { base: 0bv32, offset: 0bv32 })) [L643] FCALL call #t~mem4 := read~intINTTYPE4({ base: ~p~0!base, offset: ~p~0!offset }, 4bv32); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=2181570690bv32, #t~malloc0!offset=0bv32, #t~malloc2!base=1bv32, #t~malloc2!offset=0bv32, #t~mem4=1bv32, ~a~0!base=2181570690bv32, ~a~0!offset=0bv32, ~p~0!base=2181570690bv32, ~p~0!offset=0bv32, ~t~0!base=1bv32, ~t~0!offset=0bv32] [L643] COND TRUE 2bv32 != #t~mem4 [L643] havoc #t~mem4; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=2181570690bv32, #t~malloc0!offset=0bv32, #t~malloc2!base=1bv32, #t~malloc2!offset=0bv32, ~a~0!base=2181570690bv32, ~a~0!offset=0bv32, ~p~0!base=2181570690bv32, ~p~0!offset=0bv32, ~t~0!base=1bv32, ~t~0!offset=0bv32] [L644] assert false; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=2181570690bv32, #t~malloc0!offset=0bv32, #t~malloc2!base=1bv32, #t~malloc2!offset=0bv32, ~a~0!base=2181570690bv32, ~a~0!offset=0bv32, ~p~0!base=2181570690bv32, ~p~0!offset=0bv32, ~t~0!base=1bv32, ~t~0!offset=0bv32] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, old(#NULL!base)=0bv32, old(#NULL!offset)=0bv32] [?] #NULL := { base: 0bv32, offset: 0bv32 }; [?] #valid[0bv32] := 0bv1; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, old(#NULL!base)=0bv32, old(#NULL!offset)=0bv32] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32] [?] CALL call #t~ret6 := main(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32] [L627] FCALL call #t~malloc0 := #Ultimate.alloc(8bv32); [L627] ~a~0 := #t~malloc0; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=2181570690bv32, #t~malloc0!offset=0bv32, ~a~0!base=2181570690bv32, ~a~0!offset=0bv32] [L628] COND FALSE !(~a~0 == { base: 0bv32, offset: 0bv32 }) VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=2181570690bv32, #t~malloc0!offset=0bv32, ~a~0!base=2181570690bv32, ~a~0!offset=0bv32] [L629] havoc ~t~0; [L630] ~p~0 := ~a~0; [L631] FCALL call write~intINTTYPE4(2bv32, { base: ~a~0!base, offset: ~a~0!offset }, 4bv32); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=2181570690bv32, #t~malloc0!offset=0bv32, ~a~0!base=2181570690bv32, ~a~0!offset=0bv32, ~p~0!base=2181570690bv32, ~p~0!offset=0bv32] [L632-L638] COND FALSE !(!(0bv32 != #t~nondet1)) [L632] havoc #t~nondet1; [L633] FCALL call write~intINTTYPE4(1bv32, { base: ~p~0!base, offset: ~p~0!offset }, 4bv32); [L634] FCALL call #t~malloc2 := #Ultimate.alloc(8bv32); [L634] ~t~0 := #t~malloc2; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=2181570690bv32, #t~malloc0!offset=0bv32, #t~malloc2!base=1bv32, #t~malloc2!offset=0bv32, ~a~0!base=2181570690bv32, ~a~0!offset=0bv32, ~p~0!base=2181570690bv32, ~p~0!offset=0bv32, ~t~0!base=1bv32, ~t~0!offset=0bv32] [L635] COND FALSE !(~t~0 == { base: 0bv32, offset: 0bv32 }) VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=2181570690bv32, #t~malloc0!offset=0bv32, #t~malloc2!base=1bv32, #t~malloc2!offset=0bv32, ~a~0!base=2181570690bv32, ~a~0!offset=0bv32, ~p~0!base=2181570690bv32, ~p~0!offset=0bv32, ~t~0!base=1bv32, ~t~0!offset=0bv32] [L636] FCALL call write~$Pointer$(~t~0, { base: ~p~0!base, offset: ~bvadd32(4bv32, ~p~0!offset) }, 4bv32); [L637] FCALL call #t~mem3 := read~$Pointer$({ base: ~p~0!base, offset: ~bvadd32(4bv32, ~p~0!offset) }, 4bv32); [L637] ~p~0 := #t~mem3; [L637] havoc #t~mem3; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=2181570690bv32, #t~malloc0!offset=0bv32, #t~malloc2!base=1bv32, #t~malloc2!offset=0bv32, ~a~0!base=2181570690bv32, ~a~0!offset=0bv32, ~p~0!base=1bv32, ~p~0!offset=0bv32, ~t~0!base=1bv32, ~t~0!offset=0bv32] [L632-L638] COND TRUE !(0bv32 != #t~nondet1) [L632] havoc #t~nondet1; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=2181570690bv32, #t~malloc0!offset=0bv32, #t~malloc2!base=1bv32, #t~malloc2!offset=0bv32, ~a~0!base=2181570690bv32, ~a~0!offset=0bv32, ~p~0!base=1bv32, ~p~0!offset=0bv32, ~t~0!base=1bv32, ~t~0!offset=0bv32] [L639] FCALL call write~intINTTYPE4(2bv32, { base: ~p~0!base, offset: ~p~0!offset }, 4bv32); [L640] FCALL call write~$Pointer$({ base: 0bv32, offset: 0bv32 }, { base: ~p~0!base, offset: ~bvadd32(4bv32, ~p~0!offset) }, 4bv32); [L641] ~p~0 := ~a~0; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=2181570690bv32, #t~malloc0!offset=0bv32, #t~malloc2!base=1bv32, #t~malloc2!offset=0bv32, ~a~0!base=2181570690bv32, ~a~0!offset=0bv32, ~p~0!base=2181570690bv32, ~p~0!offset=0bv32, ~t~0!base=1bv32, ~t~0!offset=0bv32] [L642-L647] COND FALSE !(!(~p~0 != { base: 0bv32, offset: 0bv32 })) [L643] FCALL call #t~mem4 := read~intINTTYPE4({ base: ~p~0!base, offset: ~p~0!offset }, 4bv32); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=2181570690bv32, #t~malloc0!offset=0bv32, #t~malloc2!base=1bv32, #t~malloc2!offset=0bv32, #t~mem4=1bv32, ~a~0!base=2181570690bv32, ~a~0!offset=0bv32, ~p~0!base=2181570690bv32, ~p~0!offset=0bv32, ~t~0!base=1bv32, ~t~0!offset=0bv32] [L643] COND TRUE 2bv32 != #t~mem4 [L643] havoc #t~mem4; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=2181570690bv32, #t~malloc0!offset=0bv32, #t~malloc2!base=1bv32, #t~malloc2!offset=0bv32, ~a~0!base=2181570690bv32, ~a~0!offset=0bv32, ~p~0!base=2181570690bv32, ~p~0!offset=0bv32, ~t~0!base=1bv32, ~t~0!offset=0bv32] [L644] assert false; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=2181570690bv32, #t~malloc0!offset=0bv32, #t~malloc2!base=1bv32, #t~malloc2!offset=0bv32, ~a~0!base=2181570690bv32, ~a~0!offset=0bv32, ~p~0!base=2181570690bv32, ~p~0!offset=0bv32, ~t~0!base=1bv32, ~t~0!offset=0bv32] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, old(#NULL!base)=0bv32, old(#NULL!offset)=0bv32] [?] #NULL := { base: 0bv32, offset: 0bv32 }; [?] #valid[0bv32] := 0bv1; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, old(#NULL!base)=0bv32, old(#NULL!offset)=0bv32] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32] [?] CALL call #t~ret6 := main(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32] [L627] FCALL call #t~malloc0 := #Ultimate.alloc(8bv32); [L627] ~a~0 := #t~malloc0; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=2181570690bv32, #t~malloc0!offset=0bv32, ~a~0!base=2181570690bv32, ~a~0!offset=0bv32] [L628] COND FALSE !(~a~0 == { base: 0bv32, offset: 0bv32 }) VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=2181570690bv32, #t~malloc0!offset=0bv32, ~a~0!base=2181570690bv32, ~a~0!offset=0bv32] [L629] havoc ~t~0; [L630] ~p~0 := ~a~0; [L631] FCALL call write~intINTTYPE4(2bv32, { base: ~a~0!base, offset: ~a~0!offset }, 4bv32); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=2181570690bv32, #t~malloc0!offset=0bv32, ~a~0!base=2181570690bv32, ~a~0!offset=0bv32, ~p~0!base=2181570690bv32, ~p~0!offset=0bv32] [L632-L638] COND FALSE !(!(0bv32 != #t~nondet1)) [L632] havoc #t~nondet1; [L633] FCALL call write~intINTTYPE4(1bv32, { base: ~p~0!base, offset: ~p~0!offset }, 4bv32); [L634] FCALL call #t~malloc2 := #Ultimate.alloc(8bv32); [L634] ~t~0 := #t~malloc2; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=2181570690bv32, #t~malloc0!offset=0bv32, #t~malloc2!base=1bv32, #t~malloc2!offset=0bv32, ~a~0!base=2181570690bv32, ~a~0!offset=0bv32, ~p~0!base=2181570690bv32, ~p~0!offset=0bv32, ~t~0!base=1bv32, ~t~0!offset=0bv32] [L635] COND FALSE !(~t~0 == { base: 0bv32, offset: 0bv32 }) VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=2181570690bv32, #t~malloc0!offset=0bv32, #t~malloc2!base=1bv32, #t~malloc2!offset=0bv32, ~a~0!base=2181570690bv32, ~a~0!offset=0bv32, ~p~0!base=2181570690bv32, ~p~0!offset=0bv32, ~t~0!base=1bv32, ~t~0!offset=0bv32] [L636] FCALL call write~$Pointer$(~t~0, { base: ~p~0!base, offset: ~bvadd32(4bv32, ~p~0!offset) }, 4bv32); [L637] FCALL call #t~mem3 := read~$Pointer$({ base: ~p~0!base, offset: ~bvadd32(4bv32, ~p~0!offset) }, 4bv32); [L637] ~p~0 := #t~mem3; [L637] havoc #t~mem3; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=2181570690bv32, #t~malloc0!offset=0bv32, #t~malloc2!base=1bv32, #t~malloc2!offset=0bv32, ~a~0!base=2181570690bv32, ~a~0!offset=0bv32, ~p~0!base=1bv32, ~p~0!offset=0bv32, ~t~0!base=1bv32, ~t~0!offset=0bv32] [L632-L638] COND TRUE !(0bv32 != #t~nondet1) [L632] havoc #t~nondet1; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=2181570690bv32, #t~malloc0!offset=0bv32, #t~malloc2!base=1bv32, #t~malloc2!offset=0bv32, ~a~0!base=2181570690bv32, ~a~0!offset=0bv32, ~p~0!base=1bv32, ~p~0!offset=0bv32, ~t~0!base=1bv32, ~t~0!offset=0bv32] [L639] FCALL call write~intINTTYPE4(2bv32, { base: ~p~0!base, offset: ~p~0!offset }, 4bv32); [L640] FCALL call write~$Pointer$({ base: 0bv32, offset: 0bv32 }, { base: ~p~0!base, offset: ~bvadd32(4bv32, ~p~0!offset) }, 4bv32); [L641] ~p~0 := ~a~0; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=2181570690bv32, #t~malloc0!offset=0bv32, #t~malloc2!base=1bv32, #t~malloc2!offset=0bv32, ~a~0!base=2181570690bv32, ~a~0!offset=0bv32, ~p~0!base=2181570690bv32, ~p~0!offset=0bv32, ~t~0!base=1bv32, ~t~0!offset=0bv32] [L642-L647] COND FALSE !(!(~p~0 != { base: 0bv32, offset: 0bv32 })) [L643] FCALL call #t~mem4 := read~intINTTYPE4({ base: ~p~0!base, offset: ~p~0!offset }, 4bv32); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=2181570690bv32, #t~malloc0!offset=0bv32, #t~malloc2!base=1bv32, #t~malloc2!offset=0bv32, #t~mem4=1bv32, ~a~0!base=2181570690bv32, ~a~0!offset=0bv32, ~p~0!base=2181570690bv32, ~p~0!offset=0bv32, ~t~0!base=1bv32, ~t~0!offset=0bv32] [L643] COND TRUE 2bv32 != #t~mem4 [L643] havoc #t~mem4; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=2181570690bv32, #t~malloc0!offset=0bv32, #t~malloc2!base=1bv32, #t~malloc2!offset=0bv32, ~a~0!base=2181570690bv32, ~a~0!offset=0bv32, ~p~0!base=2181570690bv32, ~p~0!offset=0bv32, ~t~0!base=1bv32, ~t~0!offset=0bv32] [L644] assert false; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=2181570690bv32, #t~malloc0!offset=0bv32, #t~malloc2!base=1bv32, #t~malloc2!offset=0bv32, ~a~0!base=2181570690bv32, ~a~0!offset=0bv32, ~p~0!base=2181570690bv32, ~p~0!offset=0bv32, ~t~0!base=1bv32, ~t~0!offset=0bv32] [L627] List a = (List) malloc(sizeof(struct node)); VAL [a={-2113396606:0}, malloc(sizeof(struct node))={-2113396606:0}] [L628] COND FALSE !(a == 0) VAL [a={-2113396606:0}, malloc(sizeof(struct node))={-2113396606:0}] [L629] List t; [L630] List p = a; [L631] a->h = 2 VAL [a={-2113396606:0}, malloc(sizeof(struct node))={-2113396606:0}, p={-2113396606:0}] [L632] COND TRUE __VERIFIER_nondet_int() [L633] p->h = 1 [L634] t = (List) malloc(sizeof(struct node)) VAL [a={-2113396606:0}, malloc(sizeof(struct node))={1:0}, malloc(sizeof(struct node))={-2113396606:0}, p={-2113396606:0}, t={1:0}] [L635] COND FALSE !(t == 0) VAL [a={-2113396606:0}, malloc(sizeof(struct node))={1:0}, malloc(sizeof(struct node))={-2113396606:0}, p={-2113396606:0}, t={1:0}] [L636] p->n = t [L637] EXPR p->n [L637] p = p->n [L632] COND FALSE !(__VERIFIER_nondet_int()) [L639] p->h = 2 [L640] p->n = 0 [L641] p = a VAL [a={-2113396606:0}, malloc(sizeof(struct node))={1:0}, malloc(sizeof(struct node))={-2113396606:0}, p={-2113396606:0}, t={1:0}] [L642] COND TRUE p!=0 [L643] EXPR p->h VAL [a={-2113396606:0}, malloc(sizeof(struct node))={1:0}, malloc(sizeof(struct node))={-2113396606:0}, p={-2113396606:0}, p->h=1, t={1:0}] [L643] COND TRUE p->h != 2 [L644] __VERIFIER_error() VAL [a={-2113396606:0}, malloc(sizeof(struct node))={1:0}, malloc(sizeof(struct node))={-2113396606:0}, p={-2113396606:0}, t={1:0}] ----- [2018-11-23 11:04:43,132 INFO L145 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/list-properties/simple_false-unreach-call_false-valid-memcleanup.i-witness.graphml [2018-11-23 11:04:43,132 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 11:04:43,137 INFO L168 Benchmark]: Toolchain (without parser) took 6657.29 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 716.2 MB). Free memory was 1.4 GB in the beginning and 1.8 GB in the end (delta: -427.7 MB). Peak memory consumption was 288.5 MB. Max. memory is 7.1 GB. [2018-11-23 11:04:43,139 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 11:04:43,144 INFO L168 Benchmark]: CACSL2BoogieTranslator took 583.82 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-11-23 11:04:43,145 INFO L168 Benchmark]: Boogie Procedure Inliner took 119.23 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 716.2 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -807.6 MB). Peak memory consumption was 27.0 MB. Max. memory is 7.1 GB. [2018-11-23 11:04:43,146 INFO L168 Benchmark]: Boogie Preprocessor took 53.91 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 13.3 MB). Peak memory consumption was 13.3 MB. Max. memory is 7.1 GB. [2018-11-23 11:04:43,150 INFO L168 Benchmark]: RCFGBuilder took 713.84 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 23.9 MB). Peak memory consumption was 23.9 MB. Max. memory is 7.1 GB. [2018-11-23 11:04:43,150 INFO L168 Benchmark]: TraceAbstraction took 5053.77 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 297.7 MB). Peak memory consumption was 297.7 MB. Max. memory is 7.1 GB. [2018-11-23 11:04:43,151 INFO L168 Benchmark]: Witness Printer took 123.71 ms. Allocated memory is still 2.2 GB. Free memory was 1.9 GB in the beginning and 1.8 GB in the end (delta: 13.3 MB). Peak memory consumption was 13.3 MB. Max. memory is 7.1 GB. [2018-11-23 11:04:43,162 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - GenericResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 583.82 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 119.23 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 716.2 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -807.6 MB). Peak memory consumption was 27.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 53.91 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 13.3 MB). Peak memory consumption was 13.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 713.84 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 23.9 MB). Peak memory consumption was 23.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 5053.77 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 297.7 MB). Peak memory consumption was 297.7 MB. Max. memory is 7.1 GB. * Witness Printer took 123.71 ms. Allocated memory is still 2.2 GB. Free memory was 1.9 GB in the beginning and 1.8 GB in the end (delta: 13.3 MB). Peak memory consumption was 13.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 644]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L627] List a = (List) malloc(sizeof(struct node)); VAL [a={-2113396606:0}, malloc(sizeof(struct node))={-2113396606:0}] [L628] COND FALSE !(a == 0) VAL [a={-2113396606:0}, malloc(sizeof(struct node))={-2113396606:0}] [L629] List t; [L630] List p = a; [L631] a->h = 2 VAL [a={-2113396606:0}, malloc(sizeof(struct node))={-2113396606:0}, p={-2113396606:0}] [L632] COND TRUE __VERIFIER_nondet_int() [L633] p->h = 1 [L634] t = (List) malloc(sizeof(struct node)) VAL [a={-2113396606:0}, malloc(sizeof(struct node))={1:0}, malloc(sizeof(struct node))={-2113396606:0}, p={-2113396606:0}, t={1:0}] [L635] COND FALSE !(t == 0) VAL [a={-2113396606:0}, malloc(sizeof(struct node))={1:0}, malloc(sizeof(struct node))={-2113396606:0}, p={-2113396606:0}, t={1:0}] [L636] p->n = t [L637] EXPR p->n [L637] p = p->n [L632] COND FALSE !(__VERIFIER_nondet_int()) [L639] p->h = 2 [L640] p->n = 0 [L641] p = a VAL [a={-2113396606:0}, malloc(sizeof(struct node))={1:0}, malloc(sizeof(struct node))={-2113396606:0}, p={-2113396606:0}, t={1:0}] [L642] COND TRUE p!=0 [L643] EXPR p->h VAL [a={-2113396606:0}, malloc(sizeof(struct node))={1:0}, malloc(sizeof(struct node))={-2113396606:0}, p={-2113396606:0}, p->h=1, t={1:0}] [L643] COND TRUE p->h != 2 [L644] __VERIFIER_error() VAL [a={-2113396606:0}, malloc(sizeof(struct node))={1:0}, malloc(sizeof(struct node))={-2113396606:0}, p={-2113396606:0}, t={1:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 28 locations, 1 error locations. UNSAFE Result, 4.9s OverallTime, 4 OverallIterations, 2 TraceHistogramMax, 2.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 52 SDtfs, 58 SDslu, 71 SDs, 0 SdLazy, 59 SolverSat, 19 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 59 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=26occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 15 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 58 NumberOfCodeBlocks, 58 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 54 ConstructedInterpolants, 0 QuantifiedInterpolants, 3435 SizeOfPredicates, 15 NumberOfNonLiveVariables, 155 ConjunctsInSsa, 23 ConjunctsInUnsatCore, 4 InterpolantComputations, 2 PerfectInterpolantSequences, 2/4 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...