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/ldv-regression/test28_false-unreach-call_true-termination.c


--------------------------------------------------------------------------------


This is Ultimate 0.1.23-61f4311
[2018-11-23 11:07:08,427 INFO  L170        SettingsManager]: Resetting all preferences to default values...
[2018-11-23 11:07:08,429 INFO  L174        SettingsManager]: Resetting UltimateCore preferences to default values
[2018-11-23 11:07:08,449 INFO  L177        SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2018-11-23 11:07:08,450 INFO  L174        SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2018-11-23 11:07:08,453 INFO  L174        SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2018-11-23 11:07:08,454 INFO  L174        SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2018-11-23 11:07:08,457 INFO  L174        SettingsManager]: Resetting LassoRanker preferences to default values
[2018-11-23 11:07:08,460 INFO  L174        SettingsManager]: Resetting Reaching Definitions preferences to default values
[2018-11-23 11:07:08,461 INFO  L174        SettingsManager]: Resetting SyntaxChecker preferences to default values
[2018-11-23 11:07:08,469 INFO  L177        SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2018-11-23 11:07:08,470 INFO  L174        SettingsManager]: Resetting LTL2Aut preferences to default values
[2018-11-23 11:07:08,471 INFO  L174        SettingsManager]: Resetting PEA to Boogie preferences to default values
[2018-11-23 11:07:08,471 INFO  L174        SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2018-11-23 11:07:08,472 INFO  L174        SettingsManager]: Resetting ChcToBoogie preferences to default values
[2018-11-23 11:07:08,476 INFO  L174        SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2018-11-23 11:07:08,477 INFO  L174        SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2018-11-23 11:07:08,481 INFO  L174        SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2018-11-23 11:07:08,484 INFO  L174        SettingsManager]: Resetting CodeCheck preferences to default values
[2018-11-23 11:07:08,487 INFO  L174        SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2018-11-23 11:07:08,489 INFO  L174        SettingsManager]: Resetting RCFGBuilder preferences to default values
[2018-11-23 11:07:08,490 INFO  L174        SettingsManager]: Resetting TraceAbstraction preferences to default values
[2018-11-23 11:07:08,493 INFO  L177        SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2018-11-23 11:07:08,493 INFO  L177        SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2018-11-23 11:07:08,493 INFO  L174        SettingsManager]: Resetting TreeAutomizer preferences to default values
[2018-11-23 11:07:08,496 INFO  L174        SettingsManager]: Resetting IcfgTransformer preferences to default values
[2018-11-23 11:07:08,497 INFO  L174        SettingsManager]: Resetting Boogie Printer preferences to default values
[2018-11-23 11:07:08,498 INFO  L174        SettingsManager]: Resetting ReqPrinter preferences to default values
[2018-11-23 11:07:08,499 INFO  L174        SettingsManager]: Resetting Witness Printer preferences to default values
[2018-11-23 11:07:08,499 INFO  L177        SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2018-11-23 11:07:08,500 INFO  L174        SettingsManager]: Resetting CDTParser preferences to default values
[2018-11-23 11:07:08,500 INFO  L177        SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2018-11-23 11:07:08,501 INFO  L177        SettingsManager]: ReqParser provides no preferences, ignoring...
[2018-11-23 11:07:08,501 INFO  L174        SettingsManager]: Resetting SmtParser preferences to default values
[2018-11-23 11:07:08,502 INFO  L174        SettingsManager]: Resetting Witness Parser preferences to default values
[2018-11-23 11:07:08,502 INFO  L181        SettingsManager]: Finished resetting all preferences to default values...
[2018-11-23 11:07:08,503 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:07:08,527 INFO  L110        SettingsManager]: Loading preferences was successful
[2018-11-23 11:07:08,527 INFO  L112        SettingsManager]: Preferences different from defaults after loading the file:
[2018-11-23 11:07:08,530 INFO  L131        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2018-11-23 11:07:08,530 INFO  L133        SettingsManager]:  * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS
[2018-11-23 11:07:08,531 INFO  L131        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2018-11-23 11:07:08,532 INFO  L133        SettingsManager]:  * Create parallel compositions if possible=false
[2018-11-23 11:07:08,532 INFO  L133        SettingsManager]:  * Use SBE=true
[2018-11-23 11:07:08,532 INFO  L131        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2018-11-23 11:07:08,532 INFO  L133        SettingsManager]:  * sizeof long=4
[2018-11-23 11:07:08,532 INFO  L133        SettingsManager]:  * sizeof POINTER=4
[2018-11-23 11:07:08,533 INFO  L133        SettingsManager]:  * Check division by zero=IGNORE
[2018-11-23 11:07:08,534 INFO  L133        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2018-11-23 11:07:08,534 INFO  L133        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2018-11-23 11:07:08,534 INFO  L133        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2018-11-23 11:07:08,534 INFO  L133        SettingsManager]:  * Use bitvectors instead of ints=true
[2018-11-23 11:07:08,535 INFO  L133        SettingsManager]:  * Memory model=HoenickeLindenmann_4ByteResolution
[2018-11-23 11:07:08,535 INFO  L133        SettingsManager]:  * sizeof long double=12
[2018-11-23 11:07:08,535 INFO  L133        SettingsManager]:  * Check if freed pointer was valid=false
[2018-11-23 11:07:08,535 INFO  L133        SettingsManager]:  * Use constant arrays=true
[2018-11-23 11:07:08,535 INFO  L133        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2018-11-23 11:07:08,537 INFO  L131        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2018-11-23 11:07:08,537 INFO  L133        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2018-11-23 11:07:08,537 INFO  L133        SettingsManager]:  * To the following directory=./dump/
[2018-11-23 11:07:08,538 INFO  L133        SettingsManager]:  * SMT solver=External_DefaultMode
[2018-11-23 11:07:08,538 INFO  L133        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2018-11-23 11:07:08,538 INFO  L131        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2018-11-23 11:07:08,538 INFO  L133        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2018-11-23 11:07:08,538 INFO  L133        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2018-11-23 11:07:08,539 INFO  L133        SettingsManager]:  * Trace refinement strategy=WOLF
[2018-11-23 11:07:08,539 INFO  L133        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2018-11-23 11:07:08,539 INFO  L133        SettingsManager]:  * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt
[2018-11-23 11:07:08,539 INFO  L133        SettingsManager]:  * Logic for external solver=AUFBV
[2018-11-23 11:07:08,539 INFO  L133        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2018-11-23 11:07:08,607 INFO  L81    nceAwareModelManager]: Repository-Root is: /tmp
[2018-11-23 11:07:08,621 INFO  L258   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2018-11-23 11:07:08,625 INFO  L214   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2018-11-23 11:07:08,626 INFO  L271        PluginConnector]: Initializing CDTParser...
[2018-11-23 11:07:08,627 INFO  L276        PluginConnector]: CDTParser initialized
[2018-11-23 11:07:08,627 INFO  L418   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-regression/test28_false-unreach-call_true-termination.c
[2018-11-23 11:07:08,684 INFO  L221              CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/329415fee/2ec5377698de4902a398f90388a416be/FLAGbfbf69117
[2018-11-23 11:07:09,177 INFO  L307              CDTParser]: Found 1 translation units.
[2018-11-23 11:07:09,178 INFO  L161              CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-regression/test28_false-unreach-call_true-termination.c
[2018-11-23 11:07:09,185 INFO  L355              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/329415fee/2ec5377698de4902a398f90388a416be/FLAGbfbf69117
[2018-11-23 11:07:09,525 INFO  L363              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/329415fee/2ec5377698de4902a398f90388a416be
[2018-11-23 11:07:09,537 INFO  L296   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2018-11-23 11:07:09,541 INFO  L131        ToolchainWalker]: Walking toolchain with 6 elements.
[2018-11-23 11:07:09,542 INFO  L113        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2018-11-23 11:07:09,542 INFO  L271        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2018-11-23 11:07:09,546 INFO  L276        PluginConnector]: CACSL2BoogieTranslator initialized
[2018-11-23 11:07:09,548 INFO  L185        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:07:09" (1/1) ...
[2018-11-23 11:07:09,552 INFO  L205        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d81cc59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:07:09, skipping insertion in model container
[2018-11-23 11:07:09,552 INFO  L185        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:07:09" (1/1) ...
[2018-11-23 11:07:09,562 INFO  L145         MainTranslator]: Starting translation in SV-COMP mode 
[2018-11-23 11:07:09,583 INFO  L176         MainTranslator]: Built tables and reachable declarations
[2018-11-23 11:07:09,843 INFO  L201          PostProcessor]: Analyzing one entry point: main
[2018-11-23 11:07:09,863 INFO  L191         MainTranslator]: Completed pre-run
[2018-11-23 11:07:09,887 INFO  L201          PostProcessor]: Analyzing one entry point: main
[2018-11-23 11:07:09,912 INFO  L195         MainTranslator]: Completed translation
[2018-11-23 11:07:09,913 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:07:09 WrapperNode
[2018-11-23 11:07:09,913 INFO  L132        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2018-11-23 11:07:09,914 INFO  L113        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2018-11-23 11:07:09,914 INFO  L271        PluginConnector]: Initializing Boogie Procedure Inliner...
[2018-11-23 11:07:09,915 INFO  L276        PluginConnector]: Boogie Procedure Inliner initialized
[2018-11-23 11:07:09,926 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:07:09" (1/1) ...
[2018-11-23 11:07:09,938 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:07:09" (1/1) ...
[2018-11-23 11:07:09,949 INFO  L132        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2018-11-23 11:07:09,950 INFO  L113        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2018-11-23 11:07:09,950 INFO  L271        PluginConnector]: Initializing Boogie Preprocessor...
[2018-11-23 11:07:09,950 INFO  L276        PluginConnector]: Boogie Preprocessor initialized
[2018-11-23 11:07:09,961 INFO  L185        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:07:09" (1/1) ...
[2018-11-23 11:07:09,961 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:07:09" (1/1) ...
[2018-11-23 11:07:09,963 INFO  L185        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:07:09" (1/1) ...
[2018-11-23 11:07:09,963 INFO  L185        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:07:09" (1/1) ...
[2018-11-23 11:07:09,980 INFO  L185        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:07:09" (1/1) ...
[2018-11-23 11:07:09,985 INFO  L185        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:07:09" (1/1) ...
[2018-11-23 11:07:09,987 INFO  L185        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:07:09" (1/1) ...
[2018-11-23 11:07:09,990 INFO  L132        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2018-11-23 11:07:09,990 INFO  L113        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2018-11-23 11:07:09,990 INFO  L271        PluginConnector]: Initializing RCFGBuilder...
[2018-11-23 11:07:09,991 INFO  L276        PluginConnector]: RCFGBuilder initialized
[2018-11-23 11:07:09,991 INFO  L185        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:07: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:07:10,108 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.init
[2018-11-23 11:07:10,109 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.init
[2018-11-23 11:07:10,109 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.alloc
[2018-11-23 11:07:10,109 INFO  L130     BoogieDeclarations]: Found specification of procedure read~intINTTYPE4
[2018-11-23 11:07:10,109 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2018-11-23 11:07:10,109 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2018-11-23 11:07:10,109 INFO  L130     BoogieDeclarations]: Found specification of procedure main
[2018-11-23 11:07:10,109 INFO  L138     BoogieDeclarations]: Found implementation of procedure main
[2018-11-23 11:07:10,110 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2018-11-23 11:07:10,110 INFO  L130     BoogieDeclarations]: Found specification of procedure write~intINTTYPE4
[2018-11-23 11:07:10,620 INFO  L275             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2018-11-23 11:07:10,621 INFO  L280             CfgBuilder]: Removed 0 assue(true) statements.
[2018-11-23 11:07:10,621 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:07:10 BoogieIcfgContainer
[2018-11-23 11:07:10,621 INFO  L132        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2018-11-23 11:07:10,622 INFO  L113        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2018-11-23 11:07:10,623 INFO  L271        PluginConnector]: Initializing TraceAbstraction...
[2018-11-23 11:07:10,626 INFO  L276        PluginConnector]: TraceAbstraction initialized
[2018-11-23 11:07:10,626 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 11:07:09" (1/3) ...
[2018-11-23 11:07:10,627 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b7b6d8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:07:10, skipping insertion in model container
[2018-11-23 11:07:10,627 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:07:09" (2/3) ...
[2018-11-23 11:07:10,628 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b7b6d8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:07:10, skipping insertion in model container
[2018-11-23 11:07:10,628 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:07:10" (3/3) ...
[2018-11-23 11:07:10,630 INFO  L112   eAbstractionObserver]: Analyzing ICFG test28_false-unreach-call_true-termination.c
[2018-11-23 11:07:10,640 INFO  L156   ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2018-11-23 11:07:10,648 INFO  L168   ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations.
[2018-11-23 11:07:10,665 INFO  L257      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2018-11-23 11:07:10,696 INFO  L133   ementStrategyFactory]: Using default assertion order modulation
[2018-11-23 11:07:10,697 INFO  L382      AbstractCegarLoop]: Interprodecural is true
[2018-11-23 11:07:10,697 INFO  L383      AbstractCegarLoop]: Hoare is true
[2018-11-23 11:07:10,697 INFO  L384      AbstractCegarLoop]: Compute interpolants for FPandBP
[2018-11-23 11:07:10,698 INFO  L385      AbstractCegarLoop]: Backedges is STRAIGHT_LINE
[2018-11-23 11:07:10,698 INFO  L386      AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2018-11-23 11:07:10,698 INFO  L387      AbstractCegarLoop]: Difference is false
[2018-11-23 11:07:10,698 INFO  L388      AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA
[2018-11-23 11:07:10,699 INFO  L393      AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce========
[2018-11-23 11:07:10,715 INFO  L276                IsEmpty]: Start isEmpty. Operand 18 states.
[2018-11-23 11:07:10,722 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 14
[2018-11-23 11:07:10,722 INFO  L394         BasicCegarLoop]: Found error trace
[2018-11-23 11:07:10,723 INFO  L402         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-11-23 11:07:10,725 INFO  L423      AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2018-11-23 11:07:10,732 INFO  L141       PredicateUnifier]: Initialized classic predicate unifier
[2018-11-23 11:07:10,733 INFO  L82        PathProgramCache]: Analyzing trace with hash 668850033, now seen corresponding path program 1 times
[2018-11-23 11:07:10,737 INFO  L223   ckRefinementStrategy]: Switched to mode CVC4_FPBP
[2018-11-23 11:07:10,737 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:07:10,759 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-11-23 11:07:10,806 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-11-23 11:07:10,827 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-11-23 11:07:10,832 INFO  L273         TraceCheckSpWp]: Computing forward predicates...
[2018-11-23 11:07:11,135 INFO  L256        TraceCheckUtils]: 0: Hoare triple {21#true} call ULTIMATE.init(); {21#true} is VALID
[2018-11-23 11:07:11,138 INFO  L273        TraceCheckUtils]: 1: Hoare triple {21#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {21#true} is VALID
[2018-11-23 11:07:11,139 INFO  L273        TraceCheckUtils]: 2: Hoare triple {21#true} assume true; {21#true} is VALID
[2018-11-23 11:07:11,139 INFO  L268        TraceCheckUtils]: 3: Hoare quadruple {21#true} {21#true} #35#return; {21#true} is VALID
[2018-11-23 11:07:11,140 INFO  L256        TraceCheckUtils]: 4: Hoare triple {21#true} call #t~ret4 := main(); {21#true} is VALID
[2018-11-23 11:07:11,140 INFO  L273        TraceCheckUtils]: 5: Hoare triple {21#true} call ~#d1~0.base, ~#d1~0.offset := #Ultimate.alloc(8bv32);call ~#d2~0.base, ~#d2~0.offset := #Ultimate.alloc(8bv32);~n~0 := #t~nondet0;havoc #t~nondet0; {21#true} is VALID
[2018-11-23 11:07:11,141 INFO  L273        TraceCheckUtils]: 6: Hoare triple {21#true} assume 0bv32 != ~n~0;#t~ite1.base, #t~ite1.offset := ~#d1~0.base, ~#d1~0.offset; {21#true} is VALID
[2018-11-23 11:07:11,141 INFO  L273        TraceCheckUtils]: 7: Hoare triple {21#true} ~pd~0.base, ~pd~0.offset := #t~ite1.base, #t~ite1.offset;havoc #t~ite1.base, #t~ite1.offset; {21#true} is VALID
[2018-11-23 11:07:11,146 INFO  L273        TraceCheckUtils]: 8: Hoare triple {21#true} assume !(~pd~0.base == ~#d2~0.base && ~pd~0.offset == ~#d2~0.offset);call write~intINTTYPE4(0bv32, ~pd~0.base, ~bvadd32(4bv32, ~pd~0.offset), 4bv32); {50#(or (not (= |main_~#d2~0.offset| main_~pd~0.offset)) (not (= |main_~#d2~0.base| main_~pd~0.base)))} is VALID
[2018-11-23 11:07:11,163 INFO  L273        TraceCheckUtils]: 9: Hoare triple {50#(or (not (= |main_~#d2~0.offset| main_~pd~0.offset)) (not (= |main_~#d2~0.base| main_~pd~0.base)))} #t~short3 := ~pd~0.base == ~#d2~0.base && ~pd~0.offset == ~#d2~0.offset; {54#(not |main_#t~short3|)} is VALID
[2018-11-23 11:07:11,178 INFO  L273        TraceCheckUtils]: 10: Hoare triple {54#(not |main_#t~short3|)} assume #t~short3;call #t~mem2 := read~intINTTYPE4(~#d2~0.base, ~bvadd32(4bv32, ~#d2~0.offset), 4bv32);#t~short3 := 0bv32 != #t~mem2; {22#false} is VALID
[2018-11-23 11:07:11,179 INFO  L273        TraceCheckUtils]: 11: Hoare triple {22#false} assume #t~short3;havoc #t~mem2;havoc #t~short3; {22#false} is VALID
[2018-11-23 11:07:11,179 INFO  L273        TraceCheckUtils]: 12: Hoare triple {22#false} assume !false; {22#false} is VALID
[2018-11-23 11:07:11,182 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:07:11,182 INFO  L312         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2018-11-23 11:07:11,187 INFO  L312   seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-11-23 11:07:11,188 INFO  L327   seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2018-11-23 11:07:11,192 INFO  L78                 Accepts]: Start accepts. Automaton has 4 states. Word has length 13
[2018-11-23 11:07:11,195 INFO  L84                 Accepts]: Finished accepts. word is accepted.
[2018-11-23 11:07:11,198 INFO  L86        InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states.
[2018-11-23 11:07:11,348 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:07:11,348 INFO  L459      AbstractCegarLoop]: Interpolant automaton has 4 states
[2018-11-23 11:07:11,359 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2018-11-23 11:07:11,359 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2018-11-23 11:07:11,364 INFO  L87              Difference]: Start difference. First operand 18 states. Second operand 4 states.
[2018-11-23 11:07:11,635 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-11-23 11:07:11,635 INFO  L93              Difference]: Finished difference Result 29 states and 35 transitions.
[2018-11-23 11:07:11,636 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2018-11-23 11:07:11,636 INFO  L78                 Accepts]: Start accepts. Automaton has 4 states. Word has length 13
[2018-11-23 11:07:11,636 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2018-11-23 11:07:11,638 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2018-11-23 11:07:11,652 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 35 transitions.
[2018-11-23 11:07:11,653 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2018-11-23 11:07:11,656 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 35 transitions.
[2018-11-23 11:07:11,656 INFO  L86        InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 35 transitions.
[2018-11-23 11:07:11,901 INFO  L119       InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 
[2018-11-23 11:07:11,912 INFO  L225             Difference]: With dead ends: 29
[2018-11-23 11:07:11,912 INFO  L226             Difference]: Without dead ends: 14
[2018-11-23 11:07:11,915 INFO  L631         BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2018-11-23 11:07:11,934 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 14 states.
[2018-11-23 11:07:11,991 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14.
[2018-11-23 11:07:11,991 INFO  L214    AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2018-11-23 11:07:11,992 INFO  L82        GeneralOperation]: Start isEquivalent. First operand 14 states. Second operand 14 states.
[2018-11-23 11:07:11,992 INFO  L74              IsIncluded]: Start isIncluded. First operand 14 states. Second operand 14 states.
[2018-11-23 11:07:11,992 INFO  L87              Difference]: Start difference. First operand 14 states. Second operand 14 states.
[2018-11-23 11:07:11,995 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-11-23 11:07:11,996 INFO  L93              Difference]: Finished difference Result 14 states and 14 transitions.
[2018-11-23 11:07:11,996 INFO  L276                IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions.
[2018-11-23 11:07:11,997 INFO  L282                IsEmpty]: Finished isEmpty. No accepting run.
[2018-11-23 11:07:11,997 INFO  L83              IsIncluded]: Finished isIncluded. Language is included
[2018-11-23 11:07:11,997 INFO  L74              IsIncluded]: Start isIncluded. First operand 14 states. Second operand 14 states.
[2018-11-23 11:07:11,997 INFO  L87              Difference]: Start difference. First operand 14 states. Second operand 14 states.
[2018-11-23 11:07:12,000 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-11-23 11:07:12,001 INFO  L93              Difference]: Finished difference Result 14 states and 14 transitions.
[2018-11-23 11:07:12,001 INFO  L276                IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions.
[2018-11-23 11:07:12,001 INFO  L282                IsEmpty]: Finished isEmpty. No accepting run.
[2018-11-23 11:07:12,001 INFO  L83              IsIncluded]: Finished isIncluded. Language is included
[2018-11-23 11:07:12,002 INFO  L88        GeneralOperation]: Finished isEquivalent.
[2018-11-23 11:07:12,002 INFO  L221    AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2018-11-23 11:07:12,002 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 14 states.
[2018-11-23 11:07:12,004 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions.
[2018-11-23 11:07:12,006 INFO  L78                 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 13
[2018-11-23 11:07:12,006 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2018-11-23 11:07:12,006 INFO  L480      AbstractCegarLoop]: Abstraction has 14 states and 14 transitions.
[2018-11-23 11:07:12,007 INFO  L481      AbstractCegarLoop]: Interpolant automaton has 4 states.
[2018-11-23 11:07:12,007 INFO  L276                IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions.
[2018-11-23 11:07:12,007 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 14
[2018-11-23 11:07:12,008 INFO  L394         BasicCegarLoop]: Found error trace
[2018-11-23 11:07:12,008 INFO  L402         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-11-23 11:07:12,008 INFO  L423      AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2018-11-23 11:07:12,008 INFO  L141       PredicateUnifier]: Initialized classic predicate unifier
[2018-11-23 11:07:12,009 INFO  L82        PathProgramCache]: Analyzing trace with hash 667002991, now seen corresponding path program 1 times
[2018-11-23 11:07:12,009 INFO  L223   ckRefinementStrategy]: Switched to mode CVC4_FPBP
[2018-11-23 11:07:12,009 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:07:12,039 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-11-23 11:07:12,077 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-11-23 11:07:12,103 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-11-23 11:07:12,105 INFO  L273         TraceCheckSpWp]: Computing forward predicates...
[2018-11-23 11:07:12,254 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1
[2018-11-23 11:07:12,255 INFO  L267         ElimStorePlain]: Start of recursive call 2:  End of recursive call:  and 1 xjuncts.
[2018-11-23 11:07:12,262 INFO  L267         ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars,  End of recursive call:  and 1 xjuncts.
[2018-11-23 11:07:12,262 INFO  L202         ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:8, output treesize:4
[2018-11-23 11:07:12,535 INFO  L256        TraceCheckUtils]: 0: Hoare triple {147#true} call ULTIMATE.init(); {147#true} is VALID
[2018-11-23 11:07:12,535 INFO  L273        TraceCheckUtils]: 1: Hoare triple {147#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {147#true} is VALID
[2018-11-23 11:07:12,536 INFO  L273        TraceCheckUtils]: 2: Hoare triple {147#true} assume true; {147#true} is VALID
[2018-11-23 11:07:12,536 INFO  L268        TraceCheckUtils]: 3: Hoare quadruple {147#true} {147#true} #35#return; {147#true} is VALID
[2018-11-23 11:07:12,536 INFO  L256        TraceCheckUtils]: 4: Hoare triple {147#true} call #t~ret4 := main(); {147#true} is VALID
[2018-11-23 11:07:12,546 INFO  L273        TraceCheckUtils]: 5: Hoare triple {147#true} call ~#d1~0.base, ~#d1~0.offset := #Ultimate.alloc(8bv32);call ~#d2~0.base, ~#d2~0.offset := #Ultimate.alloc(8bv32);~n~0 := #t~nondet0;havoc #t~nondet0; {167#(not (= |main_~#d1~0.base| |main_~#d2~0.base|))} is VALID
[2018-11-23 11:07:12,563 INFO  L273        TraceCheckUtils]: 6: Hoare triple {167#(not (= |main_~#d1~0.base| |main_~#d2~0.base|))} assume 0bv32 != ~n~0;#t~ite1.base, #t~ite1.offset := ~#d1~0.base, ~#d1~0.offset; {171#(not (= |main_#t~ite1.base| |main_~#d2~0.base|))} is VALID
[2018-11-23 11:07:12,572 INFO  L273        TraceCheckUtils]: 7: Hoare triple {171#(not (= |main_#t~ite1.base| |main_~#d2~0.base|))} ~pd~0.base, ~pd~0.offset := #t~ite1.base, #t~ite1.offset;havoc #t~ite1.base, #t~ite1.offset; {175#(not (= |main_~#d2~0.base| main_~pd~0.base))} is VALID
[2018-11-23 11:07:12,586 INFO  L273        TraceCheckUtils]: 8: Hoare triple {175#(not (= |main_~#d2~0.base| main_~pd~0.base))} assume ~pd~0.base == ~#d2~0.base && ~pd~0.offset == ~#d2~0.offset;call write~intINTTYPE4(0bv32, ~pd~0.base, ~pd~0.offset, 4bv32); {148#false} is VALID
[2018-11-23 11:07:12,586 INFO  L273        TraceCheckUtils]: 9: Hoare triple {148#false} #t~short3 := ~pd~0.base == ~#d2~0.base && ~pd~0.offset == ~#d2~0.offset; {148#false} is VALID
[2018-11-23 11:07:12,587 INFO  L273        TraceCheckUtils]: 10: Hoare triple {148#false} assume #t~short3;call #t~mem2 := read~intINTTYPE4(~#d2~0.base, ~bvadd32(4bv32, ~#d2~0.offset), 4bv32);#t~short3 := 0bv32 != #t~mem2; {148#false} is VALID
[2018-11-23 11:07:12,587 INFO  L273        TraceCheckUtils]: 11: Hoare triple {148#false} assume #t~short3;havoc #t~mem2;havoc #t~short3; {148#false} is VALID
[2018-11-23 11:07:12,587 INFO  L273        TraceCheckUtils]: 12: Hoare triple {148#false} assume !false; {148#false} is VALID
[2018-11-23 11:07:12,589 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:07:12,589 INFO  L312         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2018-11-23 11:07:12,592 INFO  L312   seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-11-23 11:07:12,593 INFO  L327   seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2018-11-23 11:07:12,594 INFO  L78                 Accepts]: Start accepts. Automaton has 5 states. Word has length 13
[2018-11-23 11:07:12,597 INFO  L84                 Accepts]: Finished accepts. word is accepted.
[2018-11-23 11:07:12,597 INFO  L86        InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states.
[2018-11-23 11:07:12,667 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:07:12,667 INFO  L459      AbstractCegarLoop]: Interpolant automaton has 5 states
[2018-11-23 11:07:12,668 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2018-11-23 11:07:12,668 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2018-11-23 11:07:12,668 INFO  L87              Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 5 states.
[2018-11-23 11:07:13,009 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-11-23 11:07:13,009 INFO  L93              Difference]: Finished difference Result 21 states and 20 transitions.
[2018-11-23 11:07:13,009 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2018-11-23 11:07:13,009 INFO  L78                 Accepts]: Start accepts. Automaton has 5 states. Word has length 13
[2018-11-23 11:07:13,010 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2018-11-23 11:07:13,010 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2018-11-23 11:07:13,012 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 20 transitions.
[2018-11-23 11:07:13,012 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2018-11-23 11:07:13,014 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 20 transitions.
[2018-11-23 11:07:13,014 INFO  L86        InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 20 transitions.
[2018-11-23 11:07:13,104 INFO  L119       InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 
[2018-11-23 11:07:13,106 INFO  L225             Difference]: With dead ends: 21
[2018-11-23 11:07:13,107 INFO  L226             Difference]: Without dead ends: 14
[2018-11-23 11:07:13,108 INFO  L631         BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2018-11-23 11:07:13,108 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 14 states.
[2018-11-23 11:07:13,121 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14.
[2018-11-23 11:07:13,123 INFO  L214    AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2018-11-23 11:07:13,123 INFO  L82        GeneralOperation]: Start isEquivalent. First operand 14 states. Second operand 14 states.
[2018-11-23 11:07:13,123 INFO  L74              IsIncluded]: Start isIncluded. First operand 14 states. Second operand 14 states.
[2018-11-23 11:07:13,124 INFO  L87              Difference]: Start difference. First operand 14 states. Second operand 14 states.
[2018-11-23 11:07:13,126 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-11-23 11:07:13,126 INFO  L93              Difference]: Finished difference Result 14 states and 13 transitions.
[2018-11-23 11:07:13,126 INFO  L276                IsEmpty]: Start isEmpty. Operand 14 states and 13 transitions.
[2018-11-23 11:07:13,127 INFO  L282                IsEmpty]: Finished isEmpty. No accepting run.
[2018-11-23 11:07:13,127 INFO  L83              IsIncluded]: Finished isIncluded. Language is included
[2018-11-23 11:07:13,127 INFO  L74              IsIncluded]: Start isIncluded. First operand 14 states. Second operand 14 states.
[2018-11-23 11:07:13,128 INFO  L87              Difference]: Start difference. First operand 14 states. Second operand 14 states.
[2018-11-23 11:07:13,129 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-11-23 11:07:13,129 INFO  L93              Difference]: Finished difference Result 14 states and 13 transitions.
[2018-11-23 11:07:13,130 INFO  L276                IsEmpty]: Start isEmpty. Operand 14 states and 13 transitions.
[2018-11-23 11:07:13,130 INFO  L282                IsEmpty]: Finished isEmpty. No accepting run.
[2018-11-23 11:07:13,130 INFO  L83              IsIncluded]: Finished isIncluded. Language is included
[2018-11-23 11:07:13,131 INFO  L88        GeneralOperation]: Finished isEquivalent.
[2018-11-23 11:07:13,131 INFO  L221    AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2018-11-23 11:07:13,131 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 14 states.
[2018-11-23 11:07:13,132 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 13 transitions.
[2018-11-23 11:07:13,133 INFO  L78                 Accepts]: Start accepts. Automaton has 14 states and 13 transitions. Word has length 13
[2018-11-23 11:07:13,133 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2018-11-23 11:07:13,133 INFO  L480      AbstractCegarLoop]: Abstraction has 14 states and 13 transitions.
[2018-11-23 11:07:13,133 INFO  L481      AbstractCegarLoop]: Interpolant automaton has 5 states.
[2018-11-23 11:07:13,133 INFO  L276                IsEmpty]: Start isEmpty. Operand 14 states and 13 transitions.
[2018-11-23 11:07:13,134 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 14
[2018-11-23 11:07:13,134 INFO  L394         BasicCegarLoop]: Found error trace
[2018-11-23 11:07:13,134 INFO  L402         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-11-23 11:07:13,135 INFO  L423      AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2018-11-23 11:07:13,135 INFO  L141       PredicateUnifier]: Initialized classic predicate unifier
[2018-11-23 11:07:13,135 INFO  L82        PathProgramCache]: Analyzing trace with hash -1852956943, now seen corresponding path program 1 times
[2018-11-23 11:07:13,135 INFO  L223   ckRefinementStrategy]: Switched to mode CVC4_FPBP
[2018-11-23 11:07:13,136 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:07:13,164 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-11-23 11:07:13,197 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2018-11-23 11:07:13,226 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2018-11-23 11:07:13,251 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   #35#return;
     VAL   [|#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32)]
[?]  CALL  call #t~ret4 := main();
     VAL   [|#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32)]
[?]        call ~#d1~0.base, ~#d1~0.offset := #Ultimate.alloc(8bv32);call ~#d2~0.base, ~#d2~0.offset := #Ultimate.alloc(8bv32);~n~0 := #t~nondet0;havoc #t~nondet0;
     VAL   [main_~n~0=(_ bv0 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_~#d1~0.base|=(_ bv2 32), |main_~#d1~0.offset|=(_ bv0 32), |main_~#d2~0.base|=(_ bv1 32), |main_~#d2~0.offset|=(_ bv0 32)]
[?]        assume !(0bv32 != ~n~0);#t~ite1.base, #t~ite1.offset := ~#d2~0.base, ~#d2~0.offset;
     VAL   [main_~n~0=(_ bv0 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_#t~ite1.base|=(_ bv1 32), |main_#t~ite1.offset|=(_ bv0 32), |main_~#d1~0.base|=(_ bv2 32), |main_~#d1~0.offset|=(_ bv0 32), |main_~#d2~0.base|=(_ bv1 32), |main_~#d2~0.offset|=(_ bv0 32)]
[?]        ~pd~0.base, ~pd~0.offset := #t~ite1.base, #t~ite1.offset;havoc #t~ite1.base, #t~ite1.offset;
     VAL   [main_~n~0=(_ bv0 32), main_~pd~0.base=(_ bv1 32), main_~pd~0.offset=(_ bv0 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_~#d1~0.base|=(_ bv2 32), |main_~#d1~0.offset|=(_ bv0 32), |main_~#d2~0.base|=(_ bv1 32), |main_~#d2~0.offset|=(_ bv0 32)]
[?]        assume ~pd~0.base == ~#d2~0.base && ~pd~0.offset == ~#d2~0.offset;call write~intINTTYPE4(0bv32, ~pd~0.base, ~pd~0.offset, 4bv32);
     VAL   [main_~n~0=(_ bv0 32), main_~pd~0.base=(_ bv1 32), main_~pd~0.offset=(_ bv0 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_~#d1~0.base|=(_ bv2 32), |main_~#d1~0.offset|=(_ bv0 32), |main_~#d2~0.base|=(_ bv1 32), |main_~#d2~0.offset|=(_ bv0 32)]
[?]        #t~short3 := ~pd~0.base == ~#d2~0.base && ~pd~0.offset == ~#d2~0.offset;
     VAL   [main_~n~0=(_ bv0 32), main_~pd~0.base=(_ bv1 32), main_~pd~0.offset=(_ bv0 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_#t~short3|=true, |main_~#d1~0.base|=(_ bv2 32), |main_~#d1~0.offset|=(_ bv0 32), |main_~#d2~0.base|=(_ bv1 32), |main_~#d2~0.offset|=(_ bv0 32)]
[?]        assume #t~short3;call #t~mem2 := read~intINTTYPE4(~#d2~0.base, ~bvadd32(4bv32, ~#d2~0.offset), 4bv32);#t~short3 := 0bv32 != #t~mem2;
     VAL   [main_~n~0=(_ bv0 32), main_~pd~0.base=(_ bv1 32), main_~pd~0.offset=(_ bv0 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_#t~mem2|=(_ bv1 32), |main_#t~short3|=true, |main_~#d1~0.base|=(_ bv2 32), |main_~#d1~0.offset|=(_ bv0 32), |main_~#d2~0.base|=(_ bv1 32), |main_~#d2~0.offset|=(_ bv0 32)]
[?]        assume #t~short3;havoc #t~mem2;havoc #t~short3;
     VAL   [main_~n~0=(_ bv0 32), main_~pd~0.base=(_ bv1 32), main_~pd~0.offset=(_ bv0 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_~#d1~0.base|=(_ bv2 32), |main_~#d1~0.offset|=(_ bv0 32), |main_~#d2~0.base|=(_ bv1 32), |main_~#d2~0.offset|=(_ bv0 32)]
[?]        assume !false;
     VAL   [main_~n~0=(_ bv0 32), main_~pd~0.base=(_ bv1 32), main_~pd~0.offset=(_ bv0 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_~#d1~0.base|=(_ bv2 32), |main_~#d1~0.offset|=(_ bv0 32), |main_~#d2~0.base|=(_ bv1 32), |main_~#d2~0.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~ret4 := main();
           VAL   [#NULL.base=0bv32, #NULL.offset=0bv32]
[L12]            call ~#d1~0.base, ~#d1~0.offset := #Ultimate.alloc(8bv32);
[L12]            call ~#d2~0.base, ~#d2~0.offset := #Ultimate.alloc(8bv32);
[L13]            ~n~0 := #t~nondet0;
[L13]            havoc #t~nondet0;
           VAL   [#NULL.base=0bv32, #NULL.offset=0bv32, ~#d1~0.base=2bv32, ~#d1~0.offset=0bv32, ~#d2~0.base=1bv32, ~#d2~0.offset=0bv32, ~n~0=0bv32]
[L14]            assume !(0bv32 != ~n~0);
[L14]            #t~ite1.base, #t~ite1.offset := ~#d2~0.base, ~#d2~0.offset;
           VAL   [#NULL.base=0bv32, #NULL.offset=0bv32, #t~ite1.base=1bv32, #t~ite1.offset=0bv32, ~#d1~0.base=2bv32, ~#d1~0.offset=0bv32, ~#d2~0.base=1bv32, ~#d2~0.offset=0bv32, ~n~0=0bv32]
[L14]            ~pd~0.base, ~pd~0.offset := #t~ite1.base, #t~ite1.offset;
[L14]            havoc #t~ite1.base, #t~ite1.offset;
           VAL   [#NULL.base=0bv32, #NULL.offset=0bv32, ~#d1~0.base=2bv32, ~#d1~0.offset=0bv32, ~#d2~0.base=1bv32, ~#d2~0.offset=0bv32, ~n~0=0bv32, ~pd~0.base=1bv32, ~pd~0.offset=0bv32]
[L15-L19]        assume ~pd~0.base == ~#d2~0.base && ~pd~0.offset == ~#d2~0.offset;
[L16]            call write~intINTTYPE4(0bv32, ~pd~0.base, ~pd~0.offset, 4bv32);
           VAL   [#NULL.base=0bv32, #NULL.offset=0bv32, ~#d1~0.base=2bv32, ~#d1~0.offset=0bv32, ~#d2~0.base=1bv32, ~#d2~0.offset=0bv32, ~n~0=0bv32, ~pd~0.base=1bv32, ~pd~0.offset=0bv32]
[L20]            #t~short3 := ~pd~0.base == ~#d2~0.base && ~pd~0.offset == ~#d2~0.offset;
           VAL   [#NULL.base=0bv32, #NULL.offset=0bv32, #t~short3=true, ~#d1~0.base=2bv32, ~#d1~0.offset=0bv32, ~#d2~0.base=1bv32, ~#d2~0.offset=0bv32, ~n~0=0bv32, ~pd~0.base=1bv32, ~pd~0.offset=0bv32]
[L20]            assume #t~short3;
[L20]            call #t~mem2 := read~intINTTYPE4(~#d2~0.base, ~bvadd32(4bv32, ~#d2~0.offset), 4bv32);
[L20]            #t~short3 := 0bv32 != #t~mem2;
           VAL   [#NULL.base=0bv32, #NULL.offset=0bv32, #t~mem2=1bv32, #t~short3=true, ~#d1~0.base=2bv32, ~#d1~0.offset=0bv32, ~#d2~0.base=1bv32, ~#d2~0.offset=0bv32, ~n~0=0bv32, ~pd~0.base=1bv32, ~pd~0.offset=0bv32]
[L20-L22]        assume #t~short3;
[L20]            havoc #t~mem2;
[L20]            havoc #t~short3;
           VAL   [#NULL.base=0bv32, #NULL.offset=0bv32, ~#d1~0.base=2bv32, ~#d1~0.offset=0bv32, ~#d2~0.base=1bv32, ~#d2~0.offset=0bv32, ~n~0=0bv32, ~pd~0.base=1bv32, ~pd~0.offset=0bv32]
[L26]            assert false;
           VAL   [#NULL.base=0bv32, #NULL.offset=0bv32, ~#d1~0.base=2bv32, ~#d1~0.offset=0bv32, ~#d2~0.base=1bv32, ~#d2~0.offset=0bv32, ~n~0=0bv32, ~pd~0.base=1bv32, ~pd~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~ret4 := main();
           VAL   [#NULL.base=0bv32, #NULL.offset=0bv32]
[L12]            call ~#d1~0.base, ~#d1~0.offset := #Ultimate.alloc(8bv32);
[L12]            call ~#d2~0.base, ~#d2~0.offset := #Ultimate.alloc(8bv32);
[L13]            ~n~0 := #t~nondet0;
[L13]            havoc #t~nondet0;
           VAL   [#NULL.base=0bv32, #NULL.offset=0bv32, ~#d1~0.base=2bv32, ~#d1~0.offset=0bv32, ~#d2~0.base=1bv32, ~#d2~0.offset=0bv32, ~n~0=0bv32]
[L14]            assume !(0bv32 != ~n~0);
[L14]            #t~ite1.base, #t~ite1.offset := ~#d2~0.base, ~#d2~0.offset;
           VAL   [#NULL.base=0bv32, #NULL.offset=0bv32, #t~ite1.base=1bv32, #t~ite1.offset=0bv32, ~#d1~0.base=2bv32, ~#d1~0.offset=0bv32, ~#d2~0.base=1bv32, ~#d2~0.offset=0bv32, ~n~0=0bv32]
[L14]            ~pd~0.base, ~pd~0.offset := #t~ite1.base, #t~ite1.offset;
[L14]            havoc #t~ite1.base, #t~ite1.offset;
           VAL   [#NULL.base=0bv32, #NULL.offset=0bv32, ~#d1~0.base=2bv32, ~#d1~0.offset=0bv32, ~#d2~0.base=1bv32, ~#d2~0.offset=0bv32, ~n~0=0bv32, ~pd~0.base=1bv32, ~pd~0.offset=0bv32]
[L15-L19]        assume ~pd~0.base == ~#d2~0.base && ~pd~0.offset == ~#d2~0.offset;
[L16]            call write~intINTTYPE4(0bv32, ~pd~0.base, ~pd~0.offset, 4bv32);
           VAL   [#NULL.base=0bv32, #NULL.offset=0bv32, ~#d1~0.base=2bv32, ~#d1~0.offset=0bv32, ~#d2~0.base=1bv32, ~#d2~0.offset=0bv32, ~n~0=0bv32, ~pd~0.base=1bv32, ~pd~0.offset=0bv32]
[L20]            #t~short3 := ~pd~0.base == ~#d2~0.base && ~pd~0.offset == ~#d2~0.offset;
           VAL   [#NULL.base=0bv32, #NULL.offset=0bv32, #t~short3=true, ~#d1~0.base=2bv32, ~#d1~0.offset=0bv32, ~#d2~0.base=1bv32, ~#d2~0.offset=0bv32, ~n~0=0bv32, ~pd~0.base=1bv32, ~pd~0.offset=0bv32]
[L20]            assume #t~short3;
[L20]            call #t~mem2 := read~intINTTYPE4(~#d2~0.base, ~bvadd32(4bv32, ~#d2~0.offset), 4bv32);
[L20]            #t~short3 := 0bv32 != #t~mem2;
           VAL   [#NULL.base=0bv32, #NULL.offset=0bv32, #t~mem2=1bv32, #t~short3=true, ~#d1~0.base=2bv32, ~#d1~0.offset=0bv32, ~#d2~0.base=1bv32, ~#d2~0.offset=0bv32, ~n~0=0bv32, ~pd~0.base=1bv32, ~pd~0.offset=0bv32]
[L20-L22]        assume #t~short3;
[L20]            havoc #t~mem2;
[L20]            havoc #t~short3;
           VAL   [#NULL.base=0bv32, #NULL.offset=0bv32, ~#d1~0.base=2bv32, ~#d1~0.offset=0bv32, ~#d2~0.base=1bv32, ~#d2~0.offset=0bv32, ~n~0=0bv32, ~pd~0.base=1bv32, ~pd~0.offset=0bv32]
[L26]            assert false;
           VAL   [#NULL.base=0bv32, #NULL.offset=0bv32, ~#d1~0.base=2bv32, ~#d1~0.offset=0bv32, ~#d2~0.base=1bv32, ~#d2~0.offset=0bv32, ~n~0=0bv32, ~pd~0.base=1bv32, ~pd~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~ret4 := main();
       VAL         [#NULL!base=0bv32, #NULL!offset=0bv32]
[L12]  FCALL       call ~#d1~0 := #Ultimate.alloc(8bv32);
[L12]  FCALL       call ~#d2~0 := #Ultimate.alloc(8bv32);
[L13]              ~n~0 := #t~nondet0;
[L13]              havoc #t~nondet0;
       VAL         [#NULL!base=0bv32, #NULL!offset=0bv32, ~#d1~0!base=2bv32, ~#d1~0!offset=0bv32, ~#d2~0!base=1bv32, ~#d2~0!offset=0bv32, ~n~0=0bv32]
[L14]  COND FALSE  !(0bv32 != ~n~0)
[L14]              #t~ite1 := ~#d2~0;
       VAL         [#NULL!base=0bv32, #NULL!offset=0bv32, #t~ite1!base=1bv32, #t~ite1!offset=0bv32, ~#d1~0!base=2bv32, ~#d1~0!offset=0bv32, ~#d2~0!base=1bv32, ~#d2~0!offset=0bv32, ~n~0=0bv32]
[L14]              ~pd~0 := #t~ite1;
[L14]              havoc #t~ite1;
       VAL         [#NULL!base=0bv32, #NULL!offset=0bv32, ~#d1~0!base=2bv32, ~#d1~0!offset=0bv32, ~#d2~0!base=1bv32, ~#d2~0!offset=0bv32, ~n~0=0bv32, ~pd~0!base=1bv32, ~pd~0!offset=0bv32]
[L15]  COND TRUE   ~pd~0 == ~#d2~0
[L16]  FCALL       call write~intINTTYPE4(0bv32, { base: ~pd~0!base, offset: ~pd~0!offset }, 4bv32);
       VAL         [#NULL!base=0bv32, #NULL!offset=0bv32, ~#d1~0!base=2bv32, ~#d1~0!offset=0bv32, ~#d2~0!base=1bv32, ~#d2~0!offset=0bv32, ~n~0=0bv32, ~pd~0!base=1bv32, ~pd~0!offset=0bv32]
[L20]              #t~short3 := ~pd~0 == ~#d2~0;
       VAL         [#NULL!base=0bv32, #NULL!offset=0bv32, #t~short3=true, ~#d1~0!base=2bv32, ~#d1~0!offset=0bv32, ~#d2~0!base=1bv32, ~#d2~0!offset=0bv32, ~n~0=0bv32, ~pd~0!base=1bv32, ~pd~0!offset=0bv32]
[L20]  COND TRUE   #t~short3
[L20]  FCALL       call #t~mem2 := read~intINTTYPE4({ base: ~#d2~0!base, offset: ~bvadd32(4bv32, ~#d2~0!offset) }, 4bv32);
[L20]              #t~short3 := 0bv32 != #t~mem2;
       VAL         [#NULL!base=0bv32, #NULL!offset=0bv32, #t~mem2=1bv32, #t~short3=true, ~#d1~0!base=2bv32, ~#d1~0!offset=0bv32, ~#d2~0!base=1bv32, ~#d2~0!offset=0bv32, ~n~0=0bv32, ~pd~0!base=1bv32, ~pd~0!offset=0bv32]
[L20]  COND TRUE   #t~short3
[L20]              havoc #t~mem2;
[L20]              havoc #t~short3;
       VAL         [#NULL!base=0bv32, #NULL!offset=0bv32, ~#d1~0!base=2bv32, ~#d1~0!offset=0bv32, ~#d2~0!base=1bv32, ~#d2~0!offset=0bv32, ~n~0=0bv32, ~pd~0!base=1bv32, ~pd~0!offset=0bv32]
[L26]              assert false;
       VAL         [#NULL!base=0bv32, #NULL!offset=0bv32, ~#d1~0!base=2bv32, ~#d1~0!offset=0bv32, ~#d2~0!base=1bv32, ~#d2~0!offset=0bv32, ~n~0=0bv32, ~pd~0!base=1bv32, ~pd~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~ret4 := main();
       VAL         [#NULL!base=0bv32, #NULL!offset=0bv32]
[L12]  FCALL       call ~#d1~0 := #Ultimate.alloc(8bv32);
[L12]  FCALL       call ~#d2~0 := #Ultimate.alloc(8bv32);
[L13]              ~n~0 := #t~nondet0;
[L13]              havoc #t~nondet0;
       VAL         [#NULL!base=0bv32, #NULL!offset=0bv32, ~#d1~0!base=2bv32, ~#d1~0!offset=0bv32, ~#d2~0!base=1bv32, ~#d2~0!offset=0bv32, ~n~0=0bv32]
[L14]  COND FALSE  !(0bv32 != ~n~0)
[L14]              #t~ite1 := ~#d2~0;
       VAL         [#NULL!base=0bv32, #NULL!offset=0bv32, #t~ite1!base=1bv32, #t~ite1!offset=0bv32, ~#d1~0!base=2bv32, ~#d1~0!offset=0bv32, ~#d2~0!base=1bv32, ~#d2~0!offset=0bv32, ~n~0=0bv32]
[L14]              ~pd~0 := #t~ite1;
[L14]              havoc #t~ite1;
       VAL         [#NULL!base=0bv32, #NULL!offset=0bv32, ~#d1~0!base=2bv32, ~#d1~0!offset=0bv32, ~#d2~0!base=1bv32, ~#d2~0!offset=0bv32, ~n~0=0bv32, ~pd~0!base=1bv32, ~pd~0!offset=0bv32]
[L15]  COND TRUE   ~pd~0 == ~#d2~0
[L16]  FCALL       call write~intINTTYPE4(0bv32, { base: ~pd~0!base, offset: ~pd~0!offset }, 4bv32);
       VAL         [#NULL!base=0bv32, #NULL!offset=0bv32, ~#d1~0!base=2bv32, ~#d1~0!offset=0bv32, ~#d2~0!base=1bv32, ~#d2~0!offset=0bv32, ~n~0=0bv32, ~pd~0!base=1bv32, ~pd~0!offset=0bv32]
[L20]              #t~short3 := ~pd~0 == ~#d2~0;
       VAL         [#NULL!base=0bv32, #NULL!offset=0bv32, #t~short3=true, ~#d1~0!base=2bv32, ~#d1~0!offset=0bv32, ~#d2~0!base=1bv32, ~#d2~0!offset=0bv32, ~n~0=0bv32, ~pd~0!base=1bv32, ~pd~0!offset=0bv32]
[L20]  COND TRUE   #t~short3
[L20]  FCALL       call #t~mem2 := read~intINTTYPE4({ base: ~#d2~0!base, offset: ~bvadd32(4bv32, ~#d2~0!offset) }, 4bv32);
[L20]              #t~short3 := 0bv32 != #t~mem2;
       VAL         [#NULL!base=0bv32, #NULL!offset=0bv32, #t~mem2=1bv32, #t~short3=true, ~#d1~0!base=2bv32, ~#d1~0!offset=0bv32, ~#d2~0!base=1bv32, ~#d2~0!offset=0bv32, ~n~0=0bv32, ~pd~0!base=1bv32, ~pd~0!offset=0bv32]
[L20]  COND TRUE   #t~short3
[L20]              havoc #t~mem2;
[L20]              havoc #t~short3;
       VAL         [#NULL!base=0bv32, #NULL!offset=0bv32, ~#d1~0!base=2bv32, ~#d1~0!offset=0bv32, ~#d2~0!base=1bv32, ~#d2~0!offset=0bv32, ~n~0=0bv32, ~pd~0!base=1bv32, ~pd~0!offset=0bv32]
[L26]              assert false;
       VAL         [#NULL!base=0bv32, #NULL!offset=0bv32, ~#d1~0!base=2bv32, ~#d1~0!offset=0bv32, ~#d2~0!base=1bv32, ~#d2~0!offset=0bv32, ~n~0=0bv32, ~pd~0!base=1bv32, ~pd~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~ret4 := main();
       VAL         [#NULL!base=0bv32, #NULL!offset=0bv32]
[L12]  FCALL       call ~#d1~0 := #Ultimate.alloc(8bv32);
[L12]  FCALL       call ~#d2~0 := #Ultimate.alloc(8bv32);
[L13]              ~n~0 := #t~nondet0;
[L13]              havoc #t~nondet0;
       VAL         [#NULL!base=0bv32, #NULL!offset=0bv32, ~#d1~0!base=2bv32, ~#d1~0!offset=0bv32, ~#d2~0!base=1bv32, ~#d2~0!offset=0bv32, ~n~0=0bv32]
[L14]  COND FALSE  !(0bv32 != ~n~0)
[L14]              #t~ite1 := ~#d2~0;
       VAL         [#NULL!base=0bv32, #NULL!offset=0bv32, #t~ite1!base=1bv32, #t~ite1!offset=0bv32, ~#d1~0!base=2bv32, ~#d1~0!offset=0bv32, ~#d2~0!base=1bv32, ~#d2~0!offset=0bv32, ~n~0=0bv32]
[L14]              ~pd~0 := #t~ite1;
[L14]              havoc #t~ite1;
       VAL         [#NULL!base=0bv32, #NULL!offset=0bv32, ~#d1~0!base=2bv32, ~#d1~0!offset=0bv32, ~#d2~0!base=1bv32, ~#d2~0!offset=0bv32, ~n~0=0bv32, ~pd~0!base=1bv32, ~pd~0!offset=0bv32]
[L15]  COND TRUE   ~pd~0 == ~#d2~0
[L16]  FCALL       call write~intINTTYPE4(0bv32, { base: ~pd~0!base, offset: ~pd~0!offset }, 4bv32);
       VAL         [#NULL!base=0bv32, #NULL!offset=0bv32, ~#d1~0!base=2bv32, ~#d1~0!offset=0bv32, ~#d2~0!base=1bv32, ~#d2~0!offset=0bv32, ~n~0=0bv32, ~pd~0!base=1bv32, ~pd~0!offset=0bv32]
[L20]              #t~short3 := ~pd~0 == ~#d2~0;
       VAL         [#NULL!base=0bv32, #NULL!offset=0bv32, #t~short3=true, ~#d1~0!base=2bv32, ~#d1~0!offset=0bv32, ~#d2~0!base=1bv32, ~#d2~0!offset=0bv32, ~n~0=0bv32, ~pd~0!base=1bv32, ~pd~0!offset=0bv32]
[L20]  COND TRUE   #t~short3
[L20]  FCALL       call #t~mem2 := read~intINTTYPE4({ base: ~#d2~0!base, offset: ~bvadd32(4bv32, ~#d2~0!offset) }, 4bv32);
[L20]              #t~short3 := 0bv32 != #t~mem2;
       VAL         [#NULL!base=0bv32, #NULL!offset=0bv32, #t~mem2=1bv32, #t~short3=true, ~#d1~0!base=2bv32, ~#d1~0!offset=0bv32, ~#d2~0!base=1bv32, ~#d2~0!offset=0bv32, ~n~0=0bv32, ~pd~0!base=1bv32, ~pd~0!offset=0bv32]
[L20]  COND TRUE   #t~short3
[L20]              havoc #t~mem2;
[L20]              havoc #t~short3;
       VAL         [#NULL!base=0bv32, #NULL!offset=0bv32, ~#d1~0!base=2bv32, ~#d1~0!offset=0bv32, ~#d2~0!base=1bv32, ~#d2~0!offset=0bv32, ~n~0=0bv32, ~pd~0!base=1bv32, ~pd~0!offset=0bv32]
[L26]              assert false;
       VAL         [#NULL!base=0bv32, #NULL!offset=0bv32, ~#d1~0!base=2bv32, ~#d1~0!offset=0bv32, ~#d2~0!base=1bv32, ~#d2~0!offset=0bv32, ~n~0=0bv32, ~pd~0!base=1bv32, ~pd~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~ret4 := main();
       VAL         [#NULL!base=0bv32, #NULL!offset=0bv32]
[L12]  FCALL       call ~#d1~0 := #Ultimate.alloc(8bv32);
[L12]  FCALL       call ~#d2~0 := #Ultimate.alloc(8bv32);
[L13]              ~n~0 := #t~nondet0;
[L13]              havoc #t~nondet0;
       VAL         [#NULL!base=0bv32, #NULL!offset=0bv32, ~#d1~0!base=2bv32, ~#d1~0!offset=0bv32, ~#d2~0!base=1bv32, ~#d2~0!offset=0bv32, ~n~0=0bv32]
[L14]  COND FALSE  !(0bv32 != ~n~0)
[L14]              #t~ite1 := ~#d2~0;
       VAL         [#NULL!base=0bv32, #NULL!offset=0bv32, #t~ite1!base=1bv32, #t~ite1!offset=0bv32, ~#d1~0!base=2bv32, ~#d1~0!offset=0bv32, ~#d2~0!base=1bv32, ~#d2~0!offset=0bv32, ~n~0=0bv32]
[L14]              ~pd~0 := #t~ite1;
[L14]              havoc #t~ite1;
       VAL         [#NULL!base=0bv32, #NULL!offset=0bv32, ~#d1~0!base=2bv32, ~#d1~0!offset=0bv32, ~#d2~0!base=1bv32, ~#d2~0!offset=0bv32, ~n~0=0bv32, ~pd~0!base=1bv32, ~pd~0!offset=0bv32]
[L15]  COND TRUE   ~pd~0 == ~#d2~0
[L16]  FCALL       call write~intINTTYPE4(0bv32, { base: ~pd~0!base, offset: ~pd~0!offset }, 4bv32);
       VAL         [#NULL!base=0bv32, #NULL!offset=0bv32, ~#d1~0!base=2bv32, ~#d1~0!offset=0bv32, ~#d2~0!base=1bv32, ~#d2~0!offset=0bv32, ~n~0=0bv32, ~pd~0!base=1bv32, ~pd~0!offset=0bv32]
[L20]              #t~short3 := ~pd~0 == ~#d2~0;
       VAL         [#NULL!base=0bv32, #NULL!offset=0bv32, #t~short3=true, ~#d1~0!base=2bv32, ~#d1~0!offset=0bv32, ~#d2~0!base=1bv32, ~#d2~0!offset=0bv32, ~n~0=0bv32, ~pd~0!base=1bv32, ~pd~0!offset=0bv32]
[L20]  COND TRUE   #t~short3
[L20]  FCALL       call #t~mem2 := read~intINTTYPE4({ base: ~#d2~0!base, offset: ~bvadd32(4bv32, ~#d2~0!offset) }, 4bv32);
[L20]              #t~short3 := 0bv32 != #t~mem2;
       VAL         [#NULL!base=0bv32, #NULL!offset=0bv32, #t~mem2=1bv32, #t~short3=true, ~#d1~0!base=2bv32, ~#d1~0!offset=0bv32, ~#d2~0!base=1bv32, ~#d2~0!offset=0bv32, ~n~0=0bv32, ~pd~0!base=1bv32, ~pd~0!offset=0bv32]
[L20]  COND TRUE   #t~short3
[L20]              havoc #t~mem2;
[L20]              havoc #t~short3;
       VAL         [#NULL!base=0bv32, #NULL!offset=0bv32, ~#d1~0!base=2bv32, ~#d1~0!offset=0bv32, ~#d2~0!base=1bv32, ~#d2~0!offset=0bv32, ~n~0=0bv32, ~pd~0!base=1bv32, ~pd~0!offset=0bv32]
[L26]              assert false;
       VAL         [#NULL!base=0bv32, #NULL!offset=0bv32, ~#d1~0!base=2bv32, ~#d1~0!offset=0bv32, ~#d2~0!base=1bv32, ~#d2~0!offset=0bv32, ~n~0=0bv32, ~pd~0!base=1bv32, ~pd~0!offset=0bv32]


[L12]             struct dummy d1, d2;
[L13]             int n = __VERIFIER_nondet_int();
[L14]  EXPR       n ? &d1 : &d2
       VAL        [d1={2:0}, d2={1:0}, n=0, n ? &d1 : &d2={1:0}]
[L14]             struct dummy *pd = n ? &d1 : &d2;
[L15]  COND TRUE  pd == &d2
[L16]             pd->a = 0
       VAL        [d1={2:0}, d2={1:0}, n=0, pd={1:0}]
[L20]             pd == &d2 && d2.b != 0
[L20]  EXPR       d2.b
[L20]             pd == &d2 && d2.b != 0
       VAL        [d1={2:0}, d2={1:0}, d2.b=1, n=0, pd={1:0}, pd == &d2 && d2.b != 0=1]
[L20]  COND TRUE  pd == &d2 && d2.b != 0
[L26]             __VERIFIER_error()
       VAL        [d1={2:0}, d2={1:0}, n=0, pd={1:0}]

-----
[2018-11-23 11:07:13,337 WARN  L170   areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation
[2018-11-23 11:07:13,338 WARN  L170   areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation
[2018-11-23 11:07:13,341 WARN  L170   areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation
[2018-11-23 11:07:13,341 WARN  L170   areAnnotationChecker]: mainENTRY has no Hoare annotation
[2018-11-23 11:07:13,341 WARN  L170   areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation
[2018-11-23 11:07:13,342 WARN  L170   areAnnotationChecker]: L-1 has no Hoare annotation
[2018-11-23 11:07:13,342 WARN  L170   areAnnotationChecker]: L-1 has no Hoare annotation
[2018-11-23 11:07:13,342 WARN  L170   areAnnotationChecker]: L14 has no Hoare annotation
[2018-11-23 11:07:13,342 WARN  L170   areAnnotationChecker]: L14 has no Hoare annotation
[2018-11-23 11:07:13,342 WARN  L170   areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation
[2018-11-23 11:07:13,346 WARN  L170   areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation
[2018-11-23 11:07:13,346 WARN  L170   areAnnotationChecker]: L14-2 has no Hoare annotation
[2018-11-23 11:07:13,346 WARN  L170   areAnnotationChecker]: L15 has no Hoare annotation
[2018-11-23 11:07:13,346 WARN  L170   areAnnotationChecker]: L15 has no Hoare annotation
[2018-11-23 11:07:13,347 WARN  L170   areAnnotationChecker]: L15-2 has no Hoare annotation
[2018-11-23 11:07:13,347 WARN  L170   areAnnotationChecker]: L20 has no Hoare annotation
[2018-11-23 11:07:13,347 WARN  L170   areAnnotationChecker]: L20 has no Hoare annotation
[2018-11-23 11:07:13,347 WARN  L170   areAnnotationChecker]: L20-2 has no Hoare annotation
[2018-11-23 11:07:13,347 WARN  L170   areAnnotationChecker]: L20-2 has no Hoare annotation
[2018-11-23 11:07:13,348 WARN  L170   areAnnotationChecker]: L21 has no Hoare annotation
[2018-11-23 11:07:13,348 WARN  L170   areAnnotationChecker]: L21 has no Hoare annotation
[2018-11-23 11:07:13,348 WARN  L170   areAnnotationChecker]: mainFINAL has no Hoare annotation
[2018-11-23 11:07:13,348 WARN  L170   areAnnotationChecker]: mainEXIT has no Hoare annotation
[2018-11-23 11:07:13,348 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:07:13,358 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 11:07:13 BoogieIcfgContainer
[2018-11-23 11:07:13,358 INFO  L132        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2018-11-23 11:07:13,359 INFO  L113        PluginConnector]: ------------------------Witness Printer----------------------------
[2018-11-23 11:07:13,359 INFO  L271        PluginConnector]: Initializing Witness Printer...
[2018-11-23 11:07:13,359 INFO  L276        PluginConnector]: Witness Printer initialized
[2018-11-23 11:07:13,360 INFO  L185        PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:07:10" (3/4) ...
[2018-11-23 11:07:13,363 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   #35#return;
     VAL   [|#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32)]
[?]  CALL  call #t~ret4 := main();
     VAL   [|#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32)]
[?]        call ~#d1~0.base, ~#d1~0.offset := #Ultimate.alloc(8bv32);call ~#d2~0.base, ~#d2~0.offset := #Ultimate.alloc(8bv32);~n~0 := #t~nondet0;havoc #t~nondet0;
     VAL   [main_~n~0=(_ bv0 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_~#d1~0.base|=(_ bv2 32), |main_~#d1~0.offset|=(_ bv0 32), |main_~#d2~0.base|=(_ bv1 32), |main_~#d2~0.offset|=(_ bv0 32)]
[?]        assume !(0bv32 != ~n~0);#t~ite1.base, #t~ite1.offset := ~#d2~0.base, ~#d2~0.offset;
     VAL   [main_~n~0=(_ bv0 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_#t~ite1.base|=(_ bv1 32), |main_#t~ite1.offset|=(_ bv0 32), |main_~#d1~0.base|=(_ bv2 32), |main_~#d1~0.offset|=(_ bv0 32), |main_~#d2~0.base|=(_ bv1 32), |main_~#d2~0.offset|=(_ bv0 32)]
[?]        ~pd~0.base, ~pd~0.offset := #t~ite1.base, #t~ite1.offset;havoc #t~ite1.base, #t~ite1.offset;
     VAL   [main_~n~0=(_ bv0 32), main_~pd~0.base=(_ bv1 32), main_~pd~0.offset=(_ bv0 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_~#d1~0.base|=(_ bv2 32), |main_~#d1~0.offset|=(_ bv0 32), |main_~#d2~0.base|=(_ bv1 32), |main_~#d2~0.offset|=(_ bv0 32)]
[?]        assume ~pd~0.base == ~#d2~0.base && ~pd~0.offset == ~#d2~0.offset;call write~intINTTYPE4(0bv32, ~pd~0.base, ~pd~0.offset, 4bv32);
     VAL   [main_~n~0=(_ bv0 32), main_~pd~0.base=(_ bv1 32), main_~pd~0.offset=(_ bv0 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_~#d1~0.base|=(_ bv2 32), |main_~#d1~0.offset|=(_ bv0 32), |main_~#d2~0.base|=(_ bv1 32), |main_~#d2~0.offset|=(_ bv0 32)]
[?]        #t~short3 := ~pd~0.base == ~#d2~0.base && ~pd~0.offset == ~#d2~0.offset;
     VAL   [main_~n~0=(_ bv0 32), main_~pd~0.base=(_ bv1 32), main_~pd~0.offset=(_ bv0 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_#t~short3|=true, |main_~#d1~0.base|=(_ bv2 32), |main_~#d1~0.offset|=(_ bv0 32), |main_~#d2~0.base|=(_ bv1 32), |main_~#d2~0.offset|=(_ bv0 32)]
[?]        assume #t~short3;call #t~mem2 := read~intINTTYPE4(~#d2~0.base, ~bvadd32(4bv32, ~#d2~0.offset), 4bv32);#t~short3 := 0bv32 != #t~mem2;
     VAL   [main_~n~0=(_ bv0 32), main_~pd~0.base=(_ bv1 32), main_~pd~0.offset=(_ bv0 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_#t~mem2|=(_ bv1 32), |main_#t~short3|=true, |main_~#d1~0.base|=(_ bv2 32), |main_~#d1~0.offset|=(_ bv0 32), |main_~#d2~0.base|=(_ bv1 32), |main_~#d2~0.offset|=(_ bv0 32)]
[?]        assume #t~short3;havoc #t~mem2;havoc #t~short3;
     VAL   [main_~n~0=(_ bv0 32), main_~pd~0.base=(_ bv1 32), main_~pd~0.offset=(_ bv0 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_~#d1~0.base|=(_ bv2 32), |main_~#d1~0.offset|=(_ bv0 32), |main_~#d2~0.base|=(_ bv1 32), |main_~#d2~0.offset|=(_ bv0 32)]
[?]        assume !false;
     VAL   [main_~n~0=(_ bv0 32), main_~pd~0.base=(_ bv1 32), main_~pd~0.offset=(_ bv0 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_~#d1~0.base|=(_ bv2 32), |main_~#d1~0.offset|=(_ bv0 32), |main_~#d2~0.base|=(_ bv1 32), |main_~#d2~0.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~ret4 := main();
           VAL   [#NULL.base=0bv32, #NULL.offset=0bv32]
[L12]            call ~#d1~0.base, ~#d1~0.offset := #Ultimate.alloc(8bv32);
[L12]            call ~#d2~0.base, ~#d2~0.offset := #Ultimate.alloc(8bv32);
[L13]            ~n~0 := #t~nondet0;
[L13]            havoc #t~nondet0;
           VAL   [#NULL.base=0bv32, #NULL.offset=0bv32, ~#d1~0.base=2bv32, ~#d1~0.offset=0bv32, ~#d2~0.base=1bv32, ~#d2~0.offset=0bv32, ~n~0=0bv32]
[L14]            assume !(0bv32 != ~n~0);
[L14]            #t~ite1.base, #t~ite1.offset := ~#d2~0.base, ~#d2~0.offset;
           VAL   [#NULL.base=0bv32, #NULL.offset=0bv32, #t~ite1.base=1bv32, #t~ite1.offset=0bv32, ~#d1~0.base=2bv32, ~#d1~0.offset=0bv32, ~#d2~0.base=1bv32, ~#d2~0.offset=0bv32, ~n~0=0bv32]
[L14]            ~pd~0.base, ~pd~0.offset := #t~ite1.base, #t~ite1.offset;
[L14]            havoc #t~ite1.base, #t~ite1.offset;
           VAL   [#NULL.base=0bv32, #NULL.offset=0bv32, ~#d1~0.base=2bv32, ~#d1~0.offset=0bv32, ~#d2~0.base=1bv32, ~#d2~0.offset=0bv32, ~n~0=0bv32, ~pd~0.base=1bv32, ~pd~0.offset=0bv32]
[L15-L19]        assume ~pd~0.base == ~#d2~0.base && ~pd~0.offset == ~#d2~0.offset;
[L16]            call write~intINTTYPE4(0bv32, ~pd~0.base, ~pd~0.offset, 4bv32);
           VAL   [#NULL.base=0bv32, #NULL.offset=0bv32, ~#d1~0.base=2bv32, ~#d1~0.offset=0bv32, ~#d2~0.base=1bv32, ~#d2~0.offset=0bv32, ~n~0=0bv32, ~pd~0.base=1bv32, ~pd~0.offset=0bv32]
[L20]            #t~short3 := ~pd~0.base == ~#d2~0.base && ~pd~0.offset == ~#d2~0.offset;
           VAL   [#NULL.base=0bv32, #NULL.offset=0bv32, #t~short3=true, ~#d1~0.base=2bv32, ~#d1~0.offset=0bv32, ~#d2~0.base=1bv32, ~#d2~0.offset=0bv32, ~n~0=0bv32, ~pd~0.base=1bv32, ~pd~0.offset=0bv32]
[L20]            assume #t~short3;
[L20]            call #t~mem2 := read~intINTTYPE4(~#d2~0.base, ~bvadd32(4bv32, ~#d2~0.offset), 4bv32);
[L20]            #t~short3 := 0bv32 != #t~mem2;
           VAL   [#NULL.base=0bv32, #NULL.offset=0bv32, #t~mem2=1bv32, #t~short3=true, ~#d1~0.base=2bv32, ~#d1~0.offset=0bv32, ~#d2~0.base=1bv32, ~#d2~0.offset=0bv32, ~n~0=0bv32, ~pd~0.base=1bv32, ~pd~0.offset=0bv32]
[L20-L22]        assume #t~short3;
[L20]            havoc #t~mem2;
[L20]            havoc #t~short3;
           VAL   [#NULL.base=0bv32, #NULL.offset=0bv32, ~#d1~0.base=2bv32, ~#d1~0.offset=0bv32, ~#d2~0.base=1bv32, ~#d2~0.offset=0bv32, ~n~0=0bv32, ~pd~0.base=1bv32, ~pd~0.offset=0bv32]
[L26]            assert false;
           VAL   [#NULL.base=0bv32, #NULL.offset=0bv32, ~#d1~0.base=2bv32, ~#d1~0.offset=0bv32, ~#d2~0.base=1bv32, ~#d2~0.offset=0bv32, ~n~0=0bv32, ~pd~0.base=1bv32, ~pd~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~ret4 := main();
           VAL   [#NULL.base=0bv32, #NULL.offset=0bv32]
[L12]            call ~#d1~0.base, ~#d1~0.offset := #Ultimate.alloc(8bv32);
[L12]            call ~#d2~0.base, ~#d2~0.offset := #Ultimate.alloc(8bv32);
[L13]            ~n~0 := #t~nondet0;
[L13]            havoc #t~nondet0;
           VAL   [#NULL.base=0bv32, #NULL.offset=0bv32, ~#d1~0.base=2bv32, ~#d1~0.offset=0bv32, ~#d2~0.base=1bv32, ~#d2~0.offset=0bv32, ~n~0=0bv32]
[L14]            assume !(0bv32 != ~n~0);
[L14]            #t~ite1.base, #t~ite1.offset := ~#d2~0.base, ~#d2~0.offset;
           VAL   [#NULL.base=0bv32, #NULL.offset=0bv32, #t~ite1.base=1bv32, #t~ite1.offset=0bv32, ~#d1~0.base=2bv32, ~#d1~0.offset=0bv32, ~#d2~0.base=1bv32, ~#d2~0.offset=0bv32, ~n~0=0bv32]
[L14]            ~pd~0.base, ~pd~0.offset := #t~ite1.base, #t~ite1.offset;
[L14]            havoc #t~ite1.base, #t~ite1.offset;
           VAL   [#NULL.base=0bv32, #NULL.offset=0bv32, ~#d1~0.base=2bv32, ~#d1~0.offset=0bv32, ~#d2~0.base=1bv32, ~#d2~0.offset=0bv32, ~n~0=0bv32, ~pd~0.base=1bv32, ~pd~0.offset=0bv32]
[L15-L19]        assume ~pd~0.base == ~#d2~0.base && ~pd~0.offset == ~#d2~0.offset;
[L16]            call write~intINTTYPE4(0bv32, ~pd~0.base, ~pd~0.offset, 4bv32);
           VAL   [#NULL.base=0bv32, #NULL.offset=0bv32, ~#d1~0.base=2bv32, ~#d1~0.offset=0bv32, ~#d2~0.base=1bv32, ~#d2~0.offset=0bv32, ~n~0=0bv32, ~pd~0.base=1bv32, ~pd~0.offset=0bv32]
[L20]            #t~short3 := ~pd~0.base == ~#d2~0.base && ~pd~0.offset == ~#d2~0.offset;
           VAL   [#NULL.base=0bv32, #NULL.offset=0bv32, #t~short3=true, ~#d1~0.base=2bv32, ~#d1~0.offset=0bv32, ~#d2~0.base=1bv32, ~#d2~0.offset=0bv32, ~n~0=0bv32, ~pd~0.base=1bv32, ~pd~0.offset=0bv32]
[L20]            assume #t~short3;
[L20]            call #t~mem2 := read~intINTTYPE4(~#d2~0.base, ~bvadd32(4bv32, ~#d2~0.offset), 4bv32);
[L20]            #t~short3 := 0bv32 != #t~mem2;
           VAL   [#NULL.base=0bv32, #NULL.offset=0bv32, #t~mem2=1bv32, #t~short3=true, ~#d1~0.base=2bv32, ~#d1~0.offset=0bv32, ~#d2~0.base=1bv32, ~#d2~0.offset=0bv32, ~n~0=0bv32, ~pd~0.base=1bv32, ~pd~0.offset=0bv32]
[L20-L22]        assume #t~short3;
[L20]            havoc #t~mem2;
[L20]            havoc #t~short3;
           VAL   [#NULL.base=0bv32, #NULL.offset=0bv32, ~#d1~0.base=2bv32, ~#d1~0.offset=0bv32, ~#d2~0.base=1bv32, ~#d2~0.offset=0bv32, ~n~0=0bv32, ~pd~0.base=1bv32, ~pd~0.offset=0bv32]
[L26]            assert false;
           VAL   [#NULL.base=0bv32, #NULL.offset=0bv32, ~#d1~0.base=2bv32, ~#d1~0.offset=0bv32, ~#d2~0.base=1bv32, ~#d2~0.offset=0bv32, ~n~0=0bv32, ~pd~0.base=1bv32, ~pd~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~ret4 := main();
       VAL         [#NULL!base=0bv32, #NULL!offset=0bv32]
[L12]  FCALL       call ~#d1~0 := #Ultimate.alloc(8bv32);
[L12]  FCALL       call ~#d2~0 := #Ultimate.alloc(8bv32);
[L13]              ~n~0 := #t~nondet0;
[L13]              havoc #t~nondet0;
       VAL         [#NULL!base=0bv32, #NULL!offset=0bv32, ~#d1~0!base=2bv32, ~#d1~0!offset=0bv32, ~#d2~0!base=1bv32, ~#d2~0!offset=0bv32, ~n~0=0bv32]
[L14]  COND FALSE  !(0bv32 != ~n~0)
[L14]              #t~ite1 := ~#d2~0;
       VAL         [#NULL!base=0bv32, #NULL!offset=0bv32, #t~ite1!base=1bv32, #t~ite1!offset=0bv32, ~#d1~0!base=2bv32, ~#d1~0!offset=0bv32, ~#d2~0!base=1bv32, ~#d2~0!offset=0bv32, ~n~0=0bv32]
[L14]              ~pd~0 := #t~ite1;
[L14]              havoc #t~ite1;
       VAL         [#NULL!base=0bv32, #NULL!offset=0bv32, ~#d1~0!base=2bv32, ~#d1~0!offset=0bv32, ~#d2~0!base=1bv32, ~#d2~0!offset=0bv32, ~n~0=0bv32, ~pd~0!base=1bv32, ~pd~0!offset=0bv32]
[L15]  COND TRUE   ~pd~0 == ~#d2~0
[L16]  FCALL       call write~intINTTYPE4(0bv32, { base: ~pd~0!base, offset: ~pd~0!offset }, 4bv32);
       VAL         [#NULL!base=0bv32, #NULL!offset=0bv32, ~#d1~0!base=2bv32, ~#d1~0!offset=0bv32, ~#d2~0!base=1bv32, ~#d2~0!offset=0bv32, ~n~0=0bv32, ~pd~0!base=1bv32, ~pd~0!offset=0bv32]
[L20]              #t~short3 := ~pd~0 == ~#d2~0;
       VAL         [#NULL!base=0bv32, #NULL!offset=0bv32, #t~short3=true, ~#d1~0!base=2bv32, ~#d1~0!offset=0bv32, ~#d2~0!base=1bv32, ~#d2~0!offset=0bv32, ~n~0=0bv32, ~pd~0!base=1bv32, ~pd~0!offset=0bv32]
[L20]  COND TRUE   #t~short3
[L20]  FCALL       call #t~mem2 := read~intINTTYPE4({ base: ~#d2~0!base, offset: ~bvadd32(4bv32, ~#d2~0!offset) }, 4bv32);
[L20]              #t~short3 := 0bv32 != #t~mem2;
       VAL         [#NULL!base=0bv32, #NULL!offset=0bv32, #t~mem2=1bv32, #t~short3=true, ~#d1~0!base=2bv32, ~#d1~0!offset=0bv32, ~#d2~0!base=1bv32, ~#d2~0!offset=0bv32, ~n~0=0bv32, ~pd~0!base=1bv32, ~pd~0!offset=0bv32]
[L20]  COND TRUE   #t~short3
[L20]              havoc #t~mem2;
[L20]              havoc #t~short3;
       VAL         [#NULL!base=0bv32, #NULL!offset=0bv32, ~#d1~0!base=2bv32, ~#d1~0!offset=0bv32, ~#d2~0!base=1bv32, ~#d2~0!offset=0bv32, ~n~0=0bv32, ~pd~0!base=1bv32, ~pd~0!offset=0bv32]
[L26]              assert false;
       VAL         [#NULL!base=0bv32, #NULL!offset=0bv32, ~#d1~0!base=2bv32, ~#d1~0!offset=0bv32, ~#d2~0!base=1bv32, ~#d2~0!offset=0bv32, ~n~0=0bv32, ~pd~0!base=1bv32, ~pd~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~ret4 := main();
       VAL         [#NULL!base=0bv32, #NULL!offset=0bv32]
[L12]  FCALL       call ~#d1~0 := #Ultimate.alloc(8bv32);
[L12]  FCALL       call ~#d2~0 := #Ultimate.alloc(8bv32);
[L13]              ~n~0 := #t~nondet0;
[L13]              havoc #t~nondet0;
       VAL         [#NULL!base=0bv32, #NULL!offset=0bv32, ~#d1~0!base=2bv32, ~#d1~0!offset=0bv32, ~#d2~0!base=1bv32, ~#d2~0!offset=0bv32, ~n~0=0bv32]
[L14]  COND FALSE  !(0bv32 != ~n~0)
[L14]              #t~ite1 := ~#d2~0;
       VAL         [#NULL!base=0bv32, #NULL!offset=0bv32, #t~ite1!base=1bv32, #t~ite1!offset=0bv32, ~#d1~0!base=2bv32, ~#d1~0!offset=0bv32, ~#d2~0!base=1bv32, ~#d2~0!offset=0bv32, ~n~0=0bv32]
[L14]              ~pd~0 := #t~ite1;
[L14]              havoc #t~ite1;
       VAL         [#NULL!base=0bv32, #NULL!offset=0bv32, ~#d1~0!base=2bv32, ~#d1~0!offset=0bv32, ~#d2~0!base=1bv32, ~#d2~0!offset=0bv32, ~n~0=0bv32, ~pd~0!base=1bv32, ~pd~0!offset=0bv32]
[L15]  COND TRUE   ~pd~0 == ~#d2~0
[L16]  FCALL       call write~intINTTYPE4(0bv32, { base: ~pd~0!base, offset: ~pd~0!offset }, 4bv32);
       VAL         [#NULL!base=0bv32, #NULL!offset=0bv32, ~#d1~0!base=2bv32, ~#d1~0!offset=0bv32, ~#d2~0!base=1bv32, ~#d2~0!offset=0bv32, ~n~0=0bv32, ~pd~0!base=1bv32, ~pd~0!offset=0bv32]
[L20]              #t~short3 := ~pd~0 == ~#d2~0;
       VAL         [#NULL!base=0bv32, #NULL!offset=0bv32, #t~short3=true, ~#d1~0!base=2bv32, ~#d1~0!offset=0bv32, ~#d2~0!base=1bv32, ~#d2~0!offset=0bv32, ~n~0=0bv32, ~pd~0!base=1bv32, ~pd~0!offset=0bv32]
[L20]  COND TRUE   #t~short3
[L20]  FCALL       call #t~mem2 := read~intINTTYPE4({ base: ~#d2~0!base, offset: ~bvadd32(4bv32, ~#d2~0!offset) }, 4bv32);
[L20]              #t~short3 := 0bv32 != #t~mem2;
       VAL         [#NULL!base=0bv32, #NULL!offset=0bv32, #t~mem2=1bv32, #t~short3=true, ~#d1~0!base=2bv32, ~#d1~0!offset=0bv32, ~#d2~0!base=1bv32, ~#d2~0!offset=0bv32, ~n~0=0bv32, ~pd~0!base=1bv32, ~pd~0!offset=0bv32]
[L20]  COND TRUE   #t~short3
[L20]              havoc #t~mem2;
[L20]              havoc #t~short3;
       VAL         [#NULL!base=0bv32, #NULL!offset=0bv32, ~#d1~0!base=2bv32, ~#d1~0!offset=0bv32, ~#d2~0!base=1bv32, ~#d2~0!offset=0bv32, ~n~0=0bv32, ~pd~0!base=1bv32, ~pd~0!offset=0bv32]
[L26]              assert false;
       VAL         [#NULL!base=0bv32, #NULL!offset=0bv32, ~#d1~0!base=2bv32, ~#d1~0!offset=0bv32, ~#d2~0!base=1bv32, ~#d2~0!offset=0bv32, ~n~0=0bv32, ~pd~0!base=1bv32, ~pd~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~ret4 := main();
       VAL         [#NULL!base=0bv32, #NULL!offset=0bv32]
[L12]  FCALL       call ~#d1~0 := #Ultimate.alloc(8bv32);
[L12]  FCALL       call ~#d2~0 := #Ultimate.alloc(8bv32);
[L13]              ~n~0 := #t~nondet0;
[L13]              havoc #t~nondet0;
       VAL         [#NULL!base=0bv32, #NULL!offset=0bv32, ~#d1~0!base=2bv32, ~#d1~0!offset=0bv32, ~#d2~0!base=1bv32, ~#d2~0!offset=0bv32, ~n~0=0bv32]
[L14]  COND FALSE  !(0bv32 != ~n~0)
[L14]              #t~ite1 := ~#d2~0;
       VAL         [#NULL!base=0bv32, #NULL!offset=0bv32, #t~ite1!base=1bv32, #t~ite1!offset=0bv32, ~#d1~0!base=2bv32, ~#d1~0!offset=0bv32, ~#d2~0!base=1bv32, ~#d2~0!offset=0bv32, ~n~0=0bv32]
[L14]              ~pd~0 := #t~ite1;
[L14]              havoc #t~ite1;
       VAL         [#NULL!base=0bv32, #NULL!offset=0bv32, ~#d1~0!base=2bv32, ~#d1~0!offset=0bv32, ~#d2~0!base=1bv32, ~#d2~0!offset=0bv32, ~n~0=0bv32, ~pd~0!base=1bv32, ~pd~0!offset=0bv32]
[L15]  COND TRUE   ~pd~0 == ~#d2~0
[L16]  FCALL       call write~intINTTYPE4(0bv32, { base: ~pd~0!base, offset: ~pd~0!offset }, 4bv32);
       VAL         [#NULL!base=0bv32, #NULL!offset=0bv32, ~#d1~0!base=2bv32, ~#d1~0!offset=0bv32, ~#d2~0!base=1bv32, ~#d2~0!offset=0bv32, ~n~0=0bv32, ~pd~0!base=1bv32, ~pd~0!offset=0bv32]
[L20]              #t~short3 := ~pd~0 == ~#d2~0;
       VAL         [#NULL!base=0bv32, #NULL!offset=0bv32, #t~short3=true, ~#d1~0!base=2bv32, ~#d1~0!offset=0bv32, ~#d2~0!base=1bv32, ~#d2~0!offset=0bv32, ~n~0=0bv32, ~pd~0!base=1bv32, ~pd~0!offset=0bv32]
[L20]  COND TRUE   #t~short3
[L20]  FCALL       call #t~mem2 := read~intINTTYPE4({ base: ~#d2~0!base, offset: ~bvadd32(4bv32, ~#d2~0!offset) }, 4bv32);
[L20]              #t~short3 := 0bv32 != #t~mem2;
       VAL         [#NULL!base=0bv32, #NULL!offset=0bv32, #t~mem2=1bv32, #t~short3=true, ~#d1~0!base=2bv32, ~#d1~0!offset=0bv32, ~#d2~0!base=1bv32, ~#d2~0!offset=0bv32, ~n~0=0bv32, ~pd~0!base=1bv32, ~pd~0!offset=0bv32]
[L20]  COND TRUE   #t~short3
[L20]              havoc #t~mem2;
[L20]              havoc #t~short3;
       VAL         [#NULL!base=0bv32, #NULL!offset=0bv32, ~#d1~0!base=2bv32, ~#d1~0!offset=0bv32, ~#d2~0!base=1bv32, ~#d2~0!offset=0bv32, ~n~0=0bv32, ~pd~0!base=1bv32, ~pd~0!offset=0bv32]
[L26]              assert false;
       VAL         [#NULL!base=0bv32, #NULL!offset=0bv32, ~#d1~0!base=2bv32, ~#d1~0!offset=0bv32, ~#d2~0!base=1bv32, ~#d2~0!offset=0bv32, ~n~0=0bv32, ~pd~0!base=1bv32, ~pd~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~ret4 := main();
       VAL         [#NULL!base=0bv32, #NULL!offset=0bv32]
[L12]  FCALL       call ~#d1~0 := #Ultimate.alloc(8bv32);
[L12]  FCALL       call ~#d2~0 := #Ultimate.alloc(8bv32);
[L13]              ~n~0 := #t~nondet0;
[L13]              havoc #t~nondet0;
       VAL         [#NULL!base=0bv32, #NULL!offset=0bv32, ~#d1~0!base=2bv32, ~#d1~0!offset=0bv32, ~#d2~0!base=1bv32, ~#d2~0!offset=0bv32, ~n~0=0bv32]
[L14]  COND FALSE  !(0bv32 != ~n~0)
[L14]              #t~ite1 := ~#d2~0;
       VAL         [#NULL!base=0bv32, #NULL!offset=0bv32, #t~ite1!base=1bv32, #t~ite1!offset=0bv32, ~#d1~0!base=2bv32, ~#d1~0!offset=0bv32, ~#d2~0!base=1bv32, ~#d2~0!offset=0bv32, ~n~0=0bv32]
[L14]              ~pd~0 := #t~ite1;
[L14]              havoc #t~ite1;
       VAL         [#NULL!base=0bv32, #NULL!offset=0bv32, ~#d1~0!base=2bv32, ~#d1~0!offset=0bv32, ~#d2~0!base=1bv32, ~#d2~0!offset=0bv32, ~n~0=0bv32, ~pd~0!base=1bv32, ~pd~0!offset=0bv32]
[L15]  COND TRUE   ~pd~0 == ~#d2~0
[L16]  FCALL       call write~intINTTYPE4(0bv32, { base: ~pd~0!base, offset: ~pd~0!offset }, 4bv32);
       VAL         [#NULL!base=0bv32, #NULL!offset=0bv32, ~#d1~0!base=2bv32, ~#d1~0!offset=0bv32, ~#d2~0!base=1bv32, ~#d2~0!offset=0bv32, ~n~0=0bv32, ~pd~0!base=1bv32, ~pd~0!offset=0bv32]
[L20]              #t~short3 := ~pd~0 == ~#d2~0;
       VAL         [#NULL!base=0bv32, #NULL!offset=0bv32, #t~short3=true, ~#d1~0!base=2bv32, ~#d1~0!offset=0bv32, ~#d2~0!base=1bv32, ~#d2~0!offset=0bv32, ~n~0=0bv32, ~pd~0!base=1bv32, ~pd~0!offset=0bv32]
[L20]  COND TRUE   #t~short3
[L20]  FCALL       call #t~mem2 := read~intINTTYPE4({ base: ~#d2~0!base, offset: ~bvadd32(4bv32, ~#d2~0!offset) }, 4bv32);
[L20]              #t~short3 := 0bv32 != #t~mem2;
       VAL         [#NULL!base=0bv32, #NULL!offset=0bv32, #t~mem2=1bv32, #t~short3=true, ~#d1~0!base=2bv32, ~#d1~0!offset=0bv32, ~#d2~0!base=1bv32, ~#d2~0!offset=0bv32, ~n~0=0bv32, ~pd~0!base=1bv32, ~pd~0!offset=0bv32]
[L20]  COND TRUE   #t~short3
[L20]              havoc #t~mem2;
[L20]              havoc #t~short3;
       VAL         [#NULL!base=0bv32, #NULL!offset=0bv32, ~#d1~0!base=2bv32, ~#d1~0!offset=0bv32, ~#d2~0!base=1bv32, ~#d2~0!offset=0bv32, ~n~0=0bv32, ~pd~0!base=1bv32, ~pd~0!offset=0bv32]
[L26]              assert false;
       VAL         [#NULL!base=0bv32, #NULL!offset=0bv32, ~#d1~0!base=2bv32, ~#d1~0!offset=0bv32, ~#d2~0!base=1bv32, ~#d2~0!offset=0bv32, ~n~0=0bv32, ~pd~0!base=1bv32, ~pd~0!offset=0bv32]


[L12]             struct dummy d1, d2;
[L13]             int n = __VERIFIER_nondet_int();
[L14]  EXPR       n ? &d1 : &d2
       VAL        [d1={2:0}, d2={1:0}, n=0, n ? &d1 : &d2={1:0}]
[L14]             struct dummy *pd = n ? &d1 : &d2;
[L15]  COND TRUE  pd == &d2
[L16]             pd->a = 0
       VAL        [d1={2:0}, d2={1:0}, n=0, pd={1:0}]
[L20]             pd == &d2 && d2.b != 0
[L20]  EXPR       d2.b
[L20]             pd == &d2 && d2.b != 0
       VAL        [d1={2:0}, d2={1:0}, d2.b=1, n=0, pd={1:0}, pd == &d2 && d2.b != 0=1]
[L20]  COND TRUE  pd == &d2 && d2.b != 0
[L26]             __VERIFIER_error()
       VAL        [d1={2:0}, d2={1:0}, n=0, pd={1:0}]

-----
[2018-11-23 11:07:13,439 INFO  L145         WitnessManager]: Wrote witness to /storage/repos/svcomp/c/ldv-regression/test28_false-unreach-call_true-termination.c-witness.graphml
[2018-11-23 11:07:13,439 INFO  L132        PluginConnector]: ------------------------ END Witness Printer----------------------------
[2018-11-23 11:07:13,441 INFO  L168              Benchmark]: Toolchain (without parser) took 3903.19 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 719.3 MB). Free memory was 1.4 GB in the beginning and 2.0 GB in the end (delta: -598.4 MB). Peak memory consumption was 120.9 MB. Max. memory is 7.1 GB.
[2018-11-23 11:07:13,443 INFO  L168              Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB.
[2018-11-23 11:07:13,444 INFO  L168              Benchmark]: CACSL2BoogieTranslator took 371.61 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB.
[2018-11-23 11:07:13,444 INFO  L168              Benchmark]: Boogie Procedure Inliner took 35.04 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:07:13,445 INFO  L168              Benchmark]: Boogie Preprocessor took 40.23 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:07:13,445 INFO  L168              Benchmark]: RCFGBuilder took 631.37 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 719.3 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -748.5 MB). Peak memory consumption was 14.9 MB. Max. memory is 7.1 GB.
[2018-11-23 11:07:13,446 INFO  L168              Benchmark]: TraceAbstraction took 2735.81 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 126.4 MB). Peak memory consumption was 126.4 MB. Max. memory is 7.1 GB.
[2018-11-23 11:07:13,447 INFO  L168              Benchmark]: Witness Printer took 80.96 ms. Allocated memory is still 2.3 GB. Free memory was 2.0 GB in the beginning and 2.0 GB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 7.1 GB.
[2018-11-23 11:07:13,453 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.17 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB.
 * CACSL2BoogieTranslator took 371.61 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB.
 * Boogie Procedure Inliner took 35.04 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.
 * Boogie Preprocessor took 40.23 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.
 * RCFGBuilder took 631.37 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 719.3 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -748.5 MB). Peak memory consumption was 14.9 MB. Max. memory is 7.1 GB.
 * TraceAbstraction took 2735.81 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 126.4 MB). Peak memory consumption was 126.4 MB. Max. memory is 7.1 GB.
 * Witness Printer took 80.96 ms. Allocated memory is still 2.3 GB. Free memory was 2.0 GB in the beginning and 2.0 GB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 7.1 GB.
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
  - CounterExampleResult [Line: 26]: a call of __VERIFIER_error() is reachable
    a call of __VERIFIER_error() is reachable
We found a FailurePath: 
[L12]             struct dummy d1, d2;
[L13]             int n = __VERIFIER_nondet_int();
[L14]  EXPR       n ? &d1 : &d2
       VAL        [d1={2:0}, d2={1:0}, n=0, n ? &d1 : &d2={1:0}]
[L14]             struct dummy *pd = n ? &d1 : &d2;
[L15]  COND TRUE  pd == &d2
[L16]             pd->a = 0
       VAL        [d1={2:0}, d2={1:0}, n=0, pd={1:0}]
[L20]             pd == &d2 && d2.b != 0
[L20]  EXPR       d2.b
[L20]             pd == &d2 && d2.b != 0
       VAL        [d1={2:0}, d2={1:0}, d2.b=1, n=0, pd={1:0}, pd == &d2 && d2.b != 0=1]
[L20]  COND TRUE  pd == &d2 && d2.b != 0
[L26]             __VERIFIER_error()
       VAL        [d1={2:0}, d2={1:0}, n=0, pd={1:0}]

  - StatisticsResult: Ultimate Automizer benchmark data
    CFG has 3 procedures, 18 locations, 1 error locations. UNSAFE Result, 2.6s OverallTime, 3 OverallIterations, 1 TraceHistogramMax, 1.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 25 SDtfs, 11 SDslu, 46 SDs, 0 SdLazy, 33 SolverSat, 4 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 27 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=18occurred 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.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 39 NumberOfCodeBlocks, 39 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 24 ConstructedInterpolants, 0 QuantifiedInterpolants, 504 SizeOfPredicates, 5 NumberOfNonLiveVariables, 87 ConjunctsInSsa, 7 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available
RESULT: Ultimate proved your program to be incorrect!
Received shutdown request...