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-ext2-properties/simple_and_skiplist_2lvl_false-unreach-call.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 11:10:07,909 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 11:10:07,911 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 11:10:07,927 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 11:10:07,928 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 11:10:07,929 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 11:10:07,931 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 11:10:07,933 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 11:10:07,935 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 11:10:07,936 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 11:10:07,946 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 11:10:07,946 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 11:10:07,949 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 11:10:07,950 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 11:10:07,955 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 11:10:07,956 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 11:10:07,957 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 11:10:07,958 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 11:10:07,964 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 11:10:07,965 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 11:10:07,966 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 11:10:07,968 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 11:10:07,970 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 11:10:07,970 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 11:10:07,970 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 11:10:07,971 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 11:10:07,972 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 11:10:07,973 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 11:10:07,973 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 11:10:07,975 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 11:10:07,975 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 11:10:07,976 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 11:10:07,976 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 11:10:07,976 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 11:10:07,978 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 11:10:07,979 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 11:10:07,979 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:10:08,008 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 11:10:08,009 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 11:10:08,010 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 11:10:08,010 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 11:10:08,010 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 11:10:08,014 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 11:10:08,014 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 11:10:08,014 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 11:10:08,015 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 11:10:08,015 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 11:10:08,015 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 11:10:08,015 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 11:10:08,015 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 11:10:08,015 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 11:10:08,016 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 11:10:08,016 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 11:10:08,016 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 11:10:08,016 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 11:10:08,016 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 11:10:08,018 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 11:10:08,018 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 11:10:08,018 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 11:10:08,018 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 11:10:08,019 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 11:10:08,019 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 11:10:08,019 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 11:10:08,019 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 11:10:08,019 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 11:10:08,020 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-23 11:10:08,020 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 11:10:08,020 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 11:10:08,020 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 11:10:08,020 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 11:10:08,084 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 11:10:08,098 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 11:10:08,103 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 11:10:08,104 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 11:10:08,105 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 11:10:08,105 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-ext2-properties/simple_and_skiplist_2lvl_false-unreach-call.i [2018-11-23 11:10:08,166 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a4770d199/e562643f0b9048738ac9d1c26575a4ce/FLAGef2b73ae9 [2018-11-23 11:10:08,657 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 11:10:08,658 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-ext2-properties/simple_and_skiplist_2lvl_false-unreach-call.i [2018-11-23 11:10:08,672 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a4770d199/e562643f0b9048738ac9d1c26575a4ce/FLAGef2b73ae9 [2018-11-23 11:10:08,963 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a4770d199/e562643f0b9048738ac9d1c26575a4ce [2018-11-23 11:10:08,975 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 11:10:08,976 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 11:10:08,977 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 11:10:08,977 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 11:10:08,981 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 11:10:08,983 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:10:08" (1/1) ... [2018-11-23 11:10:08,986 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@34ce0df9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:10:08, skipping insertion in model container [2018-11-23 11:10:08,986 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:10:08" (1/1) ... [2018-11-23 11:10:08,999 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 11:10:09,071 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 11:10:09,524 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:10:09,541 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 11:10:09,736 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:10:09,815 INFO L195 MainTranslator]: Completed translation [2018-11-23 11:10:09,816 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:10:09 WrapperNode [2018-11-23 11:10:09,816 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 11:10:09,817 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 11:10:09,817 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 11:10:09,817 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 11:10:09,827 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:10:09" (1/1) ... [2018-11-23 11:10:09,850 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:10:09" (1/1) ... [2018-11-23 11:10:09,860 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 11:10:09,860 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 11:10:09,860 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 11:10:09,860 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 11:10:09,869 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:10:09" (1/1) ... [2018-11-23 11:10:09,869 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:10:09" (1/1) ... [2018-11-23 11:10:09,875 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:10:09" (1/1) ... [2018-11-23 11:10:09,875 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:10:09" (1/1) ... [2018-11-23 11:10:09,914 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:10:09" (1/1) ... [2018-11-23 11:10:09,922 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:10:09" (1/1) ... [2018-11-23 11:10:09,925 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:10:09" (1/1) ... [2018-11-23 11:10:09,931 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 11:10:09,932 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 11:10:09,933 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 11:10:09,933 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 11:10:09,936 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:10:09" (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:10:10,003 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 11:10:10,003 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-23 11:10:10,004 INFO L130 BoogieDeclarations]: Found specification of procedure sl_random_insert [2018-11-23 11:10:10,004 INFO L138 BoogieDeclarations]: Found implementation of procedure sl_random_insert [2018-11-23 11:10:10,005 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-23 11:10:10,005 INFO L138 BoogieDeclarations]: Found implementation of procedure exit [2018-11-23 11:10:10,005 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 11:10:10,005 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 11:10:10,005 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 11:10:10,005 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 11:10:10,007 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-23 11:10:10,007 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-23 11:10:10,007 INFO L130 BoogieDeclarations]: Found specification of procedure create_sl_with_head_and_tail [2018-11-23 11:10:10,007 INFO L138 BoogieDeclarations]: Found implementation of procedure create_sl_with_head_and_tail [2018-11-23 11:10:10,008 INFO L130 BoogieDeclarations]: Found specification of procedure destroy_sl [2018-11-23 11:10:10,008 INFO L138 BoogieDeclarations]: Found implementation of procedure destroy_sl [2018-11-23 11:10:10,010 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-23 11:10:10,010 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 11:10:10,010 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 11:10:10,010 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 11:10:13,457 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 11:10:13,457 INFO L280 CfgBuilder]: Removed 6 assue(true) statements. [2018-11-23 11:10:13,458 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:10:13 BoogieIcfgContainer [2018-11-23 11:10:13,458 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 11:10:13,459 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 11:10:13,459 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 11:10:13,463 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 11:10:13,463 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 11:10:08" (1/3) ... [2018-11-23 11:10:13,464 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@290a338b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:10:13, skipping insertion in model container [2018-11-23 11:10:13,464 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:10:09" (2/3) ... [2018-11-23 11:10:13,464 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@290a338b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:10:13, skipping insertion in model container [2018-11-23 11:10:13,465 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:10:13" (3/3) ... [2018-11-23 11:10:13,467 INFO L112 eAbstractionObserver]: Analyzing ICFG simple_and_skiplist_2lvl_false-unreach-call.i [2018-11-23 11:10:13,477 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 11:10:13,487 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 11:10:13,505 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 11:10:13,540 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 11:10:13,541 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 11:10:13,541 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 11:10:13,541 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 11:10:13,541 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 11:10:13,541 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 11:10:13,542 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 11:10:13,542 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 11:10:13,542 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 11:10:13,559 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states. [2018-11-23 11:10:13,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-23 11:10:13,566 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:10:13,567 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:10:13,570 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:10:13,574 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:10:13,575 INFO L82 PathProgramCache]: Analyzing trace with hash -2136685355, now seen corresponding path program 1 times [2018-11-23 11:10:13,579 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:10:13,579 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:10:13,598 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:10:13,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:10:13,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:10:13,687 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:10:13,948 INFO L256 TraceCheckUtils]: 0: Hoare triple {53#true} call ULTIMATE.init(); {53#true} is VALID [2018-11-23 11:10:13,951 INFO L273 TraceCheckUtils]: 1: Hoare triple {53#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {53#true} is VALID [2018-11-23 11:10:13,952 INFO L273 TraceCheckUtils]: 2: Hoare triple {53#true} assume true; {53#true} is VALID [2018-11-23 11:10:13,952 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {53#true} {53#true} #145#return; {53#true} is VALID [2018-11-23 11:10:13,953 INFO L256 TraceCheckUtils]: 4: Hoare triple {53#true} call #t~ret36 := main(); {53#true} is VALID [2018-11-23 11:10:13,953 INFO L273 TraceCheckUtils]: 5: Hoare triple {53#true} call #t~malloc28.base, #t~malloc28.offset := #Ultimate.alloc(8bv32);~a~0.base, ~a~0.offset := #t~malloc28.base, #t~malloc28.offset; {53#true} is VALID [2018-11-23 11:10:13,953 INFO L273 TraceCheckUtils]: 6: Hoare triple {53#true} assume !(~a~0.base == 0bv32 && ~a~0.offset == 0bv32); {53#true} is VALID [2018-11-23 11:10:13,954 INFO L273 TraceCheckUtils]: 7: Hoare triple {53#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); {53#true} is VALID [2018-11-23 11:10:13,971 INFO L273 TraceCheckUtils]: 8: Hoare triple {53#true} assume !true; {54#false} is VALID [2018-11-23 11:10:13,972 INFO L273 TraceCheckUtils]: 9: Hoare triple {54#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; {54#false} is VALID [2018-11-23 11:10:13,972 INFO L273 TraceCheckUtils]: 10: Hoare triple {54#false} assume !!(~p~0.base != 0bv32 || ~p~0.offset != 0bv32);call #t~mem32 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {54#false} is VALID [2018-11-23 11:10:13,972 INFO L273 TraceCheckUtils]: 11: Hoare triple {54#false} assume 2bv32 != #t~mem32;havoc #t~mem32; {54#false} is VALID [2018-11-23 11:10:13,973 INFO L273 TraceCheckUtils]: 12: Hoare triple {54#false} assume !false; {54#false} is VALID [2018-11-23 11:10:13,977 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:10:13,978 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:10:13,984 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:10:13,984 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 11:10:13,990 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 13 [2018-11-23 11:10:13,993 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:10:13,997 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 11:10:14,058 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:10:14,058 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 11:10:14,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 11:10:14,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 11:10:14,072 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 2 states. [2018-11-23 11:10:16,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:10:16,472 INFO L93 Difference]: Finished difference Result 85 states and 113 transitions. [2018-11-23 11:10:16,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 11:10:16,473 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 13 [2018-11-23 11:10:16,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:10:16,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 11:10:16,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 113 transitions. [2018-11-23 11:10:16,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 11:10:16,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 113 transitions. [2018-11-23 11:10:16,494 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 113 transitions. [2018-11-23 11:10:17,152 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 113 edges. 113 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:10:17,164 INFO L225 Difference]: With dead ends: 85 [2018-11-23 11:10:17,165 INFO L226 Difference]: Without dead ends: 17 [2018-11-23 11:10:17,169 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:10:17,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-11-23 11:10:17,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-11-23 11:10:17,276 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:10:17,276 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand 17 states. [2018-11-23 11:10:17,277 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand 17 states. [2018-11-23 11:10:17,277 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 17 states. [2018-11-23 11:10:17,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:10:17,281 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2018-11-23 11:10:17,281 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2018-11-23 11:10:17,282 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:10:17,282 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:10:17,282 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand 17 states. [2018-11-23 11:10:17,283 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 17 states. [2018-11-23 11:10:17,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:10:17,286 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2018-11-23 11:10:17,286 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2018-11-23 11:10:17,286 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:10:17,287 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:10:17,287 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:10:17,287 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:10:17,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 11:10:17,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2018-11-23 11:10:17,291 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 13 [2018-11-23 11:10:17,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:10:17,292 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2018-11-23 11:10:17,292 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 11:10:17,292 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2018-11-23 11:10:17,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-23 11:10:17,293 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:10:17,293 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:10:17,293 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:10:17,294 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:10:17,294 INFO L82 PathProgramCache]: Analyzing trace with hash 2147199689, now seen corresponding path program 1 times [2018-11-23 11:10:17,295 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:10:17,295 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:10:17,324 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:10:17,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:10:17,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:10:17,403 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:10:17,653 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:10:17,659 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:10:17,684 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:10:17,692 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 11:10:17,695 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:10:17,703 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:10:17,710 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:10:17,711 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:22, output treesize:11 [2018-11-23 11:10:17,866 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:10:17,904 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:10:17,906 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:10:17,910 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:10:17,914 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:10:17,914 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-11-23 11:10:17,917 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:10:17,918 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 (= |main_#t~mem32| .cse0) (= (bvadd .cse0 (_ bv4294967294 32)) (_ bv0 32)))) [2018-11-23 11:10:17,919 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (= (bvadd |main_#t~mem32| (_ bv4294967294 32)) (_ bv0 32)) [2018-11-23 11:10:17,956 INFO L256 TraceCheckUtils]: 0: Hoare triple {266#true} call ULTIMATE.init(); {266#true} is VALID [2018-11-23 11:10:17,956 INFO L273 TraceCheckUtils]: 1: Hoare triple {266#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {266#true} is VALID [2018-11-23 11:10:17,957 INFO L273 TraceCheckUtils]: 2: Hoare triple {266#true} assume true; {266#true} is VALID [2018-11-23 11:10:17,957 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {266#true} {266#true} #145#return; {266#true} is VALID [2018-11-23 11:10:17,957 INFO L256 TraceCheckUtils]: 4: Hoare triple {266#true} call #t~ret36 := main(); {266#true} is VALID [2018-11-23 11:10:17,958 INFO L273 TraceCheckUtils]: 5: Hoare triple {266#true} call #t~malloc28.base, #t~malloc28.offset := #Ultimate.alloc(8bv32);~a~0.base, ~a~0.offset := #t~malloc28.base, #t~malloc28.offset; {286#(= main_~a~0.offset (_ bv0 32))} is VALID [2018-11-23 11:10:17,958 INFO L273 TraceCheckUtils]: 6: Hoare triple {286#(= main_~a~0.offset (_ bv0 32))} assume !(~a~0.base == 0bv32 && ~a~0.offset == 0bv32); {286#(= main_~a~0.offset (_ bv0 32))} is VALID [2018-11-23 11:10:17,959 INFO L273 TraceCheckUtils]: 7: Hoare triple {286#(= 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); {293#(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:10:17,979 INFO L273 TraceCheckUtils]: 8: Hoare triple {293#(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~nondet29);havoc #t~nondet29; {293#(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:10:17,993 INFO L273 TraceCheckUtils]: 9: Hoare triple {293#(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; {300#(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:10:17,999 INFO L273 TraceCheckUtils]: 10: Hoare triple {300#(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~mem32 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {304#(= (bvadd |main_#t~mem32| (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 11:10:18,001 INFO L273 TraceCheckUtils]: 11: Hoare triple {304#(= (bvadd |main_#t~mem32| (_ bv4294967294 32)) (_ bv0 32))} assume 2bv32 != #t~mem32;havoc #t~mem32; {267#false} is VALID [2018-11-23 11:10:18,001 INFO L273 TraceCheckUtils]: 12: Hoare triple {267#false} assume !false; {267#false} is VALID [2018-11-23 11:10:18,003 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:10:18,004 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:10:18,007 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:10:18,007 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-23 11:10:18,009 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2018-11-23 11:10:18,010 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:10:18,010 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 11:10:18,050 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:10:18,051 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 11:10:18,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 11:10:18,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-23 11:10:18,052 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand 6 states. [2018-11-23 11:10:18,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:10:18,880 INFO L93 Difference]: Finished difference Result 31 states and 33 transitions. [2018-11-23 11:10:18,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 11:10:18,880 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2018-11-23 11:10:18,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:10:18,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 11:10:18,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 33 transitions. [2018-11-23 11:10:18,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 11:10:18,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 33 transitions. [2018-11-23 11:10:18,885 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 33 transitions. [2018-11-23 11:10:18,940 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:10:18,942 INFO L225 Difference]: With dead ends: 31 [2018-11-23 11:10:18,943 INFO L226 Difference]: Without dead ends: 29 [2018-11-23 11:10:18,943 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:10:18,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-11-23 11:10:18,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 21. [2018-11-23 11:10:18,965 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:10:18,965 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand 21 states. [2018-11-23 11:10:18,965 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 21 states. [2018-11-23 11:10:18,965 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 21 states. [2018-11-23 11:10:18,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:10:18,968 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2018-11-23 11:10:18,968 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2018-11-23 11:10:18,969 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:10:18,969 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:10:18,969 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 29 states. [2018-11-23 11:10:18,970 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 29 states. [2018-11-23 11:10:18,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:10:18,972 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2018-11-23 11:10:18,972 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2018-11-23 11:10:18,973 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:10:18,973 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:10:18,973 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:10:18,973 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:10:18,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-23 11:10:18,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2018-11-23 11:10:18,975 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 13 [2018-11-23 11:10:18,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:10:18,976 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2018-11-23 11:10:18,976 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 11:10:18,976 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2018-11-23 11:10:18,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-23 11:10:18,977 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:10:18,977 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:10:18,977 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:10:18,977 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:10:18,977 INFO L82 PathProgramCache]: Analyzing trace with hash -2012129499, now seen corresponding path program 1 times [2018-11-23 11:10:18,978 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:10:18,978 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:10:18,994 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:10:19,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:10:19,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:10:19,045 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:10:19,144 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:10:19,148 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:10:19,156 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:10:19,159 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:10:19,174 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:10:19,180 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:10:19,185 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 11:10:19,188 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:10:19,200 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:10:19,200 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:26, output treesize:18 [2018-11-23 11:10:19,354 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:10:19,429 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:10:19,446 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:10:19,449 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:10:19,463 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:10:19,469 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:10:19,471 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 11:10:19,473 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:10:19,479 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:10:19,479 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:29, output treesize:7 [2018-11-23 11:10:19,486 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:10:19,486 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:10:19,486 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= main_~p~0.offset (_ bv0 32)) (= (_ bv0 32) main_~p~0.base)) [2018-11-23 11:10:19,523 INFO L256 TraceCheckUtils]: 0: Hoare triple {441#true} call ULTIMATE.init(); {441#true} is VALID [2018-11-23 11:10:19,523 INFO L273 TraceCheckUtils]: 1: Hoare triple {441#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {441#true} is VALID [2018-11-23 11:10:19,524 INFO L273 TraceCheckUtils]: 2: Hoare triple {441#true} assume true; {441#true} is VALID [2018-11-23 11:10:19,524 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {441#true} {441#true} #145#return; {441#true} is VALID [2018-11-23 11:10:19,524 INFO L256 TraceCheckUtils]: 4: Hoare triple {441#true} call #t~ret36 := main(); {441#true} is VALID [2018-11-23 11:10:19,525 INFO L273 TraceCheckUtils]: 5: Hoare triple {441#true} call #t~malloc28.base, #t~malloc28.offset := #Ultimate.alloc(8bv32);~a~0.base, ~a~0.offset := #t~malloc28.base, #t~malloc28.offset; {461#(= main_~a~0.offset (_ bv0 32))} is VALID [2018-11-23 11:10:19,526 INFO L273 TraceCheckUtils]: 6: Hoare triple {461#(= main_~a~0.offset (_ bv0 32))} assume !(~a~0.base == 0bv32 && ~a~0.offset == 0bv32); {461#(= main_~a~0.offset (_ bv0 32))} is VALID [2018-11-23 11:10:19,526 INFO L273 TraceCheckUtils]: 7: Hoare triple {461#(= 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); {468#(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:10:19,528 INFO L273 TraceCheckUtils]: 8: Hoare triple {468#(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~nondet29);havoc #t~nondet29; {468#(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:10:19,530 INFO L273 TraceCheckUtils]: 9: Hoare triple {468#(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; {475#(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:10:19,532 INFO L273 TraceCheckUtils]: 10: Hoare triple {475#(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~mem32 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {475#(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:10:19,533 INFO L273 TraceCheckUtils]: 11: Hoare triple {475#(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~mem32);havoc #t~mem32; {475#(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:10:19,535 INFO L273 TraceCheckUtils]: 12: Hoare triple {475#(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~mem33.base, #t~mem33.offset := read~$Pointer$(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~p~0.base, ~p~0.offset := #t~mem33.base, #t~mem33.offset;havoc #t~mem33.base, #t~mem33.offset; {485#(and (= main_~p~0.offset (_ bv0 32)) (= (_ bv0 32) main_~p~0.base))} is VALID [2018-11-23 11:10:19,545 INFO L273 TraceCheckUtils]: 13: Hoare triple {485#(and (= main_~p~0.offset (_ bv0 32)) (= (_ bv0 32) main_~p~0.base))} assume !!(~p~0.base != 0bv32 || ~p~0.offset != 0bv32);call #t~mem32 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {442#false} is VALID [2018-11-23 11:10:19,545 INFO L273 TraceCheckUtils]: 14: Hoare triple {442#false} assume 2bv32 != #t~mem32;havoc #t~mem32; {442#false} is VALID [2018-11-23 11:10:19,546 INFO L273 TraceCheckUtils]: 15: Hoare triple {442#false} assume !false; {442#false} is VALID [2018-11-23 11:10:19,547 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:10:19,547 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:10:19,924 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:10:19,930 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:10:19,932 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:10:19,934 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:10:19,939 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:10:19,950 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:10:19,952 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 11:10:19,955 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:10:19,984 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 11:10:19,985 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:39, output treesize:7 [2018-11-23 11:10:19,999 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:10:19,999 WARN L384 uantifierElimination]: Input elimination task: ∀ [|v_#memory_$Pointer$.base_41|, |v_#memory_$Pointer$.offset_41|]. (let ((.cse0 (bvadd main_~p~0.offset (_ bv4 32))) (.cse1 (bvadd main_~a~0.offset (_ bv4 32)))) (and (= (select (select (store |v_#memory_$Pointer$.base_41| main_~p~0.base (store (select |v_#memory_$Pointer$.base_41| main_~p~0.base) .cse0 (_ bv0 32))) main_~a~0.base) .cse1) (_ bv0 32)) (= (_ bv0 32) (select (select (store |v_#memory_$Pointer$.offset_41| main_~p~0.base (store (select |v_#memory_$Pointer$.offset_41| main_~p~0.base) .cse0 (_ bv0 32))) main_~a~0.base) .cse1)))) [2018-11-23 11:10:20,000 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:10:20,041 INFO L273 TraceCheckUtils]: 15: Hoare triple {442#false} assume !false; {442#false} is VALID [2018-11-23 11:10:20,041 INFO L273 TraceCheckUtils]: 14: Hoare triple {442#false} assume 2bv32 != #t~mem32;havoc #t~mem32; {442#false} is VALID [2018-11-23 11:10:20,043 INFO L273 TraceCheckUtils]: 13: Hoare triple {485#(and (= main_~p~0.offset (_ bv0 32)) (= (_ bv0 32) main_~p~0.base))} assume !!(~p~0.base != 0bv32 || ~p~0.offset != 0bv32);call #t~mem32 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {442#false} is VALID [2018-11-23 11:10:20,062 INFO L273 TraceCheckUtils]: 12: Hoare triple {504#(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~mem33.base, #t~mem33.offset := read~$Pointer$(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~p~0.base, ~p~0.offset := #t~mem33.base, #t~mem33.offset;havoc #t~mem33.base, #t~mem33.offset; {485#(and (= main_~p~0.offset (_ bv0 32)) (= (_ bv0 32) main_~p~0.base))} is VALID [2018-11-23 11:10:20,081 INFO L273 TraceCheckUtils]: 11: Hoare triple {504#(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~mem32);havoc #t~mem32; {504#(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:10:20,096 INFO L273 TraceCheckUtils]: 10: Hoare triple {504#(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~mem32 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {504#(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:10:20,111 INFO L273 TraceCheckUtils]: 9: Hoare triple {514#(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; {504#(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:10:20,125 INFO L273 TraceCheckUtils]: 8: Hoare triple {514#(and (= main_~p~0.base main_~a~0.base) (= main_~p~0.offset main_~a~0.offset))} assume !(0bv32 != #t~nondet29);havoc #t~nondet29; {514#(and (= main_~p~0.base main_~a~0.base) (= main_~p~0.offset main_~a~0.offset))} is VALID [2018-11-23 11:10:20,134 INFO L273 TraceCheckUtils]: 7: Hoare triple {441#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); {514#(and (= main_~p~0.base main_~a~0.base) (= main_~p~0.offset main_~a~0.offset))} is VALID [2018-11-23 11:10:20,135 INFO L273 TraceCheckUtils]: 6: Hoare triple {441#true} assume !(~a~0.base == 0bv32 && ~a~0.offset == 0bv32); {441#true} is VALID [2018-11-23 11:10:20,135 INFO L273 TraceCheckUtils]: 5: Hoare triple {441#true} call #t~malloc28.base, #t~malloc28.offset := #Ultimate.alloc(8bv32);~a~0.base, ~a~0.offset := #t~malloc28.base, #t~malloc28.offset; {441#true} is VALID [2018-11-23 11:10:20,136 INFO L256 TraceCheckUtils]: 4: Hoare triple {441#true} call #t~ret36 := main(); {441#true} is VALID [2018-11-23 11:10:20,136 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {441#true} {441#true} #145#return; {441#true} is VALID [2018-11-23 11:10:20,136 INFO L273 TraceCheckUtils]: 2: Hoare triple {441#true} assume true; {441#true} is VALID [2018-11-23 11:10:20,137 INFO L273 TraceCheckUtils]: 1: Hoare triple {441#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {441#true} is VALID [2018-11-23 11:10:20,137 INFO L256 TraceCheckUtils]: 0: Hoare triple {441#true} call ULTIMATE.init(); {441#true} is VALID [2018-11-23 11:10:20,139 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:10:20,141 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:10:20,141 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 8 [2018-11-23 11:10:20,142 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-11-23 11:10:20,142 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:10:20,144 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-23 11:10:20,211 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:10:20,212 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 11:10:20,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 11:10:20,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-11-23 11:10:20,213 INFO L87 Difference]: Start difference. First operand 21 states and 23 transitions. Second operand 8 states. [2018-11-23 11:10:20,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:10:20,889 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2018-11-23 11:10:20,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 11:10:20,890 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-11-23 11:10:20,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:10:20,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 11:10:20,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 37 transitions. [2018-11-23 11:10:20,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 11:10:20,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 37 transitions. [2018-11-23 11:10:20,894 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 37 transitions. [2018-11-23 11:10:20,982 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:10:20,983 INFO L225 Difference]: With dead ends: 35 [2018-11-23 11:10:20,983 INFO L226 Difference]: Without dead ends: 25 [2018-11-23 11:10:20,984 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:10:20,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-11-23 11:10:20,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 18. [2018-11-23 11:10:20,997 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:10:20,997 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand 18 states. [2018-11-23 11:10:20,997 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 18 states. [2018-11-23 11:10:20,998 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 18 states. [2018-11-23 11:10:21,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:10:21,000 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2018-11-23 11:10:21,000 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2018-11-23 11:10:21,001 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:10:21,001 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:10:21,001 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand 25 states. [2018-11-23 11:10:21,001 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 25 states. [2018-11-23 11:10:21,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:10:21,005 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2018-11-23 11:10:21,005 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2018-11-23 11:10:21,005 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:10:21,005 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:10:21,006 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:10:21,006 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:10:21,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 11:10:21,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2018-11-23 11:10:21,008 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 16 [2018-11-23 11:10:21,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:10:21,008 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2018-11-23 11:10:21,008 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 11:10:21,008 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2018-11-23 11:10:21,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-23 11:10:21,009 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:10:21,009 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:10:21,009 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:10:21,010 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:10:21,010 INFO L82 PathProgramCache]: Analyzing trace with hash 42062238, now seen corresponding path program 1 times [2018-11-23 11:10:21,010 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:10:21,010 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:10:21,026 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:10:21,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 11:10:21,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 11:10:21,210 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 #145#return; VAL [|#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32)] [?] CALL call #t~ret36 := main(); VAL [|#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32)] [?] call #t~malloc28.base, #t~malloc28.offset := #Ultimate.alloc(8bv32);~a~0.base, ~a~0.offset := #t~malloc28.base, #t~malloc28.offset; VAL [main_~a~0.base=(_ bv2181570690 32), main_~a~0.offset=(_ bv0 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_#t~malloc28.base|=(_ bv2181570690 32), |main_#t~malloc28.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~malloc28.base|=(_ bv2181570690 32), |main_#t~malloc28.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~malloc28.base|=(_ bv2181570690 32), |main_#t~malloc28.offset|=(_ bv0 32)] [?] assume !!(0bv32 != #t~nondet29);havoc #t~nondet29;call write~intINTTYPE4(1bv32, ~p~0.base, ~p~0.offset, 4bv32);call #t~malloc30.base, #t~malloc30.offset := #Ultimate.alloc(8bv32);~t~0.base, ~t~0.offset := #t~malloc30.base, #t~malloc30.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~malloc28.base|=(_ bv2181570690 32), |main_#t~malloc28.offset|=(_ bv0 32), |main_#t~malloc30.base|=(_ bv1 32), |main_#t~malloc30.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~malloc28.base|=(_ bv2181570690 32), |main_#t~malloc28.offset|=(_ bv0 32), |main_#t~malloc30.base|=(_ bv1 32), |main_#t~malloc30.offset|=(_ bv0 32)] [?] call write~$Pointer$(~t~0.base, ~t~0.offset, ~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);call #t~mem31.base, #t~mem31.offset := read~$Pointer$(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~p~0.base, ~p~0.offset := #t~mem31.base, #t~mem31.offset;havoc #t~mem31.base, #t~mem31.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~malloc28.base|=(_ bv2181570690 32), |main_#t~malloc28.offset|=(_ bv0 32), |main_#t~malloc30.base|=(_ bv1 32), |main_#t~malloc30.offset|=(_ bv0 32)] [?] assume !(0bv32 != #t~nondet29);havoc #t~nondet29; 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~malloc28.base|=(_ bv2181570690 32), |main_#t~malloc28.offset|=(_ bv0 32), |main_#t~malloc30.base|=(_ bv1 32), |main_#t~malloc30.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~malloc28.base|=(_ bv2181570690 32), |main_#t~malloc28.offset|=(_ bv0 32), |main_#t~malloc30.base|=(_ bv1 32), |main_#t~malloc30.offset|=(_ bv0 32)] [?] assume !!(~p~0.base != 0bv32 || ~p~0.offset != 0bv32);call #t~mem32 := 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~malloc28.base|=(_ bv2181570690 32), |main_#t~malloc28.offset|=(_ bv0 32), |main_#t~malloc30.base|=(_ bv1 32), |main_#t~malloc30.offset|=(_ bv0 32), |main_#t~mem32|=(_ bv1 32)] [?] assume 2bv32 != #t~mem32;havoc #t~mem32; 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~malloc28.base|=(_ bv2181570690 32), |main_#t~malloc28.offset|=(_ bv0 32), |main_#t~malloc30.base|=(_ bv1 32), |main_#t~malloc30.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~malloc28.base|=(_ bv2181570690 32), |main_#t~malloc28.offset|=(_ bv0 32), |main_#t~malloc30.base|=(_ bv1 32), |main_#t~malloc30.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~ret36 := main(); VAL [#NULL.base=0bv32, #NULL.offset=0bv32] [L585] call #t~malloc28.base, #t~malloc28.offset := #Ultimate.alloc(8bv32); [L585] ~a~0.base, ~a~0.offset := #t~malloc28.base, #t~malloc28.offset; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc28.base=2181570690bv32, #t~malloc28.offset=0bv32, ~a~0.base=2181570690bv32, ~a~0.offset=0bv32] [L586] assume !(~a~0.base == 0bv32 && ~a~0.offset == 0bv32); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc28.base=2181570690bv32, #t~malloc28.offset=0bv32, ~a~0.base=2181570690bv32, ~a~0.offset=0bv32] [L587] havoc ~t~0.base, ~t~0.offset; [L588] ~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; [L589] call write~intINTTYPE4(2bv32, ~a~0.base, ~a~0.offset, 4bv32); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc28.base=2181570690bv32, #t~malloc28.offset=0bv32, ~a~0.base=2181570690bv32, ~a~0.offset=0bv32, ~p~0.base=2181570690bv32, ~p~0.offset=0bv32] [L590-L596] assume !!(0bv32 != #t~nondet29); [L590] havoc #t~nondet29; [L591] call write~intINTTYPE4(1bv32, ~p~0.base, ~p~0.offset, 4bv32); [L592] call #t~malloc30.base, #t~malloc30.offset := #Ultimate.alloc(8bv32); [L592] ~t~0.base, ~t~0.offset := #t~malloc30.base, #t~malloc30.offset; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc28.base=2181570690bv32, #t~malloc28.offset=0bv32, #t~malloc30.base=1bv32, #t~malloc30.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] [L593] assume !(~t~0.base == 0bv32 && ~t~0.offset == 0bv32); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc28.base=2181570690bv32, #t~malloc28.offset=0bv32, #t~malloc30.base=1bv32, #t~malloc30.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] [L594] call write~$Pointer$(~t~0.base, ~t~0.offset, ~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32); [L595] call #t~mem31.base, #t~mem31.offset := read~$Pointer$(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32); [L595] ~p~0.base, ~p~0.offset := #t~mem31.base, #t~mem31.offset; [L595] havoc #t~mem31.base, #t~mem31.offset; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc28.base=2181570690bv32, #t~malloc28.offset=0bv32, #t~malloc30.base=1bv32, #t~malloc30.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] [L590-L596] assume !(0bv32 != #t~nondet29); [L590] havoc #t~nondet29; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc28.base=2181570690bv32, #t~malloc28.offset=0bv32, #t~malloc30.base=1bv32, #t~malloc30.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] [L597] call write~intINTTYPE4(2bv32, ~p~0.base, ~p~0.offset, 4bv32); [L598] call write~$Pointer$(0bv32, 0bv32, ~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32); [L599] ~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc28.base=2181570690bv32, #t~malloc28.offset=0bv32, #t~malloc30.base=1bv32, #t~malloc30.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] [L600-L605] assume !!(~p~0.base != 0bv32 || ~p~0.offset != 0bv32); [L601] call #t~mem32 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc28.base=2181570690bv32, #t~malloc28.offset=0bv32, #t~malloc30.base=1bv32, #t~malloc30.offset=0bv32, #t~mem32=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] [L601-L603] assume 2bv32 != #t~mem32; [L601] havoc #t~mem32; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc28.base=2181570690bv32, #t~malloc28.offset=0bv32, #t~malloc30.base=1bv32, #t~malloc30.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] [L602] assert false; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc28.base=2181570690bv32, #t~malloc28.offset=0bv32, #t~malloc30.base=1bv32, #t~malloc30.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~ret36 := main(); VAL [#NULL.base=0bv32, #NULL.offset=0bv32] [L585] call #t~malloc28.base, #t~malloc28.offset := #Ultimate.alloc(8bv32); [L585] ~a~0.base, ~a~0.offset := #t~malloc28.base, #t~malloc28.offset; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc28.base=2181570690bv32, #t~malloc28.offset=0bv32, ~a~0.base=2181570690bv32, ~a~0.offset=0bv32] [L586] assume !(~a~0.base == 0bv32 && ~a~0.offset == 0bv32); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc28.base=2181570690bv32, #t~malloc28.offset=0bv32, ~a~0.base=2181570690bv32, ~a~0.offset=0bv32] [L587] havoc ~t~0.base, ~t~0.offset; [L588] ~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; [L589] call write~intINTTYPE4(2bv32, ~a~0.base, ~a~0.offset, 4bv32); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc28.base=2181570690bv32, #t~malloc28.offset=0bv32, ~a~0.base=2181570690bv32, ~a~0.offset=0bv32, ~p~0.base=2181570690bv32, ~p~0.offset=0bv32] [L590-L596] assume !!(0bv32 != #t~nondet29); [L590] havoc #t~nondet29; [L591] call write~intINTTYPE4(1bv32, ~p~0.base, ~p~0.offset, 4bv32); [L592] call #t~malloc30.base, #t~malloc30.offset := #Ultimate.alloc(8bv32); [L592] ~t~0.base, ~t~0.offset := #t~malloc30.base, #t~malloc30.offset; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc28.base=2181570690bv32, #t~malloc28.offset=0bv32, #t~malloc30.base=1bv32, #t~malloc30.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] [L593] assume !(~t~0.base == 0bv32 && ~t~0.offset == 0bv32); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc28.base=2181570690bv32, #t~malloc28.offset=0bv32, #t~malloc30.base=1bv32, #t~malloc30.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] [L594] call write~$Pointer$(~t~0.base, ~t~0.offset, ~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32); [L595] call #t~mem31.base, #t~mem31.offset := read~$Pointer$(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32); [L595] ~p~0.base, ~p~0.offset := #t~mem31.base, #t~mem31.offset; [L595] havoc #t~mem31.base, #t~mem31.offset; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc28.base=2181570690bv32, #t~malloc28.offset=0bv32, #t~malloc30.base=1bv32, #t~malloc30.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] [L590-L596] assume !(0bv32 != #t~nondet29); [L590] havoc #t~nondet29; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc28.base=2181570690bv32, #t~malloc28.offset=0bv32, #t~malloc30.base=1bv32, #t~malloc30.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] [L597] call write~intINTTYPE4(2bv32, ~p~0.base, ~p~0.offset, 4bv32); [L598] call write~$Pointer$(0bv32, 0bv32, ~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32); [L599] ~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc28.base=2181570690bv32, #t~malloc28.offset=0bv32, #t~malloc30.base=1bv32, #t~malloc30.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] [L600-L605] assume !!(~p~0.base != 0bv32 || ~p~0.offset != 0bv32); [L601] call #t~mem32 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc28.base=2181570690bv32, #t~malloc28.offset=0bv32, #t~malloc30.base=1bv32, #t~malloc30.offset=0bv32, #t~mem32=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] [L601-L603] assume 2bv32 != #t~mem32; [L601] havoc #t~mem32; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc28.base=2181570690bv32, #t~malloc28.offset=0bv32, #t~malloc30.base=1bv32, #t~malloc30.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] [L602] assert false; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc28.base=2181570690bv32, #t~malloc28.offset=0bv32, #t~malloc30.base=1bv32, #t~malloc30.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~ret36 := main(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32] [L585] FCALL call #t~malloc28 := #Ultimate.alloc(8bv32); [L585] ~a~0 := #t~malloc28; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc28!base=2181570690bv32, #t~malloc28!offset=0bv32, ~a~0!base=2181570690bv32, ~a~0!offset=0bv32] [L586] COND FALSE !(~a~0 == { base: 0bv32, offset: 0bv32 }) VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc28!base=2181570690bv32, #t~malloc28!offset=0bv32, ~a~0!base=2181570690bv32, ~a~0!offset=0bv32] [L587] havoc ~t~0; [L588] ~p~0 := ~a~0; [L589] FCALL call write~intINTTYPE4(2bv32, { base: ~a~0!base, offset: ~a~0!offset }, 4bv32); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc28!base=2181570690bv32, #t~malloc28!offset=0bv32, ~a~0!base=2181570690bv32, ~a~0!offset=0bv32, ~p~0!base=2181570690bv32, ~p~0!offset=0bv32] [L590-L596] COND FALSE !(!(0bv32 != #t~nondet29)) [L590] havoc #t~nondet29; [L591] FCALL call write~intINTTYPE4(1bv32, { base: ~p~0!base, offset: ~p~0!offset }, 4bv32); [L592] FCALL call #t~malloc30 := #Ultimate.alloc(8bv32); [L592] ~t~0 := #t~malloc30; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc28!base=2181570690bv32, #t~malloc28!offset=0bv32, #t~malloc30!base=1bv32, #t~malloc30!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] [L593] COND FALSE !(~t~0 == { base: 0bv32, offset: 0bv32 }) VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc28!base=2181570690bv32, #t~malloc28!offset=0bv32, #t~malloc30!base=1bv32, #t~malloc30!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] [L594] FCALL call write~$Pointer$(~t~0, { base: ~p~0!base, offset: ~bvadd32(4bv32, ~p~0!offset) }, 4bv32); [L595] FCALL call #t~mem31 := read~$Pointer$({ base: ~p~0!base, offset: ~bvadd32(4bv32, ~p~0!offset) }, 4bv32); [L595] ~p~0 := #t~mem31; [L595] havoc #t~mem31; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc28!base=2181570690bv32, #t~malloc28!offset=0bv32, #t~malloc30!base=1bv32, #t~malloc30!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] [L590-L596] COND TRUE !(0bv32 != #t~nondet29) [L590] havoc #t~nondet29; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc28!base=2181570690bv32, #t~malloc28!offset=0bv32, #t~malloc30!base=1bv32, #t~malloc30!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] [L597] FCALL call write~intINTTYPE4(2bv32, { base: ~p~0!base, offset: ~p~0!offset }, 4bv32); [L598] FCALL call write~$Pointer$({ base: 0bv32, offset: 0bv32 }, { base: ~p~0!base, offset: ~bvadd32(4bv32, ~p~0!offset) }, 4bv32); [L599] ~p~0 := ~a~0; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc28!base=2181570690bv32, #t~malloc28!offset=0bv32, #t~malloc30!base=1bv32, #t~malloc30!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] [L600-L605] COND FALSE !(!(~p~0 != { base: 0bv32, offset: 0bv32 })) [L601] FCALL call #t~mem32 := read~intINTTYPE4({ base: ~p~0!base, offset: ~p~0!offset }, 4bv32); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc28!base=2181570690bv32, #t~malloc28!offset=0bv32, #t~malloc30!base=1bv32, #t~malloc30!offset=0bv32, #t~mem32=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] [L601] COND TRUE 2bv32 != #t~mem32 [L601] havoc #t~mem32; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc28!base=2181570690bv32, #t~malloc28!offset=0bv32, #t~malloc30!base=1bv32, #t~malloc30!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] [L602] assert false; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc28!base=2181570690bv32, #t~malloc28!offset=0bv32, #t~malloc30!base=1bv32, #t~malloc30!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~ret36 := main(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32] [L585] FCALL call #t~malloc28 := #Ultimate.alloc(8bv32); [L585] ~a~0 := #t~malloc28; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc28!base=2181570690bv32, #t~malloc28!offset=0bv32, ~a~0!base=2181570690bv32, ~a~0!offset=0bv32] [L586] COND FALSE !(~a~0 == { base: 0bv32, offset: 0bv32 }) VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc28!base=2181570690bv32, #t~malloc28!offset=0bv32, ~a~0!base=2181570690bv32, ~a~0!offset=0bv32] [L587] havoc ~t~0; [L588] ~p~0 := ~a~0; [L589] FCALL call write~intINTTYPE4(2bv32, { base: ~a~0!base, offset: ~a~0!offset }, 4bv32); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc28!base=2181570690bv32, #t~malloc28!offset=0bv32, ~a~0!base=2181570690bv32, ~a~0!offset=0bv32, ~p~0!base=2181570690bv32, ~p~0!offset=0bv32] [L590-L596] COND FALSE !(!(0bv32 != #t~nondet29)) [L590] havoc #t~nondet29; [L591] FCALL call write~intINTTYPE4(1bv32, { base: ~p~0!base, offset: ~p~0!offset }, 4bv32); [L592] FCALL call #t~malloc30 := #Ultimate.alloc(8bv32); [L592] ~t~0 := #t~malloc30; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc28!base=2181570690bv32, #t~malloc28!offset=0bv32, #t~malloc30!base=1bv32, #t~malloc30!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] [L593] COND FALSE !(~t~0 == { base: 0bv32, offset: 0bv32 }) VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc28!base=2181570690bv32, #t~malloc28!offset=0bv32, #t~malloc30!base=1bv32, #t~malloc30!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] [L594] FCALL call write~$Pointer$(~t~0, { base: ~p~0!base, offset: ~bvadd32(4bv32, ~p~0!offset) }, 4bv32); [L595] FCALL call #t~mem31 := read~$Pointer$({ base: ~p~0!base, offset: ~bvadd32(4bv32, ~p~0!offset) }, 4bv32); [L595] ~p~0 := #t~mem31; [L595] havoc #t~mem31; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc28!base=2181570690bv32, #t~malloc28!offset=0bv32, #t~malloc30!base=1bv32, #t~malloc30!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] [L590-L596] COND TRUE !(0bv32 != #t~nondet29) [L590] havoc #t~nondet29; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc28!base=2181570690bv32, #t~malloc28!offset=0bv32, #t~malloc30!base=1bv32, #t~malloc30!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] [L597] FCALL call write~intINTTYPE4(2bv32, { base: ~p~0!base, offset: ~p~0!offset }, 4bv32); [L598] FCALL call write~$Pointer$({ base: 0bv32, offset: 0bv32 }, { base: ~p~0!base, offset: ~bvadd32(4bv32, ~p~0!offset) }, 4bv32); [L599] ~p~0 := ~a~0; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc28!base=2181570690bv32, #t~malloc28!offset=0bv32, #t~malloc30!base=1bv32, #t~malloc30!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] [L600-L605] COND FALSE !(!(~p~0 != { base: 0bv32, offset: 0bv32 })) [L601] FCALL call #t~mem32 := read~intINTTYPE4({ base: ~p~0!base, offset: ~p~0!offset }, 4bv32); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc28!base=2181570690bv32, #t~malloc28!offset=0bv32, #t~malloc30!base=1bv32, #t~malloc30!offset=0bv32, #t~mem32=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] [L601] COND TRUE 2bv32 != #t~mem32 [L601] havoc #t~mem32; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc28!base=2181570690bv32, #t~malloc28!offset=0bv32, #t~malloc30!base=1bv32, #t~malloc30!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] [L602] assert false; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc28!base=2181570690bv32, #t~malloc28!offset=0bv32, #t~malloc30!base=1bv32, #t~malloc30!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~ret36 := main(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32] [L585] FCALL call #t~malloc28 := #Ultimate.alloc(8bv32); [L585] ~a~0 := #t~malloc28; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc28!base=2181570690bv32, #t~malloc28!offset=0bv32, ~a~0!base=2181570690bv32, ~a~0!offset=0bv32] [L586] COND FALSE !(~a~0 == { base: 0bv32, offset: 0bv32 }) VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc28!base=2181570690bv32, #t~malloc28!offset=0bv32, ~a~0!base=2181570690bv32, ~a~0!offset=0bv32] [L587] havoc ~t~0; [L588] ~p~0 := ~a~0; [L589] FCALL call write~intINTTYPE4(2bv32, { base: ~a~0!base, offset: ~a~0!offset }, 4bv32); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc28!base=2181570690bv32, #t~malloc28!offset=0bv32, ~a~0!base=2181570690bv32, ~a~0!offset=0bv32, ~p~0!base=2181570690bv32, ~p~0!offset=0bv32] [L590-L596] COND FALSE !(!(0bv32 != #t~nondet29)) [L590] havoc #t~nondet29; [L591] FCALL call write~intINTTYPE4(1bv32, { base: ~p~0!base, offset: ~p~0!offset }, 4bv32); [L592] FCALL call #t~malloc30 := #Ultimate.alloc(8bv32); [L592] ~t~0 := #t~malloc30; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc28!base=2181570690bv32, #t~malloc28!offset=0bv32, #t~malloc30!base=1bv32, #t~malloc30!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] [L593] COND FALSE !(~t~0 == { base: 0bv32, offset: 0bv32 }) VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc28!base=2181570690bv32, #t~malloc28!offset=0bv32, #t~malloc30!base=1bv32, #t~malloc30!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] [L594] FCALL call write~$Pointer$(~t~0, { base: ~p~0!base, offset: ~bvadd32(4bv32, ~p~0!offset) }, 4bv32); [L595] FCALL call #t~mem31 := read~$Pointer$({ base: ~p~0!base, offset: ~bvadd32(4bv32, ~p~0!offset) }, 4bv32); [L595] ~p~0 := #t~mem31; [L595] havoc #t~mem31; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc28!base=2181570690bv32, #t~malloc28!offset=0bv32, #t~malloc30!base=1bv32, #t~malloc30!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] [L590-L596] COND TRUE !(0bv32 != #t~nondet29) [L590] havoc #t~nondet29; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc28!base=2181570690bv32, #t~malloc28!offset=0bv32, #t~malloc30!base=1bv32, #t~malloc30!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] [L597] FCALL call write~intINTTYPE4(2bv32, { base: ~p~0!base, offset: ~p~0!offset }, 4bv32); [L598] FCALL call write~$Pointer$({ base: 0bv32, offset: 0bv32 }, { base: ~p~0!base, offset: ~bvadd32(4bv32, ~p~0!offset) }, 4bv32); [L599] ~p~0 := ~a~0; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc28!base=2181570690bv32, #t~malloc28!offset=0bv32, #t~malloc30!base=1bv32, #t~malloc30!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] [L600-L605] COND FALSE !(!(~p~0 != { base: 0bv32, offset: 0bv32 })) [L601] FCALL call #t~mem32 := read~intINTTYPE4({ base: ~p~0!base, offset: ~p~0!offset }, 4bv32); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc28!base=2181570690bv32, #t~malloc28!offset=0bv32, #t~malloc30!base=1bv32, #t~malloc30!offset=0bv32, #t~mem32=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] [L601] COND TRUE 2bv32 != #t~mem32 [L601] havoc #t~mem32; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc28!base=2181570690bv32, #t~malloc28!offset=0bv32, #t~malloc30!base=1bv32, #t~malloc30!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] [L602] assert false; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc28!base=2181570690bv32, #t~malloc28!offset=0bv32, #t~malloc30!base=1bv32, #t~malloc30!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~ret36 := main(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32] [L585] FCALL call #t~malloc28 := #Ultimate.alloc(8bv32); [L585] ~a~0 := #t~malloc28; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc28!base=2181570690bv32, #t~malloc28!offset=0bv32, ~a~0!base=2181570690bv32, ~a~0!offset=0bv32] [L586] COND FALSE !(~a~0 == { base: 0bv32, offset: 0bv32 }) VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc28!base=2181570690bv32, #t~malloc28!offset=0bv32, ~a~0!base=2181570690bv32, ~a~0!offset=0bv32] [L587] havoc ~t~0; [L588] ~p~0 := ~a~0; [L589] FCALL call write~intINTTYPE4(2bv32, { base: ~a~0!base, offset: ~a~0!offset }, 4bv32); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc28!base=2181570690bv32, #t~malloc28!offset=0bv32, ~a~0!base=2181570690bv32, ~a~0!offset=0bv32, ~p~0!base=2181570690bv32, ~p~0!offset=0bv32] [L590-L596] COND FALSE !(!(0bv32 != #t~nondet29)) [L590] havoc #t~nondet29; [L591] FCALL call write~intINTTYPE4(1bv32, { base: ~p~0!base, offset: ~p~0!offset }, 4bv32); [L592] FCALL call #t~malloc30 := #Ultimate.alloc(8bv32); [L592] ~t~0 := #t~malloc30; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc28!base=2181570690bv32, #t~malloc28!offset=0bv32, #t~malloc30!base=1bv32, #t~malloc30!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] [L593] COND FALSE !(~t~0 == { base: 0bv32, offset: 0bv32 }) VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc28!base=2181570690bv32, #t~malloc28!offset=0bv32, #t~malloc30!base=1bv32, #t~malloc30!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] [L594] FCALL call write~$Pointer$(~t~0, { base: ~p~0!base, offset: ~bvadd32(4bv32, ~p~0!offset) }, 4bv32); [L595] FCALL call #t~mem31 := read~$Pointer$({ base: ~p~0!base, offset: ~bvadd32(4bv32, ~p~0!offset) }, 4bv32); [L595] ~p~0 := #t~mem31; [L595] havoc #t~mem31; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc28!base=2181570690bv32, #t~malloc28!offset=0bv32, #t~malloc30!base=1bv32, #t~malloc30!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] [L590-L596] COND TRUE !(0bv32 != #t~nondet29) [L590] havoc #t~nondet29; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc28!base=2181570690bv32, #t~malloc28!offset=0bv32, #t~malloc30!base=1bv32, #t~malloc30!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] [L597] FCALL call write~intINTTYPE4(2bv32, { base: ~p~0!base, offset: ~p~0!offset }, 4bv32); [L598] FCALL call write~$Pointer$({ base: 0bv32, offset: 0bv32 }, { base: ~p~0!base, offset: ~bvadd32(4bv32, ~p~0!offset) }, 4bv32); [L599] ~p~0 := ~a~0; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc28!base=2181570690bv32, #t~malloc28!offset=0bv32, #t~malloc30!base=1bv32, #t~malloc30!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] [L600-L605] COND FALSE !(!(~p~0 != { base: 0bv32, offset: 0bv32 })) [L601] FCALL call #t~mem32 := read~intINTTYPE4({ base: ~p~0!base, offset: ~p~0!offset }, 4bv32); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc28!base=2181570690bv32, #t~malloc28!offset=0bv32, #t~malloc30!base=1bv32, #t~malloc30!offset=0bv32, #t~mem32=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] [L601] COND TRUE 2bv32 != #t~mem32 [L601] havoc #t~mem32; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc28!base=2181570690bv32, #t~malloc28!offset=0bv32, #t~malloc30!base=1bv32, #t~malloc30!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] [L602] assert false; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc28!base=2181570690bv32, #t~malloc28!offset=0bv32, #t~malloc30!base=1bv32, #t~malloc30!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] [L585] List a = (List) malloc(sizeof(struct node)); VAL [a={-2113396606:0}, malloc(sizeof(struct node))={-2113396606:0}] [L586] COND FALSE !(a == 0) VAL [a={-2113396606:0}, malloc(sizeof(struct node))={-2113396606:0}] [L587] List t; [L588] List p = a; [L589] a->h = 2 VAL [a={-2113396606:0}, malloc(sizeof(struct node))={-2113396606:0}, p={-2113396606:0}] [L590] COND TRUE __VERIFIER_nondet_int() [L591] p->h = 1 [L592] t = (List) malloc(sizeof(struct node)) VAL [a={-2113396606:0}, malloc(sizeof(struct node))={-2113396606:0}, malloc(sizeof(struct node))={1:0}, p={-2113396606:0}, t={1:0}] [L593] COND FALSE !(t == 0) VAL [a={-2113396606:0}, malloc(sizeof(struct node))={-2113396606:0}, malloc(sizeof(struct node))={1:0}, p={-2113396606:0}, t={1:0}] [L594] p->n = t [L595] EXPR p->n [L595] p = p->n [L590] COND FALSE !(__VERIFIER_nondet_int()) [L597] p->h = 2 [L598] p->n = 0 [L599] p = a VAL [a={-2113396606:0}, malloc(sizeof(struct node))={1:0}, malloc(sizeof(struct node))={-2113396606:0}, p={-2113396606:0}, t={1:0}] [L600] COND TRUE p!=0 [L601] 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}] [L601] COND TRUE p->h != 2 [L602] __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:10:21,342 WARN L170 areAnnotationChecker]: sl_random_insertENTRY has no Hoare annotation [2018-11-23 11:10:21,342 WARN L170 areAnnotationChecker]: exitENTRY has no Hoare annotation [2018-11-23 11:10:21,342 WARN L170 areAnnotationChecker]: create_sl_with_head_and_tailENTRY has no Hoare annotation [2018-11-23 11:10:21,342 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2018-11-23 11:10:21,343 WARN L170 areAnnotationChecker]: destroy_slENTRY has no Hoare annotation [2018-11-23 11:10:21,343 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2018-11-23 11:10:21,343 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2018-11-23 11:10:21,343 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2018-11-23 11:10:21,343 WARN L170 areAnnotationChecker]: L554-3 has no Hoare annotation [2018-11-23 11:10:21,343 WARN L170 areAnnotationChecker]: L554-3 has no Hoare annotation [2018-11-23 11:10:21,344 WARN L170 areAnnotationChecker]: L578 has no Hoare annotation [2018-11-23 11:10:21,344 WARN L170 areAnnotationChecker]: create_sl_with_head_and_tailFINAL has no Hoare annotation [2018-11-23 11:10:21,344 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2018-11-23 11:10:21,344 WARN L170 areAnnotationChecker]: L570-3 has no Hoare annotation [2018-11-23 11:10:21,344 WARN L170 areAnnotationChecker]: L570-3 has no Hoare annotation [2018-11-23 11:10:21,344 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2018-11-23 11:10:21,345 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2018-11-23 11:10:21,345 WARN L170 areAnnotationChecker]: L586 has no Hoare annotation [2018-11-23 11:10:21,345 WARN L170 areAnnotationChecker]: L586 has no Hoare annotation [2018-11-23 11:10:21,345 WARN L170 areAnnotationChecker]: L554-4 has no Hoare annotation [2018-11-23 11:10:21,345 WARN L170 areAnnotationChecker]: L554-1 has no Hoare annotation [2018-11-23 11:10:21,346 WARN L170 areAnnotationChecker]: L554-1 has no Hoare annotation [2018-11-23 11:10:21,346 WARN L170 areAnnotationChecker]: create_sl_with_head_and_tailEXIT has no Hoare annotation [2018-11-23 11:10:21,346 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-23 11:10:21,346 WARN L170 areAnnotationChecker]: L570-4 has no Hoare annotation [2018-11-23 11:10:21,346 WARN L170 areAnnotationChecker]: L570-1 has no Hoare annotation [2018-11-23 11:10:21,346 WARN L170 areAnnotationChecker]: L570-1 has no Hoare annotation [2018-11-23 11:10:21,347 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-23 11:10:21,347 WARN L170 areAnnotationChecker]: L586-1 has no Hoare annotation [2018-11-23 11:10:21,347 WARN L170 areAnnotationChecker]: L586-1 has no Hoare annotation [2018-11-23 11:10:21,347 WARN L170 areAnnotationChecker]: L586-3 has no Hoare annotation [2018-11-23 11:10:21,347 WARN L170 areAnnotationChecker]: L557-3 has no Hoare annotation [2018-11-23 11:10:21,348 WARN L170 areAnnotationChecker]: L557-3 has no Hoare annotation [2018-11-23 11:10:21,348 WARN L170 areAnnotationChecker]: L606 has no Hoare annotation [2018-11-23 11:10:21,348 WARN L170 areAnnotationChecker]: destroy_slFINAL has no Hoare annotation [2018-11-23 11:10:21,348 WARN L170 areAnnotationChecker]: L590-2 has no Hoare annotation [2018-11-23 11:10:21,348 WARN L170 areAnnotationChecker]: L590-2 has no Hoare annotation [2018-11-23 11:10:21,349 WARN L170 areAnnotationChecker]: L590-2 has no Hoare annotation [2018-11-23 11:10:21,349 WARN L170 areAnnotationChecker]: L557-4 has no Hoare annotation [2018-11-23 11:10:21,349 WARN L170 areAnnotationChecker]: L557-1 has no Hoare annotation [2018-11-23 11:10:21,349 WARN L170 areAnnotationChecker]: L557-1 has no Hoare annotation [2018-11-23 11:10:21,349 WARN L170 areAnnotationChecker]: L608-1 has no Hoare annotation [2018-11-23 11:10:21,349 WARN L170 areAnnotationChecker]: L608-1 has no Hoare annotation [2018-11-23 11:10:21,350 WARN L170 areAnnotationChecker]: L608-1 has no Hoare annotation [2018-11-23 11:10:21,350 WARN L170 areAnnotationChecker]: destroy_slEXIT has no Hoare annotation [2018-11-23 11:10:21,350 WARN L170 areAnnotationChecker]: L590-3 has no Hoare annotation [2018-11-23 11:10:21,350 WARN L170 areAnnotationChecker]: L593 has no Hoare annotation [2018-11-23 11:10:21,350 WARN L170 areAnnotationChecker]: L593 has no Hoare annotation [2018-11-23 11:10:21,350 WARN L170 areAnnotationChecker]: L562 has no Hoare annotation [2018-11-23 11:10:21,351 WARN L170 areAnnotationChecker]: L562 has no Hoare annotation [2018-11-23 11:10:21,351 WARN L170 areAnnotationChecker]: L607-2 has no Hoare annotation [2018-11-23 11:10:21,351 WARN L170 areAnnotationChecker]: L607-2 has no Hoare annotation [2018-11-23 11:10:21,351 WARN L170 areAnnotationChecker]: L608 has no Hoare annotation [2018-11-23 11:10:21,351 WARN L170 areAnnotationChecker]: L608 has no Hoare annotation [2018-11-23 11:10:21,351 WARN L170 areAnnotationChecker]: L609 has no Hoare annotation [2018-11-23 11:10:21,351 WARN L170 areAnnotationChecker]: L600-2 has no Hoare annotation [2018-11-23 11:10:21,352 WARN L170 areAnnotationChecker]: L600-2 has no Hoare annotation [2018-11-23 11:10:21,352 WARN L170 areAnnotationChecker]: L600-2 has no Hoare annotation [2018-11-23 11:10:21,352 WARN L170 areAnnotationChecker]: L593-1 has no Hoare annotation [2018-11-23 11:10:21,352 WARN L170 areAnnotationChecker]: L593-1 has no Hoare annotation [2018-11-23 11:10:21,352 WARN L170 areAnnotationChecker]: L593-3 has no Hoare annotation [2018-11-23 11:10:21,352 WARN L170 areAnnotationChecker]: L562-2 has no Hoare annotation [2018-11-23 11:10:21,352 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-23 11:10:21,353 WARN L170 areAnnotationChecker]: L600-3 has no Hoare annotation [2018-11-23 11:10:21,353 WARN L170 areAnnotationChecker]: L600-3 has no Hoare annotation [2018-11-23 11:10:21,353 WARN L170 areAnnotationChecker]: L601 has no Hoare annotation [2018-11-23 11:10:21,353 WARN L170 areAnnotationChecker]: L601 has no Hoare annotation [2018-11-23 11:10:21,353 WARN L170 areAnnotationChecker]: sl_random_insertEXIT has no Hoare annotation [2018-11-23 11:10:21,353 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2018-11-23 11:10:21,354 WARN L170 areAnnotationChecker]: L602 has no Hoare annotation [2018-11-23 11:10:21,354 WARN L170 areAnnotationChecker]: L602 has no Hoare annotation [2018-11-23 11:10:21,354 WARN L170 areAnnotationChecker]: L601-2 has no Hoare annotation [2018-11-23 11:10:21,354 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:10:21,357 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 11:10:21 BoogieIcfgContainer [2018-11-23 11:10:21,357 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 11:10:21,358 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 11:10:21,358 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 11:10:21,358 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 11:10:21,359 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:10:13" (3/4) ... [2018-11-23 11:10:21,361 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 #145#return; VAL [|#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32)] [?] CALL call #t~ret36 := main(); VAL [|#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32)] [?] call #t~malloc28.base, #t~malloc28.offset := #Ultimate.alloc(8bv32);~a~0.base, ~a~0.offset := #t~malloc28.base, #t~malloc28.offset; VAL [main_~a~0.base=(_ bv2181570690 32), main_~a~0.offset=(_ bv0 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_#t~malloc28.base|=(_ bv2181570690 32), |main_#t~malloc28.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~malloc28.base|=(_ bv2181570690 32), |main_#t~malloc28.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~malloc28.base|=(_ bv2181570690 32), |main_#t~malloc28.offset|=(_ bv0 32)] [?] assume !!(0bv32 != #t~nondet29);havoc #t~nondet29;call write~intINTTYPE4(1bv32, ~p~0.base, ~p~0.offset, 4bv32);call #t~malloc30.base, #t~malloc30.offset := #Ultimate.alloc(8bv32);~t~0.base, ~t~0.offset := #t~malloc30.base, #t~malloc30.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~malloc28.base|=(_ bv2181570690 32), |main_#t~malloc28.offset|=(_ bv0 32), |main_#t~malloc30.base|=(_ bv1 32), |main_#t~malloc30.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~malloc28.base|=(_ bv2181570690 32), |main_#t~malloc28.offset|=(_ bv0 32), |main_#t~malloc30.base|=(_ bv1 32), |main_#t~malloc30.offset|=(_ bv0 32)] [?] call write~$Pointer$(~t~0.base, ~t~0.offset, ~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);call #t~mem31.base, #t~mem31.offset := read~$Pointer$(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~p~0.base, ~p~0.offset := #t~mem31.base, #t~mem31.offset;havoc #t~mem31.base, #t~mem31.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~malloc28.base|=(_ bv2181570690 32), |main_#t~malloc28.offset|=(_ bv0 32), |main_#t~malloc30.base|=(_ bv1 32), |main_#t~malloc30.offset|=(_ bv0 32)] [?] assume !(0bv32 != #t~nondet29);havoc #t~nondet29; 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~malloc28.base|=(_ bv2181570690 32), |main_#t~malloc28.offset|=(_ bv0 32), |main_#t~malloc30.base|=(_ bv1 32), |main_#t~malloc30.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~malloc28.base|=(_ bv2181570690 32), |main_#t~malloc28.offset|=(_ bv0 32), |main_#t~malloc30.base|=(_ bv1 32), |main_#t~malloc30.offset|=(_ bv0 32)] [?] assume !!(~p~0.base != 0bv32 || ~p~0.offset != 0bv32);call #t~mem32 := 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~malloc28.base|=(_ bv2181570690 32), |main_#t~malloc28.offset|=(_ bv0 32), |main_#t~malloc30.base|=(_ bv1 32), |main_#t~malloc30.offset|=(_ bv0 32), |main_#t~mem32|=(_ bv1 32)] [?] assume 2bv32 != #t~mem32;havoc #t~mem32; 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~malloc28.base|=(_ bv2181570690 32), |main_#t~malloc28.offset|=(_ bv0 32), |main_#t~malloc30.base|=(_ bv1 32), |main_#t~malloc30.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~malloc28.base|=(_ bv2181570690 32), |main_#t~malloc28.offset|=(_ bv0 32), |main_#t~malloc30.base|=(_ bv1 32), |main_#t~malloc30.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~ret36 := main(); VAL [#NULL.base=0bv32, #NULL.offset=0bv32] [L585] call #t~malloc28.base, #t~malloc28.offset := #Ultimate.alloc(8bv32); [L585] ~a~0.base, ~a~0.offset := #t~malloc28.base, #t~malloc28.offset; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc28.base=2181570690bv32, #t~malloc28.offset=0bv32, ~a~0.base=2181570690bv32, ~a~0.offset=0bv32] [L586] assume !(~a~0.base == 0bv32 && ~a~0.offset == 0bv32); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc28.base=2181570690bv32, #t~malloc28.offset=0bv32, ~a~0.base=2181570690bv32, ~a~0.offset=0bv32] [L587] havoc ~t~0.base, ~t~0.offset; [L588] ~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; [L589] call write~intINTTYPE4(2bv32, ~a~0.base, ~a~0.offset, 4bv32); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc28.base=2181570690bv32, #t~malloc28.offset=0bv32, ~a~0.base=2181570690bv32, ~a~0.offset=0bv32, ~p~0.base=2181570690bv32, ~p~0.offset=0bv32] [L590-L596] assume !!(0bv32 != #t~nondet29); [L590] havoc #t~nondet29; [L591] call write~intINTTYPE4(1bv32, ~p~0.base, ~p~0.offset, 4bv32); [L592] call #t~malloc30.base, #t~malloc30.offset := #Ultimate.alloc(8bv32); [L592] ~t~0.base, ~t~0.offset := #t~malloc30.base, #t~malloc30.offset; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc28.base=2181570690bv32, #t~malloc28.offset=0bv32, #t~malloc30.base=1bv32, #t~malloc30.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] [L593] assume !(~t~0.base == 0bv32 && ~t~0.offset == 0bv32); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc28.base=2181570690bv32, #t~malloc28.offset=0bv32, #t~malloc30.base=1bv32, #t~malloc30.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] [L594] call write~$Pointer$(~t~0.base, ~t~0.offset, ~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32); [L595] call #t~mem31.base, #t~mem31.offset := read~$Pointer$(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32); [L595] ~p~0.base, ~p~0.offset := #t~mem31.base, #t~mem31.offset; [L595] havoc #t~mem31.base, #t~mem31.offset; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc28.base=2181570690bv32, #t~malloc28.offset=0bv32, #t~malloc30.base=1bv32, #t~malloc30.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] [L590-L596] assume !(0bv32 != #t~nondet29); [L590] havoc #t~nondet29; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc28.base=2181570690bv32, #t~malloc28.offset=0bv32, #t~malloc30.base=1bv32, #t~malloc30.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] [L597] call write~intINTTYPE4(2bv32, ~p~0.base, ~p~0.offset, 4bv32); [L598] call write~$Pointer$(0bv32, 0bv32, ~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32); [L599] ~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc28.base=2181570690bv32, #t~malloc28.offset=0bv32, #t~malloc30.base=1bv32, #t~malloc30.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] [L600-L605] assume !!(~p~0.base != 0bv32 || ~p~0.offset != 0bv32); [L601] call #t~mem32 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc28.base=2181570690bv32, #t~malloc28.offset=0bv32, #t~malloc30.base=1bv32, #t~malloc30.offset=0bv32, #t~mem32=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] [L601-L603] assume 2bv32 != #t~mem32; [L601] havoc #t~mem32; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc28.base=2181570690bv32, #t~malloc28.offset=0bv32, #t~malloc30.base=1bv32, #t~malloc30.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] [L602] assert false; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc28.base=2181570690bv32, #t~malloc28.offset=0bv32, #t~malloc30.base=1bv32, #t~malloc30.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~ret36 := main(); VAL [#NULL.base=0bv32, #NULL.offset=0bv32] [L585] call #t~malloc28.base, #t~malloc28.offset := #Ultimate.alloc(8bv32); [L585] ~a~0.base, ~a~0.offset := #t~malloc28.base, #t~malloc28.offset; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc28.base=2181570690bv32, #t~malloc28.offset=0bv32, ~a~0.base=2181570690bv32, ~a~0.offset=0bv32] [L586] assume !(~a~0.base == 0bv32 && ~a~0.offset == 0bv32); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc28.base=2181570690bv32, #t~malloc28.offset=0bv32, ~a~0.base=2181570690bv32, ~a~0.offset=0bv32] [L587] havoc ~t~0.base, ~t~0.offset; [L588] ~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; [L589] call write~intINTTYPE4(2bv32, ~a~0.base, ~a~0.offset, 4bv32); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc28.base=2181570690bv32, #t~malloc28.offset=0bv32, ~a~0.base=2181570690bv32, ~a~0.offset=0bv32, ~p~0.base=2181570690bv32, ~p~0.offset=0bv32] [L590-L596] assume !!(0bv32 != #t~nondet29); [L590] havoc #t~nondet29; [L591] call write~intINTTYPE4(1bv32, ~p~0.base, ~p~0.offset, 4bv32); [L592] call #t~malloc30.base, #t~malloc30.offset := #Ultimate.alloc(8bv32); [L592] ~t~0.base, ~t~0.offset := #t~malloc30.base, #t~malloc30.offset; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc28.base=2181570690bv32, #t~malloc28.offset=0bv32, #t~malloc30.base=1bv32, #t~malloc30.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] [L593] assume !(~t~0.base == 0bv32 && ~t~0.offset == 0bv32); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc28.base=2181570690bv32, #t~malloc28.offset=0bv32, #t~malloc30.base=1bv32, #t~malloc30.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] [L594] call write~$Pointer$(~t~0.base, ~t~0.offset, ~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32); [L595] call #t~mem31.base, #t~mem31.offset := read~$Pointer$(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32); [L595] ~p~0.base, ~p~0.offset := #t~mem31.base, #t~mem31.offset; [L595] havoc #t~mem31.base, #t~mem31.offset; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc28.base=2181570690bv32, #t~malloc28.offset=0bv32, #t~malloc30.base=1bv32, #t~malloc30.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] [L590-L596] assume !(0bv32 != #t~nondet29); [L590] havoc #t~nondet29; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc28.base=2181570690bv32, #t~malloc28.offset=0bv32, #t~malloc30.base=1bv32, #t~malloc30.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] [L597] call write~intINTTYPE4(2bv32, ~p~0.base, ~p~0.offset, 4bv32); [L598] call write~$Pointer$(0bv32, 0bv32, ~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32); [L599] ~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc28.base=2181570690bv32, #t~malloc28.offset=0bv32, #t~malloc30.base=1bv32, #t~malloc30.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] [L600-L605] assume !!(~p~0.base != 0bv32 || ~p~0.offset != 0bv32); [L601] call #t~mem32 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc28.base=2181570690bv32, #t~malloc28.offset=0bv32, #t~malloc30.base=1bv32, #t~malloc30.offset=0bv32, #t~mem32=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] [L601-L603] assume 2bv32 != #t~mem32; [L601] havoc #t~mem32; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc28.base=2181570690bv32, #t~malloc28.offset=0bv32, #t~malloc30.base=1bv32, #t~malloc30.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] [L602] assert false; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc28.base=2181570690bv32, #t~malloc28.offset=0bv32, #t~malloc30.base=1bv32, #t~malloc30.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~ret36 := main(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32] [L585] FCALL call #t~malloc28 := #Ultimate.alloc(8bv32); [L585] ~a~0 := #t~malloc28; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc28!base=2181570690bv32, #t~malloc28!offset=0bv32, ~a~0!base=2181570690bv32, ~a~0!offset=0bv32] [L586] COND FALSE !(~a~0 == { base: 0bv32, offset: 0bv32 }) VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc28!base=2181570690bv32, #t~malloc28!offset=0bv32, ~a~0!base=2181570690bv32, ~a~0!offset=0bv32] [L587] havoc ~t~0; [L588] ~p~0 := ~a~0; [L589] FCALL call write~intINTTYPE4(2bv32, { base: ~a~0!base, offset: ~a~0!offset }, 4bv32); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc28!base=2181570690bv32, #t~malloc28!offset=0bv32, ~a~0!base=2181570690bv32, ~a~0!offset=0bv32, ~p~0!base=2181570690bv32, ~p~0!offset=0bv32] [L590-L596] COND FALSE !(!(0bv32 != #t~nondet29)) [L590] havoc #t~nondet29; [L591] FCALL call write~intINTTYPE4(1bv32, { base: ~p~0!base, offset: ~p~0!offset }, 4bv32); [L592] FCALL call #t~malloc30 := #Ultimate.alloc(8bv32); [L592] ~t~0 := #t~malloc30; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc28!base=2181570690bv32, #t~malloc28!offset=0bv32, #t~malloc30!base=1bv32, #t~malloc30!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] [L593] COND FALSE !(~t~0 == { base: 0bv32, offset: 0bv32 }) VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc28!base=2181570690bv32, #t~malloc28!offset=0bv32, #t~malloc30!base=1bv32, #t~malloc30!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] [L594] FCALL call write~$Pointer$(~t~0, { base: ~p~0!base, offset: ~bvadd32(4bv32, ~p~0!offset) }, 4bv32); [L595] FCALL call #t~mem31 := read~$Pointer$({ base: ~p~0!base, offset: ~bvadd32(4bv32, ~p~0!offset) }, 4bv32); [L595] ~p~0 := #t~mem31; [L595] havoc #t~mem31; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc28!base=2181570690bv32, #t~malloc28!offset=0bv32, #t~malloc30!base=1bv32, #t~malloc30!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] [L590-L596] COND TRUE !(0bv32 != #t~nondet29) [L590] havoc #t~nondet29; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc28!base=2181570690bv32, #t~malloc28!offset=0bv32, #t~malloc30!base=1bv32, #t~malloc30!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] [L597] FCALL call write~intINTTYPE4(2bv32, { base: ~p~0!base, offset: ~p~0!offset }, 4bv32); [L598] FCALL call write~$Pointer$({ base: 0bv32, offset: 0bv32 }, { base: ~p~0!base, offset: ~bvadd32(4bv32, ~p~0!offset) }, 4bv32); [L599] ~p~0 := ~a~0; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc28!base=2181570690bv32, #t~malloc28!offset=0bv32, #t~malloc30!base=1bv32, #t~malloc30!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] [L600-L605] COND FALSE !(!(~p~0 != { base: 0bv32, offset: 0bv32 })) [L601] FCALL call #t~mem32 := read~intINTTYPE4({ base: ~p~0!base, offset: ~p~0!offset }, 4bv32); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc28!base=2181570690bv32, #t~malloc28!offset=0bv32, #t~malloc30!base=1bv32, #t~malloc30!offset=0bv32, #t~mem32=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] [L601] COND TRUE 2bv32 != #t~mem32 [L601] havoc #t~mem32; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc28!base=2181570690bv32, #t~malloc28!offset=0bv32, #t~malloc30!base=1bv32, #t~malloc30!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] [L602] assert false; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc28!base=2181570690bv32, #t~malloc28!offset=0bv32, #t~malloc30!base=1bv32, #t~malloc30!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~ret36 := main(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32] [L585] FCALL call #t~malloc28 := #Ultimate.alloc(8bv32); [L585] ~a~0 := #t~malloc28; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc28!base=2181570690bv32, #t~malloc28!offset=0bv32, ~a~0!base=2181570690bv32, ~a~0!offset=0bv32] [L586] COND FALSE !(~a~0 == { base: 0bv32, offset: 0bv32 }) VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc28!base=2181570690bv32, #t~malloc28!offset=0bv32, ~a~0!base=2181570690bv32, ~a~0!offset=0bv32] [L587] havoc ~t~0; [L588] ~p~0 := ~a~0; [L589] FCALL call write~intINTTYPE4(2bv32, { base: ~a~0!base, offset: ~a~0!offset }, 4bv32); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc28!base=2181570690bv32, #t~malloc28!offset=0bv32, ~a~0!base=2181570690bv32, ~a~0!offset=0bv32, ~p~0!base=2181570690bv32, ~p~0!offset=0bv32] [L590-L596] COND FALSE !(!(0bv32 != #t~nondet29)) [L590] havoc #t~nondet29; [L591] FCALL call write~intINTTYPE4(1bv32, { base: ~p~0!base, offset: ~p~0!offset }, 4bv32); [L592] FCALL call #t~malloc30 := #Ultimate.alloc(8bv32); [L592] ~t~0 := #t~malloc30; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc28!base=2181570690bv32, #t~malloc28!offset=0bv32, #t~malloc30!base=1bv32, #t~malloc30!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] [L593] COND FALSE !(~t~0 == { base: 0bv32, offset: 0bv32 }) VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc28!base=2181570690bv32, #t~malloc28!offset=0bv32, #t~malloc30!base=1bv32, #t~malloc30!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] [L594] FCALL call write~$Pointer$(~t~0, { base: ~p~0!base, offset: ~bvadd32(4bv32, ~p~0!offset) }, 4bv32); [L595] FCALL call #t~mem31 := read~$Pointer$({ base: ~p~0!base, offset: ~bvadd32(4bv32, ~p~0!offset) }, 4bv32); [L595] ~p~0 := #t~mem31; [L595] havoc #t~mem31; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc28!base=2181570690bv32, #t~malloc28!offset=0bv32, #t~malloc30!base=1bv32, #t~malloc30!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] [L590-L596] COND TRUE !(0bv32 != #t~nondet29) [L590] havoc #t~nondet29; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc28!base=2181570690bv32, #t~malloc28!offset=0bv32, #t~malloc30!base=1bv32, #t~malloc30!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] [L597] FCALL call write~intINTTYPE4(2bv32, { base: ~p~0!base, offset: ~p~0!offset }, 4bv32); [L598] FCALL call write~$Pointer$({ base: 0bv32, offset: 0bv32 }, { base: ~p~0!base, offset: ~bvadd32(4bv32, ~p~0!offset) }, 4bv32); [L599] ~p~0 := ~a~0; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc28!base=2181570690bv32, #t~malloc28!offset=0bv32, #t~malloc30!base=1bv32, #t~malloc30!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] [L600-L605] COND FALSE !(!(~p~0 != { base: 0bv32, offset: 0bv32 })) [L601] FCALL call #t~mem32 := read~intINTTYPE4({ base: ~p~0!base, offset: ~p~0!offset }, 4bv32); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc28!base=2181570690bv32, #t~malloc28!offset=0bv32, #t~malloc30!base=1bv32, #t~malloc30!offset=0bv32, #t~mem32=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] [L601] COND TRUE 2bv32 != #t~mem32 [L601] havoc #t~mem32; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc28!base=2181570690bv32, #t~malloc28!offset=0bv32, #t~malloc30!base=1bv32, #t~malloc30!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] [L602] assert false; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc28!base=2181570690bv32, #t~malloc28!offset=0bv32, #t~malloc30!base=1bv32, #t~malloc30!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~ret36 := main(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32] [L585] FCALL call #t~malloc28 := #Ultimate.alloc(8bv32); [L585] ~a~0 := #t~malloc28; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc28!base=2181570690bv32, #t~malloc28!offset=0bv32, ~a~0!base=2181570690bv32, ~a~0!offset=0bv32] [L586] COND FALSE !(~a~0 == { base: 0bv32, offset: 0bv32 }) VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc28!base=2181570690bv32, #t~malloc28!offset=0bv32, ~a~0!base=2181570690bv32, ~a~0!offset=0bv32] [L587] havoc ~t~0; [L588] ~p~0 := ~a~0; [L589] FCALL call write~intINTTYPE4(2bv32, { base: ~a~0!base, offset: ~a~0!offset }, 4bv32); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc28!base=2181570690bv32, #t~malloc28!offset=0bv32, ~a~0!base=2181570690bv32, ~a~0!offset=0bv32, ~p~0!base=2181570690bv32, ~p~0!offset=0bv32] [L590-L596] COND FALSE !(!(0bv32 != #t~nondet29)) [L590] havoc #t~nondet29; [L591] FCALL call write~intINTTYPE4(1bv32, { base: ~p~0!base, offset: ~p~0!offset }, 4bv32); [L592] FCALL call #t~malloc30 := #Ultimate.alloc(8bv32); [L592] ~t~0 := #t~malloc30; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc28!base=2181570690bv32, #t~malloc28!offset=0bv32, #t~malloc30!base=1bv32, #t~malloc30!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] [L593] COND FALSE !(~t~0 == { base: 0bv32, offset: 0bv32 }) VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc28!base=2181570690bv32, #t~malloc28!offset=0bv32, #t~malloc30!base=1bv32, #t~malloc30!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] [L594] FCALL call write~$Pointer$(~t~0, { base: ~p~0!base, offset: ~bvadd32(4bv32, ~p~0!offset) }, 4bv32); [L595] FCALL call #t~mem31 := read~$Pointer$({ base: ~p~0!base, offset: ~bvadd32(4bv32, ~p~0!offset) }, 4bv32); [L595] ~p~0 := #t~mem31; [L595] havoc #t~mem31; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc28!base=2181570690bv32, #t~malloc28!offset=0bv32, #t~malloc30!base=1bv32, #t~malloc30!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] [L590-L596] COND TRUE !(0bv32 != #t~nondet29) [L590] havoc #t~nondet29; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc28!base=2181570690bv32, #t~malloc28!offset=0bv32, #t~malloc30!base=1bv32, #t~malloc30!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] [L597] FCALL call write~intINTTYPE4(2bv32, { base: ~p~0!base, offset: ~p~0!offset }, 4bv32); [L598] FCALL call write~$Pointer$({ base: 0bv32, offset: 0bv32 }, { base: ~p~0!base, offset: ~bvadd32(4bv32, ~p~0!offset) }, 4bv32); [L599] ~p~0 := ~a~0; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc28!base=2181570690bv32, #t~malloc28!offset=0bv32, #t~malloc30!base=1bv32, #t~malloc30!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] [L600-L605] COND FALSE !(!(~p~0 != { base: 0bv32, offset: 0bv32 })) [L601] FCALL call #t~mem32 := read~intINTTYPE4({ base: ~p~0!base, offset: ~p~0!offset }, 4bv32); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc28!base=2181570690bv32, #t~malloc28!offset=0bv32, #t~malloc30!base=1bv32, #t~malloc30!offset=0bv32, #t~mem32=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] [L601] COND TRUE 2bv32 != #t~mem32 [L601] havoc #t~mem32; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc28!base=2181570690bv32, #t~malloc28!offset=0bv32, #t~malloc30!base=1bv32, #t~malloc30!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] [L602] assert false; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc28!base=2181570690bv32, #t~malloc28!offset=0bv32, #t~malloc30!base=1bv32, #t~malloc30!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~ret36 := main(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32] [L585] FCALL call #t~malloc28 := #Ultimate.alloc(8bv32); [L585] ~a~0 := #t~malloc28; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc28!base=2181570690bv32, #t~malloc28!offset=0bv32, ~a~0!base=2181570690bv32, ~a~0!offset=0bv32] [L586] COND FALSE !(~a~0 == { base: 0bv32, offset: 0bv32 }) VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc28!base=2181570690bv32, #t~malloc28!offset=0bv32, ~a~0!base=2181570690bv32, ~a~0!offset=0bv32] [L587] havoc ~t~0; [L588] ~p~0 := ~a~0; [L589] FCALL call write~intINTTYPE4(2bv32, { base: ~a~0!base, offset: ~a~0!offset }, 4bv32); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc28!base=2181570690bv32, #t~malloc28!offset=0bv32, ~a~0!base=2181570690bv32, ~a~0!offset=0bv32, ~p~0!base=2181570690bv32, ~p~0!offset=0bv32] [L590-L596] COND FALSE !(!(0bv32 != #t~nondet29)) [L590] havoc #t~nondet29; [L591] FCALL call write~intINTTYPE4(1bv32, { base: ~p~0!base, offset: ~p~0!offset }, 4bv32); [L592] FCALL call #t~malloc30 := #Ultimate.alloc(8bv32); [L592] ~t~0 := #t~malloc30; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc28!base=2181570690bv32, #t~malloc28!offset=0bv32, #t~malloc30!base=1bv32, #t~malloc30!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] [L593] COND FALSE !(~t~0 == { base: 0bv32, offset: 0bv32 }) VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc28!base=2181570690bv32, #t~malloc28!offset=0bv32, #t~malloc30!base=1bv32, #t~malloc30!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] [L594] FCALL call write~$Pointer$(~t~0, { base: ~p~0!base, offset: ~bvadd32(4bv32, ~p~0!offset) }, 4bv32); [L595] FCALL call #t~mem31 := read~$Pointer$({ base: ~p~0!base, offset: ~bvadd32(4bv32, ~p~0!offset) }, 4bv32); [L595] ~p~0 := #t~mem31; [L595] havoc #t~mem31; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc28!base=2181570690bv32, #t~malloc28!offset=0bv32, #t~malloc30!base=1bv32, #t~malloc30!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] [L590-L596] COND TRUE !(0bv32 != #t~nondet29) [L590] havoc #t~nondet29; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc28!base=2181570690bv32, #t~malloc28!offset=0bv32, #t~malloc30!base=1bv32, #t~malloc30!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] [L597] FCALL call write~intINTTYPE4(2bv32, { base: ~p~0!base, offset: ~p~0!offset }, 4bv32); [L598] FCALL call write~$Pointer$({ base: 0bv32, offset: 0bv32 }, { base: ~p~0!base, offset: ~bvadd32(4bv32, ~p~0!offset) }, 4bv32); [L599] ~p~0 := ~a~0; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc28!base=2181570690bv32, #t~malloc28!offset=0bv32, #t~malloc30!base=1bv32, #t~malloc30!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] [L600-L605] COND FALSE !(!(~p~0 != { base: 0bv32, offset: 0bv32 })) [L601] FCALL call #t~mem32 := read~intINTTYPE4({ base: ~p~0!base, offset: ~p~0!offset }, 4bv32); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc28!base=2181570690bv32, #t~malloc28!offset=0bv32, #t~malloc30!base=1bv32, #t~malloc30!offset=0bv32, #t~mem32=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] [L601] COND TRUE 2bv32 != #t~mem32 [L601] havoc #t~mem32; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc28!base=2181570690bv32, #t~malloc28!offset=0bv32, #t~malloc30!base=1bv32, #t~malloc30!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] [L602] assert false; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc28!base=2181570690bv32, #t~malloc28!offset=0bv32, #t~malloc30!base=1bv32, #t~malloc30!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] [L585] List a = (List) malloc(sizeof(struct node)); VAL [a={-2113396606:0}, malloc(sizeof(struct node))={-2113396606:0}] [L586] COND FALSE !(a == 0) VAL [a={-2113396606:0}, malloc(sizeof(struct node))={-2113396606:0}] [L587] List t; [L588] List p = a; [L589] a->h = 2 VAL [a={-2113396606:0}, malloc(sizeof(struct node))={-2113396606:0}, p={-2113396606:0}] [L590] COND TRUE __VERIFIER_nondet_int() [L591] p->h = 1 [L592] 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}] [L593] 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}] [L594] p->n = t [L595] EXPR p->n [L595] p = p->n [L590] COND FALSE !(__VERIFIER_nondet_int()) [L597] p->h = 2 [L598] p->n = 0 [L599] p = a VAL [a={-2113396606:0}, malloc(sizeof(struct node))={1:0}, malloc(sizeof(struct node))={-2113396606:0}, p={-2113396606:0}, t={1:0}] [L600] COND TRUE p!=0 [L601] EXPR p->h VAL [a={-2113396606:0}, malloc(sizeof(struct node))={-2113396606:0}, malloc(sizeof(struct node))={1:0}, p={-2113396606:0}, p->h=1, t={1:0}] [L601] COND TRUE p->h != 2 [L602] __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:10:21,476 INFO L145 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/list-ext2-properties/simple_and_skiplist_2lvl_false-unreach-call.i-witness.graphml [2018-11-23 11:10:21,476 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 11:10:21,477 INFO L168 Benchmark]: Toolchain (without parser) took 12502.12 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 720.4 MB). Free memory was 1.4 GB in the beginning and 1.8 GB in the end (delta: -366.9 MB). Peak memory consumption was 353.5 MB. Max. memory is 7.1 GB. [2018-11-23 11:10:21,479 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 11:10:21,480 INFO L168 Benchmark]: CACSL2BoogieTranslator took 839.35 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 720.4 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -764.5 MB). Peak memory consumption was 49.3 MB. Max. memory is 7.1 GB. [2018-11-23 11:10:21,480 INFO L168 Benchmark]: Boogie Procedure Inliner took 42.90 ms. Allocated memory is still 2.2 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 11:10:21,481 INFO L168 Benchmark]: Boogie Preprocessor took 71.85 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.9 MB). Peak memory consumption was 13.9 MB. Max. memory is 7.1 GB. [2018-11-23 11:10:21,481 INFO L168 Benchmark]: RCFGBuilder took 3525.71 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 52.7 MB). Peak memory consumption was 52.7 MB. Max. memory is 7.1 GB. [2018-11-23 11:10:21,482 INFO L168 Benchmark]: TraceAbstraction took 7897.99 ms. Allocated memory is still 2.2 GB. Free memory was 2.1 GB in the beginning and 1.8 GB in the end (delta: 331.0 MB). Peak memory consumption was 331.0 MB. Max. memory is 7.1 GB. [2018-11-23 11:10:21,483 INFO L168 Benchmark]: Witness Printer took 118.38 ms. Allocated memory is still 2.2 GB. Free memory is still 1.8 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 11:10:21,486 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.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 839.35 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 720.4 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -764.5 MB). Peak memory consumption was 49.3 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 42.90 ms. Allocated memory is still 2.2 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 71.85 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.9 MB). Peak memory consumption was 13.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 3525.71 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 52.7 MB). Peak memory consumption was 52.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 7897.99 ms. Allocated memory is still 2.2 GB. Free memory was 2.1 GB in the beginning and 1.8 GB in the end (delta: 331.0 MB). Peak memory consumption was 331.0 MB. Max. memory is 7.1 GB. * Witness Printer took 118.38 ms. Allocated memory is still 2.2 GB. Free memory is still 1.8 GB. There was no memory consumed. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 602]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L585] List a = (List) malloc(sizeof(struct node)); VAL [a={-2113396606:0}, malloc(sizeof(struct node))={-2113396606:0}] [L586] COND FALSE !(a == 0) VAL [a={-2113396606:0}, malloc(sizeof(struct node))={-2113396606:0}] [L587] List t; [L588] List p = a; [L589] a->h = 2 VAL [a={-2113396606:0}, malloc(sizeof(struct node))={-2113396606:0}, p={-2113396606:0}] [L590] COND TRUE __VERIFIER_nondet_int() [L591] p->h = 1 [L592] t = (List) malloc(sizeof(struct node)) VAL [a={-2113396606:0}, malloc(sizeof(struct node))={-2113396606:0}, malloc(sizeof(struct node))={1:0}, p={-2113396606:0}, t={1:0}] [L593] COND FALSE !(t == 0) VAL [a={-2113396606:0}, malloc(sizeof(struct node))={-2113396606:0}, malloc(sizeof(struct node))={1:0}, p={-2113396606:0}, t={1:0}] [L594] p->n = t [L595] EXPR p->n [L595] p = p->n [L590] COND FALSE !(__VERIFIER_nondet_int()) [L597] p->h = 2 [L598] p->n = 0 [L599] p = a VAL [a={-2113396606:0}, malloc(sizeof(struct node))={1:0}, malloc(sizeof(struct node))={-2113396606:0}, p={-2113396606:0}, t={1:0}] [L600] COND TRUE p!=0 [L601] 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}] [L601] COND TRUE p->h != 2 [L602] __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 7 procedures, 52 locations, 1 error locations. UNSAFE Result, 7.8s OverallTime, 4 OverallIterations, 2 TraceHistogramMax, 4.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 81 SDtfs, 46 SDslu, 76 SDs, 0 SdLazy, 59 SolverSat, 15 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s 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=50occurred 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, 2.0s InterpolantComputationTime, 58 NumberOfCodeBlocks, 58 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 54 ConstructedInterpolants, 0 QuantifiedInterpolants, 3459 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...