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_Default.epf -i ../../../trunk/examples/svcomp/ldv-regression/test28_false-unreach-call_true-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 12:54:21,751 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 12:54:21,753 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 12:54:21,765 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 12:54:21,765 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 12:54:21,766 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 12:54:21,768 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 12:54:21,770 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 12:54:21,771 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 12:54:21,772 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 12:54:21,773 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 12:54:21,773 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 12:54:21,774 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 12:54:21,775 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 12:54:21,777 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 12:54:21,777 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 12:54:21,778 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 12:54:21,780 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 12:54:21,782 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 12:54:21,784 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 12:54:21,785 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 12:54:21,786 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 12:54:21,789 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 12:54:21,789 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 12:54:21,790 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 12:54:21,791 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 12:54:21,792 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 12:54:21,793 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 12:54:21,794 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 12:54:21,795 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 12:54:21,795 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 12:54:21,796 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 12:54:21,796 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 12:54:21,796 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 12:54:21,797 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 12:54:21,798 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 12:54:21,799 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-23 12:54:21,814 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 12:54:21,814 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 12:54:21,815 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 12:54:21,815 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 12:54:21,816 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 12:54:21,816 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 12:54:21,816 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 12:54:21,817 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 12:54:21,817 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 12:54:21,817 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 12:54:21,817 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 12:54:21,817 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 12:54:21,818 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 12:54:21,818 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 12:54:21,818 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 12:54:21,818 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 12:54:21,818 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 12:54:21,819 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 12:54:21,819 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 12:54:21,819 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 12:54:21,819 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 12:54:21,820 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 12:54:21,820 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 12:54:21,820 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 12:54:21,820 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 12:54:21,820 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 12:54:21,820 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 12:54:21,821 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 12:54:21,821 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 12:54:21,821 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 12:54:21,821 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 12:54:21,864 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 12:54:21,884 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 12:54:21,888 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 12:54:21,890 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 12:54:21,891 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 12:54:21,892 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 12:54:21,962 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa5b63e6a/84078537e0cd417baeaa2a880b2d883d/FLAG0126a2b09 [2018-11-23 12:54:22,377 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 12:54:22,378 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-regression/test28_false-unreach-call_true-termination.c [2018-11-23 12:54:22,387 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa5b63e6a/84078537e0cd417baeaa2a880b2d883d/FLAG0126a2b09 [2018-11-23 12:54:22,753 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa5b63e6a/84078537e0cd417baeaa2a880b2d883d [2018-11-23 12:54:22,766 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 12:54:22,768 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 12:54:22,770 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 12:54:22,770 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 12:54:22,775 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 12:54:22,777 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:54:22" (1/1) ... [2018-11-23 12:54:22,780 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@560ba81a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:54:22, skipping insertion in model container [2018-11-23 12:54:22,780 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:54:22" (1/1) ... [2018-11-23 12:54:22,791 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 12:54:22,820 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 12:54:23,070 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:54:23,084 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 12:54:23,104 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:54:23,123 INFO L195 MainTranslator]: Completed translation [2018-11-23 12:54:23,124 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:54:23 WrapperNode [2018-11-23 12:54:23,124 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 12:54:23,125 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 12:54:23,125 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 12:54:23,125 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 12:54:23,135 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:54:23" (1/1) ... [2018-11-23 12:54:23,145 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:54:23" (1/1) ... [2018-11-23 12:54:23,152 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 12:54:23,152 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 12:54:23,153 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 12:54:23,153 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 12:54:23,160 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:54:23" (1/1) ... [2018-11-23 12:54:23,161 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:54:23" (1/1) ... [2018-11-23 12:54:23,162 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:54:23" (1/1) ... [2018-11-23 12:54:23,163 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:54:23" (1/1) ... [2018-11-23 12:54:23,174 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:54:23" (1/1) ... [2018-11-23 12:54:23,177 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:54:23" (1/1) ... [2018-11-23 12:54:23,178 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:54:23" (1/1) ... [2018-11-23 12:54:23,180 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 12:54:23,181 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 12:54:23,181 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 12:54:23,181 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 12:54:23,182 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:54:23" (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 12:54:23,308 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 12:54:23,309 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 12:54:23,309 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 12:54:23,309 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 12:54:23,309 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 12:54:23,309 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 12:54:23,309 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 12:54:23,310 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 12:54:23,310 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 12:54:23,310 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 12:54:23,795 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 12:54:23,795 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-11-23 12:54:23,796 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:54:23 BoogieIcfgContainer [2018-11-23 12:54:23,796 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 12:54:23,798 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 12:54:23,798 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 12:54:23,801 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 12:54:23,802 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 12:54:22" (1/3) ... [2018-11-23 12:54:23,803 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@134f3479 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:54:23, skipping insertion in model container [2018-11-23 12:54:23,803 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:54:23" (2/3) ... [2018-11-23 12:54:23,803 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@134f3479 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:54:23, skipping insertion in model container [2018-11-23 12:54:23,803 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:54:23" (3/3) ... [2018-11-23 12:54:23,805 INFO L112 eAbstractionObserver]: Analyzing ICFG test28_false-unreach-call_true-termination.c [2018-11-23 12:54:23,815 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 12:54:23,823 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 12:54:23,840 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 12:54:23,875 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 12:54:23,876 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 12:54:23,876 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 12:54:23,876 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 12:54:23,877 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 12:54:23,877 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 12:54:23,877 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 12:54:23,877 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 12:54:23,878 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 12:54:23,895 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states. [2018-11-23 12:54:23,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-23 12:54:23,902 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:54:23,903 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:54:23,905 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:54:23,911 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:54:23,911 INFO L82 PathProgramCache]: Analyzing trace with hash 668850033, now seen corresponding path program 1 times [2018-11-23 12:54:23,913 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:54:23,914 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:54:23,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:54:23,965 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:54:23,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:54:24,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:54:24,482 INFO L256 TraceCheckUtils]: 0: Hoare triple {21#true} call ULTIMATE.init(); {21#true} is VALID [2018-11-23 12:54:24,486 INFO L273 TraceCheckUtils]: 1: Hoare triple {21#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {21#true} is VALID [2018-11-23 12:54:24,487 INFO L273 TraceCheckUtils]: 2: Hoare triple {21#true} assume true; {21#true} is VALID [2018-11-23 12:54:24,488 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {21#true} {21#true} #35#return; {21#true} is VALID [2018-11-23 12:54:24,488 INFO L256 TraceCheckUtils]: 4: Hoare triple {21#true} call #t~ret4 := main(); {21#true} is VALID [2018-11-23 12:54:24,492 INFO L273 TraceCheckUtils]: 5: Hoare triple {21#true} call ~#d1~0.base, ~#d1~0.offset := #Ultimate.alloc(8);call ~#d2~0.base, ~#d2~0.offset := #Ultimate.alloc(8);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~n~0 := #t~nondet0;havoc #t~nondet0; {23#(= |main_~#d2~0.offset| |main_~#d1~0.offset|)} is VALID [2018-11-23 12:54:24,497 INFO L273 TraceCheckUtils]: 6: Hoare triple {23#(= |main_~#d2~0.offset| |main_~#d1~0.offset|)} assume 0 != ~n~0;#t~ite1.base, #t~ite1.offset := ~#d1~0.base, ~#d1~0.offset; {24#(= |main_~#d2~0.offset| |main_#t~ite1.offset|)} is VALID [2018-11-23 12:54:24,506 INFO L273 TraceCheckUtils]: 7: Hoare triple {24#(= |main_~#d2~0.offset| |main_#t~ite1.offset|)} ~pd~0.base, ~pd~0.offset := #t~ite1.base, #t~ite1.offset;havoc #t~ite1.base, #t~ite1.offset; {25#(= |main_~#d2~0.offset| main_~pd~0.offset)} is VALID [2018-11-23 12:54:24,519 INFO L273 TraceCheckUtils]: 8: Hoare triple {25#(= |main_~#d2~0.offset| main_~pd~0.offset)} assume !(~pd~0.base == ~#d2~0.base && ~pd~0.offset == ~#d2~0.offset);call write~int(0, ~pd~0.base, 4 + ~pd~0.offset, 4); {26#(not (= main_~pd~0.base |main_~#d2~0.base|))} is VALID [2018-11-23 12:54:24,535 INFO L273 TraceCheckUtils]: 9: Hoare triple {26#(not (= main_~pd~0.base |main_~#d2~0.base|))} #t~short3 := ~pd~0.base == ~#d2~0.base && ~pd~0.offset == ~#d2~0.offset; {27#(not |main_#t~short3|)} is VALID [2018-11-23 12:54:24,544 INFO L273 TraceCheckUtils]: 10: Hoare triple {27#(not |main_#t~short3|)} assume #t~short3;call #t~mem2 := read~int(~#d2~0.base, 4 + ~#d2~0.offset, 4);#t~short3 := 0 != #t~mem2; {22#false} is VALID [2018-11-23 12:54:24,544 INFO L273 TraceCheckUtils]: 11: Hoare triple {22#false} assume #t~short3;havoc #t~short3;havoc #t~mem2; {22#false} is VALID [2018-11-23 12:54:24,545 INFO L273 TraceCheckUtils]: 12: Hoare triple {22#false} assume !false; {22#false} is VALID [2018-11-23 12:54:24,548 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 12:54:24,551 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:54:24,551 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-23 12:54:24,557 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 13 [2018-11-23 12:54:24,560 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:54:24,564 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-23 12:54:24,713 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 12:54:24,713 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 12:54:24,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 12:54:24,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-23 12:54:24,726 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 7 states. [2018-11-23 12:54:25,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:54:25,910 INFO L93 Difference]: Finished difference Result 29 states and 35 transitions. [2018-11-23 12:54:25,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 12:54:25,910 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 13 [2018-11-23 12:54:25,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:54:25,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 12:54:25,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 35 transitions. [2018-11-23 12:54:25,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 12:54:25,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 35 transitions. [2018-11-23 12:54:25,931 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 35 transitions. [2018-11-23 12:54:26,067 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 12:54:26,077 INFO L225 Difference]: With dead ends: 29 [2018-11-23 12:54:26,077 INFO L226 Difference]: Without dead ends: 14 [2018-11-23 12:54:26,081 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2018-11-23 12:54:26,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-11-23 12:54:26,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-11-23 12:54:26,131 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:54:26,131 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states. Second operand 14 states. [2018-11-23 12:54:26,132 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand 14 states. [2018-11-23 12:54:26,132 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 14 states. [2018-11-23 12:54:26,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:54:26,135 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2018-11-23 12:54:26,136 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-11-23 12:54:26,136 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:54:26,136 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:54:26,137 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand 14 states. [2018-11-23 12:54:26,137 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 14 states. [2018-11-23 12:54:26,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:54:26,140 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2018-11-23 12:54:26,141 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-11-23 12:54:26,141 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:54:26,141 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:54:26,142 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:54:26,142 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:54:26,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 12:54:26,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2018-11-23 12:54:26,146 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 13 [2018-11-23 12:54:26,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:54:26,146 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2018-11-23 12:54:26,146 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 12:54:26,146 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-11-23 12:54:26,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-23 12:54:26,147 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:54:26,147 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:54:26,148 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:54:26,148 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:54:26,148 INFO L82 PathProgramCache]: Analyzing trace with hash 667002991, now seen corresponding path program 1 times [2018-11-23 12:54:26,148 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:54:26,149 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:54:26,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:54:26,150 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:54:26,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:54:26,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:54:26,307 INFO L256 TraceCheckUtils]: 0: Hoare triple {122#true} call ULTIMATE.init(); {122#true} is VALID [2018-11-23 12:54:26,308 INFO L273 TraceCheckUtils]: 1: Hoare triple {122#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {122#true} is VALID [2018-11-23 12:54:26,309 INFO L273 TraceCheckUtils]: 2: Hoare triple {122#true} assume true; {122#true} is VALID [2018-11-23 12:54:26,309 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {122#true} {122#true} #35#return; {122#true} is VALID [2018-11-23 12:54:26,310 INFO L256 TraceCheckUtils]: 4: Hoare triple {122#true} call #t~ret4 := main(); {122#true} is VALID [2018-11-23 12:54:26,318 INFO L273 TraceCheckUtils]: 5: Hoare triple {122#true} call ~#d1~0.base, ~#d1~0.offset := #Ultimate.alloc(8);call ~#d2~0.base, ~#d2~0.offset := #Ultimate.alloc(8);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~n~0 := #t~nondet0;havoc #t~nondet0; {124#(not (= |main_~#d1~0.base| |main_~#d2~0.base|))} is VALID [2018-11-23 12:54:26,319 INFO L273 TraceCheckUtils]: 6: Hoare triple {124#(not (= |main_~#d1~0.base| |main_~#d2~0.base|))} assume 0 != ~n~0;#t~ite1.base, #t~ite1.offset := ~#d1~0.base, ~#d1~0.offset; {125#(not (= |main_#t~ite1.base| |main_~#d2~0.base|))} is VALID [2018-11-23 12:54:26,320 INFO L273 TraceCheckUtils]: 7: Hoare triple {125#(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; {126#(not (= main_~pd~0.base |main_~#d2~0.base|))} is VALID [2018-11-23 12:54:26,320 INFO L273 TraceCheckUtils]: 8: Hoare triple {126#(not (= main_~pd~0.base |main_~#d2~0.base|))} assume ~pd~0.base == ~#d2~0.base && ~pd~0.offset == ~#d2~0.offset;call write~int(0, ~pd~0.base, ~pd~0.offset, 4); {123#false} is VALID [2018-11-23 12:54:26,321 INFO L273 TraceCheckUtils]: 9: Hoare triple {123#false} #t~short3 := ~pd~0.base == ~#d2~0.base && ~pd~0.offset == ~#d2~0.offset; {123#false} is VALID [2018-11-23 12:54:26,321 INFO L273 TraceCheckUtils]: 10: Hoare triple {123#false} assume #t~short3;call #t~mem2 := read~int(~#d2~0.base, 4 + ~#d2~0.offset, 4);#t~short3 := 0 != #t~mem2; {123#false} is VALID [2018-11-23 12:54:26,322 INFO L273 TraceCheckUtils]: 11: Hoare triple {123#false} assume #t~short3;havoc #t~short3;havoc #t~mem2; {123#false} is VALID [2018-11-23 12:54:26,322 INFO L273 TraceCheckUtils]: 12: Hoare triple {123#false} assume !false; {123#false} is VALID [2018-11-23 12:54:26,324 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 12:54:26,324 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:54:26,325 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 12:54:26,326 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-11-23 12:54:26,327 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:54:26,327 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 12:54:26,383 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 12:54:26,384 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 12:54:26,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 12:54:26,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 12:54:26,384 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 5 states. [2018-11-23 12:54:26,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:54:26,533 INFO L93 Difference]: Finished difference Result 21 states and 20 transitions. [2018-11-23 12:54:26,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 12:54:26,533 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-11-23 12:54:26,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:54:26,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:54:26,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 20 transitions. [2018-11-23 12:54:26,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:54:26,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 20 transitions. [2018-11-23 12:54:26,539 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 20 transitions. [2018-11-23 12:54:26,596 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 12:54:26,597 INFO L225 Difference]: With dead ends: 21 [2018-11-23 12:54:26,597 INFO L226 Difference]: Without dead ends: 14 [2018-11-23 12:54:26,599 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-23 12:54:26,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-11-23 12:54:26,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-11-23 12:54:26,608 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:54:26,608 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states. Second operand 14 states. [2018-11-23 12:54:26,609 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand 14 states. [2018-11-23 12:54:26,609 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 14 states. [2018-11-23 12:54:26,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:54:26,611 INFO L93 Difference]: Finished difference Result 14 states and 13 transitions. [2018-11-23 12:54:26,611 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 13 transitions. [2018-11-23 12:54:26,611 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:54:26,612 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:54:26,612 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand 14 states. [2018-11-23 12:54:26,612 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 14 states. [2018-11-23 12:54:26,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:54:26,614 INFO L93 Difference]: Finished difference Result 14 states and 13 transitions. [2018-11-23 12:54:26,614 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 13 transitions. [2018-11-23 12:54:26,615 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:54:26,615 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:54:26,615 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:54:26,615 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:54:26,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 12:54:26,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 13 transitions. [2018-11-23 12:54:26,617 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 13 transitions. Word has length 13 [2018-11-23 12:54:26,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:54:26,618 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 13 transitions. [2018-11-23 12:54:26,618 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 12:54:26,618 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 13 transitions. [2018-11-23 12:54:26,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-23 12:54:26,619 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:54:26,619 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:54:26,619 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:54:26,619 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:54:26,620 INFO L82 PathProgramCache]: Analyzing trace with hash -1852956943, now seen corresponding path program 1 times [2018-11-23 12:54:26,620 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:54:26,620 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:54:26,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:54:26,621 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:54:26,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:54:26,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 12:54:26,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 12:54:26,694 INFO L469 BasicCegarLoop]: Counterexample might be feasible ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); VAL [|#NULL.base|=13, |#NULL.offset|=9, |old(#NULL.base)|=13, |old(#NULL.offset)|=9] [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=13, |old(#NULL.offset)|=9] [?] assume true; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=13, |old(#NULL.offset)|=9] [?] RET #35#return; VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] CALL call #t~ret4 := main(); VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] call ~#d1~0.base, ~#d1~0.offset := #Ultimate.alloc(8);call ~#d2~0.base, ~#d2~0.offset := #Ultimate.alloc(8);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~n~0 := #t~nondet0;havoc #t~nondet0; VAL [main_~n~0=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#d1~0.base|=11, |main_~#d1~0.offset|=0, |main_~#d2~0.base|=10, |main_~#d2~0.offset|=0] [?] assume !(0 != ~n~0);#t~ite1.base, #t~ite1.offset := ~#d2~0.base, ~#d2~0.offset; VAL [main_~n~0=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~ite1.base|=10, |main_#t~ite1.offset|=0, |main_~#d1~0.base|=11, |main_~#d1~0.offset|=0, |main_~#d2~0.base|=10, |main_~#d2~0.offset|=0] [?] ~pd~0.base, ~pd~0.offset := #t~ite1.base, #t~ite1.offset;havoc #t~ite1.base, #t~ite1.offset; VAL [main_~n~0=0, main_~pd~0.base=10, main_~pd~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#d1~0.base|=11, |main_~#d1~0.offset|=0, |main_~#d2~0.base|=10, |main_~#d2~0.offset|=0] [?] assume ~pd~0.base == ~#d2~0.base && ~pd~0.offset == ~#d2~0.offset;call write~int(0, ~pd~0.base, ~pd~0.offset, 4); VAL [main_~n~0=0, main_~pd~0.base=10, main_~pd~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#d1~0.base|=11, |main_~#d1~0.offset|=0, |main_~#d2~0.base|=10, |main_~#d2~0.offset|=0] [?] #t~short3 := ~pd~0.base == ~#d2~0.base && ~pd~0.offset == ~#d2~0.offset; VAL [main_~n~0=0, main_~pd~0.base=10, main_~pd~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~short3|=true, |main_~#d1~0.base|=11, |main_~#d1~0.offset|=0, |main_~#d2~0.base|=10, |main_~#d2~0.offset|=0] [?] assume #t~short3;call #t~mem2 := read~int(~#d2~0.base, 4 + ~#d2~0.offset, 4);#t~short3 := 0 != #t~mem2; VAL [main_~n~0=0, main_~pd~0.base=10, main_~pd~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~mem2|=12, |main_#t~short3|=true, |main_~#d1~0.base|=11, |main_~#d1~0.offset|=0, |main_~#d2~0.base|=10, |main_~#d2~0.offset|=0] [?] assume #t~short3;havoc #t~short3;havoc #t~mem2; VAL [main_~n~0=0, main_~pd~0.base=10, main_~pd~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#d1~0.base|=11, |main_~#d1~0.offset|=0, |main_~#d2~0.base|=10, |main_~#d2~0.offset|=0] [?] assume !false; VAL [main_~n~0=0, main_~pd~0.base=10, main_~pd~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#d1~0.base|=11, |main_~#d1~0.offset|=0, |main_~#d2~0.base|=10, |main_~#d2~0.offset|=0] [?] CALL call ULTIMATE.init(); VAL [#NULL.base=13, #NULL.offset=9, old(#NULL.base)=13, old(#NULL.offset)=9] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=13, old(#NULL.offset)=9] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=13, old(#NULL.offset)=9] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret4 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L12] call ~#d1~0.base, ~#d1~0.offset := #Ultimate.alloc(8); [L12] call ~#d2~0.base, ~#d2~0.offset := #Ultimate.alloc(8); [L13] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L13] ~n~0 := #t~nondet0; [L13] havoc #t~nondet0; VAL [#NULL.base=0, #NULL.offset=0, ~#d1~0.base=11, ~#d1~0.offset=0, ~#d2~0.base=10, ~#d2~0.offset=0, ~n~0=0] [L14] assume !(0 != ~n~0); [L14] #t~ite1.base, #t~ite1.offset := ~#d2~0.base, ~#d2~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~ite1.base=10, #t~ite1.offset=0, ~#d1~0.base=11, ~#d1~0.offset=0, ~#d2~0.base=10, ~#d2~0.offset=0, ~n~0=0] [L14] ~pd~0.base, ~pd~0.offset := #t~ite1.base, #t~ite1.offset; [L14] havoc #t~ite1.base, #t~ite1.offset; VAL [#NULL.base=0, #NULL.offset=0, ~#d1~0.base=11, ~#d1~0.offset=0, ~#d2~0.base=10, ~#d2~0.offset=0, ~n~0=0, ~pd~0.base=10, ~pd~0.offset=0] [L15-L19] assume ~pd~0.base == ~#d2~0.base && ~pd~0.offset == ~#d2~0.offset; [L16] call write~int(0, ~pd~0.base, ~pd~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, ~#d1~0.base=11, ~#d1~0.offset=0, ~#d2~0.base=10, ~#d2~0.offset=0, ~n~0=0, ~pd~0.base=10, ~pd~0.offset=0] [L20] #t~short3 := ~pd~0.base == ~#d2~0.base && ~pd~0.offset == ~#d2~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~short3=true, ~#d1~0.base=11, ~#d1~0.offset=0, ~#d2~0.base=10, ~#d2~0.offset=0, ~n~0=0, ~pd~0.base=10, ~pd~0.offset=0] [L20] assume #t~short3; [L20] call #t~mem2 := read~int(~#d2~0.base, 4 + ~#d2~0.offset, 4); [L20] #t~short3 := 0 != #t~mem2; VAL [#NULL.base=0, #NULL.offset=0, #t~mem2=12, #t~short3=true, ~#d1~0.base=11, ~#d1~0.offset=0, ~#d2~0.base=10, ~#d2~0.offset=0, ~n~0=0, ~pd~0.base=10, ~pd~0.offset=0] [L20-L22] assume #t~short3; [L20] havoc #t~short3; [L20] havoc #t~mem2; VAL [#NULL.base=0, #NULL.offset=0, ~#d1~0.base=11, ~#d1~0.offset=0, ~#d2~0.base=10, ~#d2~0.offset=0, ~n~0=0, ~pd~0.base=10, ~pd~0.offset=0] [L26] assert false; VAL [#NULL.base=0, #NULL.offset=0, ~#d1~0.base=11, ~#d1~0.offset=0, ~#d2~0.base=10, ~#d2~0.offset=0, ~n~0=0, ~pd~0.base=10, ~pd~0.offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL.base=13, #NULL.offset=9, old(#NULL.base)=13, old(#NULL.offset)=9] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=13, old(#NULL.offset)=9] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=13, old(#NULL.offset)=9] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret4 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L12] call ~#d1~0.base, ~#d1~0.offset := #Ultimate.alloc(8); [L12] call ~#d2~0.base, ~#d2~0.offset := #Ultimate.alloc(8); [L13] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L13] ~n~0 := #t~nondet0; [L13] havoc #t~nondet0; VAL [#NULL.base=0, #NULL.offset=0, ~#d1~0.base=11, ~#d1~0.offset=0, ~#d2~0.base=10, ~#d2~0.offset=0, ~n~0=0] [L14] assume !(0 != ~n~0); [L14] #t~ite1.base, #t~ite1.offset := ~#d2~0.base, ~#d2~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~ite1.base=10, #t~ite1.offset=0, ~#d1~0.base=11, ~#d1~0.offset=0, ~#d2~0.base=10, ~#d2~0.offset=0, ~n~0=0] [L14] ~pd~0.base, ~pd~0.offset := #t~ite1.base, #t~ite1.offset; [L14] havoc #t~ite1.base, #t~ite1.offset; VAL [#NULL.base=0, #NULL.offset=0, ~#d1~0.base=11, ~#d1~0.offset=0, ~#d2~0.base=10, ~#d2~0.offset=0, ~n~0=0, ~pd~0.base=10, ~pd~0.offset=0] [L15-L19] assume ~pd~0.base == ~#d2~0.base && ~pd~0.offset == ~#d2~0.offset; [L16] call write~int(0, ~pd~0.base, ~pd~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, ~#d1~0.base=11, ~#d1~0.offset=0, ~#d2~0.base=10, ~#d2~0.offset=0, ~n~0=0, ~pd~0.base=10, ~pd~0.offset=0] [L20] #t~short3 := ~pd~0.base == ~#d2~0.base && ~pd~0.offset == ~#d2~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~short3=true, ~#d1~0.base=11, ~#d1~0.offset=0, ~#d2~0.base=10, ~#d2~0.offset=0, ~n~0=0, ~pd~0.base=10, ~pd~0.offset=0] [L20] assume #t~short3; [L20] call #t~mem2 := read~int(~#d2~0.base, 4 + ~#d2~0.offset, 4); [L20] #t~short3 := 0 != #t~mem2; VAL [#NULL.base=0, #NULL.offset=0, #t~mem2=12, #t~short3=true, ~#d1~0.base=11, ~#d1~0.offset=0, ~#d2~0.base=10, ~#d2~0.offset=0, ~n~0=0, ~pd~0.base=10, ~pd~0.offset=0] [L20-L22] assume #t~short3; [L20] havoc #t~short3; [L20] havoc #t~mem2; VAL [#NULL.base=0, #NULL.offset=0, ~#d1~0.base=11, ~#d1~0.offset=0, ~#d2~0.base=10, ~#d2~0.offset=0, ~n~0=0, ~pd~0.base=10, ~pd~0.offset=0] [L26] assert false; VAL [#NULL.base=0, #NULL.offset=0, ~#d1~0.base=11, ~#d1~0.offset=0, ~#d2~0.base=10, ~#d2~0.offset=0, ~n~0=0, ~pd~0.base=10, ~pd~0.offset=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=13, #NULL!offset=9, old(#NULL!base)=13, old(#NULL!offset)=9] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=13, old(#NULL!offset)=9] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret4 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L12] FCALL call ~#d1~0 := #Ultimate.alloc(8); [L12] FCALL call ~#d2~0 := #Ultimate.alloc(8); [L13] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L13] ~n~0 := #t~nondet0; [L13] havoc #t~nondet0; VAL [#NULL!base=0, #NULL!offset=0, ~#d1~0!base=11, ~#d1~0!offset=0, ~#d2~0!base=10, ~#d2~0!offset=0, ~n~0=0] [L14] COND FALSE !(0 != ~n~0) [L14] #t~ite1 := ~#d2~0; VAL [#NULL!base=0, #NULL!offset=0, #t~ite1!base=10, #t~ite1!offset=0, ~#d1~0!base=11, ~#d1~0!offset=0, ~#d2~0!base=10, ~#d2~0!offset=0, ~n~0=0] [L14] ~pd~0 := #t~ite1; [L14] havoc #t~ite1; VAL [#NULL!base=0, #NULL!offset=0, ~#d1~0!base=11, ~#d1~0!offset=0, ~#d2~0!base=10, ~#d2~0!offset=0, ~n~0=0, ~pd~0!base=10, ~pd~0!offset=0] [L15] COND TRUE ~pd~0 == ~#d2~0 [L16] FCALL call write~int(0, { base: ~pd~0!base, offset: ~pd~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#d1~0!base=11, ~#d1~0!offset=0, ~#d2~0!base=10, ~#d2~0!offset=0, ~n~0=0, ~pd~0!base=10, ~pd~0!offset=0] [L20] #t~short3 := ~pd~0 == ~#d2~0; VAL [#NULL!base=0, #NULL!offset=0, #t~short3=true, ~#d1~0!base=11, ~#d1~0!offset=0, ~#d2~0!base=10, ~#d2~0!offset=0, ~n~0=0, ~pd~0!base=10, ~pd~0!offset=0] [L20] COND TRUE #t~short3 [L20] FCALL call #t~mem2 := read~int({ base: ~#d2~0!base, offset: 4 + ~#d2~0!offset }, 4); [L20] #t~short3 := 0 != #t~mem2; VAL [#NULL!base=0, #NULL!offset=0, #t~mem2=12, #t~short3=true, ~#d1~0!base=11, ~#d1~0!offset=0, ~#d2~0!base=10, ~#d2~0!offset=0, ~n~0=0, ~pd~0!base=10, ~pd~0!offset=0] [L20] COND TRUE #t~short3 [L20] havoc #t~short3; [L20] havoc #t~mem2; VAL [#NULL!base=0, #NULL!offset=0, ~#d1~0!base=11, ~#d1~0!offset=0, ~#d2~0!base=10, ~#d2~0!offset=0, ~n~0=0, ~pd~0!base=10, ~pd~0!offset=0] [L26] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~#d1~0!base=11, ~#d1~0!offset=0, ~#d2~0!base=10, ~#d2~0!offset=0, ~n~0=0, ~pd~0!base=10, ~pd~0!offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=13, #NULL!offset=9, old(#NULL!base)=13, old(#NULL!offset)=9] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=13, old(#NULL!offset)=9] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret4 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L12] FCALL call ~#d1~0 := #Ultimate.alloc(8); [L12] FCALL call ~#d2~0 := #Ultimate.alloc(8); [L13] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L13] ~n~0 := #t~nondet0; [L13] havoc #t~nondet0; VAL [#NULL!base=0, #NULL!offset=0, ~#d1~0!base=11, ~#d1~0!offset=0, ~#d2~0!base=10, ~#d2~0!offset=0, ~n~0=0] [L14] COND FALSE !(0 != ~n~0) [L14] #t~ite1 := ~#d2~0; VAL [#NULL!base=0, #NULL!offset=0, #t~ite1!base=10, #t~ite1!offset=0, ~#d1~0!base=11, ~#d1~0!offset=0, ~#d2~0!base=10, ~#d2~0!offset=0, ~n~0=0] [L14] ~pd~0 := #t~ite1; [L14] havoc #t~ite1; VAL [#NULL!base=0, #NULL!offset=0, ~#d1~0!base=11, ~#d1~0!offset=0, ~#d2~0!base=10, ~#d2~0!offset=0, ~n~0=0, ~pd~0!base=10, ~pd~0!offset=0] [L15] COND TRUE ~pd~0 == ~#d2~0 [L16] FCALL call write~int(0, { base: ~pd~0!base, offset: ~pd~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#d1~0!base=11, ~#d1~0!offset=0, ~#d2~0!base=10, ~#d2~0!offset=0, ~n~0=0, ~pd~0!base=10, ~pd~0!offset=0] [L20] #t~short3 := ~pd~0 == ~#d2~0; VAL [#NULL!base=0, #NULL!offset=0, #t~short3=true, ~#d1~0!base=11, ~#d1~0!offset=0, ~#d2~0!base=10, ~#d2~0!offset=0, ~n~0=0, ~pd~0!base=10, ~pd~0!offset=0] [L20] COND TRUE #t~short3 [L20] FCALL call #t~mem2 := read~int({ base: ~#d2~0!base, offset: 4 + ~#d2~0!offset }, 4); [L20] #t~short3 := 0 != #t~mem2; VAL [#NULL!base=0, #NULL!offset=0, #t~mem2=12, #t~short3=true, ~#d1~0!base=11, ~#d1~0!offset=0, ~#d2~0!base=10, ~#d2~0!offset=0, ~n~0=0, ~pd~0!base=10, ~pd~0!offset=0] [L20] COND TRUE #t~short3 [L20] havoc #t~short3; [L20] havoc #t~mem2; VAL [#NULL!base=0, #NULL!offset=0, ~#d1~0!base=11, ~#d1~0!offset=0, ~#d2~0!base=10, ~#d2~0!offset=0, ~n~0=0, ~pd~0!base=10, ~pd~0!offset=0] [L26] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~#d1~0!base=11, ~#d1~0!offset=0, ~#d2~0!base=10, ~#d2~0!offset=0, ~n~0=0, ~pd~0!base=10, ~pd~0!offset=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=13, #NULL!offset=9, old(#NULL!base)=13, old(#NULL!offset)=9] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=13, old(#NULL!offset)=9] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret4 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L12] FCALL call ~#d1~0 := #Ultimate.alloc(8); [L12] FCALL call ~#d2~0 := #Ultimate.alloc(8); [L13] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L13] ~n~0 := #t~nondet0; [L13] havoc #t~nondet0; VAL [#NULL!base=0, #NULL!offset=0, ~#d1~0!base=11, ~#d1~0!offset=0, ~#d2~0!base=10, ~#d2~0!offset=0, ~n~0=0] [L14] COND FALSE !(0 != ~n~0) [L14] #t~ite1 := ~#d2~0; VAL [#NULL!base=0, #NULL!offset=0, #t~ite1!base=10, #t~ite1!offset=0, ~#d1~0!base=11, ~#d1~0!offset=0, ~#d2~0!base=10, ~#d2~0!offset=0, ~n~0=0] [L14] ~pd~0 := #t~ite1; [L14] havoc #t~ite1; VAL [#NULL!base=0, #NULL!offset=0, ~#d1~0!base=11, ~#d1~0!offset=0, ~#d2~0!base=10, ~#d2~0!offset=0, ~n~0=0, ~pd~0!base=10, ~pd~0!offset=0] [L15] COND TRUE ~pd~0 == ~#d2~0 [L16] FCALL call write~int(0, { base: ~pd~0!base, offset: ~pd~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#d1~0!base=11, ~#d1~0!offset=0, ~#d2~0!base=10, ~#d2~0!offset=0, ~n~0=0, ~pd~0!base=10, ~pd~0!offset=0] [L20] #t~short3 := ~pd~0 == ~#d2~0; VAL [#NULL!base=0, #NULL!offset=0, #t~short3=true, ~#d1~0!base=11, ~#d1~0!offset=0, ~#d2~0!base=10, ~#d2~0!offset=0, ~n~0=0, ~pd~0!base=10, ~pd~0!offset=0] [L20] COND TRUE #t~short3 [L20] FCALL call #t~mem2 := read~int({ base: ~#d2~0!base, offset: 4 + ~#d2~0!offset }, 4); [L20] #t~short3 := 0 != #t~mem2; VAL [#NULL!base=0, #NULL!offset=0, #t~mem2=12, #t~short3=true, ~#d1~0!base=11, ~#d1~0!offset=0, ~#d2~0!base=10, ~#d2~0!offset=0, ~n~0=0, ~pd~0!base=10, ~pd~0!offset=0] [L20] COND TRUE #t~short3 [L20] havoc #t~short3; [L20] havoc #t~mem2; VAL [#NULL!base=0, #NULL!offset=0, ~#d1~0!base=11, ~#d1~0!offset=0, ~#d2~0!base=10, ~#d2~0!offset=0, ~n~0=0, ~pd~0!base=10, ~pd~0!offset=0] [L26] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~#d1~0!base=11, ~#d1~0!offset=0, ~#d2~0!base=10, ~#d2~0!offset=0, ~n~0=0, ~pd~0!base=10, ~pd~0!offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=13, #NULL!offset=9, old(#NULL!base)=13, old(#NULL!offset)=9] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=13, old(#NULL!offset)=9] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret4 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L12] FCALL call ~#d1~0 := #Ultimate.alloc(8); [L12] FCALL call ~#d2~0 := #Ultimate.alloc(8); [L13] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L13] ~n~0 := #t~nondet0; [L13] havoc #t~nondet0; VAL [#NULL!base=0, #NULL!offset=0, ~#d1~0!base=11, ~#d1~0!offset=0, ~#d2~0!base=10, ~#d2~0!offset=0, ~n~0=0] [L14] COND FALSE !(0 != ~n~0) [L14] #t~ite1 := ~#d2~0; VAL [#NULL!base=0, #NULL!offset=0, #t~ite1!base=10, #t~ite1!offset=0, ~#d1~0!base=11, ~#d1~0!offset=0, ~#d2~0!base=10, ~#d2~0!offset=0, ~n~0=0] [L14] ~pd~0 := #t~ite1; [L14] havoc #t~ite1; VAL [#NULL!base=0, #NULL!offset=0, ~#d1~0!base=11, ~#d1~0!offset=0, ~#d2~0!base=10, ~#d2~0!offset=0, ~n~0=0, ~pd~0!base=10, ~pd~0!offset=0] [L15] COND TRUE ~pd~0 == ~#d2~0 [L16] FCALL call write~int(0, { base: ~pd~0!base, offset: ~pd~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#d1~0!base=11, ~#d1~0!offset=0, ~#d2~0!base=10, ~#d2~0!offset=0, ~n~0=0, ~pd~0!base=10, ~pd~0!offset=0] [L20] #t~short3 := ~pd~0 == ~#d2~0; VAL [#NULL!base=0, #NULL!offset=0, #t~short3=true, ~#d1~0!base=11, ~#d1~0!offset=0, ~#d2~0!base=10, ~#d2~0!offset=0, ~n~0=0, ~pd~0!base=10, ~pd~0!offset=0] [L20] COND TRUE #t~short3 [L20] FCALL call #t~mem2 := read~int({ base: ~#d2~0!base, offset: 4 + ~#d2~0!offset }, 4); [L20] #t~short3 := 0 != #t~mem2; VAL [#NULL!base=0, #NULL!offset=0, #t~mem2=12, #t~short3=true, ~#d1~0!base=11, ~#d1~0!offset=0, ~#d2~0!base=10, ~#d2~0!offset=0, ~n~0=0, ~pd~0!base=10, ~pd~0!offset=0] [L20] COND TRUE #t~short3 [L20] havoc #t~short3; [L20] havoc #t~mem2; VAL [#NULL!base=0, #NULL!offset=0, ~#d1~0!base=11, ~#d1~0!offset=0, ~#d2~0!base=10, ~#d2~0!offset=0, ~n~0=0, ~pd~0!base=10, ~pd~0!offset=0] [L26] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~#d1~0!base=11, ~#d1~0!offset=0, ~#d2~0!base=10, ~#d2~0!offset=0, ~n~0=0, ~pd~0!base=10, ~pd~0!offset=0] [L12] struct dummy d1, d2; [L13] int n = __VERIFIER_nondet_int(); [L14] EXPR n ? &d1 : &d2 VAL [d1={11:0}, d2={10:0}, n=0, n ? &d1 : &d2={10:0}] [L14] struct dummy *pd = n ? &d1 : &d2; [L15] COND TRUE pd == &d2 [L16] pd->a = 0 VAL [d1={11:0}, d2={10:0}, n=0, pd={10:0}] [L20] pd == &d2 && d2.b != 0 [L20] EXPR d2.b [L20] pd == &d2 && d2.b != 0 VAL [d1={11:0}, d2={10:0}, d2.b=12, n=0, pd={10:0}, pd == &d2 && d2.b != 0=1] [L20] COND TRUE pd == &d2 && d2.b != 0 [L26] __VERIFIER_error() VAL [d1={11:0}, d2={10:0}, n=0, pd={10:0}] ----- [2018-11-23 12:54:26,753 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2018-11-23 12:54:26,754 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2018-11-23 12:54:26,754 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2018-11-23 12:54:26,754 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2018-11-23 12:54:26,754 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2018-11-23 12:54:26,754 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2018-11-23 12:54:26,754 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2018-11-23 12:54:26,755 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2018-11-23 12:54:26,755 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2018-11-23 12:54:26,755 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-23 12:54:26,755 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-23 12:54:26,755 WARN L170 areAnnotationChecker]: L14-2 has no Hoare annotation [2018-11-23 12:54:26,755 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2018-11-23 12:54:26,756 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2018-11-23 12:54:26,756 WARN L170 areAnnotationChecker]: L15-2 has no Hoare annotation [2018-11-23 12:54:26,756 WARN L170 areAnnotationChecker]: L20 has no Hoare annotation [2018-11-23 12:54:26,756 WARN L170 areAnnotationChecker]: L20 has no Hoare annotation [2018-11-23 12:54:26,756 WARN L170 areAnnotationChecker]: L20-2 has no Hoare annotation [2018-11-23 12:54:26,756 WARN L170 areAnnotationChecker]: L20-2 has no Hoare annotation [2018-11-23 12:54:26,757 WARN L170 areAnnotationChecker]: L21 has no Hoare annotation [2018-11-23 12:54:26,757 WARN L170 areAnnotationChecker]: L21 has no Hoare annotation [2018-11-23 12:54:26,757 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-23 12:54:26,757 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2018-11-23 12:54:26,757 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 12:54:26,760 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 12:54:26 BoogieIcfgContainer [2018-11-23 12:54:26,760 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 12:54:26,760 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 12:54:26,761 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 12:54:26,761 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 12:54:26,762 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:54:23" (3/4) ... [2018-11-23 12:54:26,764 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|=13, |#NULL.offset|=9, |old(#NULL.base)|=13, |old(#NULL.offset)|=9] [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=13, |old(#NULL.offset)|=9] [?] assume true; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=13, |old(#NULL.offset)|=9] [?] RET #35#return; VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] CALL call #t~ret4 := main(); VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] call ~#d1~0.base, ~#d1~0.offset := #Ultimate.alloc(8);call ~#d2~0.base, ~#d2~0.offset := #Ultimate.alloc(8);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~n~0 := #t~nondet0;havoc #t~nondet0; VAL [main_~n~0=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#d1~0.base|=11, |main_~#d1~0.offset|=0, |main_~#d2~0.base|=10, |main_~#d2~0.offset|=0] [?] assume !(0 != ~n~0);#t~ite1.base, #t~ite1.offset := ~#d2~0.base, ~#d2~0.offset; VAL [main_~n~0=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~ite1.base|=10, |main_#t~ite1.offset|=0, |main_~#d1~0.base|=11, |main_~#d1~0.offset|=0, |main_~#d2~0.base|=10, |main_~#d2~0.offset|=0] [?] ~pd~0.base, ~pd~0.offset := #t~ite1.base, #t~ite1.offset;havoc #t~ite1.base, #t~ite1.offset; VAL [main_~n~0=0, main_~pd~0.base=10, main_~pd~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#d1~0.base|=11, |main_~#d1~0.offset|=0, |main_~#d2~0.base|=10, |main_~#d2~0.offset|=0] [?] assume ~pd~0.base == ~#d2~0.base && ~pd~0.offset == ~#d2~0.offset;call write~int(0, ~pd~0.base, ~pd~0.offset, 4); VAL [main_~n~0=0, main_~pd~0.base=10, main_~pd~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#d1~0.base|=11, |main_~#d1~0.offset|=0, |main_~#d2~0.base|=10, |main_~#d2~0.offset|=0] [?] #t~short3 := ~pd~0.base == ~#d2~0.base && ~pd~0.offset == ~#d2~0.offset; VAL [main_~n~0=0, main_~pd~0.base=10, main_~pd~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~short3|=true, |main_~#d1~0.base|=11, |main_~#d1~0.offset|=0, |main_~#d2~0.base|=10, |main_~#d2~0.offset|=0] [?] assume #t~short3;call #t~mem2 := read~int(~#d2~0.base, 4 + ~#d2~0.offset, 4);#t~short3 := 0 != #t~mem2; VAL [main_~n~0=0, main_~pd~0.base=10, main_~pd~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~mem2|=12, |main_#t~short3|=true, |main_~#d1~0.base|=11, |main_~#d1~0.offset|=0, |main_~#d2~0.base|=10, |main_~#d2~0.offset|=0] [?] assume #t~short3;havoc #t~short3;havoc #t~mem2; VAL [main_~n~0=0, main_~pd~0.base=10, main_~pd~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#d1~0.base|=11, |main_~#d1~0.offset|=0, |main_~#d2~0.base|=10, |main_~#d2~0.offset|=0] [?] assume !false; VAL [main_~n~0=0, main_~pd~0.base=10, main_~pd~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#d1~0.base|=11, |main_~#d1~0.offset|=0, |main_~#d2~0.base|=10, |main_~#d2~0.offset|=0] [?] CALL call ULTIMATE.init(); VAL [#NULL.base=13, #NULL.offset=9, old(#NULL.base)=13, old(#NULL.offset)=9] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=13, old(#NULL.offset)=9] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=13, old(#NULL.offset)=9] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret4 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L12] call ~#d1~0.base, ~#d1~0.offset := #Ultimate.alloc(8); [L12] call ~#d2~0.base, ~#d2~0.offset := #Ultimate.alloc(8); [L13] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L13] ~n~0 := #t~nondet0; [L13] havoc #t~nondet0; VAL [#NULL.base=0, #NULL.offset=0, ~#d1~0.base=11, ~#d1~0.offset=0, ~#d2~0.base=10, ~#d2~0.offset=0, ~n~0=0] [L14] assume !(0 != ~n~0); [L14] #t~ite1.base, #t~ite1.offset := ~#d2~0.base, ~#d2~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~ite1.base=10, #t~ite1.offset=0, ~#d1~0.base=11, ~#d1~0.offset=0, ~#d2~0.base=10, ~#d2~0.offset=0, ~n~0=0] [L14] ~pd~0.base, ~pd~0.offset := #t~ite1.base, #t~ite1.offset; [L14] havoc #t~ite1.base, #t~ite1.offset; VAL [#NULL.base=0, #NULL.offset=0, ~#d1~0.base=11, ~#d1~0.offset=0, ~#d2~0.base=10, ~#d2~0.offset=0, ~n~0=0, ~pd~0.base=10, ~pd~0.offset=0] [L15-L19] assume ~pd~0.base == ~#d2~0.base && ~pd~0.offset == ~#d2~0.offset; [L16] call write~int(0, ~pd~0.base, ~pd~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, ~#d1~0.base=11, ~#d1~0.offset=0, ~#d2~0.base=10, ~#d2~0.offset=0, ~n~0=0, ~pd~0.base=10, ~pd~0.offset=0] [L20] #t~short3 := ~pd~0.base == ~#d2~0.base && ~pd~0.offset == ~#d2~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~short3=true, ~#d1~0.base=11, ~#d1~0.offset=0, ~#d2~0.base=10, ~#d2~0.offset=0, ~n~0=0, ~pd~0.base=10, ~pd~0.offset=0] [L20] assume #t~short3; [L20] call #t~mem2 := read~int(~#d2~0.base, 4 + ~#d2~0.offset, 4); [L20] #t~short3 := 0 != #t~mem2; VAL [#NULL.base=0, #NULL.offset=0, #t~mem2=12, #t~short3=true, ~#d1~0.base=11, ~#d1~0.offset=0, ~#d2~0.base=10, ~#d2~0.offset=0, ~n~0=0, ~pd~0.base=10, ~pd~0.offset=0] [L20-L22] assume #t~short3; [L20] havoc #t~short3; [L20] havoc #t~mem2; VAL [#NULL.base=0, #NULL.offset=0, ~#d1~0.base=11, ~#d1~0.offset=0, ~#d2~0.base=10, ~#d2~0.offset=0, ~n~0=0, ~pd~0.base=10, ~pd~0.offset=0] [L26] assert false; VAL [#NULL.base=0, #NULL.offset=0, ~#d1~0.base=11, ~#d1~0.offset=0, ~#d2~0.base=10, ~#d2~0.offset=0, ~n~0=0, ~pd~0.base=10, ~pd~0.offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL.base=13, #NULL.offset=9, old(#NULL.base)=13, old(#NULL.offset)=9] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=13, old(#NULL.offset)=9] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=13, old(#NULL.offset)=9] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret4 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L12] call ~#d1~0.base, ~#d1~0.offset := #Ultimate.alloc(8); [L12] call ~#d2~0.base, ~#d2~0.offset := #Ultimate.alloc(8); [L13] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L13] ~n~0 := #t~nondet0; [L13] havoc #t~nondet0; VAL [#NULL.base=0, #NULL.offset=0, ~#d1~0.base=11, ~#d1~0.offset=0, ~#d2~0.base=10, ~#d2~0.offset=0, ~n~0=0] [L14] assume !(0 != ~n~0); [L14] #t~ite1.base, #t~ite1.offset := ~#d2~0.base, ~#d2~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~ite1.base=10, #t~ite1.offset=0, ~#d1~0.base=11, ~#d1~0.offset=0, ~#d2~0.base=10, ~#d2~0.offset=0, ~n~0=0] [L14] ~pd~0.base, ~pd~0.offset := #t~ite1.base, #t~ite1.offset; [L14] havoc #t~ite1.base, #t~ite1.offset; VAL [#NULL.base=0, #NULL.offset=0, ~#d1~0.base=11, ~#d1~0.offset=0, ~#d2~0.base=10, ~#d2~0.offset=0, ~n~0=0, ~pd~0.base=10, ~pd~0.offset=0] [L15-L19] assume ~pd~0.base == ~#d2~0.base && ~pd~0.offset == ~#d2~0.offset; [L16] call write~int(0, ~pd~0.base, ~pd~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, ~#d1~0.base=11, ~#d1~0.offset=0, ~#d2~0.base=10, ~#d2~0.offset=0, ~n~0=0, ~pd~0.base=10, ~pd~0.offset=0] [L20] #t~short3 := ~pd~0.base == ~#d2~0.base && ~pd~0.offset == ~#d2~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~short3=true, ~#d1~0.base=11, ~#d1~0.offset=0, ~#d2~0.base=10, ~#d2~0.offset=0, ~n~0=0, ~pd~0.base=10, ~pd~0.offset=0] [L20] assume #t~short3; [L20] call #t~mem2 := read~int(~#d2~0.base, 4 + ~#d2~0.offset, 4); [L20] #t~short3 := 0 != #t~mem2; VAL [#NULL.base=0, #NULL.offset=0, #t~mem2=12, #t~short3=true, ~#d1~0.base=11, ~#d1~0.offset=0, ~#d2~0.base=10, ~#d2~0.offset=0, ~n~0=0, ~pd~0.base=10, ~pd~0.offset=0] [L20-L22] assume #t~short3; [L20] havoc #t~short3; [L20] havoc #t~mem2; VAL [#NULL.base=0, #NULL.offset=0, ~#d1~0.base=11, ~#d1~0.offset=0, ~#d2~0.base=10, ~#d2~0.offset=0, ~n~0=0, ~pd~0.base=10, ~pd~0.offset=0] [L26] assert false; VAL [#NULL.base=0, #NULL.offset=0, ~#d1~0.base=11, ~#d1~0.offset=0, ~#d2~0.base=10, ~#d2~0.offset=0, ~n~0=0, ~pd~0.base=10, ~pd~0.offset=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=13, #NULL!offset=9, old(#NULL!base)=13, old(#NULL!offset)=9] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=13, old(#NULL!offset)=9] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret4 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L12] FCALL call ~#d1~0 := #Ultimate.alloc(8); [L12] FCALL call ~#d2~0 := #Ultimate.alloc(8); [L13] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L13] ~n~0 := #t~nondet0; [L13] havoc #t~nondet0; VAL [#NULL!base=0, #NULL!offset=0, ~#d1~0!base=11, ~#d1~0!offset=0, ~#d2~0!base=10, ~#d2~0!offset=0, ~n~0=0] [L14] COND FALSE !(0 != ~n~0) [L14] #t~ite1 := ~#d2~0; VAL [#NULL!base=0, #NULL!offset=0, #t~ite1!base=10, #t~ite1!offset=0, ~#d1~0!base=11, ~#d1~0!offset=0, ~#d2~0!base=10, ~#d2~0!offset=0, ~n~0=0] [L14] ~pd~0 := #t~ite1; [L14] havoc #t~ite1; VAL [#NULL!base=0, #NULL!offset=0, ~#d1~0!base=11, ~#d1~0!offset=0, ~#d2~0!base=10, ~#d2~0!offset=0, ~n~0=0, ~pd~0!base=10, ~pd~0!offset=0] [L15] COND TRUE ~pd~0 == ~#d2~0 [L16] FCALL call write~int(0, { base: ~pd~0!base, offset: ~pd~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#d1~0!base=11, ~#d1~0!offset=0, ~#d2~0!base=10, ~#d2~0!offset=0, ~n~0=0, ~pd~0!base=10, ~pd~0!offset=0] [L20] #t~short3 := ~pd~0 == ~#d2~0; VAL [#NULL!base=0, #NULL!offset=0, #t~short3=true, ~#d1~0!base=11, ~#d1~0!offset=0, ~#d2~0!base=10, ~#d2~0!offset=0, ~n~0=0, ~pd~0!base=10, ~pd~0!offset=0] [L20] COND TRUE #t~short3 [L20] FCALL call #t~mem2 := read~int({ base: ~#d2~0!base, offset: 4 + ~#d2~0!offset }, 4); [L20] #t~short3 := 0 != #t~mem2; VAL [#NULL!base=0, #NULL!offset=0, #t~mem2=12, #t~short3=true, ~#d1~0!base=11, ~#d1~0!offset=0, ~#d2~0!base=10, ~#d2~0!offset=0, ~n~0=0, ~pd~0!base=10, ~pd~0!offset=0] [L20] COND TRUE #t~short3 [L20] havoc #t~short3; [L20] havoc #t~mem2; VAL [#NULL!base=0, #NULL!offset=0, ~#d1~0!base=11, ~#d1~0!offset=0, ~#d2~0!base=10, ~#d2~0!offset=0, ~n~0=0, ~pd~0!base=10, ~pd~0!offset=0] [L26] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~#d1~0!base=11, ~#d1~0!offset=0, ~#d2~0!base=10, ~#d2~0!offset=0, ~n~0=0, ~pd~0!base=10, ~pd~0!offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=13, #NULL!offset=9, old(#NULL!base)=13, old(#NULL!offset)=9] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=13, old(#NULL!offset)=9] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret4 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L12] FCALL call ~#d1~0 := #Ultimate.alloc(8); [L12] FCALL call ~#d2~0 := #Ultimate.alloc(8); [L13] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L13] ~n~0 := #t~nondet0; [L13] havoc #t~nondet0; VAL [#NULL!base=0, #NULL!offset=0, ~#d1~0!base=11, ~#d1~0!offset=0, ~#d2~0!base=10, ~#d2~0!offset=0, ~n~0=0] [L14] COND FALSE !(0 != ~n~0) [L14] #t~ite1 := ~#d2~0; VAL [#NULL!base=0, #NULL!offset=0, #t~ite1!base=10, #t~ite1!offset=0, ~#d1~0!base=11, ~#d1~0!offset=0, ~#d2~0!base=10, ~#d2~0!offset=0, ~n~0=0] [L14] ~pd~0 := #t~ite1; [L14] havoc #t~ite1; VAL [#NULL!base=0, #NULL!offset=0, ~#d1~0!base=11, ~#d1~0!offset=0, ~#d2~0!base=10, ~#d2~0!offset=0, ~n~0=0, ~pd~0!base=10, ~pd~0!offset=0] [L15] COND TRUE ~pd~0 == ~#d2~0 [L16] FCALL call write~int(0, { base: ~pd~0!base, offset: ~pd~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#d1~0!base=11, ~#d1~0!offset=0, ~#d2~0!base=10, ~#d2~0!offset=0, ~n~0=0, ~pd~0!base=10, ~pd~0!offset=0] [L20] #t~short3 := ~pd~0 == ~#d2~0; VAL [#NULL!base=0, #NULL!offset=0, #t~short3=true, ~#d1~0!base=11, ~#d1~0!offset=0, ~#d2~0!base=10, ~#d2~0!offset=0, ~n~0=0, ~pd~0!base=10, ~pd~0!offset=0] [L20] COND TRUE #t~short3 [L20] FCALL call #t~mem2 := read~int({ base: ~#d2~0!base, offset: 4 + ~#d2~0!offset }, 4); [L20] #t~short3 := 0 != #t~mem2; VAL [#NULL!base=0, #NULL!offset=0, #t~mem2=12, #t~short3=true, ~#d1~0!base=11, ~#d1~0!offset=0, ~#d2~0!base=10, ~#d2~0!offset=0, ~n~0=0, ~pd~0!base=10, ~pd~0!offset=0] [L20] COND TRUE #t~short3 [L20] havoc #t~short3; [L20] havoc #t~mem2; VAL [#NULL!base=0, #NULL!offset=0, ~#d1~0!base=11, ~#d1~0!offset=0, ~#d2~0!base=10, ~#d2~0!offset=0, ~n~0=0, ~pd~0!base=10, ~pd~0!offset=0] [L26] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~#d1~0!base=11, ~#d1~0!offset=0, ~#d2~0!base=10, ~#d2~0!offset=0, ~n~0=0, ~pd~0!base=10, ~pd~0!offset=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=13, #NULL!offset=9, old(#NULL!base)=13, old(#NULL!offset)=9] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=13, old(#NULL!offset)=9] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret4 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L12] FCALL call ~#d1~0 := #Ultimate.alloc(8); [L12] FCALL call ~#d2~0 := #Ultimate.alloc(8); [L13] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L13] ~n~0 := #t~nondet0; [L13] havoc #t~nondet0; VAL [#NULL!base=0, #NULL!offset=0, ~#d1~0!base=11, ~#d1~0!offset=0, ~#d2~0!base=10, ~#d2~0!offset=0, ~n~0=0] [L14] COND FALSE !(0 != ~n~0) [L14] #t~ite1 := ~#d2~0; VAL [#NULL!base=0, #NULL!offset=0, #t~ite1!base=10, #t~ite1!offset=0, ~#d1~0!base=11, ~#d1~0!offset=0, ~#d2~0!base=10, ~#d2~0!offset=0, ~n~0=0] [L14] ~pd~0 := #t~ite1; [L14] havoc #t~ite1; VAL [#NULL!base=0, #NULL!offset=0, ~#d1~0!base=11, ~#d1~0!offset=0, ~#d2~0!base=10, ~#d2~0!offset=0, ~n~0=0, ~pd~0!base=10, ~pd~0!offset=0] [L15] COND TRUE ~pd~0 == ~#d2~0 [L16] FCALL call write~int(0, { base: ~pd~0!base, offset: ~pd~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#d1~0!base=11, ~#d1~0!offset=0, ~#d2~0!base=10, ~#d2~0!offset=0, ~n~0=0, ~pd~0!base=10, ~pd~0!offset=0] [L20] #t~short3 := ~pd~0 == ~#d2~0; VAL [#NULL!base=0, #NULL!offset=0, #t~short3=true, ~#d1~0!base=11, ~#d1~0!offset=0, ~#d2~0!base=10, ~#d2~0!offset=0, ~n~0=0, ~pd~0!base=10, ~pd~0!offset=0] [L20] COND TRUE #t~short3 [L20] FCALL call #t~mem2 := read~int({ base: ~#d2~0!base, offset: 4 + ~#d2~0!offset }, 4); [L20] #t~short3 := 0 != #t~mem2; VAL [#NULL!base=0, #NULL!offset=0, #t~mem2=12, #t~short3=true, ~#d1~0!base=11, ~#d1~0!offset=0, ~#d2~0!base=10, ~#d2~0!offset=0, ~n~0=0, ~pd~0!base=10, ~pd~0!offset=0] [L20] COND TRUE #t~short3 [L20] havoc #t~short3; [L20] havoc #t~mem2; VAL [#NULL!base=0, #NULL!offset=0, ~#d1~0!base=11, ~#d1~0!offset=0, ~#d2~0!base=10, ~#d2~0!offset=0, ~n~0=0, ~pd~0!base=10, ~pd~0!offset=0] [L26] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~#d1~0!base=11, ~#d1~0!offset=0, ~#d2~0!base=10, ~#d2~0!offset=0, ~n~0=0, ~pd~0!base=10, ~pd~0!offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=13, #NULL!offset=9, old(#NULL!base)=13, old(#NULL!offset)=9] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=13, old(#NULL!offset)=9] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret4 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L12] FCALL call ~#d1~0 := #Ultimate.alloc(8); [L12] FCALL call ~#d2~0 := #Ultimate.alloc(8); [L13] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L13] ~n~0 := #t~nondet0; [L13] havoc #t~nondet0; VAL [#NULL!base=0, #NULL!offset=0, ~#d1~0!base=11, ~#d1~0!offset=0, ~#d2~0!base=10, ~#d2~0!offset=0, ~n~0=0] [L14] COND FALSE !(0 != ~n~0) [L14] #t~ite1 := ~#d2~0; VAL [#NULL!base=0, #NULL!offset=0, #t~ite1!base=10, #t~ite1!offset=0, ~#d1~0!base=11, ~#d1~0!offset=0, ~#d2~0!base=10, ~#d2~0!offset=0, ~n~0=0] [L14] ~pd~0 := #t~ite1; [L14] havoc #t~ite1; VAL [#NULL!base=0, #NULL!offset=0, ~#d1~0!base=11, ~#d1~0!offset=0, ~#d2~0!base=10, ~#d2~0!offset=0, ~n~0=0, ~pd~0!base=10, ~pd~0!offset=0] [L15] COND TRUE ~pd~0 == ~#d2~0 [L16] FCALL call write~int(0, { base: ~pd~0!base, offset: ~pd~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#d1~0!base=11, ~#d1~0!offset=0, ~#d2~0!base=10, ~#d2~0!offset=0, ~n~0=0, ~pd~0!base=10, ~pd~0!offset=0] [L20] #t~short3 := ~pd~0 == ~#d2~0; VAL [#NULL!base=0, #NULL!offset=0, #t~short3=true, ~#d1~0!base=11, ~#d1~0!offset=0, ~#d2~0!base=10, ~#d2~0!offset=0, ~n~0=0, ~pd~0!base=10, ~pd~0!offset=0] [L20] COND TRUE #t~short3 [L20] FCALL call #t~mem2 := read~int({ base: ~#d2~0!base, offset: 4 + ~#d2~0!offset }, 4); [L20] #t~short3 := 0 != #t~mem2; VAL [#NULL!base=0, #NULL!offset=0, #t~mem2=12, #t~short3=true, ~#d1~0!base=11, ~#d1~0!offset=0, ~#d2~0!base=10, ~#d2~0!offset=0, ~n~0=0, ~pd~0!base=10, ~pd~0!offset=0] [L20] COND TRUE #t~short3 [L20] havoc #t~short3; [L20] havoc #t~mem2; VAL [#NULL!base=0, #NULL!offset=0, ~#d1~0!base=11, ~#d1~0!offset=0, ~#d2~0!base=10, ~#d2~0!offset=0, ~n~0=0, ~pd~0!base=10, ~pd~0!offset=0] [L26] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~#d1~0!base=11, ~#d1~0!offset=0, ~#d2~0!base=10, ~#d2~0!offset=0, ~n~0=0, ~pd~0!base=10, ~pd~0!offset=0] [L12] struct dummy d1, d2; [L13] int n = __VERIFIER_nondet_int(); [L14] EXPR n ? &d1 : &d2 VAL [d1={11:0}, d2={10:0}, n=0, n ? &d1 : &d2={10:0}] [L14] struct dummy *pd = n ? &d1 : &d2; [L15] COND TRUE pd == &d2 [L16] pd->a = 0 VAL [d1={11:0}, d2={10:0}, n=0, pd={10:0}] [L20] pd == &d2 && d2.b != 0 [L20] EXPR d2.b [L20] pd == &d2 && d2.b != 0 VAL [d1={11:0}, d2={10:0}, d2.b=12, n=0, pd={10:0}, pd == &d2 && d2.b != 0=1] [L20] COND TRUE pd == &d2 && d2.b != 0 [L26] __VERIFIER_error() VAL [d1={11:0}, d2={10:0}, n=0, pd={10:0}] ----- [2018-11-23 12:54:26,821 INFO L145 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/ldv-regression/test28_false-unreach-call_true-termination.c-witness.graphml [2018-11-23 12:54:26,821 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 12:54:26,822 INFO L168 Benchmark]: Toolchain (without parser) took 4055.49 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 721.9 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -638.6 MB). Peak memory consumption was 83.4 MB. Max. memory is 7.1 GB. [2018-11-23 12:54:26,824 INFO L168 Benchmark]: CDTParser took 0.25 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 12:54:26,825 INFO L168 Benchmark]: CACSL2BoogieTranslator took 354.23 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: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 7.1 GB. [2018-11-23 12:54:26,826 INFO L168 Benchmark]: Boogie Procedure Inliner took 27.24 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 12:54:26,826 INFO L168 Benchmark]: Boogie Preprocessor took 27.89 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 12:54:26,827 INFO L168 Benchmark]: RCFGBuilder took 615.78 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 721.9 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -771.8 MB). Peak memory consumption was 26.4 MB. Max. memory is 7.1 GB. [2018-11-23 12:54:26,828 INFO L168 Benchmark]: TraceAbstraction took 2962.54 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 120.0 MB). Peak memory consumption was 120.0 MB. Max. memory is 7.1 GB. [2018-11-23 12:54:26,829 INFO L168 Benchmark]: Witness Printer took 60.42 ms. Allocated memory is still 2.3 GB. Free memory is still 2.1 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 12:54:26,833 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.25 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 354.23 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: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 27.24 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 27.89 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 615.78 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 721.9 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -771.8 MB). Peak memory consumption was 26.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 2962.54 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 120.0 MB). Peak memory consumption was 120.0 MB. Max. memory is 7.1 GB. * Witness Printer took 60.42 ms. Allocated memory is still 2.3 GB. Free memory is still 2.1 GB. There was no memory consumed. 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={11:0}, d2={10:0}, n=0, n ? &d1 : &d2={10:0}] [L14] struct dummy *pd = n ? &d1 : &d2; [L15] COND TRUE pd == &d2 [L16] pd->a = 0 VAL [d1={11:0}, d2={10:0}, n=0, pd={10:0}] [L20] pd == &d2 && d2.b != 0 [L20] EXPR d2.b [L20] pd == &d2 && d2.b != 0 VAL [d1={11:0}, d2={10:0}, d2.b=12, n=0, pd={10:0}, pd == &d2 && d2.b != 0=1] [L20] COND TRUE pd == &d2 && d2.b != 0 [L26] __VERIFIER_error() VAL [d1={11:0}, d2={10:0}, n=0, pd={10:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 18 locations, 1 error locations. UNSAFE Result, 2.8s OverallTime, 3 OverallIterations, 1 TraceHistogramMax, 1.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 19 SDtfs, 31 SDslu, 66 SDs, 0 SdLazy, 58 SolverSat, 6 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s 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.6s InterpolantComputationTime, 39 NumberOfCodeBlocks, 39 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 24 ConstructedInterpolants, 0 QuantifiedInterpolants, 516 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 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...