./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix011_tso.oepc.i --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --validate ./goblint.2023-12-19_14-39-08.files/SV-COMP24_unreach-call/mix011_tso.oepc.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 80b1b132 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/pthread-wmm/mix011_tso.oepc.i ./goblint.2023-12-19_14-39-08.files/SV-COMP24_unreach-call/mix011_tso.oepc.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 --witnessparser.only.consider.loop.invariants false --- Real Ultimate output --- This is Ultimate 0.2.4-?-80b1b13-m [2024-01-31 17:34:29,160 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-01-31 17:34:29,214 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-01-31 17:34:29,220 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-01-31 17:34:29,221 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-01-31 17:34:29,246 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-01-31 17:34:29,247 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-01-31 17:34:29,247 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-01-31 17:34:29,248 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-01-31 17:34:29,251 INFO L153 SettingsManager]: * Use memory slicer=true [2024-01-31 17:34:29,251 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-01-31 17:34:29,251 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-01-31 17:34:29,252 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-01-31 17:34:29,253 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-01-31 17:34:29,253 INFO L153 SettingsManager]: * Use SBE=true [2024-01-31 17:34:29,253 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-01-31 17:34:29,254 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-01-31 17:34:29,254 INFO L153 SettingsManager]: * sizeof long=4 [2024-01-31 17:34:29,254 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-01-31 17:34:29,254 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-01-31 17:34:29,254 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-01-31 17:34:29,254 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-01-31 17:34:29,254 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-01-31 17:34:29,255 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-01-31 17:34:29,255 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-01-31 17:34:29,255 INFO L153 SettingsManager]: * sizeof long double=12 [2024-01-31 17:34:29,255 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-01-31 17:34:29,255 INFO L153 SettingsManager]: * Use constant arrays=true [2024-01-31 17:34:29,255 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-01-31 17:34:29,256 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-01-31 17:34:29,256 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-01-31 17:34:29,256 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-01-31 17:34:29,256 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-31 17:34:29,257 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-01-31 17:34:29,257 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-01-31 17:34:29,257 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-01-31 17:34:29,257 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-01-31 17:34:29,257 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-01-31 17:34:29,257 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-01-31 17:34:29,257 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-01-31 17:34:29,257 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-01-31 17:34:29,257 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-01-31 17:34:29,258 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-01-31 17:34:29,258 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.witnessparser: Only consider loop invariants -> false [2024-01-31 17:34:29,425 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-01-31 17:34:29,448 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-01-31 17:34:29,450 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-01-31 17:34:29,451 INFO L270 PluginConnector]: Initializing CDTParser... [2024-01-31 17:34:29,451 INFO L274 PluginConnector]: CDTParser initialized [2024-01-31 17:34:29,452 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix011_tso.oepc.i [2024-01-31 17:34:30,519 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-01-31 17:34:30,668 INFO L384 CDTParser]: Found 1 translation units. [2024-01-31 17:34:30,669 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix011_tso.oepc.i [2024-01-31 17:34:30,679 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e361111b3/f0e817cb9b7b4c89b03d6b8e779523b1/FLAGbddfcf267 [2024-01-31 17:34:30,689 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e361111b3/f0e817cb9b7b4c89b03d6b8e779523b1 [2024-01-31 17:34:30,691 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-01-31 17:34:30,692 INFO L274 PluginConnector]: Witness Parser initialized [2024-01-31 17:34:30,692 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./goblint.2023-12-19_14-39-08.files/SV-COMP24_unreach-call/mix011_tso.oepc.yml/witness.yml [2024-01-31 17:34:31,294 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-01-31 17:34:31,295 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-01-31 17:34:31,297 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-01-31 17:34:31,298 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-01-31 17:34:31,301 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-01-31 17:34:31,302 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 05:34:30" (1/2) ... [2024-01-31 17:34:31,304 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2dcaa12f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 05:34:31, skipping insertion in model container [2024-01-31 17:34:31,304 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 05:34:30" (1/2) ... [2024-01-31 17:34:31,305 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@23763f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 05:34:31, skipping insertion in model container [2024-01-31 17:34:31,306 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 31.01 05:34:31" (2/2) ... [2024-01-31 17:34:31,306 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2dcaa12f and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 31.01 05:34:31, skipping insertion in model container [2024-01-31 17:34:31,306 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 31.01 05:34:31" (2/2) ... [2024-01-31 17:34:31,306 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-01-31 17:34:33,307 INFO L96 nessWitnessExtractor]: Found the following entries in the witness: [2024-01-31 17:34:33,308 INFO L98 nessWitnessExtractor]: Location invariant before [L18-L18] expression == 0 [2024-01-31 17:34:33,308 INFO L98 nessWitnessExtractor]: Location invariant after [L18-L18] expression == 1 [2024-01-31 17:34:33,356 INFO L179 MainTranslator]: Built tables and reachable declarations [2024-01-31 17:34:33,459 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix011_tso.oepc.i[949,962] [2024-01-31 17:34:33,593 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-31 17:34:33,603 INFO L204 MainTranslator]: Completed pre-run [2024-01-31 17:34:33,614 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix011_tso.oepc.i[949,962] Start Parsing Local [2024-01-31 17:34:33,631 WARN L424 MainDispatcher]: Unable to annotate ; with a witness entry [2024-01-31 17:34:33,663 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-31 17:34:33,687 INFO L208 MainTranslator]: Completed translation [2024-01-31 17:34:33,688 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 31.01 05:34:33 WrapperNode [2024-01-31 17:34:33,688 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-01-31 17:34:33,689 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-01-31 17:34:33,689 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-01-31 17:34:33,689 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-01-31 17:34:33,694 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 31.01 05:34:33" (1/1) ... [2024-01-31 17:34:33,721 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 31.01 05:34:33" (1/1) ... [2024-01-31 17:34:33,754 INFO L138 Inliner]: procedures = 176, calls = 60, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 155 [2024-01-31 17:34:33,754 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-01-31 17:34:33,755 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-01-31 17:34:33,756 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-01-31 17:34:33,756 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-01-31 17:34:33,764 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 31.01 05:34:33" (1/1) ... [2024-01-31 17:34:33,764 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 31.01 05:34:33" (1/1) ... [2024-01-31 17:34:33,778 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 31.01 05:34:33" (1/1) ... [2024-01-31 17:34:33,796 INFO L175 MemorySlicer]: Split 5 memory accesses to 4 slices as follows [2, 1, 1, 1]. 40 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0]. The 3 writes are split as follows [0, 1, 1, 1]. [2024-01-31 17:34:33,800 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 31.01 05:34:33" (1/1) ... [2024-01-31 17:34:33,800 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 31.01 05:34:33" (1/1) ... [2024-01-31 17:34:33,810 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 31.01 05:34:33" (1/1) ... [2024-01-31 17:34:33,817 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 31.01 05:34:33" (1/1) ... [2024-01-31 17:34:33,818 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 31.01 05:34:33" (1/1) ... [2024-01-31 17:34:33,824 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 31.01 05:34:33" (1/1) ... [2024-01-31 17:34:33,826 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-01-31 17:34:33,829 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-01-31 17:34:33,830 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-01-31 17:34:33,830 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-01-31 17:34:33,830 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 31.01 05:34:33" (1/1) ... [2024-01-31 17:34:33,835 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-31 17:34:33,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-31 17:34:33,860 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-01-31 17:34:33,876 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-01-31 17:34:33,896 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-01-31 17:34:33,896 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-01-31 17:34:33,896 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-01-31 17:34:33,897 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-01-31 17:34:33,897 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-01-31 17:34:33,897 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-01-31 17:34:33,897 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-01-31 17:34:33,897 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-01-31 17:34:33,898 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-01-31 17:34:33,898 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-01-31 17:34:33,898 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-01-31 17:34:33,898 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-01-31 17:34:33,898 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-01-31 17:34:33,898 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-01-31 17:34:33,899 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-01-31 17:34:33,899 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-01-31 17:34:33,900 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-01-31 17:34:33,900 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-01-31 17:34:33,900 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-01-31 17:34:33,900 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-01-31 17:34:33,901 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-01-31 17:34:33,902 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-01-31 17:34:34,018 INFO L244 CfgBuilder]: Building ICFG [2024-01-31 17:34:34,019 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-01-31 17:34:34,253 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-01-31 17:34:34,254 INFO L293 CfgBuilder]: Performing block encoding [2024-01-31 17:34:34,391 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-01-31 17:34:34,392 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-01-31 17:34:34,392 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 05:34:34 BoogieIcfgContainer [2024-01-31 17:34:34,392 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-01-31 17:34:34,395 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-01-31 17:34:34,395 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-01-31 17:34:34,397 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-01-31 17:34:34,397 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.01 05:34:30" (1/4) ... [2024-01-31 17:34:34,398 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@255fde90 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 05:34:34, skipping insertion in model container [2024-01-31 17:34:34,398 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 31.01 05:34:31" (2/4) ... [2024-01-31 17:34:34,398 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@255fde90 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 31.01 05:34:34, skipping insertion in model container [2024-01-31 17:34:34,398 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 31.01 05:34:33" (3/4) ... [2024-01-31 17:34:34,399 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@255fde90 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 31.01 05:34:34, skipping insertion in model container [2024-01-31 17:34:34,399 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 05:34:34" (4/4) ... [2024-01-31 17:34:34,400 INFO L112 eAbstractionObserver]: Analyzing ICFG mix011_tso.oepc.i [2024-01-31 17:34:34,412 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-01-31 17:34:34,412 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-01-31 17:34:34,412 INFO L518 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-01-31 17:34:34,448 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-01-31 17:34:34,476 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 54 places, 45 transitions, 102 flow [2024-01-31 17:34:34,493 INFO L124 PetriNetUnfolderBase]: 1/42 cut-off events. [2024-01-31 17:34:34,493 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-31 17:34:34,497 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52 conditions, 42 events. 1/42 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 83 event pairs, 0 based on Foata normal form. 0/37 useless extension candidates. Maximal degree in co-relation 44. Up to 2 conditions per place. [2024-01-31 17:34:34,497 INFO L82 GeneralOperation]: Start removeDead. Operand has 54 places, 45 transitions, 102 flow [2024-01-31 17:34:34,499 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 51 places, 42 transitions, 93 flow [2024-01-31 17:34:34,505 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-01-31 17:34:34,510 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;@55df2e28, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-01-31 17:34:34,510 INFO L358 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2024-01-31 17:34:34,516 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-01-31 17:34:34,517 INFO L124 PetriNetUnfolderBase]: 0/10 cut-off events. [2024-01-31 17:34:34,517 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-31 17:34:34,517 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 17:34:34,517 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-01-31 17:34:34,518 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P1Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-01-31 17:34:34,521 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 17:34:34,522 INFO L85 PathProgramCache]: Analyzing trace with hash -1439114010, now seen corresponding path program 1 times [2024-01-31 17:34:34,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 17:34:34,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860899795] [2024-01-31 17:34:34,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 17:34:34,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 17:34:34,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 17:34:34,721 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 17:34:34,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 17:34:34,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860899795] [2024-01-31 17:34:34,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1860899795] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 17:34:34,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 17:34:34,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-31 17:34:34,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836161712] [2024-01-31 17:34:34,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 17:34:34,729 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-01-31 17:34:34,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 17:34:34,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-01-31 17:34:34,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-01-31 17:34:34,753 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 45 [2024-01-31 17:34:34,755 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 42 transitions, 93 flow. Second operand has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-31 17:34:34,755 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 17:34:34,756 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 45 [2024-01-31 17:34:34,756 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 17:34:34,969 INFO L124 PetriNetUnfolderBase]: 676/1392 cut-off events. [2024-01-31 17:34:34,970 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-31 17:34:34,975 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2463 conditions, 1392 events. 676/1392 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 9690 event pairs, 676 based on Foata normal form. 45/1215 useless extension candidates. Maximal degree in co-relation 2452. Up to 1029 conditions per place. [2024-01-31 17:34:34,983 INFO L140 encePairwiseOnDemand]: 43/45 looper letters, 20 selfloop transitions, 0 changer transitions 0/40 dead transitions. [2024-01-31 17:34:34,984 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 40 transitions, 129 flow [2024-01-31 17:34:34,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-31 17:34:34,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2024-01-31 17:34:34,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 68 transitions. [2024-01-31 17:34:34,993 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7555555555555555 [2024-01-31 17:34:34,995 INFO L175 Difference]: Start difference. First operand has 51 places, 42 transitions, 93 flow. Second operand 2 states and 68 transitions. [2024-01-31 17:34:34,995 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 40 transitions, 129 flow [2024-01-31 17:34:34,998 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 40 transitions, 126 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-01-31 17:34:35,000 INFO L231 Difference]: Finished difference. Result has 48 places, 40 transitions, 86 flow [2024-01-31 17:34:35,001 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=86, PETRI_PLACES=48, PETRI_TRANSITIONS=40} [2024-01-31 17:34:35,004 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, -3 predicate places. [2024-01-31 17:34:35,004 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 40 transitions, 86 flow [2024-01-31 17:34:35,004 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-31 17:34:35,004 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 17:34:35,004 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-01-31 17:34:35,005 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-01-31 17:34:35,005 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P1Err1ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P1Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-01-31 17:34:35,005 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 17:34:35,005 INFO L85 PathProgramCache]: Analyzing trace with hash -1439114009, now seen corresponding path program 1 times [2024-01-31 17:34:35,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 17:34:35,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25740040] [2024-01-31 17:34:35,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 17:34:35,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 17:34:35,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 17:34:35,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 17:34:35,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 17:34:35,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25740040] [2024-01-31 17:34:35,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [25740040] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 17:34:35,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 17:34:35,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-31 17:34:35,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265173819] [2024-01-31 17:34:35,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 17:34:35,200 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-31 17:34:35,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 17:34:35,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-31 17:34:35,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-31 17:34:35,201 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 45 [2024-01-31 17:34:35,201 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 40 transitions, 86 flow. Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-31 17:34:35,201 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 17:34:35,202 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 45 [2024-01-31 17:34:35,202 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 17:34:35,370 INFO L124 PetriNetUnfolderBase]: 528/1058 cut-off events. [2024-01-31 17:34:35,370 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-31 17:34:35,372 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1904 conditions, 1058 events. 528/1058 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 6480 event pairs, 168 based on Foata normal form. 0/1022 useless extension candidates. Maximal degree in co-relation 1901. Up to 652 conditions per place. [2024-01-31 17:34:35,376 INFO L140 encePairwiseOnDemand]: 42/45 looper letters, 27 selfloop transitions, 2 changer transitions 2/51 dead transitions. [2024-01-31 17:34:35,376 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 51 transitions, 172 flow [2024-01-31 17:34:35,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-31 17:34:35,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-31 17:34:35,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 101 transitions. [2024-01-31 17:34:35,377 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7481481481481481 [2024-01-31 17:34:35,377 INFO L175 Difference]: Start difference. First operand has 48 places, 40 transitions, 86 flow. Second operand 3 states and 101 transitions. [2024-01-31 17:34:35,377 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 51 transitions, 172 flow [2024-01-31 17:34:35,378 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 51 transitions, 172 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-01-31 17:34:35,379 INFO L231 Difference]: Finished difference. Result has 49 places, 38 transitions, 86 flow [2024-01-31 17:34:35,379 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=86, PETRI_PLACES=49, PETRI_TRANSITIONS=38} [2024-01-31 17:34:35,380 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, -2 predicate places. [2024-01-31 17:34:35,380 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 38 transitions, 86 flow [2024-01-31 17:34:35,380 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-31 17:34:35,380 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 17:34:35,380 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-31 17:34:35,380 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-01-31 17:34:35,381 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P1Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-01-31 17:34:35,381 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 17:34:35,381 INFO L85 PathProgramCache]: Analyzing trace with hash 911237060, now seen corresponding path program 1 times [2024-01-31 17:34:35,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 17:34:35,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16654743] [2024-01-31 17:34:35,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 17:34:35,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 17:34:35,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 17:34:35,424 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 17:34:35,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 17:34:35,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16654743] [2024-01-31 17:34:35,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [16654743] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 17:34:35,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 17:34:35,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-31 17:34:35,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802239052] [2024-01-31 17:34:35,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 17:34:35,425 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-31 17:34:35,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 17:34:35,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-31 17:34:35,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-31 17:34:35,429 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 45 [2024-01-31 17:34:35,429 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 38 transitions, 86 flow. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-31 17:34:35,430 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 17:34:35,430 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 45 [2024-01-31 17:34:35,430 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 17:34:35,563 INFO L124 PetriNetUnfolderBase]: 678/1184 cut-off events. [2024-01-31 17:34:35,564 INFO L125 PetriNetUnfolderBase]: For 87/87 co-relation queries the response was YES. [2024-01-31 17:34:35,566 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2341 conditions, 1184 events. 678/1184 cut-off events. For 87/87 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 7392 event pairs, 528 based on Foata normal form. 0/1094 useless extension candidates. Maximal degree in co-relation 2337. Up to 812 conditions per place. [2024-01-31 17:34:35,570 INFO L140 encePairwiseOnDemand]: 43/45 looper letters, 26 selfloop transitions, 1 changer transitions 1/44 dead transitions. [2024-01-31 17:34:35,570 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 44 transitions, 156 flow [2024-01-31 17:34:35,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-31 17:34:35,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-31 17:34:35,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 86 transitions. [2024-01-31 17:34:35,571 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6370370370370371 [2024-01-31 17:34:35,572 INFO L175 Difference]: Start difference. First operand has 49 places, 38 transitions, 86 flow. Second operand 3 states and 86 transitions. [2024-01-31 17:34:35,572 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 44 transitions, 156 flow [2024-01-31 17:34:35,572 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 44 transitions, 150 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-31 17:34:35,573 INFO L231 Difference]: Finished difference. Result has 47 places, 36 transitions, 80 flow [2024-01-31 17:34:35,574 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=80, PETRI_PLACES=47, PETRI_TRANSITIONS=36} [2024-01-31 17:34:35,574 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, -4 predicate places. [2024-01-31 17:34:35,574 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 36 transitions, 80 flow [2024-01-31 17:34:35,575 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-31 17:34:35,575 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 17:34:35,575 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-31 17:34:35,575 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-01-31 17:34:35,575 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P1Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-01-31 17:34:35,575 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 17:34:35,576 INFO L85 PathProgramCache]: Analyzing trace with hash -1816421848, now seen corresponding path program 1 times [2024-01-31 17:34:35,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 17:34:35,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070408912] [2024-01-31 17:34:35,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 17:34:35,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 17:34:35,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 17:34:35,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 17:34:35,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 17:34:35,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070408912] [2024-01-31 17:34:35,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1070408912] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 17:34:35,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 17:34:35,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-31 17:34:35,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391353017] [2024-01-31 17:34:35,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 17:34:35,831 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-31 17:34:35,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 17:34:35,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-31 17:34:35,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-31 17:34:35,838 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 45 [2024-01-31 17:34:35,838 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 36 transitions, 80 flow. Second operand has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-31 17:34:35,838 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 17:34:35,838 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 45 [2024-01-31 17:34:35,839 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 17:34:36,035 INFO L124 PetriNetUnfolderBase]: 1213/2081 cut-off events. [2024-01-31 17:34:36,036 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-31 17:34:36,039 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4045 conditions, 2081 events. 1213/2081 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 145. Compared 12783 event pairs, 147 based on Foata normal form. 80/2095 useless extension candidates. Maximal degree in co-relation 4041. Up to 1081 conditions per place. [2024-01-31 17:34:36,045 INFO L140 encePairwiseOnDemand]: 39/45 looper letters, 39 selfloop transitions, 5 changer transitions 1/59 dead transitions. [2024-01-31 17:34:36,045 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 59 transitions, 220 flow [2024-01-31 17:34:36,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-31 17:34:36,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-31 17:34:36,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 123 transitions. [2024-01-31 17:34:36,052 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6833333333333333 [2024-01-31 17:34:36,052 INFO L175 Difference]: Start difference. First operand has 47 places, 36 transitions, 80 flow. Second operand 4 states and 123 transitions. [2024-01-31 17:34:36,052 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 59 transitions, 220 flow [2024-01-31 17:34:36,054 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 59 transitions, 219 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-01-31 17:34:36,055 INFO L231 Difference]: Finished difference. Result has 50 places, 39 transitions, 113 flow [2024-01-31 17:34:36,055 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=79, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=113, PETRI_PLACES=50, PETRI_TRANSITIONS=39} [2024-01-31 17:34:36,056 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, -1 predicate places. [2024-01-31 17:34:36,056 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 39 transitions, 113 flow [2024-01-31 17:34:36,056 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-31 17:34:36,056 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 17:34:36,056 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-31 17:34:36,056 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-01-31 17:34:36,057 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P1Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-01-31 17:34:36,057 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 17:34:36,057 INFO L85 PathProgramCache]: Analyzing trace with hash 2045780885, now seen corresponding path program 1 times [2024-01-31 17:34:36,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 17:34:36,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086709678] [2024-01-31 17:34:36,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 17:34:36,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 17:34:36,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 17:34:36,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 17:34:36,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 17:34:36,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086709678] [2024-01-31 17:34:36,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1086709678] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 17:34:36,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 17:34:36,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-01-31 17:34:36,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198022317] [2024-01-31 17:34:36,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 17:34:36,238 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-01-31 17:34:36,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 17:34:36,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-01-31 17:34:36,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-01-31 17:34:36,242 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 45 [2024-01-31 17:34:36,243 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 39 transitions, 113 flow. Second operand has 5 states, 5 states have (on average 21.8) internal successors, (109), 5 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-31 17:34:36,243 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 17:34:36,243 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 45 [2024-01-31 17:34:36,243 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 17:34:36,452 INFO L124 PetriNetUnfolderBase]: 809/1409 cut-off events. [2024-01-31 17:34:36,452 INFO L125 PetriNetUnfolderBase]: For 382/382 co-relation queries the response was YES. [2024-01-31 17:34:36,454 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3252 conditions, 1409 events. 809/1409 cut-off events. For 382/382 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 7750 event pairs, 73 based on Foata normal form. 68/1426 useless extension candidates. Maximal degree in co-relation 3246. Up to 521 conditions per place. [2024-01-31 17:34:36,458 INFO L140 encePairwiseOnDemand]: 39/45 looper letters, 49 selfloop transitions, 8 changer transitions 1/72 dead transitions. [2024-01-31 17:34:36,458 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 72 transitions, 316 flow [2024-01-31 17:34:36,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-31 17:34:36,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-01-31 17:34:36,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 155 transitions. [2024-01-31 17:34:36,460 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6888888888888889 [2024-01-31 17:34:36,461 INFO L175 Difference]: Start difference. First operand has 50 places, 39 transitions, 113 flow. Second operand 5 states and 155 transitions. [2024-01-31 17:34:36,461 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 72 transitions, 316 flow [2024-01-31 17:34:36,462 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 72 transitions, 306 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-01-31 17:34:36,462 INFO L231 Difference]: Finished difference. Result has 54 places, 42 transitions, 153 flow [2024-01-31 17:34:36,463 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=105, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=153, PETRI_PLACES=54, PETRI_TRANSITIONS=42} [2024-01-31 17:34:36,463 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 3 predicate places. [2024-01-31 17:34:36,463 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 42 transitions, 153 flow [2024-01-31 17:34:36,463 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.8) internal successors, (109), 5 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-31 17:34:36,464 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 17:34:36,464 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-31 17:34:36,464 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-01-31 17:34:36,464 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P1Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-01-31 17:34:36,464 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 17:34:36,465 INFO L85 PathProgramCache]: Analyzing trace with hash -1604056152, now seen corresponding path program 1 times [2024-01-31 17:34:36,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 17:34:36,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951822209] [2024-01-31 17:34:36,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 17:34:36,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 17:34:36,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 17:34:36,632 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 17:34:36,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 17:34:36,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951822209] [2024-01-31 17:34:36,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [951822209] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 17:34:36,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 17:34:36,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-01-31 17:34:36,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494060023] [2024-01-31 17:34:36,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 17:34:36,634 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-01-31 17:34:36,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 17:34:36,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-01-31 17:34:36,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-01-31 17:34:36,641 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 45 [2024-01-31 17:34:36,641 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 42 transitions, 153 flow. Second operand has 6 states, 6 states have (on average 21.666666666666668) internal successors, (130), 6 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-31 17:34:36,642 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 17:34:36,642 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 45 [2024-01-31 17:34:36,642 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 17:34:36,772 INFO L124 PetriNetUnfolderBase]: 477/821 cut-off events. [2024-01-31 17:34:36,772 INFO L125 PetriNetUnfolderBase]: For 677/677 co-relation queries the response was YES. [2024-01-31 17:34:36,773 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2142 conditions, 821 events. 477/821 cut-off events. For 677/677 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 3731 event pairs, 59 based on Foata normal form. 36/814 useless extension candidates. Maximal degree in co-relation 2135. Up to 268 conditions per place. [2024-01-31 17:34:36,776 INFO L140 encePairwiseOnDemand]: 39/45 looper letters, 43 selfloop transitions, 11 changer transitions 1/69 dead transitions. [2024-01-31 17:34:36,776 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 69 transitions, 327 flow [2024-01-31 17:34:36,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-01-31 17:34:36,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-01-31 17:34:36,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 171 transitions. [2024-01-31 17:34:36,777 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6333333333333333 [2024-01-31 17:34:36,777 INFO L175 Difference]: Start difference. First operand has 54 places, 42 transitions, 153 flow. Second operand 6 states and 171 transitions. [2024-01-31 17:34:36,777 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 69 transitions, 327 flow [2024-01-31 17:34:36,780 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 69 transitions, 302 flow, removed 4 selfloop flow, removed 4 redundant places. [2024-01-31 17:34:36,780 INFO L231 Difference]: Finished difference. Result has 57 places, 42 transitions, 167 flow [2024-01-31 17:34:36,781 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=131, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=167, PETRI_PLACES=57, PETRI_TRANSITIONS=42} [2024-01-31 17:34:36,781 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 6 predicate places. [2024-01-31 17:34:36,781 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 42 transitions, 167 flow [2024-01-31 17:34:36,782 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.666666666666668) internal successors, (130), 6 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-31 17:34:36,782 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 17:34:36,782 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-31 17:34:36,782 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-01-31 17:34:36,782 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P1Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-01-31 17:34:36,782 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 17:34:36,783 INFO L85 PathProgramCache]: Analyzing trace with hash 214134470, now seen corresponding path program 1 times [2024-01-31 17:34:36,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 17:34:36,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83948407] [2024-01-31 17:34:36,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 17:34:36,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 17:34:36,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 17:34:37,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 17:34:37,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 17:34:37,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83948407] [2024-01-31 17:34:37,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [83948407] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 17:34:37,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 17:34:37,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-01-31 17:34:37,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632339628] [2024-01-31 17:34:37,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 17:34:37,218 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-01-31 17:34:37,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 17:34:37,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-01-31 17:34:37,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-01-31 17:34:37,244 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 45 [2024-01-31 17:34:37,244 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 42 transitions, 167 flow. Second operand has 7 states, 7 states have (on average 19.142857142857142) internal successors, (134), 7 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-31 17:34:37,245 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 17:34:37,245 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 45 [2024-01-31 17:34:37,245 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 17:34:37,578 INFO L124 PetriNetUnfolderBase]: 973/1740 cut-off events. [2024-01-31 17:34:37,578 INFO L125 PetriNetUnfolderBase]: For 734/754 co-relation queries the response was YES. [2024-01-31 17:34:37,581 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4016 conditions, 1740 events. 973/1740 cut-off events. For 734/754 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 9574 event pairs, 196 based on Foata normal form. 8/1709 useless extension candidates. Maximal degree in co-relation 4008. Up to 824 conditions per place. [2024-01-31 17:34:37,585 INFO L140 encePairwiseOnDemand]: 36/45 looper letters, 34 selfloop transitions, 4 changer transitions 35/90 dead transitions. [2024-01-31 17:34:37,585 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 90 transitions, 427 flow [2024-01-31 17:34:37,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-01-31 17:34:37,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-01-31 17:34:37,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 202 transitions. [2024-01-31 17:34:37,586 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5611111111111111 [2024-01-31 17:34:37,586 INFO L175 Difference]: Start difference. First operand has 57 places, 42 transitions, 167 flow. Second operand 8 states and 202 transitions. [2024-01-31 17:34:37,586 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 90 transitions, 427 flow [2024-01-31 17:34:37,591 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 90 transitions, 363 flow, removed 14 selfloop flow, removed 8 redundant places. [2024-01-31 17:34:37,592 INFO L231 Difference]: Finished difference. Result has 62 places, 44 transitions, 145 flow [2024-01-31 17:34:37,592 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=111, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=145, PETRI_PLACES=62, PETRI_TRANSITIONS=44} [2024-01-31 17:34:37,592 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 11 predicate places. [2024-01-31 17:34:37,593 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 44 transitions, 145 flow [2024-01-31 17:34:37,593 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.142857142857142) internal successors, (134), 7 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-31 17:34:37,593 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 17:34:37,593 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-31 17:34:37,593 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-01-31 17:34:37,593 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P1Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-01-31 17:34:37,594 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 17:34:37,594 INFO L85 PathProgramCache]: Analyzing trace with hash -2073507796, now seen corresponding path program 2 times [2024-01-31 17:34:37,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 17:34:37,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698726984] [2024-01-31 17:34:37,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 17:34:37,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 17:34:37,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 17:34:37,836 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 17:34:37,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 17:34:37,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698726984] [2024-01-31 17:34:37,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1698726984] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 17:34:37,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 17:34:37,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-01-31 17:34:37,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551415192] [2024-01-31 17:34:37,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 17:34:37,838 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-01-31 17:34:37,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 17:34:37,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-01-31 17:34:37,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-01-31 17:34:37,851 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 45 [2024-01-31 17:34:37,851 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 44 transitions, 145 flow. Second operand has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 6 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-31 17:34:37,852 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 17:34:37,853 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 45 [2024-01-31 17:34:37,853 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 17:34:38,035 INFO L124 PetriNetUnfolderBase]: 600/1178 cut-off events. [2024-01-31 17:34:38,037 INFO L125 PetriNetUnfolderBase]: For 207/209 co-relation queries the response was YES. [2024-01-31 17:34:38,040 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2597 conditions, 1178 events. 600/1178 cut-off events. For 207/209 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 6729 event pairs, 209 based on Foata normal form. 8/1130 useless extension candidates. Maximal degree in co-relation 2587. Up to 467 conditions per place. [2024-01-31 17:34:38,042 INFO L140 encePairwiseOnDemand]: 40/45 looper letters, 24 selfloop transitions, 1 changer transitions 23/68 dead transitions. [2024-01-31 17:34:38,042 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 68 transitions, 298 flow [2024-01-31 17:34:38,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-01-31 17:34:38,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-01-31 17:34:38,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 161 transitions. [2024-01-31 17:34:38,043 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5962962962962963 [2024-01-31 17:34:38,043 INFO L175 Difference]: Start difference. First operand has 62 places, 44 transitions, 145 flow. Second operand 6 states and 161 transitions. [2024-01-31 17:34:38,043 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 68 transitions, 298 flow [2024-01-31 17:34:38,045 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 68 transitions, 288 flow, removed 5 selfloop flow, removed 3 redundant places. [2024-01-31 17:34:38,046 INFO L231 Difference]: Finished difference. Result has 64 places, 42 transitions, 139 flow [2024-01-31 17:34:38,046 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=139, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=139, PETRI_PLACES=64, PETRI_TRANSITIONS=42} [2024-01-31 17:34:38,048 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 13 predicate places. [2024-01-31 17:34:38,048 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 42 transitions, 139 flow [2024-01-31 17:34:38,049 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 6 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-31 17:34:38,049 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 17:34:38,049 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-31 17:34:38,049 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-01-31 17:34:38,049 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P1Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-01-31 17:34:38,049 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 17:34:38,050 INFO L85 PathProgramCache]: Analyzing trace with hash -309644658, now seen corresponding path program 3 times [2024-01-31 17:34:38,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 17:34:38,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720706106] [2024-01-31 17:34:38,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 17:34:38,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 17:34:38,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 17:34:39,066 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 17:34:39,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 17:34:39,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720706106] [2024-01-31 17:34:39,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [720706106] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 17:34:39,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 17:34:39,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-01-31 17:34:39,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624179135] [2024-01-31 17:34:39,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 17:34:39,068 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-01-31 17:34:39,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 17:34:39,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-01-31 17:34:39,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-01-31 17:34:39,088 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 45 [2024-01-31 17:34:39,089 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 42 transitions, 139 flow. Second operand has 11 states, 11 states have (on average 21.636363636363637) internal successors, (238), 11 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-31 17:34:39,089 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 17:34:39,091 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 45 [2024-01-31 17:34:39,091 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 17:34:39,426 INFO L124 PetriNetUnfolderBase]: 696/1349 cut-off events. [2024-01-31 17:34:39,427 INFO L125 PetriNetUnfolderBase]: For 69/75 co-relation queries the response was YES. [2024-01-31 17:34:39,429 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2911 conditions, 1349 events. 696/1349 cut-off events. For 69/75 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 7449 event pairs, 286 based on Foata normal form. 10/1282 useless extension candidates. Maximal degree in co-relation 2899. Up to 361 conditions per place. [2024-01-31 17:34:39,432 INFO L140 encePairwiseOnDemand]: 37/45 looper letters, 36 selfloop transitions, 4 changer transitions 23/84 dead transitions. [2024-01-31 17:34:39,432 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 84 transitions, 372 flow [2024-01-31 17:34:39,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-01-31 17:34:39,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-01-31 17:34:39,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 224 transitions. [2024-01-31 17:34:39,434 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6222222222222222 [2024-01-31 17:34:39,434 INFO L175 Difference]: Start difference. First operand has 64 places, 42 transitions, 139 flow. Second operand 8 states and 224 transitions. [2024-01-31 17:34:39,434 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 84 transitions, 372 flow [2024-01-31 17:34:39,435 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 84 transitions, 353 flow, removed 8 selfloop flow, removed 5 redundant places. [2024-01-31 17:34:39,436 INFO L231 Difference]: Finished difference. Result has 68 places, 44 transitions, 160 flow [2024-01-31 17:34:39,436 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=160, PETRI_PLACES=68, PETRI_TRANSITIONS=44} [2024-01-31 17:34:39,437 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 17 predicate places. [2024-01-31 17:34:39,437 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 44 transitions, 160 flow [2024-01-31 17:34:39,437 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 21.636363636363637) internal successors, (238), 11 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-31 17:34:39,437 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 17:34:39,437 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-31 17:34:39,437 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-01-31 17:34:39,438 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P1Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-01-31 17:34:39,438 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 17:34:39,438 INFO L85 PathProgramCache]: Analyzing trace with hash 1276442092, now seen corresponding path program 4 times [2024-01-31 17:34:39,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 17:34:39,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970638346] [2024-01-31 17:34:39,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 17:34:39,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 17:34:39,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-01-31 17:34:39,463 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-01-31 17:34:39,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-01-31 17:34:39,509 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-01-31 17:34:39,510 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-01-31 17:34:39,510 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (8 of 9 remaining) [2024-01-31 17:34:39,512 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (7 of 9 remaining) [2024-01-31 17:34:39,512 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1ASSERT_VIOLATIONERROR_FUNCTION (6 of 9 remaining) [2024-01-31 17:34:39,512 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (5 of 9 remaining) [2024-01-31 17:34:39,512 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 9 remaining) [2024-01-31 17:34:39,512 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 9 remaining) [2024-01-31 17:34:39,512 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 9 remaining) [2024-01-31 17:34:39,513 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (1 of 9 remaining) [2024-01-31 17:34:39,513 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1ASSERT_VIOLATIONERROR_FUNCTION (0 of 9 remaining) [2024-01-31 17:34:39,513 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-01-31 17:34:39,513 INFO L445 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1] [2024-01-31 17:34:39,517 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-01-31 17:34:39,518 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-01-31 17:34:39,577 INFO L503 ceAbstractionStarter]: Automizer considered 2 witness invariants [2024-01-31 17:34:39,577 INFO L504 ceAbstractionStarter]: WitnessConsidered=2 [2024-01-31 17:34:39,578 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.01 05:34:39 BasicIcfg [2024-01-31 17:34:39,578 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-01-31 17:34:39,578 INFO L158 Benchmark]: Toolchain (without parser) took 8282.92ms. Allocated memory was 153.1MB in the beginning and 425.7MB in the end (delta: 272.6MB). Free memory was 84.6MB in the beginning and 171.5MB in the end (delta: -86.9MB). Peak memory consumption was 186.1MB. Max. memory is 16.1GB. [2024-01-31 17:34:39,578 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 113.2MB. Free memory is still 73.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-01-31 17:34:39,578 INFO L158 Benchmark]: Witness Parser took 0.13ms. Allocated memory is still 153.1MB. Free memory is still 81.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-01-31 17:34:39,579 INFO L158 Benchmark]: CACSL2BoogieTranslator took 2390.63ms. Allocated memory was 153.1MB in the beginning and 283.1MB in the end (delta: 130.0MB). Free memory was 84.6MB in the beginning and 159.3MB in the end (delta: -74.7MB). Peak memory consumption was 131.8MB. Max. memory is 16.1GB. [2024-01-31 17:34:39,579 INFO L158 Benchmark]: Boogie Procedure Inliner took 66.20ms. Allocated memory is still 283.1MB. Free memory was 159.3MB in the beginning and 157.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-01-31 17:34:39,579 INFO L158 Benchmark]: Boogie Preprocessor took 73.34ms. Allocated memory is still 283.1MB. Free memory was 157.2MB in the beginning and 153.0MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-01-31 17:34:39,579 INFO L158 Benchmark]: RCFGBuilder took 563.13ms. Allocated memory is still 283.1MB. Free memory was 153.0MB in the beginning and 100.6MB in the end (delta: 52.4MB). Peak memory consumption was 52.4MB. Max. memory is 16.1GB. [2024-01-31 17:34:39,580 INFO L158 Benchmark]: TraceAbstraction took 5183.20ms. Allocated memory was 283.1MB in the beginning and 425.7MB in the end (delta: 142.6MB). Free memory was 100.6MB in the beginning and 171.5MB in the end (delta: -70.9MB). Peak memory consumption was 71.7MB. Max. memory is 16.1GB. [2024-01-31 17:34:39,581 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.17ms. Allocated memory is still 113.2MB. Free memory is still 73.7MB. There was no memory consumed. Max. memory is 16.1GB. * Witness Parser took 0.13ms. Allocated memory is still 153.1MB. Free memory is still 81.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 2390.63ms. Allocated memory was 153.1MB in the beginning and 283.1MB in the end (delta: 130.0MB). Free memory was 84.6MB in the beginning and 159.3MB in the end (delta: -74.7MB). Peak memory consumption was 131.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 66.20ms. Allocated memory is still 283.1MB. Free memory was 159.3MB in the beginning and 157.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 73.34ms. Allocated memory is still 283.1MB. Free memory was 157.2MB in the beginning and 153.0MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 563.13ms. Allocated memory is still 283.1MB. Free memory was 153.0MB in the beginning and 100.6MB in the end (delta: 52.4MB). Peak memory consumption was 52.4MB. Max. memory is 16.1GB. * TraceAbstraction took 5183.20ms. Allocated memory was 283.1MB in the beginning and 425.7MB in the end (delta: 142.6MB). Free memory was 100.6MB in the beginning and 171.5MB in the end (delta: -70.9MB). Peak memory consumption was 71.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p1_EAX = 0; [L713] 0 int __unbuffered_p1_EBX = 0; [L715] 0 int __unbuffered_p2_EAX = 0; [L717] 0 int __unbuffered_p2_EBX = 0; [L719] 0 int a = 0; [L720] 0 _Bool main$tmp_guard0; [L721] 0 _Bool main$tmp_guard1; [L723] 0 int x = 0; [L724] 0 _Bool x$flush_delayed; [L725] 0 int x$mem_tmp; [L726] 0 _Bool x$r_buff0_thd0; [L727] 0 _Bool x$r_buff0_thd1; [L728] 0 _Bool x$r_buff0_thd2; [L729] 0 _Bool x$r_buff0_thd3; [L730] 0 _Bool x$r_buff1_thd0; [L731] 0 _Bool x$r_buff1_thd1; [L732] 0 _Bool x$r_buff1_thd2; [L733] 0 _Bool x$r_buff1_thd3; [L734] 0 _Bool x$read_delayed; [L735] 0 int *x$read_delayed_var; [L736] 0 int x$w_buff0; [L737] 0 _Bool x$w_buff0_used; [L738] 0 int x$w_buff1; [L739] 0 _Bool x$w_buff1_used; [L741] 0 int y = 0; [L743] 0 int z = 0; [L744] 0 _Bool weak$$choice0; [L745] 0 _Bool weak$$choice2; [L835] 0 pthread_t t299; [L836] FCALL, FORK 0 pthread_create(&t299, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t299={5:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L837] 0 pthread_t t300; [L838] FCALL, FORK 0 pthread_create(&t300, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t299={5:0}, t300={6:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L839] 0 pthread_t t301; [L840] FCALL, FORK 0 pthread_create(&t301, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t299={5:0}, t300={6:0}, t301={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L769] 2 x$w_buff1 = x$w_buff0 [L770] 2 x$w_buff0 = 2 [L771] 2 x$w_buff1_used = x$w_buff0_used [L772] 2 x$w_buff0_used = (_Bool)1 [L773] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L773] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L774] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L775] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L776] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L777] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L778] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L781] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L784] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L787] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L804] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L807] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L810] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L749] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L752] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L813] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L814] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L815] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L816] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L817] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L755] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L756] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L757] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L758] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L759] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L790] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L791] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L792] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L793] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L794] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L762] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L797] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L820] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L842] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t299={5:0}, t300={6:0}, t301={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L844] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L844] RET 0 assume_abort_if_not(main$tmp_guard0) [L846] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L847] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L848] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L849] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L850] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t299={5:0}, t300={6:0}, t301={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L853] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L854] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L855] 0 x$flush_delayed = weak$$choice2 [L856] 0 x$mem_tmp = x [L857] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L858] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L859] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L860] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L861] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L862] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L863] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L864] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L865] 0 x = x$flush_delayed ? x$mem_tmp : x [L866] 0 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t299={5:0}, t300={6:0}, t301={3:0}, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L868] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=0, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L18] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[expression],IntegerLiteral[0]]]] VAL [\old(expression)=0, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L18] 0 reach_error() VAL [\old(expression)=0, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] - UnprovableResult [Line: 18]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 18]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 18]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 836]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 840]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 838]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 74 locations, 9 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 5.0s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 2.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 396 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 358 mSDsluCounter, 255 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 220 mSDsCounter, 32 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1053 IncrementalHoareTripleChecker+Invalid, 1085 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 32 mSolverCounterUnsat, 35 mSDtfsCounter, 1053 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 56 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=167occurred in iteration=6, InterpolantAutomatonStates: 45, 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.2s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 219 NumberOfCodeBlocks, 219 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 177 ConstructedInterpolants, 0 QuantifiedInterpolants, 1449 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 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-01-31 17:34:39,610 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (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