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/list-properties/simple_false-unreach-call_false-valid-memcleanup.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 12:52:48,814 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 12:52:48,816 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 12:52:48,829 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 12:52:48,829 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 12:52:48,830 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 12:52:48,831 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 12:52:48,833 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 12:52:48,835 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 12:52:48,836 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 12:52:48,837 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 12:52:48,837 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 12:52:48,838 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 12:52:48,839 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 12:52:48,840 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 12:52:48,841 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 12:52:48,842 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 12:52:48,844 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 12:52:48,846 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 12:52:48,848 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 12:52:48,849 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 12:52:48,850 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 12:52:48,853 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 12:52:48,853 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 12:52:48,853 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 12:52:48,854 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 12:52:48,856 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 12:52:48,856 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 12:52:48,857 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 12:52:48,859 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 12:52:48,859 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 12:52:48,860 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 12:52:48,860 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 12:52:48,860 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 12:52:48,861 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 12:52:48,862 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 12:52:48,862 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:52:48,879 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 12:52:48,879 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 12:52:48,880 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 12:52:48,880 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 12:52:48,881 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 12:52:48,881 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 12:52:48,881 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 12:52:48,881 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 12:52:48,882 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 12:52:48,882 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 12:52:48,882 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 12:52:48,882 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 12:52:48,882 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 12:52:48,883 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 12:52:48,883 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 12:52:48,883 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 12:52:48,883 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 12:52:48,883 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 12:52:48,884 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 12:52:48,884 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 12:52:48,884 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 12:52:48,884 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 12:52:48,884 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 12:52:48,885 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 12:52:48,885 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 12:52:48,885 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 12:52:48,885 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 12:52:48,885 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 12:52:48,885 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 12:52:48,886 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 12:52:48,886 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 12:52:48,931 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 12:52:48,944 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 12:52:48,948 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 12:52:48,950 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 12:52:48,950 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 12:52:48,951 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-properties/simple_false-unreach-call_false-valid-memcleanup.i [2018-11-23 12:52:49,011 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e8ae7b803/ba5d8e9152374a82a58ba70576bec805/FLAGe93c95692 [2018-11-23 12:52:49,522 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 12:52:49,523 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-properties/simple_false-unreach-call_false-valid-memcleanup.i [2018-11-23 12:52:49,540 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e8ae7b803/ba5d8e9152374a82a58ba70576bec805/FLAGe93c95692 [2018-11-23 12:52:49,820 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e8ae7b803/ba5d8e9152374a82a58ba70576bec805 [2018-11-23 12:52:49,833 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 12:52:49,835 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 12:52:49,836 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 12:52:49,837 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 12:52:49,843 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 12:52:49,845 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:52:49" (1/1) ... [2018-11-23 12:52:49,848 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@df00045 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:52:49, skipping insertion in model container [2018-11-23 12:52:49,848 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:52:49" (1/1) ... [2018-11-23 12:52:49,860 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 12:52:49,922 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 12:52:50,335 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:52:50,351 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 12:52:50,417 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:52:50,489 INFO L195 MainTranslator]: Completed translation [2018-11-23 12:52:50,489 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:52:50 WrapperNode [2018-11-23 12:52:50,489 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 12:52:50,490 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 12:52:50,491 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 12:52:50,491 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 12:52:50,501 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:52:50" (1/1) ... [2018-11-23 12:52:50,596 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:52:50" (1/1) ... [2018-11-23 12:52:50,609 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 12:52:50,609 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 12:52:50,610 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 12:52:50,610 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 12:52:50,620 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:52:50" (1/1) ... [2018-11-23 12:52:50,620 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:52:50" (1/1) ... [2018-11-23 12:52:50,625 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:52:50" (1/1) ... [2018-11-23 12:52:50,625 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:52:50" (1/1) ... [2018-11-23 12:52:50,651 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:52:50" (1/1) ... [2018-11-23 12:52:50,660 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:52:50" (1/1) ... [2018-11-23 12:52:50,661 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:52:50" (1/1) ... [2018-11-23 12:52:50,670 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 12:52:50,670 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 12:52:50,670 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 12:52:50,671 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 12:52:50,671 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:52:50" (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:52:50,742 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 12:52:50,743 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 12:52:50,743 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-23 12:52:50,743 INFO L138 BoogieDeclarations]: Found implementation of procedure exit [2018-11-23 12:52:50,743 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 12:52:50,743 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 12:52:50,744 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 12:52:50,744 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 12:52:50,744 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 12:52:50,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-23 12:52:50,745 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-23 12:52:50,745 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 12:52:50,745 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 12:52:51,479 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 12:52:51,479 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-11-23 12:52:51,480 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:52:51 BoogieIcfgContainer [2018-11-23 12:52:51,480 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 12:52:51,481 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 12:52:51,482 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 12:52:51,485 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 12:52:51,485 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 12:52:49" (1/3) ... [2018-11-23 12:52:51,486 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5678f8ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:52:51, skipping insertion in model container [2018-11-23 12:52:51,486 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:52:50" (2/3) ... [2018-11-23 12:52:51,487 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5678f8ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:52:51, skipping insertion in model container [2018-11-23 12:52:51,487 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:52:51" (3/3) ... [2018-11-23 12:52:51,489 INFO L112 eAbstractionObserver]: Analyzing ICFG simple_false-unreach-call_false-valid-memcleanup.i [2018-11-23 12:52:51,500 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 12:52:51,510 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 12:52:51,529 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 12:52:51,559 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 12:52:51,560 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 12:52:51,560 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 12:52:51,560 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 12:52:51,563 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 12:52:51,563 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 12:52:51,563 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 12:52:51,563 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 12:52:51,564 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 12:52:51,583 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states. [2018-11-23 12:52:51,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-23 12:52:51,589 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:52:51,591 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:52:51,593 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:52:51,601 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:52:51,602 INFO L82 PathProgramCache]: Analyzing trace with hash 1541418343, now seen corresponding path program 1 times [2018-11-23 12:52:51,604 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:52:51,604 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:52:51,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:52:51,663 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:52:51,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:52:51,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:52:51,819 INFO L256 TraceCheckUtils]: 0: Hoare triple {30#true} call ULTIMATE.init(); {30#true} is VALID [2018-11-23 12:52:51,823 INFO L273 TraceCheckUtils]: 1: Hoare triple {30#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {30#true} is VALID [2018-11-23 12:52:51,824 INFO L273 TraceCheckUtils]: 2: Hoare triple {30#true} assume true; {30#true} is VALID [2018-11-23 12:52:51,825 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {30#true} {30#true} #66#return; {30#true} is VALID [2018-11-23 12:52:51,825 INFO L256 TraceCheckUtils]: 4: Hoare triple {30#true} call #t~ret6 := main(); {30#true} is VALID [2018-11-23 12:52:51,825 INFO L273 TraceCheckUtils]: 5: Hoare triple {30#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8);~a~0.base, ~a~0.offset := #t~malloc0.base, #t~malloc0.offset; {30#true} is VALID [2018-11-23 12:52:51,826 INFO L273 TraceCheckUtils]: 6: Hoare triple {30#true} assume !(~a~0.base == 0 && ~a~0.offset == 0); {30#true} is VALID [2018-11-23 12:52:51,826 INFO L273 TraceCheckUtils]: 7: Hoare triple {30#true} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset;call write~int(2, ~a~0.base, ~a~0.offset, 4); {30#true} is VALID [2018-11-23 12:52:51,827 INFO L273 TraceCheckUtils]: 8: Hoare triple {30#true} assume !true; {31#false} is VALID [2018-11-23 12:52:51,827 INFO L273 TraceCheckUtils]: 9: Hoare triple {31#false} call write~int(2, ~p~0.base, ~p~0.offset, 4);call write~$Pointer$(0, 0, ~p~0.base, 4 + ~p~0.offset, 4);~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {31#false} is VALID [2018-11-23 12:52:51,827 INFO L273 TraceCheckUtils]: 10: Hoare triple {31#false} assume !!(~p~0.base != 0 || ~p~0.offset != 0);call #t~mem4 := read~int(~p~0.base, ~p~0.offset, 4); {31#false} is VALID [2018-11-23 12:52:51,828 INFO L273 TraceCheckUtils]: 11: Hoare triple {31#false} assume 2 != #t~mem4;havoc #t~mem4; {31#false} is VALID [2018-11-23 12:52:51,828 INFO L273 TraceCheckUtils]: 12: Hoare triple {31#false} assume !false; {31#false} is VALID [2018-11-23 12:52:51,832 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:52:51,835 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:52:51,835 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 12:52:51,839 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 13 [2018-11-23 12:52:51,842 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:52:51,845 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 12:52:51,959 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:52:51,959 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 12:52:51,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 12:52:51,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 12:52:51,973 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 2 states. [2018-11-23 12:52:52,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:52:52,240 INFO L93 Difference]: Finished difference Result 38 states and 46 transitions. [2018-11-23 12:52:52,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 12:52:52,241 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 13 [2018-11-23 12:52:52,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:52:52,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 12:52:52,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 46 transitions. [2018-11-23 12:52:52,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 12:52:52,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 46 transitions. [2018-11-23 12:52:52,261 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 46 transitions. [2018-11-23 12:52:52,397 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:52:52,407 INFO L225 Difference]: With dead ends: 38 [2018-11-23 12:52:52,408 INFO L226 Difference]: Without dead ends: 18 [2018-11-23 12:52:52,411 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 12:52:52,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-11-23 12:52:52,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-11-23 12:52:52,515 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:52:52,516 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand 18 states. [2018-11-23 12:52:52,517 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand 18 states. [2018-11-23 12:52:52,517 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 18 states. [2018-11-23 12:52:52,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:52:52,520 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2018-11-23 12:52:52,520 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2018-11-23 12:52:52,521 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:52:52,521 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:52:52,521 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand 18 states. [2018-11-23 12:52:52,522 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 18 states. [2018-11-23 12:52:52,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:52:52,525 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2018-11-23 12:52:52,525 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2018-11-23 12:52:52,526 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:52:52,526 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:52:52,526 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:52:52,526 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:52:52,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 12:52:52,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2018-11-23 12:52:52,535 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 13 [2018-11-23 12:52:52,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:52:52,535 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2018-11-23 12:52:52,535 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 12:52:52,535 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2018-11-23 12:52:52,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-23 12:52:52,536 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:52:52,536 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:52:52,537 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:52:52,537 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:52:52,537 INFO L82 PathProgramCache]: Analyzing trace with hash 96690808, now seen corresponding path program 1 times [2018-11-23 12:52:52,537 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:52:52,537 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:52:52,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:52:52,540 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:52:52,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:52:52,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:52:52,763 INFO L256 TraceCheckUtils]: 0: Hoare triple {143#true} call ULTIMATE.init(); {143#true} is VALID [2018-11-23 12:52:52,764 INFO L273 TraceCheckUtils]: 1: Hoare triple {143#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {143#true} is VALID [2018-11-23 12:52:52,764 INFO L273 TraceCheckUtils]: 2: Hoare triple {143#true} assume true; {143#true} is VALID [2018-11-23 12:52:52,764 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {143#true} {143#true} #66#return; {143#true} is VALID [2018-11-23 12:52:52,765 INFO L256 TraceCheckUtils]: 4: Hoare triple {143#true} call #t~ret6 := main(); {143#true} is VALID [2018-11-23 12:52:52,765 INFO L273 TraceCheckUtils]: 5: Hoare triple {143#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8);~a~0.base, ~a~0.offset := #t~malloc0.base, #t~malloc0.offset; {143#true} is VALID [2018-11-23 12:52:52,766 INFO L273 TraceCheckUtils]: 6: Hoare triple {143#true} assume !(~a~0.base == 0 && ~a~0.offset == 0); {143#true} is VALID [2018-11-23 12:52:52,770 INFO L273 TraceCheckUtils]: 7: Hoare triple {143#true} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset;call write~int(2, ~a~0.base, ~a~0.offset, 4); {145#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-23 12:52:52,771 INFO L273 TraceCheckUtils]: 8: Hoare triple {145#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {145#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-23 12:52:52,778 INFO L273 TraceCheckUtils]: 9: Hoare triple {145#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} assume !(0 != #t~nondet1);havoc #t~nondet1; {145#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-23 12:52:52,797 INFO L273 TraceCheckUtils]: 10: Hoare triple {145#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} call write~int(2, ~p~0.base, ~p~0.offset, 4);call write~$Pointer$(0, 0, ~p~0.base, 4 + ~p~0.offset, 4);~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {146#(= 2 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2018-11-23 12:52:52,813 INFO L273 TraceCheckUtils]: 11: Hoare triple {146#(= 2 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} assume !!(~p~0.base != 0 || ~p~0.offset != 0);call #t~mem4 := read~int(~p~0.base, ~p~0.offset, 4); {147#(= |main_#t~mem4| 2)} is VALID [2018-11-23 12:52:52,829 INFO L273 TraceCheckUtils]: 12: Hoare triple {147#(= |main_#t~mem4| 2)} assume 2 != #t~mem4;havoc #t~mem4; {144#false} is VALID [2018-11-23 12:52:52,829 INFO L273 TraceCheckUtils]: 13: Hoare triple {144#false} assume !false; {144#false} is VALID [2018-11-23 12:52:52,832 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:52:52,833 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:52:52,833 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 12:52:52,836 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-11-23 12:52:52,837 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:52:52,837 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 12:52:52,930 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:52:52,931 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 12:52:52,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 12:52:52,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 12:52:52,932 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand 5 states. [2018-11-23 12:52:53,410 WARN L180 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-11-23 12:52:53,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:52:53,639 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2018-11-23 12:52:53,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 12:52:53,640 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-11-23 12:52:53,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:52:53,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:52:53,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 35 transitions. [2018-11-23 12:52:53,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:52:53,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 35 transitions. [2018-11-23 12:52:53,646 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 35 transitions. [2018-11-23 12:52:53,715 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:52:53,716 INFO L225 Difference]: With dead ends: 33 [2018-11-23 12:52:53,717 INFO L226 Difference]: Without dead ends: 31 [2018-11-23 12:52:53,718 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-23 12:52:53,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-11-23 12:52:53,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 23. [2018-11-23 12:52:53,741 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:52:53,741 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand 23 states. [2018-11-23 12:52:53,741 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 23 states. [2018-11-23 12:52:53,742 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 23 states. [2018-11-23 12:52:53,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:52:53,745 INFO L93 Difference]: Finished difference Result 31 states and 33 transitions. [2018-11-23 12:52:53,745 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2018-11-23 12:52:53,745 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:52:53,745 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:52:53,746 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 31 states. [2018-11-23 12:52:53,746 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 31 states. [2018-11-23 12:52:53,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:52:53,749 INFO L93 Difference]: Finished difference Result 31 states and 33 transitions. [2018-11-23 12:52:53,749 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2018-11-23 12:52:53,750 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:52:53,750 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:52:53,750 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:52:53,751 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:52:53,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 12:52:53,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2018-11-23 12:52:53,753 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 14 [2018-11-23 12:52:53,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:52:53,753 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2018-11-23 12:52:53,754 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 12:52:53,754 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2018-11-23 12:52:53,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-23 12:52:53,755 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:52:53,755 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:52:53,755 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:52:53,755 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:52:53,756 INFO L82 PathProgramCache]: Analyzing trace with hash -1402379173, now seen corresponding path program 1 times [2018-11-23 12:52:53,756 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:52:53,756 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:52:53,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:52:53,757 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:52:53,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:52:53,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:52:54,076 INFO L256 TraceCheckUtils]: 0: Hoare triple {289#true} call ULTIMATE.init(); {289#true} is VALID [2018-11-23 12:52:54,076 INFO L273 TraceCheckUtils]: 1: Hoare triple {289#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {289#true} is VALID [2018-11-23 12:52:54,077 INFO L273 TraceCheckUtils]: 2: Hoare triple {289#true} assume true; {289#true} is VALID [2018-11-23 12:52:54,077 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {289#true} {289#true} #66#return; {289#true} is VALID [2018-11-23 12:52:54,078 INFO L256 TraceCheckUtils]: 4: Hoare triple {289#true} call #t~ret6 := main(); {289#true} is VALID [2018-11-23 12:52:54,079 INFO L273 TraceCheckUtils]: 5: Hoare triple {289#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8);~a~0.base, ~a~0.offset := #t~malloc0.base, #t~malloc0.offset; {291#(= 0 main_~a~0.offset)} is VALID [2018-11-23 12:52:54,079 INFO L273 TraceCheckUtils]: 6: Hoare triple {291#(= 0 main_~a~0.offset)} assume !(~a~0.base == 0 && ~a~0.offset == 0); {291#(= 0 main_~a~0.offset)} is VALID [2018-11-23 12:52:54,080 INFO L273 TraceCheckUtils]: 7: Hoare triple {291#(= 0 main_~a~0.offset)} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset;call write~int(2, ~a~0.base, ~a~0.offset, 4); {292#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-23 12:52:54,081 INFO L273 TraceCheckUtils]: 8: Hoare triple {292#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base))} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {292#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-23 12:52:54,081 INFO L273 TraceCheckUtils]: 9: Hoare triple {292#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base))} assume !(0 != #t~nondet1);havoc #t~nondet1; {292#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-23 12:52:54,083 INFO L273 TraceCheckUtils]: 10: Hoare triple {292#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base))} call write~int(2, ~p~0.base, ~p~0.offset, 4);call write~$Pointer$(0, 0, ~p~0.base, 4 + ~p~0.offset, 4);~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {293#(and (= 0 (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))))} is VALID [2018-11-23 12:52:54,085 INFO L273 TraceCheckUtils]: 11: Hoare triple {293#(and (= 0 (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))))} assume !!(~p~0.base != 0 || ~p~0.offset != 0);call #t~mem4 := read~int(~p~0.base, ~p~0.offset, 4); {293#(and (= 0 (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))))} is VALID [2018-11-23 12:52:54,086 INFO L273 TraceCheckUtils]: 12: Hoare triple {293#(and (= 0 (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))))} assume !(2 != #t~mem4);havoc #t~mem4; {293#(and (= 0 (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))))} is VALID [2018-11-23 12:52:54,087 INFO L273 TraceCheckUtils]: 13: Hoare triple {293#(and (= 0 (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))))} call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4);~p~0.base, ~p~0.offset := #t~mem5.base, #t~mem5.offset;havoc #t~mem5.base, #t~mem5.offset; {294#(and (= 0 main_~p~0.base) (= main_~p~0.offset 0))} is VALID [2018-11-23 12:52:54,087 INFO L273 TraceCheckUtils]: 14: Hoare triple {294#(and (= 0 main_~p~0.base) (= main_~p~0.offset 0))} assume !!(~p~0.base != 0 || ~p~0.offset != 0);call #t~mem4 := read~int(~p~0.base, ~p~0.offset, 4); {290#false} is VALID [2018-11-23 12:52:54,088 INFO L273 TraceCheckUtils]: 15: Hoare triple {290#false} assume 2 != #t~mem4;havoc #t~mem4; {290#false} is VALID [2018-11-23 12:52:54,088 INFO L273 TraceCheckUtils]: 16: Hoare triple {290#false} assume !false; {290#false} is VALID [2018-11-23 12:52:54,091 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:52:54,091 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:52:54,092 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:52:54,108 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:52:54,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:52:54,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:52:54,157 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:52:54,324 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-23 12:52:54,340 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-23 12:52:54,344 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:52:54,348 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:52:54,364 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-23 12:52:54,375 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-23 12:52:54,379 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 12:52:54,384 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:52:54,394 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:52:54,394 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:26, output treesize:18 [2018-11-23 12:52:54,586 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-23 12:52:54,594 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-23 12:52:54,597 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:52:54,600 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:52:54,623 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-23 12:52:54,630 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-23 12:52:54,632 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 12:52:54,634 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:52:54,639 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:52:54,639 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:29, output treesize:7 [2018-11-23 12:52:54,643 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:52:54,643 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_$Pointer$.base|, v_main_~p~0.base_12, |#memory_$Pointer$.offset|]. (let ((.cse1 (select (select |#memory_$Pointer$.base| v_main_~p~0.base_12) 4)) (.cse0 (select (select |#memory_$Pointer$.offset| v_main_~p~0.base_12) 4))) (and (= .cse0 0) (= 0 .cse1) (= main_~p~0.base .cse1) (= .cse0 main_~p~0.offset))) [2018-11-23 12:52:54,643 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= 0 main_~p~0.base) (= main_~p~0.offset 0)) [2018-11-23 12:52:54,653 INFO L256 TraceCheckUtils]: 0: Hoare triple {289#true} call ULTIMATE.init(); {289#true} is VALID [2018-11-23 12:52:54,654 INFO L273 TraceCheckUtils]: 1: Hoare triple {289#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {289#true} is VALID [2018-11-23 12:52:54,654 INFO L273 TraceCheckUtils]: 2: Hoare triple {289#true} assume true; {289#true} is VALID [2018-11-23 12:52:54,654 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {289#true} {289#true} #66#return; {289#true} is VALID [2018-11-23 12:52:54,655 INFO L256 TraceCheckUtils]: 4: Hoare triple {289#true} call #t~ret6 := main(); {289#true} is VALID [2018-11-23 12:52:54,655 INFO L273 TraceCheckUtils]: 5: Hoare triple {289#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8);~a~0.base, ~a~0.offset := #t~malloc0.base, #t~malloc0.offset; {291#(= 0 main_~a~0.offset)} is VALID [2018-11-23 12:52:54,659 INFO L273 TraceCheckUtils]: 6: Hoare triple {291#(= 0 main_~a~0.offset)} assume !(~a~0.base == 0 && ~a~0.offset == 0); {291#(= 0 main_~a~0.offset)} is VALID [2018-11-23 12:52:54,663 INFO L273 TraceCheckUtils]: 7: Hoare triple {291#(= 0 main_~a~0.offset)} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset;call write~int(2, ~a~0.base, ~a~0.offset, 4); {292#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-23 12:52:54,666 INFO L273 TraceCheckUtils]: 8: Hoare triple {292#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base))} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {292#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-23 12:52:54,668 INFO L273 TraceCheckUtils]: 9: Hoare triple {292#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base))} assume !(0 != #t~nondet1);havoc #t~nondet1; {292#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-23 12:52:54,671 INFO L273 TraceCheckUtils]: 10: Hoare triple {292#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base))} call write~int(2, ~p~0.base, ~p~0.offset, 4);call write~$Pointer$(0, 0, ~p~0.base, 4 + ~p~0.offset, 4);~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {293#(and (= 0 (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))))} is VALID [2018-11-23 12:52:54,672 INFO L273 TraceCheckUtils]: 11: Hoare triple {293#(and (= 0 (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))))} assume !!(~p~0.base != 0 || ~p~0.offset != 0);call #t~mem4 := read~int(~p~0.base, ~p~0.offset, 4); {293#(and (= 0 (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))))} is VALID [2018-11-23 12:52:54,674 INFO L273 TraceCheckUtils]: 12: Hoare triple {293#(and (= 0 (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))))} assume !(2 != #t~mem4);havoc #t~mem4; {293#(and (= 0 (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))))} is VALID [2018-11-23 12:52:54,675 INFO L273 TraceCheckUtils]: 13: Hoare triple {293#(and (= 0 (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))))} call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4);~p~0.base, ~p~0.offset := #t~mem5.base, #t~mem5.offset;havoc #t~mem5.base, #t~mem5.offset; {294#(and (= 0 main_~p~0.base) (= main_~p~0.offset 0))} is VALID [2018-11-23 12:52:54,677 INFO L273 TraceCheckUtils]: 14: Hoare triple {294#(and (= 0 main_~p~0.base) (= main_~p~0.offset 0))} assume !!(~p~0.base != 0 || ~p~0.offset != 0);call #t~mem4 := read~int(~p~0.base, ~p~0.offset, 4); {290#false} is VALID [2018-11-23 12:52:54,677 INFO L273 TraceCheckUtils]: 15: Hoare triple {290#false} assume 2 != #t~mem4;havoc #t~mem4; {290#false} is VALID [2018-11-23 12:52:54,678 INFO L273 TraceCheckUtils]: 16: Hoare triple {290#false} assume !false; {290#false} is VALID [2018-11-23 12:52:54,680 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:52:54,707 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:52:54,707 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-11-23 12:52:54,708 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2018-11-23 12:52:54,708 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:52:54,708 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 12:52:54,740 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:52:54,741 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 12:52:54,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 12:52:54,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-23 12:52:54,742 INFO L87 Difference]: Start difference. First operand 23 states and 25 transitions. Second operand 6 states. [2018-11-23 12:52:55,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:52:55,123 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2018-11-23 12:52:55,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 12:52:55,123 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2018-11-23 12:52:55,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:52:55,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 12:52:55,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 39 transitions. [2018-11-23 12:52:55,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 12:52:55,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 39 transitions. [2018-11-23 12:52:55,129 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 39 transitions. [2018-11-23 12:52:55,188 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:52:55,190 INFO L225 Difference]: With dead ends: 37 [2018-11-23 12:52:55,190 INFO L226 Difference]: Without dead ends: 27 [2018-11-23 12:52:55,191 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 15 SyntacticMatches, 4 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-23 12:52:55,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-11-23 12:52:55,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 20. [2018-11-23 12:52:55,214 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:52:55,214 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand 20 states. [2018-11-23 12:52:55,214 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 20 states. [2018-11-23 12:52:55,215 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 20 states. [2018-11-23 12:52:55,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:52:55,218 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2018-11-23 12:52:55,218 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2018-11-23 12:52:55,218 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:52:55,219 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:52:55,219 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 27 states. [2018-11-23 12:52:55,219 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 27 states. [2018-11-23 12:52:55,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:52:55,221 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2018-11-23 12:52:55,222 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2018-11-23 12:52:55,222 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:52:55,222 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:52:55,222 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:52:55,223 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:52:55,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 12:52:55,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2018-11-23 12:52:55,224 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 17 [2018-11-23 12:52:55,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:52:55,225 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2018-11-23 12:52:55,225 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 12:52:55,225 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2018-11-23 12:52:55,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-23 12:52:55,226 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:52:55,226 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:52:55,226 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:52:55,226 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:52:55,227 INFO L82 PathProgramCache]: Analyzing trace with hash -1367734753, now seen corresponding path program 1 times [2018-11-23 12:52:55,227 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:52:55,227 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:52:55,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:52:55,228 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:52:55,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:52:55,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 12:52:55,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 12:52:55,305 INFO L469 BasicCegarLoop]: Counterexample might be feasible ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); VAL [|#NULL.base|=19, |#NULL.offset|=9, |old(#NULL.base)|=19, |old(#NULL.offset)|=9] [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=19, |old(#NULL.offset)|=9] [?] assume true; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=19, |old(#NULL.offset)|=9] [?] RET #66#return; VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] CALL call #t~ret6 := main(); VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8);~a~0.base, ~a~0.offset := #t~malloc0.base, #t~malloc0.offset; VAL [main_~a~0.base=15, main_~a~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=15, |main_#t~malloc0.offset|=0] [?] assume !(~a~0.base == 0 && ~a~0.offset == 0); VAL [main_~a~0.base=15, main_~a~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=15, |main_#t~malloc0.offset|=0] [?] havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset;call write~int(2, ~a~0.base, ~a~0.offset, 4); VAL [main_~a~0.base=15, main_~a~0.offset=0, main_~p~0.base=15, main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=15, |main_#t~malloc0.offset|=0] [?] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [main_~a~0.base=15, main_~a~0.offset=0, main_~p~0.base=15, main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=15, |main_#t~malloc0.offset|=0, |main_#t~nondet1|=1] [?] assume !!(0 != #t~nondet1);havoc #t~nondet1;call write~int(1, ~p~0.base, ~p~0.offset, 4);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8);~t~0.base, ~t~0.offset := #t~malloc2.base, #t~malloc2.offset; VAL [main_~a~0.base=15, main_~a~0.offset=0, main_~p~0.base=15, main_~p~0.offset=0, main_~t~0.base=20, main_~t~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=15, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=20, |main_#t~malloc2.offset|=0] [?] assume !(~t~0.base == 0 && ~t~0.offset == 0); VAL [main_~a~0.base=15, main_~a~0.offset=0, main_~p~0.base=15, main_~p~0.offset=0, main_~t~0.base=20, main_~t~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=15, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=20, |main_#t~malloc2.offset|=0] [?] call write~$Pointer$(~t~0.base, ~t~0.offset, ~p~0.base, 4 + ~p~0.offset, 4);call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4);~p~0.base, ~p~0.offset := #t~mem3.base, #t~mem3.offset;havoc #t~mem3.base, #t~mem3.offset; VAL [main_~a~0.base=15, main_~a~0.offset=0, main_~p~0.base=20, main_~p~0.offset=0, main_~t~0.base=20, main_~t~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=15, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=20, |main_#t~malloc2.offset|=0] [?] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [main_~a~0.base=15, main_~a~0.offset=0, main_~p~0.base=20, main_~p~0.offset=0, main_~t~0.base=20, main_~t~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=15, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=20, |main_#t~malloc2.offset|=0, |main_#t~nondet1|=0] [?] assume !(0 != #t~nondet1);havoc #t~nondet1; VAL [main_~a~0.base=15, main_~a~0.offset=0, main_~p~0.base=20, main_~p~0.offset=0, main_~t~0.base=20, main_~t~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=15, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=20, |main_#t~malloc2.offset|=0] [?] call write~int(2, ~p~0.base, ~p~0.offset, 4);call write~$Pointer$(0, 0, ~p~0.base, 4 + ~p~0.offset, 4);~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; VAL [main_~a~0.base=15, main_~a~0.offset=0, main_~p~0.base=15, main_~p~0.offset=0, main_~t~0.base=20, main_~t~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=15, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=20, |main_#t~malloc2.offset|=0] [?] assume !!(~p~0.base != 0 || ~p~0.offset != 0);call #t~mem4 := read~int(~p~0.base, ~p~0.offset, 4); VAL [main_~a~0.base=15, main_~a~0.offset=0, main_~p~0.base=15, main_~p~0.offset=0, main_~t~0.base=20, main_~t~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=15, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=20, |main_#t~malloc2.offset|=0, |main_#t~mem4|=1] [?] assume 2 != #t~mem4;havoc #t~mem4; VAL [main_~a~0.base=15, main_~a~0.offset=0, main_~p~0.base=15, main_~p~0.offset=0, main_~t~0.base=20, main_~t~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=15, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=20, |main_#t~malloc2.offset|=0] [?] assume !false; VAL [main_~a~0.base=15, main_~a~0.offset=0, main_~p~0.base=15, main_~p~0.offset=0, main_~t~0.base=20, main_~t~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=15, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=20, |main_#t~malloc2.offset|=0] [?] CALL call ULTIMATE.init(); VAL [#NULL.base=19, #NULL.offset=9, old(#NULL.base)=19, old(#NULL.offset)=9] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=19, old(#NULL.offset)=9] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=19, old(#NULL.offset)=9] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret6 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L627] call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8); [L627] ~a~0.base, ~a~0.offset := #t~malloc0.base, #t~malloc0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=15, #t~malloc0.offset=0, ~a~0.base=15, ~a~0.offset=0] [L628] assume !(~a~0.base == 0 && ~a~0.offset == 0); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=15, #t~malloc0.offset=0, ~a~0.base=15, ~a~0.offset=0] [L629] havoc ~t~0.base, ~t~0.offset; [L630] ~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; [L631] call write~int(2, ~a~0.base, ~a~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=15, #t~malloc0.offset=0, ~a~0.base=15, ~a~0.offset=0, ~p~0.base=15, ~p~0.offset=0] [L632] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=15, #t~malloc0.offset=0, #t~nondet1=1, ~a~0.base=15, ~a~0.offset=0, ~p~0.base=15, ~p~0.offset=0] [L632-L638] assume !!(0 != #t~nondet1); [L632] havoc #t~nondet1; [L633] call write~int(1, ~p~0.base, ~p~0.offset, 4); [L634] call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8); [L634] ~t~0.base, ~t~0.offset := #t~malloc2.base, #t~malloc2.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=15, #t~malloc0.offset=0, #t~malloc2.base=20, #t~malloc2.offset=0, ~a~0.base=15, ~a~0.offset=0, ~p~0.base=15, ~p~0.offset=0, ~t~0.base=20, ~t~0.offset=0] [L635] assume !(~t~0.base == 0 && ~t~0.offset == 0); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=15, #t~malloc0.offset=0, #t~malloc2.base=20, #t~malloc2.offset=0, ~a~0.base=15, ~a~0.offset=0, ~p~0.base=15, ~p~0.offset=0, ~t~0.base=20, ~t~0.offset=0] [L636] call write~$Pointer$(~t~0.base, ~t~0.offset, ~p~0.base, 4 + ~p~0.offset, 4); [L637] call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4); [L637] ~p~0.base, ~p~0.offset := #t~mem3.base, #t~mem3.offset; [L637] havoc #t~mem3.base, #t~mem3.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=15, #t~malloc0.offset=0, #t~malloc2.base=20, #t~malloc2.offset=0, ~a~0.base=15, ~a~0.offset=0, ~p~0.base=20, ~p~0.offset=0, ~t~0.base=20, ~t~0.offset=0] [L632] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=15, #t~malloc0.offset=0, #t~malloc2.base=20, #t~malloc2.offset=0, #t~nondet1=0, ~a~0.base=15, ~a~0.offset=0, ~p~0.base=20, ~p~0.offset=0, ~t~0.base=20, ~t~0.offset=0] [L632-L638] assume !(0 != #t~nondet1); [L632] havoc #t~nondet1; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=15, #t~malloc0.offset=0, #t~malloc2.base=20, #t~malloc2.offset=0, ~a~0.base=15, ~a~0.offset=0, ~p~0.base=20, ~p~0.offset=0, ~t~0.base=20, ~t~0.offset=0] [L639] call write~int(2, ~p~0.base, ~p~0.offset, 4); [L640] call write~$Pointer$(0, 0, ~p~0.base, 4 + ~p~0.offset, 4); [L641] ~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=15, #t~malloc0.offset=0, #t~malloc2.base=20, #t~malloc2.offset=0, ~a~0.base=15, ~a~0.offset=0, ~p~0.base=15, ~p~0.offset=0, ~t~0.base=20, ~t~0.offset=0] [L642-L647] assume !!(~p~0.base != 0 || ~p~0.offset != 0); [L643] call #t~mem4 := read~int(~p~0.base, ~p~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=15, #t~malloc0.offset=0, #t~malloc2.base=20, #t~malloc2.offset=0, #t~mem4=1, ~a~0.base=15, ~a~0.offset=0, ~p~0.base=15, ~p~0.offset=0, ~t~0.base=20, ~t~0.offset=0] [L643-L645] assume 2 != #t~mem4; [L643] havoc #t~mem4; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=15, #t~malloc0.offset=0, #t~malloc2.base=20, #t~malloc2.offset=0, ~a~0.base=15, ~a~0.offset=0, ~p~0.base=15, ~p~0.offset=0, ~t~0.base=20, ~t~0.offset=0] [L644] assert false; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=15, #t~malloc0.offset=0, #t~malloc2.base=20, #t~malloc2.offset=0, ~a~0.base=15, ~a~0.offset=0, ~p~0.base=15, ~p~0.offset=0, ~t~0.base=20, ~t~0.offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL.base=19, #NULL.offset=9, old(#NULL.base)=19, old(#NULL.offset)=9] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=19, old(#NULL.offset)=9] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=19, old(#NULL.offset)=9] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret6 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L627] call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8); [L627] ~a~0.base, ~a~0.offset := #t~malloc0.base, #t~malloc0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=15, #t~malloc0.offset=0, ~a~0.base=15, ~a~0.offset=0] [L628] assume !(~a~0.base == 0 && ~a~0.offset == 0); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=15, #t~malloc0.offset=0, ~a~0.base=15, ~a~0.offset=0] [L629] havoc ~t~0.base, ~t~0.offset; [L630] ~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; [L631] call write~int(2, ~a~0.base, ~a~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=15, #t~malloc0.offset=0, ~a~0.base=15, ~a~0.offset=0, ~p~0.base=15, ~p~0.offset=0] [L632] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=15, #t~malloc0.offset=0, #t~nondet1=1, ~a~0.base=15, ~a~0.offset=0, ~p~0.base=15, ~p~0.offset=0] [L632-L638] assume !!(0 != #t~nondet1); [L632] havoc #t~nondet1; [L633] call write~int(1, ~p~0.base, ~p~0.offset, 4); [L634] call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8); [L634] ~t~0.base, ~t~0.offset := #t~malloc2.base, #t~malloc2.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=15, #t~malloc0.offset=0, #t~malloc2.base=20, #t~malloc2.offset=0, ~a~0.base=15, ~a~0.offset=0, ~p~0.base=15, ~p~0.offset=0, ~t~0.base=20, ~t~0.offset=0] [L635] assume !(~t~0.base == 0 && ~t~0.offset == 0); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=15, #t~malloc0.offset=0, #t~malloc2.base=20, #t~malloc2.offset=0, ~a~0.base=15, ~a~0.offset=0, ~p~0.base=15, ~p~0.offset=0, ~t~0.base=20, ~t~0.offset=0] [L636] call write~$Pointer$(~t~0.base, ~t~0.offset, ~p~0.base, 4 + ~p~0.offset, 4); [L637] call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4); [L637] ~p~0.base, ~p~0.offset := #t~mem3.base, #t~mem3.offset; [L637] havoc #t~mem3.base, #t~mem3.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=15, #t~malloc0.offset=0, #t~malloc2.base=20, #t~malloc2.offset=0, ~a~0.base=15, ~a~0.offset=0, ~p~0.base=20, ~p~0.offset=0, ~t~0.base=20, ~t~0.offset=0] [L632] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=15, #t~malloc0.offset=0, #t~malloc2.base=20, #t~malloc2.offset=0, #t~nondet1=0, ~a~0.base=15, ~a~0.offset=0, ~p~0.base=20, ~p~0.offset=0, ~t~0.base=20, ~t~0.offset=0] [L632-L638] assume !(0 != #t~nondet1); [L632] havoc #t~nondet1; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=15, #t~malloc0.offset=0, #t~malloc2.base=20, #t~malloc2.offset=0, ~a~0.base=15, ~a~0.offset=0, ~p~0.base=20, ~p~0.offset=0, ~t~0.base=20, ~t~0.offset=0] [L639] call write~int(2, ~p~0.base, ~p~0.offset, 4); [L640] call write~$Pointer$(0, 0, ~p~0.base, 4 + ~p~0.offset, 4); [L641] ~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=15, #t~malloc0.offset=0, #t~malloc2.base=20, #t~malloc2.offset=0, ~a~0.base=15, ~a~0.offset=0, ~p~0.base=15, ~p~0.offset=0, ~t~0.base=20, ~t~0.offset=0] [L642-L647] assume !!(~p~0.base != 0 || ~p~0.offset != 0); [L643] call #t~mem4 := read~int(~p~0.base, ~p~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=15, #t~malloc0.offset=0, #t~malloc2.base=20, #t~malloc2.offset=0, #t~mem4=1, ~a~0.base=15, ~a~0.offset=0, ~p~0.base=15, ~p~0.offset=0, ~t~0.base=20, ~t~0.offset=0] [L643-L645] assume 2 != #t~mem4; [L643] havoc #t~mem4; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=15, #t~malloc0.offset=0, #t~malloc2.base=20, #t~malloc2.offset=0, ~a~0.base=15, ~a~0.offset=0, ~p~0.base=15, ~p~0.offset=0, ~t~0.base=20, ~t~0.offset=0] [L644] assert false; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=15, #t~malloc0.offset=0, #t~malloc2.base=20, #t~malloc2.offset=0, ~a~0.base=15, ~a~0.offset=0, ~p~0.base=15, ~p~0.offset=0, ~t~0.base=20, ~t~0.offset=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=19, #NULL!offset=9, old(#NULL!base)=19, old(#NULL!offset)=9] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=19, old(#NULL!offset)=9] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret6 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L627] FCALL call #t~malloc0 := #Ultimate.alloc(8); [L627] ~a~0 := #t~malloc0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, ~a~0!base=15, ~a~0!offset=0] [L628] COND FALSE !(~a~0 == { base: 0, offset: 0 }) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, ~a~0!base=15, ~a~0!offset=0] [L629] havoc ~t~0; [L630] ~p~0 := ~a~0; [L631] FCALL call write~int(2, { base: ~a~0!base, offset: ~a~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, ~a~0!base=15, ~a~0!offset=0, ~p~0!base=15, ~p~0!offset=0] [L632] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~nondet1=1, ~a~0!base=15, ~a~0!offset=0, ~p~0!base=15, ~p~0!offset=0] [L632-L638] COND FALSE !(!(0 != #t~nondet1)) [L632] havoc #t~nondet1; [L633] FCALL call write~int(1, { base: ~p~0!base, offset: ~p~0!offset }, 4); [L634] FCALL call #t~malloc2 := #Ultimate.alloc(8); [L634] ~t~0 := #t~malloc2; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc2!base=20, #t~malloc2!offset=0, ~a~0!base=15, ~a~0!offset=0, ~p~0!base=15, ~p~0!offset=0, ~t~0!base=20, ~t~0!offset=0] [L635] COND FALSE !(~t~0 == { base: 0, offset: 0 }) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc2!base=20, #t~malloc2!offset=0, ~a~0!base=15, ~a~0!offset=0, ~p~0!base=15, ~p~0!offset=0, ~t~0!base=20, ~t~0!offset=0] [L636] FCALL call write~$Pointer$(~t~0, { base: ~p~0!base, offset: 4 + ~p~0!offset }, 4); [L637] FCALL call #t~mem3 := read~$Pointer$({ base: ~p~0!base, offset: 4 + ~p~0!offset }, 4); [L637] ~p~0 := #t~mem3; [L637] havoc #t~mem3; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc2!base=20, #t~malloc2!offset=0, ~a~0!base=15, ~a~0!offset=0, ~p~0!base=20, ~p~0!offset=0, ~t~0!base=20, ~t~0!offset=0] [L632] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc2!base=20, #t~malloc2!offset=0, #t~nondet1=0, ~a~0!base=15, ~a~0!offset=0, ~p~0!base=20, ~p~0!offset=0, ~t~0!base=20, ~t~0!offset=0] [L632-L638] COND TRUE !(0 != #t~nondet1) [L632] havoc #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc2!base=20, #t~malloc2!offset=0, ~a~0!base=15, ~a~0!offset=0, ~p~0!base=20, ~p~0!offset=0, ~t~0!base=20, ~t~0!offset=0] [L639] FCALL call write~int(2, { base: ~p~0!base, offset: ~p~0!offset }, 4); [L640] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~p~0!base, offset: 4 + ~p~0!offset }, 4); [L641] ~p~0 := ~a~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc2!base=20, #t~malloc2!offset=0, ~a~0!base=15, ~a~0!offset=0, ~p~0!base=15, ~p~0!offset=0, ~t~0!base=20, ~t~0!offset=0] [L642-L647] COND FALSE !(!(~p~0 != { base: 0, offset: 0 })) [L643] FCALL call #t~mem4 := read~int({ base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc2!base=20, #t~malloc2!offset=0, #t~mem4=1, ~a~0!base=15, ~a~0!offset=0, ~p~0!base=15, ~p~0!offset=0, ~t~0!base=20, ~t~0!offset=0] [L643] COND TRUE 2 != #t~mem4 [L643] havoc #t~mem4; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc2!base=20, #t~malloc2!offset=0, ~a~0!base=15, ~a~0!offset=0, ~p~0!base=15, ~p~0!offset=0, ~t~0!base=20, ~t~0!offset=0] [L644] assert false; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc2!base=20, #t~malloc2!offset=0, ~a~0!base=15, ~a~0!offset=0, ~p~0!base=15, ~p~0!offset=0, ~t~0!base=20, ~t~0!offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=19, #NULL!offset=9, old(#NULL!base)=19, old(#NULL!offset)=9] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=19, old(#NULL!offset)=9] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret6 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L627] FCALL call #t~malloc0 := #Ultimate.alloc(8); [L627] ~a~0 := #t~malloc0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, ~a~0!base=15, ~a~0!offset=0] [L628] COND FALSE !(~a~0 == { base: 0, offset: 0 }) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, ~a~0!base=15, ~a~0!offset=0] [L629] havoc ~t~0; [L630] ~p~0 := ~a~0; [L631] FCALL call write~int(2, { base: ~a~0!base, offset: ~a~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, ~a~0!base=15, ~a~0!offset=0, ~p~0!base=15, ~p~0!offset=0] [L632] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~nondet1=1, ~a~0!base=15, ~a~0!offset=0, ~p~0!base=15, ~p~0!offset=0] [L632-L638] COND FALSE !(!(0 != #t~nondet1)) [L632] havoc #t~nondet1; [L633] FCALL call write~int(1, { base: ~p~0!base, offset: ~p~0!offset }, 4); [L634] FCALL call #t~malloc2 := #Ultimate.alloc(8); [L634] ~t~0 := #t~malloc2; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc2!base=20, #t~malloc2!offset=0, ~a~0!base=15, ~a~0!offset=0, ~p~0!base=15, ~p~0!offset=0, ~t~0!base=20, ~t~0!offset=0] [L635] COND FALSE !(~t~0 == { base: 0, offset: 0 }) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc2!base=20, #t~malloc2!offset=0, ~a~0!base=15, ~a~0!offset=0, ~p~0!base=15, ~p~0!offset=0, ~t~0!base=20, ~t~0!offset=0] [L636] FCALL call write~$Pointer$(~t~0, { base: ~p~0!base, offset: 4 + ~p~0!offset }, 4); [L637] FCALL call #t~mem3 := read~$Pointer$({ base: ~p~0!base, offset: 4 + ~p~0!offset }, 4); [L637] ~p~0 := #t~mem3; [L637] havoc #t~mem3; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc2!base=20, #t~malloc2!offset=0, ~a~0!base=15, ~a~0!offset=0, ~p~0!base=20, ~p~0!offset=0, ~t~0!base=20, ~t~0!offset=0] [L632] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc2!base=20, #t~malloc2!offset=0, #t~nondet1=0, ~a~0!base=15, ~a~0!offset=0, ~p~0!base=20, ~p~0!offset=0, ~t~0!base=20, ~t~0!offset=0] [L632-L638] COND TRUE !(0 != #t~nondet1) [L632] havoc #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc2!base=20, #t~malloc2!offset=0, ~a~0!base=15, ~a~0!offset=0, ~p~0!base=20, ~p~0!offset=0, ~t~0!base=20, ~t~0!offset=0] [L639] FCALL call write~int(2, { base: ~p~0!base, offset: ~p~0!offset }, 4); [L640] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~p~0!base, offset: 4 + ~p~0!offset }, 4); [L641] ~p~0 := ~a~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc2!base=20, #t~malloc2!offset=0, ~a~0!base=15, ~a~0!offset=0, ~p~0!base=15, ~p~0!offset=0, ~t~0!base=20, ~t~0!offset=0] [L642-L647] COND FALSE !(!(~p~0 != { base: 0, offset: 0 })) [L643] FCALL call #t~mem4 := read~int({ base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc2!base=20, #t~malloc2!offset=0, #t~mem4=1, ~a~0!base=15, ~a~0!offset=0, ~p~0!base=15, ~p~0!offset=0, ~t~0!base=20, ~t~0!offset=0] [L643] COND TRUE 2 != #t~mem4 [L643] havoc #t~mem4; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc2!base=20, #t~malloc2!offset=0, ~a~0!base=15, ~a~0!offset=0, ~p~0!base=15, ~p~0!offset=0, ~t~0!base=20, ~t~0!offset=0] [L644] assert false; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc2!base=20, #t~malloc2!offset=0, ~a~0!base=15, ~a~0!offset=0, ~p~0!base=15, ~p~0!offset=0, ~t~0!base=20, ~t~0!offset=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=19, #NULL!offset=9, old(#NULL!base)=19, old(#NULL!offset)=9] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=19, old(#NULL!offset)=9] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret6 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L627] FCALL call #t~malloc0 := #Ultimate.alloc(8); [L627] ~a~0 := #t~malloc0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, ~a~0!base=15, ~a~0!offset=0] [L628] COND FALSE !(~a~0 == { base: 0, offset: 0 }) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, ~a~0!base=15, ~a~0!offset=0] [L629] havoc ~t~0; [L630] ~p~0 := ~a~0; [L631] FCALL call write~int(2, { base: ~a~0!base, offset: ~a~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, ~a~0!base=15, ~a~0!offset=0, ~p~0!base=15, ~p~0!offset=0] [L632] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~nondet1=1, ~a~0!base=15, ~a~0!offset=0, ~p~0!base=15, ~p~0!offset=0] [L632-L638] COND FALSE !(!(0 != #t~nondet1)) [L632] havoc #t~nondet1; [L633] FCALL call write~int(1, { base: ~p~0!base, offset: ~p~0!offset }, 4); [L634] FCALL call #t~malloc2 := #Ultimate.alloc(8); [L634] ~t~0 := #t~malloc2; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc2!base=20, #t~malloc2!offset=0, ~a~0!base=15, ~a~0!offset=0, ~p~0!base=15, ~p~0!offset=0, ~t~0!base=20, ~t~0!offset=0] [L635] COND FALSE !(~t~0 == { base: 0, offset: 0 }) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc2!base=20, #t~malloc2!offset=0, ~a~0!base=15, ~a~0!offset=0, ~p~0!base=15, ~p~0!offset=0, ~t~0!base=20, ~t~0!offset=0] [L636] FCALL call write~$Pointer$(~t~0, { base: ~p~0!base, offset: 4 + ~p~0!offset }, 4); [L637] FCALL call #t~mem3 := read~$Pointer$({ base: ~p~0!base, offset: 4 + ~p~0!offset }, 4); [L637] ~p~0 := #t~mem3; [L637] havoc #t~mem3; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc2!base=20, #t~malloc2!offset=0, ~a~0!base=15, ~a~0!offset=0, ~p~0!base=20, ~p~0!offset=0, ~t~0!base=20, ~t~0!offset=0] [L632] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc2!base=20, #t~malloc2!offset=0, #t~nondet1=0, ~a~0!base=15, ~a~0!offset=0, ~p~0!base=20, ~p~0!offset=0, ~t~0!base=20, ~t~0!offset=0] [L632-L638] COND TRUE !(0 != #t~nondet1) [L632] havoc #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc2!base=20, #t~malloc2!offset=0, ~a~0!base=15, ~a~0!offset=0, ~p~0!base=20, ~p~0!offset=0, ~t~0!base=20, ~t~0!offset=0] [L639] FCALL call write~int(2, { base: ~p~0!base, offset: ~p~0!offset }, 4); [L640] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~p~0!base, offset: 4 + ~p~0!offset }, 4); [L641] ~p~0 := ~a~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc2!base=20, #t~malloc2!offset=0, ~a~0!base=15, ~a~0!offset=0, ~p~0!base=15, ~p~0!offset=0, ~t~0!base=20, ~t~0!offset=0] [L642-L647] COND FALSE !(!(~p~0 != { base: 0, offset: 0 })) [L643] FCALL call #t~mem4 := read~int({ base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc2!base=20, #t~malloc2!offset=0, #t~mem4=1, ~a~0!base=15, ~a~0!offset=0, ~p~0!base=15, ~p~0!offset=0, ~t~0!base=20, ~t~0!offset=0] [L643] COND TRUE 2 != #t~mem4 [L643] havoc #t~mem4; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc2!base=20, #t~malloc2!offset=0, ~a~0!base=15, ~a~0!offset=0, ~p~0!base=15, ~p~0!offset=0, ~t~0!base=20, ~t~0!offset=0] [L644] assert false; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc2!base=20, #t~malloc2!offset=0, ~a~0!base=15, ~a~0!offset=0, ~p~0!base=15, ~p~0!offset=0, ~t~0!base=20, ~t~0!offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=19, #NULL!offset=9, old(#NULL!base)=19, old(#NULL!offset)=9] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=19, old(#NULL!offset)=9] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret6 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L627] FCALL call #t~malloc0 := #Ultimate.alloc(8); [L627] ~a~0 := #t~malloc0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, ~a~0!base=15, ~a~0!offset=0] [L628] COND FALSE !(~a~0 == { base: 0, offset: 0 }) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, ~a~0!base=15, ~a~0!offset=0] [L629] havoc ~t~0; [L630] ~p~0 := ~a~0; [L631] FCALL call write~int(2, { base: ~a~0!base, offset: ~a~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, ~a~0!base=15, ~a~0!offset=0, ~p~0!base=15, ~p~0!offset=0] [L632] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~nondet1=1, ~a~0!base=15, ~a~0!offset=0, ~p~0!base=15, ~p~0!offset=0] [L632-L638] COND FALSE !(!(0 != #t~nondet1)) [L632] havoc #t~nondet1; [L633] FCALL call write~int(1, { base: ~p~0!base, offset: ~p~0!offset }, 4); [L634] FCALL call #t~malloc2 := #Ultimate.alloc(8); [L634] ~t~0 := #t~malloc2; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc2!base=20, #t~malloc2!offset=0, ~a~0!base=15, ~a~0!offset=0, ~p~0!base=15, ~p~0!offset=0, ~t~0!base=20, ~t~0!offset=0] [L635] COND FALSE !(~t~0 == { base: 0, offset: 0 }) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc2!base=20, #t~malloc2!offset=0, ~a~0!base=15, ~a~0!offset=0, ~p~0!base=15, ~p~0!offset=0, ~t~0!base=20, ~t~0!offset=0] [L636] FCALL call write~$Pointer$(~t~0, { base: ~p~0!base, offset: 4 + ~p~0!offset }, 4); [L637] FCALL call #t~mem3 := read~$Pointer$({ base: ~p~0!base, offset: 4 + ~p~0!offset }, 4); [L637] ~p~0 := #t~mem3; [L637] havoc #t~mem3; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc2!base=20, #t~malloc2!offset=0, ~a~0!base=15, ~a~0!offset=0, ~p~0!base=20, ~p~0!offset=0, ~t~0!base=20, ~t~0!offset=0] [L632] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc2!base=20, #t~malloc2!offset=0, #t~nondet1=0, ~a~0!base=15, ~a~0!offset=0, ~p~0!base=20, ~p~0!offset=0, ~t~0!base=20, ~t~0!offset=0] [L632-L638] COND TRUE !(0 != #t~nondet1) [L632] havoc #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc2!base=20, #t~malloc2!offset=0, ~a~0!base=15, ~a~0!offset=0, ~p~0!base=20, ~p~0!offset=0, ~t~0!base=20, ~t~0!offset=0] [L639] FCALL call write~int(2, { base: ~p~0!base, offset: ~p~0!offset }, 4); [L640] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~p~0!base, offset: 4 + ~p~0!offset }, 4); [L641] ~p~0 := ~a~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc2!base=20, #t~malloc2!offset=0, ~a~0!base=15, ~a~0!offset=0, ~p~0!base=15, ~p~0!offset=0, ~t~0!base=20, ~t~0!offset=0] [L642-L647] COND FALSE !(!(~p~0 != { base: 0, offset: 0 })) [L643] FCALL call #t~mem4 := read~int({ base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc2!base=20, #t~malloc2!offset=0, #t~mem4=1, ~a~0!base=15, ~a~0!offset=0, ~p~0!base=15, ~p~0!offset=0, ~t~0!base=20, ~t~0!offset=0] [L643] COND TRUE 2 != #t~mem4 [L643] havoc #t~mem4; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc2!base=20, #t~malloc2!offset=0, ~a~0!base=15, ~a~0!offset=0, ~p~0!base=15, ~p~0!offset=0, ~t~0!base=20, ~t~0!offset=0] [L644] assert false; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc2!base=20, #t~malloc2!offset=0, ~a~0!base=15, ~a~0!offset=0, ~p~0!base=15, ~p~0!offset=0, ~t~0!base=20, ~t~0!offset=0] [L627] List a = (List) malloc(sizeof(struct node)); VAL [a={15:0}, malloc(sizeof(struct node))={15:0}] [L628] COND FALSE !(a == 0) VAL [a={15:0}, malloc(sizeof(struct node))={15:0}] [L629] List t; [L630] List p = a; [L631] a->h = 2 VAL [a={15:0}, malloc(sizeof(struct node))={15:0}, p={15:0}] [L632] COND TRUE __VERIFIER_nondet_int() [L633] p->h = 1 [L634] t = (List) malloc(sizeof(struct node)) VAL [a={15:0}, malloc(sizeof(struct node))={15:0}, malloc(sizeof(struct node))={20:0}, p={15:0}, t={20:0}] [L635] COND FALSE !(t == 0) VAL [a={15:0}, malloc(sizeof(struct node))={15:0}, malloc(sizeof(struct node))={20:0}, p={15:0}, t={20:0}] [L636] p->n = t [L637] EXPR p->n [L637] p = p->n [L632] COND FALSE !(__VERIFIER_nondet_int()) [L639] p->h = 2 [L640] p->n = 0 [L641] p = a VAL [a={15:0}, malloc(sizeof(struct node))={15:0}, malloc(sizeof(struct node))={20:0}, p={15:0}, t={20:0}] [L642] COND TRUE p!=0 [L643] EXPR p->h VAL [a={15:0}, malloc(sizeof(struct node))={15:0}, malloc(sizeof(struct node))={20:0}, p={15:0}, p->h=1, t={20:0}] [L643] COND TRUE p->h != 2 [L644] __VERIFIER_error() VAL [a={15:0}, malloc(sizeof(struct node))={15:0}, malloc(sizeof(struct node))={20:0}, p={15:0}, t={20:0}] ----- [2018-11-23 12:52:55,381 WARN L170 areAnnotationChecker]: exitENTRY has no Hoare annotation [2018-11-23 12:52:55,381 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2018-11-23 12:52:55,381 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2018-11-23 12:52:55,382 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2018-11-23 12:52:55,382 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2018-11-23 12:52:55,382 WARN L170 areAnnotationChecker]: L620 has no Hoare annotation [2018-11-23 12:52:55,382 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2018-11-23 12:52:55,382 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2018-11-23 12:52:55,382 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2018-11-23 12:52:55,382 WARN L170 areAnnotationChecker]: L628 has no Hoare annotation [2018-11-23 12:52:55,383 WARN L170 areAnnotationChecker]: L628 has no Hoare annotation [2018-11-23 12:52:55,383 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-23 12:52:55,383 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-23 12:52:55,383 WARN L170 areAnnotationChecker]: L628-1 has no Hoare annotation [2018-11-23 12:52:55,383 WARN L170 areAnnotationChecker]: L628-1 has no Hoare annotation [2018-11-23 12:52:55,383 WARN L170 areAnnotationChecker]: L628-3 has no Hoare annotation [2018-11-23 12:52:55,383 WARN L170 areAnnotationChecker]: L632-3 has no Hoare annotation [2018-11-23 12:52:55,384 WARN L170 areAnnotationChecker]: L632-3 has no Hoare annotation [2018-11-23 12:52:55,384 WARN L170 areAnnotationChecker]: L632-4 has no Hoare annotation [2018-11-23 12:52:55,384 WARN L170 areAnnotationChecker]: L632-1 has no Hoare annotation [2018-11-23 12:52:55,384 WARN L170 areAnnotationChecker]: L632-1 has no Hoare annotation [2018-11-23 12:52:55,384 WARN L170 areAnnotationChecker]: L642-2 has no Hoare annotation [2018-11-23 12:52:55,384 WARN L170 areAnnotationChecker]: L642-2 has no Hoare annotation [2018-11-23 12:52:55,384 WARN L170 areAnnotationChecker]: L642-2 has no Hoare annotation [2018-11-23 12:52:55,385 WARN L170 areAnnotationChecker]: L635 has no Hoare annotation [2018-11-23 12:52:55,385 WARN L170 areAnnotationChecker]: L635 has no Hoare annotation [2018-11-23 12:52:55,385 WARN L170 areAnnotationChecker]: L642-3 has no Hoare annotation [2018-11-23 12:52:55,385 WARN L170 areAnnotationChecker]: L643 has no Hoare annotation [2018-11-23 12:52:55,385 WARN L170 areAnnotationChecker]: L643 has no Hoare annotation [2018-11-23 12:52:55,385 WARN L170 areAnnotationChecker]: L635-1 has no Hoare annotation [2018-11-23 12:52:55,385 WARN L170 areAnnotationChecker]: L635-1 has no Hoare annotation [2018-11-23 12:52:55,385 WARN L170 areAnnotationChecker]: L635-3 has no Hoare annotation [2018-11-23 12:52:55,386 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-23 12:52:55,386 WARN L170 areAnnotationChecker]: L644 has no Hoare annotation [2018-11-23 12:52:55,386 WARN L170 areAnnotationChecker]: L644 has no Hoare annotation [2018-11-23 12:52:55,386 WARN L170 areAnnotationChecker]: L643-2 has no Hoare annotation [2018-11-23 12:52:55,386 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2018-11-23 12:52:55,387 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:52:55,390 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 12:52:55 BoogieIcfgContainer [2018-11-23 12:52:55,391 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 12:52:55,391 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 12:52:55,391 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 12:52:55,392 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 12:52:55,392 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:52:51" (3/4) ... [2018-11-23 12:52:55,396 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|=19, |#NULL.offset|=9, |old(#NULL.base)|=19, |old(#NULL.offset)|=9] [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=19, |old(#NULL.offset)|=9] [?] assume true; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=19, |old(#NULL.offset)|=9] [?] RET #66#return; VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] CALL call #t~ret6 := main(); VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8);~a~0.base, ~a~0.offset := #t~malloc0.base, #t~malloc0.offset; VAL [main_~a~0.base=15, main_~a~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=15, |main_#t~malloc0.offset|=0] [?] assume !(~a~0.base == 0 && ~a~0.offset == 0); VAL [main_~a~0.base=15, main_~a~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=15, |main_#t~malloc0.offset|=0] [?] havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset;call write~int(2, ~a~0.base, ~a~0.offset, 4); VAL [main_~a~0.base=15, main_~a~0.offset=0, main_~p~0.base=15, main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=15, |main_#t~malloc0.offset|=0] [?] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [main_~a~0.base=15, main_~a~0.offset=0, main_~p~0.base=15, main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=15, |main_#t~malloc0.offset|=0, |main_#t~nondet1|=1] [?] assume !!(0 != #t~nondet1);havoc #t~nondet1;call write~int(1, ~p~0.base, ~p~0.offset, 4);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8);~t~0.base, ~t~0.offset := #t~malloc2.base, #t~malloc2.offset; VAL [main_~a~0.base=15, main_~a~0.offset=0, main_~p~0.base=15, main_~p~0.offset=0, main_~t~0.base=20, main_~t~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=15, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=20, |main_#t~malloc2.offset|=0] [?] assume !(~t~0.base == 0 && ~t~0.offset == 0); VAL [main_~a~0.base=15, main_~a~0.offset=0, main_~p~0.base=15, main_~p~0.offset=0, main_~t~0.base=20, main_~t~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=15, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=20, |main_#t~malloc2.offset|=0] [?] call write~$Pointer$(~t~0.base, ~t~0.offset, ~p~0.base, 4 + ~p~0.offset, 4);call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4);~p~0.base, ~p~0.offset := #t~mem3.base, #t~mem3.offset;havoc #t~mem3.base, #t~mem3.offset; VAL [main_~a~0.base=15, main_~a~0.offset=0, main_~p~0.base=20, main_~p~0.offset=0, main_~t~0.base=20, main_~t~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=15, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=20, |main_#t~malloc2.offset|=0] [?] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [main_~a~0.base=15, main_~a~0.offset=0, main_~p~0.base=20, main_~p~0.offset=0, main_~t~0.base=20, main_~t~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=15, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=20, |main_#t~malloc2.offset|=0, |main_#t~nondet1|=0] [?] assume !(0 != #t~nondet1);havoc #t~nondet1; VAL [main_~a~0.base=15, main_~a~0.offset=0, main_~p~0.base=20, main_~p~0.offset=0, main_~t~0.base=20, main_~t~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=15, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=20, |main_#t~malloc2.offset|=0] [?] call write~int(2, ~p~0.base, ~p~0.offset, 4);call write~$Pointer$(0, 0, ~p~0.base, 4 + ~p~0.offset, 4);~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; VAL [main_~a~0.base=15, main_~a~0.offset=0, main_~p~0.base=15, main_~p~0.offset=0, main_~t~0.base=20, main_~t~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=15, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=20, |main_#t~malloc2.offset|=0] [?] assume !!(~p~0.base != 0 || ~p~0.offset != 0);call #t~mem4 := read~int(~p~0.base, ~p~0.offset, 4); VAL [main_~a~0.base=15, main_~a~0.offset=0, main_~p~0.base=15, main_~p~0.offset=0, main_~t~0.base=20, main_~t~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=15, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=20, |main_#t~malloc2.offset|=0, |main_#t~mem4|=1] [?] assume 2 != #t~mem4;havoc #t~mem4; VAL [main_~a~0.base=15, main_~a~0.offset=0, main_~p~0.base=15, main_~p~0.offset=0, main_~t~0.base=20, main_~t~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=15, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=20, |main_#t~malloc2.offset|=0] [?] assume !false; VAL [main_~a~0.base=15, main_~a~0.offset=0, main_~p~0.base=15, main_~p~0.offset=0, main_~t~0.base=20, main_~t~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=15, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=20, |main_#t~malloc2.offset|=0] [?] CALL call ULTIMATE.init(); VAL [#NULL.base=19, #NULL.offset=9, old(#NULL.base)=19, old(#NULL.offset)=9] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=19, old(#NULL.offset)=9] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=19, old(#NULL.offset)=9] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret6 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L627] call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8); [L627] ~a~0.base, ~a~0.offset := #t~malloc0.base, #t~malloc0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=15, #t~malloc0.offset=0, ~a~0.base=15, ~a~0.offset=0] [L628] assume !(~a~0.base == 0 && ~a~0.offset == 0); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=15, #t~malloc0.offset=0, ~a~0.base=15, ~a~0.offset=0] [L629] havoc ~t~0.base, ~t~0.offset; [L630] ~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; [L631] call write~int(2, ~a~0.base, ~a~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=15, #t~malloc0.offset=0, ~a~0.base=15, ~a~0.offset=0, ~p~0.base=15, ~p~0.offset=0] [L632] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=15, #t~malloc0.offset=0, #t~nondet1=1, ~a~0.base=15, ~a~0.offset=0, ~p~0.base=15, ~p~0.offset=0] [L632-L638] assume !!(0 != #t~nondet1); [L632] havoc #t~nondet1; [L633] call write~int(1, ~p~0.base, ~p~0.offset, 4); [L634] call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8); [L634] ~t~0.base, ~t~0.offset := #t~malloc2.base, #t~malloc2.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=15, #t~malloc0.offset=0, #t~malloc2.base=20, #t~malloc2.offset=0, ~a~0.base=15, ~a~0.offset=0, ~p~0.base=15, ~p~0.offset=0, ~t~0.base=20, ~t~0.offset=0] [L635] assume !(~t~0.base == 0 && ~t~0.offset == 0); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=15, #t~malloc0.offset=0, #t~malloc2.base=20, #t~malloc2.offset=0, ~a~0.base=15, ~a~0.offset=0, ~p~0.base=15, ~p~0.offset=0, ~t~0.base=20, ~t~0.offset=0] [L636] call write~$Pointer$(~t~0.base, ~t~0.offset, ~p~0.base, 4 + ~p~0.offset, 4); [L637] call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4); [L637] ~p~0.base, ~p~0.offset := #t~mem3.base, #t~mem3.offset; [L637] havoc #t~mem3.base, #t~mem3.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=15, #t~malloc0.offset=0, #t~malloc2.base=20, #t~malloc2.offset=0, ~a~0.base=15, ~a~0.offset=0, ~p~0.base=20, ~p~0.offset=0, ~t~0.base=20, ~t~0.offset=0] [L632] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=15, #t~malloc0.offset=0, #t~malloc2.base=20, #t~malloc2.offset=0, #t~nondet1=0, ~a~0.base=15, ~a~0.offset=0, ~p~0.base=20, ~p~0.offset=0, ~t~0.base=20, ~t~0.offset=0] [L632-L638] assume !(0 != #t~nondet1); [L632] havoc #t~nondet1; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=15, #t~malloc0.offset=0, #t~malloc2.base=20, #t~malloc2.offset=0, ~a~0.base=15, ~a~0.offset=0, ~p~0.base=20, ~p~0.offset=0, ~t~0.base=20, ~t~0.offset=0] [L639] call write~int(2, ~p~0.base, ~p~0.offset, 4); [L640] call write~$Pointer$(0, 0, ~p~0.base, 4 + ~p~0.offset, 4); [L641] ~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=15, #t~malloc0.offset=0, #t~malloc2.base=20, #t~malloc2.offset=0, ~a~0.base=15, ~a~0.offset=0, ~p~0.base=15, ~p~0.offset=0, ~t~0.base=20, ~t~0.offset=0] [L642-L647] assume !!(~p~0.base != 0 || ~p~0.offset != 0); [L643] call #t~mem4 := read~int(~p~0.base, ~p~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=15, #t~malloc0.offset=0, #t~malloc2.base=20, #t~malloc2.offset=0, #t~mem4=1, ~a~0.base=15, ~a~0.offset=0, ~p~0.base=15, ~p~0.offset=0, ~t~0.base=20, ~t~0.offset=0] [L643-L645] assume 2 != #t~mem4; [L643] havoc #t~mem4; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=15, #t~malloc0.offset=0, #t~malloc2.base=20, #t~malloc2.offset=0, ~a~0.base=15, ~a~0.offset=0, ~p~0.base=15, ~p~0.offset=0, ~t~0.base=20, ~t~0.offset=0] [L644] assert false; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=15, #t~malloc0.offset=0, #t~malloc2.base=20, #t~malloc2.offset=0, ~a~0.base=15, ~a~0.offset=0, ~p~0.base=15, ~p~0.offset=0, ~t~0.base=20, ~t~0.offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL.base=19, #NULL.offset=9, old(#NULL.base)=19, old(#NULL.offset)=9] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=19, old(#NULL.offset)=9] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=19, old(#NULL.offset)=9] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret6 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L627] call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8); [L627] ~a~0.base, ~a~0.offset := #t~malloc0.base, #t~malloc0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=15, #t~malloc0.offset=0, ~a~0.base=15, ~a~0.offset=0] [L628] assume !(~a~0.base == 0 && ~a~0.offset == 0); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=15, #t~malloc0.offset=0, ~a~0.base=15, ~a~0.offset=0] [L629] havoc ~t~0.base, ~t~0.offset; [L630] ~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; [L631] call write~int(2, ~a~0.base, ~a~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=15, #t~malloc0.offset=0, ~a~0.base=15, ~a~0.offset=0, ~p~0.base=15, ~p~0.offset=0] [L632] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=15, #t~malloc0.offset=0, #t~nondet1=1, ~a~0.base=15, ~a~0.offset=0, ~p~0.base=15, ~p~0.offset=0] [L632-L638] assume !!(0 != #t~nondet1); [L632] havoc #t~nondet1; [L633] call write~int(1, ~p~0.base, ~p~0.offset, 4); [L634] call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8); [L634] ~t~0.base, ~t~0.offset := #t~malloc2.base, #t~malloc2.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=15, #t~malloc0.offset=0, #t~malloc2.base=20, #t~malloc2.offset=0, ~a~0.base=15, ~a~0.offset=0, ~p~0.base=15, ~p~0.offset=0, ~t~0.base=20, ~t~0.offset=0] [L635] assume !(~t~0.base == 0 && ~t~0.offset == 0); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=15, #t~malloc0.offset=0, #t~malloc2.base=20, #t~malloc2.offset=0, ~a~0.base=15, ~a~0.offset=0, ~p~0.base=15, ~p~0.offset=0, ~t~0.base=20, ~t~0.offset=0] [L636] call write~$Pointer$(~t~0.base, ~t~0.offset, ~p~0.base, 4 + ~p~0.offset, 4); [L637] call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4); [L637] ~p~0.base, ~p~0.offset := #t~mem3.base, #t~mem3.offset; [L637] havoc #t~mem3.base, #t~mem3.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=15, #t~malloc0.offset=0, #t~malloc2.base=20, #t~malloc2.offset=0, ~a~0.base=15, ~a~0.offset=0, ~p~0.base=20, ~p~0.offset=0, ~t~0.base=20, ~t~0.offset=0] [L632] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=15, #t~malloc0.offset=0, #t~malloc2.base=20, #t~malloc2.offset=0, #t~nondet1=0, ~a~0.base=15, ~a~0.offset=0, ~p~0.base=20, ~p~0.offset=0, ~t~0.base=20, ~t~0.offset=0] [L632-L638] assume !(0 != #t~nondet1); [L632] havoc #t~nondet1; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=15, #t~malloc0.offset=0, #t~malloc2.base=20, #t~malloc2.offset=0, ~a~0.base=15, ~a~0.offset=0, ~p~0.base=20, ~p~0.offset=0, ~t~0.base=20, ~t~0.offset=0] [L639] call write~int(2, ~p~0.base, ~p~0.offset, 4); [L640] call write~$Pointer$(0, 0, ~p~0.base, 4 + ~p~0.offset, 4); [L641] ~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=15, #t~malloc0.offset=0, #t~malloc2.base=20, #t~malloc2.offset=0, ~a~0.base=15, ~a~0.offset=0, ~p~0.base=15, ~p~0.offset=0, ~t~0.base=20, ~t~0.offset=0] [L642-L647] assume !!(~p~0.base != 0 || ~p~0.offset != 0); [L643] call #t~mem4 := read~int(~p~0.base, ~p~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=15, #t~malloc0.offset=0, #t~malloc2.base=20, #t~malloc2.offset=0, #t~mem4=1, ~a~0.base=15, ~a~0.offset=0, ~p~0.base=15, ~p~0.offset=0, ~t~0.base=20, ~t~0.offset=0] [L643-L645] assume 2 != #t~mem4; [L643] havoc #t~mem4; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=15, #t~malloc0.offset=0, #t~malloc2.base=20, #t~malloc2.offset=0, ~a~0.base=15, ~a~0.offset=0, ~p~0.base=15, ~p~0.offset=0, ~t~0.base=20, ~t~0.offset=0] [L644] assert false; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=15, #t~malloc0.offset=0, #t~malloc2.base=20, #t~malloc2.offset=0, ~a~0.base=15, ~a~0.offset=0, ~p~0.base=15, ~p~0.offset=0, ~t~0.base=20, ~t~0.offset=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=19, #NULL!offset=9, old(#NULL!base)=19, old(#NULL!offset)=9] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=19, old(#NULL!offset)=9] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret6 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L627] FCALL call #t~malloc0 := #Ultimate.alloc(8); [L627] ~a~0 := #t~malloc0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, ~a~0!base=15, ~a~0!offset=0] [L628] COND FALSE !(~a~0 == { base: 0, offset: 0 }) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, ~a~0!base=15, ~a~0!offset=0] [L629] havoc ~t~0; [L630] ~p~0 := ~a~0; [L631] FCALL call write~int(2, { base: ~a~0!base, offset: ~a~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, ~a~0!base=15, ~a~0!offset=0, ~p~0!base=15, ~p~0!offset=0] [L632] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~nondet1=1, ~a~0!base=15, ~a~0!offset=0, ~p~0!base=15, ~p~0!offset=0] [L632-L638] COND FALSE !(!(0 != #t~nondet1)) [L632] havoc #t~nondet1; [L633] FCALL call write~int(1, { base: ~p~0!base, offset: ~p~0!offset }, 4); [L634] FCALL call #t~malloc2 := #Ultimate.alloc(8); [L634] ~t~0 := #t~malloc2; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc2!base=20, #t~malloc2!offset=0, ~a~0!base=15, ~a~0!offset=0, ~p~0!base=15, ~p~0!offset=0, ~t~0!base=20, ~t~0!offset=0] [L635] COND FALSE !(~t~0 == { base: 0, offset: 0 }) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc2!base=20, #t~malloc2!offset=0, ~a~0!base=15, ~a~0!offset=0, ~p~0!base=15, ~p~0!offset=0, ~t~0!base=20, ~t~0!offset=0] [L636] FCALL call write~$Pointer$(~t~0, { base: ~p~0!base, offset: 4 + ~p~0!offset }, 4); [L637] FCALL call #t~mem3 := read~$Pointer$({ base: ~p~0!base, offset: 4 + ~p~0!offset }, 4); [L637] ~p~0 := #t~mem3; [L637] havoc #t~mem3; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc2!base=20, #t~malloc2!offset=0, ~a~0!base=15, ~a~0!offset=0, ~p~0!base=20, ~p~0!offset=0, ~t~0!base=20, ~t~0!offset=0] [L632] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc2!base=20, #t~malloc2!offset=0, #t~nondet1=0, ~a~0!base=15, ~a~0!offset=0, ~p~0!base=20, ~p~0!offset=0, ~t~0!base=20, ~t~0!offset=0] [L632-L638] COND TRUE !(0 != #t~nondet1) [L632] havoc #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc2!base=20, #t~malloc2!offset=0, ~a~0!base=15, ~a~0!offset=0, ~p~0!base=20, ~p~0!offset=0, ~t~0!base=20, ~t~0!offset=0] [L639] FCALL call write~int(2, { base: ~p~0!base, offset: ~p~0!offset }, 4); [L640] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~p~0!base, offset: 4 + ~p~0!offset }, 4); [L641] ~p~0 := ~a~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc2!base=20, #t~malloc2!offset=0, ~a~0!base=15, ~a~0!offset=0, ~p~0!base=15, ~p~0!offset=0, ~t~0!base=20, ~t~0!offset=0] [L642-L647] COND FALSE !(!(~p~0 != { base: 0, offset: 0 })) [L643] FCALL call #t~mem4 := read~int({ base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc2!base=20, #t~malloc2!offset=0, #t~mem4=1, ~a~0!base=15, ~a~0!offset=0, ~p~0!base=15, ~p~0!offset=0, ~t~0!base=20, ~t~0!offset=0] [L643] COND TRUE 2 != #t~mem4 [L643] havoc #t~mem4; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc2!base=20, #t~malloc2!offset=0, ~a~0!base=15, ~a~0!offset=0, ~p~0!base=15, ~p~0!offset=0, ~t~0!base=20, ~t~0!offset=0] [L644] assert false; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc2!base=20, #t~malloc2!offset=0, ~a~0!base=15, ~a~0!offset=0, ~p~0!base=15, ~p~0!offset=0, ~t~0!base=20, ~t~0!offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=19, #NULL!offset=9, old(#NULL!base)=19, old(#NULL!offset)=9] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=19, old(#NULL!offset)=9] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret6 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L627] FCALL call #t~malloc0 := #Ultimate.alloc(8); [L627] ~a~0 := #t~malloc0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, ~a~0!base=15, ~a~0!offset=0] [L628] COND FALSE !(~a~0 == { base: 0, offset: 0 }) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, ~a~0!base=15, ~a~0!offset=0] [L629] havoc ~t~0; [L630] ~p~0 := ~a~0; [L631] FCALL call write~int(2, { base: ~a~0!base, offset: ~a~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, ~a~0!base=15, ~a~0!offset=0, ~p~0!base=15, ~p~0!offset=0] [L632] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~nondet1=1, ~a~0!base=15, ~a~0!offset=0, ~p~0!base=15, ~p~0!offset=0] [L632-L638] COND FALSE !(!(0 != #t~nondet1)) [L632] havoc #t~nondet1; [L633] FCALL call write~int(1, { base: ~p~0!base, offset: ~p~0!offset }, 4); [L634] FCALL call #t~malloc2 := #Ultimate.alloc(8); [L634] ~t~0 := #t~malloc2; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc2!base=20, #t~malloc2!offset=0, ~a~0!base=15, ~a~0!offset=0, ~p~0!base=15, ~p~0!offset=0, ~t~0!base=20, ~t~0!offset=0] [L635] COND FALSE !(~t~0 == { base: 0, offset: 0 }) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc2!base=20, #t~malloc2!offset=0, ~a~0!base=15, ~a~0!offset=0, ~p~0!base=15, ~p~0!offset=0, ~t~0!base=20, ~t~0!offset=0] [L636] FCALL call write~$Pointer$(~t~0, { base: ~p~0!base, offset: 4 + ~p~0!offset }, 4); [L637] FCALL call #t~mem3 := read~$Pointer$({ base: ~p~0!base, offset: 4 + ~p~0!offset }, 4); [L637] ~p~0 := #t~mem3; [L637] havoc #t~mem3; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc2!base=20, #t~malloc2!offset=0, ~a~0!base=15, ~a~0!offset=0, ~p~0!base=20, ~p~0!offset=0, ~t~0!base=20, ~t~0!offset=0] [L632] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc2!base=20, #t~malloc2!offset=0, #t~nondet1=0, ~a~0!base=15, ~a~0!offset=0, ~p~0!base=20, ~p~0!offset=0, ~t~0!base=20, ~t~0!offset=0] [L632-L638] COND TRUE !(0 != #t~nondet1) [L632] havoc #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc2!base=20, #t~malloc2!offset=0, ~a~0!base=15, ~a~0!offset=0, ~p~0!base=20, ~p~0!offset=0, ~t~0!base=20, ~t~0!offset=0] [L639] FCALL call write~int(2, { base: ~p~0!base, offset: ~p~0!offset }, 4); [L640] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~p~0!base, offset: 4 + ~p~0!offset }, 4); [L641] ~p~0 := ~a~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc2!base=20, #t~malloc2!offset=0, ~a~0!base=15, ~a~0!offset=0, ~p~0!base=15, ~p~0!offset=0, ~t~0!base=20, ~t~0!offset=0] [L642-L647] COND FALSE !(!(~p~0 != { base: 0, offset: 0 })) [L643] FCALL call #t~mem4 := read~int({ base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc2!base=20, #t~malloc2!offset=0, #t~mem4=1, ~a~0!base=15, ~a~0!offset=0, ~p~0!base=15, ~p~0!offset=0, ~t~0!base=20, ~t~0!offset=0] [L643] COND TRUE 2 != #t~mem4 [L643] havoc #t~mem4; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc2!base=20, #t~malloc2!offset=0, ~a~0!base=15, ~a~0!offset=0, ~p~0!base=15, ~p~0!offset=0, ~t~0!base=20, ~t~0!offset=0] [L644] assert false; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc2!base=20, #t~malloc2!offset=0, ~a~0!base=15, ~a~0!offset=0, ~p~0!base=15, ~p~0!offset=0, ~t~0!base=20, ~t~0!offset=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=19, #NULL!offset=9, old(#NULL!base)=19, old(#NULL!offset)=9] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=19, old(#NULL!offset)=9] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret6 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L627] FCALL call #t~malloc0 := #Ultimate.alloc(8); [L627] ~a~0 := #t~malloc0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, ~a~0!base=15, ~a~0!offset=0] [L628] COND FALSE !(~a~0 == { base: 0, offset: 0 }) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, ~a~0!base=15, ~a~0!offset=0] [L629] havoc ~t~0; [L630] ~p~0 := ~a~0; [L631] FCALL call write~int(2, { base: ~a~0!base, offset: ~a~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, ~a~0!base=15, ~a~0!offset=0, ~p~0!base=15, ~p~0!offset=0] [L632] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~nondet1=1, ~a~0!base=15, ~a~0!offset=0, ~p~0!base=15, ~p~0!offset=0] [L632-L638] COND FALSE !(!(0 != #t~nondet1)) [L632] havoc #t~nondet1; [L633] FCALL call write~int(1, { base: ~p~0!base, offset: ~p~0!offset }, 4); [L634] FCALL call #t~malloc2 := #Ultimate.alloc(8); [L634] ~t~0 := #t~malloc2; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc2!base=20, #t~malloc2!offset=0, ~a~0!base=15, ~a~0!offset=0, ~p~0!base=15, ~p~0!offset=0, ~t~0!base=20, ~t~0!offset=0] [L635] COND FALSE !(~t~0 == { base: 0, offset: 0 }) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc2!base=20, #t~malloc2!offset=0, ~a~0!base=15, ~a~0!offset=0, ~p~0!base=15, ~p~0!offset=0, ~t~0!base=20, ~t~0!offset=0] [L636] FCALL call write~$Pointer$(~t~0, { base: ~p~0!base, offset: 4 + ~p~0!offset }, 4); [L637] FCALL call #t~mem3 := read~$Pointer$({ base: ~p~0!base, offset: 4 + ~p~0!offset }, 4); [L637] ~p~0 := #t~mem3; [L637] havoc #t~mem3; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc2!base=20, #t~malloc2!offset=0, ~a~0!base=15, ~a~0!offset=0, ~p~0!base=20, ~p~0!offset=0, ~t~0!base=20, ~t~0!offset=0] [L632] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc2!base=20, #t~malloc2!offset=0, #t~nondet1=0, ~a~0!base=15, ~a~0!offset=0, ~p~0!base=20, ~p~0!offset=0, ~t~0!base=20, ~t~0!offset=0] [L632-L638] COND TRUE !(0 != #t~nondet1) [L632] havoc #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc2!base=20, #t~malloc2!offset=0, ~a~0!base=15, ~a~0!offset=0, ~p~0!base=20, ~p~0!offset=0, ~t~0!base=20, ~t~0!offset=0] [L639] FCALL call write~int(2, { base: ~p~0!base, offset: ~p~0!offset }, 4); [L640] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~p~0!base, offset: 4 + ~p~0!offset }, 4); [L641] ~p~0 := ~a~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc2!base=20, #t~malloc2!offset=0, ~a~0!base=15, ~a~0!offset=0, ~p~0!base=15, ~p~0!offset=0, ~t~0!base=20, ~t~0!offset=0] [L642-L647] COND FALSE !(!(~p~0 != { base: 0, offset: 0 })) [L643] FCALL call #t~mem4 := read~int({ base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc2!base=20, #t~malloc2!offset=0, #t~mem4=1, ~a~0!base=15, ~a~0!offset=0, ~p~0!base=15, ~p~0!offset=0, ~t~0!base=20, ~t~0!offset=0] [L643] COND TRUE 2 != #t~mem4 [L643] havoc #t~mem4; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc2!base=20, #t~malloc2!offset=0, ~a~0!base=15, ~a~0!offset=0, ~p~0!base=15, ~p~0!offset=0, ~t~0!base=20, ~t~0!offset=0] [L644] assert false; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc2!base=20, #t~malloc2!offset=0, ~a~0!base=15, ~a~0!offset=0, ~p~0!base=15, ~p~0!offset=0, ~t~0!base=20, ~t~0!offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=19, #NULL!offset=9, old(#NULL!base)=19, old(#NULL!offset)=9] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=19, old(#NULL!offset)=9] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret6 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L627] FCALL call #t~malloc0 := #Ultimate.alloc(8); [L627] ~a~0 := #t~malloc0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, ~a~0!base=15, ~a~0!offset=0] [L628] COND FALSE !(~a~0 == { base: 0, offset: 0 }) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, ~a~0!base=15, ~a~0!offset=0] [L629] havoc ~t~0; [L630] ~p~0 := ~a~0; [L631] FCALL call write~int(2, { base: ~a~0!base, offset: ~a~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, ~a~0!base=15, ~a~0!offset=0, ~p~0!base=15, ~p~0!offset=0] [L632] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~nondet1=1, ~a~0!base=15, ~a~0!offset=0, ~p~0!base=15, ~p~0!offset=0] [L632-L638] COND FALSE !(!(0 != #t~nondet1)) [L632] havoc #t~nondet1; [L633] FCALL call write~int(1, { base: ~p~0!base, offset: ~p~0!offset }, 4); [L634] FCALL call #t~malloc2 := #Ultimate.alloc(8); [L634] ~t~0 := #t~malloc2; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc2!base=20, #t~malloc2!offset=0, ~a~0!base=15, ~a~0!offset=0, ~p~0!base=15, ~p~0!offset=0, ~t~0!base=20, ~t~0!offset=0] [L635] COND FALSE !(~t~0 == { base: 0, offset: 0 }) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc2!base=20, #t~malloc2!offset=0, ~a~0!base=15, ~a~0!offset=0, ~p~0!base=15, ~p~0!offset=0, ~t~0!base=20, ~t~0!offset=0] [L636] FCALL call write~$Pointer$(~t~0, { base: ~p~0!base, offset: 4 + ~p~0!offset }, 4); [L637] FCALL call #t~mem3 := read~$Pointer$({ base: ~p~0!base, offset: 4 + ~p~0!offset }, 4); [L637] ~p~0 := #t~mem3; [L637] havoc #t~mem3; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc2!base=20, #t~malloc2!offset=0, ~a~0!base=15, ~a~0!offset=0, ~p~0!base=20, ~p~0!offset=0, ~t~0!base=20, ~t~0!offset=0] [L632] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc2!base=20, #t~malloc2!offset=0, #t~nondet1=0, ~a~0!base=15, ~a~0!offset=0, ~p~0!base=20, ~p~0!offset=0, ~t~0!base=20, ~t~0!offset=0] [L632-L638] COND TRUE !(0 != #t~nondet1) [L632] havoc #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc2!base=20, #t~malloc2!offset=0, ~a~0!base=15, ~a~0!offset=0, ~p~0!base=20, ~p~0!offset=0, ~t~0!base=20, ~t~0!offset=0] [L639] FCALL call write~int(2, { base: ~p~0!base, offset: ~p~0!offset }, 4); [L640] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~p~0!base, offset: 4 + ~p~0!offset }, 4); [L641] ~p~0 := ~a~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc2!base=20, #t~malloc2!offset=0, ~a~0!base=15, ~a~0!offset=0, ~p~0!base=15, ~p~0!offset=0, ~t~0!base=20, ~t~0!offset=0] [L642-L647] COND FALSE !(!(~p~0 != { base: 0, offset: 0 })) [L643] FCALL call #t~mem4 := read~int({ base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc2!base=20, #t~malloc2!offset=0, #t~mem4=1, ~a~0!base=15, ~a~0!offset=0, ~p~0!base=15, ~p~0!offset=0, ~t~0!base=20, ~t~0!offset=0] [L643] COND TRUE 2 != #t~mem4 [L643] havoc #t~mem4; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc2!base=20, #t~malloc2!offset=0, ~a~0!base=15, ~a~0!offset=0, ~p~0!base=15, ~p~0!offset=0, ~t~0!base=20, ~t~0!offset=0] [L644] assert false; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc2!base=20, #t~malloc2!offset=0, ~a~0!base=15, ~a~0!offset=0, ~p~0!base=15, ~p~0!offset=0, ~t~0!base=20, ~t~0!offset=0] [L627] List a = (List) malloc(sizeof(struct node)); VAL [a={15:0}, malloc(sizeof(struct node))={15:0}] [L628] COND FALSE !(a == 0) VAL [a={15:0}, malloc(sizeof(struct node))={15:0}] [L629] List t; [L630] List p = a; [L631] a->h = 2 VAL [a={15:0}, malloc(sizeof(struct node))={15:0}, p={15:0}] [L632] COND TRUE __VERIFIER_nondet_int() [L633] p->h = 1 [L634] t = (List) malloc(sizeof(struct node)) VAL [a={15:0}, malloc(sizeof(struct node))={15:0}, malloc(sizeof(struct node))={20:0}, p={15:0}, t={20:0}] [L635] COND FALSE !(t == 0) VAL [a={15:0}, malloc(sizeof(struct node))={15:0}, malloc(sizeof(struct node))={20:0}, p={15:0}, t={20:0}] [L636] p->n = t [L637] EXPR p->n [L637] p = p->n [L632] COND FALSE !(__VERIFIER_nondet_int()) [L639] p->h = 2 [L640] p->n = 0 [L641] p = a VAL [a={15:0}, malloc(sizeof(struct node))={15:0}, malloc(sizeof(struct node))={20:0}, p={15:0}, t={20:0}] [L642] COND TRUE p!=0 [L643] EXPR p->h VAL [a={15:0}, malloc(sizeof(struct node))={15:0}, malloc(sizeof(struct node))={20:0}, p={15:0}, p->h=1, t={20:0}] [L643] COND TRUE p->h != 2 [L644] __VERIFIER_error() VAL [a={15:0}, malloc(sizeof(struct node))={15:0}, malloc(sizeof(struct node))={20:0}, p={15:0}, t={20:0}] ----- [2018-11-23 12:52:55,525 INFO L145 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/list-properties/simple_false-unreach-call_false-valid-memcleanup.i-witness.graphml [2018-11-23 12:52:55,525 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 12:52:55,527 INFO L168 Benchmark]: Toolchain (without parser) took 5692.98 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 735.6 MB). Free memory was 1.4 GB in the beginning and 1.9 GB in the end (delta: -516.5 MB). Peak memory consumption was 219.1 MB. Max. memory is 7.1 GB. [2018-11-23 12:52:55,528 INFO L168 Benchmark]: CDTParser took 0.22 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:52:55,532 INFO L168 Benchmark]: CACSL2BoogieTranslator took 653.51 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: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-11-23 12:52:55,533 INFO L168 Benchmark]: Boogie Procedure Inliner took 118.73 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 735.6 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -793.5 MB). Peak memory consumption was 15.7 MB. Max. memory is 7.1 GB. [2018-11-23 12:52:55,533 INFO L168 Benchmark]: Boogie Preprocessor took 60.50 ms. Allocated memory is still 2.3 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 12:52:55,534 INFO L168 Benchmark]: RCFGBuilder took 810.06 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 21.9 MB). Peak memory consumption was 21.9 MB. Max. memory is 7.1 GB. [2018-11-23 12:52:55,534 INFO L168 Benchmark]: TraceAbstraction took 3909.41 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: 220.9 MB). Peak memory consumption was 220.9 MB. Max. memory is 7.1 GB. [2018-11-23 12:52:55,539 INFO L168 Benchmark]: Witness Printer took 134.06 ms. Allocated memory is still 2.3 GB. Free memory was 2.0 GB in the beginning and 1.9 GB in the end (delta: 13.1 MB). Peak memory consumption was 13.1 MB. Max. memory is 7.1 GB. [2018-11-23 12:52:55,545 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.22 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 653.51 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: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 118.73 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 735.6 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -793.5 MB). Peak memory consumption was 15.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 60.50 ms. Allocated memory is still 2.3 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 810.06 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 21.9 MB). Peak memory consumption was 21.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 3909.41 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: 220.9 MB). Peak memory consumption was 220.9 MB. Max. memory is 7.1 GB. * Witness Printer took 134.06 ms. Allocated memory is still 2.3 GB. Free memory was 2.0 GB in the beginning and 1.9 GB in the end (delta: 13.1 MB). Peak memory consumption was 13.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 644]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L627] List a = (List) malloc(sizeof(struct node)); VAL [a={15:0}, malloc(sizeof(struct node))={15:0}] [L628] COND FALSE !(a == 0) VAL [a={15:0}, malloc(sizeof(struct node))={15:0}] [L629] List t; [L630] List p = a; [L631] a->h = 2 VAL [a={15:0}, malloc(sizeof(struct node))={15:0}, p={15:0}] [L632] COND TRUE __VERIFIER_nondet_int() [L633] p->h = 1 [L634] t = (List) malloc(sizeof(struct node)) VAL [a={15:0}, malloc(sizeof(struct node))={15:0}, malloc(sizeof(struct node))={20:0}, p={15:0}, t={20:0}] [L635] COND FALSE !(t == 0) VAL [a={15:0}, malloc(sizeof(struct node))={15:0}, malloc(sizeof(struct node))={20:0}, p={15:0}, t={20:0}] [L636] p->n = t [L637] EXPR p->n [L637] p = p->n [L632] COND FALSE !(__VERIFIER_nondet_int()) [L639] p->h = 2 [L640] p->n = 0 [L641] p = a VAL [a={15:0}, malloc(sizeof(struct node))={15:0}, malloc(sizeof(struct node))={20:0}, p={15:0}, t={20:0}] [L642] COND TRUE p!=0 [L643] EXPR p->h VAL [a={15:0}, malloc(sizeof(struct node))={15:0}, malloc(sizeof(struct node))={20:0}, p={15:0}, p->h=1, t={20:0}] [L643] COND TRUE p->h != 2 [L644] __VERIFIER_error() VAL [a={15:0}, malloc(sizeof(struct node))={15:0}, malloc(sizeof(struct node))={20:0}, p={15:0}, t={20:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 29 locations, 1 error locations. UNSAFE Result, 3.8s OverallTime, 4 OverallIterations, 2 TraceHistogramMax, 1.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 57 SDtfs, 39 SDslu, 75 SDs, 0 SdLazy, 54 SolverSat, 12 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 34 GetRequests, 19 SyntacticMatches, 4 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=27occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 15 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 79 NumberOfCodeBlocks, 79 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 57 ConstructedInterpolants, 0 QuantifiedInterpolants, 4363 SizeOfPredicates, 7 NumberOfNonLiveVariables, 77 ConjunctsInSsa, 19 ConjunctsInUnsatCore, 4 InterpolantComputations, 2 PerfectInterpolantSequences, 2/4 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...