./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix044_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/mix044_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/mix044_tso.oepc.i ./goblint.2023-12-19_14-39-08.files/SV-COMP24_unreach-call/mix044_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:38:35,938 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-01-31 17:38:35,994 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-01-31 17:38:36,002 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-01-31 17:38:36,003 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-01-31 17:38:36,028 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-01-31 17:38:36,028 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-01-31 17:38:36,028 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-01-31 17:38:36,029 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-01-31 17:38:36,029 INFO L153 SettingsManager]: * Use memory slicer=true [2024-01-31 17:38:36,030 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-01-31 17:38:36,030 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-01-31 17:38:36,030 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-01-31 17:38:36,031 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-01-31 17:38:36,031 INFO L153 SettingsManager]: * Use SBE=true [2024-01-31 17:38:36,031 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-01-31 17:38:36,032 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-01-31 17:38:36,032 INFO L153 SettingsManager]: * sizeof long=4 [2024-01-31 17:38:36,032 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-01-31 17:38:36,033 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-01-31 17:38:36,033 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-01-31 17:38:36,037 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-01-31 17:38:36,037 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-01-31 17:38:36,037 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-01-31 17:38:36,038 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-01-31 17:38:36,038 INFO L153 SettingsManager]: * sizeof long double=12 [2024-01-31 17:38:36,038 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-01-31 17:38:36,038 INFO L153 SettingsManager]: * Use constant arrays=true [2024-01-31 17:38:36,044 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-01-31 17:38:36,045 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-01-31 17:38:36,045 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-01-31 17:38:36,045 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-01-31 17:38:36,045 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-31 17:38:36,045 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-01-31 17:38:36,046 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-01-31 17:38:36,046 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-01-31 17:38:36,046 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-01-31 17:38:36,046 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-01-31 17:38:36,046 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-01-31 17:38:36,047 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-01-31 17:38:36,047 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-01-31 17:38:36,047 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-01-31 17:38:36,047 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-01-31 17:38:36,047 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:38:36,264 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-01-31 17:38:36,282 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-01-31 17:38:36,284 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-01-31 17:38:36,285 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-01-31 17:38:36,290 INFO L274 PluginConnector]: Witness Parser initialized [2024-01-31 17:38:36,291 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/mix044_tso.oepc.yml/witness.yml [2024-01-31 17:38:36,965 INFO L270 PluginConnector]: Initializing CDTParser... [2024-01-31 17:38:36,965 INFO L274 PluginConnector]: CDTParser initialized [2024-01-31 17:38:36,967 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix044_tso.oepc.i [2024-01-31 17:38:38,056 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-01-31 17:38:38,254 INFO L384 CDTParser]: Found 1 translation units. [2024-01-31 17:38:38,255 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix044_tso.oepc.i [2024-01-31 17:38:38,273 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ec342e0e0/6b3aff0aebbb47f1b1236c728002abd5/FLAG769beb218 [2024-01-31 17:38:38,284 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ec342e0e0/6b3aff0aebbb47f1b1236c728002abd5 [2024-01-31 17:38:38,284 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-01-31 17:38:38,285 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-01-31 17:38:38,286 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-01-31 17:38:38,288 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-01-31 17:38:38,292 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-01-31 17:38:38,292 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 31.01 05:38:36" (1/2) ... [2024-01-31 17:38:38,293 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ae4267e and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 31.01 05:38:38, skipping insertion in model container [2024-01-31 17:38:38,293 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 31.01 05:38:36" (1/2) ... [2024-01-31 17:38:38,295 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@238f95ec and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 31.01 05:38:38, skipping insertion in model container [2024-01-31 17:38:38,295 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 05:38:38" (2/2) ... [2024-01-31 17:38:38,295 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ae4267e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 05:38:38, skipping insertion in model container [2024-01-31 17:38:38,295 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 05:38:38" (2/2) ... [2024-01-31 17:38:38,296 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-01-31 17:38:41,048 INFO L96 nessWitnessExtractor]: Found the following entries in the witness: [2024-01-31 17:38:41,053 INFO L98 nessWitnessExtractor]: Location invariant after [L18-L18] expression == 1 [2024-01-31 17:38:41,053 INFO L98 nessWitnessExtractor]: Location invariant before [L18-L18] expression == 0 [2024-01-31 17:38:41,097 INFO L179 MainTranslator]: Built tables and reachable declarations [2024-01-31 17:38:41,263 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/mix044_tso.oepc.i[949,962] [2024-01-31 17:38:41,379 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-31 17:38:41,388 INFO L204 MainTranslator]: Completed pre-run [2024-01-31 17:38:41,396 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/mix044_tso.oepc.i[949,962] Start Parsing Local [2024-01-31 17:38:41,418 WARN L424 MainDispatcher]: Unable to annotate ; with a witness entry [2024-01-31 17:38:41,457 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-31 17:38:41,489 INFO L208 MainTranslator]: Completed translation [2024-01-31 17:38:41,490 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 05:38:41 WrapperNode [2024-01-31 17:38:41,490 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-01-31 17:38:41,491 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-01-31 17:38:41,491 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-01-31 17:38:41,491 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-01-31 17:38:41,496 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 05:38:41" (1/1) ... [2024-01-31 17:38:41,517 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 05:38:41" (1/1) ... [2024-01-31 17:38:41,538 INFO L138 Inliner]: procedures = 177, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 163 [2024-01-31 17:38:41,538 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-01-31 17:38:41,539 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-01-31 17:38:41,539 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-01-31 17:38:41,539 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-01-31 17:38:41,547 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 05:38:41" (1/1) ... [2024-01-31 17:38:41,547 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 05:38:41" (1/1) ... [2024-01-31 17:38:41,552 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 05:38:41" (1/1) ... [2024-01-31 17:38:41,565 INFO L175 MemorySlicer]: Split 6 memory accesses to 5 slices as follows [2, 1, 1, 1, 1]. 33 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0, 0]. The 4 writes are split as follows [0, 1, 1, 1, 1]. [2024-01-31 17:38:41,565 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 05:38:41" (1/1) ... [2024-01-31 17:38:41,565 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 05:38:41" (1/1) ... [2024-01-31 17:38:41,571 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 05:38:41" (1/1) ... [2024-01-31 17:38:41,572 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 05:38:41" (1/1) ... [2024-01-31 17:38:41,574 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 05:38:41" (1/1) ... [2024-01-31 17:38:41,575 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 05:38:41" (1/1) ... [2024-01-31 17:38:41,578 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-01-31 17:38:41,580 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-01-31 17:38:41,580 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-01-31 17:38:41,580 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-01-31 17:38:41,581 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 05:38:41" (1/1) ... [2024-01-31 17:38:41,595 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-31 17:38:41,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-31 17:38:41,614 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:38:41,632 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:38:41,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-01-31 17:38:41,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-01-31 17:38:41,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-01-31 17:38:41,655 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-01-31 17:38:41,655 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-01-31 17:38:41,655 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-01-31 17:38:41,655 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-01-31 17:38:41,655 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-01-31 17:38:41,656 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-01-31 17:38:41,656 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-01-31 17:38:41,656 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-01-31 17:38:41,656 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-01-31 17:38:41,657 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-01-31 17:38:41,657 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-01-31 17:38:41,657 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-01-31 17:38:41,658 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2024-01-31 17:38:41,659 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2024-01-31 17:38:41,659 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-01-31 17:38:41,660 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-01-31 17:38:41,660 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-01-31 17:38:41,660 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-01-31 17:38:41,660 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-01-31 17:38:41,660 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-01-31 17:38:41,660 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-01-31 17:38:41,660 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-01-31 17:38:41,662 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:38:41,812 INFO L244 CfgBuilder]: Building ICFG [2024-01-31 17:38:41,814 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-01-31 17:38:42,039 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-01-31 17:38:42,039 INFO L293 CfgBuilder]: Performing block encoding [2024-01-31 17:38:42,224 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-01-31 17:38:42,225 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-01-31 17:38:42,226 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 05:38:42 BoogieIcfgContainer [2024-01-31 17:38:42,226 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-01-31 17:38:42,228 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-01-31 17:38:42,228 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-01-31 17:38:42,231 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-01-31 17:38:42,231 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 31.01 05:38:36" (1/4) ... [2024-01-31 17:38:42,232 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ef5ff2f and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 31.01 05:38:42, skipping insertion in model container [2024-01-31 17:38:42,232 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.01 05:38:38" (2/4) ... [2024-01-31 17:38:42,232 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ef5ff2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 05:38:42, skipping insertion in model container [2024-01-31 17:38:42,232 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 05:38:41" (3/4) ... [2024-01-31 17:38:42,233 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ef5ff2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 05:38:42, skipping insertion in model container [2024-01-31 17:38:42,233 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 05:38:42" (4/4) ... [2024-01-31 17:38:42,234 INFO L112 eAbstractionObserver]: Analyzing ICFG mix044_tso.oepc.i [2024-01-31 17:38:42,247 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-01-31 17:38:42,248 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-01-31 17:38:42,248 INFO L518 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-01-31 17:38:42,293 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-01-31 17:38:42,334 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 65 places, 53 transitions, 122 flow [2024-01-31 17:38:42,383 INFO L124 PetriNetUnfolderBase]: 1/49 cut-off events. [2024-01-31 17:38:42,384 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-31 17:38:42,388 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62 conditions, 49 events. 1/49 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 109 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 53. Up to 2 conditions per place. [2024-01-31 17:38:42,388 INFO L82 GeneralOperation]: Start removeDead. Operand has 65 places, 53 transitions, 122 flow [2024-01-31 17:38:42,391 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 61 places, 49 transitions, 110 flow [2024-01-31 17:38:42,404 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-01-31 17:38:42,411 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;@69e92c1c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-01-31 17:38:42,411 INFO L358 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2024-01-31 17:38:42,417 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-01-31 17:38:42,418 INFO L124 PetriNetUnfolderBase]: 0/9 cut-off events. [2024-01-31 17:38:42,418 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-31 17:38:42,418 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 17:38:42,419 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-01-31 17:38:42,419 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P1Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 7 more)] === [2024-01-31 17:38:42,423 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 17:38:42,424 INFO L85 PathProgramCache]: Analyzing trace with hash -734387277, now seen corresponding path program 1 times [2024-01-31 17:38:42,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 17:38:42,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71030190] [2024-01-31 17:38:42,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 17:38:42,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 17:38:42,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 17:38:42,638 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:38:42,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 17:38:42,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71030190] [2024-01-31 17:38:42,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [71030190] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 17:38:42,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 17:38:42,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-31 17:38:42,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645775700] [2024-01-31 17:38:42,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 17:38:42,648 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-01-31 17:38:42,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 17:38:42,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-01-31 17:38:42,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-01-31 17:38:42,676 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 53 [2024-01-31 17:38:42,678 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 49 transitions, 110 flow. Second operand has 2 states, 2 states have (on average 29.5) internal successors, (59), 2 states have internal predecessors, (59), 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:38:42,679 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 17:38:42,679 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 53 [2024-01-31 17:38:42,679 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 17:38:43,397 INFO L124 PetriNetUnfolderBase]: 2752/4977 cut-off events. [2024-01-31 17:38:43,397 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-31 17:38:43,412 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8935 conditions, 4977 events. 2752/4977 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 299. Compared 37789 event pairs, 2752 based on Foata normal form. 135/4377 useless extension candidates. Maximal degree in co-relation 8923. Up to 3825 conditions per place. [2024-01-31 17:38:43,438 INFO L140 encePairwiseOnDemand]: 51/53 looper letters, 24 selfloop transitions, 0 changer transitions 0/47 dead transitions. [2024-01-31 17:38:43,438 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 47 transitions, 154 flow [2024-01-31 17:38:43,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-31 17:38:43,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2024-01-31 17:38:43,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 80 transitions. [2024-01-31 17:38:43,451 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7547169811320755 [2024-01-31 17:38:43,452 INFO L175 Difference]: Start difference. First operand has 61 places, 49 transitions, 110 flow. Second operand 2 states and 80 transitions. [2024-01-31 17:38:43,453 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 47 transitions, 154 flow [2024-01-31 17:38:43,458 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 47 transitions, 150 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-01-31 17:38:43,463 INFO L231 Difference]: Finished difference. Result has 57 places, 47 transitions, 102 flow [2024-01-31 17:38:43,465 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=102, PETRI_PLACES=57, PETRI_TRANSITIONS=47} [2024-01-31 17:38:43,468 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, -4 predicate places. [2024-01-31 17:38:43,468 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 47 transitions, 102 flow [2024-01-31 17:38:43,468 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 29.5) internal successors, (59), 2 states have internal predecessors, (59), 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:38:43,468 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 17:38:43,469 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-01-31 17:38:43,469 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-01-31 17:38:43,469 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P1Err1ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P1Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 7 more)] === [2024-01-31 17:38:43,470 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 17:38:43,470 INFO L85 PathProgramCache]: Analyzing trace with hash -734387276, now seen corresponding path program 1 times [2024-01-31 17:38:43,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 17:38:43,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630699717] [2024-01-31 17:38:43,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 17:38:43,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 17:38:43,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 17:38:43,679 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:38:43,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 17:38:43,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630699717] [2024-01-31 17:38:43,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1630699717] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 17:38:43,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 17:38:43,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-31 17:38:43,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773745754] [2024-01-31 17:38:43,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 17:38:43,683 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-31 17:38:43,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 17:38:43,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-31 17:38:43,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-31 17:38:43,684 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 53 [2024-01-31 17:38:43,685 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 47 transitions, 102 flow. Second operand has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 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:38:43,685 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 17:38:43,685 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 53 [2024-01-31 17:38:43,685 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 17:38:44,139 INFO L124 PetriNetUnfolderBase]: 2160/3680 cut-off events. [2024-01-31 17:38:44,149 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-31 17:38:44,155 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6806 conditions, 3680 events. 2160/3680 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 244. Compared 25560 event pairs, 384 based on Foata normal form. 0/3533 useless extension candidates. Maximal degree in co-relation 6803. Up to 2416 conditions per place. [2024-01-31 17:38:44,186 INFO L140 encePairwiseOnDemand]: 50/53 looper letters, 35 selfloop transitions, 2 changer transitions 2/62 dead transitions. [2024-01-31 17:38:44,188 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 62 transitions, 214 flow [2024-01-31 17:38:44,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-31 17:38:44,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-31 17:38:44,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 121 transitions. [2024-01-31 17:38:44,190 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7610062893081762 [2024-01-31 17:38:44,190 INFO L175 Difference]: Start difference. First operand has 57 places, 47 transitions, 102 flow. Second operand 3 states and 121 transitions. [2024-01-31 17:38:44,190 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 62 transitions, 214 flow [2024-01-31 17:38:44,191 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 62 transitions, 214 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-01-31 17:38:44,192 INFO L231 Difference]: Finished difference. Result has 58 places, 45 transitions, 102 flow [2024-01-31 17:38:44,192 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=102, PETRI_PLACES=58, PETRI_TRANSITIONS=45} [2024-01-31 17:38:44,193 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, -3 predicate places. [2024-01-31 17:38:44,193 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 45 transitions, 102 flow [2024-01-31 17:38:44,193 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 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:38:44,193 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 17:38:44,194 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-31 17:38:44,194 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-01-31 17:38:44,194 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P1Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 7 more)] === [2024-01-31 17:38:44,194 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 17:38:44,194 INFO L85 PathProgramCache]: Analyzing trace with hash 590676405, now seen corresponding path program 1 times [2024-01-31 17:38:44,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 17:38:44,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102837978] [2024-01-31 17:38:44,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 17:38:44,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 17:38:44,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 17:38:44,271 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:38:44,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 17:38:44,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102837978] [2024-01-31 17:38:44,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [102837978] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 17:38:44,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 17:38:44,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-31 17:38:44,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971833921] [2024-01-31 17:38:44,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 17:38:44,272 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-31 17:38:44,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 17:38:44,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-31 17:38:44,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-31 17:38:44,276 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 53 [2024-01-31 17:38:44,277 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 45 transitions, 102 flow. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 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:38:44,277 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 17:38:44,277 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 53 [2024-01-31 17:38:44,277 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 17:38:44,706 INFO L124 PetriNetUnfolderBase]: 2754/4322 cut-off events. [2024-01-31 17:38:44,706 INFO L125 PetriNetUnfolderBase]: For 267/267 co-relation queries the response was YES. [2024-01-31 17:38:44,713 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8527 conditions, 4322 events. 2754/4322 cut-off events. For 267/267 co-relation queries the response was YES. Maximal size of possible extension queue 278. Compared 28661 event pairs, 2160 based on Foata normal form. 0/4010 useless extension candidates. Maximal degree in co-relation 8523. Up to 3020 conditions per place. [2024-01-31 17:38:44,729 INFO L140 encePairwiseOnDemand]: 51/53 looper letters, 32 selfloop transitions, 1 changer transitions 1/53 dead transitions. [2024-01-31 17:38:44,729 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 53 transitions, 188 flow [2024-01-31 17:38:44,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-31 17:38:44,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-31 17:38:44,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 104 transitions. [2024-01-31 17:38:44,731 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6540880503144654 [2024-01-31 17:38:44,731 INFO L175 Difference]: Start difference. First operand has 58 places, 45 transitions, 102 flow. Second operand 3 states and 104 transitions. [2024-01-31 17:38:44,731 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 53 transitions, 188 flow [2024-01-31 17:38:44,732 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 53 transitions, 182 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-31 17:38:44,732 INFO L231 Difference]: Finished difference. Result has 56 places, 43 transitions, 96 flow [2024-01-31 17:38:44,733 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=54, 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=3, PETRI_FLOW=96, PETRI_PLACES=56, PETRI_TRANSITIONS=43} [2024-01-31 17:38:44,733 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, -5 predicate places. [2024-01-31 17:38:44,733 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 43 transitions, 96 flow [2024-01-31 17:38:44,734 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 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:38:44,734 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 17:38:44,734 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-31 17:38:44,734 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-01-31 17:38:44,734 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P1Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 7 more)] === [2024-01-31 17:38:44,735 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 17:38:44,735 INFO L85 PathProgramCache]: Analyzing trace with hash 1131099794, now seen corresponding path program 1 times [2024-01-31 17:38:44,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 17:38:44,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860104319] [2024-01-31 17:38:44,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 17:38:44,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 17:38:44,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 17:38:45,132 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:38:45,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 17:38:45,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860104319] [2024-01-31 17:38:45,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860104319] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 17:38:45,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 17:38:45,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-01-31 17:38:45,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194875203] [2024-01-31 17:38:45,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 17:38:45,137 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-01-31 17:38:45,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 17:38:45,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-01-31 17:38:45,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-01-31 17:38:45,158 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 53 [2024-01-31 17:38:45,159 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 43 transitions, 96 flow. Second operand has 6 states, 6 states have (on average 20.5) internal successors, (123), 6 states have internal predecessors, (123), 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:38:45,159 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 17:38:45,159 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 53 [2024-01-31 17:38:45,159 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 17:38:46,804 INFO L124 PetriNetUnfolderBase]: 10961/15703 cut-off events. [2024-01-31 17:38:46,804 INFO L125 PetriNetUnfolderBase]: For 300/300 co-relation queries the response was YES. [2024-01-31 17:38:46,826 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31003 conditions, 15703 events. 10961/15703 cut-off events. For 300/300 co-relation queries the response was YES. Maximal size of possible extension queue 796. Compared 100906 event pairs, 2219 based on Foata normal form. 420/16048 useless extension candidates. Maximal degree in co-relation 30999. Up to 8365 conditions per place. [2024-01-31 17:38:46,885 INFO L140 encePairwiseOnDemand]: 39/53 looper letters, 46 selfloop transitions, 11 changer transitions 71/142 dead transitions. [2024-01-31 17:38:46,885 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 142 transitions, 552 flow [2024-01-31 17:38:46,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-01-31 17:38:46,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-01-31 17:38:46,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 311 transitions. [2024-01-31 17:38:46,888 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5867924528301887 [2024-01-31 17:38:46,888 INFO L175 Difference]: Start difference. First operand has 56 places, 43 transitions, 96 flow. Second operand 10 states and 311 transitions. [2024-01-31 17:38:46,888 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 142 transitions, 552 flow [2024-01-31 17:38:46,919 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 142 transitions, 550 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-01-31 17:38:46,921 INFO L231 Difference]: Finished difference. Result has 72 places, 52 transitions, 223 flow [2024-01-31 17:38:46,921 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=95, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=223, PETRI_PLACES=72, PETRI_TRANSITIONS=52} [2024-01-31 17:38:46,922 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 11 predicate places. [2024-01-31 17:38:46,922 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 52 transitions, 223 flow [2024-01-31 17:38:46,923 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.5) internal successors, (123), 6 states have internal predecessors, (123), 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:38:46,923 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 17:38:46,923 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] [2024-01-31 17:38:46,923 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-01-31 17:38:46,923 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P1Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 7 more)] === [2024-01-31 17:38:46,924 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 17:38:46,924 INFO L85 PathProgramCache]: Analyzing trace with hash 1939851710, now seen corresponding path program 1 times [2024-01-31 17:38:46,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 17:38:46,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379827411] [2024-01-31 17:38:46,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 17:38:46,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 17:38:46,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 17:38:47,229 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:38:47,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 17:38:47,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379827411] [2024-01-31 17:38:47,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [379827411] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 17:38:47,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 17:38:47,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-01-31 17:38:47,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036108930] [2024-01-31 17:38:47,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 17:38:47,231 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-01-31 17:38:47,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 17:38:47,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-01-31 17:38:47,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-01-31 17:38:47,239 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 53 [2024-01-31 17:38:47,239 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 52 transitions, 223 flow. Second operand has 5 states, 5 states have (on average 25.0) internal successors, (125), 5 states have internal predecessors, (125), 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:38:47,239 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 17:38:47,239 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 53 [2024-01-31 17:38:47,239 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 17:38:48,722 INFO L124 PetriNetUnfolderBase]: 10178/15042 cut-off events. [2024-01-31 17:38:48,722 INFO L125 PetriNetUnfolderBase]: For 20949/23696 co-relation queries the response was YES. [2024-01-31 17:38:48,764 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51329 conditions, 15042 events. 10178/15042 cut-off events. For 20949/23696 co-relation queries the response was YES. Maximal size of possible extension queue 836. Compared 103356 event pairs, 5322 based on Foata normal form. 448/14589 useless extension candidates. Maximal degree in co-relation 51317. Up to 9985 conditions per place. [2024-01-31 17:38:48,827 INFO L140 encePairwiseOnDemand]: 47/53 looper letters, 46 selfloop transitions, 4 changer transitions 51/122 dead transitions. [2024-01-31 17:38:48,828 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 122 transitions, 783 flow [2024-01-31 17:38:48,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-01-31 17:38:48,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-01-31 17:38:48,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 231 transitions. [2024-01-31 17:38:48,832 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6226415094339622 [2024-01-31 17:38:48,833 INFO L175 Difference]: Start difference. First operand has 72 places, 52 transitions, 223 flow. Second operand 7 states and 231 transitions. [2024-01-31 17:38:48,833 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 122 transitions, 783 flow [2024-01-31 17:38:49,022 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 122 transitions, 765 flow, removed 8 selfloop flow, removed 3 redundant places. [2024-01-31 17:38:49,024 INFO L231 Difference]: Finished difference. Result has 74 places, 55 transitions, 269 flow [2024-01-31 17:38:49,024 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=213, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=269, PETRI_PLACES=74, PETRI_TRANSITIONS=55} [2024-01-31 17:38:49,024 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 13 predicate places. [2024-01-31 17:38:49,024 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 55 transitions, 269 flow [2024-01-31 17:38:49,025 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 25.0) internal successors, (125), 5 states have internal predecessors, (125), 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:38:49,025 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 17:38:49,025 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] [2024-01-31 17:38:49,025 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-01-31 17:38:49,025 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P1Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 7 more)] === [2024-01-31 17:38:49,026 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 17:38:49,026 INFO L85 PathProgramCache]: Analyzing trace with hash 1402679261, now seen corresponding path program 1 times [2024-01-31 17:38:49,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 17:38:49,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727165764] [2024-01-31 17:38:49,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 17:38:49,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 17:38:49,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 17:38:49,363 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:38:49,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 17:38:49,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727165764] [2024-01-31 17:38:49,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1727165764] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 17:38:49,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 17:38:49,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-01-31 17:38:49,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824016956] [2024-01-31 17:38:49,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 17:38:49,365 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-01-31 17:38:49,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 17:38:49,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-01-31 17:38:49,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-01-31 17:38:49,370 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 53 [2024-01-31 17:38:49,370 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 55 transitions, 269 flow. Second operand has 7 states, 7 states have (on average 24.285714285714285) internal successors, (170), 7 states have internal predecessors, (170), 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:38:49,371 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 17:38:49,371 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 53 [2024-01-31 17:38:49,371 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 17:38:51,260 INFO L124 PetriNetUnfolderBase]: 9998/14957 cut-off events. [2024-01-31 17:38:51,260 INFO L125 PetriNetUnfolderBase]: For 30266/33637 co-relation queries the response was YES. [2024-01-31 17:38:51,301 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54884 conditions, 14957 events. 9998/14957 cut-off events. For 30266/33637 co-relation queries the response was YES. Maximal size of possible extension queue 824. Compared 104196 event pairs, 5117 based on Foata normal form. 401/14507 useless extension candidates. Maximal degree in co-relation 54868. Up to 9892 conditions per place. [2024-01-31 17:38:51,358 INFO L140 encePairwiseOnDemand]: 44/53 looper letters, 56 selfloop transitions, 11 changer transitions 47/135 dead transitions. [2024-01-31 17:38:51,358 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 135 transitions, 917 flow [2024-01-31 17:38:51,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-01-31 17:38:51,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-01-31 17:38:51,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 264 transitions. [2024-01-31 17:38:51,360 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6226415094339622 [2024-01-31 17:38:51,360 INFO L175 Difference]: Start difference. First operand has 74 places, 55 transitions, 269 flow. Second operand 8 states and 264 transitions. [2024-01-31 17:38:51,360 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 135 transitions, 917 flow [2024-01-31 17:38:51,434 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 135 transitions, 901 flow, removed 6 selfloop flow, removed 5 redundant places. [2024-01-31 17:38:51,436 INFO L231 Difference]: Finished difference. Result has 77 places, 62 transitions, 390 flow [2024-01-31 17:38:51,437 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=257, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=390, PETRI_PLACES=77, PETRI_TRANSITIONS=62} [2024-01-31 17:38:51,439 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 16 predicate places. [2024-01-31 17:38:51,439 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 62 transitions, 390 flow [2024-01-31 17:38:51,439 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.285714285714285) internal successors, (170), 7 states have internal predecessors, (170), 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:38:51,439 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 17:38:51,440 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] [2024-01-31 17:38:51,440 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-01-31 17:38:51,440 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P1Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 7 more)] === [2024-01-31 17:38:51,440 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 17:38:51,441 INFO L85 PathProgramCache]: Analyzing trace with hash -1986846672, now seen corresponding path program 1 times [2024-01-31 17:38:51,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 17:38:51,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600491037] [2024-01-31 17:38:51,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 17:38:51,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 17:38:51,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 17:38:51,655 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:38:51,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 17:38:51,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600491037] [2024-01-31 17:38:51,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [600491037] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 17:38:51,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 17:38:51,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-01-31 17:38:51,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539166658] [2024-01-31 17:38:51,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 17:38:51,656 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-01-31 17:38:51,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 17:38:51,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-01-31 17:38:51,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-01-31 17:38:51,660 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 53 [2024-01-31 17:38:51,661 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 62 transitions, 390 flow. Second operand has 6 states, 6 states have (on average 24.666666666666668) internal successors, (148), 6 states have internal predecessors, (148), 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:38:51,661 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 17:38:51,661 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 53 [2024-01-31 17:38:51,661 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 17:38:53,466 INFO L124 PetriNetUnfolderBase]: 9848/14551 cut-off events. [2024-01-31 17:38:53,466 INFO L125 PetriNetUnfolderBase]: For 66311/71005 co-relation queries the response was YES. [2024-01-31 17:38:53,527 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68496 conditions, 14551 events. 9848/14551 cut-off events. For 66311/71005 co-relation queries the response was YES. Maximal size of possible extension queue 760. Compared 99578 event pairs, 1637 based on Foata normal form. 350/14179 useless extension candidates. Maximal degree in co-relation 68479. Up to 8460 conditions per place. [2024-01-31 17:38:53,606 INFO L140 encePairwiseOnDemand]: 43/53 looper letters, 66 selfloop transitions, 16 changer transitions 49/152 dead transitions. [2024-01-31 17:38:53,606 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 152 transitions, 1337 flow [2024-01-31 17:38:53,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-01-31 17:38:53,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-01-31 17:38:53,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 269 transitions. [2024-01-31 17:38:53,607 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6344339622641509 [2024-01-31 17:38:53,608 INFO L175 Difference]: Start difference. First operand has 77 places, 62 transitions, 390 flow. Second operand 8 states and 269 transitions. [2024-01-31 17:38:53,608 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 152 transitions, 1337 flow [2024-01-31 17:38:53,760 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 152 transitions, 1306 flow, removed 9 selfloop flow, removed 4 redundant places. [2024-01-31 17:38:53,763 INFO L231 Difference]: Finished difference. Result has 81 places, 72 transitions, 538 flow [2024-01-31 17:38:53,763 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=367, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=538, PETRI_PLACES=81, PETRI_TRANSITIONS=72} [2024-01-31 17:38:53,764 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 20 predicate places. [2024-01-31 17:38:53,764 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 72 transitions, 538 flow [2024-01-31 17:38:53,764 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.666666666666668) internal successors, (148), 6 states have internal predecessors, (148), 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:38:53,764 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 17:38:53,764 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] [2024-01-31 17:38:53,765 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-01-31 17:38:53,765 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P1Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 7 more)] === [2024-01-31 17:38:53,765 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 17:38:53,765 INFO L85 PathProgramCache]: Analyzing trace with hash -210533332, now seen corresponding path program 2 times [2024-01-31 17:38:53,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 17:38:53,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584794107] [2024-01-31 17:38:53,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 17:38:53,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 17:38:53,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 17:38:54,127 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:38:54,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 17:38:54,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [584794107] [2024-01-31 17:38:54,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [584794107] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 17:38:54,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 17:38:54,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-01-31 17:38:54,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453806651] [2024-01-31 17:38:54,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 17:38:54,128 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-01-31 17:38:54,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 17:38:54,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-01-31 17:38:54,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-01-31 17:38:54,136 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 53 [2024-01-31 17:38:54,136 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 72 transitions, 538 flow. Second operand has 7 states, 7 states have (on average 24.285714285714285) internal successors, (170), 7 states have internal predecessors, (170), 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:38:54,138 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 17:38:54,138 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 53 [2024-01-31 17:38:54,138 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 17:38:55,756 INFO L124 PetriNetUnfolderBase]: 9264/13723 cut-off events. [2024-01-31 17:38:55,756 INFO L125 PetriNetUnfolderBase]: For 83097/88273 co-relation queries the response was YES. [2024-01-31 17:38:55,806 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68999 conditions, 13723 events. 9264/13723 cut-off events. For 83097/88273 co-relation queries the response was YES. Maximal size of possible extension queue 702. Compared 92442 event pairs, 1658 based on Foata normal form. 446/13452 useless extension candidates. Maximal degree in co-relation 68979. Up to 8380 conditions per place. [2024-01-31 17:38:55,875 INFO L140 encePairwiseOnDemand]: 43/53 looper letters, 62 selfloop transitions, 16 changer transitions 49/148 dead transitions. [2024-01-31 17:38:55,876 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 148 transitions, 1420 flow [2024-01-31 17:38:55,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-01-31 17:38:55,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-01-31 17:38:55,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 265 transitions. [2024-01-31 17:38:55,877 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.625 [2024-01-31 17:38:55,877 INFO L175 Difference]: Start difference. First operand has 81 places, 72 transitions, 538 flow. Second operand 8 states and 265 transitions. [2024-01-31 17:38:55,878 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 148 transitions, 1420 flow [2024-01-31 17:38:56,078 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 148 transitions, 1345 flow, removed 32 selfloop flow, removed 5 redundant places. [2024-01-31 17:38:56,079 INFO L231 Difference]: Finished difference. Result has 84 places, 72 transitions, 539 flow [2024-01-31 17:38:56,080 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=483, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=539, PETRI_PLACES=84, PETRI_TRANSITIONS=72} [2024-01-31 17:38:56,085 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 23 predicate places. [2024-01-31 17:38:56,086 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 72 transitions, 539 flow [2024-01-31 17:38:56,086 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.285714285714285) internal successors, (170), 7 states have internal predecessors, (170), 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:38:56,086 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 17:38:56,086 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] [2024-01-31 17:38:56,086 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-01-31 17:38:56,087 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P1Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 7 more)] === [2024-01-31 17:38:56,087 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 17:38:56,087 INFO L85 PathProgramCache]: Analyzing trace with hash -849600884, now seen corresponding path program 1 times [2024-01-31 17:38:56,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 17:38:56,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056941978] [2024-01-31 17:38:56,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 17:38:56,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 17:38:56,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 17:38:56,213 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:38:56,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 17:38:56,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056941978] [2024-01-31 17:38:56,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1056941978] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 17:38:56,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 17:38:56,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-31 17:38:56,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914867874] [2024-01-31 17:38:56,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 17:38:56,215 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-31 17:38:56,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 17:38:56,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-31 17:38:56,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-31 17:38:56,223 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 53 [2024-01-31 17:38:56,223 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 72 transitions, 539 flow. Second operand has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 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:38:56,223 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 17:38:56,223 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 53 [2024-01-31 17:38:56,223 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 17:38:58,837 INFO L124 PetriNetUnfolderBase]: 18230/26367 cut-off events. [2024-01-31 17:38:58,838 INFO L125 PetriNetUnfolderBase]: For 175579/182053 co-relation queries the response was YES. [2024-01-31 17:38:58,949 INFO L83 FinitePrefix]: Finished finitePrefix Result has 119325 conditions, 26367 events. 18230/26367 cut-off events. For 175579/182053 co-relation queries the response was YES. Maximal size of possible extension queue 1331. Compared 176121 event pairs, 2795 based on Foata normal form. 1421/25850 useless extension candidates. Maximal degree in co-relation 119304. Up to 13237 conditions per place. [2024-01-31 17:38:59,058 INFO L140 encePairwiseOnDemand]: 46/53 looper letters, 113 selfloop transitions, 6 changer transitions 0/140 dead transitions. [2024-01-31 17:38:59,058 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 140 transitions, 1419 flow [2024-01-31 17:38:59,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-31 17:38:59,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-31 17:38:59,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 147 transitions. [2024-01-31 17:38:59,059 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6933962264150944 [2024-01-31 17:38:59,059 INFO L175 Difference]: Start difference. First operand has 84 places, 72 transitions, 539 flow. Second operand 4 states and 147 transitions. [2024-01-31 17:38:59,059 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 140 transitions, 1419 flow [2024-01-31 17:38:59,156 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 140 transitions, 1319 flow, removed 12 selfloop flow, removed 8 redundant places. [2024-01-31 17:38:59,158 INFO L231 Difference]: Finished difference. Result has 77 places, 77 transitions, 537 flow [2024-01-31 17:38:59,158 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=491, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=537, PETRI_PLACES=77, PETRI_TRANSITIONS=77} [2024-01-31 17:38:59,159 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 16 predicate places. [2024-01-31 17:38:59,159 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 77 transitions, 537 flow [2024-01-31 17:38:59,160 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 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:38:59,160 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 17:38:59,160 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:38:59,160 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-01-31 17:38:59,160 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P1Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 7 more)] === [2024-01-31 17:38:59,161 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 17:38:59,161 INFO L85 PathProgramCache]: Analyzing trace with hash -1156823399, now seen corresponding path program 1 times [2024-01-31 17:38:59,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 17:38:59,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817622087] [2024-01-31 17:38:59,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 17:38:59,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 17:38:59,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 17:38:59,367 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:38:59,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 17:38:59,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817622087] [2024-01-31 17:38:59,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1817622087] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 17:38:59,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 17:38:59,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-01-31 17:38:59,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936886533] [2024-01-31 17:38:59,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 17:38:59,369 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-01-31 17:38:59,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 17:38:59,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-01-31 17:38:59,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-01-31 17:38:59,379 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 53 [2024-01-31 17:38:59,380 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 77 transitions, 537 flow. Second operand has 5 states, 5 states have (on average 25.4) internal successors, (127), 5 states have internal predecessors, (127), 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:38:59,380 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 17:38:59,380 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 53 [2024-01-31 17:38:59,380 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 17:39:01,460 INFO L124 PetriNetUnfolderBase]: 14310/20994 cut-off events. [2024-01-31 17:39:01,460 INFO L125 PetriNetUnfolderBase]: For 130258/133972 co-relation queries the response was YES. [2024-01-31 17:39:01,521 INFO L83 FinitePrefix]: Finished finitePrefix Result has 94555 conditions, 20994 events. 14310/20994 cut-off events. For 130258/133972 co-relation queries the response was YES. Maximal size of possible extension queue 1020. Compared 137162 event pairs, 1617 based on Foata normal form. 1198/20608 useless extension candidates. Maximal degree in co-relation 94537. Up to 8494 conditions per place. [2024-01-31 17:39:01,594 INFO L140 encePairwiseOnDemand]: 46/53 looper letters, 126 selfloop transitions, 10 changer transitions 0/157 dead transitions. [2024-01-31 17:39:01,594 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 157 transitions, 1502 flow [2024-01-31 17:39:01,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-31 17:39:01,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-01-31 17:39:01,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 188 transitions. [2024-01-31 17:39:01,595 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7094339622641509 [2024-01-31 17:39:01,595 INFO L175 Difference]: Start difference. First operand has 77 places, 77 transitions, 537 flow. Second operand 5 states and 188 transitions. [2024-01-31 17:39:01,595 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 157 transitions, 1502 flow [2024-01-31 17:39:01,615 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 157 transitions, 1495 flow, removed 2 selfloop flow, removed 2 redundant places. [2024-01-31 17:39:01,616 INFO L231 Difference]: Finished difference. Result has 81 places, 81 transitions, 588 flow [2024-01-31 17:39:01,616 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=521, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=588, PETRI_PLACES=81, PETRI_TRANSITIONS=81} [2024-01-31 17:39:01,617 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 20 predicate places. [2024-01-31 17:39:01,617 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 81 transitions, 588 flow [2024-01-31 17:39:01,617 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 25.4) internal successors, (127), 5 states have internal predecessors, (127), 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:39:01,617 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 17:39:01,617 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] [2024-01-31 17:39:01,618 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-01-31 17:39:01,618 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P1Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 7 more)] === [2024-01-31 17:39:01,618 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 17:39:01,618 INFO L85 PathProgramCache]: Analyzing trace with hash 54045519, now seen corresponding path program 1 times [2024-01-31 17:39:01,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 17:39:01,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247943775] [2024-01-31 17:39:01,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 17:39:01,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 17:39:01,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 17:39:01,730 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:39:01,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 17:39:01,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247943775] [2024-01-31 17:39:01,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1247943775] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 17:39:01,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 17:39:01,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-01-31 17:39:01,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526338187] [2024-01-31 17:39:01,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 17:39:01,732 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-01-31 17:39:01,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 17:39:01,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-01-31 17:39:01,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-01-31 17:39:01,741 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 53 [2024-01-31 17:39:01,741 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 81 transitions, 588 flow. Second operand has 6 states, 6 states have (on average 25.166666666666668) internal successors, (151), 6 states have internal predecessors, (151), 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:39:01,741 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 17:39:01,741 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 53 [2024-01-31 17:39:01,742 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 17:39:03,349 INFO L124 PetriNetUnfolderBase]: 11142/16214 cut-off events. [2024-01-31 17:39:03,350 INFO L125 PetriNetUnfolderBase]: For 118728/121349 co-relation queries the response was YES. [2024-01-31 17:39:03,399 INFO L83 FinitePrefix]: Finished finitePrefix Result has 77909 conditions, 16214 events. 11142/16214 cut-off events. For 118728/121349 co-relation queries the response was YES. Maximal size of possible extension queue 904. Compared 100725 event pairs, 1153 based on Foata normal form. 835/15602 useless extension candidates. Maximal degree in co-relation 77890. Up to 6434 conditions per place. [2024-01-31 17:39:03,458 INFO L140 encePairwiseOnDemand]: 46/53 looper letters, 131 selfloop transitions, 14 changer transitions 0/166 dead transitions. [2024-01-31 17:39:03,458 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 166 transitions, 1599 flow [2024-01-31 17:39:03,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-01-31 17:39:03,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-01-31 17:39:03,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 227 transitions. [2024-01-31 17:39:03,459 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7138364779874213 [2024-01-31 17:39:03,459 INFO L175 Difference]: Start difference. First operand has 81 places, 81 transitions, 588 flow. Second operand 6 states and 227 transitions. [2024-01-31 17:39:03,460 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 166 transitions, 1599 flow [2024-01-31 17:39:03,475 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 166 transitions, 1583 flow, removed 4 selfloop flow, removed 2 redundant places. [2024-01-31 17:39:03,477 INFO L231 Difference]: Finished difference. Result has 86 places, 85 transitions, 650 flow [2024-01-31 17:39:03,477 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=565, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=650, PETRI_PLACES=86, PETRI_TRANSITIONS=85} [2024-01-31 17:39:03,477 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 25 predicate places. [2024-01-31 17:39:03,478 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 85 transitions, 650 flow [2024-01-31 17:39:03,478 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.166666666666668) internal successors, (151), 6 states have internal predecessors, (151), 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:39:03,478 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 17:39:03,478 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, 1] [2024-01-31 17:39:03,478 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-01-31 17:39:03,478 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P1Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 7 more)] === [2024-01-31 17:39:03,479 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 17:39:03,479 INFO L85 PathProgramCache]: Analyzing trace with hash 1100476876, now seen corresponding path program 1 times [2024-01-31 17:39:03,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 17:39:03,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035263442] [2024-01-31 17:39:03,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 17:39:03,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 17:39:03,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 17:39:03,656 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:39:03,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 17:39:03,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035263442] [2024-01-31 17:39:03,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1035263442] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 17:39:03,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 17:39:03,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-01-31 17:39:03,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218775010] [2024-01-31 17:39:03,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 17:39:03,657 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-01-31 17:39:03,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 17:39:03,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-01-31 17:39:03,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-01-31 17:39:03,664 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 53 [2024-01-31 17:39:03,664 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 85 transitions, 650 flow. Second operand has 6 states, 6 states have (on average 24.5) internal successors, (147), 6 states have internal predecessors, (147), 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:39:03,664 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 17:39:03,664 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 53 [2024-01-31 17:39:03,664 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 17:39:05,744 INFO L124 PetriNetUnfolderBase]: 11432/18552 cut-off events. [2024-01-31 17:39:05,744 INFO L125 PetriNetUnfolderBase]: For 85471/91712 co-relation queries the response was YES. [2024-01-31 17:39:05,821 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79157 conditions, 18552 events. 11432/18552 cut-off events. For 85471/91712 co-relation queries the response was YES. Maximal size of possible extension queue 1169. Compared 143009 event pairs, 3181 based on Foata normal form. 755/17479 useless extension candidates. Maximal degree in co-relation 79136. Up to 7448 conditions per place. [2024-01-31 17:39:05,888 INFO L140 encePairwiseOnDemand]: 48/53 looper letters, 114 selfloop transitions, 3 changer transitions 21/174 dead transitions. [2024-01-31 17:39:05,888 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 174 transitions, 1700 flow [2024-01-31 17:39:05,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-01-31 17:39:05,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-01-31 17:39:05,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 207 transitions. [2024-01-31 17:39:05,890 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6509433962264151 [2024-01-31 17:39:05,890 INFO L175 Difference]: Start difference. First operand has 86 places, 85 transitions, 650 flow. Second operand 6 states and 207 transitions. [2024-01-31 17:39:05,890 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 174 transitions, 1700 flow [2024-01-31 17:39:05,995 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 174 transitions, 1669 flow, removed 8 selfloop flow, removed 3 redundant places. [2024-01-31 17:39:05,996 INFO L231 Difference]: Finished difference. Result has 92 places, 87 transitions, 654 flow [2024-01-31 17:39:05,997 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=619, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=654, PETRI_PLACES=92, PETRI_TRANSITIONS=87} [2024-01-31 17:39:05,997 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 31 predicate places. [2024-01-31 17:39:05,997 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 87 transitions, 654 flow [2024-01-31 17:39:05,997 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.5) internal successors, (147), 6 states have internal predecessors, (147), 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:39:05,997 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 17:39:05,997 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, 1] [2024-01-31 17:39:05,998 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-01-31 17:39:05,998 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P1Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 7 more)] === [2024-01-31 17:39:05,998 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 17:39:05,998 INFO L85 PathProgramCache]: Analyzing trace with hash 462679394, now seen corresponding path program 2 times [2024-01-31 17:39:05,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 17:39:05,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309779025] [2024-01-31 17:39:05,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 17:39:05,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 17:39:06,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 17:39:06,188 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:39:06,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 17:39:06,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309779025] [2024-01-31 17:39:06,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [309779025] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 17:39:06,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 17:39:06,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-01-31 17:39:06,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471372745] [2024-01-31 17:39:06,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 17:39:06,190 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-01-31 17:39:06,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 17:39:06,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-01-31 17:39:06,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-01-31 17:39:06,197 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 53 [2024-01-31 17:39:06,198 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 87 transitions, 654 flow. Second operand has 7 states, 7 states have (on average 25.0) internal successors, (175), 7 states have internal predecessors, (175), 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:39:06,198 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 17:39:06,199 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 53 [2024-01-31 17:39:06,199 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 17:39:08,886 INFO L124 PetriNetUnfolderBase]: 17246/24526 cut-off events. [2024-01-31 17:39:08,886 INFO L125 PetriNetUnfolderBase]: For 197929/202020 co-relation queries the response was YES. [2024-01-31 17:39:09,010 INFO L83 FinitePrefix]: Finished finitePrefix Result has 121234 conditions, 24526 events. 17246/24526 cut-off events. For 197929/202020 co-relation queries the response was YES. Maximal size of possible extension queue 1496. Compared 160343 event pairs, 1737 based on Foata normal form. 1014/23446 useless extension candidates. Maximal degree in co-relation 121209. Up to 9964 conditions per place. [2024-01-31 17:39:09,062 INFO L140 encePairwiseOnDemand]: 46/53 looper letters, 116 selfloop transitions, 18 changer transitions 6/163 dead transitions. [2024-01-31 17:39:09,062 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 163 transitions, 1536 flow [2024-01-31 17:39:09,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-01-31 17:39:09,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-01-31 17:39:09,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 246 transitions. [2024-01-31 17:39:09,064 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6630727762803235 [2024-01-31 17:39:09,064 INFO L175 Difference]: Start difference. First operand has 92 places, 87 transitions, 654 flow. Second operand 7 states and 246 transitions. [2024-01-31 17:39:09,064 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 163 transitions, 1536 flow [2024-01-31 17:39:09,457 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 163 transitions, 1479 flow, removed 14 selfloop flow, removed 5 redundant places. [2024-01-31 17:39:09,458 INFO L231 Difference]: Finished difference. Result has 93 places, 87 transitions, 666 flow [2024-01-31 17:39:09,458 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=603, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=666, PETRI_PLACES=93, PETRI_TRANSITIONS=87} [2024-01-31 17:39:09,459 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 32 predicate places. [2024-01-31 17:39:09,459 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 87 transitions, 666 flow [2024-01-31 17:39:09,459 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 25.0) internal successors, (175), 7 states have internal predecessors, (175), 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:39:09,459 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 17:39:09,459 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, 1, 1, 1, 1, 1, 1] [2024-01-31 17:39:09,459 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-01-31 17:39:09,460 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P1Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 7 more)] === [2024-01-31 17:39:09,460 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 17:39:09,460 INFO L85 PathProgramCache]: Analyzing trace with hash 1654708259, now seen corresponding path program 1 times [2024-01-31 17:39:09,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 17:39:09,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070013929] [2024-01-31 17:39:09,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 17:39:09,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 17:39:09,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 17:39:09,814 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:39:09,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 17:39:09,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070013929] [2024-01-31 17:39:09,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1070013929] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 17:39:09,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 17:39:09,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-01-31 17:39:09,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180452558] [2024-01-31 17:39:09,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 17:39:09,815 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-01-31 17:39:09,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 17:39:09,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-01-31 17:39:09,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-01-31 17:39:09,821 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 53 [2024-01-31 17:39:09,822 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 87 transitions, 666 flow. Second operand has 6 states, 6 states have (on average 24.666666666666668) internal successors, (148), 6 states have internal predecessors, (148), 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:39:09,822 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 17:39:09,822 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 53 [2024-01-31 17:39:09,822 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 17:39:12,199 INFO L124 PetriNetUnfolderBase]: 14242/24087 cut-off events. [2024-01-31 17:39:12,200 INFO L125 PetriNetUnfolderBase]: For 120984/125474 co-relation queries the response was YES. [2024-01-31 17:39:12,331 INFO L83 FinitePrefix]: Finished finitePrefix Result has 103137 conditions, 24087 events. 14242/24087 cut-off events. For 120984/125474 co-relation queries the response was YES. Maximal size of possible extension queue 1646. Compared 208014 event pairs, 2225 based on Foata normal form. 578/22352 useless extension candidates. Maximal degree in co-relation 103114. Up to 9173 conditions per place. [2024-01-31 17:39:12,376 INFO L140 encePairwiseOnDemand]: 48/53 looper letters, 83 selfloop transitions, 3 changer transitions 12/137 dead transitions. [2024-01-31 17:39:12,377 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 137 transitions, 1216 flow [2024-01-31 17:39:12,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-01-31 17:39:12,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-01-31 17:39:12,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 187 transitions. [2024-01-31 17:39:12,378 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5880503144654088 [2024-01-31 17:39:12,378 INFO L175 Difference]: Start difference. First operand has 93 places, 87 transitions, 666 flow. Second operand 6 states and 187 transitions. [2024-01-31 17:39:12,378 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 137 transitions, 1216 flow [2024-01-31 17:39:12,962 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 137 transitions, 973 flow, removed 110 selfloop flow, removed 8 redundant places. [2024-01-31 17:39:12,963 INFO L231 Difference]: Finished difference. Result has 94 places, 88 transitions, 550 flow [2024-01-31 17:39:12,963 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=527, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=550, PETRI_PLACES=94, PETRI_TRANSITIONS=88} [2024-01-31 17:39:12,964 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 33 predicate places. [2024-01-31 17:39:12,964 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 88 transitions, 550 flow [2024-01-31 17:39:12,964 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.666666666666668) internal successors, (148), 6 states have internal predecessors, (148), 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:39:12,964 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 17:39:12,964 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, 1, 1, 1, 1, 1, 1] [2024-01-31 17:39:12,964 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-01-31 17:39:12,964 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P1Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 7 more)] === [2024-01-31 17:39:12,965 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 17:39:12,965 INFO L85 PathProgramCache]: Analyzing trace with hash 704719505, now seen corresponding path program 2 times [2024-01-31 17:39:12,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 17:39:12,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346553469] [2024-01-31 17:39:12,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 17:39:12,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 17:39:12,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 17:39:13,107 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:39:13,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 17:39:13,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346553469] [2024-01-31 17:39:13,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1346553469] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 17:39:13,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 17:39:13,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-01-31 17:39:13,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352400182] [2024-01-31 17:39:13,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 17:39:13,108 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-01-31 17:39:13,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 17:39:13,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-01-31 17:39:13,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-01-31 17:39:13,114 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 53 [2024-01-31 17:39:13,115 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 88 transitions, 550 flow. Second operand has 5 states, 5 states have (on average 25.4) internal successors, (127), 5 states have internal predecessors, (127), 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:39:13,115 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 17:39:13,115 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 53 [2024-01-31 17:39:13,115 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 17:39:17,027 INFO L124 PetriNetUnfolderBase]: 22802/40391 cut-off events. [2024-01-31 17:39:17,027 INFO L125 PetriNetUnfolderBase]: For 77727/83108 co-relation queries the response was YES. [2024-01-31 17:39:17,507 INFO L83 FinitePrefix]: Finished finitePrefix Result has 131800 conditions, 40391 events. 22802/40391 cut-off events. For 77727/83108 co-relation queries the response was YES. Maximal size of possible extension queue 2962. Compared 392079 event pairs, 7101 based on Foata normal form. 638/37178 useless extension candidates. Maximal degree in co-relation 131777. Up to 15503 conditions per place. [2024-01-31 17:39:17,546 INFO L140 encePairwiseOnDemand]: 48/53 looper letters, 36 selfloop transitions, 2 changer transitions 48/121 dead transitions. [2024-01-31 17:39:17,547 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 121 transitions, 865 flow [2024-01-31 17:39:17,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-31 17:39:17,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-01-31 17:39:17,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 157 transitions. [2024-01-31 17:39:17,548 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5924528301886792 [2024-01-31 17:39:17,548 INFO L175 Difference]: Start difference. First operand has 94 places, 88 transitions, 550 flow. Second operand 5 states and 157 transitions. [2024-01-31 17:39:17,548 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 121 transitions, 865 flow [2024-01-31 17:39:19,849 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 121 transitions, 858 flow, removed 3 selfloop flow, removed 3 redundant places. [2024-01-31 17:39:19,851 INFO L231 Difference]: Finished difference. Result has 96 places, 64 transitions, 359 flow [2024-01-31 17:39:19,851 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=545, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=359, PETRI_PLACES=96, PETRI_TRANSITIONS=64} [2024-01-31 17:39:19,851 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 35 predicate places. [2024-01-31 17:39:19,851 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 64 transitions, 359 flow [2024-01-31 17:39:19,851 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 25.4) internal successors, (127), 5 states have internal predecessors, (127), 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:39:19,851 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 17:39:19,851 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, 1, 1, 1, 1, 1, 1] [2024-01-31 17:39:19,852 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-01-31 17:39:19,852 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P1Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 7 more)] === [2024-01-31 17:39:19,852 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 17:39:19,852 INFO L85 PathProgramCache]: Analyzing trace with hash -1474016431, now seen corresponding path program 3 times [2024-01-31 17:39:19,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 17:39:19,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307218014] [2024-01-31 17:39:19,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 17:39:19,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 17:39:19,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-01-31 17:39:19,894 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-01-31 17:39:19,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-01-31 17:39:19,974 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-01-31 17:39:19,976 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-01-31 17:39:19,978 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (9 of 10 remaining) [2024-01-31 17:39:19,979 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (8 of 10 remaining) [2024-01-31 17:39:19,980 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1ASSERT_VIOLATIONERROR_FUNCTION (7 of 10 remaining) [2024-01-31 17:39:19,980 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (6 of 10 remaining) [2024-01-31 17:39:19,980 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 10 remaining) [2024-01-31 17:39:19,980 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 10 remaining) [2024-01-31 17:39:19,980 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 10 remaining) [2024-01-31 17:39:19,981 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 10 remaining) [2024-01-31 17:39:19,981 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (1 of 10 remaining) [2024-01-31 17:39:19,981 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1ASSERT_VIOLATIONERROR_FUNCTION (0 of 10 remaining) [2024-01-31 17:39:19,981 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-01-31 17:39:19,982 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-31 17:39:19,987 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-01-31 17:39:19,987 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-01-31 17:39:20,098 INFO L503 ceAbstractionStarter]: Automizer considered 2 witness invariants [2024-01-31 17:39:20,098 INFO L504 ceAbstractionStarter]: WitnessConsidered=2 [2024-01-31 17:39:20,098 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.01 05:39:20 BasicIcfg [2024-01-31 17:39:20,099 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-01-31 17:39:20,099 INFO L158 Benchmark]: Toolchain (without parser) took 41814.03ms. Allocated memory was 308.3MB in the beginning and 13.4GB in the end (delta: 13.1GB). Free memory was 219.6MB in the beginning and 10.9GB in the end (delta: -10.7GB). Peak memory consumption was 2.4GB. Max. memory is 16.1GB. [2024-01-31 17:39:20,099 INFO L158 Benchmark]: Witness Parser took 0.54ms. Allocated memory is still 117.4MB. Free memory is still 77.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-01-31 17:39:20,099 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 155.2MB. Free memory is still 74.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-01-31 17:39:20,100 INFO L158 Benchmark]: CACSL2BoogieTranslator took 3204.23ms. Allocated memory was 308.3MB in the beginning and 440.4MB in the end (delta: 132.1MB). Free memory was 219.6MB in the beginning and 200.4MB in the end (delta: 19.2MB). Peak memory consumption was 195.0MB. Max. memory is 16.1GB. [2024-01-31 17:39:20,100 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.71ms. Allocated memory is still 440.4MB. Free memory was 200.4MB in the beginning and 197.3MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-01-31 17:39:20,100 INFO L158 Benchmark]: Boogie Preprocessor took 40.31ms. Allocated memory is still 440.4MB. Free memory was 197.3MB in the beginning and 194.1MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-01-31 17:39:20,100 INFO L158 Benchmark]: RCFGBuilder took 645.83ms. Allocated memory is still 440.4MB. Free memory was 194.1MB in the beginning and 135.4MB in the end (delta: 58.7MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. [2024-01-31 17:39:20,100 INFO L158 Benchmark]: TraceAbstraction took 37870.44ms. Allocated memory was 440.4MB in the beginning and 13.4GB in the end (delta: 12.9GB). Free memory was 135.4MB in the beginning and 10.9GB in the end (delta: -10.8GB). Peak memory consumption was 2.2GB. Max. memory is 16.1GB. [2024-01-31 17:39:20,102 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Witness Parser took 0.54ms. Allocated memory is still 117.4MB. Free memory is still 77.1MB. There was no memory consumed. Max. memory is 16.1GB. * CDTParser took 0.15ms. Allocated memory is still 155.2MB. Free memory is still 74.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 3204.23ms. Allocated memory was 308.3MB in the beginning and 440.4MB in the end (delta: 132.1MB). Free memory was 219.6MB in the beginning and 200.4MB in the end (delta: 19.2MB). Peak memory consumption was 195.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 47.71ms. Allocated memory is still 440.4MB. Free memory was 200.4MB in the beginning and 197.3MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 40.31ms. Allocated memory is still 440.4MB. Free memory was 197.3MB in the beginning and 194.1MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 645.83ms. Allocated memory is still 440.4MB. Free memory was 194.1MB in the beginning and 135.4MB in the end (delta: 58.7MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. * TraceAbstraction took 37870.44ms. Allocated memory was 440.4MB in the beginning and 13.4GB in the end (delta: 12.9GB). Free memory was 135.4MB in the beginning and 10.9GB in the end (delta: -10.8GB). Peak memory consumption was 2.2GB. 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: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p1_EAX = 0; [L714] 0 int __unbuffered_p3_EAX = 0; [L716] 0 int __unbuffered_p3_EBX = 0; [L718] 0 int a = 0; [L720] 0 int b = 0; [L721] 0 _Bool main$tmp_guard0; [L722] 0 _Bool main$tmp_guard1; [L724] 0 int x = 0; [L725] 0 _Bool x$flush_delayed; [L726] 0 int x$mem_tmp; [L727] 0 _Bool x$r_buff0_thd0; [L728] 0 _Bool x$r_buff0_thd1; [L729] 0 _Bool x$r_buff0_thd2; [L730] 0 _Bool x$r_buff0_thd3; [L731] 0 _Bool x$r_buff0_thd4; [L732] 0 _Bool x$r_buff1_thd0; [L733] 0 _Bool x$r_buff1_thd1; [L734] 0 _Bool x$r_buff1_thd2; [L735] 0 _Bool x$r_buff1_thd3; [L736] 0 _Bool x$r_buff1_thd4; [L737] 0 _Bool x$read_delayed; [L738] 0 int *x$read_delayed_var; [L739] 0 int x$w_buff0; [L740] 0 _Bool x$w_buff0_used; [L741] 0 int x$w_buff1; [L742] 0 _Bool x$w_buff1_used; [L744] 0 int y = 0; [L746] 0 int z = 0; [L747] 0 _Bool weak$$choice0; [L748] 0 _Bool weak$$choice2; [L856] 0 pthread_t t1185; [L857] FCALL, FORK 0 pthread_create(&t1185, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t1185={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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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] [L858] 0 pthread_t t1186; [L859] FCALL, FORK 0 pthread_create(&t1186, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t1185={5:0}, t1186={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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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] [L772] 2 x$w_buff1 = x$w_buff0 [L773] 2 x$w_buff0 = 2 [L774] 2 x$w_buff1_used = x$w_buff0_used [L775] 2 x$w_buff0_used = (_Bool)1 [L776] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L776] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L777] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L778] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L779] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L780] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L781] 2 x$r_buff1_thd4 = x$r_buff0_thd4 [L782] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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] [L785] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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] [L860] 0 pthread_t t1187; [L861] FCALL, FORK 0 pthread_create(&t1187, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t1185={5:0}, t1186={6:0}, t1187={7: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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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] [L802] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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] [L862] 0 pthread_t t1188; [L863] FCALL, FORK 0 pthread_create(&t1188, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t1185={5:0}, t1186={6:0}, t1187={7:0}, t1188={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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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] [L805] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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] [L822] 4 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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=2] [L825] 4 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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=2] [L828] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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=2] [L831] 4 __unbuffered_p3_EBX = b VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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=2] [L752] 1 b = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, 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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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=2] [L755] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, 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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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=2] [L758] 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) [L759] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L760] 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 [L761] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L762] 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=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, 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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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=2] [L788] 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) [L789] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L790] 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 [L791] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L792] 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=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, 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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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=2] [L765] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, 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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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=2] [L795] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, 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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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=2] [L808] 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) [L809] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L810] 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 [L811] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L812] 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=2, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, 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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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=2] [L815] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, 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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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=2] [L834] 4 x = x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L835] 4 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L836] 4 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used [L837] 4 x$r_buff0_thd4 = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L838] 4 x$r_buff1_thd4 = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, 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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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=2] [L841] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, 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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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=2] [L865] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t1185={5:0}, t1186={6:0}, t1187={7:0}, t1188={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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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=2] [L867] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L867] RET 0 assume_abort_if_not(main$tmp_guard0) [L869] 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) [L870] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L871] 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 [L872] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L873] 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=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t1185={5:0}, t1186={6:0}, t1187={7:0}, t1188={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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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=2] [L876] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L877] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L878] 0 x$flush_delayed = weak$$choice2 [L879] 0 x$mem_tmp = x [L880] 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) [L881] 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)) [L882] 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)) [L883] 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)) [L884] 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)) [L885] 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)) [L886] 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)) [L887] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L888] 0 x = x$flush_delayed ? x$mem_tmp : x [L889] 0 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t1185={5:0}, t1186={6:0}, t1187={7:0}, t1188={3:0}, weak$$choice2=1, 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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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=2] [L891] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=0, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, 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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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=2] [L18] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[expression],IntegerLiteral[0]]]] VAL [\old(expression)=0, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, 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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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=2] [L18] 0 reach_error() VAL [\old(expression)=0, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, 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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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=2] - 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: 859]: 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: 857]: 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: 863]: 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: 861]: 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 9 procedures, 89 locations, 10 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: 37.7s, OverallIterations: 16, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 33.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 894 SdHoareTripleChecker+Valid, 2.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 840 mSDsluCounter, 229 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 160 mSDsCounter, 86 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2130 IncrementalHoareTripleChecker+Invalid, 2216 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 86 mSolverCounterUnsat, 69 mSDtfsCounter, 2130 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 101 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=666occurred in iteration=13, InterpolantAutomatonStates: 88, 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.3s SatisfiabilityAnalysisTime, 2.9s InterpolantComputationTime, 402 NumberOfCodeBlocks, 402 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 348 ConstructedInterpolants, 0 QuantifiedInterpolants, 1577 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 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:39:20,138 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, 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