./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ldv-regression/test08_false-unreach-call_true-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_20a701bc-715e-4c2a-9ea6-720d1493fe0b/bin-2019/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_20a701bc-715e-4c2a-9ea6-720d1493fe0b/bin-2019/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_20a701bc-715e-4c2a-9ea6-720d1493fe0b/bin-2019/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_20a701bc-715e-4c2a-9ea6-720d1493fe0b/bin-2019/ukojak/config/KojakReach.xml -i ../../sv-benchmarks/c/ldv-regression/test08_false-unreach-call_true-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_20a701bc-715e-4c2a-9ea6-720d1493fe0b/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_20a701bc-715e-4c2a-9ea6-720d1493fe0b/bin-2019/ukojak --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Kojak --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0ea43f38c40f327c4a0a1045134d36b3760cf289 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-23 04:20:20,170 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 04:20:20,172 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 04:20:20,180 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 04:20:20,180 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 04:20:20,181 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 04:20:20,182 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 04:20:20,183 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 04:20:20,185 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 04:20:20,186 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 04:20:20,186 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 04:20:20,187 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 04:20:20,187 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 04:20:20,188 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 04:20:20,189 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 04:20:20,190 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 04:20:20,191 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 04:20:20,192 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 04:20:20,194 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 04:20:20,196 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 04:20:20,197 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 04:20:20,198 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 04:20:20,200 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 04:20:20,200 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 04:20:20,200 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 04:20:20,201 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 04:20:20,202 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 04:20:20,203 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 04:20:20,203 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 04:20:20,204 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 04:20:20,204 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 04:20:20,205 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 04:20:20,205 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 04:20:20,205 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 04:20:20,206 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 04:20:20,207 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 04:20:20,207 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_20a701bc-715e-4c2a-9ea6-720d1493fe0b/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf [2018-11-23 04:20:20,219 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 04:20:20,220 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 04:20:20,221 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 04:20:20,221 INFO L133 SettingsManager]: * ... to procedures called more than once=ALWAYS [2018-11-23 04:20:20,221 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 04:20:20,222 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 04:20:20,222 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 04:20:20,222 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 04:20:20,222 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 04:20:20,222 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 04:20:20,223 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 04:20:20,223 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 04:20:20,223 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 04:20:20,223 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 04:20:20,223 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 04:20:20,223 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 04:20:20,224 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 04:20:20,224 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 04:20:20,224 INFO L131 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2018-11-23 04:20:20,224 INFO L133 SettingsManager]: * Timeout in seconds=1000000 [2018-11-23 04:20:20,224 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 04:20:20,225 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 04:20:20,225 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-11-23 04:20:20,225 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 04:20:20,225 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 04:20:20,226 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 04:20:20,226 INFO L133 SettingsManager]: * Trace refinement strategy=PENGUIN [2018-11-23 04:20:20,226 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 04:20:20,226 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 04:20:20,226 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_20a701bc-715e-4c2a-9ea6-720d1493fe0b/bin-2019/ukojak Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Kojak Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0ea43f38c40f327c4a0a1045134d36b3760cf289 [2018-11-23 04:20:20,255 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 04:20:20,267 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 04:20:20,270 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 04:20:20,271 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 04:20:20,272 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 04:20:20,272 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_20a701bc-715e-4c2a-9ea6-720d1493fe0b/bin-2019/ukojak/../../sv-benchmarks/c/ldv-regression/test08_false-unreach-call_true-termination.c [2018-11-23 04:20:20,324 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_20a701bc-715e-4c2a-9ea6-720d1493fe0b/bin-2019/ukojak/data/e919adb86/7d386422124b48f4aa71811ce04a69d0/FLAG11a25a289 [2018-11-23 04:20:20,665 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 04:20:20,665 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_20a701bc-715e-4c2a-9ea6-720d1493fe0b/sv-benchmarks/c/ldv-regression/test08_false-unreach-call_true-termination.c [2018-11-23 04:20:20,670 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_20a701bc-715e-4c2a-9ea6-720d1493fe0b/bin-2019/ukojak/data/e919adb86/7d386422124b48f4aa71811ce04a69d0/FLAG11a25a289 [2018-11-23 04:20:20,681 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_20a701bc-715e-4c2a-9ea6-720d1493fe0b/bin-2019/ukojak/data/e919adb86/7d386422124b48f4aa71811ce04a69d0 [2018-11-23 04:20:20,683 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 04:20:20,684 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 04:20:20,685 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 04:20:20,685 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 04:20:20,689 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 04:20:20,690 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 04:20:20" (1/1) ... [2018-11-23 04:20:20,692 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d5db597 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:20:20, skipping insertion in model container [2018-11-23 04:20:20,692 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 04:20:20" (1/1) ... [2018-11-23 04:20:20,699 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 04:20:20,715 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 04:20:20,838 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 04:20:20,846 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 04:20:20,858 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 04:20:20,870 INFO L195 MainTranslator]: Completed translation [2018-11-23 04:20:20,870 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:20:20 WrapperNode [2018-11-23 04:20:20,870 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 04:20:20,871 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 04:20:20,871 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 04:20:20,871 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 04:20:20,878 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:20:20" (1/1) ... [2018-11-23 04:20:20,885 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:20:20" (1/1) ... [2018-11-23 04:20:20,899 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 04:20:20,900 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 04:20:20,900 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 04:20:20,900 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 04:20:20,907 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:20:20" (1/1) ... [2018-11-23 04:20:20,907 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:20:20" (1/1) ... [2018-11-23 04:20:20,909 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:20:20" (1/1) ... [2018-11-23 04:20:20,909 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:20:20" (1/1) ... [2018-11-23 04:20:20,912 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:20:20" (1/1) ... [2018-11-23 04:20:20,915 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:20:20" (1/1) ... [2018-11-23 04:20:20,916 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:20:20" (1/1) ... [2018-11-23 04:20:20,917 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 04:20:20,918 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 04:20:20,918 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 04:20:20,918 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 04:20:20,919 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:20:20" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_20a701bc-715e-4c2a-9ea6-720d1493fe0b/bin-2019/ukojak/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (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:10000 [2018-11-23 04:20:21,019 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 04:20:21,019 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 04:20:21,020 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 04:20:21,020 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 04:20:21,020 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 04:20:21,020 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2018-11-23 04:20:21,272 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 04:20:21,272 INFO L280 CfgBuilder]: Removed 6 assue(true) statements. [2018-11-23 04:20:21,273 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 04:20:21 BoogieIcfgContainer [2018-11-23 04:20:21,273 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 04:20:21,273 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2018-11-23 04:20:21,273 INFO L271 PluginConnector]: Initializing CodeCheck... [2018-11-23 04:20:21,286 INFO L276 PluginConnector]: CodeCheck initialized [2018-11-23 04:20:21,286 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 04:20:21" (1/1) ... [2018-11-23 04:20:21,301 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:20:21,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 04:20:21,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2018-11-23 04:20:21,340 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2018-11-23 04:20:21,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-11-23 04:20:21,342 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 04:20:21,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 04:20:21,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 04:20:21,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 04:20:21,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 04:20:21,524 WARN L493 CodeCheckObserver]: This program is UNSAFE, Check terminated with 1 iterations. ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(4);call write~init~int(0, ~#a~0.base, ~#a~0.offset, 4);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(4);call write~init~int(0, ~#b~0.base, ~#b~0.offset, 4);~p1~0.base, ~p1~0.offset := 0, 0;~p2~0.base, ~p2~0.offset := 0, 0;havoc main_#res;havoc main_#t~mem3, main_#t~post4, main_#t~ret5, main_#t~mem6;~p1~0.base, ~p1~0.offset := ~#a~0.base, ~#a~0.offset;~p2~0.base, ~p2~0.offset := ~#b~0.base, ~#b~0.offset;call write~int(1, ~#b~0.base, ~#b~0.offset, 4);call write~int(5, ~#a~0.base, ~#a~0.offset, 4);call main_#t~mem3 := read~int(~#a~0.base, ~#a~0.offset, 4);main_#t~post4 := main_#t~mem3;call write~int(main_#t~post4 - 1, ~#a~0.base, ~#a~0.offset, 4);havoc main_#t~post4;havoc main_#t~mem3;havoc f_#res;havoc f_#t~mem0, f_#t~mem1, f_#t~mem2, f_~v~0;call f_#t~mem0 := read~int(~p1~0.base, ~p1~0.offset, 4);call f_#t~mem1 := read~int(~p2~0.base, ~p2~0.offset, 4);call f_#t~mem2 := read~int(~#a~0.base, ~#a~0.offset, 4);f_~v~0 := f_#t~mem0 + f_#t~mem1 - f_#t~mem2;havoc f_#t~mem0;havoc f_#t~mem2;havoc f_#t~mem1;BeginParallelComposition{ParallelCodeBlock0: assume 1 == f_~v~0;~p1~0.base, ~p1~0.offset := ~p2~0.base, ~p2~0.offset;f_#res := f_~v~0;ParallelCodeBlock1: assume !(1 == f_~v~0);f_#res := 0;}EndParallelCompositionmain_#t~ret5 := f_#res;assume -2147483648 <= main_#t~ret5 && main_#t~ret5 <= 2147483647;call write~int(main_#t~ret5, ~#a~0.base, ~#a~0.offset, 4);havoc main_#t~ret5;call main_#t~mem6 := read~int(~#a~0.base, ~#a~0.offset, 4); VAL [ULTIMATE.start_f_~v~0=1, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_f_#res|=1, |ULTIMATE.start_main_#t~mem6|=1, |~#a~0.base|=2, |~#a~0.offset|=0, |~#b~0.base|=5, |~#b~0.offset|=0, ~p1~0.base=5, ~p1~0.offset=0, ~p2~0.base=5, ~p2~0.offset=0] [?] assume 0 != main_#t~mem6 && ~p1~0.base == ~p2~0.base && ~p1~0.offset == ~p2~0.offset;havoc main_#t~mem6; VAL [ULTIMATE.start_f_~v~0=1, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_f_#res|=1, |~#a~0.base|=2, |~#a~0.offset|=0, |~#b~0.base|=5, |~#b~0.offset|=0, ~p1~0.base=5, ~p1~0.offset=0, ~p2~0.base=5, ~p2~0.offset=0] [?] assume !false; VAL [ULTIMATE.start_f_~v~0=1, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_f_#res|=1, |~#a~0.base|=2, |~#a~0.offset|=0, |~#b~0.base|=5, |~#b~0.offset|=0, ~p1~0.base=5, ~p1~0.offset=0, ~p2~0.base=5, ~p2~0.offset=0] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [L4] call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(4); [L4] call write~init~int(0, ~#a~0.base, ~#a~0.offset, 4); [L4] call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(4); [L4] call write~init~int(0, ~#b~0.base, ~#b~0.offset, 4); [L5] ~p1~0.base, ~p1~0.offset := 0, 0; [L5] ~p2~0.base, ~p2~0.offset := 0, 0; [?] havoc main_#res; [?] havoc main_#t~mem3, main_#t~post4, main_#t~ret5, main_#t~mem6; [L19] ~p1~0.base, ~p1~0.offset := ~#a~0.base, ~#a~0.offset; [L20] ~p2~0.base, ~p2~0.offset := ~#b~0.base, ~#b~0.offset; [L22] call write~int(1, ~#b~0.base, ~#b~0.offset, 4); [L23] call write~int(5, ~#a~0.base, ~#a~0.offset, 4); [L25] call main_#t~mem3 := read~int(~#a~0.base, ~#a~0.offset, 4); [L25] main_#t~post4 := main_#t~mem3; [L25] call write~int(main_#t~post4 - 1, ~#a~0.base, ~#a~0.offset, 4); [L25] havoc main_#t~post4; [L25] havoc main_#t~mem3; [L27] havoc f_#res; [L27] havoc f_#t~mem0, f_#t~mem1, f_#t~mem2, f_~v~0; [L8] call f_#t~mem0 := read~int(~p1~0.base, ~p1~0.offset, 4); [L8] call f_#t~mem1 := read~int(~p2~0.base, ~p2~0.offset, 4); [L8] call f_#t~mem2 := read~int(~#a~0.base, ~#a~0.offset, 4); [L8] f_~v~0 := f_#t~mem0 + f_#t~mem1 - f_#t~mem2; [L8] havoc f_#t~mem0; [L8] havoc f_#t~mem2; [L8] havoc f_#t~mem1; [L9-L14] assume 1 == f_~v~0; [L10] ~p1~0.base, ~p1~0.offset := ~p2~0.base, ~p2~0.offset; [L11] f_#res := f_~v~0; [L27] main_#t~ret5 := f_#res; [L27] assume -2147483648 <= main_#t~ret5 && main_#t~ret5 <= 2147483647; [L27] call write~int(main_#t~ret5, ~#a~0.base, ~#a~0.offset, 4); [L27] havoc main_#t~ret5; [L29] call main_#t~mem6 := read~int(~#a~0.base, ~#a~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, f_#res=1, f_~v~0=1, main_#t~mem6=1, ~#a~0.base=2, ~#a~0.offset=0, ~#b~0.base=5, ~#b~0.offset=0, ~p1~0.base=5, ~p1~0.offset=0, ~p2~0.base=5, ~p2~0.offset=0] [L29-L32] assume 0 != main_#t~mem6 && ~p1~0.base == ~p2~0.base && ~p1~0.offset == ~p2~0.offset; [L29] havoc main_#t~mem6; VAL [#NULL.base=0, #NULL.offset=0, f_#res=1, f_~v~0=1, ~#a~0.base=2, ~#a~0.offset=0, ~#b~0.base=5, ~#b~0.offset=0, ~p1~0.base=5, ~p1~0.offset=0, ~p2~0.base=5, ~p2~0.offset=0] [L36] assert false; VAL [#NULL.base=0, #NULL.offset=0, f_#res=1, f_~v~0=1, ~#a~0.base=2, ~#a~0.offset=0, ~#b~0.base=5, ~#b~0.offset=0, ~p1~0.base=5, ~p1~0.offset=0, ~p2~0.base=5, ~p2~0.offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [L4] call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(4); [L4] call write~init~int(0, ~#a~0.base, ~#a~0.offset, 4); [L4] call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(4); [L4] call write~init~int(0, ~#b~0.base, ~#b~0.offset, 4); [L5] ~p1~0.base, ~p1~0.offset := 0, 0; [L5] ~p2~0.base, ~p2~0.offset := 0, 0; [?] havoc main_#res; [?] havoc main_#t~mem3, main_#t~post4, main_#t~ret5, main_#t~mem6; [L19] ~p1~0.base, ~p1~0.offset := ~#a~0.base, ~#a~0.offset; [L20] ~p2~0.base, ~p2~0.offset := ~#b~0.base, ~#b~0.offset; [L22] call write~int(1, ~#b~0.base, ~#b~0.offset, 4); [L23] call write~int(5, ~#a~0.base, ~#a~0.offset, 4); [L25] call main_#t~mem3 := read~int(~#a~0.base, ~#a~0.offset, 4); [L25] main_#t~post4 := main_#t~mem3; [L25] call write~int(main_#t~post4 - 1, ~#a~0.base, ~#a~0.offset, 4); [L25] havoc main_#t~post4; [L25] havoc main_#t~mem3; [L27] havoc f_#res; [L27] havoc f_#t~mem0, f_#t~mem1, f_#t~mem2, f_~v~0; [L8] call f_#t~mem0 := read~int(~p1~0.base, ~p1~0.offset, 4); [L8] call f_#t~mem1 := read~int(~p2~0.base, ~p2~0.offset, 4); [L8] call f_#t~mem2 := read~int(~#a~0.base, ~#a~0.offset, 4); [L8] f_~v~0 := f_#t~mem0 + f_#t~mem1 - f_#t~mem2; [L8] havoc f_#t~mem0; [L8] havoc f_#t~mem2; [L8] havoc f_#t~mem1; [L9-L14] assume 1 == f_~v~0; [L10] ~p1~0.base, ~p1~0.offset := ~p2~0.base, ~p2~0.offset; [L11] f_#res := f_~v~0; [L27] main_#t~ret5 := f_#res; [L27] assume -2147483648 <= main_#t~ret5 && main_#t~ret5 <= 2147483647; [L27] call write~int(main_#t~ret5, ~#a~0.base, ~#a~0.offset, 4); [L27] havoc main_#t~ret5; [L29] call main_#t~mem6 := read~int(~#a~0.base, ~#a~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, f_#res=1, f_~v~0=1, main_#t~mem6=1, ~#a~0.base=2, ~#a~0.offset=0, ~#b~0.base=5, ~#b~0.offset=0, ~p1~0.base=5, ~p1~0.offset=0, ~p2~0.base=5, ~p2~0.offset=0] [L29-L32] assume 0 != main_#t~mem6 && ~p1~0.base == ~p2~0.base && ~p1~0.offset == ~p2~0.offset; [L29] havoc main_#t~mem6; VAL [#NULL.base=0, #NULL.offset=0, f_#res=1, f_~v~0=1, ~#a~0.base=2, ~#a~0.offset=0, ~#b~0.base=5, ~#b~0.offset=0, ~p1~0.base=5, ~p1~0.offset=0, ~p2~0.base=5, ~p2~0.offset=0] [L36] assert false; VAL [#NULL.base=0, #NULL.offset=0, f_#res=1, f_~v~0=1, ~#a~0.base=2, ~#a~0.offset=0, ~#b~0.base=5, ~#b~0.offset=0, ~p1~0.base=5, ~p1~0.offset=0, ~p2~0.base=5, ~p2~0.offset=0] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L4] FCALL call ~#a~0 := #Ultimate.alloc(4); [L4] FCALL call write~init~int(0, ~#a~0, 4); [L4] FCALL call ~#b~0 := #Ultimate.alloc(4); [L4] FCALL call write~init~int(0, ~#b~0, 4); [L5] ~p1~0 := { base: 0, offset: 0 }; [L5] ~p2~0 := { base: 0, offset: 0 }; [?] havoc main_#res; [?] havoc main_#t~mem3, main_#t~post4, main_#t~ret5, main_#t~mem6; [L19] ~p1~0 := ~#a~0; [L20] ~p2~0 := ~#b~0; [L22] FCALL call write~int(1, ~#b~0, 4); [L23] FCALL call write~int(5, ~#a~0, 4); [L25] FCALL call main_#t~mem3 := read~int(~#a~0, 4); [L25] main_#t~post4 := main_#t~mem3; [L25] FCALL call write~int(main_#t~post4 - 1, ~#a~0, 4); [L25] havoc main_#t~post4; [L25] havoc main_#t~mem3; [L27] havoc f_#res; [L27] havoc f_#t~mem0, f_#t~mem1, f_#t~mem2, f_~v~0; [L8] FCALL call f_#t~mem0 := read~int(~p1~0, 4); [L8] FCALL call f_#t~mem1 := read~int(~p2~0, 4); [L8] FCALL call f_#t~mem2 := read~int(~#a~0, 4); [L8] f_~v~0 := f_#t~mem0 + f_#t~mem1 - f_#t~mem2; [L8] havoc f_#t~mem0; [L8] havoc f_#t~mem2; [L8] havoc f_#t~mem1; [L9] COND TRUE 1 == f_~v~0 [L10] ~p1~0 := ~p2~0; [L11] f_#res := f_~v~0; [L27] main_#t~ret5 := f_#res; [L27] assume -2147483648 <= main_#t~ret5 && main_#t~ret5 <= 2147483647; [L27] FCALL call write~int(main_#t~ret5, ~#a~0, 4); [L27] havoc main_#t~ret5; [L29] FCALL call main_#t~mem6 := read~int(~#a~0, 4); VAL [#NULL!base=0, #NULL!offset=0, f_#res=1, f_~v~0=1, main_#t~mem6=1, ~#a~0!base=2, ~#a~0!offset=0, ~#b~0!base=5, ~#b~0!offset=0, ~p1~0!base=5, ~p1~0!offset=0, ~p2~0!base=5, ~p2~0!offset=0] [L29] COND TRUE 0 != main_#t~mem6 && ~p1~0 == ~p2~0 [L29] havoc main_#t~mem6; VAL [#NULL!base=0, #NULL!offset=0, f_#res=1, f_~v~0=1, ~#a~0!base=2, ~#a~0!offset=0, ~#b~0!base=5, ~#b~0!offset=0, ~p1~0!base=5, ~p1~0!offset=0, ~p2~0!base=5, ~p2~0!offset=0] [L36] assert false; VAL [#NULL!base=0, #NULL!offset=0, f_#res=1, f_~v~0=1, ~#a~0!base=2, ~#a~0!offset=0, ~#b~0!base=5, ~#b~0!offset=0, ~p1~0!base=5, ~p1~0!offset=0, ~p2~0!base=5, ~p2~0!offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L4] FCALL call ~#a~0 := #Ultimate.alloc(4); [L4] FCALL call write~init~int(0, ~#a~0, 4); [L4] FCALL call ~#b~0 := #Ultimate.alloc(4); [L4] FCALL call write~init~int(0, ~#b~0, 4); [L5] ~p1~0 := { base: 0, offset: 0 }; [L5] ~p2~0 := { base: 0, offset: 0 }; [?] havoc main_#res; [?] havoc main_#t~mem3, main_#t~post4, main_#t~ret5, main_#t~mem6; [L19] ~p1~0 := ~#a~0; [L20] ~p2~0 := ~#b~0; [L22] FCALL call write~int(1, ~#b~0, 4); [L23] FCALL call write~int(5, ~#a~0, 4); [L25] FCALL call main_#t~mem3 := read~int(~#a~0, 4); [L25] main_#t~post4 := main_#t~mem3; [L25] FCALL call write~int(main_#t~post4 - 1, ~#a~0, 4); [L25] havoc main_#t~post4; [L25] havoc main_#t~mem3; [L27] havoc f_#res; [L27] havoc f_#t~mem0, f_#t~mem1, f_#t~mem2, f_~v~0; [L8] FCALL call f_#t~mem0 := read~int(~p1~0, 4); [L8] FCALL call f_#t~mem1 := read~int(~p2~0, 4); [L8] FCALL call f_#t~mem2 := read~int(~#a~0, 4); [L8] f_~v~0 := f_#t~mem0 + f_#t~mem1 - f_#t~mem2; [L8] havoc f_#t~mem0; [L8] havoc f_#t~mem2; [L8] havoc f_#t~mem1; [L9] COND TRUE 1 == f_~v~0 [L10] ~p1~0 := ~p2~0; [L11] f_#res := f_~v~0; [L27] main_#t~ret5 := f_#res; [L27] assume -2147483648 <= main_#t~ret5 && main_#t~ret5 <= 2147483647; [L27] FCALL call write~int(main_#t~ret5, ~#a~0, 4); [L27] havoc main_#t~ret5; [L29] FCALL call main_#t~mem6 := read~int(~#a~0, 4); VAL [#NULL!base=0, #NULL!offset=0, f_#res=1, f_~v~0=1, main_#t~mem6=1, ~#a~0!base=2, ~#a~0!offset=0, ~#b~0!base=5, ~#b~0!offset=0, ~p1~0!base=5, ~p1~0!offset=0, ~p2~0!base=5, ~p2~0!offset=0] [L29] COND TRUE 0 != main_#t~mem6 && ~p1~0 == ~p2~0 [L29] havoc main_#t~mem6; VAL [#NULL!base=0, #NULL!offset=0, f_#res=1, f_~v~0=1, ~#a~0!base=2, ~#a~0!offset=0, ~#b~0!base=5, ~#b~0!offset=0, ~p1~0!base=5, ~p1~0!offset=0, ~p2~0!base=5, ~p2~0!offset=0] [L36] assert false; VAL [#NULL!base=0, #NULL!offset=0, f_#res=1, f_~v~0=1, ~#a~0!base=2, ~#a~0!offset=0, ~#b~0!base=5, ~#b~0!offset=0, ~p1~0!base=5, ~p1~0!offset=0, ~p2~0!base=5, ~p2~0!offset=0] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L4] FCALL call ~#a~0 := #Ultimate.alloc(4); [L4] FCALL call write~init~int(0, ~#a~0, 4); [L4] FCALL call ~#b~0 := #Ultimate.alloc(4); [L4] FCALL call write~init~int(0, ~#b~0, 4); [L5] ~p1~0 := { base: 0, offset: 0 }; [L5] ~p2~0 := { base: 0, offset: 0 }; [L19] ~p1~0 := ~#a~0; [L20] ~p2~0 := ~#b~0; [L22] FCALL call write~int(1, ~#b~0, 4); [L23] FCALL call write~int(5, ~#a~0, 4); [L25] FCALL call #t~mem3 := read~int(~#a~0, 4); [L25] #t~post4 := #t~mem3; [L25] FCALL call write~int(#t~post4 - 1, ~#a~0, 4); [L25] havoc #t~post4; [L25] havoc #t~mem3; [L8] FCALL call #t~mem0 := read~int(~p1~0, 4); [L8] FCALL call #t~mem1 := read~int(~p2~0, 4); [L8] FCALL call #t~mem2 := read~int(~#a~0, 4); [L8] ~v~0 := #t~mem0 + #t~mem1 - #t~mem2; [L8] havoc #t~mem0; [L8] havoc #t~mem2; [L8] havoc #t~mem1; [L9] COND TRUE 1 == ~v~0 [L10] ~p1~0 := ~p2~0; [L11] #res := ~v~0; [L27] assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; [L27] FCALL call write~int(#t~ret5, ~#a~0, 4); [L27] havoc #t~ret5; [L29] FCALL call #t~mem6 := read~int(~#a~0, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=2, ~#a~0!offset=0, ~#b~0!base=5, ~#b~0!offset=0, ~p1~0!base=5, ~p1~0!offset=0, ~p2~0!base=5, ~p2~0!offset=0] [L29] COND TRUE 0 != #t~mem6 && ~p1~0 == ~p2~0 [L29] havoc #t~mem6; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=2, ~#a~0!offset=0, ~#b~0!base=5, ~#b~0!offset=0, ~p1~0!base=5, ~p1~0!offset=0, ~p2~0!base=5, ~p2~0!offset=0] [L36] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=2, ~#a~0!offset=0, ~#b~0!base=5, ~#b~0!offset=0, ~p1~0!base=5, ~p1~0!offset=0, ~p2~0!base=5, ~p2~0!offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L4] FCALL call ~#a~0 := #Ultimate.alloc(4); [L4] FCALL call write~init~int(0, ~#a~0, 4); [L4] FCALL call ~#b~0 := #Ultimate.alloc(4); [L4] FCALL call write~init~int(0, ~#b~0, 4); [L5] ~p1~0 := { base: 0, offset: 0 }; [L5] ~p2~0 := { base: 0, offset: 0 }; [L19] ~p1~0 := ~#a~0; [L20] ~p2~0 := ~#b~0; [L22] FCALL call write~int(1, ~#b~0, 4); [L23] FCALL call write~int(5, ~#a~0, 4); [L25] FCALL call #t~mem3 := read~int(~#a~0, 4); [L25] #t~post4 := #t~mem3; [L25] FCALL call write~int(#t~post4 - 1, ~#a~0, 4); [L25] havoc #t~post4; [L25] havoc #t~mem3; [L8] FCALL call #t~mem0 := read~int(~p1~0, 4); [L8] FCALL call #t~mem1 := read~int(~p2~0, 4); [L8] FCALL call #t~mem2 := read~int(~#a~0, 4); [L8] ~v~0 := #t~mem0 + #t~mem1 - #t~mem2; [L8] havoc #t~mem0; [L8] havoc #t~mem2; [L8] havoc #t~mem1; [L9] COND TRUE 1 == ~v~0 [L10] ~p1~0 := ~p2~0; [L11] #res := ~v~0; [L27] assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; [L27] FCALL call write~int(#t~ret5, ~#a~0, 4); [L27] havoc #t~ret5; [L29] FCALL call #t~mem6 := read~int(~#a~0, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=2, ~#a~0!offset=0, ~#b~0!base=5, ~#b~0!offset=0, ~p1~0!base=5, ~p1~0!offset=0, ~p2~0!base=5, ~p2~0!offset=0] [L29] COND TRUE 0 != #t~mem6 && ~p1~0 == ~p2~0 [L29] havoc #t~mem6; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=2, ~#a~0!offset=0, ~#b~0!base=5, ~#b~0!offset=0, ~p1~0!base=5, ~p1~0!offset=0, ~p2~0!base=5, ~p2~0!offset=0] [L36] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=2, ~#a~0!offset=0, ~#b~0!base=5, ~#b~0!offset=0, ~p1~0!base=5, ~p1~0!offset=0, ~p2~0!base=5, ~p2~0!offset=0] [L4] int a, b; [L5] int *p1, *p2; [L19] p1 = &a [L20] p2 = &b [L22] b = 1 [L23] a = 5 [L25] EXPR \read(a) [L25] a-- [L8] EXPR \read(*p1) [L8] EXPR \read(*p2) [L8] EXPR \read(a) [L8] int v = *p1 + *p2 - a; [L9] COND TRUE v == 1 [L10] p1 = p2 [L11] return v; [L27] a = f() [L29] EXPR \read(a) VAL [a={2:0}, b={5:0}, p1={5:0}, p2={5:0}] [L29] COND TRUE a && p1 == p2 [L36] __VERIFIER_error() VAL [a={2:0}, b={5:0}, p1={5:0}, p2={5:0}] ----- [2018-11-23 04:20:21,558 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 23.11 04:20:21 ImpRootNode [2018-11-23 04:20:21,558 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2018-11-23 04:20:21,558 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 04:20:21,558 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 04:20:21,558 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 04:20:21,559 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 04:20:21" (3/4) ... [2018-11-23 04:20:21,561 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(4);call write~init~int(0, ~#a~0.base, ~#a~0.offset, 4);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(4);call write~init~int(0, ~#b~0.base, ~#b~0.offset, 4);~p1~0.base, ~p1~0.offset := 0, 0;~p2~0.base, ~p2~0.offset := 0, 0;havoc main_#res;havoc main_#t~mem3, main_#t~post4, main_#t~ret5, main_#t~mem6;~p1~0.base, ~p1~0.offset := ~#a~0.base, ~#a~0.offset;~p2~0.base, ~p2~0.offset := ~#b~0.base, ~#b~0.offset;call write~int(1, ~#b~0.base, ~#b~0.offset, 4);call write~int(5, ~#a~0.base, ~#a~0.offset, 4);call main_#t~mem3 := read~int(~#a~0.base, ~#a~0.offset, 4);main_#t~post4 := main_#t~mem3;call write~int(main_#t~post4 - 1, ~#a~0.base, ~#a~0.offset, 4);havoc main_#t~post4;havoc main_#t~mem3;havoc f_#res;havoc f_#t~mem0, f_#t~mem1, f_#t~mem2, f_~v~0;call f_#t~mem0 := read~int(~p1~0.base, ~p1~0.offset, 4);call f_#t~mem1 := read~int(~p2~0.base, ~p2~0.offset, 4);call f_#t~mem2 := read~int(~#a~0.base, ~#a~0.offset, 4);f_~v~0 := f_#t~mem0 + f_#t~mem1 - f_#t~mem2;havoc f_#t~mem0;havoc f_#t~mem2;havoc f_#t~mem1;BeginParallelComposition{ParallelCodeBlock0: assume 1 == f_~v~0;~p1~0.base, ~p1~0.offset := ~p2~0.base, ~p2~0.offset;f_#res := f_~v~0;ParallelCodeBlock1: assume !(1 == f_~v~0);f_#res := 0;}EndParallelCompositionmain_#t~ret5 := f_#res;assume -2147483648 <= main_#t~ret5 && main_#t~ret5 <= 2147483647;call write~int(main_#t~ret5, ~#a~0.base, ~#a~0.offset, 4);havoc main_#t~ret5;call main_#t~mem6 := read~int(~#a~0.base, ~#a~0.offset, 4); VAL [ULTIMATE.start_f_~v~0=1, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_f_#res|=1, |ULTIMATE.start_main_#t~mem6|=1, |~#a~0.base|=2, |~#a~0.offset|=0, |~#b~0.base|=5, |~#b~0.offset|=0, ~p1~0.base=5, ~p1~0.offset=0, ~p2~0.base=5, ~p2~0.offset=0] [?] assume 0 != main_#t~mem6 && ~p1~0.base == ~p2~0.base && ~p1~0.offset == ~p2~0.offset;havoc main_#t~mem6; VAL [ULTIMATE.start_f_~v~0=1, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_f_#res|=1, |~#a~0.base|=2, |~#a~0.offset|=0, |~#b~0.base|=5, |~#b~0.offset|=0, ~p1~0.base=5, ~p1~0.offset=0, ~p2~0.base=5, ~p2~0.offset=0] [?] assume !false; VAL [ULTIMATE.start_f_~v~0=1, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_f_#res|=1, |~#a~0.base|=2, |~#a~0.offset|=0, |~#b~0.base|=5, |~#b~0.offset|=0, ~p1~0.base=5, ~p1~0.offset=0, ~p2~0.base=5, ~p2~0.offset=0] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [L4] call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(4); [L4] call write~init~int(0, ~#a~0.base, ~#a~0.offset, 4); [L4] call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(4); [L4] call write~init~int(0, ~#b~0.base, ~#b~0.offset, 4); [L5] ~p1~0.base, ~p1~0.offset := 0, 0; [L5] ~p2~0.base, ~p2~0.offset := 0, 0; [?] havoc main_#res; [?] havoc main_#t~mem3, main_#t~post4, main_#t~ret5, main_#t~mem6; [L19] ~p1~0.base, ~p1~0.offset := ~#a~0.base, ~#a~0.offset; [L20] ~p2~0.base, ~p2~0.offset := ~#b~0.base, ~#b~0.offset; [L22] call write~int(1, ~#b~0.base, ~#b~0.offset, 4); [L23] call write~int(5, ~#a~0.base, ~#a~0.offset, 4); [L25] call main_#t~mem3 := read~int(~#a~0.base, ~#a~0.offset, 4); [L25] main_#t~post4 := main_#t~mem3; [L25] call write~int(main_#t~post4 - 1, ~#a~0.base, ~#a~0.offset, 4); [L25] havoc main_#t~post4; [L25] havoc main_#t~mem3; [L27] havoc f_#res; [L27] havoc f_#t~mem0, f_#t~mem1, f_#t~mem2, f_~v~0; [L8] call f_#t~mem0 := read~int(~p1~0.base, ~p1~0.offset, 4); [L8] call f_#t~mem1 := read~int(~p2~0.base, ~p2~0.offset, 4); [L8] call f_#t~mem2 := read~int(~#a~0.base, ~#a~0.offset, 4); [L8] f_~v~0 := f_#t~mem0 + f_#t~mem1 - f_#t~mem2; [L8] havoc f_#t~mem0; [L8] havoc f_#t~mem2; [L8] havoc f_#t~mem1; [L9-L14] assume 1 == f_~v~0; [L10] ~p1~0.base, ~p1~0.offset := ~p2~0.base, ~p2~0.offset; [L11] f_#res := f_~v~0; [L27] main_#t~ret5 := f_#res; [L27] assume -2147483648 <= main_#t~ret5 && main_#t~ret5 <= 2147483647; [L27] call write~int(main_#t~ret5, ~#a~0.base, ~#a~0.offset, 4); [L27] havoc main_#t~ret5; [L29] call main_#t~mem6 := read~int(~#a~0.base, ~#a~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, f_#res=1, f_~v~0=1, main_#t~mem6=1, ~#a~0.base=2, ~#a~0.offset=0, ~#b~0.base=5, ~#b~0.offset=0, ~p1~0.base=5, ~p1~0.offset=0, ~p2~0.base=5, ~p2~0.offset=0] [L29-L32] assume 0 != main_#t~mem6 && ~p1~0.base == ~p2~0.base && ~p1~0.offset == ~p2~0.offset; [L29] havoc main_#t~mem6; VAL [#NULL.base=0, #NULL.offset=0, f_#res=1, f_~v~0=1, ~#a~0.base=2, ~#a~0.offset=0, ~#b~0.base=5, ~#b~0.offset=0, ~p1~0.base=5, ~p1~0.offset=0, ~p2~0.base=5, ~p2~0.offset=0] [L36] assert false; VAL [#NULL.base=0, #NULL.offset=0, f_#res=1, f_~v~0=1, ~#a~0.base=2, ~#a~0.offset=0, ~#b~0.base=5, ~#b~0.offset=0, ~p1~0.base=5, ~p1~0.offset=0, ~p2~0.base=5, ~p2~0.offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [L4] call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(4); [L4] call write~init~int(0, ~#a~0.base, ~#a~0.offset, 4); [L4] call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(4); [L4] call write~init~int(0, ~#b~0.base, ~#b~0.offset, 4); [L5] ~p1~0.base, ~p1~0.offset := 0, 0; [L5] ~p2~0.base, ~p2~0.offset := 0, 0; [?] havoc main_#res; [?] havoc main_#t~mem3, main_#t~post4, main_#t~ret5, main_#t~mem6; [L19] ~p1~0.base, ~p1~0.offset := ~#a~0.base, ~#a~0.offset; [L20] ~p2~0.base, ~p2~0.offset := ~#b~0.base, ~#b~0.offset; [L22] call write~int(1, ~#b~0.base, ~#b~0.offset, 4); [L23] call write~int(5, ~#a~0.base, ~#a~0.offset, 4); [L25] call main_#t~mem3 := read~int(~#a~0.base, ~#a~0.offset, 4); [L25] main_#t~post4 := main_#t~mem3; [L25] call write~int(main_#t~post4 - 1, ~#a~0.base, ~#a~0.offset, 4); [L25] havoc main_#t~post4; [L25] havoc main_#t~mem3; [L27] havoc f_#res; [L27] havoc f_#t~mem0, f_#t~mem1, f_#t~mem2, f_~v~0; [L8] call f_#t~mem0 := read~int(~p1~0.base, ~p1~0.offset, 4); [L8] call f_#t~mem1 := read~int(~p2~0.base, ~p2~0.offset, 4); [L8] call f_#t~mem2 := read~int(~#a~0.base, ~#a~0.offset, 4); [L8] f_~v~0 := f_#t~mem0 + f_#t~mem1 - f_#t~mem2; [L8] havoc f_#t~mem0; [L8] havoc f_#t~mem2; [L8] havoc f_#t~mem1; [L9-L14] assume 1 == f_~v~0; [L10] ~p1~0.base, ~p1~0.offset := ~p2~0.base, ~p2~0.offset; [L11] f_#res := f_~v~0; [L27] main_#t~ret5 := f_#res; [L27] assume -2147483648 <= main_#t~ret5 && main_#t~ret5 <= 2147483647; [L27] call write~int(main_#t~ret5, ~#a~0.base, ~#a~0.offset, 4); [L27] havoc main_#t~ret5; [L29] call main_#t~mem6 := read~int(~#a~0.base, ~#a~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, f_#res=1, f_~v~0=1, main_#t~mem6=1, ~#a~0.base=2, ~#a~0.offset=0, ~#b~0.base=5, ~#b~0.offset=0, ~p1~0.base=5, ~p1~0.offset=0, ~p2~0.base=5, ~p2~0.offset=0] [L29-L32] assume 0 != main_#t~mem6 && ~p1~0.base == ~p2~0.base && ~p1~0.offset == ~p2~0.offset; [L29] havoc main_#t~mem6; VAL [#NULL.base=0, #NULL.offset=0, f_#res=1, f_~v~0=1, ~#a~0.base=2, ~#a~0.offset=0, ~#b~0.base=5, ~#b~0.offset=0, ~p1~0.base=5, ~p1~0.offset=0, ~p2~0.base=5, ~p2~0.offset=0] [L36] assert false; VAL [#NULL.base=0, #NULL.offset=0, f_#res=1, f_~v~0=1, ~#a~0.base=2, ~#a~0.offset=0, ~#b~0.base=5, ~#b~0.offset=0, ~p1~0.base=5, ~p1~0.offset=0, ~p2~0.base=5, ~p2~0.offset=0] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L4] FCALL call ~#a~0 := #Ultimate.alloc(4); [L4] FCALL call write~init~int(0, ~#a~0, 4); [L4] FCALL call ~#b~0 := #Ultimate.alloc(4); [L4] FCALL call write~init~int(0, ~#b~0, 4); [L5] ~p1~0 := { base: 0, offset: 0 }; [L5] ~p2~0 := { base: 0, offset: 0 }; [?] havoc main_#res; [?] havoc main_#t~mem3, main_#t~post4, main_#t~ret5, main_#t~mem6; [L19] ~p1~0 := ~#a~0; [L20] ~p2~0 := ~#b~0; [L22] FCALL call write~int(1, ~#b~0, 4); [L23] FCALL call write~int(5, ~#a~0, 4); [L25] FCALL call main_#t~mem3 := read~int(~#a~0, 4); [L25] main_#t~post4 := main_#t~mem3; [L25] FCALL call write~int(main_#t~post4 - 1, ~#a~0, 4); [L25] havoc main_#t~post4; [L25] havoc main_#t~mem3; [L27] havoc f_#res; [L27] havoc f_#t~mem0, f_#t~mem1, f_#t~mem2, f_~v~0; [L8] FCALL call f_#t~mem0 := read~int(~p1~0, 4); [L8] FCALL call f_#t~mem1 := read~int(~p2~0, 4); [L8] FCALL call f_#t~mem2 := read~int(~#a~0, 4); [L8] f_~v~0 := f_#t~mem0 + f_#t~mem1 - f_#t~mem2; [L8] havoc f_#t~mem0; [L8] havoc f_#t~mem2; [L8] havoc f_#t~mem1; [L9] COND TRUE 1 == f_~v~0 [L10] ~p1~0 := ~p2~0; [L11] f_#res := f_~v~0; [L27] main_#t~ret5 := f_#res; [L27] assume -2147483648 <= main_#t~ret5 && main_#t~ret5 <= 2147483647; [L27] FCALL call write~int(main_#t~ret5, ~#a~0, 4); [L27] havoc main_#t~ret5; [L29] FCALL call main_#t~mem6 := read~int(~#a~0, 4); VAL [#NULL!base=0, #NULL!offset=0, f_#res=1, f_~v~0=1, main_#t~mem6=1, ~#a~0!base=2, ~#a~0!offset=0, ~#b~0!base=5, ~#b~0!offset=0, ~p1~0!base=5, ~p1~0!offset=0, ~p2~0!base=5, ~p2~0!offset=0] [L29] COND TRUE 0 != main_#t~mem6 && ~p1~0 == ~p2~0 [L29] havoc main_#t~mem6; VAL [#NULL!base=0, #NULL!offset=0, f_#res=1, f_~v~0=1, ~#a~0!base=2, ~#a~0!offset=0, ~#b~0!base=5, ~#b~0!offset=0, ~p1~0!base=5, ~p1~0!offset=0, ~p2~0!base=5, ~p2~0!offset=0] [L36] assert false; VAL [#NULL!base=0, #NULL!offset=0, f_#res=1, f_~v~0=1, ~#a~0!base=2, ~#a~0!offset=0, ~#b~0!base=5, ~#b~0!offset=0, ~p1~0!base=5, ~p1~0!offset=0, ~p2~0!base=5, ~p2~0!offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L4] FCALL call ~#a~0 := #Ultimate.alloc(4); [L4] FCALL call write~init~int(0, ~#a~0, 4); [L4] FCALL call ~#b~0 := #Ultimate.alloc(4); [L4] FCALL call write~init~int(0, ~#b~0, 4); [L5] ~p1~0 := { base: 0, offset: 0 }; [L5] ~p2~0 := { base: 0, offset: 0 }; [?] havoc main_#res; [?] havoc main_#t~mem3, main_#t~post4, main_#t~ret5, main_#t~mem6; [L19] ~p1~0 := ~#a~0; [L20] ~p2~0 := ~#b~0; [L22] FCALL call write~int(1, ~#b~0, 4); [L23] FCALL call write~int(5, ~#a~0, 4); [L25] FCALL call main_#t~mem3 := read~int(~#a~0, 4); [L25] main_#t~post4 := main_#t~mem3; [L25] FCALL call write~int(main_#t~post4 - 1, ~#a~0, 4); [L25] havoc main_#t~post4; [L25] havoc main_#t~mem3; [L27] havoc f_#res; [L27] havoc f_#t~mem0, f_#t~mem1, f_#t~mem2, f_~v~0; [L8] FCALL call f_#t~mem0 := read~int(~p1~0, 4); [L8] FCALL call f_#t~mem1 := read~int(~p2~0, 4); [L8] FCALL call f_#t~mem2 := read~int(~#a~0, 4); [L8] f_~v~0 := f_#t~mem0 + f_#t~mem1 - f_#t~mem2; [L8] havoc f_#t~mem0; [L8] havoc f_#t~mem2; [L8] havoc f_#t~mem1; [L9] COND TRUE 1 == f_~v~0 [L10] ~p1~0 := ~p2~0; [L11] f_#res := f_~v~0; [L27] main_#t~ret5 := f_#res; [L27] assume -2147483648 <= main_#t~ret5 && main_#t~ret5 <= 2147483647; [L27] FCALL call write~int(main_#t~ret5, ~#a~0, 4); [L27] havoc main_#t~ret5; [L29] FCALL call main_#t~mem6 := read~int(~#a~0, 4); VAL [#NULL!base=0, #NULL!offset=0, f_#res=1, f_~v~0=1, main_#t~mem6=1, ~#a~0!base=2, ~#a~0!offset=0, ~#b~0!base=5, ~#b~0!offset=0, ~p1~0!base=5, ~p1~0!offset=0, ~p2~0!base=5, ~p2~0!offset=0] [L29] COND TRUE 0 != main_#t~mem6 && ~p1~0 == ~p2~0 [L29] havoc main_#t~mem6; VAL [#NULL!base=0, #NULL!offset=0, f_#res=1, f_~v~0=1, ~#a~0!base=2, ~#a~0!offset=0, ~#b~0!base=5, ~#b~0!offset=0, ~p1~0!base=5, ~p1~0!offset=0, ~p2~0!base=5, ~p2~0!offset=0] [L36] assert false; VAL [#NULL!base=0, #NULL!offset=0, f_#res=1, f_~v~0=1, ~#a~0!base=2, ~#a~0!offset=0, ~#b~0!base=5, ~#b~0!offset=0, ~p1~0!base=5, ~p1~0!offset=0, ~p2~0!base=5, ~p2~0!offset=0] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L4] FCALL call ~#a~0 := #Ultimate.alloc(4); [L4] FCALL call write~init~int(0, ~#a~0, 4); [L4] FCALL call ~#b~0 := #Ultimate.alloc(4); [L4] FCALL call write~init~int(0, ~#b~0, 4); [L5] ~p1~0 := { base: 0, offset: 0 }; [L5] ~p2~0 := { base: 0, offset: 0 }; [L19] ~p1~0 := ~#a~0; [L20] ~p2~0 := ~#b~0; [L22] FCALL call write~int(1, ~#b~0, 4); [L23] FCALL call write~int(5, ~#a~0, 4); [L25] FCALL call #t~mem3 := read~int(~#a~0, 4); [L25] #t~post4 := #t~mem3; [L25] FCALL call write~int(#t~post4 - 1, ~#a~0, 4); [L25] havoc #t~post4; [L25] havoc #t~mem3; [L8] FCALL call #t~mem0 := read~int(~p1~0, 4); [L8] FCALL call #t~mem1 := read~int(~p2~0, 4); [L8] FCALL call #t~mem2 := read~int(~#a~0, 4); [L8] ~v~0 := #t~mem0 + #t~mem1 - #t~mem2; [L8] havoc #t~mem0; [L8] havoc #t~mem2; [L8] havoc #t~mem1; [L9] COND TRUE 1 == ~v~0 [L10] ~p1~0 := ~p2~0; [L11] #res := ~v~0; [L27] assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; [L27] FCALL call write~int(#t~ret5, ~#a~0, 4); [L27] havoc #t~ret5; [L29] FCALL call #t~mem6 := read~int(~#a~0, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=2, ~#a~0!offset=0, ~#b~0!base=5, ~#b~0!offset=0, ~p1~0!base=5, ~p1~0!offset=0, ~p2~0!base=5, ~p2~0!offset=0] [L29] COND TRUE 0 != #t~mem6 && ~p1~0 == ~p2~0 [L29] havoc #t~mem6; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=2, ~#a~0!offset=0, ~#b~0!base=5, ~#b~0!offset=0, ~p1~0!base=5, ~p1~0!offset=0, ~p2~0!base=5, ~p2~0!offset=0] [L36] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=2, ~#a~0!offset=0, ~#b~0!base=5, ~#b~0!offset=0, ~p1~0!base=5, ~p1~0!offset=0, ~p2~0!base=5, ~p2~0!offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L4] FCALL call ~#a~0 := #Ultimate.alloc(4); [L4] FCALL call write~init~int(0, ~#a~0, 4); [L4] FCALL call ~#b~0 := #Ultimate.alloc(4); [L4] FCALL call write~init~int(0, ~#b~0, 4); [L5] ~p1~0 := { base: 0, offset: 0 }; [L5] ~p2~0 := { base: 0, offset: 0 }; [L19] ~p1~0 := ~#a~0; [L20] ~p2~0 := ~#b~0; [L22] FCALL call write~int(1, ~#b~0, 4); [L23] FCALL call write~int(5, ~#a~0, 4); [L25] FCALL call #t~mem3 := read~int(~#a~0, 4); [L25] #t~post4 := #t~mem3; [L25] FCALL call write~int(#t~post4 - 1, ~#a~0, 4); [L25] havoc #t~post4; [L25] havoc #t~mem3; [L8] FCALL call #t~mem0 := read~int(~p1~0, 4); [L8] FCALL call #t~mem1 := read~int(~p2~0, 4); [L8] FCALL call #t~mem2 := read~int(~#a~0, 4); [L8] ~v~0 := #t~mem0 + #t~mem1 - #t~mem2; [L8] havoc #t~mem0; [L8] havoc #t~mem2; [L8] havoc #t~mem1; [L9] COND TRUE 1 == ~v~0 [L10] ~p1~0 := ~p2~0; [L11] #res := ~v~0; [L27] assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; [L27] FCALL call write~int(#t~ret5, ~#a~0, 4); [L27] havoc #t~ret5; [L29] FCALL call #t~mem6 := read~int(~#a~0, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=2, ~#a~0!offset=0, ~#b~0!base=5, ~#b~0!offset=0, ~p1~0!base=5, ~p1~0!offset=0, ~p2~0!base=5, ~p2~0!offset=0] [L29] COND TRUE 0 != #t~mem6 && ~p1~0 == ~p2~0 [L29] havoc #t~mem6; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=2, ~#a~0!offset=0, ~#b~0!base=5, ~#b~0!offset=0, ~p1~0!base=5, ~p1~0!offset=0, ~p2~0!base=5, ~p2~0!offset=0] [L36] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=2, ~#a~0!offset=0, ~#b~0!base=5, ~#b~0!offset=0, ~p1~0!base=5, ~p1~0!offset=0, ~p2~0!base=5, ~p2~0!offset=0] [L4] int a, b; [L5] int *p1, *p2; [L19] p1 = &a [L20] p2 = &b [L22] b = 1 [L23] a = 5 [L25] EXPR \read(a) [L25] a-- [L8] EXPR \read(*p1) [L8] EXPR \read(*p2) [L8] EXPR \read(a) [L8] int v = *p1 + *p2 - a; [L9] COND TRUE v == 1 [L10] p1 = p2 [L11] return v; [L27] a = f() [L29] EXPR \read(a) VAL [a={2:0}, b={5:0}, p1={5:0}, p2={5:0}] [L29] COND TRUE a && p1 == p2 [L36] __VERIFIER_error() VAL [a={2:0}, b={5:0}, p1={5:0}, p2={5:0}] ----- [2018-11-23 04:20:21,606 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_20a701bc-715e-4c2a-9ea6-720d1493fe0b/bin-2019/ukojak/witness.graphml [2018-11-23 04:20:21,606 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 04:20:21,607 INFO L168 Benchmark]: Toolchain (without parser) took 923.45 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 110.6 MB). Free memory was 956.4 MB in the beginning and 1.1 GB in the end (delta: -110.3 MB). Peak memory consumption was 360.5 kB. Max. memory is 11.5 GB. [2018-11-23 04:20:21,608 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 977.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 04:20:21,608 INFO L168 Benchmark]: CACSL2BoogieTranslator took 185.72 ms. Allocated memory is still 1.0 GB. Free memory was 956.4 MB in the beginning and 945.7 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-23 04:20:21,609 INFO L168 Benchmark]: Boogie Procedure Inliner took 28.62 ms. Allocated memory is still 1.0 GB. Free memory was 945.7 MB in the beginning and 940.3 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-11-23 04:20:21,609 INFO L168 Benchmark]: Boogie Preprocessor took 17.62 ms. Allocated memory is still 1.0 GB. Free memory is still 940.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 04:20:21,610 INFO L168 Benchmark]: RCFGBuilder took 355.34 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 110.6 MB). Free memory was 940.3 MB in the beginning and 1.1 GB in the end (delta: -150.5 MB). Peak memory consumption was 14.8 MB. Max. memory is 11.5 GB. [2018-11-23 04:20:21,610 INFO L168 Benchmark]: CodeCheck took 284.48 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.8 MB). Peak memory consumption was 18.8 MB. Max. memory is 11.5 GB. [2018-11-23 04:20:21,611 INFO L168 Benchmark]: Witness Printer took 48.40 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-11-23 04:20:21,614 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck: - StatisticsResult: Ultimate CodeCheck benchmark data CFG has 1 procedures, 10 locations, 1 error locations. UNSAFE Result, 0.2s OverallTime, 1 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: 0 DeclaredPredicates, 0 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 3 NumberOfCodeBlocks, 3 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, 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: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - CounterExampleResult [Line: 36]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L4] int a, b; [L5] int *p1, *p2; [L19] p1 = &a [L20] p2 = &b [L22] b = 1 [L23] a = 5 [L25] EXPR \read(a) [L25] a-- [L8] EXPR \read(*p1) [L8] EXPR \read(*p2) [L8] EXPR \read(a) [L8] int v = *p1 + *p2 - a; [L9] COND TRUE v == 1 [L10] p1 = p2 [L11] return v; [L27] a = f() [L29] EXPR \read(a) VAL [a={2:0}, b={5:0}, p1={5:0}, p2={5:0}] [L29] COND TRUE a && p1 == p2 [L36] __VERIFIER_error() VAL [a={2:0}, b={5:0}, p1={5:0}, p2={5:0}] * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 977.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 185.72 ms. Allocated memory is still 1.0 GB. Free memory was 956.4 MB in the beginning and 945.7 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 28.62 ms. Allocated memory is still 1.0 GB. Free memory was 945.7 MB in the beginning and 940.3 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 17.62 ms. Allocated memory is still 1.0 GB. Free memory is still 940.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 355.34 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 110.6 MB). Free memory was 940.3 MB in the beginning and 1.1 GB in the end (delta: -150.5 MB). Peak memory consumption was 14.8 MB. Max. memory is 11.5 GB. * CodeCheck took 284.48 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.8 MB). Peak memory consumption was 18.8 MB. Max. memory is 11.5 GB. * Witness Printer took 48.40 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...