./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/ldv-regression/test06.c --full-output --witness-type violation_witness --validate ./svcomp-yaml-violation-generation.2024-08-01_14-26-22.files/Default/test06.yml/witness.yml --preprocessor.replace.while.statements.and.if-then-else.statements false --icfgbuilder.size.of.a.code.block SequenceOfStatements --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0a70ae82 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/ldv-regression/test06.c ./svcomp-yaml-violation-generation.2024-08-01_14-26-22.files/Default/test06.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --preprocessor.replace.while.statements.and.if-then-else.statements false --icfgbuilder.size.of.a.code.block SequenceOfStatements --- Real Ultimate output --- This is Ultimate 0.2.4-wip.fs.yaml-violation-witnesses-0a70ae8-m [2024-08-07 14:07:51,200 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-08-07 14:07:51,277 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-08-07 14:07:51,283 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-08-07 14:07:51,284 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-08-07 14:07:51,319 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-08-07 14:07:51,320 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-08-07 14:07:51,320 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-08-07 14:07:51,321 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-08-07 14:07:51,321 INFO L153 SettingsManager]: * Use memory slicer=true [2024-08-07 14:07:51,322 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-08-07 14:07:51,323 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-08-07 14:07:51,324 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-08-07 14:07:51,325 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-08-07 14:07:51,325 INFO L153 SettingsManager]: * Use SBE=true [2024-08-07 14:07:51,332 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-08-07 14:07:51,332 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-08-07 14:07:51,333 INFO L153 SettingsManager]: * sizeof long=4 [2024-08-07 14:07:51,333 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-08-07 14:07:51,333 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-08-07 14:07:51,334 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-08-07 14:07:51,334 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-08-07 14:07:51,335 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-08-07 14:07:51,335 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-08-07 14:07:51,335 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-08-07 14:07:51,336 INFO L153 SettingsManager]: * sizeof long double=12 [2024-08-07 14:07:51,336 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-08-07 14:07:51,336 INFO L153 SettingsManager]: * Use constant arrays=true [2024-08-07 14:07:51,337 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-08-07 14:07:51,337 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-08-07 14:07:51,339 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-08-07 14:07:51,339 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-08-07 14:07:51,339 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-08-07 14:07:51,340 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-08-07 14:07:51,341 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-08-07 14:07:51,341 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-08-07 14:07:51,342 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-08-07 14:07:51,342 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-08-07 14:07:51,342 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-08-07 14:07:51,342 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-08-07 14:07:51,343 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-08-07 14:07:51,343 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-08-07 14:07:51,343 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-08-07 14:07:51,343 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Replace while statements and if-then-else statements -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder: Size of a code block -> SequenceOfStatements [2024-08-07 14:07:51,667 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-08-07 14:07:51,689 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-08-07 14:07:51,699 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-08-07 14:07:51,700 INFO L270 PluginConnector]: Initializing CDTParser... [2024-08-07 14:07:51,700 INFO L274 PluginConnector]: CDTParser initialized [2024-08-07 14:07:51,702 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-regression/test06.c [2024-08-07 14:07:53,292 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-08-07 14:07:53,480 INFO L384 CDTParser]: Found 1 translation units. [2024-08-07 14:07:53,481 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-regression/test06.c [2024-08-07 14:07:53,489 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/426f7d36c/6e42beb7e38f44fe99917b206736f2f6/FLAGb6b1b78e2 [2024-08-07 14:07:53,507 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/426f7d36c/6e42beb7e38f44fe99917b206736f2f6 [2024-08-07 14:07:53,511 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-08-07 14:07:53,512 INFO L274 PluginConnector]: Witness Parser initialized [2024-08-07 14:07:53,513 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./svcomp-yaml-violation-generation.2024-08-01_14-26-22.files/Default/test06.yml/witness.yml [2024-08-07 14:07:53,578 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-08-07 14:07:53,580 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2024-08-07 14:07:53,582 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-08-07 14:07:53,582 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-08-07 14:07:53,586 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-08-07 14:07:53,587 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.08 02:07:53" (1/2) ... [2024-08-07 14:07:53,588 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@57a4eb5e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.08 02:07:53, skipping insertion in model container [2024-08-07 14:07:53,588 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.08 02:07:53" (1/2) ... [2024-08-07 14:07:53,589 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@3a87c6f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.08 02:07:53, skipping insertion in model container [2024-08-07 14:07:53,590 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser VIOLATION_WITNESS 07.08 02:07:53" (2/2) ... [2024-08-07 14:07:53,590 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@57a4eb5e and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 07.08 02:07:53, skipping insertion in model container [2024-08-07 14:07:53,590 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser VIOLATION_WITNESS 07.08 02:07:53" (2/2) ... [2024-08-07 14:07:53,608 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-08-07 14:07:53,769 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-regression/test06.c[670,683] [2024-08-07 14:07:53,782 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-08-07 14:07:53,803 INFO L200 MainTranslator]: Completed pre-run [2024-08-07 14:07:53,820 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-regression/test06.c[670,683] [2024-08-07 14:07:53,821 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-08-07 14:07:53,837 INFO L204 MainTranslator]: Completed translation [2024-08-07 14:07:53,838 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 07.08 02:07:53 WrapperNode [2024-08-07 14:07:53,839 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-08-07 14:07:53,839 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-08-07 14:07:53,840 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-08-07 14:07:53,840 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-08-07 14:07:53,851 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 07.08 02:07:53" (1/1) ... [2024-08-07 14:07:53,851 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 07.08 02:07:53" (1/1) ... [2024-08-07 14:07:53,858 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 07.08 02:07:53" (1/1) ... [2024-08-07 14:07:53,880 INFO L175 MemorySlicer]: Split 16 memory accesses to 4 slices as follows [2, 8, 3, 3]. 50 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0]. The 8 writes are split as follows [0, 5, 1, 2]. [2024-08-07 14:07:53,880 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 07.08 02:07:53" (1/1) ... [2024-08-07 14:07:53,880 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 07.08 02:07:53" (1/1) ... [2024-08-07 14:07:53,892 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 07.08 02:07:53" (1/1) ... [2024-08-07 14:07:53,897 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 07.08 02:07:53" (1/1) ... [2024-08-07 14:07:53,898 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 07.08 02:07:53" (1/1) ... [2024-08-07 14:07:53,900 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-08-07 14:07:53,906 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-08-07 14:07:53,908 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-08-07 14:07:53,909 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-08-07 14:07:53,909 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 07.08 02:07:53" (1/1) ... [2024-08-07 14:07:53,914 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-08-07 14:07:53,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-08-07 14:07:53,942 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-08-07 14:07:53,946 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2024-08-07 14:07:53,996 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-08-07 14:07:53,996 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-08-07 14:07:53,996 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-08-07 14:07:53,997 INFO L138 BoogieDeclarations]: Found implementation of procedure g [2024-08-07 14:07:53,997 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2024-08-07 14:07:53,997 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-08-07 14:07:53,997 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2024-08-07 14:07:53,997 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2024-08-07 14:07:53,998 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-08-07 14:07:53,999 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-08-07 14:07:53,999 INFO L130 BoogieDeclarations]: Found specification of procedure g [2024-08-07 14:07:53,999 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-08-07 14:07:53,999 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-08-07 14:07:53,999 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-08-07 14:07:53,999 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2024-08-07 14:07:54,000 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-08-07 14:07:54,000 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-08-07 14:07:54,000 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-08-07 14:07:54,000 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2024-08-07 14:07:54,000 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-08-07 14:07:54,000 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-08-07 14:07:54,000 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-08-07 14:07:54,001 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-08-07 14:07:54,001 INFO L130 BoogieDeclarations]: Found specification of procedure f [2024-08-07 14:07:54,001 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-08-07 14:07:54,001 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-08-07 14:07:54,002 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-08-07 14:07:54,003 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-08-07 14:07:54,003 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-08-07 14:07:54,003 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-08-07 14:07:54,003 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-08-07 14:07:54,003 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-08-07 14:07:54,004 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-08-07 14:07:54,004 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-08-07 14:07:54,004 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-08-07 14:07:54,004 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-08-07 14:07:54,004 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-08-07 14:07:54,128 INFO L273 CfgBuilder]: Building ICFG [2024-08-07 14:07:54,132 INFO L304 CfgBuilder]: Building CFG for each procedure with an implementation [2024-08-07 14:07:54,295 INFO L1251 $ProcedureCfgBuilder]: dead code at ProgramPoint L23: call ULTIMATE.dealloc(~#a~0.base, ~#a~0.offset);havoc ~#a~0.base, ~#a~0.offset;call ULTIMATE.dealloc(~#b~0.base, ~#b~0.offset);havoc ~#b~0.base, ~#b~0.offset;call ULTIMATE.dealloc(~#p1~0.base, ~#p1~0.offset);havoc ~#p1~0.base, ~#p1~0.offset;call ULTIMATE.dealloc(~#p2~0.base, ~#p2~0.offset);havoc ~#p2~0.base, ~#p2~0.offset; [2024-08-07 14:07:54,362 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-08-07 14:07:54,362 INFO L327 CfgBuilder]: Performing block encoding [2024-08-07 14:07:54,369 INFO L349 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-08-07 14:07:54,369 INFO L354 CfgBuilder]: Removed 0 assume(true) statements. [2024-08-07 14:07:54,370 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.08 02:07:54 BoogieIcfgContainer [2024-08-07 14:07:54,370 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-08-07 14:07:54,372 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-08-07 14:07:54,372 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-08-07 14:07:54,375 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-08-07 14:07:54,375 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.08 02:07:53" (1/4) ... [2024-08-07 14:07:54,375 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3298790c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.08 02:07:54, skipping insertion in model container [2024-08-07 14:07:54,375 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser VIOLATION_WITNESS 07.08 02:07:53" (2/4) ... [2024-08-07 14:07:54,376 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3298790c and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction VIOLATION_WITNESS 07.08 02:07:54, skipping insertion in model container [2024-08-07 14:07:54,376 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 07.08 02:07:53" (3/4) ... [2024-08-07 14:07:54,376 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3298790c and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction VIOLATION_WITNESS 07.08 02:07:54, skipping insertion in model container [2024-08-07 14:07:54,376 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.08 02:07:54" (4/4) ... [2024-08-07 14:07:54,377 INFO L119 eAbstractionObserver]: Analyzing ICFG test06.c [2024-08-07 14:07:54,378 WARN L130 eAbstractionObserver]: Found a witness in the YAML format. I will only consider traces that are accepted by the witness [2024-08-07 14:07:54,399 INFO L221 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-08-07 14:07:54,400 INFO L180 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-08-07 14:07:54,442 WARN L283 nessProductAutomaton]: assume !(4 == ~a);#res := 0;, isNegated true [2024-08-07 14:07:54,444 WARN L283 nessProductAutomaton]: assume 4 == ~a;, isNegated false [2024-08-07 14:07:54,445 WARN L283 nessProductAutomaton]: assume !(4 == ~a);#res := 0;, isNegated true [2024-08-07 14:07:54,445 WARN L283 nessProductAutomaton]: assume 4 == ~a;, isNegated false [2024-08-07 14:07:54,448 WARN L283 nessProductAutomaton]: assume !(4 == ~a);#res := 0;, isNegated true [2024-08-07 14:07:54,448 WARN L283 nessProductAutomaton]: assume 4 == ~a;, isNegated false [2024-08-07 14:07:54,449 WARN L283 nessProductAutomaton]: assume !(4 == ~a);#res := 0;, isNegated true [2024-08-07 14:07:54,449 WARN L283 nessProductAutomaton]: assume 4 == ~a;, isNegated false [2024-08-07 14:07:54,450 WARN L283 nessProductAutomaton]: assume !(4 == ~a);#res := 0;, isNegated true [2024-08-07 14:07:54,451 WARN L283 nessProductAutomaton]: assume 4 == ~a;, isNegated false [2024-08-07 14:07:54,452 WARN L283 nessProductAutomaton]: assume !(4 == ~a);#res := 0;, isNegated true [2024-08-07 14:07:54,452 WARN L283 nessProductAutomaton]: assume 4 == ~a;, isNegated false [2024-08-07 14:07:54,453 WARN L283 nessProductAutomaton]: assume !(4 == ~a);#res := 0;, isNegated true [2024-08-07 14:07:54,453 WARN L283 nessProductAutomaton]: assume 4 == ~a;, isNegated false [2024-08-07 14:07:54,454 WARN L283 nessProductAutomaton]: assume !(4 == ~a);#res := 0;, isNegated true [2024-08-07 14:07:54,454 WARN L283 nessProductAutomaton]: assume 4 == ~a;, isNegated false [2024-08-07 14:07:54,455 WARN L283 nessProductAutomaton]: assume !(4 == ~a);#res := 0;, isNegated true [2024-08-07 14:07:54,455 WARN L283 nessProductAutomaton]: assume 4 == ~a;, isNegated false [2024-08-07 14:07:54,456 WARN L283 nessProductAutomaton]: assume !(4 == ~a);#res := 0;, isNegated true [2024-08-07 14:07:54,456 WARN L283 nessProductAutomaton]: assume 4 == ~a;, isNegated false [2024-08-07 14:07:54,457 WARN L283 nessProductAutomaton]: assume !(4 == ~a);#res := 0;, isNegated true [2024-08-07 14:07:54,457 WARN L283 nessProductAutomaton]: assume 4 == ~a;, isNegated false [2024-08-07 14:07:54,458 WARN L283 nessProductAutomaton]: assume !(4 == ~a);#res := 0;, isNegated true [2024-08-07 14:07:54,458 WARN L283 nessProductAutomaton]: assume 4 == ~a;, isNegated false [2024-08-07 14:07:54,459 WARN L283 nessProductAutomaton]: assume !(4 == ~a);#res := 0;, isNegated true [2024-08-07 14:07:54,459 WARN L283 nessProductAutomaton]: assume 4 == ~a;, isNegated false [2024-08-07 14:07:54,460 WARN L283 nessProductAutomaton]: assume 0 == #t~mem11;havoc #t~mem10.base, #t~mem10.offset;havoc #t~mem11;, isNegated false [2024-08-07 14:07:54,460 WARN L283 nessProductAutomaton]: assume !(0 == #t~mem11);havoc #t~mem10.base, #t~mem10.offset;havoc #t~mem11;, isNegated true [2024-08-07 14:07:54,460 WARN L283 nessProductAutomaton]: assume !(4 == ~a);#res := 0;, isNegated true [2024-08-07 14:07:54,461 WARN L283 nessProductAutomaton]: assume 4 == ~a;, isNegated false [2024-08-07 14:07:54,461 WARN L283 nessProductAutomaton]: assume 0 == #t~mem11;havoc #t~mem10.base, #t~mem10.offset;havoc #t~mem11;, isNegated false [2024-08-07 14:07:54,461 WARN L283 nessProductAutomaton]: assume !(0 == #t~mem11);havoc #t~mem10.base, #t~mem10.offset;havoc #t~mem11;, isNegated true [2024-08-07 14:07:54,462 WARN L283 nessProductAutomaton]: assume 0 == #t~mem11;havoc #t~mem10.base, #t~mem10.offset;havoc #t~mem11;, isNegated false [2024-08-07 14:07:54,462 WARN L283 nessProductAutomaton]: assume !(0 == #t~mem11);havoc #t~mem10.base, #t~mem10.offset;havoc #t~mem11;, isNegated true [2024-08-07 14:07:54,463 WARN L283 nessProductAutomaton]: assume 0 == #t~mem11;havoc #t~mem10.base, #t~mem10.offset;havoc #t~mem11;, isNegated false [2024-08-07 14:07:54,463 WARN L283 nessProductAutomaton]: assume !(0 == #t~mem11);havoc #t~mem10.base, #t~mem10.offset;havoc #t~mem11;, isNegated true [2024-08-07 14:07:54,464 WARN L283 nessProductAutomaton]: assume 0 == #t~mem11;havoc #t~mem10.base, #t~mem10.offset;havoc #t~mem11;, isNegated false [2024-08-07 14:07:54,464 WARN L283 nessProductAutomaton]: assume !(0 == #t~mem11);havoc #t~mem10.base, #t~mem10.offset;havoc #t~mem11;, isNegated true [2024-08-07 14:07:54,465 WARN L283 nessProductAutomaton]: assume 0 == #t~mem11;havoc #t~mem10.base, #t~mem10.offset;havoc #t~mem11;, isNegated false [2024-08-07 14:07:54,465 WARN L283 nessProductAutomaton]: assume !(0 == #t~mem11);havoc #t~mem10.base, #t~mem10.offset;havoc #t~mem11;, isNegated true [2024-08-07 14:07:54,467 WARN L283 nessProductAutomaton]: assume 0 == #t~mem11;havoc #t~mem10.base, #t~mem10.offset;havoc #t~mem11;, isNegated false [2024-08-07 14:07:54,468 WARN L283 nessProductAutomaton]: assume !(0 == #t~mem11);havoc #t~mem10.base, #t~mem10.offset;havoc #t~mem11;, isNegated true [2024-08-07 14:07:54,478 INFO L90 WitnessUtils]: NestedWordAutomaton nwa = ( callAlphabet = {"call ULTIMATE.init();" "call #t~ret9 := f(#t~mem8, ~#p1~0.base, ~#p1~0.offset, ~#p2~0.base, ~#p2~0.offset);" "call g(~p1.base, ~p1.offset, ~p2.base, ~p2.offset);" "call #t~ret12 := main();" }, internalAlphabet = {"assume false;#res := 1;call ULTIMATE.dealloc(~#a~0.base, ~#a~0.offset);havoc ~#a~0.base, ~#a~0.offset;call ULTIMATE.dealloc(~#b~0.base, ~#b~0.offset);havoc ~#b~0.base, ~#b~0.offset;call ULTIMATE.dealloc(~#p1~0.base, ~#p1~0.offset);havoc ~#p1~0.base, ~#p1~0.offset;call ULTIMATE.dealloc(~#p2~0.base, ~#p2~0.offset);havoc ~#p2~0.base, ~#p2~0.offset;" "assume false;" "assume !false;" "#res := 0;call ULTIMATE.dealloc(~#a~0.base, ~#a~0.offset);havoc ~#a~0.base, ~#a~0.offset;call ULTIMATE.dealloc(~#b~0.base, ~#b~0.offset);havoc ~#b~0.base, ~#b~0.offset;call ULTIMATE.dealloc(~#p1~0.base, ~#p1~0.offset);havoc ~#p1~0.base, ~#p1~0.offset;call ULTIMATE.dealloc(~#p2~0.base, ~#p2~0.offset);havoc ~#p2~0.base, ~#p2~0.offset;" "assume 0 == #t~mem11;havoc #t~mem10.base, #t~mem10.offset;havoc #t~mem11;" "assume !(0 == #t~mem11);havoc #t~mem10.base, #t~mem10.offset;havoc #t~mem11;" "assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;call write~int#1(#t~ret9, ~#a~0.base, ~#a~0.offset, 4);havoc #t~mem8;havoc #t~ret9;call #t~mem10.base, #t~mem10.offset := read~$Pointer$#3(~#p1~0.base, ~#p1~0.offset, 4);call #t~mem11 := read~int#1(#t~mem10.base, #t~mem10.offset, 4);" "SUMMARY for call #t~ret9 := f(#t~mem8, ~#p1~0.base, ~#p1~0.offset, ~#p2~0.base, ~#p2~0.offset); srcloc: L34-1" "call ~#a~0.base, ~#a~0.offset := #Ultimate.allocOnStack(4);call ~#b~0.base, ~#b~0.offset := #Ultimate.allocOnStack(4);call ~#p1~0.base, ~#p1~0.offset := #Ultimate.allocOnStack(4);call ~#p2~0.base, ~#p2~0.offset := #Ultimate.allocOnStack(4);call write~$Pointer$#3(~#a~0.base, ~#a~0.offset, ~#p1~0.base, ~#p1~0.offset, 4);call write~$Pointer$#2(~#b~0.base, ~#b~0.offset, ~#p2~0.base, ~#p2~0.offset, 4);call write~int#1(1, ~#b~0.base, ~#b~0.offset, 4);call write~int#1(5, ~#a~0.base, ~#a~0.offset, 4);call #t~mem6 := read~int#1(~#a~0.base, ~#a~0.offset, 4);#t~post7 := #t~mem6;call write~int#1(#t~post7 - 1, ~#a~0.base, ~#a~0.offset, 4);havoc #t~mem6;havoc #t~post7;call #t~mem8 := read~int#1(~#a~0.base, ~#a~0.offset, 4);" "assume true;" "#res := 1;" "SUMMARY for call g(~p1.base, ~p1.offset, ~p2.base, ~p2.offset); srcloc: L15-1" "assume !(4 == ~a);#res := 0;" "assume 4 == ~a;" "~a := #in~a;~p1.base, ~p1.offset := #in~p1.base, #in~p1.offset;~p2.base, ~p2.offset := #in~p2.base, #in~p2.offset;" "assume true;" "~p1.base, ~p1.offset := #in~p1.base, #in~p1.offset;~p2.base, ~p2.offset := #in~p2.base, #in~p2.offset;call #t~mem4.base, #t~mem4.offset := read~$Pointer$#2(~p2.base, ~p2.offset, 4);~pq~0.base, ~pq~0.offset := #t~mem4.base, #t~mem4.offset;havoc #t~mem4.base, #t~mem4.offset;call #t~mem5.base, #t~mem5.offset := read~$Pointer$#2(~p2.base, ~p2.offset, 4);call write~$Pointer$#3(#t~mem5.base, #t~mem5.offset, ~p1.base, ~p1.offset, 4);havoc #t~mem5.base, #t~mem5.offset;call write~int#1(0, ~pq~0.base, ~pq~0.offset, 4);" "assume true;" "assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);" "assume true;" "SUMMARY for call #t~ret12 := main(); srcloc: L-1" "SUMMARY for call ULTIMATE.init(); srcloc: ULTIMATE.startENTRY" "assume true;" }, returnAlphabet = {"#32#return;" "#34#return;" "#28#return;" "#30#return;" }, states = {"CountingPredicate [underlying: 26#mainFINALtrue, annotation: [1, 0]]" "CountingPredicate [underlying: 8#ULTIMATE.initEXITtrue, annotation: [0, 0]]" "CountingPredicate [underlying: 9#L40true, annotation: [1, 0]]" "CountingPredicate [underlying: 14#ULTIMATE.startENTRYtrue, annotation: [0, 0]]" "CountingPredicate [underlying: 26#mainFINALtrue, annotation: [5, 0]]" "CountingPredicate [underlying: 19#fENTRYtrue, annotation: [1, 0]]" "CountingPredicate [underlying: 22#L15true, annotation: [4, 0]]" "CountingPredicate [underlying: 6#L-1true, annotation: [0, 0]]" "CountingPredicate [underlying: 3#fEXITtrue, annotation: [1, 0]]" "CountingPredicate [underlying: 3#fEXITtrue, annotation: [4, 0]]" "CountingPredicate [underlying: 27#ULTIMATE.startFINALtrue, annotation: [7, 0]]" "CountingPredicate [underlying: 10#L15-1true, annotation: [2, 0]]" "CountingPredicate [underlying: 27#ULTIMATE.startFINALtrue, annotation: [5, 0]]" "CountingPredicate [underlying: 17#mainENTRYtrue, annotation: [0, 0]]" "CountingPredicate [underlying: 25#gEXITtrue, annotation: [3, 0]]" "CountingPredicate [underlying: 27#ULTIMATE.startFINALtrue, annotation: [1, 0]]" "CountingPredicate [underlying: 5#L34true, annotation: [1, 0]]" "CountingPredicate [underlying: 4#L14true, annotation: [1, 0]]" "CountingPredicate [underlying: 11#L36true, annotation: [5, 0]]" "CountingPredicate [underlying: 5#L34true, annotation: [5, 0]]" "CountingPredicate [underlying: 12#fFINALtrue, annotation: [1, 0]]" "CountingPredicate [underlying: 24#mainEXITtrue, annotation: [5, 0]]" "CountingPredicate [underlying: 13#ULTIMATE.initENTRYtrue, annotation: [0, 0]]" "CountingPredicate [underlying: 26#mainFINALtrue, annotation: [7, 0]]" "CountingPredicate [underlying: 16#gFINALtrue, annotation: [3, 0]]" "CountingPredicate [underlying: 11#L36true, annotation: [1, 0]]" "CountingPredicate [underlying: 24#mainEXITtrue, annotation: [7, 0]]" "CountingPredicate [underlying: 12#fFINALtrue, annotation: [4, 0]]" "CountingPredicate [underlying: 9#L40true, annotation: [5, 0]]" "CountingPredicate [underlying: 20#gENTRYtrue, annotation: [3, 0]]" "CountingPredicate [underlying: 18#L34-1true, annotation: [0, 0]]" "CountingPredicate [underlying: 24#mainEXITtrue, annotation: [1, 0]]" "CountingPredicate [underlying: 2#ULTIMATE.startEXITtrue, annotation: [1, 0]]" "CountingPredicate [underlying: 2#ULTIMATE.startEXITtrue, annotation: [7, 0]]" "CountingPredicate [underlying: 15#L42true, annotation: [7, 0]]" "CountingPredicate [underlying: 2#ULTIMATE.startEXITtrue, annotation: [5, 0]]" "CountingPredicate [underlying: 7#L37true, annotation: [6, 0]]" "CountingPredicate [underlying: 15#L42true, annotation: [1, 0]]" "CountingPredicate [underlying: 23#mainErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, annotation: [7, 0]]" "CountingPredicate [underlying: 7#L37true, annotation: [1, 0]]" "CountingPredicate [underlying: 21#ULTIMATE.initFINALtrue, annotation: [0, 0]]" "CountingPredicate [underlying: 23#mainErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, annotation: [1, 0]]" }, initialStates = {"CountingPredicate [underlying: 14#ULTIMATE.startENTRYtrue, annotation: [0, 0]]" }, finalStates = {"CountingPredicate [underlying: 23#mainErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, annotation: [7, 0]]" }, callTransitions = { ("CountingPredicate [underlying: 14#ULTIMATE.startENTRYtrue, annotation: [0, 0]]" "call ULTIMATE.init();" "CountingPredicate [underlying: 13#ULTIMATE.initENTRYtrue, annotation: [0, 0]]") ("CountingPredicate [underlying: 6#L-1true, annotation: [0, 0]]" "call #t~ret12 := main();" "CountingPredicate [underlying: 17#mainENTRYtrue, annotation: [0, 0]]") ("CountingPredicate [underlying: 10#L15-1true, annotation: [2, 0]]" "call g(~p1.base, ~p1.offset, ~p2.base, ~p2.offset);" "CountingPredicate [underlying: 20#gENTRYtrue, annotation: [3, 0]]") ("CountingPredicate [underlying: 18#L34-1true, annotation: [0, 0]]" "call #t~ret9 := f(#t~mem8, ~#p1~0.base, ~#p1~0.offset, ~#p2~0.base, ~#p2~0.offset);" "CountingPredicate [underlying: 19#fENTRYtrue, annotation: [1, 0]]") }, internalTransitions = { ("CountingPredicate [underlying: 26#mainFINALtrue, annotation: [1, 0]]" "assume true;" "CountingPredicate [underlying: 24#mainEXITtrue, annotation: [1, 0]]") ("CountingPredicate [underlying: 9#L40true, annotation: [1, 0]]" "#res := 0;call ULTIMATE.dealloc(~#a~0.base, ~#a~0.offset);havoc ~#a~0.base, ~#a~0.offset;call ULTIMATE.dealloc(~#b~0.base, ~#b~0.offset);havoc ~#b~0.base, ~#b~0.offset;call ULTIMATE.dealloc(~#p1~0.base, ~#p1~0.offset);havoc ~#p1~0.base, ~#p1~0.offset;call ULTIMATE.dealloc(~#p2~0.base, ~#p2~0.offset);havoc ~#p2~0.base, ~#p2~0.offset;" "CountingPredicate [underlying: 26#mainFINALtrue, annotation: [1, 0]]") ("CountingPredicate [underlying: 26#mainFINALtrue, annotation: [5, 0]]" "assume true;" "CountingPredicate [underlying: 24#mainEXITtrue, annotation: [5, 0]]") ("CountingPredicate [underlying: 19#fENTRYtrue, annotation: [1, 0]]" "~a := #in~a;~p1.base, ~p1.offset := #in~p1.base, #in~p1.offset;~p2.base, ~p2.offset := #in~p2.base, #in~p2.offset;" "CountingPredicate [underlying: 4#L14true, annotation: [1, 0]]") ("CountingPredicate [underlying: 22#L15true, annotation: [4, 0]]" "#res := 1;" "CountingPredicate [underlying: 12#fFINALtrue, annotation: [4, 0]]") ("CountingPredicate [underlying: 27#ULTIMATE.startFINALtrue, annotation: [7, 0]]" "assume true;" "CountingPredicate [underlying: 2#ULTIMATE.startEXITtrue, annotation: [7, 0]]") ("CountingPredicate [underlying: 27#ULTIMATE.startFINALtrue, annotation: [5, 0]]" "assume true;" "CountingPredicate [underlying: 2#ULTIMATE.startEXITtrue, annotation: [5, 0]]") ("CountingPredicate [underlying: 17#mainENTRYtrue, annotation: [0, 0]]" "call ~#a~0.base, ~#a~0.offset := #Ultimate.allocOnStack(4);call ~#b~0.base, ~#b~0.offset := #Ultimate.allocOnStack(4);call ~#p1~0.base, ~#p1~0.offset := #Ultimate.allocOnStack(4);call ~#p2~0.base, ~#p2~0.offset := #Ultimate.allocOnStack(4);call write~$Pointer$#3(~#a~0.base, ~#a~0.offset, ~#p1~0.base, ~#p1~0.offset, 4);call write~$Pointer$#2(~#b~0.base, ~#b~0.offset, ~#p2~0.base, ~#p2~0.offset, 4);call write~int#1(1, ~#b~0.base, ~#b~0.offset, 4);call write~int#1(5, ~#a~0.base, ~#a~0.offset, 4);call #t~mem6 := read~int#1(~#a~0.base, ~#a~0.offset, 4);#t~post7 := #t~mem6;call write~int#1(#t~post7 - 1, ~#a~0.base, ~#a~0.offset, 4);havoc #t~mem6;havoc #t~post7;call #t~mem8 := read~int#1(~#a~0.base, ~#a~0.offset, 4);" "CountingPredicate [underlying: 18#L34-1true, annotation: [0, 0]]") ("CountingPredicate [underlying: 27#ULTIMATE.startFINALtrue, annotation: [1, 0]]" "assume true;" "CountingPredicate [underlying: 2#ULTIMATE.startEXITtrue, annotation: [1, 0]]") ("CountingPredicate [underlying: 5#L34true, annotation: [1, 0]]" "assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;call write~int#1(#t~ret9, ~#a~0.base, ~#a~0.offset, 4);havoc #t~mem8;havoc #t~ret9;call #t~mem10.base, #t~mem10.offset := read~$Pointer$#3(~#p1~0.base, ~#p1~0.offset, 4);call #t~mem11 := read~int#1(#t~mem10.base, #t~mem10.offset, 4);" "CountingPredicate [underlying: 11#L36true, annotation: [1, 0]]") ("CountingPredicate [underlying: 4#L14true, annotation: [1, 0]]" "assume !(4 == ~a);#res := 0;" "CountingPredicate [underlying: 12#fFINALtrue, annotation: [1, 0]]") ("CountingPredicate [underlying: 4#L14true, annotation: [1, 0]]" "assume 4 == ~a;" "CountingPredicate [underlying: 10#L15-1true, annotation: [2, 0]]") ("CountingPredicate [underlying: 11#L36true, annotation: [5, 0]]" "assume 0 == #t~mem11;havoc #t~mem10.base, #t~mem10.offset;havoc #t~mem11;" "CountingPredicate [underlying: 7#L37true, annotation: [6, 0]]") ("CountingPredicate [underlying: 11#L36true, annotation: [5, 0]]" "assume !(0 == #t~mem11);havoc #t~mem10.base, #t~mem10.offset;havoc #t~mem11;" "CountingPredicate [underlying: 9#L40true, annotation: [5, 0]]") ("CountingPredicate [underlying: 5#L34true, annotation: [5, 0]]" "assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;call write~int#1(#t~ret9, ~#a~0.base, ~#a~0.offset, 4);havoc #t~mem8;havoc #t~ret9;call #t~mem10.base, #t~mem10.offset := read~$Pointer$#3(~#p1~0.base, ~#p1~0.offset, 4);call #t~mem11 := read~int#1(#t~mem10.base, #t~mem10.offset, 4);" "CountingPredicate [underlying: 11#L36true, annotation: [5, 0]]") ("CountingPredicate [underlying: 12#fFINALtrue, annotation: [1, 0]]" "assume true;" "CountingPredicate [underlying: 3#fEXITtrue, annotation: [1, 0]]") ("CountingPredicate [underlying: 13#ULTIMATE.initENTRYtrue, annotation: [0, 0]]" "assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);" "CountingPredicate [underlying: 21#ULTIMATE.initFINALtrue, annotation: [0, 0]]") ("CountingPredicate [underlying: 26#mainFINALtrue, annotation: [7, 0]]" "assume true;" "CountingPredicate [underlying: 24#mainEXITtrue, annotation: [7, 0]]") ("CountingPredicate [underlying: 16#gFINALtrue, annotation: [3, 0]]" "assume true;" "CountingPredicate [underlying: 25#gEXITtrue, annotation: [3, 0]]") ("CountingPredicate [underlying: 11#L36true, annotation: [1, 0]]" "assume 0 == #t~mem11;havoc #t~mem10.base, #t~mem10.offset;havoc #t~mem11;" "CountingPredicate [underlying: 7#L37true, annotation: [1, 0]]") ("CountingPredicate [underlying: 11#L36true, annotation: [1, 0]]" "assume !(0 == #t~mem11);havoc #t~mem10.base, #t~mem10.offset;havoc #t~mem11;" "CountingPredicate [underlying: 9#L40true, annotation: [1, 0]]") ("CountingPredicate [underlying: 12#fFINALtrue, annotation: [4, 0]]" "assume true;" "CountingPredicate [underlying: 3#fEXITtrue, annotation: [4, 0]]") ("CountingPredicate [underlying: 9#L40true, annotation: [5, 0]]" "#res := 0;call ULTIMATE.dealloc(~#a~0.base, ~#a~0.offset);havoc ~#a~0.base, ~#a~0.offset;call ULTIMATE.dealloc(~#b~0.base, ~#b~0.offset);havoc ~#b~0.base, ~#b~0.offset;call ULTIMATE.dealloc(~#p1~0.base, ~#p1~0.offset);havoc ~#p1~0.base, ~#p1~0.offset;call ULTIMATE.dealloc(~#p2~0.base, ~#p2~0.offset);havoc ~#p2~0.base, ~#p2~0.offset;" "CountingPredicate [underlying: 26#mainFINALtrue, annotation: [5, 0]]") ("CountingPredicate [underlying: 20#gENTRYtrue, annotation: [3, 0]]" "~p1.base, ~p1.offset := #in~p1.base, #in~p1.offset;~p2.base, ~p2.offset := #in~p2.base, #in~p2.offset;call #t~mem4.base, #t~mem4.offset := read~$Pointer$#2(~p2.base, ~p2.offset, 4);~pq~0.base, ~pq~0.offset := #t~mem4.base, #t~mem4.offset;havoc #t~mem4.base, #t~mem4.offset;call #t~mem5.base, #t~mem5.offset := read~$Pointer$#2(~p2.base, ~p2.offset, 4);call write~$Pointer$#3(#t~mem5.base, #t~mem5.offset, ~p1.base, ~p1.offset, 4);havoc #t~mem5.base, #t~mem5.offset;call write~int#1(0, ~pq~0.base, ~pq~0.offset, 4);" "CountingPredicate [underlying: 16#gFINALtrue, annotation: [3, 0]]") ("CountingPredicate [underlying: 15#L42true, annotation: [7, 0]]" "assume false;#res := 1;call ULTIMATE.dealloc(~#a~0.base, ~#a~0.offset);havoc ~#a~0.base, ~#a~0.offset;call ULTIMATE.dealloc(~#b~0.base, ~#b~0.offset);havoc ~#b~0.base, ~#b~0.offset;call ULTIMATE.dealloc(~#p1~0.base, ~#p1~0.offset);havoc ~#p1~0.base, ~#p1~0.offset;call ULTIMATE.dealloc(~#p2~0.base, ~#p2~0.offset);havoc ~#p2~0.base, ~#p2~0.offset;" "CountingPredicate [underlying: 26#mainFINALtrue, annotation: [7, 0]]") ("CountingPredicate [underlying: 7#L37true, annotation: [6, 0]]" "assume false;" "CountingPredicate [underlying: 15#L42true, annotation: [7, 0]]") ("CountingPredicate [underlying: 7#L37true, annotation: [6, 0]]" "assume !false;" "CountingPredicate [underlying: 23#mainErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, annotation: [7, 0]]") ("CountingPredicate [underlying: 15#L42true, annotation: [1, 0]]" "assume false;#res := 1;call ULTIMATE.dealloc(~#a~0.base, ~#a~0.offset);havoc ~#a~0.base, ~#a~0.offset;call ULTIMATE.dealloc(~#b~0.base, ~#b~0.offset);havoc ~#b~0.base, ~#b~0.offset;call ULTIMATE.dealloc(~#p1~0.base, ~#p1~0.offset);havoc ~#p1~0.base, ~#p1~0.offset;call ULTIMATE.dealloc(~#p2~0.base, ~#p2~0.offset);havoc ~#p2~0.base, ~#p2~0.offset;" "CountingPredicate [underlying: 26#mainFINALtrue, annotation: [1, 0]]") ("CountingPredicate [underlying: 7#L37true, annotation: [1, 0]]" "assume false;" "CountingPredicate [underlying: 15#L42true, annotation: [1, 0]]") ("CountingPredicate [underlying: 7#L37true, annotation: [1, 0]]" "assume !false;" "CountingPredicate [underlying: 23#mainErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, annotation: [1, 0]]") ("CountingPredicate [underlying: 21#ULTIMATE.initFINALtrue, annotation: [0, 0]]" "assume true;" "CountingPredicate [underlying: 8#ULTIMATE.initEXITtrue, annotation: [0, 0]]") }, returnTransitions = { ("CountingPredicate [underlying: 8#ULTIMATE.initEXITtrue, annotation: [0, 0]]" "CountingPredicate [underlying: 14#ULTIMATE.startENTRYtrue, annotation: [0, 0]]" "#34#return;" "CountingPredicate [underlying: 6#L-1true, annotation: [0, 0]]") ("CountingPredicate [underlying: 3#fEXITtrue, annotation: [1, 0]]" "CountingPredicate [underlying: 18#L34-1true, annotation: [0, 0]]" "#28#return;" "CountingPredicate [underlying: 5#L34true, annotation: [1, 0]]") ("CountingPredicate [underlying: 3#fEXITtrue, annotation: [4, 0]]" "CountingPredicate [underlying: 18#L34-1true, annotation: [0, 0]]" "#28#return;" "CountingPredicate [underlying: 5#L34true, annotation: [5, 0]]") ("CountingPredicate [underlying: 25#gEXITtrue, annotation: [3, 0]]" "CountingPredicate [underlying: 10#L15-1true, annotation: [2, 0]]" "#30#return;" "CountingPredicate [underlying: 22#L15true, annotation: [4, 0]]") ("CountingPredicate [underlying: 24#mainEXITtrue, annotation: [5, 0]]" "CountingPredicate [underlying: 6#L-1true, annotation: [0, 0]]" "#32#return;" "CountingPredicate [underlying: 27#ULTIMATE.startFINALtrue, annotation: [5, 0]]") ("CountingPredicate [underlying: 24#mainEXITtrue, annotation: [7, 0]]" "CountingPredicate [underlying: 6#L-1true, annotation: [0, 0]]" "#32#return;" "CountingPredicate [underlying: 27#ULTIMATE.startFINALtrue, annotation: [7, 0]]") ("CountingPredicate [underlying: 24#mainEXITtrue, annotation: [1, 0]]" "CountingPredicate [underlying: 6#L-1true, annotation: [0, 0]]" "#32#return;" "CountingPredicate [underlying: 27#ULTIMATE.startFINALtrue, annotation: [1, 0]]") } ); [2024-08-07 14:07:54,486 INFO L82 GeneralOperation]: Start removeDeadEnds. Operand has 26 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-08-07 14:07:54,488 WARN L283 nessProductAutomaton]: assume !(4 == ~a);#res := 0;, isNegated true [2024-08-07 14:07:54,488 WARN L283 nessProductAutomaton]: assume 4 == ~a;, isNegated false [2024-08-07 14:07:54,488 WARN L283 nessProductAutomaton]: assume !(4 == ~a);#res := 0;, isNegated true [2024-08-07 14:07:54,488 WARN L283 nessProductAutomaton]: assume 4 == ~a;, isNegated false [2024-08-07 14:07:54,489 WARN L283 nessProductAutomaton]: assume !(4 == ~a);#res := 0;, isNegated true [2024-08-07 14:07:54,489 WARN L283 nessProductAutomaton]: assume 4 == ~a;, isNegated false [2024-08-07 14:07:54,489 WARN L283 nessProductAutomaton]: assume !(4 == ~a);#res := 0;, isNegated true [2024-08-07 14:07:54,489 WARN L283 nessProductAutomaton]: assume 4 == ~a;, isNegated false [2024-08-07 14:07:54,490 WARN L283 nessProductAutomaton]: assume !(4 == ~a);#res := 0;, isNegated true [2024-08-07 14:07:54,490 WARN L283 nessProductAutomaton]: assume 4 == ~a;, isNegated false [2024-08-07 14:07:54,491 WARN L283 nessProductAutomaton]: assume !(4 == ~a);#res := 0;, isNegated true [2024-08-07 14:07:54,491 WARN L283 nessProductAutomaton]: assume 4 == ~a;, isNegated false [2024-08-07 14:07:54,493 WARN L283 nessProductAutomaton]: assume !(4 == ~a);#res := 0;, isNegated true [2024-08-07 14:07:54,493 WARN L283 nessProductAutomaton]: assume 4 == ~a;, isNegated false [2024-08-07 14:07:54,493 WARN L283 nessProductAutomaton]: assume !(4 == ~a);#res := 0;, isNegated true [2024-08-07 14:07:54,494 WARN L283 nessProductAutomaton]: assume 4 == ~a;, isNegated false [2024-08-07 14:07:54,495 WARN L283 nessProductAutomaton]: assume !(4 == ~a);#res := 0;, isNegated true [2024-08-07 14:07:54,495 WARN L283 nessProductAutomaton]: assume 4 == ~a;, isNegated false [2024-08-07 14:07:54,495 WARN L283 nessProductAutomaton]: assume !(4 == ~a);#res := 0;, isNegated true [2024-08-07 14:07:54,495 WARN L283 nessProductAutomaton]: assume 4 == ~a;, isNegated false [2024-08-07 14:07:54,496 WARN L283 nessProductAutomaton]: assume !(4 == ~a);#res := 0;, isNegated true [2024-08-07 14:07:54,497 WARN L283 nessProductAutomaton]: assume 4 == ~a;, isNegated false [2024-08-07 14:07:54,497 WARN L283 nessProductAutomaton]: assume !(4 == ~a);#res := 0;, isNegated true [2024-08-07 14:07:54,498 WARN L283 nessProductAutomaton]: assume 4 == ~a;, isNegated false [2024-08-07 14:07:54,498 WARN L283 nessProductAutomaton]: assume !(4 == ~a);#res := 0;, isNegated true [2024-08-07 14:07:54,499 WARN L283 nessProductAutomaton]: assume 4 == ~a;, isNegated false [2024-08-07 14:07:54,499 WARN L283 nessProductAutomaton]: assume 0 == #t~mem11;havoc #t~mem10.base, #t~mem10.offset;havoc #t~mem11;, isNegated false [2024-08-07 14:07:54,499 WARN L283 nessProductAutomaton]: assume !(0 == #t~mem11);havoc #t~mem10.base, #t~mem10.offset;havoc #t~mem11;, isNegated true [2024-08-07 14:07:54,499 WARN L283 nessProductAutomaton]: assume !(4 == ~a);#res := 0;, isNegated true [2024-08-07 14:07:54,500 WARN L283 nessProductAutomaton]: assume 4 == ~a;, isNegated false [2024-08-07 14:07:54,500 WARN L283 nessProductAutomaton]: assume 0 == #t~mem11;havoc #t~mem10.base, #t~mem10.offset;havoc #t~mem11;, isNegated false [2024-08-07 14:07:54,500 WARN L283 nessProductAutomaton]: assume !(0 == #t~mem11);havoc #t~mem10.base, #t~mem10.offset;havoc #t~mem11;, isNegated true [2024-08-07 14:07:54,501 WARN L283 nessProductAutomaton]: assume 0 == #t~mem11;havoc #t~mem10.base, #t~mem10.offset;havoc #t~mem11;, isNegated false [2024-08-07 14:07:54,502 WARN L283 nessProductAutomaton]: assume !(0 == #t~mem11);havoc #t~mem10.base, #t~mem10.offset;havoc #t~mem11;, isNegated true [2024-08-07 14:07:54,502 WARN L283 nessProductAutomaton]: assume 0 == #t~mem11;havoc #t~mem10.base, #t~mem10.offset;havoc #t~mem11;, isNegated false [2024-08-07 14:07:54,502 WARN L283 nessProductAutomaton]: assume !(0 == #t~mem11);havoc #t~mem10.base, #t~mem10.offset;havoc #t~mem11;, isNegated true [2024-08-07 14:07:54,503 WARN L283 nessProductAutomaton]: assume 0 == #t~mem11;havoc #t~mem10.base, #t~mem10.offset;havoc #t~mem11;, isNegated false [2024-08-07 14:07:54,503 WARN L283 nessProductAutomaton]: assume !(0 == #t~mem11);havoc #t~mem10.base, #t~mem10.offset;havoc #t~mem11;, isNegated true [2024-08-07 14:07:54,504 WARN L283 nessProductAutomaton]: assume 0 == #t~mem11;havoc #t~mem10.base, #t~mem10.offset;havoc #t~mem11;, isNegated false [2024-08-07 14:07:54,504 WARN L283 nessProductAutomaton]: assume !(0 == #t~mem11);havoc #t~mem10.base, #t~mem10.offset;havoc #t~mem11;, isNegated true [2024-08-07 14:07:54,504 WARN L283 nessProductAutomaton]: assume 0 == #t~mem11;havoc #t~mem10.base, #t~mem10.offset;havoc #t~mem11;, isNegated false [2024-08-07 14:07:54,505 WARN L283 nessProductAutomaton]: assume !(0 == #t~mem11);havoc #t~mem10.base, #t~mem10.offset;havoc #t~mem11;, isNegated true [2024-08-07 14:07:54,510 INFO L88 GeneralOperation]: Finished removeDeadEnds. Reduced from 42 states to 20 states. [2024-08-07 14:07:54,533 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-08-07 14:07:54,541 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@490874f8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-08-07 14:07:54,542 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-08-07 14:07:54,544 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states. [2024-08-07 14:07:54,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-08-07 14:07:54,551 INFO L187 NwaCegarLoop]: Found error trace [2024-08-07 14:07:54,552 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-08-07 14:07:54,553 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-07 14:07:54,572 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-07 14:07:54,572 INFO L85 PathProgramCache]: Analyzing trace with hash -1537909316, now seen corresponding path program 1 times [2024-08-07 14:07:54,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-07 14:07:54,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500070912] [2024-08-07 14:07:54,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-07 14:07:54,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-07 14:07:54,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-08-07 14:07:54,834 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-08-07 14:07:54,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-08-07 14:07:54,920 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-08-07 14:07:54,923 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-08-07 14:07:54,924 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-08-07 14:07:54,927 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-08-07 14:07:54,932 INFO L445 BasicCegarLoop]: Path program histogram: [1] [2024-08-07 14:07:54,946 INFO L196 ceAbstractionStarter]: Computing trace abstraction results [2024-08-07 14:07:54,972 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.08 02:07:54 BoogieIcfgContainer [2024-08-07 14:07:54,973 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-08-07 14:07:54,974 INFO L158 Benchmark]: Toolchain (without parser) took 1394.36ms. Allocated memory was 58.7MB in the beginning and 71.3MB in the end (delta: 12.6MB). Free memory was 34.4MB in the beginning and 47.9MB in the end (delta: -13.5MB). Peak memory consumption was 20.2MB. Max. memory is 16.1GB. [2024-08-07 14:07:54,975 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 48.2MB. Free memory was 32.8MB in the beginning and 32.7MB in the end (delta: 41.0kB). There was no memory consumed. Max. memory is 16.1GB. [2024-08-07 14:07:54,976 INFO L158 Benchmark]: Witness Parser took 0.09ms. Allocated memory is still 58.7MB. Free memory is still 36.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-08-07 14:07:54,976 INFO L158 Benchmark]: CACSL2BoogieTranslator took 257.25ms. Allocated memory is still 58.7MB. Free memory was 34.2MB in the beginning and 36.7MB in the end (delta: -2.5MB). Peak memory consumption was 11.3MB. Max. memory is 16.1GB. [2024-08-07 14:07:54,977 INFO L158 Benchmark]: Boogie Preprocessor took 64.68ms. Allocated memory is still 58.7MB. Free memory was 36.7MB in the beginning and 34.0MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-08-07 14:07:54,977 INFO L158 Benchmark]: IcfgBuilder took 464.13ms. Allocated memory was 58.7MB in the beginning and 71.3MB in the end (delta: 12.6MB). Free memory was 34.0MB in the beginning and 45.6MB in the end (delta: -11.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-08-07 14:07:54,978 INFO L158 Benchmark]: TraceAbstraction took 601.22ms. Allocated memory is still 71.3MB. Free memory was 45.0MB in the beginning and 47.9MB in the end (delta: -2.8MB). Peak memory consumption was 17.6MB. Max. memory is 16.1GB. [2024-08-07 14:07:54,981 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22ms. Allocated memory is still 48.2MB. Free memory was 32.8MB in the beginning and 32.7MB in the end (delta: 41.0kB). There was no memory consumed. Max. memory is 16.1GB. * Witness Parser took 0.09ms. Allocated memory is still 58.7MB. Free memory is still 36.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 257.25ms. Allocated memory is still 58.7MB. Free memory was 34.2MB in the beginning and 36.7MB in the end (delta: -2.5MB). Peak memory consumption was 11.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 64.68ms. Allocated memory is still 58.7MB. Free memory was 36.7MB in the beginning and 34.0MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 464.13ms. Allocated memory was 58.7MB in the beginning and 71.3MB in the end (delta: 12.6MB). Free memory was 34.0MB in the beginning and 45.6MB in the end (delta: -11.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 601.22ms. Allocated memory is still 71.3MB. Free memory was 45.0MB in the beginning and 47.9MB in the end (delta: -2.8MB). Peak memory consumption was 17.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 42]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L23] int a, b; [L24] int *p1, *p2; [L26] p1 = &a [L27] p2 = &b [L29] b = 1 [L30] a = 5 [L32] EXPR \read(a) [L32] a-- [L32] a-- [L34] EXPR \read(a) VAL [a={7:0}, p1={6:0}, p2={5:0}] [L34] CALL, EXPR f(a, &p1, &p2) VAL [\old(a)=4, \old(p1)={6:0}, \old(p2)={5:0}] [L14] a == 4 VAL [\old(a)=4, \old(p1)={6:0}, \old(p2)={5:0}, p1={6:0}, p2={5:0}] [L15] CALL g(p1, p2) VAL [\old(p1)={6:0}, \old(p2)={5:0}] [L7] EXPR \read(**p2) [L7] int *pq = *p2; [L9] EXPR \read(**p2) [L9] *p1 = *p2 [L10] *pq = 0 VAL [\old(p1)={6:0}, \old(p2)={5:0}] [L15] RET g(p1, p2) VAL [\old(a)=4, \old(p1)={6:0}, \old(p2)={5:0}, p1={6:0}, p2={5:0}] [L16] return 1; VAL [\old(a)=4, \old(p1)={6:0}, \old(p2)={5:0}, \result=1, p1={6:0}, p2={5:0}] [L34] RET, EXPR f(a, &p1, &p2) VAL [a={7:0}, p1={6:0}, p2={5:0}] [L34] a = f(a, &p1, &p2) [L36] EXPR \read(*p1) [L36] EXPR \read(*p1) VAL [p2={5:0}] [L36] *p1 == 0 [L42] reach_error() VAL [p2={5:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 29 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.5s, OverallIterations: 1, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=20occurred in iteration=0, InterpolantAutomatonStates: 0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 19 NumberOfCodeBlocks, 19 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-08-07 14:07:55,018 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE